Searched refs:Dense (Results 1 – 8 of 8) sorted by relevance
122 DenseT Dense; variable146 return Dense[D.Prev].isTail(); in isHead()154 return &Dense[N.Prev] == &N; in isSingleton()162 return Dense.size() - 1; in addValue()179 Dense[Idx].Next = FreelistIdx; in makeTombstone()260 return SMS->Dense[Idx].Data;337 return Dense.size() - NumFree; in size()344 Dense.clear(); in clear()361 if (Idx == FoundIdx && Dense[i].isValid() && isHead(Dense[i])) in findIndex()514 Dense[N.Next].Prev = N.Prev; in unlink()[all …]
131 DenseT Dense;176 iterator begin() { return Dense.begin(); }177 iterator end() { return Dense.end(); }183 bool empty() const { return Dense.empty(); }190 size_type size() const { return Dense.size(); }196 Dense.clear();258 Dense.push_back(Val);271 return Dense.pop_back_val();291 *I = Dense.back();292 unsigned BackIdx = ValIndexOf(Dense.back());[all …]
9 // Register info specific to Power PC Dense Math Registers(DMR).11 // Register classes in this file are related to the Dense Math Registers (DMR).
121 Dense = 1 // 512 element packed mode. enumerator
182 assert(getTypePacking(DataVT) == Packing::Dense && in splitPackedLoadStore()256 getLegalVectorType(Packing::Dense, DataVT.getVectorElementType()); in splitPackedLoadStore()
41 return isPackedVectorType(VT) ? Packing::Dense : Packing::Normal; in getTypePacking()
2607 unsigned NewDenseSize = Dense.size(); in filterAndAdd()2618 if (Dense.count(Reg)) in filterAndAdd()2632 Dense.reserve(NewDenseSize); in filterAndAdd()2639 Dense.insert(Reg); in filterAndAdd()2656 DenseSet<unsigned> Dense; member
3573 const CongruenceClass &Dense, SmallVectorImpl<ValueDFS> &DFSOrderedSet, in convertClassToDFSOrdered() argument3576 for (auto *D : Dense) { in convertClassToDFSOrdered()3664 const CongruenceClass &Dense, in convertClassToLoadsAndStores() argument3666 for (auto *D : Dense) { in convertClassToLoadsAndStores()