/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | DeclContextInternals.h | 87 if (DeclsTy *Vec = getAsVector()) 88 Data = DeclsAndHasExternalTy(Vec, true); 115 DeclsTy &Vec = *getAsVector(); local 116 DeclsTy::iterator I = llvm::find(Vec, D); 117 assert(I != Vec.end() && "list does not contain decl"); 118 Vec.erase(I); 120 assert(llvm::find(Vec, D) == Vec.end() && "list still contains decl"); 132 DeclsTy &Vec = *getAsVector(); local 133 Vec 174 DeclsTy &Vec = *getAsVector(); local 200 DeclsTy &Vec = *getAsVector(); local [all...] |
H A D | APValue.h | 245 struct Vec { struct in class:clang::APValue 248 Vec() : Elts(nullptr), NumElts(0) {} function in struct:clang::APValue::Vec 249 ~Vec() { delete[] Elts; } 278 ComplexAPFloat, Vec, Arr, StructData, 457 return ((Vec*)(char*)Data.buffer)->Elts[I]; 464 return ((const Vec*)(const void *)Data.buffer)->NumElts; 557 ((Vec*)(char*)Data.buffer)->Elts = new APValue[N]; 558 ((Vec*)(char*)Data.buffer)->NumElts = N; 560 ((Vec*)(char*)Data.buffer)->Elts[i] = E[i]; 617 new ((void*)(char*)Data.buffer) Vec(); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/ |
H A D | StringTableBuilder.cpp | 89 static void multikeySort(MutableArrayRef<StringPair *> Vec, int Pos) { argument 91 if (Vec.size() <= 1) 95 // [I, J) are the same as the pivot, and [J, Vec.size()) are less than 97 int Pivot = charTailAt(Vec[0], Pos); 99 size_t J = Vec.size(); 101 int C = charTailAt(Vec[K], Pos); 103 std::swap(Vec[I++], Vec[K++]); 105 std::swap(Vec[--J], Vec[ [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | ArrayRef.h | 81 /*implicit*/ ArrayRef(const SmallVectorTemplateCommon<T, U> &Vec) argument 82 : Data(Vec.data()), Length(Vec.size()) { 87 /*implicit*/ ArrayRef(const std::vector<T, A> &Vec) argument 88 : Data(Vec.data()), Length(Vec.size()) {} 107 /*implicit*/ ArrayRef(const std::initializer_list<T> &Vec) argument 108 : Data(Vec.begin() == Vec.end() ? (T*)nullptr : Vec 127 ArrayRef( const SmallVectorTemplateCommon<U *, DummyT> &Vec, typename std::enable_if< std::is_convertible<U *const *, T const *>::value>::type * = nullptr) argument 137 ArrayRef(const std::vector<U *, A> &Vec, typename std::enable_if< std::is_convertible<U *const *, T const *>::value>::type* = 0) argument 478 makeArrayRef(const SmallVectorImpl<T> &Vec) argument 484 makeArrayRef(const SmallVector<T, N> &Vec) argument 490 makeArrayRef(const std::vector<T> &Vec) argument 501 makeArrayRef(const ArrayRef<T> &Vec) argument 506 makeArrayRef(ArrayRef<T> &Vec) argument [all...] |
H A D | PackedVector.h | 83 PackedVector &Vec; member in class:llvm::PackedVector::reference 88 reference(PackedVector &vec, unsigned idx) : Vec(vec), Idx(idx) {} 91 Vec.setValue(Vec.Bits, Idx, val); 96 return Vec.getValue(Vec.Bits, Idx);
|
H A D | TinyPtrVector.h | 167 if (VecTy *Vec = Val.template dyn_cast<VecTy*>()) 168 return Vec->empty(); 267 else if (VecTy *Vec = Val.template get<VecTy*>()) 268 Vec->pop_back(); 275 } else if (VecTy *Vec = Val.template dyn_cast<VecTy*>()) { 277 Vec->clear(); 290 } else if (VecTy *Vec = Val.template dyn_cast<VecTy*>()) { 293 return Vec->erase(I); 306 } else if (VecTy *Vec = Val.template dyn_cast<VecTy*>()) { 307 return Vec [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
H A D | HashTable.cpp | 47 SparseBitVector<> &Vec) { 50 int ReqBits = Vec.find_last() + 1; 62 if (Vec.test(Idx)) 46 writeSparseBitVector(BinaryStreamWriter &Writer, SparseBitVector<> &Vec) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ExpandReductions.cpp | 124 Value *Vec = II->getArgOperand(1); local 126 Rdx = getOrderedReduction(Builder, Acc, Vec, getOpcode(ID), MRK); 128 if (!isPowerOf2_32(Vec->getType()->getVectorNumElements())) 131 Rdx = getShuffleReduction(Builder, Vec, getOpcode(ID), MRK); 148 Value *Vec = II->getArgOperand(0); local 149 if (!isPowerOf2_32(Vec->getType()->getVectorNumElements())) 152 Rdx = getShuffleReduction(Builder, Vec, getOpcode(ID), MRK);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86InterleavedAccess.cpp | 285 ArrayRef<Value *> Vec, ArrayRef<uint32_t> VPShuf, 292 Vec[i], UndefValue::get(Vec[i]->getType()), VPShuf); 303 Vec[i % Stride], Vec[(i + 1) % Stride], OptimizeShuf); 507 // Invec[0] - |0| Vec[0] - |0| 508 // Invec[1] - |1| => Vec[1] - |1| 509 // Invec[2] - |2| Vec[2] - |2| 512 // Invec[0] - |0|1| Vec[0] - |0|3| 513 // Invec[1] - |2|3| => Vec[ 284 reorderSubVector(MVT VT, SmallVectorImpl<Value *> &TransposedMatrix, ArrayRef<Value *> Vec, ArrayRef<uint32_t> VPShuf, unsigned VecElems, unsigned Stride, IRBuilder<> Builder) argument 521 concatSubVector(Value **Vec, ArrayRef<Instruction *> InVec, unsigned VecElems, IRBuilder<> Builder) argument 555 Value *Vec[6], *TempVector[3]; local 642 Value *Vec[3], *TempVector[3]; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/MCTargetDesc/ |
H A D | ARMUnwindOpAsm.cpp | 26 /// be placed in Vec[3], and the following bytes will be placed in 2, 1, 0, 30 SmallVectorImpl<uint8_t> &Vec; member in class:__anon2183::UnwindOpcodeStreamer 34 UnwindOpcodeStreamer(SmallVectorImpl<uint8_t> &V) : Vec(V) {} 38 Vec[Pos] = elem; 59 while (Pos < Vec.size())
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | PoisonChecking.cpp | 197 Value *Vec = I.getOperand(0); local 198 if (Vec->getType()->getVectorIsScalable()) 201 unsigned NumElts = Vec->getType()->getVectorNumElements(); 209 Value *Vec = I.getOperand(0); local 210 if (Vec->getType()->getVectorIsScalable()) 213 unsigned NumElts = Vec->getType()->getVectorNumElements();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
H A D | LegalizerInfo.cpp | 565 LegalizerInfo::findAction(const SizeAndActionsVec &Vec, const uint32_t Size) { argument 567 // Find the last element in Vec that has a bitsize equal to or smaller than 571 Vec, [=](const SizeAndAction &A) { return A.first <= Size; }); 572 assert(It != Vec.begin() && "Does Vec not start with size 1?"); 573 int VecIdx = It - Vec.begin() - 1; 575 LegalizeAction Action = Vec[VecIdx].second; 585 if (Vec == SizeAndActionsVec({{1, FewerElements}})) 597 if (!needsLegalizingToDifferentSize(Vec[i].second) && 598 Vec[ 639 const SizeAndActionsVec &Vec = Actions[Aspect.Idx]; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | Twine.cpp | 28 SmallString<256> Vec; 29 return toStringRef(Vec).str();
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | TargetFolder.h | 245 Constant *CreateExtractElement(Constant *Vec, Constant *Idx) const { argument 246 return Fold(ConstantExpr::getExtractElement(Vec, Idx)); 249 Constant *CreateInsertElement(Constant *Vec, Constant *NewElt, argument 251 return Fold(ConstantExpr::getInsertElement(Vec, NewElt, Idx));
|
H A D | InstructionSimplify.h | 217 Value *SimplifyInsertElementInst(Value *Vec, Value *Elt, Value *Idx, 225 Value *SimplifyExtractElementInst(Value *Vec, Value *Idx,
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | ConstantFolder.h | 253 Constant *CreateExtractElement(Constant *Vec, Constant *Idx) const { argument 254 return ConstantExpr::getExtractElement(Vec, Idx); 257 Constant *CreateInsertElement(Constant *Vec, Constant *NewElt, argument 259 return ConstantExpr::getInsertElement(Vec, NewElt, Idx);
|
H A D | LegacyPassManagers.h | 260 auto ProfileVec = [&](const SmallVectorImpl<AnalysisID>& Vec) { 261 ID.AddInteger(Vec.size()); 262 for(AnalysisID AID : Vec)
|
H A D | NoFolder.h | 318 Instruction *CreateExtractElement(Constant *Vec, Constant *Idx) const { argument 319 return ExtractElementInst::Create(Vec, Idx); 322 Instruction *CreateInsertElement(Constant *Vec, Constant *NewElt, argument 324 return InsertElementInst::Create(Vec, NewElt, Idx);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFGdbIndex.cpp | 183 auto &Vec = ConstantPoolVectors.back(); local 184 Vec.first = Offset - ConstantPoolOffset; 188 Vec.second.push_back(Data.getU32(&Offset));
|
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenRegisters.h | 260 typedef std::vector<const CodeGenRegister*> Vec; typedef in struct:llvm::CodeGenRegister 293 CodeGenRegister::Vec Members; 435 const CodeGenRegister::Vec &getMembers() const { return Members; } 450 const CodeGenRegister::Vec *Members; 453 Key(const CodeGenRegister::Vec *M, const RegSizeInfoByHwMode &I) 577 const CodeGenRegister::Vec *Membs,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelLoweringHVX.cpp | 250 HexagonTargetLowering::opCastElem(SDValue Vec, MVT ElemTy, argument 252 if (ty(Vec).getVectorElementType() == ElemTy) 253 return Vec; 254 MVT CastTy = tyVector(Vec.getValueType().getSimpleVT(), ElemTy); 255 return DAG.getBitcast(CastTy, Vec); 266 HexagonTargetLowering::opSplit(SDValue Vec, const SDLoc &dl, argument 268 TypePair Tys = typeSplit(ty(Vec)); 269 if (Vec.getOpcode() == HexagonISD::QCAT) 270 return VectorPair(Vec.getOperand(0), Vec 580 SDValue Vec = ZeroFill ? getZero(dl, ByteTy, DAG) : DAG.getUNDEF(ByteTy); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | AMDGPUTargetTransformInfo.h | 255 unsigned getHardwareNumberOfRegisters(bool Vec) const; 256 unsigned getNumberOfRegisters(bool Vec) const;
|
H A D | AMDGPUTargetTransformInfo.cpp | 216 unsigned GCNTTIImpl::getHardwareNumberOfRegisters(bool Vec) const { 222 unsigned GCNTTIImpl::getNumberOfRegisters(bool Vec) const { 225 return getHardwareNumberOfRegisters(Vec) >> 3; 871 unsigned R600TTIImpl::getHardwareNumberOfRegisters(bool Vec) const { 875 unsigned R600TTIImpl::getNumberOfRegisters(bool Vec) const { 876 return getHardwareNumberOfRegisters(Vec);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | AnalysisDeclContext.cpp | 630 void *&Vec, 632 if (Vec) 633 return (DeclVec*) Vec; 648 Vec = BV; 629 LazyInitializeReferencedDecls(const BlockDecl *BD, void *&Vec, llvm::BumpPtrAllocator &A) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.cpp | 434 SmallVectorImpl<DependencyEdge> &Vec = NodeFrom.OutgoingEdges; 436 auto It = find_if(Vec, [To, Dep](DependencyEdge &DE) { 440 if (It != Vec.end()) { 447 Vec.emplace_back(DE);
|