|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
gen/lib/Target/AArch64/AArch64GenSystemOperands.inc 1509 return Idx >= Table.size() ? nullptr : &ExactFPImmsList[Table[Idx]._index];
4967 return Idx >= Table.size() ? nullptr : &TSBsList[Table[Idx]._index];
gen/lib/Target/AMDGPU/AMDGPUGenSearchableTables.inc 709 return Idx >= Table.size() ? nullptr : &Table[Idx];
734 return Idx >= Table.size() ? nullptr : &Table[Idx];
790 return Idx >= Table.size() ? nullptr : &MIMGDimInfoTable[Table[Idx]._index];
include/llvm/ADT/ArrayRef.h 111 : Data(A.data()), Length(A.size()) {}
179 assert(N+M <= size() && "Invalid specifier");
184 ArrayRef<T> slice(size_t N) const { return slice(N, size() - N); }
188 assert(size() >= N && "Dropping more elements than exist");
189 return slice(N, size() - N);
194 assert(size() >= N && "Dropping more elements than exist");
195 return slice(0, size() - N);
212 if (N >= size())
214 return drop_back(size() - N);
219 if (N >= size())
221 return drop_front(size() - N);
331 iterator end() const { return data() + this->size(); }
345 return data()[this->size()-1];
351 assert(N + M <= this->size() && "Invalid specifier");
357 return slice(N, this->size() - N);
362 assert(this->size() >= N && "Dropping more elements than exist");
363 return slice(N, this->size() - N);
367 assert(this->size() >= N && "Dropping more elements than exist");
368 return slice(0, this->size() - N);
387 if (N >= this->size())
389 return drop_back(this->size() - N);
394 if (N >= this->size())
396 return drop_front(this->size() - N);
417 assert(Index < this->size() && "Invalid index!");
429 : MutableArrayRef<T>(new T[Data.size()], Data.size()) {
429 : MutableArrayRef<T>(new T[Data.size()], Data.size()) {
include/llvm/ADT/BitVector.h 373 unsigned OldCapacity = Bits.size();
824 std::memmove(Dest.begin(), Src.begin(), Dest.size() * sizeof(BitWord));
840 assert(Dest.size() == Src.size());
840 assert(Dest.size() == Src.size());
842 std::memmove(Dest.begin(), Src.begin(), Dest.size() * sizeof(BitWord));
865 if (Bits.size() > UsedWords)
885 size_t NewCapacity = std::max<size_t>(NumBitWords(NewSize), Bits.size() * 2);
894 if (B.size() > 0)
895 memset(B.data(), 0 - (int)t, B.size() * sizeof(BitWord));
927 size_t getMemorySize() const { return Bits.size() * sizeof(BitWord); }
928 size_t getBitCapacity() const { return Bits.size() * BITWORD_SIZE; }
include/llvm/ADT/StringExtras.h 56 return StringRef(reinterpret_cast<const char *>(Input.begin()), Input.size());
include/llvm/ADT/TinyPtrVector.h 127 : Elts.size() == 1
include/llvm/ADT/edit_distance.h 57 typename ArrayRef<T>::size_type m = FromArray.size();
58 typename ArrayRef<T>::size_type n = ToArray.size();
include/llvm/Analysis/LoopInfoImpl.h 385 for (unsigned i = 0; i < getBlocks().size(); ++i) {
include/llvm/Analysis/TargetTransformInfoImpl.h 109 for (unsigned Idx = 0, Size = Operands.size(); Idx != Size; ++Idx)
726 return static_cast<T *>(this)->getCallCost(F, Arguments.size(), U);
839 ParamTys.reserve(Arguments.size());
840 for (unsigned Idx = 0, Size = Arguments.size(); Idx != Size; ++Idx)
include/llvm/BinaryFormat/MachO.def 15 HANDLE_LOAD_COMMAND(LC_SEGMENT, 0x00000001u, segment_command)
16 HANDLE_LOAD_COMMAND(LC_SYMTAB, 0x00000002u, symtab_command)
18 HANDLE_LOAD_COMMAND(LC_SYMSEG, 0x00000003u, symseg_command)
19 HANDLE_LOAD_COMMAND(LC_THREAD, 0x00000004u, thread_command)
20 HANDLE_LOAD_COMMAND(LC_UNIXTHREAD, 0x00000005u, thread_command)
22 HANDLE_LOAD_COMMAND(LC_LOADFVMLIB, 0x00000006u, fvmlib_command)
24 HANDLE_LOAD_COMMAND(LC_IDFVMLIB, 0x00000007u, fvmlib_command)
26 HANDLE_LOAD_COMMAND(LC_IDENT, 0x00000008u, ident_command)
28 HANDLE_LOAD_COMMAND(LC_FVMFILE, 0x00000009u, fvmfile_command)
30 HANDLE_LOAD_COMMAND(LC_PREPAGE, 0x0000000Au, load_command)
31 HANDLE_LOAD_COMMAND(LC_DYSYMTAB, 0x0000000Bu, dysymtab_command)
32 HANDLE_LOAD_COMMAND(LC_LOAD_DYLIB, 0x0000000Cu, dylib_command)
33 HANDLE_LOAD_COMMAND(LC_ID_DYLIB, 0x0000000Du, dylib_command)
34 HANDLE_LOAD_COMMAND(LC_LOAD_DYLINKER, 0x0000000Eu, dylinker_command)
35 HANDLE_LOAD_COMMAND(LC_ID_DYLINKER, 0x0000000Fu, dylinker_command)
37 HANDLE_LOAD_COMMAND(LC_PREBOUND_DYLIB, 0x00000010u, prebound_dylib_command)
38 HANDLE_LOAD_COMMAND(LC_ROUTINES, 0x00000011u, routines_command)
39 HANDLE_LOAD_COMMAND(LC_SUB_FRAMEWORK, 0x00000012u, sub_framework_command)
40 HANDLE_LOAD_COMMAND(LC_SUB_UMBRELLA, 0x00000013u, sub_umbrella_command)
41 HANDLE_LOAD_COMMAND(LC_SUB_CLIENT, 0x00000014u, sub_client_command)
42 HANDLE_LOAD_COMMAND(LC_SUB_LIBRARY, 0x00000015u, sub_library_command)
44 HANDLE_LOAD_COMMAND(LC_TWOLEVEL_HINTS, 0x00000016u, twolevel_hints_command)
46 HANDLE_LOAD_COMMAND(LC_PREBIND_CKSUM, 0x00000017u, prebind_cksum_command)
48 HANDLE_LOAD_COMMAND(LC_LOAD_WEAK_DYLIB, 0x80000018u, dylib_command)
49 HANDLE_LOAD_COMMAND(LC_SEGMENT_64, 0x00000019u, segment_command_64)
50 HANDLE_LOAD_COMMAND(LC_ROUTINES_64, 0x0000001Au, routines_command_64)
51 HANDLE_LOAD_COMMAND(LC_UUID, 0x0000001Bu, uuid_command)
52 HANDLE_LOAD_COMMAND(LC_RPATH, 0x8000001Cu, rpath_command)
53 HANDLE_LOAD_COMMAND(LC_CODE_SIGNATURE, 0x0000001Du, linkedit_data_command)
54 HANDLE_LOAD_COMMAND(LC_SEGMENT_SPLIT_INFO, 0x0000001Eu, linkedit_data_command)
55 HANDLE_LOAD_COMMAND(LC_REEXPORT_DYLIB, 0x8000001Fu, dylib_command)
56 HANDLE_LOAD_COMMAND(LC_LAZY_LOAD_DYLIB, 0x00000020u, dylib_command)
57 HANDLE_LOAD_COMMAND(LC_ENCRYPTION_INFO, 0x00000021u, encryption_info_command)
58 HANDLE_LOAD_COMMAND(LC_DYLD_INFO, 0x00000022u, dyld_info_command)
59 HANDLE_LOAD_COMMAND(LC_DYLD_INFO_ONLY, 0x80000022u, dyld_info_command)
60 HANDLE_LOAD_COMMAND(LC_LOAD_UPWARD_DYLIB, 0x80000023u, dylib_command)
61 HANDLE_LOAD_COMMAND(LC_VERSION_MIN_MACOSX, 0x00000024u, version_min_command)
62 HANDLE_LOAD_COMMAND(LC_VERSION_MIN_IPHONEOS, 0x00000025u, version_min_command)
63 HANDLE_LOAD_COMMAND(LC_FUNCTION_STARTS, 0x00000026u, linkedit_data_command)
64 HANDLE_LOAD_COMMAND(LC_DYLD_ENVIRONMENT, 0x00000027u, dylinker_command)
65 HANDLE_LOAD_COMMAND(LC_MAIN, 0x80000028u, entry_point_command)
66 HANDLE_LOAD_COMMAND(LC_DATA_IN_CODE, 0x00000029u, linkedit_data_command)
67 HANDLE_LOAD_COMMAND(LC_SOURCE_VERSION, 0x0000002Au, source_version_command)
68 HANDLE_LOAD_COMMAND(LC_DYLIB_CODE_SIGN_DRS, 0x0000002Bu, linkedit_data_command)
69 HANDLE_LOAD_COMMAND(LC_ENCRYPTION_INFO_64, 0x0000002Cu,
71 HANDLE_LOAD_COMMAND(LC_LINKER_OPTION, 0x0000002Du, linker_option_command)
72 HANDLE_LOAD_COMMAND(LC_LINKER_OPTIMIZATION_HINT, 0x0000002Eu, linkedit_data_command)
73 HANDLE_LOAD_COMMAND(LC_VERSION_MIN_TVOS, 0x0000002Fu, version_min_command)
74 HANDLE_LOAD_COMMAND(LC_VERSION_MIN_WATCHOS, 0x00000030u, version_min_command)
75 HANDLE_LOAD_COMMAND(LC_NOTE, 0x00000031u, note_command)
76 HANDLE_LOAD_COMMAND(LC_BUILD_VERSION, 0x00000032u, build_version_command)
include/llvm/Bitcode/BitcodeReader.h 87 return StringRef((const char *)Buffer.begin(), Buffer.size());
include/llvm/Bitstream/BitstreamReader.h 112 return pos <= BitcodeBytes.size();
116 return BitsInCurWord == 0 && BitcodeBytes.size() <= NextChar;
164 if (NextChar >= BitcodeBytes.size())
167 NextChar, BitcodeBytes.size());
172 if (BitcodeBytes.size() >= NextChar + sizeof(word_t)) {
179 BytesRead = BitcodeBytes.size() - NextChar;
298 size_t SizeInBytes() const { return BitcodeBytes.size(); }
301 void skipToEnd() { NextChar = BitcodeBytes.size(); }
include/llvm/Bitstream/BitstreamWriter.h 325 assert(RecordIdx < Vals.size() && "Invalid abbrev/record");
336 assert(RecordIdx == Vals.size() &&
349 EmitVBR(static_cast<uint32_t>(Vals.size()-RecordIdx), 6);
352 for (unsigned e = Vals.size(); RecordIdx != e; ++RecordIdx)
360 assert(RecordIdx == Vals.size() &&
371 assert(RecordIdx < Vals.size() && "Invalid abbrev/record");
376 assert(RecordIdx == Vals.size() && "Not all record operands emitted!");
387 EmitVBR(static_cast<uint32_t>(Bytes.size()), 6);
414 auto Count = static_cast<uint32_t>(makeArrayRef(Vals).size());
include/llvm/CodeGen/BasicTTIImpl.h 983 assert(Indices.size() <= Factor &&
1000 Cost += Indices.size() * InsSubCost;
1188 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
1512 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
1520 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
include/llvm/CodeGen/CallingConvLower.h 345 for (unsigned i = 0; i < Regs.size(); ++i)
348 return Regs.size();
373 if (FirstUnalloc == Regs.size())
386 if (RegsRequired > Regs.size())
389 for (unsigned StartIdx = 0; StartIdx <= Regs.size() - RegsRequired;
414 if (FirstUnalloc == Regs.size())
451 for (unsigned i = 0; i < ShadowRegs.size(); ++i)
include/llvm/CodeGen/GlobalISel/ConstantFoldingMIRBuilder.h 47 assert(DstOps.size() == 1 && "Invalid dst ops");
48 assert(SrcOps.size() == 2 && "Invalid src ops");
58 assert(DstOps.size() == 1 && "Invalid dst ops");
59 assert(SrcOps.size() == 2 && "Invalid src ops");
include/llvm/CodeGen/GlobalISel/IRTranslator.h 566 assert(Regs.size() == 1 &&
include/llvm/CodeGen/MachineInstr.h 151 MMOs.size(), HasPreInstrSymbol + HasPostInstrSymbol,
154 ExtraInfo(MMOs.size(), HasPreInstrSymbol, HasPostInstrSymbol,
582 bool hasOneMemOperand() const { return memoperands().size() == 1; }
585 unsigned getNumMemOperands() const { return memoperands().size(); }
include/llvm/CodeGen/SelectionDAGNodes.h 1556 unsigned NumElems = Mask.size();
include/llvm/DebugInfo/CodeView/CVRecord.h 41 uint32_t length() const { return RecordData.size(); }
44 if (RecordData.size() < sizeof(RecordPrefix))
54 RecordData.size());
74 if (StreamBuffer.size() < sizeof(RecordPrefix))
81 if (StreamBuffer.size() < RealLen)
include/llvm/DebugInfo/CodeView/SymbolRecord.h 322 Result.Bytes = Data.take_front(Data.size() - Next.size());
322 Result.Bytes = Data.take_front(Data.size() - Next.size());
include/llvm/DebugInfo/CodeView/TypeHashing.h 82 assert(H.size() == 8);
include/llvm/DebugInfo/CodeView/TypeRecord.h 573 uint32_t getEntryCount() const { return getSlots().size(); }
include/llvm/DebugInfo/GSYM/GsymReader.h 129 if (Index < Files.size())
147 AddrOffsets.size()/sizeof(T));
165 if (Index < AIO.size())
include/llvm/DebugInfo/PDB/Native/GSIStreamBuilder.h 27 return Item.RecordData.size();
include/llvm/IR/Constants.h 704 return getRaw(StringRef(Data, Elts.size() * sizeof(ElementTy)), Elts.size(),
704 return getRaw(StringRef(Data, Elts.size() * sizeof(ElementTy)), Elts.size(),
1159 Ty, C, makeArrayRef((Value * const *)IdxList.data(), IdxList.size()),
include/llvm/IR/IRBuilder.h 1304 for (unsigned i = 1; i < Ops.size(); i++)
1330 for (unsigned i = 1; i < Ops.size(); i++)
1562 assert(Ops.size() == 2 && "Invalid number of operands!");
1567 assert(Ops.size() == 1 && "Invalid number of operands!");
1702 for (i = 0, e = IdxList.size(); i != e; ++i)
1721 for (i = 0, e = IdxList.size(); i != e; ++i)
include/llvm/IR/Instructions.h 911 unsigned Values = 1 + unsigned(IdxList.size());
927 unsigned Values = 1 + unsigned(IdxList.size());
1451 return new (ComputeNumOperands(Args.size()))
1460 ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
1461 const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);
1474 return new (ComputeNumOperands(Args.size()))
1482 ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
1483 const unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);
1692 (Args.size() + CountBundleInputs(Bundles) + 1),
1693 unsigned(Args.size() + CountBundleInputs(Bundles) + 1),
1703 (Args.size() + CountBundleInputs(Bundles) + 1),
1704 unsigned(Args.size() + CountBundleInputs(Bundles) + 1),
3704 int NumOperands = ComputeNumOperands(Args.size());
3716 ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
3717 unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);
3727 int NumOperands = ComputeNumOperands(Args.size());
3738 ComputeNumOperands(Args.size(), CountBundleInputs(Bundles));
3739 unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);
3965 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size());
3965 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size());
3978 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(),
3978 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(),
3980 unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);
3992 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size());
3992 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size());
4004 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(),
4004 int NumOperands = ComputeNumOperands(Args.size(), IndirectDests.size(),
4006 unsigned DescriptorBytes = Bundles.size() * sizeof(BundleOpInfo);
4410 unsigned Values = 1 + Args.size();
4417 unsigned Values = 1 + Args.size();
4451 unsigned Values = 1 + Args.size();
4458 unsigned Values = 1 + Args.size();
include/llvm/IR/ModuleSummaryIndex.h 1002 if (!V.getSummaryList().size())
1378 if (!N.getSummaryList().size()) // handle external function
1388 if (!N.getSummaryList().size()) // handle external function
1398 if (!N.getSummaryList().size()) // handle external function
1407 if (!N.getSummaryList().size()) // handle external function
include/llvm/MCA/CodeEmitter.h 61 Encodings(S.size()) {}
include/llvm/MCA/SourceMgr.h 40 unsigned size() const { return Sequence.size(); }
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); }
46 return SourceRef(Current, *Sequence[Current % Sequence.size()]);
include/llvm/Object/ELF.h 312 if (Index >= Sections.size())
324 if (Index >= ShndxTable.size())
328 Twine(ShndxTable.size()));
382 if (Index >= Symbols.size())
487 if (Index >= Sections.size())
612 return StringRef(Data.begin(), Data.size());
645 if (V.size() != Syms)
646 return createError("SHT_SYMTAB_SHNDX has " + Twine(V.size()) +
include/llvm/Object/ELFObjectFile.h 380 if (Contents[0] != ARMBuildAttrs::Format_Version || Contents.size() == 1)
include/llvm/Object/IRSymtab.h 269 size_t getNumModules() const { return Modules.size(); }
284 ComdatTable.reserve(Comdats.size());
296 Specifiers.reserve(DependentLibraries.size());
include/llvm/Object/Minidump.h 112 assert(Storage.size() % Stride == 0);
116 return Storage.size() == R.Storage.size();
116 return Storage.size() == R.Storage.size();
120 assert(Storage.size() >= sizeof(minidump::MemoryInfo));
192 if (Stream->size() >= sizeof(T))
include/llvm/Object/ObjectFile.h 453 return StringRef(reinterpret_cast<const char *>(Res->data()), Res->size());
include/llvm/ObjectYAML/CodeViewYAMLTypeHashing.h 37 assert(S.size() == 8 && "Invalid hash size!");
include/llvm/ObjectYAML/MinidumpYAML.h 154 Size(Content.size()) {}
include/llvm/ObjectYAML/YAML.h 82 return Data.size() / 2;
83 return Data.size();
include/llvm/ProfileData/InstrProf.h 797 const_cast<InstrProfValueSiteRecord *>(AR.data()), AR.size());
877 return getValueSitesForKind(ValueKind).size();
include/llvm/Support/BinaryByteStream.h 57 uint32_t getLength() override { return Data.size(); }
63 return StringRef(CharData, Data.size());
116 if (auto EC = checkOffsetForWrite(Offset, Buffer.size()))
120 ::memcpy(DataPtr + Offset, Buffer.data(), Buffer.size());
150 if (auto EC = checkOffsetForWrite(Offset, Buffer.size()))
185 uint32_t RequiredSize = Offset + Buffer.size();
189 ::memcpy(Data.data() + Offset, Buffer.data(), Buffer.size());
include/llvm/Support/BinaryItemStream.h 76 ItemEndOffsets.reserve(Items.size());
94 assert(Idx < Items.size() && "binary search for offset failed");
include/llvm/Support/BinaryStreamWriter.h 154 if (Array.size() > UINT32_MAX / sizeof(T))
160 Array.size() * sizeof(T)));
include/llvm/Support/CFGUpdate.h 72 Operations.reserve(AllUpdates.size());
99 for (size_t i = 0, e = AllUpdates.size(); i != e; ++i) {
include/llvm/Support/DataExtractor.h 88 Data.size())),
include/llvm/Support/GenericDomTreeConstruction.h 1156 const size_t NumUpdates = Updates.size();
include/llvm/Support/ScopedPrinter.h 283 Value.size());
293 Value.size());
include/llvm/TableGen/Record.h 776 assert(Operands.size() == 1 &&
831 assert(Operands.size() == 2 &&
886 assert(Operands.size() == 3 &&
include/llvm/Transforms/InstCombine/InstCombineWorklist.h 57 Worklist.reserve(List.size()+16);
58 WorklistMap.reserve(List.size());
59 LLVM_DEBUG(dbgs() << "IC: ADDING: " << List.size()
lib/Analysis/ConstantFolding.cpp 772 for (unsigned i = 1, e = Ops.size(); i != e; ++i) {
844 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
849 if (Ops.size() == 2 && ResElemTy->isIntegerTy(8)) {
871 makeArrayRef((Value * const *)Ops.data() + 1, Ops.size() - 1)));
1050 return ConstantFoldCall(Call, F, Ops.slice(0, Ops.size() - 1), TLI);
1690 assert(Operands.size() == 1 && "Wrong number of operands.");
2029 assert(Operands.size() == 2 && "Wrong number of operands.");
2282 assert(Operands.size() == 3 && "Wrong number of operands.");
2377 if (Operands.size() == 1)
2380 if (Operands.size() == 2)
2383 if (Operands.size() == 3)
2397 SmallVector<Constant *, 4> Lane(Operands.size());
2441 for (unsigned J = 0, JE = Operands.size(); J != JE; ++J) {
lib/Analysis/InstructionSimplify.cpp 3995 if (Ops.size() == 1)
4009 if (Ops.size() == 2) {
4182 unsigned NumIdxs = Idxs.size();
4186 unsigned NumInsertValueIdxs = InsertValueIdxs.size();
lib/Analysis/LoopAccessAnalysis.cpp 1107 OffValPairs.reserve(VL.size());
1143 SortedIndices.resize(VL.size());
lib/Analysis/MemorySSAUpdater.cpp 1245 assert(pred_size(New) == Preds.size() &&
1256 assert(PredsSet.size() == Preds.size() &&
lib/Analysis/ModuleSummaryAnalysis.cpp 623 assert(AliaseeVI.getSummaryList().size() == 1 &&
lib/Analysis/ScalarEvolution.cpp 2365 (Type == scAddExpr || Type == scMulExpr) && Ops.size() == 2 &&
2796 const SCEV **O = SCEVAllocator.Allocate<const SCEV *>(Ops.size());
2799 SCEVAddExpr(ID.Intern(SCEVAllocator), O, Ops.size());
2812 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2819 const SCEV **O = SCEVAllocator.Allocate<const SCEV *>(Ops.size());
2822 SCEVAddRecExpr(ID.Intern(SCEVAllocator), O, Ops.size(), L);
2835 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2841 const SCEV **O = SCEVAllocator.Allocate<const SCEV *>(Ops.size());
2844 O, Ops.size());
3543 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
7031 ExitNotTaken.reserve(ExitCounts.size());
lib/Analysis/ValueTracking.cpp 3433 unsigned size = I->getNumIndices() + idx_range.size();
lib/Analysis/VectorUtils.cpp 605 for (int J = 1, E = VL.size(); MD && J != E; ++J) {
726 unsigned NumVecs = Vecs.size();
lib/AsmParser/LLParser.cpp 7330 if (++NumUses > Indexes.size())
7336 if (Order.size() != Indexes.size() || NumUses > Indexes.size())
7336 if (Order.size() != Indexes.size() || NumUses > Indexes.size())
lib/Bitcode/Reader/BitcodeAnalyzer.cpp 464 const unsigned char *EndBufPtr = BufPtr + Bytes.size();
469 if (Bytes.size() < BWH_HeaderSize)
508 if (Record.size() != 2)
615 uint64_t BufferSizeBits = Stream.getBitcodeBytes().size() * CHAR_BIT;
lib/Bitcode/Reader/BitcodeReader.cpp 153 if (Idx > Record.size())
156 for (unsigned i = Idx, e = Record.size(); i != e; ++i)
2316 SmallVector<uint64_t, 8> Words(Vals.size());
3065 if (Record.size() < 2)
3095 if (Record.size() < 6)
3126 if (Record.size() > 6 && !GlobalValue::isLocalLinkage(Linkage))
3131 if (Record.size() > 7)
3135 if (Record.size() > 8)
3139 if (Record.size() > 9)
3151 if (Record.size() > 10)
3165 if (Record.size() > 11) {
3175 if (Record.size() > 12) {
3180 if (Record.size() > 13) {
3186 if (Record.size() > 15)
3200 if (Record.size() < 8)
3216 if (Record.size() > 16)
3259 if (Record.size() > 8 && Record[8]) {
3265 if (Record.size() > 9)
3268 if (Record.size() > 10 && Record[10] != 0)
3271 if (Record.size() > 11)
3276 if (Record.size() > 12) {
3286 if (Record.size() > 13 && Record[13] != 0)
3289 if (Record.size() > 14 && Record[14] != 0)
3292 if (Record.size() > 15) {
3300 if (Record.size() > 18)
3332 if (Record.size() < (3 + (unsigned)NewRecord))
3366 if (OpNum != Record.size()) {
3374 if (OpNum != Record.size())
3378 if (OpNum != Record.size())
3380 if (OpNum != Record.size())
3383 if (OpNum != Record.size())
3388 if (OpNum + 1 < Record.size()) {
5609 if (GVRecord.size() <= 3)
5631 Ret.reserve(Record.size());
5642 Ret.reserve(Record.size());
5643 for (unsigned I = 0, E = Record.size(); I != E; ++I) {
5706 while (Slot < Record.size())
5727 while (Slot < Record.size())
6338 if (BCBegin + 8 >= Stream.getBitcodeBytes().size())
lib/Bitcode/Reader/MetadataLoader.cpp 551 auto N = Expr.size();
563 if (Expr.size() >= 3 &&
596 HistoricSize = std::min(SubExpr.size(), HistoricSize);
1929 if (Record.size() != 2)
1963 assert(Record.size() % 2 == 0);
1964 for (unsigned I = 0, E = Record.size(); I != E; I += 2) {
lib/Bitcode/Writer/BitcodeWriter.cpp 1874 Record.reserve(N->getElements().size() + 1);
1974 Record.push_back(Strings.size());
2071 if (VE.getNonMDStrings().size() > IndexThreshold) {
2087 IndexPos.reserve(VE.getNonMDStrings().size());
2092 if (VE.getNonMDStrings().size() > IndexThreshold) {
3650 NameVals.push_back(FS->refs().size());
3698 NameVals.push_back(VS->refs().size());
lib/Bitcode/Writer/ValueEnumerator.h 86 assert(ID <= MDs.size() && "Expected valid ID");
lib/CodeGen/AggressiveAntiDepBreaker.cpp 640 RenameOrder.insert(RenameOrderType::value_type(SuperRC, Order.size()));
643 unsigned EndR = ((OrigR == Order.size()) ? 0 : OrigR);
646 if (R == 0) R = Order.size();
lib/CodeGen/AllocationOrder.h 60 Limit = Order.size();
lib/CodeGen/Analysis.cpp 322 if (ValLoc.size() >= InsertLoc.size() &&
327 ValLoc.resize(ValLoc.size() - InsertLoc.size());
lib/CodeGen/AsmPrinter/AccelTable.cpp 172 8 + (Atoms.size() * 4)),
267 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
311 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
331 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
415 if (CompUnits.size() > 1) {
416 size_t LargestCUIndex = CompUnits.size() - 1;
520 Header(CompUnits.size(), Contents.getBucketCount(),
555 SmallVector<unsigned, 1> CUIndex(CUs.size());
lib/CodeGen/AsmPrinter/CodeViewDebug.cpp 1881 ProcedureRecord Procedure(ReturnTypeIndex, CC, FO, ArgTypeIndices.size(),
lib/CodeGen/AsmPrinter/DwarfCompileUnit.cpp 189 if (GlobalExprs.size() == 1 && Expr && Expr->isConstant()) {
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 1470 dbgs() << CurEntry->getValues().size() << " Values:\n";
1852 size_t NumAbstractScopes = LScopes.getAbstractScopesList().size();
1871 assert(LScopes.getAbstractScopesList().size() == NumAbstractScopes
2146 DebugLocs.getBytes(Entry).size()),
2252 Asm->EmitULEB128(DebugLocs.getBytes(Entry).size());
2253 else if (DebugLocs.getBytes(Entry).size() <= std::numeric_limits<uint16_t>::max())
2254 Asm->emitInt16(DebugLocs.getBytes(Entry).size());
lib/CodeGen/AtomicExpandPass.cpp 1613 assert(Libcalls.size() == 6);
lib/CodeGen/CriticalAntiDepBreaker.cpp 398 for (unsigned i = 0; i != Order.size(); ++i) {
lib/CodeGen/GlobalISel/CSEMIRBuilder.cpp 115 if (DstOps.size() == 1)
129 if (DstOps.size() == 1) {
158 assert(SrcOps.size() == 2 && "Invalid sources");
159 assert(DstOps.size() == 1 && "Invalid dsts");
166 assert(DstOps.size() == 1 && "Invalid dst ops");
167 assert(SrcOps.size() == 2 && "Invalid src ops");
lib/CodeGen/GlobalISel/CallLowering.cpp 128 assert(SrcRegs.size() > 1 && "Nothing to pack");
138 assert(LLTs.size() == SrcRegs.size() && "Regs / types mismatch");
142 for (unsigned i = 0; i < SrcRegs.size(); ++i) {
154 assert(DstRegs.size() > 1 && "Nothing to unpack");
161 assert(LLTs.size() == DstRegs.size() && "Regs / types mismatch");
163 for (unsigned i = 0; i < DstRegs.size(); ++i)
lib/CodeGen/GlobalISel/IRTranslator.cpp 877 assert(Regs.size() == 1 && "swifterror should be single pointer");
885 Regs.size() == 1 ? LI.getMetadata(LLVMContext::MD_range) : nullptr;
886 for (unsigned i = 0; i < Regs.size(); ++i) {
919 assert(Vals.size() == 1 && "swifterror should be single pointer");
927 for (unsigned i = 0; i < Vals.size(); ++i) {
1013 for (unsigned i = 0; i < ResRegs.size(); ++i) {
1645 if (VRegs.size() > 1)
2070 for (unsigned j = 0; j < ValRegs.size(); ++j) {
2305 assert(VRegs.size() == 1 && "Too many vregs for Swift error");
lib/CodeGen/GlobalISel/LegalizerHelper.cpp 229 for (unsigned I = 0, E = LeftoverRegs.size(); I != E; ++I) {
3354 unsigned SrcParts = Src1Regs.size();
lib/CodeGen/GlobalISel/LegalizerInfo.cpp 462 for (unsigned i = 0; i < Query.Types.size(); ++i) {
lib/CodeGen/GlobalISel/MachineIRBuilder.cpp 538 assert(Ops.size() == Indices.size() && "incompatible args");
538 assert(Ops.size() == Indices.size() && "incompatible args");
552 for (unsigned i = 0; i < Ops.size(); ++i) {
559 if (MaybeMerge && Ops.size() * OpSize == ResTy.getSizeInBits()) {
567 for (unsigned i = 0; i < Ops.size(); ++i) {
568 Register ResOut = i + 1 == Ops.size()
961 assert(DstOps.size() == 1 && "Invalid select");
962 assert(SrcOps.size() == 3 && "Invalid select");
983 assert(DstOps.size() == 1 && "Invalid Dst");
984 assert(SrcOps.size() == 2 && "Invalid Srcs");
993 assert(DstOps.size() == 1 && "Invalid Dst");
994 assert(SrcOps.size() == 2 && "Invalid Srcs");
1003 assert(DstOps.size() == 1 && "Invalid Dst");
1004 assert(SrcOps.size() == 1 && "Invalid Srcs");
1010 assert(DstOps.size() == 1 && "Invalid Dst");
1011 assert(SrcOps.size() == 1 && "Invalid Srcs");
1017 assert(DstOps.size() == 1 && "Invalid Dst");
1023 assert(DstOps.size() == 1 && "Invalid Dst Operands");
1024 assert(SrcOps.size() == 3 && "Invalid Src Operands");
1049 assert(SrcOps.size() == 1 && "Invalid src for Unmerge");
1056 assert(DstOps.size() * DstOps[0].getLLTTy(*getMRI()).getSizeInBits() ==
1063 assert(DstOps.size() == 1 && "Invalid Dst");
1070 assert(SrcOps.size() * SrcOps[0].getLLTTy(*getMRI()).getSizeInBits() ==
1073 if (SrcOps.size() == 1)
1083 assert(DstOps.size() == 1 && "Invalid Dst size");
1084 assert(SrcOps.size() == 2 && "Invalid Src size");
1096 assert(DstOps.size() == 1 && "Invalid dst size");
1097 assert(SrcOps.size() == 3 && "Invalid src size");
1110 assert((!SrcOps.empty() || SrcOps.size() < 2) &&
1112 assert(DstOps.size() == 1 && "Invalid DstOps");
1121 assert(SrcOps.size() * SrcOps[0].getLLTTy(*getMRI()).getSizeInBits() ==
1127 assert((!SrcOps.empty() || SrcOps.size() < 2) &&
1129 assert(DstOps.size() == 1 && "Invalid DstOps");
1144 assert(DstOps.size() == 1 && "Invalid DstOps");
1145 assert((!SrcOps.empty() || SrcOps.size() < 2) &&
1154 assert(SrcOps.size() * SrcOps[0].getLLTTy(*getMRI()).getSizeInBits() ==
1160 assert(DstOps.size() == 2 && "Invalid no of dst operands");
1161 assert(SrcOps.size() == 3 && "Invalid no of src operands");
lib/CodeGen/InterferenceCache.cpp 196 for (unsigned i = 0, e = RegMaskSlots.size();
253 for (unsigned i = RegMaskSlots.size();
lib/CodeGen/InterleavedAccessPass.cpp 149 for (; i < Mask.size(); i++)
153 if (i == Mask.size())
168 if (Mask.size() < 2)
174 if (Mask.size() * Factor > NumLoadElements)
196 unsigned NumElts = Mask.size();
lib/CodeGen/LiveDebugVariables.cpp 1019 for (unsigned i = 0; i != NewRegs.size(); ++i) {
1142 for (unsigned i = 0; i != NewRegs.size(); ++i)
lib/CodeGen/LiveRangeEdit.cpp 421 for (unsigned i = 0, e = RegsBeingSpilled.size(); i != e; ++i) {
lib/CodeGen/MIRParser/MIParser.cpp 159 assert(RegMasks.size() == RegMaskNames.size());
159 assert(RegMasks.size() == RegMaskNames.size());
160 for (size_t I = 0, E = RegMasks.size(); I < E; ++I)
1359 for (unsigned I = 0, E = Operands.size(); I != E; ++I) {
lib/CodeGen/MachineFunction.cpp 702 for (unsigned N = TyInfo.size(); N; --N)
709 std::vector<unsigned> IdsInFilter(TyInfo.size());
710 for (unsigned I = 0, E = TyInfo.size(); I != E; ++I)
lib/CodeGen/MachineInstr.cpp 328 MMOs.size() + HasPreInstrSymbol + HasPostInstrSymbol + HasHeapAllocMarker;
407 if (LHS.size() != RHS.size())
407 if (LHS.size() != RHS.size())
423 if (MIs.size() == 1) {
lib/CodeGen/MachineOutliner.cpp 332 CurrNode.SuffixIdx = Str.size() - CurrNodeLen;
lib/CodeGen/MachinePipeliner.cpp 383 assert(L.getBlocks().size() == 1 && "SMS works on single blocks only.");
lib/CodeGen/MachineTraceMetrics.cpp 870 for (unsigned K = 0; K != PRDepths.size(); ++K)
986 for (unsigned i = Trace.size(); i; --i) {
1054 for (unsigned K = 0; K != PRHeights.size(); ++K)
1203 for (unsigned K = 0; K != PRDepths.size(); ++K)
1206 for (unsigned K = 0; K != PRDepths.size(); ++K)
1253 for (unsigned K = 0; K != PRDepths.size(); ++K) {
1269 Instrs += ExtraInstrs.size();
1270 Instrs -= RemoveInstrs.size();
lib/CodeGen/ParallelCG.cpp 42 assert(BCOSs.empty() || BCOSs.size() == OSs.size());
42 assert(BCOSs.empty() || BCOSs.size() == OSs.size());
44 if (OSs.size() == 1) {
54 ThreadPool CodegenThreadPool(OSs.size());
58 std::move(M), OSs.size(),
lib/CodeGen/RegAllocGreedy.cpp 1118 unsigned OrderLimit = Order.getOrder().size();
1191 SplitConstraints.resize(UseBlocks.size());
1193 for (unsigned i = 0; i != UseBlocks.size(); ++i) {
1266 for (unsigned i = 0; i != Blocks.size(); ++i) {
1324 for (int i = 0, e = NewBundles.size(); i != e; ++i) {
1417 for (unsigned i = 0; i != UseBlocks.size(); ++i) {
1590 for (unsigned i = 0; i != UseBlocks.size(); ++i) {
1694 for (unsigned i = 0; i != UseBlocks.size(); ++i) {
1738 for (unsigned c = 0; c != UsedCands.size(); ++c) {
1740 for (unsigned i = 0, e = Blocks.size(); i != e; ++i) {
2027 for (unsigned i = 0; i != UseBlocks.size(); ++i) {
2099 if (Uses.size() <= 1)
2102 LLVM_DEBUG(dbgs() << "Split around " << Uses.size()
2112 for (unsigned i = 0; i != Uses.size(); ++i) {
2153 assert(SA->getUseBlocks().size() == 1 && "Not a local interval");
2156 const unsigned NumGaps = Uses.size()-1;
2233 if (SA->getUseBlocks().size() != 1)
2246 if (Uses.size() <= 2)
2248 const unsigned NumGaps = Uses.size()-1;
2252 for (unsigned i = 0, e = Uses.size(); i != e; ++i)
2263 LLVM_DEBUG(dbgs() << RMS.size() << " regmasks in block:");
2267 unsigned re = RMS.size();
lib/CodeGen/RegAllocPBQP.cpp 613 for (unsigned I = 0; I != RawPRegOrder.size(); ++I) {
lib/CodeGen/RegUsageInfoPropagate.cpp 65 assert(RegMask.size() ==
lib/CodeGen/RegisterClassInfo.cpp 110 for (unsigned i = 0; i != RawOrder.size(); ++i) {
lib/CodeGen/RegisterCoalescer.cpp 3491 for (unsigned i = 0, e = CurrList.size(); i != e; ++i) {
lib/CodeGen/RegisterPressure.cpp 84 for (unsigned i = 0, e = SetPressure.size(); i < e; ++i) {
964 for (unsigned i = 0, e = OldPressureVec.size(); i < e; ++i) {
1005 unsigned CritIdx = 0, CritEnd = CriticalPSets.size();
1006 for (unsigned i = 0, e = OldMaxPressureVec.size(); i < e; ++i) {
1165 unsigned CritIdx = 0, CritEnd = CriticalPSets.size();
lib/CodeGen/SafeStackColoring.h 119 : F(F), Allocas(Allocas), NumAllocas(Allocas.size()) {}
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 751 return ((DAGCombiner*)DC)->CombineTo(N, &To[0], To.size(), AddTo);
18698 assert(ShufMask.size() == SplatMask.size() && "Mask length mismatch");
18698 assert(ShufMask.size() == SplatMask.size() && "Mask length mismatch");
18718 for (unsigned i = 0, e = UserMask.size(); i != e; ++i)
18743 int MaskSize = Mask.size();
18791 assert(Mask[ShufOp0Index] >= 0 && Mask[ShufOp0Index] < (int)Mask.size() &&
18828 for (int i = 0, e = (int)Mask.size(); i != e; ++i) {
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 1324 for (unsigned i = 1, e = LiveRegDefs.size()-1; i != e; ++i) {
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 1571 assert(VT.getVectorNumElements() == Mask.size() &&
1582 int NElts = Mask.size();
2497 assert(NumElts == SVN->getMask().size() && "Unexpected vector size");
3465 assert(NumElts == SVN->getMask().size() && "Unexpected vector size");
4154 int NumOps = Ops.size();
4194 assert((Ops.size() * Ops[0].getValueType().getVectorNumElements()) ==
4198 if (Ops.size() == 1)
4210 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
4777 assert(Ops.size() == 2 && "Div/rem should have 2 operands");
6554 if (Ops.size() == 1)
6558 VTs.reserve(Ops.size());
6559 for (unsigned i = 0; i < Ops.size(); ++i)
7026 assert(Ops.size() == 6 && "Incompatible number of operands");
7067 assert(Ops.size() == 6 && "Incompatible number of operands");
7188 switch (Ops.size()) {
7204 unsigned NumOps = Ops.size();
7423 unsigned NumVTs = VTs.size();
7524 unsigned NumOps = Ops.size();
7572 if (NewMemRefs.size() == 1) {
7579 Allocator.template Allocate<MachineMemOperand *>(NewMemRefs.size());
7582 N->NumMemRefs = static_cast<int>(NewMemRefs.size());
9564 assert(SDNode::getMaxNumOperands() >= Vals.size() &&
9567 ArrayRecycler<SDUse>::Capacity::get(Vals.size()), OperandAllocator);
9570 for (unsigned I = 0; I != Vals.size(); ++I) {
9576 Node->NumOperands = Vals.size();
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 8501 assert(ResultValues.size() == ResultTypes.size() &&
lib/CodeGen/SelectionDAG/SelectionDAGDumper.cpp 743 OS << " [NoOfDbgValues=" << G->GetDbgValues(this).size() << ']';
lib/CodeGen/SelectionDAG/StatepointLowering.cpp 545 const int NumVMSArgs = SI.DeoptState.size();
lib/CodeGen/SelectionDAG/TargetLowering.cpp 127 Args.reserve(Ops.size());
130 for (unsigned i = 0; i < Ops.size(); ++i) {
lib/CodeGen/SpillPlacement.cpp 242 if (bundles->getBlocks(n).size() > 100) {
lib/CodeGen/SplitKit.h 213 return getUseBlocks().size() - NumGapBlocks + getNumThroughBlocks();
lib/CodeGen/TargetInstrInfo.cpp 602 if (!MI.isCopy() || Ops.size() != 1)
lib/CodeGen/TargetRegisterInfo.cpp 213 for (unsigned i = 0; i != Order.size(); ++i)
lib/DebugInfo/CodeView/AppendingTypeTableBuilder.cpp 80 uint8_t *Stable = RecordStorage.Allocate<uint8_t>(Record.size());
81 memcpy(Stable, Record.data(), Record.size());
82 Record = ArrayRef<uint8_t>(Stable, Record.size());
lib/DebugInfo/CodeView/CodeViewRecordIO.cpp 105 incrStreamedLen(Bytes.size());
lib/DebugInfo/CodeView/ContinuationRecordBuilder.cpp 159 Prefix->RecordLen = Data.size() - sizeof(RecordPrefix::RecordLen);
lib/DebugInfo/CodeView/DebugChecksumsSubsection.cpp 72 uint8_t *Copy = Storage.Allocate<uint8_t>(Bytes.size());
73 ::memcpy(Copy, Bytes.data(), Bytes.size());
74 Entry.Checksum = makeArrayRef(Copy, Bytes.size());
86 uint32_t Len = alignTo(sizeof(FileChecksumEntryHeader) + Bytes.size(), 4);
98 Header.ChecksumSize = FC.Checksum.size();
lib/DebugInfo/CodeView/Formatters.cpp 29 assert(Item.size() == 16 && "Expected 16-byte GUID");
lib/DebugInfo/CodeView/GlobalTypeTableBuilder.cpp 90 return insertRecordAs(GHT, Record.size(),
92 assert(Data.size() == Record.size());
92 assert(Data.size() == Record.size());
93 ::memcpy(Data.data(), Record.data(), Record.size());
lib/DebugInfo/CodeView/MergingTypeTableBuilder.cpp 85 uint8_t *Stable = Alloc.Allocate<uint8_t>(Data.size());
86 memcpy(Stable, Data.data(), Data.size());
87 return makeArrayRef(Stable, Data.size());
92 assert(Record.size() < UINT32_MAX && "Record too big");
93 assert(Record.size() % 4 == 0 && "Record is not aligned to 4 bytes!");
lib/DebugInfo/CodeView/RecordName.cpp 77 uint32_t Size = Indices.size();
93 uint32_t Size = Indices.size();
lib/DebugInfo/CodeView/RecordSerialization.cpp 29 LeafData.size());
lib/DebugInfo/CodeView/SymbolRecordHelpers.cpp 91 EndOffset += Closer.RecordData.size();
lib/DebugInfo/CodeView/TypeDumpVisitor.cpp 226 uint32_t Size = Indices.size();
237 uint32_t Size = Indices.size();
426 W->printNumber("NumArgs", static_cast<uint32_t>(Args.getArgs().size()));
461 W->printNumber("Length", uint32_t(Record.content().size()));
lib/DebugInfo/CodeView/TypeHashing.cpp 61 if (TI.toArrayIndex() >= Prev.size() ||
lib/DebugInfo/CodeView/TypeRecordMapping.cpp 456 Size = Slots.size();
459 for (size_t SlotIndex = 0; SlotIndex < Slots.size(); SlotIndex += 2) {
461 if ((SlotIndex + 1) < Slots.size()) {
lib/DebugInfo/CodeView/TypeStreamMerger.cpp 153 if (LLVM_UNLIKELY(MapPos >= Map.size() || Map[MapPos] == Untranslated))
237 if (IsSecondPass && MapPos >= Map.size()) {
381 DestIdx = Dest.insertRecordAs(H, Type.RecordData.size(), DoSerialize);
386 RemapStorage.resize(Type.RecordData.size());
409 OriginalType.RecordData.size());
lib/DebugInfo/CodeView/TypeTableCollection.cpp 20 Names.resize(Records.size());
38 assert(Index.toArrayIndex() < Records.size());
58 uint32_t TypeTableCollection::size() { return Records.size(); }
60 uint32_t TypeTableCollection::capacity() { return Records.size(); }
lib/DebugInfo/DWARF/DWARFDebugLine.cpp 310 if (!Value.getAsBlock() || Value.getAsBlock().getValue().size() != 16)
lib/DebugInfo/DWARF/DWARFDie.cpp 87 DataExtractor Data(StringRef((const char *)Expr.data(), Expr.size()),
lib/DebugInfo/DWARF/DWARFFormValue.cpp 95 V.uval = D.size();
208 if (Form < makeArrayRef(DWARF5FormClasses).size() &&
lib/DebugInfo/DWARF/DWARFVerifier.cpp 846 uint32_t NumAtoms = AccelTable.getAtomsDesc().size();
lib/DebugInfo/GSYM/FileWriter.cpp 60 OS.write(reinterpret_cast<const char *>(Data.data()), Data.size());
lib/DebugInfo/GSYM/GsymReader.cpp 221 const auto NumAddrInfoOffsets = AddrInfoOffsets.size();
250 assert(*AddressIndex < AddrInfoOffsets.size());
lib/DebugInfo/MSF/MSFBuilder.cpp 160 if (ReqBlocks != Blocks.size())
369 if (auto EC = DW.writeInteger<uint32_t>(Layout.StreamSizes.size()))
lib/DebugInfo/MSF/MappedBlockStream.cpp 101 if (Entry.size() >= Size) {
131 std::make_pair(CacheItem.first, CacheItem.first + CachedAlloc.size());
245 if (auto EC = checkOffsetForRead(Offset, Buffer.size()))
248 uint32_t BytesLeft = Buffer.size();
283 if (Offset + Data.size() < MapEntry.first)
288 if (MapEntry.first + Alloc.size() < Offset)
292 Interval WriteInterval = std::make_pair(Offset, Offset + Data.size());
294 std::make_pair(MapEntry.first, MapEntry.first + Alloc.size());
390 if (auto EC = checkOffsetForWrite(Offset, Buffer.size()))
396 uint32_t BytesLeft = Buffer.size();
lib/DebugInfo/PDB/Native/DbiModuleDescriptorBuilder.cpp 80 assert(BulkSymbols.size() % alignOf(CodeViewContainer::Pdb) == 0 &&
82 SymbolByteSize += BulkSymbols.size();
lib/DebugInfo/PDB/Native/DbiStreamBuilder.cpp 94 DbgStreams[(int)Type]->Size = Data.size();
154 return sizeof(SecMapHeader) + sizeof(SecMapEntry) * SectionMap.size();
165 NumFileInfos += M->source_files().size();
211 FileCount = static_cast<uint16_t>(MI->source_files().size());
416 ulittle16_t Size = static_cast<ulittle16_t>(SectionMap.size());
lib/DebugInfo/PDB/Native/GSIStreamBuilder.cpp 252 DeserializedPublics.reserve(Records.size());
253 PublicsByAddr.reserve(Records.size());
254 SymOffsets.reserve(Records.size());
269 AddrMap.reserve(Records.size());
272 assert(Idx >= 0 && size_t(Idx) < Records.size());
lib/DebugInfo/PDB/Native/Hash.cpp 63 Buffer.size() / sizeof(ulittle32_t));
69 Buffer = Buffer.slice(Items.size() * sizeof(ulittle32_t));
lib/DebugInfo/PDB/Native/NativeEnumInjectedSources.cpp 29 Offset += Data.size();
lib/DebugInfo/PDB/Native/PDBFile.cpp 85 return ContainerLayout.StreamSizes.size();
lib/DebugInfo/PDB/Native/TpiStreamBuilder.cpp 47 size_t NewSize = TypeRecordBytes + Record.size();
lib/DebugInfo/PDB/UDTLayout.cpp 261 VirtualBases = makeArrayRef(AllBases).drop_front(NonVirtualBases.size());
lib/DebugInfo/Symbolize/Symbolize.cpp 284 return !memcmp(dbg_uuid.data(), bin_uuid.data(), dbg_uuid.size());
lib/ExecutionEngine/Interpreter/Execution.cpp 2125 ECStack.back().Caller.arg_size() == ArgVals.size()) &&
2145 assert((ArgVals.size() == F->arg_size() ||
2146 (ArgVals.size() > F->arg_size() && F->getFunctionType()->isVarArg()))&&
lib/ExecutionEngine/Interpreter/ExternalFunctions.cpp 312 assert(Args.size() == 1);
431 assert(args.size() < 10 && "Only handle up to 10 args to sscanf right now!");
434 for (unsigned i = 0; i < args.size(); ++i)
445 assert(args.size() < 10 && "Only handle up to 10 args to scanf right now!");
448 for (unsigned i = 0; i < args.size(); ++i)
461 assert(Args.size() >= 2);
lib/ExecutionEngine/Interpreter/Interpreter.cpp 93 ArgValues.slice(0, std::min(ArgValues.size(), ArgCount));
lib/ExecutionEngine/JITLink/JITLinkGeneric.h 164 << (const void *)((char *)SegMem.data() + SegMem.size())
225 << (const void *)((char *)SegMem.data() + SegMem.size()) << "\n";
227 while (LastBlockEnd != SegMem.data() + SegMem.size())
lib/ExecutionEngine/MCJIT/MCJIT.cpp 516 assert((FTy->getNumParams() == ArgValues.size() ||
517 (FTy->isVarArg() && FTy->getNumParams() <= ArgValues.size())) &&
519 assert(FTy->getNumParams() == ArgValues.size() &&
525 switch (ArgValues.size()) {
lib/ExecutionEngine/Orc/Core.cpp 2099 FullSearchOrder.reserve(SearchOrder.size());
lib/ExecutionEngine/Orc/OrcMCJITReplacement.cpp 35 assert((FTy->getNumParams() == ArgValues.size() ||
36 (FTy->isVarArg() && FTy->getNumParams() <= ArgValues.size())) &&
38 assert(FTy->getNumParams() == ArgValues.size() &&
44 switch (ArgValues.size()) {
lib/IR/AsmWriter.cpp 1536 for (unsigned i = 0, e = Indices.size(); i != e; ++i)
lib/IR/Attributes.cpp 720 : NumAttrs(Attrs.size()) {
905 : Context(C), NumAttrSets(Sets.size()) {
962 AttributeListImpl::totalSizeToAlloc<AttributeSet>(AttrSets.size()));
1029 if (MaxIndex == FunctionIndex && Attrs.size() > 1)
1030 MaxIndex = Attrs[Attrs.size() - 2].first;
1046 for (size_t I = ArgAttrs.size(); I != 0; --I) {
1110 if (Attrs.size() == 1)
lib/IR/AutoUpgrade.cpp 552 StoreInts[fArgs.size() - 3], Tys);
555 StoreLaneInts[fArgs.size() - 5], Tys);
lib/IR/ConstantFold.cpp 2141 for (unsigned i = 1, e = Idxs.size(); i != e; ++i)
2171 PointeeTy, C, makeArrayRef((Value *const *)Idxs.data(), Idxs.size()));
2177 if (Idxs.size() == 1 && (Idx0->isNullValue() || isa<UndefValue>(Idx0)))
2185 for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
2203 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2258 NewIndices.reserve(Idxs.size() + CE->getNumOperands());
2310 if (CE->isCast() && Idxs.size() > 1 && Idx0->isNullValue()) {
2337 for (unsigned i = 1, e = Idxs.size(); i != e;
2396 NewIdxs.resize(Idxs.size());
2454 for (unsigned i = 0, e = Idxs.size(); i != e; ++i)
lib/IR/Constants.cpp 995 : Constant(T, VT, OperandTraits<ConstantAggregate>::op_end(this) - V.size(),
996 V.size()) {
1003 for (unsigned I = 0, E = V.size(); I != E; ++I)
1010 assert(V.size() == T->getNumElements() &&
1025 for (unsigned i = 0, e = V.size(); i != e; ++i) {
1052 unsigned VecSize = V.size();
1070 assert((T->isOpaque() || V.size() == T->getNumElements()) &&
1076 assert((ST->isOpaque() || ST->getNumElements() == V.size()) &&
1087 for (unsigned i = 0, e = V.size(); i != e; ++i) {
1105 assert(V.size() == T->getNumElements() &&
1113 VectorType *Ty = VectorType::get(V.front()->getType(), V.size());
1119 VectorType *T = VectorType::get(V.front()->getType(), V.size());
1128 for (unsigned i = 1, e = V.size(); i != e; ++i)
1239 assert(Ops.size() == getNumOperands() && "Operand count mismatch!");
2042 ArgVec.reserve(1 + Idxs.size());
2044 for (unsigned i = 0, e = Idxs.size(); i != e; ++i) {
2412 (IdxList.size() + 1),
2413 IdxList.size() + 1),
2418 for (unsigned i = 0, E = IdxList.size(); i != E; ++i)
2562 Type *Ty = ArrayType::get(Type::getHalfTy(Context), Elts.size());
2564 return getImpl(StringRef(Data, Elts.size() * 2), Ty);
2568 Type *Ty = ArrayType::get(Type::getFloatTy(Context), Elts.size());
2570 return getImpl(StringRef(Data, Elts.size() * 4), Ty);
2574 Type *Ty = ArrayType::get(Type::getDoubleTy(Context), Elts.size());
2576 return getImpl(StringRef(Data, Elts.size() * 8), Ty);
2596 Type *Ty = VectorType::get(Type::getInt8Ty(Context), Elts.size());
2598 return getImpl(StringRef(Data, Elts.size() * 1), Ty);
2601 Type *Ty = VectorType::get(Type::getInt16Ty(Context), Elts.size());
2603 return getImpl(StringRef(Data, Elts.size() * 2), Ty);
2606 Type *Ty = VectorType::get(Type::getInt32Ty(Context), Elts.size());
2608 return getImpl(StringRef(Data, Elts.size() * 4), Ty);
2611 Type *Ty = VectorType::get(Type::getInt64Ty(Context), Elts.size());
2613 return getImpl(StringRef(Data, Elts.size() * 8), Ty);
2616 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size());
2618 return getImpl(StringRef(Data, Elts.size() * 4), Ty);
2621 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size());
2623 return getImpl(StringRef(Data, Elts.size() * 8), Ty);
2633 Type *Ty = VectorType::get(Type::getHalfTy(Context), Elts.size());
2635 return getImpl(StringRef(Data, Elts.size() * 2), Ty);
2639 Type *Ty = VectorType::get(Type::getFloatTy(Context), Elts.size());
2641 return getImpl(StringRef(Data, Elts.size() * 4), Ty);
2645 Type *Ty = VectorType::get(Type::getDoubleTy(Context), Elts.size());
2647 return getImpl(StringRef(Data, Elts.size() * 8), Ty);
lib/IR/ConstantsContext.h 245 GetElementPtrConstantExpr *Result = new (IdxList.size() + 1)
393 if (Operands.size() != C->getNumOperands())
395 for (unsigned I = 0, E = Operands.size(); I != E; ++I)
408 return new (Operands.size()) ConstantClass(Ty, Operands);
510 if (Ops.size() != CE->getNumOperands())
514 for (unsigned I = 0, E = Ops.size(); I != E; ++I)
lib/IR/Core.cpp 2967 return CE->getIndices().size();
lib/IR/DIBuilder.cpp 613 for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
lib/IR/DebugInfoMetadata.cpp 30 assert((MDs.size() == 1 || MDs.size() == 2) &&
30 assert((MDs.size() == 1 || MDs.size() == 2) &&
278 return storeImpl(new (DwarfOps.size() + 1) GenericDINode(
lib/IR/Function.cpp 813 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
818 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
824 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
830 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
836 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
842 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
848 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
853 unsigned short ArgNo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
854 unsigned short RefNo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
876 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
882 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
888 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
900 unsigned ArgInfo = (NextElt == Infos.size() ? 0 : Infos[NextElt++]);
942 while (NextElt != IITEntries.size() && IITEntries[NextElt] != 0)
1377 if (Infos.size() != 1)
lib/IR/IRBuilder.cpp 588 Args.push_back(B.getInt32(CallArgs.size()));
591 Args.push_back(B.getInt32(TransitionArgs.size()));
593 Args.push_back(B.getInt32(DeoptArgs.size()));
lib/IR/Instructions.cpp 388 assert(getNumOperands() == Args.size() + CountBundleInputs(Bundles) + 1 &&
393 assert((Args.size() == FTy->getNumParams() ||
394 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
397 for (unsigned i = 0; i != Args.size(); ++i)
405 auto It = populateBundleOperandInfos(Bundles, Args.size());
723 ComputeNumOperands(Args.size(), CountBundleInputs(Bundles)) &&
730 assert(((Args.size() == FTy->getNumParams()) ||
731 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
734 for (unsigned i = 0, e = Args.size(); i != e; i++)
742 auto It = populateBundleOperandInfos(Bundles, Args.size());
791 ComputeNumOperands(Args.size(), IndirectDests.size(),
791 ComputeNumOperands(Args.size(), IndirectDests.size(),
794 NumIndirectDests = IndirectDests.size();
801 assert(((Args.size() == FTy->getNumParams()) ||
802 (FTy->isVarArg() && Args.size() > FTy->getNumParams())) &&
805 for (unsigned i = 0, e = Args.size(); i != e; i++)
813 auto It = populateBundleOperandInfos(Bundles, Args.size());
815 assert(It + 2 + IndirectDests.size() == op_end() && "Should add up!");
1076 assert(getNumOperands() == 1 + Args.size() && "NumOperands not set up?");
1599 assert(getNumOperands() == 1 + IdxList.size() &&
1638 for (; CurIdx != IdxList.size(); ++CurIdx) {
1645 return CurIdx == IdxList.size() ? Agg : nullptr;
1920 for (int i = 0, NumMaskElts = Mask.size(); i < NumMaskElts; ++i) {
1937 return isSingleSourceMaskImpl(Mask, Mask.size());
1943 for (int i = 0, NumMaskElts = Mask.size(); i < NumMaskElts; ++i) {
1955 return isIdentityMaskImpl(Mask, Mask.size());
1961 for (int i = 0, NumElts = Mask.size(); i < NumElts; ++i) {
1973 for (int i = 0, NumElts = Mask.size(); i < NumElts; ++i) {
1986 for (int i = 0, NumElts = Mask.size(); i < NumElts; ++i) {
2003 int NumElts = Mask.size();
2036 if (NumSrcElts <= (int)Mask.size())
2041 for (int i = 0, e = Mask.size(); i != e; ++i) {
lib/IR/LLVMContextImpl.h 234 if (Ops.size() != RHS->getNumOperands() - Offset)
lib/IR/MDBuilder.cpp 43 assert(Weights.size() >= 1 && "Need at least one branch weights!");
45 SmallVector<Metadata *, 4> Vals(Weights.size() + 1);
49 for (unsigned i = 0, e = Weights.size(); i != e; ++i)
202 SmallVector<Metadata *, 4> Vals(Fields.size() * 3);
204 for (unsigned i = 0, e = Fields.size(); i != e; ++i) {
216 SmallVector<Metadata *, 4> Ops(Fields.size() * 2 + 1);
219 for (unsigned i = 0, e = Fields.size(); i != e; ++i) {
251 SmallVector<Metadata *, 4> Ops(3 + Fields.size() * 3);
256 for (unsigned I = 0, E = Fields.size(); I != E; ++I) {
lib/IR/Metadata.cpp 505 : Metadata(ID, Storage), NumOperands(Ops1.size() + Ops2.size()),
505 : Metadata(ID, Storage), NumOperands(Ops1.size() + Ops2.size()),
826 return storeImpl(new (MDs.size()) MDTuple(Context, Storage, Hash, MDs),
885 if (N->getNumOperands() == Ops.size() && N == N->getOperand(0)) {
886 for (unsigned I = 1, E = Ops.size(); I != E; ++I)
1480 std::vector<uint64_t> Elements(OrigElements.size() + 2);
lib/IR/ModuleSummaryIndex.cpp 34 return getSummaryList().size() &&
43 return getSummaryList().size() &&
57 for (I = Refs.size() - 1; I >= 0 && Refs[I].isWriteOnly(); --I)
88 assert((!PerModuleIndex || VI.getSummaryList().size() == 1) &&
207 if (V.getSummaryList().size())
lib/IR/Type.cpp 290 for (unsigned i = 0, e = Params.size(); i != e; ++i) {
297 NumContainedTys = Params.size() + 1; // + 1 for result type
316 sizeof(FunctionType) + sizeof(Type *) * (Params.size() + 1),
380 NumContainedTys = Elements.size();
lib/IR/Verifier.cpp 2995 Assert(BU.Inputs.size() == 1,
3004 Assert(BU.Inputs.size() == 1,
lib/LTO/LTOModule.cpp 670 return input->getDependentLibraries().size();
lib/LTO/SummaryBasedOptimizations.cpp 54 if (V.getSummaryList().size()) {
63 if (!V.getSummaryList().size())
lib/MC/ELFObjectWriter.cpp 761 unsigned Index = FileNames.size() + 1;
lib/MC/MCCodeView.cpp 220 CurrentOffset += File.Checksum.size();
232 OS.EmitIntValue(static_cast<uint8_t>(File.Checksum.size()), 1);
629 for (size_t I = 0, E = Frag.getRanges().size(); I != E;) {
lib/MC/MCDwarf.cpp 503 MCOS->EmitIntValue(StandardOpcodeLengths.size() + 1, 1);
lib/MC/MCParser/AsmLexer.cpp 520 for (ReadCount = 0; ReadCount < Buf.size(); ++ReadCount) {
lib/MC/MCParser/AsmParser.cpp 2395 unsigned NParameters = Parameters.size();
2397 if ((!IsDarwin || NParameters != 0) && NParameters != A.size())
2439 OS << A.size();
2446 if (Index >= A.size())
4509 unsigned NParameters = Parameters.size();
lib/MC/StringTableBuilder.cpp 91 if (Vec.size() <= 1)
99 size_t J = Vec.size();
lib/MC/WasmObjectWriter.cpp 682 encodeULEB128(Signatures.size(), W.OS);
708 encodeULEB128(Imports.size(), W.OS);
750 encodeULEB128(Functions.size(), W.OS);
764 encodeULEB128(Events.size(), W.OS);
780 encodeULEB128(Exports.size(), W.OS);
805 encodeULEB128(TableElems.size(), W.OS);
832 encodeULEB128(Functions.size(), W.OS);
938 if (SymbolInfos.size() != 0) {
940 encodeULEB128(SymbolInfos.size(), W.OS);
987 encodeULEB128(InitFuncs.size(), W.OS);
lib/MCA/Support.cpp 43 assert(Masks.size() == SM.getNumProcResourceKinds() &&
lib/Object/COFFObjectFile.cpp 513 if (InfoBytes.size() < sizeof(*PDBInfo) + 1)
518 InfoBytes.size());
1770 Relocs.reserve(OrigRelocs.size());
1836 if (Offset + Entry.DataSize > Contents.size())
lib/Object/Decompressor.cpp 96 size_t Size = Buffer.size();
lib/Object/ELF.cpp 359 if (ContentsOrErr->size() < 4 || Cur[0] != 'A' || Cur[1] != 'P' ||
lib/Object/IRObjectFile.cpp 63 SymTab.symbols().size());
lib/Object/IRSymtab.cpp 130 Mod.End = Syms.size() + Msymtab.symbols().size();
lib/Object/Minidump.cpp 89 if (ListOffset + sizeof(T) * ListSize < Stream->size())
105 Offset + Size > Data.size())
lib/Object/WasmObjectFile.cpp 290 Ctx.End = Ctx.Start + Sec.Content.size();
559 if (Offset + Size > DataSegments[Index].Data.Content.size())
757 uint32_t EndOffset = Section.Content.size();
1424 return S.Content.size();
lib/Object/WindowsResource.cpp 175 EndianCorrectedSrc.resize(Src.size() + 1);
666 FileSize += Data.size() * COFF::Symbol16Size; // 1 symbol per resource.
688 Data.size() * COFF::RelocationSize; // one relocation for each resource.
736 Header->NumberOfSymbols = Data.size() + 5;
754 SectionOneHeader->NumberOfRelocations = Data.size();
823 Aux->NumberOfRelocations = Data.size();
850 for (unsigned i = 0; i < Data.size(); i++) {
939 RelocationAddresses.resize(Data.size());
976 for (unsigned i = 0; i < Data.size(); i++) {
lib/ObjectYAML/CodeViewYAMLTypeHashing.cpp 49 assert(DebugH.size() >= 8);
50 assert((DebugH.size() - 8) % 8 == 0);
lib/ObjectYAML/ELFEmitter.cpp 195 return A.size() * sizeof(T);
467 for (size_t I = 0; I < Symbols.size(); ++I)
470 return Symbols.size();
494 Ret.resize(Symbols.size() + 1);
1111 for (size_t I = 0, S = V.size(); I < S; ++I) {
lib/ObjectYAML/MinidumpEmitter.cpp 43 Data.size(), [Data](raw_ostream &OS) { OS << toStringRef(Data); });
54 sizeof(T) * Data.size()});
lib/ObjectYAML/MinidumpYAML.cpp 554 Streams.reserve(File.streams().size());
lib/ObjectYAML/YAML.cpp 42 OS.write((const char *)Data.data(), Data.size());
45 for (unsigned I = 0, N = Data.size(); I != N; I += 2) {
57 OS.write((const char *)Data.data(), Data.size());
lib/Option/OptTable.cpp 402 unsigned Index = 0, End = ArgArr.size();
lib/ProfileData/Coverage/CoverageMapping.cpp 144 if (C.getExpressionID() >= Expressions.size())
170 if (C.getCounterID() >= CounterValues.size())
174 if (C.getExpressionID() >= Expressions.size())
229 Counts.assign(Record.MappingRegions.size(), 0);
240 if (Record.MappingRegions.size() == 1 &&
487 const bool Skipped = (CR.index() + 1) == Regions.size();
492 if (CR.index() + 1 == Regions.size() ||
750 for (unsigned I = 0; I < LineSegments.size() && MinRegionCount < 2; ++I)
lib/ProfileData/Coverage/CoverageMappingReader.cpp 260 if (auto Err = readIntMax(FilenameIndex, TranslationUnitFilenames.size()))
lib/ProfileData/Coverage/CoverageMappingWriter.cpp 38 encodeULEB128(Filenames.size(), OS);
58 AdjustedExpressionIDs.resize(Expressions.size(), 0);
147 encodeULEB128(VirtualFileMapping.size(), OS);
154 encodeULEB128(MinExpressions.size(), OS);
215 assert(CurrentFileID == (VirtualFileMapping.size() - 1));
lib/ProfileData/InstrProf.cpp 387 .count(getInstrProfNameSeparator()) == (NameStrs.size() - 1) &&
lib/ProfileData/InstrProfReader.cpp 432 Record.Counts.reserve(RawCounts.size());
875 for (unsigned I = 0, E = Data.size(); I < E; ++I) {
903 if (RecordIndex >= Data.size()) {
lib/ProfileData/InstrProfWriter.cpp 328 uint32_t NumEntries = ProfileSummaryBuilder::DefaultCutoffs.size();
lib/Remarks/YAMLRemarkSerializer.cpp 126 static size_t size(IO &io, ArrayRef<T> &seq) { return seq.size(); }
lib/Support/APFloat.cpp 2086 assert(dstPartsCount <= parts.size() && "Integer too big");
2198 assert(dstPartsCount <= parts.size() && "Integer too big");
lib/Support/APInt.cpp 100 unsigned words = std::min<unsigned>(bigVal.size(), getNumWords());
lib/Support/ARMAttributeParser.cpp 702 while (Offset < Section.size()) {
712 if (SectionLength == 0 || (SectionLength + Offset) > Section.size()) {
lib/Support/BinaryStreamReader.cpp 33 Offset += Buffer.size();
82 StringRef S(reinterpret_cast<const char *>(Buffer.begin()), Buffer.size());
126 Dest = StringRef(reinterpret_cast<const char *>(Bytes.begin()), Bytes.size());
lib/Support/BinaryStreamRef.cpp 74 Data.size()) {}
98 if (Buffer.size() > MaxLength)
114 0, Data.size()) {}
119 if (auto EC = checkOffsetForWrite(Offset, Data.size()))
lib/Support/BinaryStreamWriter.cpp 31 Offset += Buffer.size();
lib/Support/CommandLine.cpp 1037 return (S.size() >= 3 && S[0] == '\xef' && S[1] == '\xbb' && S[2] == '\xbf');
1063 Str = StringRef(BufRef.data() + 3, BufRef.size() - 3);
lib/Support/ConvertUTFWrapper.cpp 81 return (S.size() >= 2 &&
90 if (SrcBytes.size() % 2)
116 Out.resize(SrcBytes.size() * UNI_MAX_UTF8_BYTES_PER_CODE_POINT + 1);
139 Src.size() * sizeof(UTF16)), Out);
lib/Support/MD5.cpp 83 unsigned long Size = Data.size();
193 unsigned long Size = Data.size();
lib/Support/MemoryBuffer.cpp 471 std::memset(ToRead.data(), 0, ToRead.size());
lib/Support/NativeFormatting.cpp 36 int InitialDigits = ((Buffer.size() - 1) % 3) + 1;
38 S.write(ThisGroup.data(), ThisGroup.size());
41 assert(Buffer.size() % 3 == 0);
lib/Support/Program.cpp 35 assert(Redirects.empty() || Redirects.size() == 3);
56 assert(Redirects.empty() || Redirects.size() == 3);
70 StringRefArgs.reserve(Args.size());
lib/Support/ScopedPrinter.cpp 25 if (Data.size() > 16)
42 OS << " (" << format_bytes(Data, None, Data.size(), 1, 0, true) << ")\n";
lib/Support/SourceMgr.cpp 197 for (unsigned i = 0, e = Ranges.size(); i != e; ++i) {
lib/Support/Unix/Path.inc 1004 sys::RetryAfterSignal(-1, ::read, FD, Buf.data(), Buf.size());
1014 sys::RetryAfterSignal(-1, ::pread, FD, Buf.data(), Buf.size(), Offset);
lib/Support/Unix/Program.inc 212 assert(Redirects.size() == 3);
lib/Support/raw_ostream.cpp 408 const size_t Size = Bytes.size();
441 for (size_t I = 0; I < Line.size(); ++I, CharsPrinted += 2) {
466 Bytes = Bytes.drop_front(Line.size());
467 LineIndex += Line.size();
lib/Support/xxhash.cpp 137 return xxHash64({(const char *)Data.data(), Data.size()});
lib/TableGen/Error.cpp 37 for (unsigned i = 1; i < Loc.size(); ++i)
lib/TableGen/Record.cpp 152 ID.AddInteger(Classes.size());
336 ID.AddInteger(Range.size());
352 void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Range.size()),
354 BitsInit *I = new(Mem) BitsInit(Range.size());
393 SmallVector<Init *, 16> NewBits(Bits.size());
395 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
506 SmallVector<Init *, 16> NewBits(Bits.size());
508 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
563 ID.AddInteger(Range.size());
583 void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Range.size()),
585 ListInit *I = new(Mem) ListInit(Range.size(), EltTy);
604 Elements.reserve(getValues().size());
628 Vals.reserve(Elements.size());
1422 NewBits.reserve(Bits.size());
1454 if (Elements.size() == 1)
1458 ListInits.reserve(Elements.size());
1586 ID.AddInteger(Args.size());
1603 void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(Args.size()),
1605 VarDefInit *I = new(Mem) VarDefInit(Class, Args.size());
1632 for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
1750 assert(CondRange.size() == ValRange.size() &&
1750 assert(CondRange.size() == ValRange.size() &&
1772 assert(CondRange.size() == ValRange.size() &&
1772 assert(CondRange.size() == ValRange.size() &&
1783 void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *>(2*CondRange.size()),
1785 CondOpInit *I = new(Mem) CondOpInit(CondRange.size(), Ty);
1790 I->getTrailingObjects<Init *>()+CondRange.size());
1905 void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *, StringInit *>(ArgRange.size(), NameRange.size()), alignof(BitsInit));
1905 void *Mem = Allocator.Allocate(totalSizeToAlloc<Init *, StringInit *>(ArgRange.size(), NameRange.size()), alignof(BitsInit));
1906 DagInit *I = new(Mem) DagInit(V, VN, ArgRange.size(), NameRange.size());
1906 DagInit *I = new(Mem) DagInit(V, VN, ArgRange.size(), NameRange.size());
2076 SCs = SCs.drop_back(1 + SC->getSuperClasses().size());
lib/TableGen/TGParser.cpp 189 Init *BI = V->getCastTo(BitsRecTy::get(BitList.size()));
196 for (unsigned i = 0, e = BitList.size(); i != e; ++i) {
238 if (TArgs.size() < SubClass.TemplateArgs.size())
246 for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
311 if (SMCTArgs.size() < SubMultiClass.TemplateArgs.size())
318 for (unsigned i = 0, e = SMCTArgs.size(); i != e; ++i) {
1847 if (ExpectedArgs.size() < Args.size()) {
1853 for (unsigned i = 0, e = ExpectedArgs.size(); i != e; ++i) {
2344 if (ArgN >= TArgs.size()) {
3082 if (TArgs.size() < TemplateVals.size())
3082 if (TArgs.size() < TemplateVals.size())
3087 for (unsigned i = 0, e = TArgs.size(); i != e; ++i) {
3088 if (i < TemplateVals.size()) {
lib/Target/AArch64/AArch64CallLowering.cpp 277 assert(VRegs.size() == SplitEVTs.size() &&
lib/Target/AArch64/AArch64ConditionOptimizer.cpp 307 assert(Cond.size() == 1 && "Unknown Cond array format");
lib/Target/AArch64/AArch64ConditionalCompares.cpp 275 assert(Cond.size() == 1 && "Unknown Cond array format");
287 assert(Cond.size() == 3 && "Unknown Cond array format");
292 assert(Cond.size() == 3 && "Unknown Cond array format");
lib/Target/AArch64/AArch64ISelDAGToDAG.cpp 1104 if (Regs.size() == 1)
1107 assert(Regs.size() >= 2 && Regs.size() <= 4);
1107 assert(Regs.size() >= 2 && Regs.size() <= 4);
1115 CurDAG->getTargetConstant(RegClassIDs[Regs.size() - 2], DL, MVT::i32));
1118 for (unsigned i = 0; i < Regs.size(); ++i) {
lib/Target/AArch64/AArch64ISelLowering.cpp 6660 if (M.size() != static_cast<size_t>(NumInputElements))
8789 assert(Shuffles.size() == Indices.size() &&
8789 assert(Shuffles.size() == Indices.size() &&
8856 for (unsigned i = 0; i < Shuffles.size(); i++) {
lib/Target/AArch64/AArch64InstrInfo.cpp 382 if (Cond.size() > 3)
509 unsigned ExtraCondLat = Cond.size() != 1;
547 switch (Cond.size()) {
2420 unsigned NumRegs = Indices.size();
2444 unsigned NumRegs = Indices.size();
3231 if (MI.isCopy() && Ops.size() == 1 &&
lib/Target/AArch64/AArch64TargetTransformInfo.cpp 232 if (Args.size() != 2 ||
lib/Target/AArch64/AsmParser/AArch64AsmParser.cpp 930 for (unsigned i = 0; i != AllowedModifiers.size(); ++i) {
lib/Target/AArch64/Disassembler/AArch64Disassembler.cpp 260 if (Bytes.size() < 4)
lib/Target/AArch64/MCTargetDesc/AArch64AsmBackend.cpp 386 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
400 assert((Offset + FulleSizeInBytes) <= Data.size() && "Invalid fixup size!");
566 for (size_t i = 0, e = Instrs.size(); i != e; ++i) {
lib/Target/AArch64/MCTargetDesc/AArch64MCTargetDesc.cpp 334 for (uint64_t Byte = 0, End = PltContents.size(); Byte + 7 < End;
lib/Target/AMDGPU/AMDGPUCallLowering.cpp 223 assert(DstRegs.size() > 1 && "Nothing to unpack");
236 for (int i = 0, e = DstRegs.size(); i != e; ++i)
255 for (unsigned i = 0, e = DstRegs.size(); i != e; ++i, Offset += PartSize)
473 OrigArgRegs.size() == 1
479 if (OrigArgRegs.size() > 1)
623 for (int I = 0, E = VRegs[Idx].size(); I != E; ++I)
lib/Target/AMDGPU/AMDGPUUnifyDivergentExitNodes.cpp 133 PN = PHINode::Create(F.getReturnType(), ReturningBlocks.size(),
lib/Target/AMDGPU/AsmParser/AMDGPUAsmParser.cpp 5388 for (auto Idx = TokCount; Idx < Tokens.size(); ++Idx)
lib/Target/AMDGPU/Disassembler/AMDGPUDisassembler.cpp 235 assert(Bytes.size() >= sizeof(T));
276 unsigned MaxInstBytesNum = std::min((size_t)TargetMaxInstBytes, Bytes_.size());
286 if (Bytes.size() >= 8) {
336 if (Bytes.size() < 4) break;
350 if (Bytes.size() < 4) break;
364 if (Res && (MaxInstBytesNum - Bytes.size()) == 12 && (!HasLiteral ||
391 if (Bytes.size() < 4 * NSAWords) {
427 Size = Res ? (MaxInstBytesNum - Bytes.size())
428 : std::min((size_t)4, Bytes_.size());
801 if (Bytes.size() < 4) {
803 Twine(Bytes.size()));
lib/Target/AMDGPU/GCNIterativeScheduler.cpp 339 Res.reserve(Schedule.size() * 2);
lib/Target/AMDGPU/MCTargetDesc/AMDGPUAsmBackend.cpp 149 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
lib/Target/AMDGPU/SIFrameLowering.cpp 300 AllSGPR128s = AllSGPR128s.slice(std::min(static_cast<unsigned>(AllSGPR128s.size()), NumPreloaded));
339 if (NumPreloaded > AllSGPRs.size())
360 if (AllSGPRs.size() < ReservedRegCount)
764 assert(Spill.size() == 1);
868 assert(Spill.size() == 1);
lib/Target/AMDGPU/SIISelLowering.cpp 1569 for (unsigned I = 0, E = Ins.size(), PSInputNum = 0; I != E; ++I) {
1657 if (RegIdx == ArgVGPRs.size()) {
1679 if (RegIdx == ArgSGPRs.size())
5159 if (Elts.size() == 1) {
5162 } else if (Elts.size() == 2) {
5165 } else if (Elts.size() <= 4) {
5168 } else if (Elts.size() <= 8) {
5172 assert(Elts.size() <= 16);
5178 for (unsigned i = 0; i < Elts.size(); ++i) {
5184 for (unsigned i = Elts.size(); i < NumElts; ++i)
11008 if (Indices.size() == 1 && Indices[0] == 1) {
lib/Target/AMDGPU/SIInstrInfo.cpp 707 for (unsigned Idx = 0; Idx < SubIndices.size(); ++Idx) {
712 SubIdx = SubIndices[SubIndices.size() - Idx - 1];
728 bool UseKill = KillSrc && Idx == SubIndices.size() - 1;
798 for (unsigned Idx = 0; Idx < SubIndices.size(); ++Idx) {
826 if (Cond.size() == 1) {
836 } else if (Cond.size() == 2) {
2059 if(Cond.size() == 1 && Cond[0].isReg()) {
lib/Target/AMDGPU/SIMachineScheduler.cpp 1298 unsigned Degree = Block->getSuccs().size();
1498 BlockNumSuccsLeft[i] = Block->getSuccs().size();
1649 TryCand.NumSuccessors = TryCand.Block->getSuccs().size();
lib/Target/AMDGPU/SIRegisterInfo.cpp 780 unsigned NumSubRegs = SplitParts.empty() ? 1 : SplitParts.size();
892 unsigned NumSubRegs = SplitParts.empty() ? 1 : SplitParts.size();
lib/Target/AMDGPU/Utils/AMDKernelCodeTUtils.cpp 50 assert(names.size() == altNames.size());
50 assert(names.size() == altNames.size());
51 for (unsigned i = 0; i < names.size(); ++i) {
109 const int Size = getPrinterTable().size();
lib/Target/ARC/ARCInstrInfo.cpp 379 assert((Cond.size() == 3 || Cond.size() == 0) &&
379 assert((Cond.size() == 3 || Cond.size() == 0) &&
lib/Target/ARC/Disassembler/ARCDisassembler.cpp 303 if (Bytes.size() < 2) {
312 if (Bytes.size() < 4) {
317 if (Bytes.size() >= 8) {
337 if (Bytes.size() >= 6) {
lib/Target/ARM/ARMBaseInstrInfo.cpp 444 assert((Cond.size() == 2 || Cond.size() == 0) &&
444 assert((Cond.size() == 2 || Cond.size() == 0) &&
521 if (Pred1.size() > 2 || Pred2.size() > 2)
521 if (Pred1.size() > 2 || Pred2.size() > 2)
lib/Target/ARM/ARMCallingConv.cpp 208 while (RegIdx % RegAlign != 0 && RegIdx < RegList.size())
249 if (RegIdx >= RegList.size())
lib/Target/ARM/ARMISelLowering.cpp 6720 return VT == MVT::v8i8 && M.size() == 8;
6725 if (Mask.size() == Elements * 2)
6757 if (M.size() != NumElts && M.size() != NumElts*2)
6757 if (M.size() != NumElts && M.size() != NumElts*2)
6765 for (unsigned i = 0; i < M.size(); i += NumElts) {
6774 if (M.size() == NumElts*2)
6789 if (M.size() != NumElts && M.size() != NumElts*2)
6789 if (M.size() != NumElts && M.size() != NumElts*2)
6792 for (unsigned i = 0; i < M.size(); i += NumElts) {
6801 if (M.size() == NumElts*2)
6821 if (M.size() != NumElts && M.size() != NumElts*2)
6821 if (M.size() != NumElts && M.size() != NumElts*2)
6824 for (unsigned i = 0; i < M.size(); i += NumElts) {
6832 if (M.size() == NumElts*2)
6851 if (M.size() != NumElts && M.size() != NumElts*2)
6851 if (M.size() != NumElts && M.size() != NumElts*2)
6855 for (unsigned i = 0; i < M.size(); i += NumElts) {
6868 if (M.size() == NumElts*2)
6892 if (M.size() != NumElts && M.size() != NumElts*2)
6892 if (M.size() != NumElts && M.size() != NumElts*2)
6895 for (unsigned i = 0; i < M.size(); i += NumElts) {
6906 if (M.size() == NumElts*2)
6925 if (M.size() != NumElts && M.size() != NumElts*2)
6925 if (M.size() != NumElts && M.size() != NumElts*2)
6928 for (unsigned i = 0; i < M.size(); i += NumElts) {
6939 if (M.size() == NumElts*2)
6977 if (NumElts != M.size())
6991 if (NumElts != M.size() || (VT != MVT::v8i16 && VT != MVT::v16i8))
16744 assert(Shuffles.size() == Indices.size() &&
16744 assert(Shuffles.size() == Indices.size() &&
16816 for (unsigned i = 0; i < Shuffles.size(); i++) {
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 629 unsigned NumRegs = Regs.size();
835 assert(Regs.size() == 2);
lib/Target/ARM/Disassembler/ARMDisassembler.cpp 631 if (Bytes.size() < 4) {
917 if (Bytes.size() < 2) {
970 if (Bytes.size() < 4) {
lib/Target/ARM/MCTargetDesc/ARMAsmBackend.cpp 1047 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
1053 assert((Offset + FullSizeBytes) <= Data.size() && "Invalid fixup size!");
1114 for (size_t i = 0, e = Instrs.size(); i != e; ++i) {
lib/Target/AVR/AVRInstrInfo.cpp 408 assert((Cond.size() == 1 || Cond.size() == 0) &&
408 assert((Cond.size() == 1 || Cond.size() == 0) &&
lib/Target/AVR/Disassembler/AVRDisassembler.cpp 80 if (Bytes.size() < 2) {
94 if (Bytes.size() < 4) {
lib/Target/AVR/MCTargetDesc/AVRAsmBackend.cpp 378 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
lib/Target/BPF/Disassembler/BPFDisassembler.cpp 143 if (Bytes.size() < 8) {
191 if (Bytes.size() < 16) {
lib/Target/Hexagon/Disassembler/HexagonDisassembler.cpp 179 if (Bytes.size() < HEXAGON_INSTR_SIZE)
296 assert(Bytes.size() >= HEXAGON_INSTR_SIZE);
524 if (RegNo < Table.size()) {
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 133 Node Num = Order.size();
165 for (unsigned P = 0; P != Order.size(); ++P) {
175 for (unsigned I = 0; I != Order.size(); ++I) {
262 for (unsigned I = 0; I != Order.size(); ++I)
272 for (unsigned I = 0; I != Order.size(); ++I) {
333 Order.assign(Ord.data(), Ord.data()+Ord.size());
763 for (unsigned I = 0, E = Mask.size(); I != E; ++I) {
776 size_t H = Mask.size()/2;
780 size_t H = Mask.size()/2;
867 unsigned VecLen = Mask.size();
868 assert(MaskL.size() == VecLen && MaskR.size() == VecLen);
868 assert(MaskL.size() == VecLen && MaskR.size() == VecLen);
885 assert(A.size() > 0 && A.size() >= MaxLen);
885 assert(A.size() > 0 && A.size() >= MaxLen);
904 for (int I = 0, E = Mask.size(); I != E; ++I) {
914 assert(Mask.size() < 0x00007FFF && "Sanity failure");
921 int N = Mask.size();
1058 int VecLen = SM.Mask.size();
1063 for (int I = 0, E = M.Mask.size(); I != E; ++I) {
1183 int VecLen = SM.Mask.size();
1213 size_t S = Bytes.size() / 2;
1221 unsigned VecLen = SM.Mask.size();
1247 int VecLen = SM.Mask.size();
1271 int VecLen = SM.Mask.size();
1311 int VecLen = SM.Mask.size();
1366 unsigned VecLen = Mask.size();
1504 int VecLen = SM.Mask.size();
1628 int VecLen = SM.Mask.size();
1678 int VecLen = SM.Mask.size();
1952 int VecLen = SM.Mask.size();
1994 MVT VecTy = MVT::getVectorVT(MVT::i8, Data.size());
lib/Target/Hexagon/HexagonISelLowering.cpp 1914 assert(AM.size() <= 8 && "Unexpected shuffle mask");
1915 unsigned VecLen = AM.size();
1936 if (F == AM.size())
2101 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
2126 assert(VecTy.getVectorNumElements() == Elem.size());
2128 SmallVector<ConstantInt*,4> Consts(Elem.size());
2131 unsigned First, Num = Elem.size();
2143 assert(Elem.size() == 2);
2183 assert(Elem.size() == 4);
2209 assert(VecTy.getVectorNumElements() == Elem.size());
2211 SmallVector<ConstantInt*,8> Consts(Elem.size());
2214 unsigned First, Num = Elem.size();
2510 for (ArrayRef<SDValue> A(Rs); A.size() != 1; A = A.drop_back(A.size()/2)) {
2510 for (ArrayRef<SDValue> A(Rs); A.size() != 1; A = A.drop_back(A.size()/2)) {
2511 for (unsigned i = 0, e = A.size()/2; i != e; ++i)
lib/Target/Hexagon/HexagonISelLoweringHVX.cpp 346 unsigned VecLen = Values.size();
589 unsigned VecLen = Values.size();
lib/Target/Hexagon/HexagonInstrInfo.cpp 626 assert((Cond.size() == 3) && "Only supporting rr/ri version of nvjump");
643 assert((Cond.size() == 2) && "Malformed cond vector");
4263 assert(Cond.size() == 2);
4428 return Cond.empty() || (Cond[0].isImm() && (Cond.size() != 1));
lib/Target/Hexagon/HexagonTargetTransformInfo.cpp 221 if (Indices.size() != Factor || UseMaskForCond || UseMaskForGaps)
lib/Target/Hexagon/MCTargetDesc/HexagonAsmBackend.cpp 429 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
518 << ": Offset=" << Offset << ": Size=" << Data.size() << ": OInst=0x";
lib/Target/Lanai/Disassembler/LanaiDisassembler.cpp 78 if (Bytes.size() < 4) {
lib/Target/Lanai/LanaiInstrInfo.cpp 678 assert((Condition.size() == 1) &&
lib/Target/MSP430/Disassembler/MSP430Disassembler.cpp 252 if (Bytes.size() < (Words + 1) * 2) {
266 if (Bytes.size() < (Words + 1) * 2) {
307 if (Bytes.size() < (Words + 1) * 2) {
372 if (Bytes.size() < 2) {
lib/Target/MSP430/MCTargetDesc/MSP430AsmBackend.cpp 149 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
lib/Target/MSP430/MSP430InstrInfo.cpp 273 assert((Cond.size() == 1 || Cond.size() == 0) &&
273 assert((Cond.size() == 1 || Cond.size() == 0) &&
lib/Target/Mips/Disassembler/MipsDisassembler.cpp 1164 if (Bytes.size() < 2) {
1184 if (Bytes.size() < 4) {
lib/Target/Mips/MipsCallLowering.cpp 43 for (unsigned i = 0; i < VRegs.size(); ++i)
64 for (unsigned ArgsIndex = 0, ArgLocsIndex = 0; ArgsIndex < Args.size();
506 if (ArgRegs.size() == Idx)
511 (int)(RegSize * (ArgRegs.size() - Idx));
518 for (unsigned I = Idx; I < ArgRegs.size(); ++I, VaArgOffset += RegSize) {
lib/Target/Mips/MipsISelLowering.cpp 4191 (int)((ByValArgRegs.size() - FirstReg) * GPRSizeInBytes);
4338 if (ArgRegs.size() == Idx)
4343 (int)(RegSizeInBytes * (ArgRegs.size() - Idx));
4355 for (unsigned I = Idx; I < ArgRegs.size();
4406 for (unsigned I = FirstReg; Size > 0 && (I < IntArgRegs.size());
lib/Target/Mips/MipsInstrInfo.cpp 112 for (unsigned i = 1; i < Cond.size(); ++i) {
135 assert((Cond.size() <= 3) &&
lib/Target/NVPTX/NVPTXInstrInfo.cpp 190 assert((Cond.size() == 1 || Cond.size() == 0) &&
190 assert((Cond.size() == 1 || Cond.size() == 0) &&
lib/Target/PowerPC/Disassembler/PPCDisassembler.cpp 330 if (Bytes.size() < 4) {
lib/Target/PowerPC/PPCBranchCoalescing.cpp 329 if (OpList1.size() != OpList2.size()) {
329 if (OpList1.size() != OpList2.size()) {
334 for (unsigned i = 0; i < OpList1.size(); ++i) {
lib/Target/PowerPC/PPCInstrInfo.cpp 710 assert((Cond.size() == 2 || Cond.size() == 0) &&
710 assert((Cond.size() == 2 || Cond.size() == 0) &&
759 if (Cond.size() != 2)
797 assert(Cond.size() == 2 &&
1525 assert(Pred1.size() == 2 && "Invalid PPC first predicate");
1526 assert(Pred2.size() == 2 && "Invalid PPC second predicate");
lib/Target/RISCV/Disassembler/RISCVDisassembler.cpp 327 if (Bytes.size() < 4) {
336 if (Bytes.size() < 2) {
lib/Target/RISCV/MCTargetDesc/RISCVAsmBackend.cpp 301 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
lib/Target/RISCV/RISCVISelLowering.cpp 1958 if (ArgRegs.size() == Idx) {
1962 VarArgsSaveSize = XLenInBytes * (ArgRegs.size() - Idx);
1981 for (unsigned I = Idx; I < ArgRegs.size();
lib/Target/RISCV/RISCVInstrInfo.cpp 343 assert((Cond.size() == 3 || Cond.size() == 0) &&
343 assert((Cond.size() == 3 || Cond.size() == 0) &&
lib/Target/Sparc/Disassembler/SparcDisassembler.cpp 318 if (Bytes.size() < 4) {
lib/Target/Sparc/SparcInstrInfo.cpp 249 assert((Cond.size() == 1 || Cond.size() == 0) &&
249 assert((Cond.size() == 1 || Cond.size() == 0) &&
lib/Target/SystemZ/Disassembler/SystemZDisassembler.cpp 456 if (Bytes.size() < 2)
473 if (Bytes.size() < Size)
lib/Target/SystemZ/MCTargetDesc/SystemZMCAsmBackend.cpp 107 assert(Offset + Size <= Data.size() && "Invalid fixup offset!");
lib/Target/SystemZ/SystemZInstrInfo.cpp 489 assert((Cond.size() == 2 || Cond.size() == 0) &&
489 assert((Cond.size() == 2 || Cond.size() == 0) &&
541 if (Pred.size() != 2)
575 assert(Pred.size() == 2 && "Invalid condition");
720 assert(Pred.size() == 2 && "Invalid condition");
1006 if (Ops.size() == 2 && Ops[0] == 0 && Ops[1] == 1) {
1034 if (Ops.size() != 1)
lib/Target/SystemZ/SystemZTargetTransformInfo.cpp 381 if ((SignedDivRem || UnsignedDivRem) && Args.size() == 2) {
471 if (Args.size() == 2 && ST->hasMiscellaneousExtensions3()) {
lib/Target/WebAssembly/Disassembler/WebAssemblyDisassembler.cpp 78 if (Size >= Bytes.size())
90 Bytes.data() + Bytes.size(), &Error)
92 Bytes.data() + Bytes.size(),
111 if (Size + sizeof(T) > Bytes.size())
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyAsmBackend.cpp 118 assert(Offset + NumBytes <= Data.size() && "Invalid fixup offset!");
lib/Target/WebAssembly/WebAssemblyExceptionInfo.cpp 155 for (unsigned I = 0; I < getBlocks().size(); ++I) {
lib/Target/WebAssembly/WebAssemblyInstrInfo.cpp 192 assert(Cond.size() == 2 && "Expected a flag and a successor block");
lib/Target/X86/Disassembler/X86Disassembler.cpp 190 if (Bytes.size() <= Index)
lib/Target/X86/MCTargetDesc/X86AsmBackend.cpp 115 assert(Fixup.getOffset() + Size <= Data.size() && "Invalid fixup offset!");
541 for (unsigned i = 0, e = Instrs.size(); i != e; ++i) {
lib/Target/X86/MCTargetDesc/X86MCTargetDesc.cpp 472 for (uint64_t Byte = 0, End = PltContents.size(); Byte + 6 < End; ) {
497 for (uint64_t Byte = 0, End = PltContents.size(); Byte + 6 < End; ) {
lib/Target/X86/Utils/X86ShuffleDecode.cpp 308 for (int i = 0, e = RawMask.size(); i < e; ++i) {
340 assert(RawMask.size() == 16 && "Illegal VPPERM shuffle mask size");
355 for (int i = 0, e = RawMask.size(); i < e; ++i) {
502 for (unsigned i = 0, e = RawMask.size(); i < e; ++i) {
522 assert((NumElts == RawMask.size()) && "Unexpected mask size");
524 for (unsigned i = 0, e = RawMask.size(); i < e; ++i) {
562 uint64_t EltMaskSize = RawMask.size() - 1;
563 for (int i = 0, e = RawMask.size(); i != e; ++i) {
576 uint64_t EltMaskSize = (RawMask.size() * 2) - 1;
577 for (int i = 0, e = RawMask.size(); i != e; ++i) {
lib/Target/X86/X86CallLowering.cpp 204 assert(VRegs.size() == SplitEVTs.size() &&
351 Arg.hasAttribute(Attribute::Nest) || VRegs[Idx].size() > 1)
lib/Target/X86/X86ISelLowering.cpp 3401 FuncInfo->setVarArgsFPOffset(ArgGPRs.size() * 8 + NumXMMRegs * 16);
3403 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
3403 ArgGPRs.size() * 8 + ArgXMMs.size() * 16, 16, false));
3423 if (!ArgXMMs.empty() && NumXMMRegs != ArgXMMs.size()) {
5198 unsigned NumElts = Mask.size();
5204 unsigned NumElts = Mask.size();
5287 WidenedMask.assign(Mask.size() / 2, 0);
5288 for (int i = 0, Size = Mask.size(); i < Size; i += 2) {
5329 assert(WidenedMask.size() == Mask.size() / 2 &&
5393 assert(Bits.size() == Undefs.getBitWidth() &&
5407 for (unsigned i = 0, e = Bits.size(); i != e; ++i) {
7797 unsigned NumElems = Elts.size();
10125 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
10140 int Size = Mask.size();
10163 int Size = Mask.size();
10213 int Size = Mask.size();
10254 if (Mask.size() != ExpectedMask.size())
10254 if (Mask.size() != ExpectedMask.size())
10257 int Size = Mask.size();
10292 int Size = Mask.size();
10293 if (Size != (int)ExpectedMask.size())
10367 MVT EltVT = MVT::getIntegerVT(128 / Mask.size());
10368 MVT VT = MVT::getVectorVT(EltVT, Mask.size());
10390 assert(Mask.size() % 2 == 0 && "Expecting even number of elements in mask");
10391 unsigned HalfSize = Mask.size() / 2;
10408 assert(Mask.size() == 4 && "Only 4-lane shuffle masks");
10437 APInt Zeroable(Mask.size(), 0);
10445 int ScalarSizeInBits = VectorSizeInBits / Mask.size();
10448 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
10517 for (int i = 0, e = Mask.size(); i < e; i++) {
10543 int Size = Mask.size();
10733 int Size = (int)Mask.size();
10777 if (Mask.size() != VT.getVectorNumElements())
10906 MaskVT = MVT::getVectorVT(EltVT, Mask.size());
10915 MVT::getVectorVT(EltVT == MVT::f64 ? MVT::i64 : MVT::i32, Mask.size());
10921 SmallVector<SDValue, 16> VMaskOps(Mask.size(), Zero);
10923 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
10958 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
10986 assert(Mask.size() <= 64 && "Shuffle mask too big for blend mask");
10990 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
11195 SmallVector<int, 32> BlendMask(Mask.size(), -1);
11196 SmallVector<int, 32> PermuteMask(Mask.size(), -1);
11198 for (int i = 0, Size = Mask.size(); i < Size; ++i) {
11231 int NumElts = Mask.size();
11386 SmallVector<int, 32> V1Mask(Mask.size(), -1);
11387 SmallVector<int, 32> V2Mask(Mask.size(), -1);
11388 SmallVector<int, 32> BlendMask(Mask.size(), -1);
11389 for (int i = 0, Size = Mask.size(); i < Size; ++i)
11429 int NumElts = Mask.size();
11562 assert(Mask.size() <= 16 &&
11625 unsigned NumElts = Mask.size();
11701 int Size = Mask.size();
11764 int Size = Mask.size();
11798 int Size = Mask.size();
11854 int Size = Mask.size();
12021 assert(NumElements == (int)Mask.size() && "Unexpected shuffle mask size!");
12116 assert((int)Mask.size() == NumElements && "Unexpected shuffle mask size");
12270 find_if(Mask, [&Mask](int M) { return M >= (int)Mask.size(); }) -
12273 for (int i = 0, Size = Mask.size(); i < Size; ++i)
12284 SDValue V2S = getScalarValueForVectorElement(V2, Mask[V2Index] - Mask.size(),
12300 } else if (Mask[V2Index] != (int)Mask.size() || EltVT == MVT::i8 ||
12342 SmallVector<int, 4> V2Shuffle(Mask.size(), 1);
12415 assert(Mask.size() == 4 && "Unsupported mask size!");
12500 unsigned NumElts = Mask.size();
12519 assert(BroadcastIdx < (int)Mask.size() && "We only expect to be called with "
12686 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
12802 assert(Mask.size() >= 2 && "Single element masks are invalid.");
12804 int Size = Mask.size();
12914 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
12998 assert(Mask.size() == 2 && "Unexpected mask size for v2 shuffle!");
13183 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
13279 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
13407 assert(Mask.size() == 8 && "Shuffle mask length doesn't match!");
13531 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
13531 assert((AToAInputs.size() == 3 || AToAInputs.size() == 1) &&
13533 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
13533 assert((BToAInputs.size() == 1 || BToAInputs.size() == 3) &&
13535 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
13535 assert(AToAInputs.size() + BToAInputs.size() == 4 &&
13538 bool ThreeAInputs = AToAInputs.size() == 3;
13564 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
13564 if (BToBInputs.size() == 2 && AToBInputs.size() == 2) {
13612 BToAInputs.size() == 3 ? TripleNonInputIdx : OneInput;
13664 if (InPlaceInputs.size() == 1) {
13679 assert(InPlaceInputs.size() == 2 && "Cannot handle 3 or 4 inputs!");
13764 if (IncomingInputs.size() == 1) {
13774 } else if (IncomingInputs.size() == 2) {
13904 int Size = Mask.size();
13966 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
14107 int ShuffleModulus = Mask.size() * (IsSingleInput ? 1 : 2);
14118 for (int i = 0, e = Mask.size(); i < e; ++i) {
14174 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
14255 for (int i = 0, ie = MovingInputs.size(); i < ie; ++i) {
14520 ArrayRef<int> LoMask = Mask.slice(0, Mask.size() / 2);
14521 ArrayRef<int> HiMask = Mask.slice(Mask.size() / 2);
14644 int Size = Mask.size();
14764 int Size = Mask.size();
14922 int NumElts = Mask.size();
14962 assert(M1.size() == M2.size() && "Unexpected mask size");
14962 assert(M1.size() == M2.size() && "Unexpected mask size");
14963 for (int i = 0, e = M1.size(); i != e; ++i)
14970 assert(Mask.size() == MergedMask.size() && "Unexpected mask size");
14970 assert(Mask.size() == MergedMask.size() && "Unexpected mask size");
14971 for (int i = 0, e = MergedMask.size(); i != e; ++i) {
15085 assert((Mask.size() == HalfMask.size() * 2) &&
15085 assert((Mask.size() == HalfMask.size() * 2) &&
15094 unsigned HalfNumElts = HalfMask.size();
15288 int Size = Mask.size();
15550 if (Zeroable.countLeadingOnes() < (Mask.size() - 8))
15581 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
15689 assert(Mask.size() == 4 && "Unexpected mask size for v4 shuffle!");
15787 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
15886 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
15997 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
16097 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
16360 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
16414 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
16467 assert(Mask.size() == 8 && "Unexpected mask size for v8 shuffle!");
16530 assert(Mask.size() == 16 && "Unexpected mask size for v16 shuffle!");
16599 assert(Mask.size() == 32 && "Unexpected mask size for v32 shuffle!");
16652 assert(Mask.size() == 64 && "Unexpected mask size for v64 shuffle!");
16725 int NumElts = Mask.size();
16775 int NumElts = Mask.size();
16814 int Size = Mask.size();
16854 int NumElts = Mask.size();
16974 int NumElements = Mask.size();
17012 for (int i = 0, Size = Mask.size(); i < Size; ++i)
17021 for (int i = 0, Size = Mask.size(); i < Size; ++i)
17080 int MaskUpperLimit = OrigMask.size() * (V2IsUndef ? 1 : 2);
31819 unsigned NumMaskElts = Mask.size();
31951 unsigned NumMaskElts = Mask.size();
31982 ShuffleVT = MVT::getVectorVT(MVT::f64, Mask.size());
31984 for (int i = 0, e = Mask.size(); i != e; ++i) {
32136 unsigned NumMaskElts = Mask.size();
32294 assert((Inputs.size() == 1 || Inputs.size() == 2) &&
32294 assert((Inputs.size() == 1 || Inputs.size() == 2) &&
32299 bool UnaryShuffle = (Inputs.size() == 1);
32314 unsigned NumBaseMaskElts = BaseMask.size();
32816 unsigned NumMaskElts = BaseMask.size();
32817 unsigned NumInputs = Inputs.size();
32921 unsigned NumMaskElts = Mask.size();
32923 unsigned NumOps = Ops.size();
33029 assert(RootMask.size() > 0 && (RootMask.size() > 1 || RootMask[0] == 0) &&
33029 assert(RootMask.size() > 0 && (RootMask.size() > 1 || RootMask[0] == 0) &&
33087 assert(((RootMask.size() > OpMask.size() &&
33088 RootMask.size() % OpMask.size() == 0) ||
33089 (OpMask.size() > RootMask.size() &&
33090 OpMask.size() % RootMask.size() == 0) ||
33091 OpMask.size() == RootMask.size()) &&
33097 assert(isPowerOf2_32(RootMask.size()) && "Non-power-of-2 shuffle mask sizes");
33099 unsigned RootMaskSizeLog2 = countTrailingZeros(RootMask.size());
33102 unsigned MaskWidth = std::max<unsigned>(OpMask.size(), RootMask.size());
33104 unsigned OpRatio = std::max<unsigned>(1, RootMask.size() >> OpMaskSizeLog2);
33801 unsigned Size = Mask.size();
34121 SmallVector<int, 8> HalfMask(Mask.size() / 2);
44330 unsigned NumOps = Ops.size();
45186 assert(SrcVT.getVectorNumElements() == ShuffleMask.size() &&
lib/Target/X86/X86ISelLowering.h 1678 size_t NumElts = Mask.size();
lib/Target/X86/X86InstrInfo.cpp 2777 assert((Cond.size() == 1 || Cond.size() == 0) &&
2777 assert((Cond.size() == 1 || Cond.size() == 0) &&
2836 if (Cond.size() != 1)
2873 assert(Cond.size() == 1 && "Invalid Cond array");
4610 unsigned NumAddrOps = MOs.size();
4620 assert(MOs.size() == 5 && "Unexpected memory operand list length");
4857 if (MOs.size() == X86::AddrNumOperands &&
5031 if (Ops.size() == 2 && Ops[0] == 0 && Ops[1] == 1) {
5048 } else if (Ops.size() != 1)
5256 if (Ops.size() == 2 && Ops[0] == 0 && Ops[1] == 1) {
5268 } else if (Ops.size() != 1)
lib/Target/X86/X86InterleavedAccess.cpp 260 for (unsigned i = 0; i < Mask.size(); i++)
262 for (unsigned i = 0; i < Mask.size(); i++)
691 assert(Matrix.size() == 4 && "Invalid matrix size");
753 for (unsigned i = 0, e = Shuffles.size(); i < e; ++i)
812 assert(Shuffles.size() == Indices.size() &&
812 assert(Shuffles.size() == Indices.size() &&
lib/Target/X86/X86TargetTransformInfo.cpp 221 if (Args.size() == 2 && ISD == ISD::MUL && LT.second == MVT::v4i32) {
3496 if (Indices.size() && Indices.size() != Factor)
3496 if (Indices.size() && Indices.size() != Factor)
3658 Indices.size() ? Indices.size() : Factor;
3658 Indices.size() ? Indices.size() : Factor;
lib/Target/XCore/Disassembler/XCoreDisassembler.cpp 48 if (Bytes.size() < 2) {
60 if (Bytes.size() < 4) {
lib/Target/XCore/XCoreInstrInfo.cpp 279 assert((Cond.size() == 2 || Cond.size() == 0) &&
279 assert((Cond.size() == 2 || Cond.size() == 0) &&
297 assert(Cond.size() == 2 && "Unexpected number of components!");
lib/Transforms/Coroutines/Coroutines.cpp 446 if (SuspendResultTys.size() != ResumeTys.size()) {
446 if (SuspendResultTys.size() != ResumeTys.size()) {
453 for (size_t I = 0, E = ResumeTys.size(); I != E; ++I) {
lib/Transforms/IPO/FunctionImport.cpp 227 CalleeSummaryList.size() > 1 &&
lib/Transforms/IPO/HotColdSplitting.cpp 277 LLVM_DEBUG(dbgs() << "Applying bonus for: " << Region.size()
279 Penalty -= Region.size();
lib/Transforms/IPO/LowerTypeTests.cpp 282 totalSizeToAlloc<MDNode *>(Types.size()), alignof(GlobalTypeMember)));
284 GTM->NTypes = Types.size();
315 Alloc.Allocate(totalSizeToAlloc<GlobalTypeMember *>(Targets.size()),
319 Call->NTargets = Targets.size();
869 for (unsigned I = 0; I != Globals.size(); ++I) {
1357 AsmArgs.reserve(Functions.size() * 2);
1361 for (unsigned I = 0; I != Functions.size(); ++I)
1485 for (unsigned I = 0; I != Functions.size(); ++I)
1495 ArrayType::get(getJumpTableEntryType(), Functions.size());
1506 for (unsigned I = 0; I != Functions.size(); ++I) {
1593 for (unsigned I = 0; I != TypeIds.size(); ++I)
1598 std::vector<std::set<uint64_t>> TypeMembers(TypeIds.size());
1629 GlobalLayoutBuilder GLB(Globals.size());
1636 std::vector<GlobalTypeMember *> OrderedGTMs(Globals.size());
lib/Transforms/IPO/WholeProgramDevirt.cpp 179 if (VTUsed.size() > Offset)
188 if (I < B.size())
200 while ((I + Byte) < B.size() && Byte < (Size / 8)) {
717 assert(VI.getSummaryList().size() == 1 &&
846 assert(P.VTableVI.getSummaryList().size() == 1 ||
985 auto Size = TheFn.getSummaryList().size();
1036 if (TargetsForSlot.size() > ClThreshold)
1167 if (Target.Fn->arg_size() != Args.size() + 1)
1174 for (unsigned I = 0; I != Args.size(); ++I) {
lib/Transforms/InstCombine/InstCombineVectorOps.cpp 1182 if (ITy->isVectorTy() && Mask.size() > ITy->getVectorNumElements())
1198 for (int i = 0, e = Mask.size(); i != e; ++i) {
1236 assert(NewOps.size() == 2 && "binary operator with #ops != 2");
1252 assert(NewOps.size() == 2 && "icmp with #ops != 2");
1256 assert(NewOps.size() == 2 && "fcmp with #ops != 2");
1273 assert(NewOps.size() == 1 && "cast with #ops != 1");
1296 return UndefValue::get(VectorType::get(EltTy, Mask.size()));
1299 return ConstantAggregateZero::get(VectorType::get(EltTy, Mask.size()));
1303 for (int i = 0, e = Mask.size(); i != e; ++i) {
1347 bool NeedsRebuild = (Mask.size() != I->getType()->getVectorNumElements());
1373 for (int e = Mask.size(); Index != e; ++Index) {
lib/Transforms/Instrumentation/AddressSanitizer.cpp 2042 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2042 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2045 for (size_t i = 0; i < ExtendedGlobals.size(); i++) {
2067 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2067 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2069 SmallVector<GlobalValue *, 16> MetadataGlobals(ExtendedGlobals.size());
2070 for (size_t i = 0; i < ExtendedGlobals.size(); i++) {
2125 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2125 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2131 SmallVector<GlobalValue *, 16> LivenessGlobals(ExtendedGlobals.size());
2133 for (size_t i = 0; i < ExtendedGlobals.size(); i++) {
2182 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2182 assert(ExtendedGlobals.size() == MetadataInitializers.size());
2183 unsigned N = ExtendedGlobals.size();
2845 copyToShadow(ShadowMask, ShadowBytes, 0, ShadowMask.size(), IRB, ShadowBase);
2852 assert(ShadowMask.size() == ShadowBytes.size());
2852 assert(ShadowMask.size() == ShadowBytes.size());
lib/Transforms/Instrumentation/GCOVProfiling.cpp 1004 for (int j : llvm::seq<int>(0, CountersBySP.size())) {
1025 int CountersSize = CountersBySP.size();
lib/Transforms/Instrumentation/IndirectCallPromotion.cpp 226 << " Num_targets: " << ValueDataRef.size()
lib/Transforms/Instrumentation/InstrProfiling.cpp 195 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
lib/Transforms/Instrumentation/PoisonChecking.cpp 92 if (Ops.size() == 0)
95 for (; i < Ops.size() && isConstantFalse(Ops[i]); i++) {}
96 if (i == Ops.size())
99 for (; i < Ops.size(); i++)
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 669 size_t N = AllBlocks.size();
698 AllBlocks.size(), F, Int32Ty, SanCovGuardsSectionName);
702 AllBlocks.size(), F, Int8Ty, SanCovCountersSectionName);
713 for (size_t i = 0, N = AllBlocks.size(); i < N; i++)
lib/Transforms/Scalar/Float2Int.cpp 256 assert(Ops.size() == 1 && "FNeg is a unary operator!");
267 assert(Ops.size() == 2 && "its a binary operator!");
280 assert(Ops.size() == 1 && "FPTo[US]I is a unary operator!");
290 assert(Ops.size() == 2 && "FCmp is a binary operator!");
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 1786 if (L->getBlocks().size() >= LoopSizeCutoff) {
lib/Transforms/Scalar/JumpThreading.cpp 2126 Updates.reserve((2 * Preds.size()) + NewBBs.size());
lib/Transforms/Scalar/LoopUnrollAndJamPass.cpp 246 if (SubLoop->getBlocks().size() != 1) {
lib/Transforms/Scalar/LoopUnswitch.cpp 1003 << loopHeader->getName() << " [" << L->getBlocks().size()
1237 << loopHeader->getName() << " [" << L->getBlocks().size()
lib/Transforms/Scalar/MergeICmps.cpp 574 if (Comparisons.size() == 1)
587 Scratch.reserve(size + Comparisons.size() - 1);
592 for (int I = 1, E = Comparisons.size(); I < E; ++I) {
624 LLVM_DEBUG(dbgs() << "Merging " << Comparisons.size() << " comparisons -> "
626 if (Comparisons.size() == 1) {
lib/Transforms/Scalar/NewGVN.cpp 986 unsigned NumOps = PHIOperands.size();
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 1208 for (size_t i = 0; i < records.size(); i++) {
1280 assert(Index < LiveVec.size() && "Bug in std::find?");
1307 for (unsigned i = 0; i < LiveVariables.size(); i++) {
1703 PromotableAllocas.reserve(Live.size());
1864 assert(PromotableAllocas.size() == Live.size() + NumRematerializedValues &&
1920 for (size_t i = 0; i < records.size(); i++) {
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 978 NewBlocks.reserve(L.getNumBlocks() + ExitBlocks.size());
1218 ClonedExitsInLoops.reserve(ExitBlocks.size());
1684 ExitsInLoops.reserve(ExitBlocks.size());
1916 assert(Invariants.size() == 1 &&
2212 bool ReplaceUnswitched = FullUnswitch || (Invariants.size() == 1);
2734 TI, /*FullUnswitch*/ !BI || (Invariants.size() == 1 &&
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 563 LLVM_DEBUG(dbgs() << " Speculating around " << SpecPNs.size() << " PHIs!\n");
564 NumPHIsSpeculated += SpecPNs.size();
lib/Transforms/Utils/BasicBlockUtils.cpp 98 assert(Dead.size() == BBs.size() && "Duplicating blocks?");
576 PHINode::Create(PN->getType(), Preds.size(), PN->getName() + ".ph", BI);
629 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
684 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
lib/Transforms/Utils/BreakCriticalEdges.cpp 126 PN.getType(), Preds.size(), "split",
128 for (unsigned i = 0, e = Preds.size(); i != e; ++i)
lib/Transforms/Utils/FunctionComparator.cpp 188 if (int Res = cmpNumbers(OBL.Inputs.size(), OBR.Inputs.size()))
188 if (int Res = cmpNumbers(OBL.Inputs.size(), OBR.Inputs.size()))
590 if (int Res = cmpNumbers(LIndices.size(), RIndices.size()))
590 if (int Res = cmpNumbers(LIndices.size(), RIndices.size()))
592 for (size_t i = 0, e = LIndices.size(); i != e; ++i) {
601 if (int Res = cmpNumbers(LIndices.size(), RIndices.size()))
601 if (int Res = cmpNumbers(LIndices.size(), RIndices.size()))
603 for (size_t i = 0, e = LIndices.size(); i != e; ++i) {
lib/Transforms/Utils/InlineFunction.cpp 1759 MergedDeoptArgs.reserve(ParentDeopt->Inputs.size() +
1760 ChildOB.Inputs.size());
lib/Transforms/Utils/LoopRotationUtils.cpp 206 if (L->getBlocks().size() == 1)
lib/Transforms/Utils/LoopSimplify.cpp 309 for (unsigned i = 0; i != L->getBlocks().size(); ++i) {
lib/Transforms/Utils/ModuleUtils.cpp 124 assert(InitArgs.size() == InitArgTypes.size() &&
124 assert(InitArgs.size() == InitArgTypes.size() &&
lib/Transforms/Utils/SSAUpdaterBulk.cpp 79 if (DT->isReachableFromEntry(BB) && PredCache.get(BB).size()) {
lib/Transforms/Utils/SimplifyCFG.cpp 5535 uint64_t NumCases = Values.size();
lib/Transforms/Utils/ValueMapper.cpp 1022 WE.AppendingGVNumNewMembers = NewMembers.size();
lib/Transforms/Vectorize/LoadStoreVectorizer.cpp 558 if (NumFound == Chain.size()) {
588 unsigned SizeBytes = ElementSizeBytes * Chain.size();
590 if (NumLeft == Chain.size()) {
719 for (unsigned ChainLen = Chain.size(); ChainIdx < ChainLen; ++ChainIdx) {
870 LLVM_DEBUG(dbgs() << "LSV: Vectorizing " << Instrs.size()
877 for (int i = 0, e = Instrs.size(); i < e; ++i) {
962 unsigned ChainSize = Chain.size();
976 if (NewChain.size() == 1) {
984 ChainSize = Chain.size();
995 Chain.size() * VecStoreTy->getNumElements());
997 VecTy = VectorType::get(StoreTy, Chain.size());
1049 for (unsigned I = 0, E = Chain.size(); I != E; ++I) {
1064 for (unsigned I = 0, E = Chain.size(); I != E; ++I) {
1085 NumScalarsVectorized += Chain.size();
1113 unsigned ChainSize = Chain.size();
1127 if (NewChain.size() == 1) {
1135 ChainSize = Chain.size();
1145 Chain.size() * VecLoadTy->getNumElements());
1147 VecTy = VectorType::get(LoadTy, Chain.size());
1203 for (unsigned I = 0, E = Chain.size(); I != E; ++I) {
1229 for (unsigned I = 0, E = Chain.size(); I != E; ++I) {
1248 NumScalarsVectorized += Chain.size();
lib/Transforms/Vectorize/LoopVectorize.cpp 5378 SmallVector<RegisterUsage, 8> RUs(VFs.size());
5379 SmallVector<SmallMapVector<unsigned, unsigned, 4>, 8> MaxUsages(VFs.size());
5408 for (unsigned j = 0, e = VFs.size(); j < e; ++j) {
5457 for (unsigned i = 0, e = VFs.size(); i < e; ++i) {
lib/Transforms/Vectorize/SLPVectorizer.cpp 186 for (int i = 1, e = VL.size(); i < e; i++) {
210 for (unsigned i = 1, e = VL.size(); i < e; ++i)
272 for (unsigned I = 0, E = VL.size(); I < E; ++I) {
377 for (int Cnt = 0, E = VL.size(); Cnt < E; Cnt++) {
412 for (int i = 1, e = VL.size(); i < e; i++)
888 assert((empty() || VL.size() == getNumLanes()) &&
893 unsigned NumLanes = VL.size();
1199 if (VL.size() == Scalars.size())
1201 return VL.size() == ReuseShuffleIndices.size() &&
1401 for (int i = 0, e = VL.size(); i != e; ++i) {
1413 assert((!Bundle.getValue() || Lane == VL.size()) &&
2281 if (NumUniqueScalarValues == VL.size()) {
2319 for (unsigned j = 0; j < VL.size(); ++j)
2365 Op0.assign(VL.size(), VL0->getOperand(0));
2388 Op0.assign(VL.size(), VL0->getOperand(0));
2418 SmallVector<Value *, 4> PointerOps(VL.size());
2451 if (Diff && Diff->getAPInt().getZExtValue() == (VL.size() - 1) * Size) {
2668 for (unsigned i = 0, e = VL.size() - 1; i < e; ++i)
2854 if (!LI || !LI->isSimple() || !LI->hasNUses(VL.size()))
2860 if (NElts != VL.size())
2865 unsigned E = VL.size();
2915 VectorType *VecTy = VectorType::get(ScalarTy, VL.size());
2921 IntegerType::get(F->getContext(), MinBWs[VL[0]].first), VL.size());
3005 for (unsigned i = 0, e = VL.size(); i < e; ++i) {
3051 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3055 int ScalarCost = VL.size() * ScalarEltCost;
3057 VectorType *SrcVecTy = VectorType::get(SrcTy, VL.size());
3073 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3075 VectorType *MaskTy = VectorType::get(Builder.getInt1Ty(), VL.size());
3116 for (unsigned i = 0, e = VL.size(); i < e; ++i) {
3140 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3156 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3169 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3187 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3210 ReuseShuffleCost -= (ReuseShuffleNumbers - VL.size()) * ScalarEltCost;
3259 VectorType *Src0Ty = VectorType::get(Src0SclTy, VL.size());
3260 VectorType *Src1Ty = VectorType::get(Src1SclTy, VL.size());
3524 VectorType *VecTy = VectorType::get(ScalarTy, VL.size());
3531 for (unsigned I = VL.size(); I > 0; --I) {
3656 if (VL.size() == E->Scalars.size() && !E->ReuseShuffleIndices.empty()) {
3683 if (VL.size() > 2) {
3693 if (UniqueValues.size() == VL.size() || UniqueValues.size() <= 1 ||
3699 VectorType *VecTy = VectorType::get(ScalarTy, VL.size());
3716 const unsigned E = Indices.size();
5336 const unsigned ChainLen = Chain.size();
5416 int E = Stores.size();
5504 if (VL.size() < 2)
5508 << VL.size() << ".\n");
5519 unsigned MaxVF = std::max<unsigned>(PowerOf2Floor(VL.size()), MinVF);
5550 unsigned NextInst = 0, MaxInst = VL.size();
5589 assert(Ops.size() == 2);
6414 if (Order && Order->size() == VL.size()) {
6414 if (Order && Order->size() == VL.size()) {
6416 SmallVector<Value *, 4> ReorderedOps(VL.size());
7061 for (int I = 0, E = GEPList.size(); I < E && Candidates.size() > 1; ++I) {
lib/Transforms/Vectorize/VPlan.h 802 Phi->getNumIncomingValues() == Masks.size()) &&
lib/Transforms/Vectorize/VPlanSLP.cpp 130 if (LoadsSeen == Operands.size())
tools/clang/include/clang/AST/Comment.h 357 return Args.size();
473 return Attributes.size();
669 return Args.size();
682 if (Args.size() > 0) {
848 return Position.size();
932 return Lines.size();
tools/clang/include/clang/AST/Decl.h 2342 size_t param_size() const { return parameters().size(); }
2932 assert(chain().size() >= 2);
2937 assert(chain().size() >= 2);
4060 size_t param_size() const { return parameters().size(); }
tools/clang/include/clang/AST/DeclBase.h 1241 size_t size() const { return Single ? 1 : Result.size(); }
tools/clang/include/clang/AST/DeclCXX.h 3442 InstantiatedFrom(InstantiatedFrom), NumExpansions(UsingDecls.size()) {
3787 NumBindings(Bindings.size()) {
tools/clang/include/clang/AST/DeclFriend.h 88 UnsupportedFriend(false), NumTPLists(FriendTypeTPLists.size()) {
tools/clang/include/clang/AST/DeclOpenMP.h 267 unsigned clauselist_size() const { return Clauses.size(); }
tools/clang/include/clang/AST/DeclTemplate.h 217 (assert(N == Params.size()),
257 : Arguments(Args.data()), NumArguments(Args.size()) {}
598 ID.AddInteger(TemplateArgs.size());
1891 ID.AddInteger(TemplateArgs.size());
2287 : Decl(Decl::FriendTemplate, DC, Loc), NumParams(Params.size()),
2733 ID.AddInteger(TemplateArgs.size());
tools/clang/include/clang/AST/ExprCXX.h 4132 Length(Length ? *Length : PartialArgs.size()), Pack(Pack) {
tools/clang/include/clang/AST/OpenMPClause.h 214 assert(VL.size() == NumVars &&
4354 assert(UDs.size() == NumUniqueDeclarations &&
4378 assert(DNLs.size() == NumUniqueDeclarations &&
4404 assert(CLSs.size() == NumComponentLists &&
4430 assert(Components.size() == NumComponents &&
4432 assert(CLSs.size() == NumComponentLists &&
4448 assert(Declarations.size() == ComponentLists.size() &&
4448 assert(Declarations.size() == ComponentLists.size() &&
4450 assert(Declarations.size() == NumComponentLists &&
4501 PrevSize += C.size();
4544 assert(DMDs.size() == OMPVarListClause<T>::varlist_size() &&
4608 assert(UniqueDecls.size() == DeclsListNum.size() &&
4608 assert(UniqueDecls.size() == DeclsListNum.size() &&
4881 assert(llvm::array_lengthof(MapTypeModifiers) == MapModifiers.size() &&
4886 MapModifiersLoc.size() &&
tools/clang/include/clang/AST/Stmt.h 1775 AttributedStmtBits.NumAttrs = Attrs.size();
tools/clang/include/clang/AST/TemplateBase.h 221 this->Args.NumArgs = Args.size();
tools/clang/include/clang/AST/Type.h 5502 setNumProtocols(protocols.size());
5503 assert(getNumProtocols() == protocols.size() &&
5507 protocols.size() * sizeof(ObjCProtocolDecl*));
tools/clang/include/clang/AST/TypeLoc.h 952 return this->getTypePtr()->getTypeArgsAsWritten().size();
tools/clang/include/clang/AST/VTableBuilder.h 283 return VTableIndices.size();
297 return vtable_components().size();
301 size_t nextIndex = (i + 1 == VTableIndices.size())
302 ? vtable_components().size()
tools/clang/include/clang/ASTMatchers/ASTMatchers.h 896 if (List.size() <= N)
915 return internal::getTemplateSpecializationArgs(Node).size() == N;
3982 return (N < Node.parameters().size()
tools/clang/include/clang/ASTMatchers/ASTMatchersInternal.h 1384 if (InnerMatchers.size() == 1) {
tools/clang/include/clang/Analysis/Analyses/ThreadSafetyTIL.h 1544 size_t numSuccessors() const { return successors().size(); }
tools/clang/include/clang/Analysis/AnyCall.h 153 size_t param_size() const { return parameters().size(); }
tools/clang/include/clang/Basic/Builtins.h 218 return ID >= (Builtin::FirstTSBuiltin + TSRecords.size());
223 unsigned getAuxBuiltinID(unsigned ID) const { return ID - TSRecords.size(); }
tools/clang/include/clang/Lex/MacroInfo.h 171 NumParameters = List.size();
172 ParameterList = PPAllocator.Allocate<IdentifierInfo *>(List.size());
509 NumOverrides(Overrides.size()) {
tools/clang/include/clang/Lex/Preprocessor.h 1323 EnterTokenStream(Toks.data(), Toks.size(), DisableMacroExpansion, false,
tools/clang/include/clang/Sema/Overload.h 1054 assert((Conversions.empty() || Conversions.size() == NumConversions) &&
tools/clang/include/clang/Sema/ParsedTemplate.h 202 totalSizeToAlloc<ParsedTemplateArgument>(TemplateArgs.size())))
231 NumArgs(TemplateArgs.size()) {
tools/clang/include/clang/Sema/Template.h 101 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size());
115 if (Index >= TemplateArgumentLists[getNumLevels() - Depth - 1].size())
125 assert(Index < TemplateArgumentLists[getNumLevels() - Depth - 1].size());
tools/clang/lib/AST/APValue.cpp 601 for (unsigned I = 0, N = Path.size(); I != N; ++I) {
793 LVal.resizePath(Path.size());
794 memcpy(LVal.getPath(), Path.data(), Path.size() * sizeof(LValuePathEntry));
839 MPD->resizePath(Path.size());
840 memcpy(MPD->getPath(), Path.data(), Path.size()*sizeof(const CXXRecordDecl*));
tools/clang/lib/AST/ASTContext.cpp 3760 size_t NumArgs = ArgArray.size();
3878 EPI.ExceptionSpec.Type, EPI.ExceptionSpec.Exceptions.size());
4225 sizeof(TemplateArgument) * Args.size() +
4248 unsigned NumArgs = Args.size();
4409 unsigned NumArgs = Args.size();
4532 for (unsigned i = 1; i != Protocols.size(); ++i)
4603 canonTypeArgsVec.reserve(effectiveTypeArgs.size());
4629 size += typeArgs.size() * sizeof(QualType);
4630 size += protocols.size() * sizeof(ObjCProtocolDecl *);
4737 size += protocols.size() * sizeof(ObjCProtocolDecl *);
8348 if (lhsArgs.size() != rhsArgs.size())
8348 if (lhsArgs.size() != rhsArgs.size())
8352 for (unsigned i = 0, n = lhsArgs.size(); i != n; ++i) {
9184 size_t E = FirstHasInfo ? FirstFnType->getExtParameterInfos().size()
9185 : SecondFnType->getExtParameterInfos().size();
tools/clang/lib/AST/ASTDiagnostic.cpp 241 for (unsigned I = 0, E = QualTypeVals.size(); I != E; ++I) {
272 for (unsigned i = 0, e = PrevArgs.size(); i != e; ++i) {
tools/clang/lib/AST/ASTImporter.cpp 697 if (Error Err = ImportTemplateArguments(TemplArgs.data(), TemplArgs.size(),
5819 SmallVector<const Attr *, 1> ToAttrs(FromAttrs.size());
7045 E->getPartialArguments().size(),
tools/clang/lib/AST/CommentSema.cpp 727 ParamVarDocs.resize(ParamVars.size(), nullptr);
981 for (unsigned i = 0, e = ParamVars.size(); i != e; ++i) {
1048 for (unsigned i = 0, e = ParamVars.size(); i != e; ++i)
tools/clang/lib/AST/Decl.cpp 1925 TemplParamLists = new (Context) TemplateParameterList *[TPLists.size()];
1926 NumTemplParamLists = TPLists.size();
3194 assert(NewParamInfo.size() == getNumParams() && "Parameter count mismatch!");
3198 ParamInfo = new (C) ParmVarDecl*[NewParamInfo.size()];
4472 NumParams = NewParamInfo.size();
4473 ParamInfo = new (getASTContext()) ParmVarDecl*[NewParamInfo.size()];
4481 this->NumCaptures = Captures.size();
4693 ChainingSize(CH.size()) {
4844 assert(getNumModuleIdentifiers(Imported) == IdentifierLocs.size());
4860 additionalSizeToAlloc<SourceLocation>(IdentifierLocs.size()))
tools/clang/lib/AST/DeclBase.cpp 1359 for (unsigned I = 0, N = Decls.size(); I != N; ++I)
1362 Skip.push_back(Decls.size());
1366 for (unsigned I = 0, N = Decls.size(); I != N; ++I) {
tools/clang/lib/AST/DeclCXX.cpp 2904 size_t Extra = additionalSizeToAlloc<NamedDecl *>(UsingDecls.size());
3025 size_t Extra = additionalSizeToAlloc<BindingDecl *>(Bindings.size());
tools/clang/lib/AST/DeclFriend.cpp 58 FriendTypeTPLists.size());
tools/clang/lib/AST/DeclObjC.cpp 866 NumParams = Params.size();
874 sizeof(SourceLocation) * SelLocs.size();
1427 : NumParams(typeParams.size()) {
1439 ctx.Allocate(totalSizeToAlloc<ObjCTypeParamDecl *>(typeParams.size()),
tools/clang/lib/AST/DeclOpenMP.cpp 33 new (C, DC, additionalSizeToAlloc<Expr *>(VL.size()))
35 D->NumVars = VL.size();
50 assert(VL.size() == NumVars &&
65 C, DC, additionalSizeToAlloc<Expr *, OMPClause *>(VL.size(), CL.size()))
65 C, DC, additionalSizeToAlloc<Expr *, OMPClause *>(VL.size(), CL.size()))
67 D->NumVars = VL.size();
69 D->NumClauses = CL.size();
86 assert(VL.size() == NumVars &&
92 assert(CL.size() == NumClauses &&
108 new (C, DC, additionalSizeToAlloc<OMPClause *>(CL.size()))
110 D->NumClauses = CL.size();
124 assert(CL.size() == NumClauses &&
204 size_t NumClauses = CL.size();
213 assert(CL.size() == Clauses.size() &&
213 assert(CL.size() == Clauses.size() &&
tools/clang/lib/AST/DeclTemplate.cpp 52 NumParams(Params.size()), ContainsUnexpandedParameterPack(false),
84 Params.size(), RequiresClause ? 1u : 0u),
570 ExpandedParameterPack(true), NumExpandedTypes(ExpandedTypes.size()) {
598 ExpandedTypes.size()))
648 ExpandedParameterPack(true), NumExpandedParams(Expansions.size()) {
670 additionalSizeToAlloc<TemplateParameterList *>(Expansions.size()))
709 NumArguments(Args.size()) {
717 void *Mem = Context.Allocate(totalSizeToAlloc<TemplateArgument>(Args.size()));
tools/clang/lib/AST/Expr.cpp 1343 NumArgs = std::max<unsigned>(Args.size(), MinNumArgs);
1344 unsigned NumPreArgs = PreArgs.size();
1360 for (unsigned I = 0; I != Args.size(); ++I) {
1364 for (unsigned I = Args.size(); I != NumArgs; ++I) {
1385 unsigned NumArgs = std::max<unsigned>(Args.size(), MinNumArgs);
1554 totalSizeToAlloc<OffsetOfNode, Expr *>(comps.size(), exprs.size()));
1554 totalSizeToAlloc<OffsetOfNode, Expr *>(comps.size(), exprs.size()));
1577 NumComps(comps.size()), NumExprs(exprs.size())
1577 NumComps(comps.size()), NumExprs(exprs.size())
1579 for (unsigned i = 0; i != comps.size(); ++i) {
1583 for (unsigned i = 0; i != exprs.size(); ++i) {
2223 InitExprs(C, initExprs.size()),
2227 for (unsigned I = 0; I != initExprs.size(); ++I) {
3125 for (unsigned I = 0; I < Exprs.size(); ++I)
4105 BuiltinLoc(BLoc), RParenLoc(RP), NumExprs(args.size())
4107 SubExprs = new (C) Stmt*[args.size()];
4108 for (unsigned i = 0; i != args.size(); i++) {
4125 this->NumExprs = Exprs.size();
4127 memcpy(SubExprs, Exprs.data(), sizeof(Expr *) * Exprs.size());
4142 NumAssocs(AssocExprs.size()), ResultIndex(ResultIndex),
4144 assert(AssocTypes.size() == AssocExprs.size() &&
4144 assert(AssocTypes.size() == AssocExprs.size() &&
4167 NumAssocs(AssocExprs.size()), ResultIndex(ResultDependentIndex),
4169 assert(AssocTypes.size() == AssocExprs.size() &&
4169 assert(AssocTypes.size() == AssocExprs.size() &&
4189 unsigned NumAssocs = AssocExprs.size();
4203 unsigned NumAssocs = AssocExprs.size();
4245 NumDesignators(Designators.size()), NumSubExprs(IndexExprs.size() + 1) {
4245 NumDesignators(Designators.size()), NumSubExprs(IndexExprs.size() + 1) {
4295 assert(IndexIdx == IndexExprs.size() && "Wrong number of index expressions");
4304 void *Mem = C.Allocate(totalSizeToAlloc<Stmt *>(IndexExprs.size() + 1),
4422 ParenListExprBits.NumExprs = Exprs.size();
4424 for (unsigned I = 0, N = Exprs.size(); I != N; ++I) {
4447 void *Mem = Ctx.Allocate(totalSizeToAlloc<Stmt *>(Exprs.size()),
4488 assert(semantics.size() && "no semantic expressions!");
4496 assert(resultIndex < semantics.size());
4502 void *buffer = C.Allocate(totalSizeToAlloc<Expr *>(semantics.size() + 1),
4513 PseudoObjectExprBits.NumSubExprs = semantics.size() + 1;
4516 for (unsigned i = 0, e = semantics.size() + 1; i != e; ++i) {
4564 NumSubExprs(args.size()), BuiltinLoc(BLoc), RParenLoc(RP), Op(op)
4566 assert(args.size() == getNumSubExprs(op) && "wrong number of subexpressions");
4567 for (unsigned i = 0; i != args.size(); i++) {
tools/clang/lib/AST/ExprCXX.cpp 193 CXXNewExprBits.NumPlacementArgs = PlacementArgs.size();
219 for (unsigned I = 0; I != PlacementArgs.size(); ++I) {
267 unsigned NumPlacementArgs = PlacementArgs.size();
640 unsigned NumArgs = Args.size();
699 unsigned NumArgs = std::max<unsigned>(Args.size(), MinNumArgs);
939 unsigned NumArgs = Args.size();
1041 unsigned SizeOfTrailingObjects = sizeOfTrailingObjects(Args.size());
1076 unsigned SizeOfTrailingObjects = sizeOfTrailingObjects(Args.size());
1104 NumArgs(Args.size()) {
1114 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
1182 NumCaptures(Captures.size()), CaptureDefault(CaptureDefault),
1185 assert(CaptureInits.size() == Captures.size() && "Wrong number of arguments");
1185 assert(CaptureInits.size() == Captures.size() && "Wrong number of arguments");
1198 for (unsigned I = 0, N = Captures.size(); I != N; ++I) {
1207 for (unsigned I = 0, N = CaptureInits.size(); I != N; ++I)
1224 unsigned Size = totalSizeToAlloc<Stmt *>(Captures.size() + 1);
1326 ExprWithCleanupsBits.NumObjects = objects.size();
1327 for (unsigned i = 0, e = objects.size(); i != e; ++i)
1334 void *buffer = C.Allocate(totalSizeToAlloc<CleanupObject>(objects.size()),
1368 CXXUnresolvedConstructExprBits.NumArgs = Args.size();
1370 for (unsigned I = 0; I != Args.size(); ++I) {
1381 void *Mem = Context.Allocate(totalSizeToAlloc<Expr *>(Args.size()));
1602 Context.Allocate(totalSizeToAlloc<TemplateArgument>(PartialArgs.size()));
1645 return new (Context.Allocate(totalSizeToAlloc<VarDecl *>(Params.size())))
1646 FunctionParmPackExpr(T, ParamPack, NameLoc, Params.size(), Params.data());
1687 TypeTraitExprBits.NumArgs = Args.size();
1691 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
1709 void *Mem = C.Allocate(totalSizeToAlloc<TypeSourceInfo *>(Args.size()));
1735 unsigned NumArgs = std::max<unsigned>(Args.size(), MinNumArgs);
1768 NumTemplateArgs(ConvertedArgs.size()) {
1781 assert(Converted.size() == NumTemplateArgs);
1818 ConvertedArgs.size()));
tools/clang/lib/AST/ExprConstant.cpp 204 for (unsigned I = 0, N = Path.size(); I != N; ++I) {
5053 PathLength <= Path.size(); ++PathLength) {
5157 for (unsigned I = 1; I != Path.size(); ++I) {
5437 ForbiddenNullArgs.resize(Args.size());
5445 if (ASTIdx >= Args.size())
5451 for (unsigned Idx = 0; Idx < Args.size(); Idx++) {
5477 ArgVector ArgValues(Args.size());
5737 ArgVector ArgValues(Args.size());
9231 assert(V.size() == E->getType()->castAs<VectorType>()->getNumElements());
9233 Result = APValue(V.data(), V.size());
14349 ArgVector ArgValues(Args.size());
tools/clang/lib/AST/ExprObjC.cpp 30 NumElements(Elements.size()), Range(SR), ArrayWithObjectsMethod(Method) {
32 for (unsigned I = 0, N = Elements.size(); I != N; ++I) {
48 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(Elements.size()));
64 NumElements(VK.size()), HasPackExpansions(HasPackExpansions), Range(SR),
99 VK.size(), HasPackExpansions ? VK.size() : 0));
99 VK.size(), HasPackExpansions ? VK.size() : 0));
183 setNumArgs(Args.size());
185 for (unsigned I = 0; I != Args.size(); ++I) {
217 Mem = alloc(Context, Args.size(), 0);
236 Mem = alloc(Context, Args.size(), 0);
255 Mem = alloc(Context, Args.size(), 0);
278 (SelLocsK == SelLoc_NonStandard) ? SelLocs.size() : 0;
279 return alloc(C, Args.size(), NumStoredSelLocs);
tools/clang/lib/AST/ItaniumCXXABI.cpp 120 return LHS.Bindings.size() == RHS.Bindings.size() &&
120 return LHS.Bindings.size() == RHS.Bindings.size() &&
tools/clang/lib/AST/ItaniumMangle.cpp 4188 CSE->getTemplateArguments().size());
tools/clang/lib/AST/ODRHash.cpp 917 ID.AddInteger(TypeArgs.size());
923 ID.AddInteger(Protocols.size());
941 ID.AddInteger(Protocols.size());
tools/clang/lib/AST/OSLog.cpp 55 ArgsData.reserve(Args.size());
68 if (ArgIndex < Args.size())
tools/clang/lib/AST/OpenMPClause.cpp 317 assert(VL.size() == varlist_size() &&
327 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(2 * VL.size()));
329 new (Mem) OMPPrivateClause(StartLoc, LParenLoc, EndLoc, VL.size());
342 assert(VL.size() == varlist_size() &&
348 assert(VL.size() == varlist_size() &&
358 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(3 * VL.size()));
360 new (Mem) OMPFirstprivateClause(StartLoc, LParenLoc, EndLoc, VL.size());
375 assert(PrivateCopies.size() == varlist_size() &&
381 assert(SrcExprs.size() == varlist_size() && "Number of source expressions is "
388 assert(DstExprs.size() == varlist_size() && "Number of destination "
395 assert(AssignmentOps.size() == varlist_size() &&
407 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size()));
409 new (Mem) OMPLastprivateClause(StartLoc, LParenLoc, EndLoc, VL.size());
430 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size()));
432 new (Mem) OMPSharedClause(StartLoc, LParenLoc, EndLoc, VL.size());
443 assert(PL.size() == varlist_size() &&
449 assert(IL.size() == varlist_size() &&
455 assert(UL.size() == varlist_size() &&
461 assert(FL.size() == varlist_size() &&
468 UE.size() == varlist_size() + 1 &&
482 C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size() + 2 + VL.size() + 1));
482 C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size() + 2 + VL.size() + 1));
484 StartLoc, LParenLoc, Modifier, ModifierLoc, ColonLoc, EndLoc, VL.size());
490 std::fill(Clause->getInits().end(), Clause->getInits().end() + VL.size(),
492 std::fill(Clause->getUpdates().end(), Clause->getUpdates().end() + VL.size(),
522 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + 1));
524 OMPAlignedClause(StartLoc, LParenLoc, ColonLoc, EndLoc, VL.size());
537 assert(SrcExprs.size() == varlist_size() && "Number of source expressions is "
544 assert(DstExprs.size() == varlist_size() && "Number of destination "
551 assert(AssignmentOps.size() == varlist_size() &&
562 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(4 * VL.size()));
564 new (Mem) OMPCopyinClause(StartLoc, LParenLoc, EndLoc, VL.size());
578 assert(SrcExprs.size() == varlist_size() && "Number of source expressions is "
585 assert(DstExprs.size() == varlist_size() && "Number of destination "
592 assert(AssignmentOps.size() == varlist_size() &&
603 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(4 * VL.size()));
605 new (Mem) OMPCopyprivateClause(StartLoc, LParenLoc, EndLoc, VL.size());
620 assert(Privates.size() == varlist_size() &&
627 LHSExprs.size() == varlist_size() &&
634 RHSExprs.size() == varlist_size() &&
640 assert(ReductionOps.size() == varlist_size() && "Number of reduction "
653 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size()));
655 StartLoc, LParenLoc, EndLoc, ColonLoc, VL.size(), QualifierLoc, NameInfo);
673 assert(Privates.size() == varlist_size() &&
680 LHSExprs.size() == varlist_size() &&
687 RHSExprs.size() == varlist_size() &&
693 assert(ReductionOps.size() == varlist_size() && "Number of task reduction "
706 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(5 * VL.size()));
708 StartLoc, LParenLoc, EndLoc, ColonLoc, VL.size(), QualifierLoc, NameInfo);
726 assert(Privates.size() == varlist_size() &&
733 LHSExprs.size() == varlist_size() &&
740 RHSExprs.size() == varlist_size() &&
746 assert(ReductionOps.size() == varlist_size() && "Number of in reduction "
754 assert(TaskgroupDescriptors.size() == varlist_size() &&
768 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(6 * VL.size()));
770 StartLoc, LParenLoc, EndLoc, ColonLoc, VL.size(), QualifierLoc, NameInfo);
794 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size()));
796 ColonLoc, EndLoc, VL.size());
812 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + 1));
814 new (Mem) OMPFlushClause(StartLoc, LParenLoc, EndLoc, VL.size());
830 void *Mem = C.Allocate(totalSizeToAlloc<Expr *>(VL.size() + NumLoops));
832 OMPDependClause(StartLoc, LParenLoc, EndLoc, VL.size(), NumLoops);
909 Sizes.NumVars = Vars.size();
911 Sizes.NumComponentLists = ComponentLists.size();
960 Sizes.NumVars = Vars.size();
962 Sizes.NumComponentLists = ComponentLists.size();
1007 Sizes.NumVars = Vars.size();
1009 Sizes.NumComponentLists = ComponentLists.size();
1051 assert(VL.size() == varlist_size() &&
1057 assert(VL.size() == varlist_size() &&
1068 Sizes.NumVars = Vars.size();
1070 Sizes.NumComponentLists = ComponentLists.size();
1117 Sizes.NumVars = Vars.size();
1119 Sizes.NumComponentLists = ComponentLists.size();
tools/clang/lib/AST/SelectorLocationsKind.cpp 65 return Index < Args.size() ? getArgLoc(Args[Index]) : SourceLocation();
75 for (i = 0; i != SelLocs.size(); ++i) {
80 if (i == SelLocs.size())
84 for (i = 0; i != SelLocs.size(); ++i) {
tools/clang/lib/AST/Stmt.cpp 306 CompoundStmtBits.NumStmts = Stmts.size();
312 assert(CompoundStmtBits.NumStmts == Stmts.size() &&
321 C.Allocate(totalSizeToAlloc<Stmt *>(Stmts.size()), alignof(CompoundStmt));
359 void *Mem = C.Allocate(totalSizeToAlloc<const Attr *>(Attrs.size()),
787 numinputs, clobbers.size()), LBraceLoc(lbraceloc),
788 EndLoc(endloc), NumAsmToks(asmtoks.size()) {
801 assert(NumAsmToks == asmtoks.size());
802 assert(NumClobbers == clobbers.size());
804 assert(exprs.size() == NumOutputs + NumInputs);
805 assert(exprs.size() == constraints.size());
805 assert(exprs.size() == constraints.size());
809 Exprs = new (C) Stmt*[exprs.size()];
812 AsmToks = new (C) Token[asmtoks.size()];
815 Constraints = new (C) StringRef[exprs.size()];
1216 : Stmt(CapturedStmtClass), NumCaptures(Captures.size()),
1256 assert(CaptureInits.size() == Captures.size() && "wrong number of arguments");
1256 assert(CaptureInits.size() == Captures.size() && "wrong number of arguments");
1258 unsigned Size = sizeof(CapturedStmt) + sizeof(Stmt *) * (Captures.size() + 1);
1262 Size += sizeof(Capture) * Captures.size();
tools/clang/lib/AST/StmtCXX.cpp 27 const size_t Size = totalSizeToAlloc<Stmt *>(handlers.size() + 1);
41 : Stmt(CXXTryStmtClass), TryLoc(tryLoc), NumHandlers(handlers.size()) {
89 CoroutineBodyStmt::FirstParamMove + Args.ParamMoves.size());
110 : Stmt(CoroutineBodyStmtClass), NumParams(Args.ParamMoves.size()) {
tools/clang/lib/AST/StmtOpenMP.cpp 20 assert(Clauses.size() == getNumClauses() &&
45 assert(A.size() == getCollapsedNumber() &&
51 assert(A.size() == getCollapsedNumber() && "Number of loop private counters "
58 assert(A.size() == getCollapsedNumber() &&
64 assert(A.size() == getCollapsedNumber() &&
70 assert(A.size() == getCollapsedNumber() &&
77 A.size() == getCollapsedNumber() &&
83 assert(A.size() == getCollapsedNumber() &&
89 assert(A.size() == getCollapsedNumber() &&
100 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
102 new (Mem) OMPParallelDirective(StartLoc, EndLoc, Clauses.size());
126 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
129 OMPSimdDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
169 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
172 new (Mem) OMPForDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
222 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
225 OMPForSimdDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
273 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
275 new (Mem) OMPSectionsDirective(StartLoc, EndLoc, Clauses.size());
320 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
322 new (Mem) OMPSingleDirective(StartLoc, EndLoc, Clauses.size());
363 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
365 new (Mem) OMPCriticalDirective(Name, StartLoc, EndLoc, Clauses.size());
387 void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
391 OMPParallelForDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
440 Size + sizeof(OMPClause *) * Clauses.size() +
443 StartLoc, EndLoc, CollapsedNum, Clauses.size());
491 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
493 new (Mem) OMPParallelSectionsDirective(StartLoc, EndLoc, Clauses.size());
516 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
518 new (Mem) OMPTaskDirective(StartLoc, EndLoc, Clauses.size());
581 sizeof(OMPClause *) * Clauses.size(),
585 new (Mem) OMPTaskgroupDirective(StartLoc, EndLoc, Clauses.size());
627 sizeof(OMPClause *) * Clauses.size(),
631 new (Mem) OMPCancelDirective(StartLoc, EndLoc, Clauses.size());
653 void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size());
655 new (Mem) OMPFlushDirective(StartLoc, EndLoc, Clauses.size());
677 C.Allocate(Size + sizeof(Stmt *) + sizeof(OMPClause *) * Clauses.size());
679 new (Mem) OMPOrderedDirective(StartLoc, EndLoc, Clauses.size());
701 void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
704 new (Mem) OMPAtomicDirective(StartLoc, EndLoc, Clauses.size());
734 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
736 new (Mem) OMPTargetDirective(StartLoc, EndLoc, Clauses.size());
758 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
760 new (Mem) OMPTargetParallelDirective(StartLoc, EndLoc, Clauses.size());
783 Size + sizeof(OMPClause *) * Clauses.size() +
786 StartLoc, EndLoc, CollapsedNum, Clauses.size());
834 sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
836 new (Mem) OMPTargetDataDirective(StartLoc, EndLoc, Clauses.size());
856 sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
858 new (Mem) OMPTargetEnterDataDirective(StartLoc, EndLoc, Clauses.size());
878 sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
880 new (Mem) OMPTargetExitDataDirective(StartLoc, EndLoc, Clauses.size());
903 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
905 new (Mem) OMPTeamsDirective(StartLoc, EndLoc, Clauses.size());
928 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
931 OMPTaskLoopDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
979 void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
983 OMPTaskLoopSimdDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
1031 Size + sizeof(OMPClause *) * Clauses.size() +
1034 StartLoc, EndLoc, CollapsedNum, Clauses.size());
1083 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
1087 StartLoc, EndLoc, CollapsedNum, Clauses.size());
1137 Size + sizeof(OMPClause *) * Clauses.size() +
1141 StartLoc, EndLoc, CollapsedNum, Clauses.size());
1191 void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
1195 OMPDistributeDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
1242 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
1244 new (Mem) OMPTargetUpdateDirective(StartLoc, EndLoc, Clauses.size());
1267 Size + sizeof(OMPClause *) * Clauses.size() +
1272 CollapsedNum, Clauses.size());
1338 Size + sizeof(OMPClause *) * Clauses.size() +
1343 Clauses.size());
1408 Size + sizeof(OMPClause *) * Clauses.size() +
1412 StartLoc, EndLoc, CollapsedNum, Clauses.size());
1462 Size + sizeof(OMPClause *) * Clauses.size() +
1467 CollapsedNum, Clauses.size());
1518 void *Mem = C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
1522 OMPTargetSimdDirective(StartLoc, EndLoc, CollapsedNum, Clauses.size());
1562 Size + sizeof(OMPClause *) * Clauses.size() +
1565 StartLoc, EndLoc, CollapsedNum, Clauses.size());
1614 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
1619 Clauses.size());
1669 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() +
1675 Clauses.size());
1742 Size + sizeof(OMPClause *) * Clauses.size() +
1747 Clauses.size());
1812 C.Allocate(Size + sizeof(OMPClause *) * Clauses.size() + sizeof(Stmt *));
1814 new (Mem) OMPTargetTeamsDirective(StartLoc, EndLoc, Clauses.size());
1837 Size + sizeof(OMPClause *) * Clauses.size() +
1842 Clauses.size());
1895 Size + sizeof(OMPClause *) * Clauses.size() +
1901 StartLoc, EndLoc, CollapsedNum, Clauses.size());
1971 Size + sizeof(OMPClause *) * Clauses.size() +
1977 StartLoc, EndLoc, CollapsedNum, Clauses.size());
2044 Size + sizeof(OMPClause *) * Clauses.size() +
2049 Clauses.size());
tools/clang/lib/AST/StmtProfile.cpp 1863 ID.AddInteger(Args.size());
tools/clang/lib/AST/Type.cpp 677 ObjCObjectTypeBits.NumTypeArgs = typeArgs.size();
678 assert(getTypeArgsAsWritten().size() == typeArgs.size() &&
678 assert(getTypeArgsAsWritten().size() == typeArgs.size() &&
682 typeArgs.size() * sizeof(QualType));
1597 assert(typeArgs.size() == typeParams->size());
2709 DependentTemplateSpecializationTypeBits.NumArgs = Args.size();
2964 FunctionTypeBits.NumParams = params.size();
2965 assert(getNumParams() == params.size() && "NumParams overflow!");
2974 ExtraBits.NumExceptionType = epi.ExceptionSpec.Exceptions.size();
3445 TemplateSpecializationTypeBits.NumArgs = Args.size();
3514 ID.AddInteger(typeArgs.size());
3517 ID.AddInteger(protocols.size());
3533 ID.AddInteger(protocols.size());
tools/clang/lib/AST/VTableBuilder.cpp 2203 if (VTableIndices.size() <= 1)
2204 assert(VTableIndices.size() == 1 && VTableIndices[0] == 0);
tools/clang/lib/ASTMatchers/ASTMatchersInternal.cpp 265 if (InnerMatchers.size() != 1)
tools/clang/lib/ASTMatchers/Dynamic/Diagnostics.cpp 143 if (Index < Args.size()) {
tools/clang/lib/ASTMatchers/Dynamic/Marshallers.h 378 ArgT **InnerArgs = new ArgT *[Args.size()]();
381 for (size_t i = 0, e = Args.size(); i != e; ++i) {
398 Args.size())));
401 for (size_t i = 0, e = Args.size(); i != e; ++i) {
518 CHECK_ARG_COUNT(0);
529 CHECK_ARG_COUNT(1);
542 CHECK_ARG_COUNT(2);
673 if (Args.size() < MinCount || MaxCount < Args.size()) {
673 if (Args.size() < MinCount || MaxCount < Args.size()) {
679 << ("(" + Twine(MinCount) + ", " + MaxStr + ")") << Args.size();
684 for (size_t i = 0, e = Args.size(); i != e; ++i) {
tools/clang/lib/Analysis/ExprMutationAnalyzer.cpp 409 AllParams.size() - 1)]
tools/clang/lib/Analysis/PathDiagnostic.cpp 279 if (X.getRanges().size() != Y.getRanges().size())
279 if (X.getRanges().size() != Y.getRanges().size())
280 return X.getRanges().size() < Y.getRanges().size();
280 return X.getRanges().size() < Y.getRanges().size();
284 for (unsigned i = 0, n = X.getRanges().size(); i < n; ++i) {
897 for (int I = 0, Last = TAList.size() - 1; I != Last; ++I) {
901 describeTemplateParameter(Out, TAList[TAList.size() - 1], LO);
tools/clang/lib/Basic/Builtins.cpp 35 (TSRecords.size() + AuxTSRecords.size())) &&
35 (TSRecords.size() + AuxTSRecords.size())) &&
99 for (unsigned i = 0, e = TSRecords.size(); i != e; ++i)
104 for (unsigned i = 0, e = AuxTSRecords.size(); i != e; ++i)
106 .setBuiltinID(i + Builtin::FirstTSBuiltin + TSRecords.size());
tools/clang/lib/Basic/IdentifierTable.cpp 417 if (getNumArgs() != Names.size())
419 for (unsigned I = 0, E = Names.size(); I != E; ++I) {
tools/clang/lib/Basic/TargetInfo.cpp 472 return n < Names.size();
486 if (AN == Name && ARN.RegNum < Names.size())
515 assert(n < Names.size() && "Out of bounds register number!");
527 if (AN == Name && ARN.RegNum < Names.size())
633 for (Index = 0; Index != OutputConstraints.size(); ++Index)
663 if (i >= OutputConstraints.size()) return false;
tools/clang/lib/CodeGen/CGBuiltin.cpp 507 assert(Types.size() > 0 && "Empty list of types.");
5850 int PairPos = 0, End = Ops.size() - 1;
9465 assert((Ops.size() & (Ops.size() - 1)) == 0 &&
9465 assert((Ops.size() & (Ops.size() - 1)) == 0 &&
9468 for (unsigned i = 0, e = Ops.size(); i != e && AllConstants; ++i)
9474 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
9481 llvm::UndefValue::get(llvm::VectorType::get(Ops[0]->getType(), Ops.size()));
9483 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
9708 assert((Ops.size() == 2 || Ops.size() == 4) &&
9708 assert((Ops.size() == 2 || Ops.size() == 4) &&
9734 if (Ops.size() == 4)
9779 assert(Ops.size() == 2);
9893 if (Ops.size() > 4)
9914 if (Ops.size() > 3) {
tools/clang/lib/CodeGen/CGCXXABI.cpp 259 for (unsigned I = 0, N = Path.size(); I != N; ++I) {
tools/clang/lib/CodeGen/CGCall.cpp 161 assert(ExtInfos.size() == FPT->getNumParams());
803 assert(paramInfos.empty() || paramInfos.size() == argTypes.size());
803 assert(paramInfos.empty() || paramInfos.size() == argTypes.size());
805 required.getNumRequiredArgs() <= argTypes.size());
809 argTypes.size() + 1, paramInfos.size()));
809 argTypes.size() + 1, paramInfos.size()));
826 FI->NumArgs = argTypes.size();
829 for (unsigned i = 0, e = argTypes.size(); i != e; ++i)
831 for (unsigned i = 0, e = paramInfos.size(); i != e; ++i)
1469 IRArgs.NumberOfArgs = AI.getCoerceAndExpandTypeSequence().size();
3407 assert((int)ArgTypes.size() == (ArgRange.end() - ArgRange.begin()));
3455 for (unsigned I = 0, E = ArgTypes.size(); I != E; ++I) {
tools/clang/lib/CodeGen/CGDebugInfo.cpp 1749 for (unsigned i = 0, e = TAList.size(); i != e; ++i) {
1998 VFTLayout.vtable_components().size() - CGM.getLangOpts().RTTIData;
tools/clang/lib/CodeGen/CGDeclCXX.cpp 712 for (unsigned i = 0, e = Decls.size(); i != e; ++i)
tools/clang/lib/CodeGen/CGExpr.cpp 3010 assert(Checked.size() > 0);
3018 for (int i = 0, n = Checked.size(); i < n; ++i) {
3045 for (int i = 1, n = Checked.size(); i < n; ++i) {
3068 Args.reserve(DynamicArgs.size() + 1);
3069 ArgTypes.reserve(DynamicArgs.size() + 1);
3083 for (size_t i = 0, n = DynamicArgs.size(); i != n; ++i) {
3442 indices.size() - 1,
tools/clang/lib/CodeGen/CGExprConstant.cpp 409 for (size_t I = 0; I != Elems.size(); ++I) {
459 for (size_t I = 0; I != Elems.size(); ++I) {
tools/clang/lib/CodeGen/CGObjC.cpp 3699 assert(Args.size() == 3 && "Expected 3 argument here!");
tools/clang/lib/CodeGen/CGObjCGNU.cpp 1169 MethodList.addInt(IntTy, Methods.size());
1330 Protocols.size());
1336 ProtocolBuilder.addInt(SizeTy, Protocols.size());
2777 MethodList.addInt(Int32Ty, Methods.size());
2848 IvarList.addInt(IntTy, (int)IvarNames.size());
2856 for (unsigned int i = 0, e = IvarNames.size() ; i < e ; i++) {
2991 MethodList.addInt(IntTy, Methods.size());
3011 ProtocolList.addInt(LongTy, Protocols.size());
3186 int bitCount = bits.size();
tools/clang/lib/CodeGen/CGObjCMac.cpp 2347 for (unsigned i = 0, e = buffer.size(); i < e; i++)
2493 for (unsigned i = 0, e = RecFields.size(); i != e; ++i) {
3326 MethodTypes.size());
3942 values.addInt(ObjCTypes.IntTy, methods.size());
3959 values.addInt(ObjCTypes.IntTy, methods.size());
6053 unsigned NumClasses = Container.size();
6708 values.addInt(ObjCTypes.IntTy, methods.size());
tools/clang/lib/CodeGen/CGOpenMPRuntime.cpp 974 ClausesData.reserve(Shareds.size());
975 SharedAddresses.reserve(Shareds.size());
976 Sizes.reserve(Shareds.size());
977 BaseDecls.reserve(Shareds.size());
3063 CGF.Builder.getInt32(CapturedVars.size()), // Number of captured vars
3324 for (unsigned I = 0, E = AssignmentOps.size(); I < E; ++I) {
3350 assert(CopyprivateVars.size() == SrcExprs.size() &&
3350 assert(CopyprivateVars.size() == SrcExprs.size() &&
3351 CopyprivateVars.size() == DstExprs.size() &&
3351 CopyprivateVars.size() == DstExprs.size() &&
3352 CopyprivateVars.size() == AssignmentOps.size());
3352 CopyprivateVars.size() == AssignmentOps.size());
3386 llvm::APInt ArraySize(/*unsigned int numBits=*/32, CopyprivateVars.size());
3393 for (unsigned I = 0, E = CopyprivateVars.size(); I < E; ++I) {
5598 for (unsigned I = 0, E = ReductionOps.size(); I < E; ++I, ++IPriv, ++Idx) {
5736 auto Size = RHSExprs.size();
5750 for (unsigned I = 0, E = RHSExprs.size(); I < E; ++I, ++IPriv, ++Idx) {
5789 CGF.Builder.getInt32(RHSExprs.size()), // i32 <n>
9909 CGF.Builder.getInt32(CapturedVars.size()), // Number of captured vars
10794 assert(CallArgs.size() == DoacrossFinArgs);
10830 llvm::APInt Size(/*numBits=*/32, NumIterations.size());
10838 for (unsigned I = 0, E = NumIterations.size(); I < E; ++I) {
10861 llvm::ConstantInt::getSigned(CGM.Int32Ty, NumIterations.size()),
10955 assert(CallArgs.size() == CleanupArgs &&
tools/clang/lib/CodeGen/CGOpenMPRuntimeNVPTX.cpp 2555 llvm::ConstantInt::get(CGM.SizeTy, CapturedVars.size())};
2977 unsigned Size = Privates.size();
3779 for (unsigned I = 0, E = Privates.size(); I < E; ++I, ++IPriv, ++Idx) {
3979 for (unsigned I = 0, E = Privates.size(); I < E; ++I, ++IPriv, ++Idx) {
4291 auto Size = RHSExprs.size();
4305 for (unsigned I = 0, E = RHSExprs.size(); I < E; ++I, ++IPriv, ++Idx) {
4339 CGF.Builder.getInt32(RHSExprs.size()),
4352 llvm::SmallVector<const ValueDecl *, 4> PrivatesReductions(Privates.size());
4512 TargetArgs.reserve(Args.size());
4514 for (unsigned I = 0, E = Args.size(); I < E; ++I) {
tools/clang/lib/CodeGen/CGStmtOpenMP.cpp 1587 E = C->getLoopNumIterations().size();
5199 E = C->getLoopNumIterations().size();
tools/clang/lib/CodeGen/CGVTables.cpp 705 } else if (nextVTableThunkIndex < layout.vtable_thunks().size() &&
1117 for (unsigned I = 0; I != Comps.size(); ++I) {
tools/clang/lib/CodeGen/CodeGenPGO.cpp 1028 if (Weights.size() < 2)
1040 ScaledWeights.reserve(Weights.size());
tools/clang/lib/CodeGen/ConstantInitBuilder.cpp 253 auto type = llvm::ArrayType::get(eltTy, elts.size());
tools/clang/lib/CodeGen/ItaniumCXXABI.cpp 2561 for (unsigned I = 0; I != CXXThreadLocalInits.size(); ++I) {
tools/clang/lib/CodeGen/MicrosoftCXXABI.cpp 2317 for (size_t I = 0, E = CXXThreadLocalInitVars.size(); I != E; ++I) {
2759 assert(DerivedToBasePath.size() == MemberPointerPath.size());
tools/clang/lib/Driver/Driver.cpp 3811 assert(ElementNum <= ActionInfo.size() && "Invalid number of elements.");
3830 if (ActionInfo.size() < 3 || !canCollapseAssembleAction())
3862 if (ActionInfo.size() < 2 || !canCollapseAssembleAction())
3885 if (ActionInfo.size() < 2)
3898 for (size_t i = 1; i < ActionInfo.size(); i++)
4928 while (CurDigit < Digits.size()) {
tools/clang/lib/Driver/Job.cpp 228 for (size_t i = 0, e = Args.size(); i < e; ++i) {
311 Environment.reserve(NewEnvironment.size() + 1);
tools/clang/lib/Driver/ToolChains/Clang.cpp 6385 for (unsigned I = 0; I < DepInfo.size(); ++I) {
tools/clang/lib/Format/Format.cpp 341 for (size_t i = 0, e = Styles.size(); i < e; ++i) {
tools/clang/lib/Format/FormatTokenLexer.cpp 302 if (Tokens.size() < Kinds.size())
306 Tokens.end() - Kinds.size();
310 for (unsigned i = 1; i < Kinds.size(); ++i) {
316 Tokens.resize(Tokens.size() - Kinds.size() + 1);
tools/clang/lib/Frontend/CompilerInstance.cpp 1857 if (Path.size() > 1) {
1858 for (unsigned I = 1, N = Path.size(); I != N; ++I) {
tools/clang/lib/Frontend/Rewrite/RewriteModernObjC.cpp 6293 if (SuperProtocols.size() > 0) {
6295 Write_protocol_list_t_TypeDecl(Result, SuperProtocols.size());
6299 Result += "\t"; Result += utostr(SuperProtocols.size()); Result += ",\n";
6300 for (unsigned i = 0, e = SuperProtocols.size(); i < e; i++) {
6318 if (Methods.size() > 0) {
6320 Write_method_list_t_TypeDecl(Result, Methods.size());
6325 Result += "\t"; Result += utostr(Methods.size()); Result += ",\n";
6326 for (unsigned i = 0, e = Methods.size(); i < e; i++) {
6358 if (Properties.size() > 0) {
6360 Write__prop_list_t_TypeDecl(Result, Properties.size());
6365 Result += "\t"; Result += utostr(Properties.size()); Result += ",\n";
6366 for (unsigned i = 0, e = Properties.size(); i < e; i++) {
6427 if (baseMethods.size() > 0) {
6439 if (!metaclass && baseProtocols.size() > 0) {
6447 if (!metaclass && ivars.size() > 0) {
6457 if (!metaclass && Properties.size() > 0) {
6639 if (InstanceMethods.size() > 0) {
6648 if (ClassMethods.size() > 0) {
6657 if (RefedProtocols.size() > 0) {
6666 if (ClassProperties.size() > 0) {
6695 if (Methods.size() == 0)
6702 for (unsigned i = 0, e = Methods.size(); i < e; i++) {
6734 for (unsigned i =0, e = Ivars.size(); i < e; i++) {
6765 if (OriginalIvars.size() > 0) {
6771 for (unsigned i = 0, e = OriginalIvars.size(); i < e; i++) {
tools/clang/lib/Index/IndexingContext.cpp 411 FinalRelations.reserve(Relations.size()+1);
tools/clang/lib/Lex/LiteralSupport.cpp 1483 for (unsigned i = 1; i != StringToks.size(); ++i) {
1539 for (unsigned i = 0, e = StringToks.size(); i != e; ++i) {
tools/clang/lib/Lex/MacroArgs.cpp 36 if ((*Entry)->NumUnexpArgTokens >= UnexpArgTokens.size() &&
41 if ((*Entry)->NumUnexpArgTokens == UnexpArgTokens.size())
52 llvm::safe_malloc(totalSizeToAlloc<Token>(UnexpArgTokens.size())))
53 MacroArgs(UnexpArgTokens.size(), VarargsElided, MI->getNumParams());
58 Result->NumUnexpArgTokens = UnexpArgTokens.size();
tools/clang/lib/Lex/MacroInfo.cpp 245 sizeof(ModuleMacro) + sizeof(ModuleMacro *) * Overrides.size(),
tools/clang/lib/Lex/PPCaching.cpp 161 CachedTokens.erase(CachedTokens.begin() + CachedLexPos - 1 + NewToks.size());
162 CachedLexPos += NewToks.size() - 1;
tools/clang/lib/Lex/PPDirectives.cpp 1575 for (size_t I = 0, N = Path.size(); I != N; ++I) {
tools/clang/lib/Lex/PPMacroExpansion.cpp 1030 bool cacheNeedsToGrow = tokens.size() >
tools/clang/lib/Lex/Preprocessor.cpp 346 return Tokens.size() == MI->getNumTokens() &&
1137 auto ToksCopy = std::make_unique<Token[]>(Toks.size());
1139 EnterTokenStream(std::move(ToksCopy), Toks.size(),
tools/clang/lib/Lex/TokenLexer.cpp 755 return TokenStream.size() == CurIdx;
tools/clang/lib/Parse/ParsePragma.cpp 1110 if (Toks.size() > 2)
tools/clang/lib/Parse/ParseStmtAsm.cpp 53 assert(AsmToks.size() == AsmTokOffsets.size());
53 assert(AsmToks.size() == AsmTokOffsets.size());
159 for (unsigned i = FirstTokIndex, e = AsmTokOffsets.size(); i != e; ++i) {
185 if (TokIndex < AsmToks.size()) {
306 for (unsigned i = 0, e = AsmToks.size(); i < e; ++i) {
348 assert(TokOffsets.size() == AsmToks.size());
tools/clang/lib/Parse/Parser.cpp 251 for (unsigned i = 0, NumToks = Toks.size(); i != NumToks; ++i) {
265 if (Toks.size() == 1 && Toks[0] == tok::eof &&
tools/clang/lib/Sema/DeclSpec.cpp 270 I.Fun.NumExceptionsOrDecls = DeclsInPrototype.size();
272 I.Fun.DeclsInPrototype = new NamedDecl *[DeclsInPrototype.size()];
273 for (size_t J = 0; J < DeclsInPrototype.size(); ++J)
288 BindingGroup.NumBindings = Bindings.size();
296 if (Bindings.size()) {
298 Bindings.size() <= llvm::array_lengthof(InlineBindings)) {
304 new DecompositionDeclarator::Binding[Bindings.size()];
tools/clang/lib/Sema/DelayedDiagnostic.cpp 49 DD.AvailabilityData.SelectorLocs = new SourceLocation[Locs.size()];
51 sizeof(SourceLocation) * Locs.size());
52 DD.AvailabilityData.NumSelectorLocs = Locs.size();
tools/clang/lib/Sema/JumpDiagnostics.cpp 822 for (unsigned I = 0, E = ToScopes.size(); I != E; ++I)
tools/clang/lib/Sema/SemaAttr.cpp 645 OS << (I.index() == Rules.size() - 1 ? ", and " : ", ");
tools/clang/lib/Sema/SemaChecking.cpp 4229 if (IdxAST >= Args.size())
4232 NonNullArgs.resize(Args.size());
4254 NonNullArgs.resize(Args.size());
4283 NonNullArgs.resize(Args.size());
4317 CheckedVarArgs.resize(Args.size());
4336 for (unsigned ArgIdx = NumParams; ArgIdx < Args.size(); ++ArgIdx) {
4673 if (Args.size() < AdjustedNumArgs) {
4675 << 0 << AdjustedNumArgs << static_cast<unsigned>(Args.size())
4678 } else if (Args.size() > AdjustedNumArgs) {
4681 << 0 << AdjustedNumArgs << static_cast<unsigned>(Args.size())
4965 auto *Scope = Args[Args.size() - 1];
7139 if (format_idx >= Args.size()) {
7169 assert(ArgIdx < Args.size() && "ArgIdx outside bounds");
7192 if (Args.size() == firstDataArg) {
8790 const unsigned numDataArgs = Args.size() - firstDataArg;
11400 if (TypeArgs.size() != 1)
11429 if (TypeArgs.size() != 2)
14543 if (TypeTagIdxAST >= ExprArgs.size()) {
14563 if (ArgumentIdxAST >= ExprArgs.size()) {
tools/clang/lib/Sema/SemaCodeComplete.cpp 5036 if (Args.size() && !Args.data())
5039 for (unsigned I = 0; I != Args.size(); ++I)
5100 SemaRef, CurrentArg, Candidates.data(), Candidates.size(), OpenParLoc);
5185 if (!TooManyArguments(FP->getNumParams(), Args.size(),
5196 ProduceSignatureHelp(*this, S, Results, Args.size(), OpenParLoc);
5236 return ProduceSignatureHelp(*this, S, Results, Args.size(), OpenParLoc);
5578 for (unsigned I = 0, E = Initializers.size(); I != E; ++I) {
6133 unsigned NumSelIdents = SelIdents.size();
6213 R.StartParameter = SelIdents.size();
6571 if (I > SelIdents.size())
6574 if (I < SelIdents.size())
6577 else if (NeedSuperKeyword || I > SelIdents.size()) {
6793 R.StartParameter = SelIdents.size();
6826 getPreferredArgumentTypeForMessageSend(Results, SelIdents.size());
6968 R.StartParameter = SelIdents.size();
6983 getPreferredArgumentTypeForMessageSend(Results, SelIdents.size());
7049 if (I == SelIdents.size()) {
8363 unsigned NumSelIdents = SelIdents.size();
8382 R.StartParameter = SelIdents.size();
tools/clang/lib/Sema/SemaDecl.cpp 5586 TemplateParamLists.size() != 0) {
5686 (TemplateParamLists.size() == 0 || R->isFunctionType()))
5698 if (TemplateParamLists.size()) {
6760 TemplateParamLists.size() > 0
6802 if (TemplateParamLists.size() > VDTemplateParamLists)
8689 if (TemplateParamLists.size() > 1) {
8697 if (TemplateParamLists.size() > 0)
8725 if (TemplateParamLists.size() > 0)
11174 if (DeduceInits.size() > 1) {
11700 for (size_t Idx = 0; Idx < Args.size(); ++Idx) {
12813 for (unsigned i = 0, e = Group.size(); i != e; ++i) {
12875 if (Group.size() > 1) {
12878 for (unsigned i = 0, e = Group.size(); i != e; ++i) {
12906 DeclGroupRef::Create(Context, Group.data(), Group.size()));
12924 if (Group.size() >= 2) {
14712 assert(TemplateParameterLists.size() == 0 || TUK != TUK_Reference);
14725 if (TemplateParameterLists.size() > 0 ||
14747 /*FriendLoc*/ SourceLocation(), TemplateParameterLists.size() - 1,
15493 if (TemplateParameterLists.size() > 0) {
17356 for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
17383 for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
tools/clang/lib/Sema/SemaDeclAttr.cpp 7991 assert(SelectorSlotNames.size() == Locs.size());
7992 for (unsigned I = 0; I < Locs.size(); ++I) {
tools/clang/lib/Sema/SemaDeclCXX.cpp 877 if ((int64_t)Bindings.size() != NumElems) {
879 << DecompType << (unsigned)Bindings.size() << NumElems.toString(10)
880 << (NumElems < Bindings.size());
1121 if ((int64_t)Bindings.size() != TupleSize) {
1123 << DecompType << (unsigned)Bindings.size() << TupleSize.toString(10)
1124 << (TupleSize < Bindings.size());
1346 assert(Bindings.size() != NumFields);
1348 << DecompType << (unsigned)Bindings.size() << NumFields
1349 << (NumFields < Bindings.size());
1369 if (I >= Bindings.size())
1409 if (I != Bindings.size())
2638 for (unsigned idx = 0; idx < Bases.size(); ++idx) {
2662 if (Bases.size() > 1)
3296 if (TemplateParameterLists.size()) {
4949 Constructor->setNumCtorInitializers(Initializers.size());
4951 new (Context) CXXCtorInitializer*[Initializers.size()];
4953 Initializers.size() * sizeof(CXXCtorInitializer*));
4974 for (unsigned i = 0; i < Initializers.size(); i++) {
5152 for (unsigned InitIndex = 0; InitIndex != Inits.size(); ++InitIndex) {
5193 for (unsigned InitIndex = 0; InitIndex != Inits.size(); ++InitIndex) {
5327 for (unsigned i = 0; i < MemInits.size(); i++) {
5345 if (MemInits.size() != 1) {
10990 TemplateParamLists.size()
11022 if (TemplateParamLists.size()) {
11026 if (TemplateParamLists.size() != 1) {
11029 TemplateParamLists[TemplateParamLists.size()-1]->getRAngleLoc());
13399 switch (Args.size()) {
13642 unsigned NumArgs = ArgsPtr.size();
14616 FriendLoc, TempParamLists.size() - 1,
14629 for (unsigned I = TempParamLists.size(); I-- > 0; ) {
14783 if (TempParams.size() && !T->isElaboratedTypeSpecifier()) {
16047 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
16065 Exceptions.reserve(DynamicExceptions.size());
16066 for (unsigned ei = 0, ee = DynamicExceptions.size(); ei != ee; ++ei) {
tools/clang/lib/Sema/SemaDeclObjC.cpp 777 typeParamsIn.size());
1423 assert(numProtocolsResolved == identifiers.size() && "Unresolved protocols");
1515 assert(protocols.size() == identifierLocs.size());
1519 for (unsigned i = 0, n = identifiers.size(); i != n; ++i) {
1527 if (numProtocolsResolved == identifiers.size())
1537 for (unsigned i = 0, n = identifiers.size(); i != n; ++i) {
1614 assert(numTypeDeclsResolved == identifiers.size() && "Unresolved type decl");
1616 for (unsigned i = 0, n = identifiers.size(); i != n; ++i) {
1633 if (numTypeDeclsResolved == identifiers.size())
1640 for (unsigned i = 0, n = identifiers.size(); i != n; ++i) {
1733 if (numProtocolsResolved == identifiers.size())
1737 assert(numTypeDeclsResolved == identifiers.size() && "Not all types?");
2094 DeclsInGroup.reserve(Decls.size() + 1);
2096 for (unsigned i = 0, e = Decls.size(); i != e; ++i) {
3910 for (unsigned i = 0, e = allMethods.size(); i != e; i++ ) {
4101 for (unsigned i = 0, e = allTUVars.size(); i != e; i++) {
4112 for (unsigned i = 0, e = allTUVars.size(); i != e; i++) {
4691 assert(ObjCMethod->parameters().size() ==
4692 IMD->parameters().size() &&
tools/clang/lib/Sema/SemaExpr.cpp 395 if (Args.size() < numFormalParams + numArgsAfterSentinel + 1) {
402 Expr *sentinelExpr = Args[Args.size() - numArgsAfterSentinel - 1];
1426 unsigned NumAssocs = ArgTypes.size();
1427 assert(NumAssocs == ArgExprs.size());
1452 unsigned NumAssocs = Types.size();
1453 assert(NumAssocs == Exprs.size());
1605 assert(Args.size() <= 2 && "too many arguments for literal operator");
1608 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
1620 if (S.LookupLiteralOperator(Scope, R, llvm::makeArrayRef(ArgTy, Args.size()),
4988 FunctionCallCCC CCC(S, FuncName.getAsIdentifierInfo(), Args.size(), ME);
5050 if (Args.size() < NumParams) {
5051 if (Args.size() < MinArgs) {
5059 << static_cast<unsigned>(Args.size())
5071 << FnKind << MinArgs << static_cast<unsigned>(Args.size())
5088 if (Args.size() > NumParams) {
5097 << static_cast<unsigned>(Args.size())
5106 << static_cast<unsigned>(Args.size()) << Fn->getSourceRange()
5114 << FnKind << NumParams << static_cast<unsigned>(Args.size())
5157 if (ArgIx < Args.size()) {
5379 for (size_t i = 0, e = args.size(); i != e; i++) {
5410 ArgExprs.size() < FT->getNumParams())
5482 if (S.TooManyArguments(Callee->getNumParams(), ArgExprs.size(),
5486 if (Callee->getMinRequiredArguments() > ArgExprs.size())
5885 TheCall->shrinkNumArgs(Args.size());
5902 if (CorrectedTypos && Args.size() < NumParams) {
5912 TheCall->setNumArgsUnsafe(std::max<unsigned>(Args.size(), NumParams));
5960 if (FDecl->hasBody(Def) && Args.size() != Def->param_size()) {
5962 if (!Proto || !(Proto->isVariadic() && Args.size() >= Def->param_size()))
5964 << (Args.size() > Def->param_size()) << FDecl << Fn->getSourceRange();
5974 for (unsigned i = 0, e = Args.size(); i != e; i++) {
6157 for (unsigned I = 0, E = InitArgList.size(); I != E; ++I) {
6222 for (unsigned I = 0, E = InitArgList.size(); I != E; ++I) {
tools/clang/lib/Sema/SemaExprCXX.cpp 1014 for (int I = FunctionScopes.size();
1340 (Exprs.size() == 1 && isa<InitListExpr>(Exprs[0]))) &&
1346 Exprs.size()
1371 if (Exprs.size() == 1 && !ListInitialization &&
2363 AllocArgs.reserve((PassAlignment ? 2 : 1) + PlaceArgs.size());
2779 if (Func->getNumParams() == Params.size()) {
4964 ArgExprs.reserve(Args.size() - 1);
4965 for (unsigned I = 1, N = Args.size(); I != N; ++I) {
5037 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
5056 ConvertedArgs.reserve(Args.size());
5058 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
6680 unsigned SkipStart = OperatorArrows.size(), SkipCount = 0;
6683 if (OperatorArrows.size() > Limit) {
6686 SkipCount = OperatorArrows.size() - (Limit - 1);
6689 for (unsigned I = 0; I < OperatorArrows.size(); /**/) {
tools/clang/lib/Sema/SemaExprObjC.cpp 43 if (Strings.size() != 1) {
880 for (unsigned I = 0, N = Elements.size(); I != N; ++I) {
1567 for (unsigned i = 0, e = Args.size(); i != e; i++) {
1645 if (Args.size() < NumNamedArgs) {
1647 << 2 << NumNamedArgs << static_cast<unsigned>(Args.size());
1729 for (unsigned i = NumNamedArgs, e = Args.size(); i < e; ++i) {
1740 if (Args.size() != NumNamedArgs) {
1743 << 2 /*method*/ << NumNamedArgs << static_cast<unsigned>(Args.size())
1754 Method, SelLoc, makeArrayRef(Args.data(), Args.size()));
2474 unsigned NumArgs = ArgsIn.size();
2528 unsigned NumArgs = ArgsIn.size();
2717 unsigned NumArgs = ArgsIn.size();
3021 unsigned NumArgs = ArgsIn.size();
tools/clang/lib/Sema/SemaInit.cpp 3899 (IsListInit && Args.size() == 1 && isa<InitListExpr>(Args[0]) &&
3916 Args.size() == 1 &&
3936 if (S.getLangOpts().CPlusPlus17 && Args.size() == 1 &&
3993 (Args.size() == 1 && isa<InitListExpr>(Args[0]))) &&
4021 UnwrappedArgs.size() == 1 && UnwrappedArgs[0]->isRValue() &&
5599 for (unsigned I = 0, E = Args.size(); I != E; ++I)
5629 if (Args.size() == 1) {
5659 if (Args.size() != 1)
5835 assert(Args.size() >= 1 && "Zero-argument case handled above");
5838 if (Args.size() > 1) {
6364 unsigned NumArgs = Args.size();
6397 Kind.AllowExplicit() && !Kind.isCopyInit() && Args.size() == 1 &&
6885 N = std::min<unsigned>(Callee->getNumParams(), Args.size());
7774 Args.size() == 1) {
7826 Args.size() == 1 && isa<InitListExpr>(Args[0]) &&
7844 Entity.getKind() == InitializedEntity::EK_Variable && Args.size() > 0) {
7898 assert(Args.size() == 1);
8239 assert(Args.size() == 1 && "expected a single argument for list init");
8698 if (Args.size() == 1) {
8952 assert(Args.size() > 1 && "Expected multiple initializers!");
8984 if (Args.size())
8989 assert(Args.size() == 1 &&
9636 Candidate.Conversions.size() > 0;
9723 (Inits.size() == 1 && Kind.getKind() != InitializationKind::IK_Direct)
tools/clang/lib/Sema/SemaLambda.cpp 70 unsigned CurScopeIndex = FunctionScopes.size() - 1;
130 assert(CurScopeIndex < (FunctionScopes.size() - 1));
186 assert(((IndexOfCaptureReadyLambda != (FunctionScopes.size() - 1)) ||
533 LSI->NumExplicitTemplateParams = TParams.size();
tools/clang/lib/Sema/SemaLookup.cpp 2993 for (unsigned ArgIdx = 0; ArgIdx != Args.size(); ++ArgIdx) {
3414 else if (FD->getNumParams() == ArgTys.size()) {
3416 for (unsigned ArgIdx = 0; ArgIdx != ArgTys.size(); ++ArgIdx) {
3484 << R.getLookupName() << (int)ArgTys.size() << ArgTys[0]
3485 << (ArgTys.size() == 2 ? ArgTys[1] : QualType()) << AllowRaw
5394 if (Modules.size() > 1) {
5399 if (++N == 5 && N != Modules.size()) {
tools/clang/lib/Sema/SemaModule.cpp 368 for (unsigned I = 0, N = Path.size(); I != N; ++I) {
tools/clang/lib/Sema/SemaOpenMP.cpp 2599 assert(Clauses.size() <= 1 && "Expected at most one clause.");
2841 return StackComponents.size() == 1 ||
4036 if (NamedModifiersNumber == AllowedNameModifiers.size()) {
4044 AllowedNameModifiers.size() - NamedModifiersNumber;
4045 for (unsigned Cnt = 0, End = AllowedNameModifiers.size(); Cnt < End;
4714 assert(Aligneds.size() == Alignments.size());
4714 assert(Aligneds.size() == Alignments.size());
4715 assert(Linears.size() == LinModifiers.size());
4715 assert(Linears.size() == LinModifiers.size());
4716 assert(Linears.size() == Steps.size());
4716 assert(Linears.size() == Steps.size());
4948 Uniforms.size(), const_cast<Expr **>(Aligneds.data()), Aligneds.size(),
4948 Uniforms.size(), const_cast<Expr **>(Aligneds.data()), Aligneds.size(),
4950 const_cast<Expr **>(Linears.data()), Linears.size(),
4951 const_cast<unsigned *>(LinModifiers.data()), LinModifiers.size(),
5193 Data.ImplVendors.begin(), Data.ImplVendors.size(), SR);
5958 ResultIterSpaces[ResultIterSpaces.size() - 1 -
6038 ResultIterSpaces[ResultIterSpaces.size() - 1 -
6682 DSA.getOrderedRegionParam().second->getLoopNumIterations().size()) {
6854 DeclGroupRef::Create(Context, PreInits.begin(), PreInits.size()),
8094 assert(Clauses.size() <= 1 && "Extra clauses in flush directive");
11399 unsigned Skipped = Exclude.size();
11484 assert(Argument.size() == NumberOfElements &&
11485 ArgumentLoc.size() == NumberOfElements);
11494 assert(Argument.size() == 1 && ArgumentLoc.size() == 1);
11494 assert(Argument.size() == 1 && ArgumentLoc.size() == 1);
13688 ReductionData RD(VarList.size());
13708 ReductionData RD(VarList.size());
13728 ReductionData RD(VarList.size());
14470 TotalDepCount > VarList.size() &&
14472 DSAStack->getParentLoopControlVariable(VarList.size() + 1)) {
14474 << 1 << DSAStack->getParentLoopControlVariable(VarList.size() + 1);
15244 VarComponents.reserve(VarList.size());
15245 VarBaseDeclarations.reserve(VarList.size());
15519 for (unsigned I = 0, E = MapTypeModifiers.size(); I < E; ++I) {
15583 Decls.reserve(ReductionTypes.size());
tools/clang/lib/Sema/SemaOverload.cpp 953 for (unsigned i = 0, e = Args.size(); i != e; ++i)
6044 QualType T2 = Args.size() > 1 ? Args[1]->getType() : QualType();
6141 CandidateSet.addCandidate(Args.size(), EarlyConversions);
6150 Candidate.ExplicitCallArguments = Args.size();
6164 if (Args.size() == 1 && Constructor->isSpecializationCopyingObject() &&
6181 if (Shadow && Args.size() == 1 && Constructor->getNumParams() >= 1 &&
6210 if (TooManyArguments(NumParams, Args.size(), PartialOverloading) &&
6223 if (Args.size() < MinRequiredArgs && !PartialOverloading) {
6245 for (unsigned ArgIdx = 0; ArgIdx < Args.size(); ++ArgIdx) {
6312 if (Args.size() < NumNamedArgs)
6357 for (unsigned i = NumNamedArgs, e = Args.size(); i < e; ++i) {
6371 if (Args.size() != NumNamedArgs)
6417 unsigned ArgSizeNoVarargs = std::min(Function->param_size(), Args.size());
6436 if (!Function->isVariadic() && Args.size() < Function->getNumParams()) {
6437 for (unsigned i = Args.size(), e = Function->getNumParams(); i != e; ++i) {
6580 if (Args.size() > 0) {
6611 if (Args.size() > 0 &&
6697 CandidateSet.addCandidate(Args.size() + 1, EarlyConversions);
6704 Candidate.ExplicitCallArguments = Args.size();
6711 if (TooManyArguments(NumParams, Args.size(), PartialOverloading) &&
6724 if (Args.size() < MinRequiredArgs && !PartialOverloading) {
6761 for (unsigned ArgIdx = 0; ArgIdx < Args.size(); ++ArgIdx) {
6840 CandidateSet.addCandidate(Conversions.size(), Conversions);
6850 Candidate.ExplicitCallArguments = Args.size();
6904 CandidateSet.addCandidate(Conversions.size(), Conversions);
6917 Candidate.ExplicitCallArguments = Args.size();
6957 CandidateSet.allocateConversionSequences(ThisConversions + Args.size());
6976 for (unsigned I = 0, N = std::min(ParamTypes.size(), Args.size()); I != N;
6976 for (unsigned I = 0, N = std::min(ParamTypes.size(), Args.size()); I != N;
7287 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size() + 1);
7294 Candidate.ExplicitCallArguments = Args.size();
7327 if (Args.size() > NumParams && !Proto->isVariadic()) {
7335 if (Args.size() < NumParams) {
7344 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
7488 OverloadCandidate &Candidate = CandidateSet.addCandidate(Args.size());
7493 std::copy(ParamTys, ParamTys + Args.size(), Candidate.BuiltinParamTypes);
7498 Candidate.ExplicitCallArguments = Args.size();
7499 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
8208 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
8260 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
8299 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
8942 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx)
8948 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
9003 if (Args.size() == 1)
9008 if (Args.size() == 1) {
9017 if (Args.size() == 1)
9060 if (Args.size() == 1)
9315 unsigned NumArgs = Cand1.Conversions.size();
9316 assert(Cand2.Conversions.size() == NumArgs && "Overload candidate mismatch");
10672 for (unsigned N = Cand->Conversions.size(); I != N; ++I)
10752 assert(Cand->Conversions.size() <= 2 && "builtin operator is not binary");
10757 if (Cand->Conversions.size() == 1) {
10900 assert(L->Conversions.size() == R->Conversions.size());
10900 assert(L->Conversions.size() == R->Conversions.size());
10904 for (unsigned E = L->Conversions.size(); I != E; ++I) {
10970 unsigned ConvCount = Cand->Conversions.size();
11016 for (unsigned ParamIdx = Reversed ? ParamTypes.size() - 1 : 0;
11021 } else if (ArgIdx < ParamTypes.size()) {
11079 Cands, CompareOverloadCandidatesForDisplay(S, OpLoc, Args.size(), Kind));
11118 NoteFunctionCandidate(S, Cand, Args.size(),
12260 FunctionCallFilterCCC FunctionCallValidator(SemaRef, Args.size(),
12300 MultiExprArg(Args.data(), Args.size()),
13782 unsigned NumArgsSlots = 1 + std::max<unsigned>(Args.size(), NumParams);
13803 if (i < Args.size()) {
13833 for (unsigned i = NumParams, e = Args.size(); i < e; i++) {
14034 for (unsigned ArgIdx = 0, N = Args.size(); ArgIdx != N; ++ArgIdx) {
14048 Context, Fn.get(), llvm::makeArrayRef(ConvArgs, Args.size()), ResultTy,
tools/clang/lib/Sema/SemaStmt.cpp 390 const unsigned NumElts = Elts.size();
3842 unsigned NumCatchStmts = CatchStmts.size();
4081 const unsigned NumHandlers = Handlers.size();
4352 RecordDecl *RD = CreateCapturedStmtRecordDecl(CD, Loc, Params.size());
tools/clang/lib/Sema/SemaStmtAsm.cpp 114 for (unsigned p = 0, e = AsmStrPieces.size(); p != e; ++p) {
217 for (unsigned int i = 0; i < Exprs.size() - NumLabels; ++i) {
247 unsigned NumClobbers = clobbers.size();
tools/clang/lib/Sema/SemaTemplate.cpp 905 for (unsigned I = 0, Last = TemplateArgsIn.size(); I != Last; ++I)
1341 llvm::makeArrayRef(Params.data(), Params.size()),
2817 if (ParamIdx < ParamLists.size()) {
2832 if (ParamIdx < ParamLists.size()) {
2864 if (ParamIdx < ParamLists.size() &&
2871 if (ParamIdx < ParamLists.size()) {
2899 if (ParamIdx >= ParamLists.size()) {
2916 if (ParamIdx < ParamLists.size() - 1) {
2919 for (unsigned I = ParamIdx, E = ParamLists.size() - 1; I != E; ++I) {
2930 ParamLists[ParamLists.size() - 2]->getRAngleLoc());
3686 if (Params->size() != Args.size())
3691 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
6517 if (Value.hasLValuePath() && Value.getLValuePath().size() == 1 &&
6524 } else if (!Value.hasLValuePath() || Value.getLValuePath().size() ||
7684 SourceLocation TemplateKWLoc = TemplateParameterLists.size() > 0
7866 TemplateParameterLists.size() - 1,
7884 if (TemplateParameterLists.size() > 1 && SS.isSet()) {
7910 if (TemplateParameterLists.size() > 0) {
8060 if (TemplateParameterLists.size() > 1) {
tools/clang/lib/Sema/SemaTemplateDeduction.cpp 2240 if (ArgIdx == Args.size())
2247 assert(ArgIdx == Args.size() - 1 && "Pack not at the end of argument list?");
2250 return ArgIdx < Args.size();
3826 if (Args.size() < Function->getMinRequiredArguments() && !PartialOverloading)
3828 else if (TooManyArguments(NumParams, Args.size(), PartialOverloading)) {
3890 if (ArgIdx >= Args.size())
3921 for (; ArgIdx < Args.size() && PackScope.hasNextElement();
3933 for (unsigned I = 0; I != *NumExpansions && ArgIdx < Args.size();
tools/clang/lib/Sema/SemaTemplateInstantiate.cpp 242 Inst.NumTemplateArgs = TemplateArgs.size();
891 assert(NewDecls.size() == 1 &&
2932 return Instantiator.TransformExprs(Exprs.data(), Exprs.size(),
tools/clang/lib/Sema/SemaTemplateVariadic.cpp 356 for (unsigned I = 0, N = Unexpanded.size(); I != N; ++I) {
tools/clang/lib/Sema/SemaType.cpp 878 for (unsigned i = 0, n = typeArgs.size(); i != n; ++i) {
924 << (unsigned)typeArgs.size()
1021 << (typeArgs.size() < typeParams->size())
1107 protocols.size()),
1129 for (unsigned i = 0, n = protocols.size(); i != n; ++i)
1158 for (unsigned i = 0, n = TypeArgs.size(); i != n; ++i) {
1176 Protocols.size()),
1198 assert(OTPTL.getNumProtocols() == Protocols.size());
1201 for (unsigned i = 0, n = Protocols.size(); i != n; ++i)
1225 assert(ObjCObjectTL.getNumProtocols() == Protocols.size());
1228 for (unsigned i = 0, n = Protocols.size(); i != n; ++i)
2504 for (size_t paramIndex = 0, numParams = paramTypes.size();
2550 for (unsigned Idx = 0, Cnt = ParamTypes.size(); Idx < Cnt; ++Idx) {
tools/clang/lib/Sema/TreeTransform.h 459 assert(New.size() == 1 &&
5160 unsigned NumParams = Params.size();
7154 TransformedExprs.reserve(SrcExprs.size());
7155 for (unsigned i = 0, e = SrcExprs.size(); i != e; ++i) {
7877 TClauses.reserve(Clauses.size());
7906 if (TClauses.size() != Clauses.size()) {
12034 if (!PackArgs.size()) {
tools/clang/lib/Serialization/ASTReader.cpp 7938 assert(LexicalDecls.size() % 2 == 0 && "expected an even number of entries");
7939 for (int I = 0, N = LexicalDecls.size(); I != N; I += 2) {
8588 for (unsigned I = 0, N = Methods.size(); I != N; ++I) {
tools/clang/lib/Serialization/ASTWriter.cpp 556 Record.push_back(T->getTypeArgsAsWritten().size());
2797 if (SkippedRanges.size() > 0) {
2799 SerializedSkippedRanges.reserve(SkippedRanges.size());
4578 push_back(Attrs.size());
6131 Writer.push_back(Bases.size());
6149 Writer.push_back(CtorInits.size());
6701 Record.push_back(C->getLoopNumIterations().size());
6705 for (unsigned I = 0, E = C->getLoopNumIterations().size(); I <E; ++I)
tools/clang/lib/Serialization/ASTWriterDecl.cpp 1108 Record.push_back(D->bindings().size());
1391 for (unsigned I = 0, N = IdentifierLocs.size(); I != N; ++I)
1393 Record.push_back(IdentifierLocs.size());
tools/clang/lib/Serialization/ASTWriterStmt.cpp 125 Record.push_back(S->getAttrs().size());
349 Record.push_back(CoroStmt->getParamMoves().size());
395 Record.push_back(TemplateArgs.size());
1792 Record.push_back(E->isPartiallySubstituted() ? E->getPartialArguments().size()
tools/clang/lib/Serialization/GlobalModuleIndex.cpp 304 for (unsigned I = 0, N = StoredDependencies.size(); I != N; ++I) {
tools/clang/lib/StaticAnalyzer/Checkers/CallAndMessageChecker.cpp 403 unsigned Params = Call.parameters().size();
tools/clang/lib/StaticAnalyzer/Checkers/LocalizationChecker.cpp 850 for (unsigned i = 0, ei = formals.size(); i != ei; ++i) {
890 for (unsigned i = 0, ei = std::min(static_cast<unsigned>(formals.size()),
tools/clang/lib/StaticAnalyzer/Checkers/NonNullParamChecker.cpp 81 bool HasParam = idx < parms.size();
tools/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/RetainCountChecker.cpp 440 if (ArgIdx >= CE.parameters().size())
tools/clang/lib/StaticAnalyzer/Checkers/RetainCountChecker/RetainCountDiagnostics.cpp 386 for (unsigned I=0; I < Call->getNumArgs() && I < Parameters.size(); ++I) {
tools/clang/lib/StaticAnalyzer/Core/BugReporter.cpp 2889 assert(EQ.getReports().size() > 0);
3209 MaxBugClassSize.updateMax(bugReports.size());
3221 MaxValidBugClassSize.updateMax(bugReports.size());
tools/clang/lib/StaticAnalyzer/Core/BugReporterVisitors.cpp 586 for (unsigned I = 0; I < Call->getNumArgs() && I < parameters.size(); ++I) {
tools/clang/lib/StaticAnalyzer/Core/CallEvent.cpp 372 (!CD.RequiredParams || CD.RequiredParams <= parameters().size());
412 (!CD.RequiredParams || CD.RequiredParams == parameters().size());
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 228 if (fixits.size() == 0)
303 assert(P.getFixits().size() == 0 &&
373 assert(P.getFixits().size() == 0 &&
388 assert(P.getFixits().size() == 0 &&
478 assert(P.getFixits().size() == 0 &&
tools/clang/lib/Tooling/AllTUsExecution.cpp 84 if (Actions.size() != 1)
tools/clang/lib/Tooling/InterpolatingCompilationDatabase.cpp 464 auto Range = std::equal_range(Idx.data(), Idx.data() + Idx.size(), Key,
tools/clang/lib/Tooling/Refactoring/Rename/RenamingAction.cpp 151 assert(NewName.getNamePieces().size() == Ranges.size() &&
151 assert(NewName.getNamePieces().size() == Ranges.size() &&
tools/clang/lib/Tooling/Refactoring/Rename/SymbolOccurrences.cpp 20 assert(Locations.size() == NamePieces.size() &&
20 assert(Locations.size() == NamePieces.size() &&
23 if (Locations.size() == 1) {
28 MultipleRanges = std::make_unique<SourceRange[]>(Locations.size());
30 SourceLocation::getFromRawEncoding(Locations.size()));
tools/clang/lib/Tooling/Refactoring/Rename/USRLocFinder.cpp 68 assert(NameRanges.size() == 1 &&
tools/clang/lib/Tooling/StandaloneExecution.cpp 59 if (Actions.size() != 1)
tools/clang/lib/Tooling/Syntax/Tokens.cpp 583 for (unsigned I = 1; I < Tokens.size(); ++I) {
tools/clang/tools/c-index-test/core_main.cpp 122 OS << "rel: " << Relations.size() << '\n';
tools/clang/tools/clang-import-test/clang-import-test.cpp 306 if (Imports.size())
tools/clang/tools/clang-offload-bundler/ClangOffloadBundler.cpp 448 NumberOfInputs = Inputs.size();
tools/clang/tools/clang-offload-wrapper/ClangOffloadWrapper.cpp 203 ImagesInits.reserve(Bufs.size());
211 auto *Size = ConstantInt::get(getSizeTTy(), Buf.size());
tools/clang/tools/diagtool/TreeView.cpp 108 assert(NonRootGroupIDs.size() < AllGroups.size());
110 for (unsigned i = 0, e = AllGroups.size(); i != e; ++i) {
tools/clang/tools/driver/cc1gen_reproducer_main.cpp 157 if (Argv.size() < 1) {
173 if (Argv.size() > 1 && Argv[1] == StringRef("-v"))
tools/clang/tools/extra/clang-reorder-fields/ReorderFieldsAction.cpp 65 if (DesiredFieldsOrder.size() != NameToIndex.size()) {
171 SmallVector<unsigned, 10> NewFieldsPositions(NewFieldsOrder.size());
172 for (unsigned i = 0, e = NewFieldsOrder.size(); i < e; ++i)
238 if (InitListEx->getNumInits() != NewFieldsOrder.size()) {
tools/clang/tools/extra/clang-tidy/bugprone/ArgumentCommentCheck.cpp 138 for (unsigned I = 0, E = Params.size(); I != E; ++I) {
253 unsigned NumArgs = std::min<unsigned>(Args.size(), Callee->getNumParams());
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/SpecialMemberFunctionsCheck.cpp 90 size_t LastIndex = SMFS.size() - 1;
tools/clang/tools/extra/clang-tidy/mpi/BufferDerefCheck.cpp 84 for (size_t i = 0; i < BufferTypes.size(); ++i) {
tools/clang/tools/extra/clang-tidy/mpi/TypeMismatchCheck.cpp 307 for (size_t i = 0; i < MPIDatatypes.size(); ++i) {
tools/clang/tools/extra/clang-tidy/readability/IsolateDeclarationCheck.cpp 207 Snippets.reserve(Ranges.size());
234 assert(Snippets.size() > 2 && "Not enough snippets to create isolated decls");
235 std::vector<std::string> Decls(Snippets.size() - 1);
237 for (std::size_t I = 1; I < Snippets.size(); ++I)
tools/clang/tools/extra/clangd/FuzzyMatch.cpp 156 assert(Text.size() == Roles.size());
tools/clang/tools/extra/clangd/QueryDriverDatabase.cpp 188 RegTexts.reserve(Globs.size());
tools/clang/tools/extra/clangd/Selection.cpp 41 Tokens.reserve(Spelled.size());
tools/clang/tools/extra/clangd/SemanticHighlighting.cpp 152 if (Conflicting.size() == 1)
156 TokRef = TokRef.drop_front(Conflicting.size());
466 if (Tokens.size() == 0)
472 Lines.reserve(Tokens.size());
tools/clang/tools/extra/clangd/index/FileIndex.cpp 156 It->getSecond().References += Sym.second.size();
186 Count += Sym.second.size();
tools/clang/tools/extra/clangd/index/Serialization.cpp 100 if (LLVM_UNLIKELY(StringIndex >= Strings.size())) {
347 writeVar(Refs.size(), OS);
tools/clang/tools/extra/clangd/index/dex/PostingList.cpp 70 return Chunks.size() * ApproxEntriesPerChunk;
137 if (Width > Payload.size())
tools/clang/tools/extra/clangd/index/dex/dexp/Dexp.cpp 92 bool Ok = llvm::cl::ParseCommandLineOptions(Argv.size(), Argv.data(),
tools/clang/tools/extra/clangd/refactor/Rename.cpp 188 if (Rename.getNameRanges().size() > 1)
tools/clang/tools/extra/clangd/unittests/DraftStoreTests.cpp 41 for (size_t i = 1; i < Steps.size(); i++) {
66 for (size_t i = 0; i < Steps.size() - 1; i++) {
tools/clang/tools/extra/clangd/unittests/ExpectedTypeTest.cpp 56 Elements.reserve(Classes.size());
tools/clang/tools/extra/clangd/unittests/ParsedASTTests.cpp 183 ASSERT_GT(T.expandedTokens().size(), 2u);
209 ASSERT_GT(T.expandedTokens().size(), 7u);
tools/clang/tools/extra/clangd/unittests/SemanticHighlightingTests.cpp 31 std::vector<HighlightingToken> Tokens(Ranges.size());
32 for (int I = 0, End = Ranges.size(); I < End; ++I) {
tools/clang/tools/extra/pp-trace/PPCallbacksTracker.cpp 278 for (int i = 0, e = Ids.size(); i != e; ++i) {
541 for (int I = 0, E = Value.size(); I != E; ++I) {
tools/clang/tools/libclang/CIndex.cpp 8336 return TopHeaders.size();
8351 if (Index < TopHeaders.size())
tools/clang/tools/libclang/CIndexCodeCompletion.cpp 335 if (FixIts.size() <= fixit_index) {
tools/clang/tools/libclang/CXType.cpp 1125 unsigned size = TA.size();
1206 return OT->getTypeArgs().size();
1219 if ((size_t)i >= TA.size())
tools/clang/unittests/AST/ASTVectorTest.cpp 82 ASSERT_EQ(V.begin() + IntVec.size(), I);
86 ASSERT_EQ(V.begin() + IntVec.size(), I);
tools/clang/unittests/Lex/LexerTest.cpp 85 EXPECT_EQ(ExpectedTokens.size(), toks.size());
86 for (unsigned i = 0, e = ExpectedTokens.size(); i != e; ++i) {
tools/clang/unittests/Tooling/ASTSelectionTest.cpp 727 EXPECT_EQ(Parents.size(), 3u);
748 EXPECT_EQ(Parents.size(), 3u);
802 EXPECT_EQ(Parents.size(), 2u);
830 EXPECT_EQ(Parents.size(), 4u);
860 EXPECT_EQ(Parents.size(), 3u);
888 EXPECT_EQ(Parents.size(), 3u);
937 EXPECT_EQ(Parents.size(), 4u);
961 EXPECT_EQ(Parents.size(), 4u);
1078 SelectedCode->getParents()[SelectedCode->getParents().size() - 1]
tools/clang/unittests/Tooling/RefactoringActionRulesTest.cpp 233 EXPECT_EQ(Occurrences[0].getNameRanges().size(), 1u);
tools/clang/utils/TableGen/ClangAttrEmitter.cpp 2746 for (signed i = 0, e = SuperClasses.size(); i != e; ++i) {
tools/clang/utils/TableGen/ClangOpcodesEmitter.cpp 347 for (size_t I = 0, N = Types.size(); I < N; ++I) {
tools/clang/utils/TableGen/NeonEmitter.cpp 2003 for (unsigned I = 0; I < Types.size(); ++I) {
2023 if (I.getNumParams() != Types.size())
2027 for (unsigned Arg = 0; Arg < Types.size(); ++Arg) {
2064 if (R->getSuperClasses().size() >= 2)
tools/dsymutil/CompileUnit.cpp 58 if (Block->size() > OrigUnit.getAddressByteSize() &&
tools/dsymutil/DwarfLinker.cpp 1198 DataExtractor Data(StringRef((const char *)Bytes.data(), Bytes.size()),
1408 uint64_t EndOffset = BaseOffset + Data.size();
1413 assert(ValidReloc.Offset - BaseOffset < Data.size());
1414 assert(ValidReloc.Offset - BaseOffset + ValidReloc.Size <= Data.size());
tools/gold/gold-plugin.cpp 715 assert(InputFileSyms.size() == F.syms.size());
tools/lld/COFF/Chunks.cpp 356 memcpy(buf, a.data(), a.size());
605 if (data.size() < 4)
tools/lld/COFF/Chunks.h 260 relocsSize = newRelocs.size();
261 assert(relocsSize == newRelocs.size() && "reloc size truncation");
tools/lld/COFF/Driver.cpp 935 if (symIndex >= syms.size())
1101 if (argsArr.size() > 1 && StringRef(argsArr[1]).equals_lower("/lib")) {
tools/lld/COFF/DriverUtils.cpp 819 argv.data() + argv.size());
827 if (args.hasArg(OPT_verbose) && argv.size() != expandedArgv.size()) {
tools/lld/COFF/InputFiles.cpp 245 directives = StringRef((const char *)data.data(), data.size());
705 exitOnErr(reader.readArray(subsections, data.size()));
902 std::vector<std::pair<Symbol *, bool>> comdat(obj->getComdatTable().size());
903 for (size_t i = 0; i != obj->getComdatTable().size(); ++i)
tools/lld/COFF/MapFile.cpp 77 std::vector<std::string> str(syms.size());
78 parallelForEachN((size_t)0, syms.size(), [&](size_t i) {
85 for (size_t i = 0, e = syms.size(); i < e; ++i)
tools/lld/COFF/PDB.cpp 291 if (debugH.size() < sizeof(object::debug_h_header))
299 (debugH.size() % 8 == 0);
318 uint32_t count = debugH.size() / sizeof(GloballyHashedType);
390 types.getUnderlyingStream().drop_front(firstType->RecordData.size()));
577 if (ti.toArrayIndex() >= typeIndexMap.size())
591 if (contents.size() < ref.Offset + byteSize)
704 assert(alignedMem.size() >= size && "didn't preallocate enough");
924 bulkSymbols.size() + sym.length());
993 exitOnErr(reader.readArray(subsections, relocatedDebugContents.size()));
1205 uint32_t count = relocatedDebugContents.size() / sizeof(object::FpoData);
1677 sectionTable.size() / sizeof(object::coff_section)};
1740 exitOnErr(reader.readArray(subsections, contents.size()));
tools/lld/COFF/SymbolTable.cpp 295 if (sc && sc->getRelocs().size() == 1 && *sc->symbols().begin() == sym) {
tools/lld/COFF/Writer.cpp 421 for (size_t j = 0, e = originalRelocs.size(); j < e; ++j) {
474 bAlloc.Allocate<coff_relocation>(originalRelocs.size()),
475 originalRelocs.size());
478 const_cast<coff_relocation *>(curRelocs.data()), curRelocs.size());
485 for (size_t i = 0, e = originalRelocs.size(); i != e; ++i) {
506 for (size_t j = 0, e = relocs.size(); j < e; ++j) {
1636 if (data.size() % 4 != 0) {
1645 reinterpret_cast<const ulittle32_t *>(data.data()), data.size() / 4);
1648 if (symIndex >= objSymbols.size()) {
tools/lld/ELF/AArch64ErrataFix.cpp 596 (dataSym == mapSyms.end()) ? isec->data().size() : (*dataSym)->value;
tools/lld/ELF/ARMErrataFix.cpp 490 uint64_t limit = (nonThumbSym == mapSyms.end()) ? isec->data().size()
tools/lld/ELF/Arch/PPC64.cpp 124 uint64_t index = std::min<uint64_t>(offset / 8, relas.size() - 1);
tools/lld/ELF/Driver.cpp 1650 for (size_t i = 0, e = syms.size(); i != e; ++i)
tools/lld/ELF/DriverUtils.cpp 118 SmallVector<const char *, 256> vec(argv.data(), argv.data() + argv.size());
tools/lld/ELF/EhFrame.cpp 66 if (d.size() < 4)
76 if (size > d.size())
91 if (d.size() < count)
146 if (size >= d.size())
tools/lld/ELF/ICF.cpp 238 for (size_t i = 0; i < ra.size(); ++i) {
325 assert(ra.size() == rb.size());
325 assert(ra.size() == rb.size());
327 for (size_t i = 0; i < ra.size(); ++i) {
tools/lld/ELF/InputFiles.cpp 291 for (uint64_t curIndex = 0; curIndex < sections.size(); ++curIndex) {
357 if (firstGlobal == 0 || firstGlobal > eSyms.size())
361 numELFSyms = eSyms.size();
400 if (sec.sh_info >= symbols.size())
475 this->sections.resize(sections.size());
504 uint64_t size = objSections.size();
509 for (size_t i = 0, e = objSections.size(); i < e; ++i) {
590 for (size_t i = 0, e = objSections.size(); i < e; ++i) {
716 if (data.size() < sizeof(Elf_Nhdr))
720 if (data.size() < nhdr->getSize())
736 if (desc.size() < 8)
872 target->numRelocations = rels.size();
877 target->numRelocations = rels.size();
984 this->symbols.resize(eSyms.size());
988 for (size_t i = 0, end = eSyms.size(); i != end; ++i)
994 for (size_t i = 0, end = eSyms.size(); i != end; ++i) {
1146 if (0 < sym.st_shndx && sym.st_shndx < sections.size())
1256 for (size_t i = 0; i < syms.size(); ++i) {
1461 STV_DEFAULT, STT_OBJECT, data.size(), 0, section});
1463 STV_DEFAULT, STT_OBJECT, data.size(), 0, nullptr});
1533 this->symbols.resize(eSyms.size());
1536 for (size_t i = firstGlobal, end = eSyms.size(); i != end; ++i)
tools/lld/ELF/InputSection.cpp 68 if (sectionKind == SectionBase::Merge && rawData.size() > UINT32_MAX)
141 return rawData.size();
223 if (rawData.size() < 8) {
242 if (rawData.size() < sizeof(Chdr64)) {
260 if (rawData.size() < sizeof(Chdr32)) {
1135 memcpy(buf + outSecOff, data().data(), data().size());
1136 uint8_t *bufEnd = buf + outSecOff + data().size();
1174 for (unsigned n = rels.size(); relocI < n; ++relocI) {
1198 for (size_t off = 0, end = data().size(); off != end;) {
1248 size_t size = data.size();
1284 if (this->data().size() <= offset)
tools/lld/ELF/InputSection.h 198 size_t s = data().size();
258 (pieces.size() - 1 == i) ? data().size() : pieces[i + 1].inputOff;
tools/lld/ELF/LTO.cpp 167 std::vector<lto::SymbolResolution> resols(syms.size());
170 for (size_t i = 0, e = syms.size(); i != e; ++i) {
tools/lld/ELF/LinkerScript.cpp 1185 for (size_t i = 0; i < vec.size(); ++i)
tools/lld/ELF/MapFile.cpp 86 std::vector<std::string> str(syms.size());
87 parallelForEachN(0, syms.size(), [&](size_t i) {
97 for (size_t i = 0, e = syms.size(); i < e; ++i)
tools/lld/ELF/MarkLive.cpp 155 for (size_t j = firstRelI, end2 = rels.size(); j < end2; ++j)
tools/lld/ELF/Relocations.cpp 913 while (i != pieces.size() && pieces[i].inputOff + pieces[i].size <= off)
915 if (i == pieces.size())
1392 sec.relocations.reserve(rels.size());
tools/lld/ELF/SyntheticSections.cpp 113 const size_t size = sec->data().size();
188 if (d.size() < sizeof(Elf_Mips_Options)) {
241 if (sec->data().size() != sizeof(Elf_Mips_RegInfo)) {
335 assert(buf.size() == hashSize);
449 memcpy(buf, d.data(), d.size());
451 size_t aligned = alignTo(d.size(), config->wordsize);
454 memset(buf + d.size(), 0, aligned - d.size());
454 memset(buf + d.size(), 0, aligned - d.size());
1189 return namedVersionDefs().size() + 1;
1831 add(g.size());
2678 numSymbols += v.size();
2927 return (getPartition().dynSymTab->getSymbols().size() + 1) * 2;
3323 memcpy(buf + offset, d->data().data(), d->data().size());
tools/lld/ELF/Writer.cpp 2668 while (arr.size() > chunkSize) {
2686 std::vector<uint8_t> hashes(chunks.size() * hashBuf.size());
2690 hashFn(hashes.data() + i * hashBuf.size(), chunks[i]);
tools/lld/MinGW/Driver.cpp 101 SmallVector<const char *, 256> vec(argv.data(), argv.data() + argv.size());
tools/lld/lib/Core/SymbolTable.cpp 241 return memcmp(lc.data(), rc.data(), lc.size()) == 0;
tools/lld/lib/Driver/DarwinLdDriver.cpp 304 unsigned numArgs = ctx.llvmOptions().size();
tools/lld/lib/ReaderWriter/MachO/ArchHandler.cpp 144 if (atom->rawContent().size() < sizeof(uint32_t))
tools/lld/lib/ReaderWriter/MachO/Atoms.h 47 uint64_t size() const override { return _content.size(); }
tools/lld/lib/ReaderWriter/MachO/CompactUnwindPass.cpp 218 headerSize + 2 * page.entries.size() * sizeof(uint32_t);
227 write16(&_contents[curPageOffset + 6], page.entries.size(), _isBig);
333 unsigned entriesInPage = std::min(1021U, (unsigned)remainingInfos.size());
418 if (atom->rawContent().size() < 4 * sizeof(uint32_t))
tools/lld/lib/ReaderWriter/MachO/File.h 44 assert(sectionOffset+contentSize <= inSection->content.size());
66 assert(sectionOffset+contentSize <= inSection->content.size());
147 assert(offsetInSect < section.content.size());
155 uint64_t atomsEndOffset = ao.offset+ao.atom->rawContent().size();
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileBinaryWriter.cpp 294 offset += sect.content.size();
476 if (s2.address >= s1.address+s1.content.size())
478 if (s1.address >= s2.address+s2.content.size())
523 && (s.address+s.content.size() <= sg.address+sg.size)) {
555 isZeroFillSection(s->type) ? 0 : s->content.size();
618 return sect.content.size() / sect.indirectSymbols.size();
637 + _file.sections.back().content.size();
639 _file.sections.back().content.size() -
652 sout->size = sin.content.size();
719 sect->size = section->content.size();
1030 memcpy(p, &s.content[0], s.content.size());
1031 p += s.content.size();
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileFromAtoms.cpp 919 atom->rawContent().size(), ""));
921 atom->rawContent().size(), ""));
1516 file.ownedAllocations.Allocate<uint8_t>(sectionContent.size());
1518 sectionContent.size()};
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileToAtoms.cpp 332 section.address + section.content.size(),
360 section.address + section.content.size(),
397 if ((section.content.size() % sizeMultiple) != 0)
402 + Twine(section.content.size())
412 for (unsigned int offset = 0, e = section.content.size(); offset != e;) {
445 if (offset+size > section.content.size()) {
496 if ((sAddr <= address) && (address < sAddr+s.content.size())) {
604 if (reloc.offset > section.content.size())
608 + Twine(section.content.size()) + ")");
829 S.content.size());
960 if (debugInfo->content.size() == 0)
963 if (debugInfo->content.size() < 12)
1368 if (content.size() != 8)
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileYAML.cpp 305 uint64_t size = sect.content.size();
tools/lld/lib/ReaderWriter/YAML/ReaderWriterYAML.cpp 830 _content.reserve(cont.size());
tools/lld/unittests/MachOTests/MachONormalizedFileBinaryReaderTests.cpp 281 EXPECT_EQ(text.content.size(), 45UL);
306 EXPECT_EQ(cstring.content.size(), 7UL);
406 EXPECT_EQ(text.content.size(), 48UL);
441 EXPECT_EQ(cstring.content.size(), 7UL);
538 EXPECT_EQ(text.content.size(), 42UL);
582 EXPECT_EQ(cstring.content.size(), 7UL);
682 EXPECT_EQ(text.content.size(), 68UL);
725 EXPECT_EQ(cstring.content.size(), 7UL);
tools/lld/unittests/MachOTests/MachONormalizedFileBinaryWriterTests.cpp 183 EXPECT_EQ(48UL, text.content.size());
295 EXPECT_EQ(22UL, text.content.size());
421 EXPECT_EQ(18UL, text.content.size());
578 EXPECT_EQ(44UL, text.content.size());
tools/lld/unittests/MachOTests/MachONormalizedFileToAtomsTests.cpp 82 EXPECT_EQ(2U, atom1->rawContent().size());
88 EXPECT_EQ(1U, atom2->rawContent().size());
93 EXPECT_EQ(1U, atom3->rawContent().size());
tools/lld/unittests/MachOTests/MachONormalizedFileYAMLTests.cpp 218 EXPECT_EQ(sect.content.size(), 2UL);
290 EXPECT_EQ(sect1.content.size(), 22UL);
320 EXPECT_EQ(sect2.content.size(), 7UL);
420 EXPECT_EQ(sect1.content.size(), 33UL);
457 EXPECT_EQ(sect2.content.size(), 7UL);
548 EXPECT_EQ(sect1.content.size(), 32UL);
585 EXPECT_EQ(sect2.content.size(), 7UL);
688 EXPECT_EQ(sect1.content.size(), 22UL);
741 EXPECT_EQ(sect2.content.size(), 7UL);
tools/lld/wasm/Driver.cpp 159 SmallVector<const char *, 256> vec(argv.data(), argv.data() + argv.size());
635 for (size_t i = 0, e = syms.size(); i != e; ++i)
tools/lld/wasm/InputChunks.cpp 93 memcpy(buf + outputOffset, data().data(), data().size());
104 << " count=" << relocations.size() << "\n");
300 << " count=" << relocations.size() << "\n");
tools/lld/wasm/InputChunks.h 42 virtual uint32_t getSize() const { return data().size(); }
56 size_t getNumRelocations() const { return relocations.size(); }
141 return data().size();
tools/lld/wasm/InputFiles.cpp 265 wasmObj->getNumImportedFunctions() + wasmObj->functions().size();
309 typeMap.resize(getWasmObj()->types().size());
310 typeIsUsed.resize(getWasmObj()->types().size(), false);
330 functions.reserve(funcs.size());
332 for (size_t i = 0, e = funcs.size(); i != e; ++i) {
tools/lld/wasm/LTO.cpp 92 std::vector<lto::SymbolResolution> resols(syms.size());
tools/lld/wasm/OutputSections.cpp 85 writeUleb128(os, functions.size(), "function count");
139 assert((!config->isPic || segments.size() <= 1) &&
239 " chunks=" + Twine(inputSections.size()));
tools/lld/wasm/OutputSections.h 67 bool isNeeded() const override { return functions.size() > 0; }
tools/lld/wasm/Writer.cpp 574 for (uint32_t i = 0; i < types.size(); i++)
tools/lldb/source/API/SBModuleSpec.cpp 136 return m_opaque_up->GetUUID().GetBytes().size();
tools/lldb/source/API/SBTrace.cpp 43 return buffer.size();
62 return buffer.size();
tools/lldb/source/Core/ValueObject.cpp 499 if (idxs.size() == 0)
515 if (idxs.size() == 0)
532 if (names.size() == 0)
549 if (names.size() == 0)
tools/lldb/source/Expression/IRInterpreter.cpp 674 if (args.size() <= static_cast<size_t>(arg_index)) {
tools/lldb/source/Host/common/Editline.cpp 895 if (results.size() < page_size) {
901 while (cur_pos < results.size()) {
902 size_t remaining = results.size() - cur_pos;
909 if (cur_pos >= results.size())
942 if (results.size() == 0)
945 if (results.size() == 1) {
tools/lldb/source/Host/common/NativeProcessProtocol.cpp 392 it->second.breakpoint_opcodes.size(), 0);
450 llvm::SmallVector<uint8_t, 4> saved_opcode_bytes(expected_trap->size(), 0);
473 error = WriteMemory(addr, expected_trap->data(), expected_trap->size(),
479 if (bytes_written != expected_trap->size()) {
484 expected_trap->size(), bytes_written);
487 llvm::SmallVector<uint8_t, 4> verify_bp_opcode_bytes(expected_trap->size(),
563 return cantFail(GetSoftwareBreakpointTrapOpcode(0)).size();
652 if (bp_addr + saved_opcodes.size() < addr || addr + bytes_read <= bp_addr)
661 std::min(saved_opcodes.size(), bp_data.size()),
661 std::min(saved_opcodes.size(), bp_data.size()),
tools/lldb/source/Host/common/OptionParser.cpp 45 return getopt_long_only(argv.size() - 1, argv.data(), opt_cstr.c_str(),
tools/lldb/source/Interpreter/Options.cpp 200 uint32_t Options::NumCommandOptions() { return GetDefinitions().size(); }
211 m_getopt_table.resize(defs.size() + 1);
212 for (size_t i = 0; i < defs.size(); ++i) {
814 for (uint32_t i = 0; i < group_option_defs.size(); ++i) {
832 for (uint32_t i = 0; i < group_option_defs.size(); ++i) {
1196 for (size_t i = 0; i < opt_defs.size(); i++) {
tools/lldb/source/Plugins/ABI/MacOSX-arm64/ABIMacOSX_arm64.cpp 1695 for (size_t i = 0; i < args.size(); ++i)
1709 if (args.size() > 8) // TODO handle more than 6 arguments
1712 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/MacOSX-i386/ABIMacOSX_i386.cpp 744 sp -= 4 * args.size();
tools/lldb/source/Plugins/ABI/SysV-arc/ABISysV_arc.cpp 241 assert(prototype.getFunctionNumParams() == args.size());
tools/lldb/source/Plugins/ABI/SysV-arm64/ABISysV_arm64.cpp 1698 for (size_t i = 0; i < args.size(); ++i)
1705 if (args.size() > 8)
1708 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/SysV-hexagon/ABISysV_hexagon.cpp 1093 for (size_t i = 0; i < args.size(); i++) {
1120 assert(prototype.getFunctionNumParams() == args.size());
1129 nRegArgs = args.size();
1144 int nSpillArgs = args.size() - nRegArgs;
1152 for (size_t i = nRegArgs, offs = 0; i < args.size(); i++) {
tools/lldb/source/Plugins/ABI/SysV-i386/ABISysV_i386.cpp 233 sp -= 4 * args.size();
tools/lldb/source/Plugins/ABI/SysV-mips/ABISysV_mips.cpp 578 for (size_t i = 0; i < args.size(); ++i)
616 size_t num_stack_regs = args.size();
tools/lldb/source/Plugins/ABI/SysV-mips64/ABISysV_mips64.cpp 575 for (size_t i = 0; i < args.size(); ++i)
587 if (args.size() > 8) // TODO handle more than 8 arguments
590 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/SysV-ppc/ABISysV_ppc.cpp 240 for (size_t i = 0; i < args.size(); ++i)
253 if (args.size() > 8) // TODO handle more than 8 arguments
256 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/SysV-ppc64/ABISysV_ppc64.cpp 91 for (size_t i = 0; i < args.size(); ++i)
104 if (args.size() > 8) // TODO handle more than 8 arguments
107 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/SysV-s390x/ABISysV_s390x.cpp 221 for (size_t i = 0; i < args.size(); ++i)
242 if (args.size() > 5) {
243 sp -= 8 * (args.size() - 5);
251 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/SysV-x86_64/ABISysV_x86_64.cpp 272 for (size_t i = 0; i < args.size(); ++i)
285 if (args.size() > 6) // TODO handle more than 6 arguments
288 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/ABI/Windows-x86_64/ABIWindows_x86_64.cpp 1114 for (size_t i = 0; i < args.size(); ++i)
1127 if (args.size() > 4) // Windows x64 only put first 4 arguments into registers
1130 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Plugins/Language/CPlusPlus/MSVCUndecoratedNameParser.cpp 84 std::size_t count = specs.size();
97 return specs[specs.size() - 1].GetBaseName();
tools/lldb/source/Plugins/Process/Linux/NativeProcessLinux.cpp 1855 buffer = buffer.slice(buffer.size());
1873 buffer = buffer.slice(buffer.size());
tools/lldb/source/Plugins/Process/Linux/ProcessorTrace.cpp 307 uint64_t bytes_remaining = buffer.size();
324 if (head > data_buffer.size()) {
325 head = head % data_buffer.size();
329 bytes_remaining -= buffer.size();
335 buffer = buffer.slice(buffer.size());
355 dst = dst.drop_back(dst.size());
360 dst = dst.drop_back(dst.size());
364 if (src_cyc_index > src.size()) {
365 dst = dst.drop_back(dst.size());
369 if (offset >= src.size()) {
371 dst = dst.drop_back(dst.size());
378 if (offset > parts[0].size()) {
379 parts[1] = parts[1].slice(offset - parts[0].size());
380 parts[0] = parts[0].drop_back(parts[0].size());
381 } else if (offset == parts[0].size()) {
382 parts[0] = parts[0].drop_back(parts[0].size());
387 auto bytes_left = dst.size();
389 size_t chunk_size = std::min(part.size(), bytes_left);
tools/lldb/source/Plugins/Process/elf-core/ProcessElfCore.cpp 163 if (segments.size() == 0) {
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationClient.cpp 3239 payload.PutBytesAsRawHex8(data.data(), data.size(),
3253 payload.PutBytesAsRawHex8(data.data(), data.size(),
3502 json_packet.AddIntegerItem("buffersize", buffer.size());
3519 buffer = buffer.slice(buffer.size());
3525 buffer = buffer.slice(buffer.size());
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteRegisterContext.cpp 110 data.data(), std::min(data.size(), reg_byte_size));
111 bool success = data.size() >= reg_byte_size;
114 } else if (data.size() > 0) {
tools/lldb/source/Plugins/Process/minidump/MinidumpParser.cpp 105 if (location.RVA + location.DataSize > GetData().size())
137 if (context.size() < sizeof(MinidumpContext_x86_32))
229 if (data.size() == 0)
238 if (data.size() == 0)
343 if (loc_desc.RVA + loc_desc.DataSize > GetData().size())
376 if (base_rva + range_size > GetData().size())
406 if (addr < range->start || offset >= range->range_ref.size())
409 const size_t overlap = std::min(size, range->range_ref.size() - offset);
476 regions.reserve(ExpectedMemory->size());
506 regions.reserve(memory64_list.size());
tools/lldb/source/Plugins/Process/minidump/MinidumpTypes.cpp 41 llvm::StringRef(reinterpret_cast<const char *>(data.data()), data.size());
42 data = data.drop_front(data.size());
65 *mem_ranges_count * sizeof(MinidumpMemoryDescriptor64) > data.size())
tools/lldb/source/Plugins/Process/minidump/MinidumpTypes.h 68 if (Buffer.size() < sizeof(T)) {
tools/lldb/source/Plugins/Process/minidump/ProcessMinidump.cpp 321 std::memcpy(buf, mem.data(), mem.size());
322 return mem.size();
453 mod_bytes.take_front(dmp_bytes.size()) == dmp_bytes;
799 DataExtractor data(bytes.data(), bytes.size(), eByteOrderLittle,
802 bytes.size(), 16, 0, 0, 0);
832 if (bytes.size() >= 4) {
833 DataExtractor data(bytes.data(), bytes.size(), eByteOrderLittle,
tools/lldb/source/Plugins/Process/minidump/RegisterContextMinidump_x86_32.cpp 21 memcpy(reg_dest.data(), reg_src, reg_dest.size());
34 if (source_data.size() < sizeof(MinidumpContext_x86_32))
tools/lldb/source/Plugins/Process/minidump/RegisterContextMinidump_x86_64.cpp 44 memcpy(reg_dest.data(), reg_src, reg_dest.size());
57 if (source_data.size() < sizeof(MinidumpContext_x86_64))
tools/lldb/source/Plugins/Process/minidump/ThreadMinidump.cpp 92 DataExtractor data(m_gpregset_data.data(), m_gpregset_data.size(),
99 DataExtractor data(m_gpregset_data.data(), m_gpregset_data.size(),
tools/lldb/source/Plugins/ScriptInterpreter/Python/PythonDataObjects.cpp 264 *this = Take<PythonBytes>(PyBytes_FromStringAndSize(data, bytes.size()));
277 : PythonByteArray(bytes.data(), bytes.size()) {}
310 result->SetValue(std::string(str, bytes.size()));
tools/lldb/source/Plugins/SymbolFile/Breakpad/SymbolFileBreakpad.cpp 159 if (KV.first < all_files.size())
467 row.GetCFAValue().SetIsDWARFExpression(saved.data(), saved.size());
470 loc.SetIsDWARFExpression(saved.data(), saved.size());
598 row_sp->GetCFAValue().SetIsDWARFExpression(saved.data(), saved.size());
622 loc.SetIsDWARFExpression(saved.data(), saved.size());
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbAstBuilder.cpp 1143 arg_types.reserve(arg_indices.size());
tools/lldb/source/Plugins/SymbolFile/NativePDB/PdbUtil.cpp 610 var_id.offset + sym.RecordData.size());
tools/lldb/source/Plugins/SymbolFile/PDB/PDBASTParser.cpp 1036 for (std::size_t i = 0; i < specs.size() - 1; i++) {
tools/lldb/source/Symbol/UnwindPlan.cpp 82 DataExtractor extractor(expr.data(), expr.size(), order_and_width->first,
tools/lldb/source/Target/Process.cpp 2293 WriteMemory(Entry.Dest, Entry.Contents.data(), Entry.Contents.size(),
tools/lldb/source/Utility/Args.cpp 356 for (size_t i = 0; i < args.size(); ++i) {
tools/lldb/source/Utility/StringExtractor.cpp 277 ::memset(dest.data(), fail_fill_value, dest.size());
tools/lldb/unittests/Expression/DWARFExpressionTest.cpp 28 DataExtractor extractor(expr.data(), expr.size(), lldb::eByteOrderLittle,
tools/lldb/unittests/Process/Linux/ProcessorTraceTest.cpp 26 return dst.size();
tools/lldb/unittests/Process/POSIX/NativeProcessELFTest.cpp 38 new DataBufferHeap(auxv_data.size() * addr_size * 2, 0));
tools/lldb/unittests/Process/gdb-remote/GDBRemoteCommunicationClientTest.cpp 441 ASSERT_EQ(buffer.size(), 3u);
453 ASSERT_EQ(buffer2.size(), 0u);
473 ASSERT_EQ(buffer.size(), 3u);
485 ASSERT_EQ(buffer2.size(), 0u);
tools/lldb/unittests/Process/gdb-remote/GDBRemoteCommunicationServerTest.cpp 69 EXPECT_EQ(server.GetPackets().size(), 1UL);
tools/lldb/unittests/Process/minidump/MinidumpParserTest.cpp 52 ASSERT_GT(parser->GetData().size(), 0UL);
112 ASSERT_EQ(1UL, thread_list.size());
119 EXPECT_EQ(7u, context.size());
246 EXPECT_EQ(2u, modules.size());
266 EXPECT_EQ(range_start + range_size, range->start + range->range_ref.size());
tools/lldb/unittests/ScriptInterpreter/Python/PythonDataObjectsTests.cpp 238 EXPECT_EQ(bytes.size(), strlen(test_bytes));
239 EXPECT_EQ(0, ::memcmp(bytes.data(), test_bytes, bytes.size()));
252 EXPECT_EQ(after_bytes.size(), orig_bytes.size());
tools/lldb/unittests/Signals/UnixSignalsTest.cpp 34 ASSERT_EQ(expected.size(), observed.size()) << location;
34 ASSERT_EQ(expected.size(), observed.size()) << location;
36 for (size_t i = 0; i < observed.size(); ++i) {
tools/lldb/unittests/TestingSupport/Host/NativeProcessTestUtils.h 139 size_t Size = std::min(Chunk.size(), Data.size() - (size_t)Addr);
tools/lldb/unittests/Utility/ArgsTest.cpp 215 ASSERT_EQ(2u, ref.size());
tools/lldb/unittests/Utility/CompletionRequestTest.cpp 59 EXPECT_EQ(1U, result.GetResults().size());
72 EXPECT_EQ(0U, result.GetResults().size());
82 EXPECT_EQ(1U, result.GetResults().size());
tools/lldb/unittests/Utility/OptionsWithRawTest.cpp 66 ASSERT_EQ(1u, ref.size());
81 ASSERT_EQ(1u, ref.size());
95 ASSERT_EQ(1u, ref.size());
109 ASSERT_EQ(1u, ref.size());
123 ASSERT_EQ(1u, ref.size());
137 ASSERT_EQ(1u, ref.size());
151 ASSERT_EQ(1u, ref.size());
165 ASSERT_EQ(1u, ref.size());
179 ASSERT_EQ(0u, ref.size());
tools/lldb/unittests/tools/lldb-server/tests/TestClient.cpp 135 for (size_t i = 0; i < inferior_args.size(); i++) {
tools/llvm-cfi-verify/lib/FileAnalysis.cpp 478 for (uint64_t Byte = 0; Byte < SectionBytes.size();) {
tools/llvm-cov/CoverageExporterJson.cpp 158 unsigned(SourceFiles.size())));
164 for (unsigned I = 0, E = SourceFiles.size(); I < E; ++I) {
tools/llvm-cov/CoverageExporterLcov.cpp 103 for (unsigned I = 0, E = SourceFiles.size(); I < E; ++I)
tools/llvm-cov/CoverageReport.cpp 129 for (unsigned I = 1, E = Paths.size(); NumRedundant > 0 && I < E; ++I) {
154 if (Paths.size() <= 1)
361 unsigned(Files.size())));
366 FileReports.reserve(Files.size());
tools/llvm-cov/SourceCoverageView.cpp 125 for (unsigned I = 0, E = Segments.size() - 1; I < E; ++I) {
tools/llvm-cov/SourceCoverageViewHTML.cpp 516 for (unsigned I = 1, E = Segments.size(); I < E; ++I)
550 for (unsigned I = 0, E = Segments.size(); I < E; ++I) {
583 for (unsigned I = 0, E = Segments.size() - 1; I < E; ++I) {
tools/llvm-cov/SourceCoverageViewText.cpp 181 if (Segments.size() > 1)
tools/llvm-dwp/llvm-dwp.cpp 334 for (size_t i = 0; i != ContributionOffsets.size(); ++i)
531 Objects.reserve(Inputs.size());
tools/llvm-exegesis/lib/Clustering.cpp 219 CurrentCluster.PointIndices.reserve(PointsOfOpcode.size());
222 assert(CurrentCluster.PointIndices.size() == PointsOfOpcode.size());
346 Representative.resize(Point.size());
347 assert(Representative.size() == Point.size() &&
tools/llvm-exegesis/lib/SchedClassResolution.cpp 260 const size_t NumMeasurements = Representative.size();
tools/llvm-exegesis/lib/SnippetRepetitor.cpp 34 for (unsigned I = Instructions.size(); I < MinInstructions; ++I) {
35 Entry.addInstruction(Instructions[I % Instructions.size()]);
65 const APInt LoopCount(32, (MinInstructions + Instructions.size() - 1) /
66 Instructions.size());
tools/llvm-exegesis/lib/Uops.cpp 136 SmallVector<int, 2> Iterators(TiedVariables.size(), 0);
141 for (size_t VarId = 0; VarId < TiedVariables.size(); ++VarId) {
tools/llvm-lipo/llvm-lipo.cpp 466 assert(InputBinaries.size() == 1 && "Incorrect number of input binaries");
518 assert(InputBinaries.size() == 1 && "Incorrect number of input binaries");
550 assert(InputBinaries.size() == 1 && "Incorrect number of input binaries");
656 sizeof(MachO::fat_header) + Slices.size() * sizeof(MachO::fat_arch);
729 assert(InputBinaries.size() >= 1 && "Incorrect number of input binaries");
773 assert(InputBinaries.size() == 1 && "Incorrect number of input binaries");
tools/llvm-lto/llvm-lto.cpp 342 Refs += Summary->refs().size();
345 Calls += FuncSummary->calls().size();
tools/llvm-mca/Views/BottleneckAnalysis.cpp 319 unsigned FromIID = FirstEdge.FromIID % Source.size();
320 unsigned ToIID = FirstEdge.ToIID % Source.size();
349 ToIID = DE->ToIID % Source.size();
350 unsigned LastIID = CurrentIID > ToIID ? Source.size() : ToIID;
398 while (CurrentIID < Source.size()) {
454 : STI(sti), MCIP(Printer), Tracker(STI.getSchedModel()), DG(S.size() * 3),
464 unsigned SourceSize = Source.size();
476 unsigned SourceSize = Source.size();
488 unsigned SourceSize = Source.size();
512 unsigned To = IID % Source.size();
521 addResourceDep(U.first % Source.size(), To, Current, U.second + Cycles);
529 unsigned From = RegDep.IID % Source.size();
536 unsigned From = MemDep.IID % Source.size();
544 if (IID == ((Iterations * Source.size()) - 1))
621 for (unsigned I = 0, E = Distribution.size(); I < E; ++I) {
tools/llvm-mca/Views/InstructionInfoView.cpp 39 for (unsigned I = 0, E = Source.size(); I < E; ++I) {
tools/llvm-mca/Views/RegisterFileStatistics.cpp 63 assert(Inst.getDefs().size() == 1 && "Expected a single definition!");
64 assert(Inst.getUses().size() == 1 && "Expected a single register use!");
tools/llvm-mca/Views/ResourcePressureView.cpp 40 ResourceUsage.resize(NumResourceUnits * (Source.size() + 1));
55 const unsigned SourceIdx = Event.IR.getSourceIndex() % Source.size();
63 ResourceUsage[R2VIndex + NumResourceUnits * Source.size()] += Use.second;
135 const unsigned Executions = LastInstructionIdx / Source.size() + 1;
137 double Usage = ResourceUsage[I + Source.size() * E];
158 const unsigned Executions = LastInstructionIdx / Source.size() + 1;
tools/llvm-mca/Views/SummaryView.cpp 47 Event.IR.getSourceIndex() >= Source.size())
66 unsigned Instructions = Source.size();
tools/llvm-mca/Views/TimelineView.cpp 24 MaxCycle(Cycles == 0 ? 80 : Cycles), LastCycle(0), WaitTime(S.size()),
25 UsedBuffer(S.size()) {
26 unsigned NumInstructions = Source.size();
43 if (IR.getSourceIndex() >= Source.size())
73 WaitTimeEntry &WTEntry = WaitTime[Index % Source.size()];
136 bool PrintingTotals = SourceIndex == Source.size();
190 unsigned Executions = Timeline.size() / Source.size();
210 if (Source.size() != 1) {
300 const unsigned Iterations = Timeline.size() / Source.size();
307 unsigned SourceIndex = IID % Source.size();
tools/llvm-objcopy/COFF/COFFObjcopy.cpp 68 Sec.Header.VirtualSize = NeedVA ? Sec.getContents().size() : 0u;
73 : Sec.getContents().size();
tools/llvm-objcopy/COFF/Object.h 71 assert(In.size() == sizeof(Opaque));
tools/llvm-objcopy/COFF/Reader.cpp 109 assert(AuxData.size() == SymSize * SymRef.getNumberOfAuxSymbols());
118 AuxData.size())
129 Sections.size())
140 if (Index <= 0 || static_cast<uint32_t>(Index - 1) >= Sections.size())
tools/llvm-objcopy/COFF/Writer.cpp 174 sizeof(Obj.DosHeader) + Obj.DosStub.size();
184 Obj.CoffFileHeader.NumberOfSections = Obj.getSections().size();
187 SizeOfHeaders += sizeof(coff_section) * Obj.getSections().size();
240 memcpy(Ptr, Obj.DosStub.data(), Obj.DosStub.size());
241 Ptr += Obj.DosStub.size();
265 BigObjHeader.NumberOfSections = Obj.getSections().size();
305 S.Header.SizeOfRawData > Contents.size())
306 memset(Ptr + Contents.size(), 0xcc,
307 S.Header.SizeOfRawData - Contents.size());
407 bool IsBigObj = Obj.getSections().size() > MaxNumberOfSections16;
tools/llvm-objcopy/ELF/ELFObjcopy.cpp 293 FileOutputBuffer::create(Filename, Sec.OriginalData.size());
786 if (BuildIdBytes.size() < 2)
tools/llvm-objcopy/ELF/Object.cpp 191 IHexLineData Line(getLineLength(Data.size()));
195 Iter = utohexstr(Data.size(), Iter, 2);
310 assert(Data.size() == Sec->Size);
314 uint64_t DataSize = std::min<uint64_t>(Data.size(), ChunkSize);
354 Offset += IHexRecord::getLineLength(Data.size());
403 return Data.size() > ZlibGnuMagic.size() &&
431 Sec.OriginalData.size() - DataOffset);
506 DecompressedSize(Sec.OriginalData.size()), DecompressedAlign(Sec.Align) {
509 OriginalData.size()),
1154 DataSection.Size = Data.size();
1342 if (GroupSec->Contents.size() % sizeof(ELF::Elf32_Word) ||
1348 Word + GroupSec->Contents.size() / sizeof(ELF::Elf32_Word);
1378 if (ShndxData.size() != Symbols.size())
1378 if (ShndxData.size() != Symbols.size())
1427 if (Index == SHN_UNDEF || Index > Sections.size())
1789 assert(Seg.FileSize == Seg.getContents().size() &&
tools/llvm-objcopy/ELF/Object.h 61 iterator end() const { return iterator(Sections.data() + Sections.size()); }
62 size_t size() const { return Sections.size(); }
494 Size = Data.size();
tools/llvm-objcopy/MachO/MachOLayoutBuilder.cpp 223 uint64_t StartOfBindingInfo = StartOfRebaseInfo + O.Rebases.Opcodes.size();
224 uint64_t StartOfWeakBindingInfo = StartOfBindingInfo + O.Binds.Opcodes.size();
226 StartOfWeakBindingInfo + O.WeakBinds.Opcodes.size();
228 StartOfLazyBindingInfo + O.LazyBinds.Opcodes.size();
229 uint64_t StartOfFunctionStarts = StartOfExportTrie + O.Exports.Trie.size();
231 StartOfFunctionStarts + O.FunctionStarts.Data.size();
232 uint64_t StartOfSymbols = StartOfDataInCode + O.DataInCode.Data.size();
291 MLC.linkedit_data_command_data.datasize = O.DataInCode.Data.size();
295 MLC.linkedit_data_command_data.datasize = O.FunctionStarts.Data.size();
301 MLC.dyld_info_command_data.rebase_size = O.Rebases.Opcodes.size();
304 MLC.dyld_info_command_data.bind_size = O.Binds.Opcodes.size();
307 MLC.dyld_info_command_data.weak_bind_size = O.WeakBinds.Opcodes.size();
310 MLC.dyld_info_command_data.lazy_bind_size = O.LazyBinds.Opcodes.size();
313 MLC.dyld_info_command_data.export_size = O.Exports.Trie.size();
tools/llvm-objcopy/MachO/MachOReader.cpp 94 StringRef(reinterpret_cast<const char *>(E->data()), E->size());
tools/llvm-objcopy/MachO/MachOWriter.cpp 54 assert((DyLdInfoCommand.rebase_size == O.Rebases.Opcodes.size()) &&
59 assert((DyLdInfoCommand.bind_size == O.Binds.Opcodes.size()) &&
64 assert((DyLdInfoCommand.weak_bind_size == O.WeakBinds.Opcodes.size()) &&
70 assert((DyLdInfoCommand.lazy_bind_size == O.LazyBinds.Opcodes.size()) &&
76 assert((DyLdInfoCommand.export_size == O.Exports.Trie.size()) &&
190 assert(sizeof(MachO::load_command) + LC.Payload.size() ==
196 memcpy(Begin, LC.Payload.data(), LC.Payload.size());
197 Begin += LC.Payload.size();
311 assert((DyLdInfoCommand.rebase_size == O.Rebases.Opcodes.size()) &&
313 memcpy(Out, O.Rebases.Opcodes.data(), O.Rebases.Opcodes.size());
323 assert((DyLdInfoCommand.bind_size == O.Binds.Opcodes.size()) &&
325 memcpy(Out, O.Binds.Opcodes.data(), O.Binds.Opcodes.size());
335 assert((DyLdInfoCommand.weak_bind_size == O.WeakBinds.Opcodes.size()) &&
337 memcpy(Out, O.WeakBinds.Opcodes.data(), O.WeakBinds.Opcodes.size());
347 assert((DyLdInfoCommand.lazy_bind_size == O.LazyBinds.Opcodes.size()) &&
349 memcpy(Out, O.LazyBinds.Opcodes.data(), O.LazyBinds.Opcodes.size());
359 assert((DyLdInfoCommand.export_size == O.Exports.Trie.size()) &&
361 memcpy(Out, O.Exports.Trie.data(), O.Exports.Trie.size());
386 assert((LinkEditDataCommand.datasize == O.DataInCode.Data.size()) &&
388 memcpy(Out, O.DataInCode.Data.data(), O.DataInCode.Data.size());
398 assert((LinkEditDataCommand.datasize == O.FunctionStarts.Data.size()) &&
400 memcpy(Out, O.FunctionStarts.Data.data(), O.FunctionStarts.Data.size());
tools/llvm-objdump/COFFDump.cpp 94 assert(UCs.size() >= getNumUsedSlots(UCs[0]));
144 if (UsedSlots > UCs.size()) {
148 << " slots, but only " << UCs.size()
470 NumRFs = Contents.size() / sizeof(RuntimeFunction);
591 if (UnwindInfoOffset > XContents.size())
tools/llvm-objdump/llvm-objdump.cpp 821 if (Bytes.size() >= 4) {
827 for (unsigned int i = 1; i < Bytes.size(); i++)
829 OS.indent(55 - (6 * Bytes.size()));
834 if (Bytes.size() >= 4) {
839 Bytes.size() / 4))
980 while (N < Buf.size() && !Buf[N])
tools/llvm-pdbutil/DumpOutputStyle.cpp 550 if (SC.ISect > 0 && SC.ISect <= SectionNames.size()) {
1348 TiList.size(), DepSet.size());
1356 Printer.formatLine("Showing {0:N} records.", TiList.size());
tools/llvm-pdbutil/FormatUtil.cpp 80 Opts = Opts.drop_front(ThisGroup.size());
tools/llvm-pdbutil/PrettyClassDefinitionDumper.cpp 64 uint32_t BaseCount = Layout.bases().size();
tools/llvm-pdbutil/TypeReferenceTracker.cpp 116 ByteSlice.size() / 4);
tools/llvm-rc/ResourceFileWriter.cpp 364 FS->write((const char *)Data.begin(), Data.size());
tools/llvm-rc/ResourceScriptParser.cpp 324 assert(FlagDesc.size() == FlagValues.size());
324 assert(FlagDesc.size() == FlagValues.size());
332 for (size_t FlagId = 0; FlagId < FlagDesc.size(); ++FlagId) {
tools/llvm-readobj/ARMWinEHPrinter.cpp 785 for (unsigned OI = Offset, OE = Opcodes.size(); !Terminated && OI < OE; ) {
825 if (Contents.size() - Offset < 8)
843 if ((int64_t)(Contents.size() - Offset - 4 * HeaderWords(XData) -
1086 if (Contents.size() % PDataEntrySize) {
1091 for (unsigned EI = 0, EE = Contents.size() / PDataEntrySize; EI < EE; ++EI)
tools/llvm-readobj/COFFDumper.cpp 219 Block.size());
1196 W.printHex("ChecksumSize", FC.Checksum.size());
1829 EndianCorrectedNameString.resize(RawEntryNameString.size() + 1);
tools/llvm-readobj/DwarfCFIEHPrinter.h 192 Contents.size()),
tools/llvm-readobj/ELFDumper.cpp 286 while (Size < Table.size())
2273 if (Contents.size() == 1)
2355 Content.size() / sizeof(Entry));
2356 LocalNum = GotEntries.size();
2395 size_t DynSymTotal = DynSyms.size();
2413 Content.size() / sizeof(Entry));
2437 PltContent.size() / sizeof(Entry));
2486 size_t OtherNum = GotEntries.size() - LocalNum - GlobalNum;
2520 return PltEntries.size() < 2 ? nullptr : &PltEntries[1];
2526 if (PltEntries.size() <= 2)
2528 return PltEntries.slice(2, PltEntries.size() - 2);
2645 if (Sec.size() != sizeof(Elf_Mips_RegInfo<ELFT>)) {
2669 if (Sec.size() < sizeof(Elf_Mips_Options<ELFT>)) {
3195 OS << "There are " << to_string(Sections.size())
3458 if ((GnuHash->values(DynSyms.size())[GnuHashable++] & 1) == 1)
3677 << " contains " << Table.size() << " entries:\n";
4013 unsigned NumSyms = this->dumper()->dynamic_symbols().size();
4032 C < Chains.size() && (Chains[C] & 1) == 0; C++)
4379 while (Arr.size() >= 8) {
4388 if (Arr.size() < PaddedSize) {
4416 if (Words.size() < 4)
4441 return StringRef(reinterpret_cast<const char *>(Desc.data()), Desc.size());
4487 std::string(reinterpret_cast<const char *>(Desc.data()), Desc.size())};
4491 std::string(reinterpret_cast<const char *>(Desc.data()), Desc.size())};
4507 StringRef(reinterpret_cast<const char *>(Desc.data()), Desc.size());
4613 << format_hex(Descriptor.size(), 10) << '\t';
4847 while (Offset < Contents.size()) {
5057 << Parser.getOtherEntries().size() << "\n";
5116 if (Sec.size() != sizeof(Elf_Mips_ABIFlags<ELFT>))
5424 StringRef(reinterpret_cast<const char *>(Data.data()), Data.size()));
5502 W.startLine() << "DynamicSection [ (" << Table.size() << " entries)\n";
5858 W.printHex("Data size", Descriptor.size());
6034 uint64_t(Parser.getOtherEntries().size()));
6095 if (Sec.size() != sizeof(Elf_Mips_ABIFlags<ELFT>)) {
tools/llvm-readobj/WasmDumper.cpp 171 W.printNumber("Size", static_cast<uint64_t>(WasmSec.Content.size()));
192 W.printNumber("Size", static_cast<uint64_t>(Seg.Content.size()));
tools/llvm-readobj/Win64EHDumper.cpp 50 if (UC.size() < 3)
180 assert(UC.size() >= getNumUsedSlots(UC[0]));
257 if (UsedSlots > UC.size()) {
299 if (Offset > Contents.size())
327 const size_t Count = Contents.size() / sizeof(RuntimeFunction);
tools/llvm-readobj/WindowsResourceDumper.cpp 25 Result.reserve(UTF16Str.size());
78 SW.printNumber("Data size", (uint64_t)Ref.getData().size());
tools/llvm-xray/xray-color-helper.cpp 190 size_t MaxIndex = ColorMap.size() - 1;
tools/lto/lto.cpp 658 *size = symbols.size();
tools/obj2yaml/elf2yaml.cpp 170 SectionNames.resize(Sections.size());
363 SymbolNames.resize(SymTable.size());
526 while (Cur && Cur.tell() < Content.size()) {
558 while (Cur && Cur.tell() < Content.size()) {
702 if (Content.size() < sizeof(Elf_Nhdr)) {
708 if (Content.size() < Header->getSize()) {
736 if (Content.size() % 4 != 0 || Content.size() < 8) {
736 if (Content.size() % 4 != 0 || Content.size() < 8) {
745 if (Content.size() != (2 + NBucket + NChain) * 4) {
tools/obj2yaml/wasm2yaml.cpp 355 DataCountSec->Count = Obj.dataSegments().size();
tools/polly/lib/Analysis/ScopInfo.cpp 323 int SharedDims = std::min(NewSizes.size(), DimensionSizes.size());
324 int ExtraDimsNew = NewSizes.size() - SharedDims;
335 if (DimensionSizes.size() >= NewSizes.size())
tools/polly/lib/CodeGen/BlockGenerators.cpp 775 assert(MA->getIncoming().size() >= 1 &&
1639 PHINode *NewPHI = PHINode::Create(OrigPHI->getType(), Incoming.size(),
1675 if (Incoming.size() == 1) {
tools/polly/lib/Transform/DeLICM.cpp 814 if (Incoming.size() == 1) {
tools/polly/lib/Transform/ScheduleOptimizer.cpp 442 auto tileSize = i < TileSizes.size() ? TileSizes[i] : DefaultTileSize;
tools/polly/lib/Transform/ScheduleTreeTransform.cpp 451 assert(Pos == ASTBuildOptions.size() &&
tools/polly/lib/Transform/ZoneAlgo.cpp 912 if (Incoming->getIncoming().size() != 1)
1039 assert(Incoming.size() == 1 && "The incoming value must be "
unittests/ADT/ArrayRefTest.cpp 84 EXPECT_EQ(1U, AR.drop_back(AR.size() - 1).size());
84 EXPECT_EQ(1U, AR.drop_back(AR.size() - 1).size());
87 EXPECT_EQ(1U, AR.drop_front(AR.size() - 1).size());
87 EXPECT_EQ(1U, AR.drop_front(AR.size() - 1).size());
90 EXPECT_EQ(1U, AR.slice(AR.size() - 1).size());
90 EXPECT_EQ(1U, AR.slice(AR.size() - 1).size());
91 EXPECT_EQ(AR.size() - 1, AR.slice(1, AR.size() - 1).size());
91 EXPECT_EQ(AR.size() - 1, AR.slice(1, AR.size() - 1).size());
91 EXPECT_EQ(AR.size() - 1, AR.slice(1, AR.size() - 1).size());
97 ArrayRef<int> AR2(TheNumbers, AR1.size() - 1);
104 ArrayRef<int> AR2(&TheNumbers[2], AR1.size() - 2);
205 EXPECT_EQ(2U, A.size());
259 EXPECT_EQ(A1.size(), A2.size());
unittests/ADT/TinyPtrVectorTest.cpp 61 for (size_t i = 0, e = Values.size(); i != e; ++i)
74 EXPECT_EQ(Values.size(), V.size());
75 for (size_t i = 0, e = Values.size(); i != e; ++i) {
79 EXPECT_EQ(V.end(), std::next(V.begin(), Values.size()));
unittests/Analysis/LazyCallGraphTest.cpp 1290 ASSERT_EQ(1u, MergedCs.size());
1687 ASSERT_EQ(1u, MergedCs.size());
1935 ASSERT_EQ(2u, MergedCs.size());
unittests/CodeGen/MachineInstrTest.cpp 397 ASSERT_TRUE(MI->memoperands().size() == 1);
403 ASSERT_TRUE(MI->memoperands().size() == 1);
409 ASSERT_TRUE(MI->memoperands().size() == 1);
415 ASSERT_TRUE(MI->memoperands().size() == 1);
445 ASSERT_TRUE(MI->memoperands().size() == 2);
451 ASSERT_TRUE(MI->memoperands().size() == 2);
480 ASSERT_TRUE(MI->memoperands().size() == 2);
486 ASSERT_TRUE(MI->memoperands().size() == 2);
492 ASSERT_TRUE(MI->memoperands().size() == 2);
unittests/DebugInfo/CodeView/TypeHashingTest.cpp 54 for (size_t I = 0; I < Hashes.size() - 1; ++I) {
55 for (size_t J = I + 1; J < Hashes.size(); ++J) {
unittests/DebugInfo/CodeView/TypeIndexDiscoveryTest.cpp 68 ASSERT_EQ(sizeof...(T), TTB->records().size());
124 Refs.resize(TTB->records().size());
125 for (uint32_t I = 0; I < TTB->records().size(); ++I) {
unittests/DebugInfo/DWARF/DWARFDebugInfoTest.cpp 255 EXPECT_EQ(ExtractedBlockData.size(), BlockSize);
263 EXPECT_EQ(ExtractedBlockData.size(), BlockSize);
271 EXPECT_EQ(ExtractedBlockData.size(), BlockSize);
279 EXPECT_EQ(ExtractedBlockData.size(), BlockSize);
289 EXPECT_EQ(ExtractedBlockData.size(), 16u);
unittests/DebugInfo/DWARF/DWARFDebugLineTest.cpp 100 ASSERT_LT(WhichMsg, ExpectedMsgs.size());
105 EXPECT_EQ(WhichMsg, ExpectedMsgs.size());
unittests/DebugInfo/GSYM/GSYMTest.cpp 35 ASSERT_LT(WhichMsg, ExpectedMsgs.size());
40 EXPECT_EQ(WhichMsg, ExpectedMsgs.size());
1139 EXPECT_EQ(Hdr.UUIDSize, UUID.size());
unittests/DebugInfo/MSF/MSFBuilderTest.cpp 119 EXPECT_EQ(1U, OldDirBlocks.size());
129 EXPECT_EQ(1U, Blocks.size());
135 EXPECT_EQ(1U, NewDirBlocks.size());
155 EXPECT_EQ(2U, DirBlocks.size());
168 EXPECT_EQ(1U, OldStreamBlocks.size());
173 EXPECT_EQ(1U, NewStreamBlocks.size());
297 EXPECT_EQ(1U, L.DirectoryBlocks.size());
300 EXPECT_EQ(3U, L.StreamSizes.size());
304 EXPECT_EQ(ExpectedNumBlocks, L.StreamMap[I].size());
322 EXPECT_EQ(1U, L.DirectoryBlocks.size());
323 EXPECT_EQ(1U, L.StreamMap[0].size());
343 EXPECT_EQ(2U, L.DirectoryBlocks.size());
361 EXPECT_EQ(1U, L.DirectoryBlocks.size());
unittests/DebugInfo/MSF/MappedBlockStreamTest.cpp 55 uint32_t getLength() override { return Data.size(); }
58 if (auto EC = checkOffsetForWrite(Offset, SrcData.size()))
60 ::memcpy(&Data[Offset], SrcData.data(), SrcData.size());
66 return MSFStreamLayout{static_cast<uint32_t>(Data.size()), Blocks};
387 EXPECT_THAT_ERROR(Reader.readArray(byteArray[1], byteArray[0].size()),
397 EXPECT_THAT_ERROR(Reader.readArray(intArray[1], intArray[0].size()),
unittests/Object/MinidumpTest.cpp 49 ASSERT_EQ(1u, File.streams().size());
200 ASSERT_EQ(2u, File.streams().size());
352 ASSERT_EQ(1u, ExpectedModule->size());
452 ASSERT_EQ(1u, ExpectedThread->size());
507 ASSERT_EQ(1u, ExpectedRanges->size());
unittests/ObjectYAML/MinidumpYAMLTest.cpp 50 ASSERT_EQ(3u, File.streams().size());
104 ASSERT_EQ(1u, File.streams().size());
131 ASSERT_EQ(1u, File.streams().size());
163 ASSERT_EQ(1u, File.streams().size());
206 ASSERT_EQ(1u, File.streams().size());
262 ASSERT_EQ(1u, File.streams().size());
313 ASSERT_EQ(1u, File.streams().size());
unittests/ProfileData/CoverageMappingTest.cpp 272 size_t N = makeArrayRef(Input.Regions).size();
unittests/Support/BinaryStreamTest.cpp 29 : Data(Data), PartitionIndex(alignDown(Data.size() / 2, Align)),
40 if (Ref.size() >= Size) {
45 uint32_t BytesLeft = Size - Ref.size();
47 ::memcpy(Ptr, Ref.data(), Ref.size());
48 ::memcpy(Ptr + Ref.size(), Data.data(), BytesLeft);
62 uint32_t getLength() override { return Data.size(); }
65 if (auto EC = checkOffsetForWrite(Offset, SrcData.size()))
73 if (Ref.size() >= SrcData.size()) {
73 if (Ref.size() >= SrcData.size()) {
74 ::memcpy(Ref.data(), SrcData.data(), SrcData.size());
78 uint32_t BytesLeft = SrcData.size() - Ref.size();
78 uint32_t BytesLeft = SrcData.size() - Ref.size();
79 ::memcpy(Ref.data(), SrcData.data(), Ref.size());
80 ::memcpy(&Data[0], SrcData.data() + Ref.size(), BytesLeft);
87 return (Offset + PartitionIndex) % Data.size();
91 return (startIndex(Offset) + Size - 1) % Data.size();
376 ASSERT_EQ(ExpectedSize, Data.size());
482 StringRef(reinterpret_cast<const char *>(Bytes.data()), Bytes.size());
863 return Item.Bytes.size();
unittests/Transforms/Utils/ASanStackFrameLayoutTest.cpp 18 for (size_t i = 0, n = ShadowBytes.size(); i < n; i++) {
utils/TableGen/AsmWriterEmitter.cpp 290 std::vector<uint64_t> OpcodeInfo(NumberedInstructions.size());
401 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
1142 for (unsigned i = 0, e = NumberedInstructions.size(); i != e; ++i) {
utils/TableGen/CodeGenDAGPatterns.cpp 3951 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
3965 for (unsigned i = 0, e = Instructions.size(); i != e; ++i) {
utils/TableGen/CodeGenMapTable.cpp 377 unsigned TotalNumInstr = NumberedInstructions.size();
utils/TableGen/CodeGenRegisters.cpp 683 for (unsigned i = 0, e = Proto->getValues().size(); i != e; ++i) {
2390 for (unsigned i = 0, e = Regs.size(); i != e; ++i) {
utils/TableGen/CodeGenSchedule.cpp 848 if (Seq.size() == 1)
1076 if (OrigNumInstrs == InstDefs.size()) {
utils/TableGen/DAGISelMatcherEmitter.cpp 207 if (Locs.size() > 1) {
210 } else if (Locs.size() == 1) {
utils/TableGen/DisassemblerEmitter.cpp 116 for (unsigned i = 0, e = numberedInstructions.size(); i != e; ++i)
utils/TableGen/FixedLenDecoderEmitter.cpp 2390 NumberedEncodings.reserve(NumberedInstructions.size());
2455 if (i < NumberedInstructions.size())
utils/TableGen/GlobalISel/CodeExpander.cpp 63 Loc.size() > 0 && Loc[0].isValid()
72 PrintError(Loc.size() > 0 && Loc[0].isValid()
86 PrintWarning(Loc.size() > 0 && Loc[0].isValid()
utils/TableGen/GlobalISelEmitter.cpp 3804 if (ChildTypes.size() != 1)
3982 if (ChildTypes.size() != 1)
4020 if (ChildTypes.size() != 1)
utils/TableGen/InstrInfoEmitter.cpp 588 << NumberedInstructions.size() << ");\n}\n\n";
633 << NumberedInstructions.size() << ");\n}\n";
utils/TableGen/RegisterInfoEmitter.cpp 293 PSets[i].reserve(PSetIDs.size());
1021 assert(Roots.size() <= 2 && "More than two roots not supported yet.");
1023 for (unsigned r = 1; r != Roots.size(); ++r)
1079 << RC.getOrder().size() << ", sizeof(" << RC.getName() << "Bits), "
1375 for (unsigned elem = 0; elem != Elems.size(); ++elem)
utils/TableGen/SearchableTableEmitter.cpp 364 for (unsigned i = 0; i < IndexRows.size(); ++i) {
724 if (Class->getSuperClasses().size() != 1 ||
utils/TableGen/WebAssemblyDisassemblerEmitter.cpp 31 for (unsigned I = 0; I != NumberedInstructions.size(); ++I) {
utils/unittest/googlemock/include/gmock/gmock-matchers.h 2432 SizeType size = container.size();