|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
gen/lib/Target/AArch64/AArch64GenAsmMatcher.inc27409 if (Operands.size() > 11) {
27461 if (ActualIdx < Operands.size())
27466 if (ActualIdx >= Operands.size()) {
40861 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/AArch64/AArch64GenDAGISel.inc115490 unsigned NextRes = Result.size();
gen/lib/Target/AMDGPU/AMDGPUGenAsmMatcher.inc23927 if (Operands.size() > 28) {
23987 if (ActualIdx < Operands.size())
23992 if (ActualIdx >= Operands.size()) {
80413 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/AMDGPU/AMDGPUGenDAGISel.inc79668 unsigned NextRes = Result.size();
gen/lib/Target/AMDGPU/R600GenDAGISel.inc12589 unsigned NextRes = Result.size();
gen/lib/Target/ARC/ARCGenDAGISel.inc 1225 unsigned NextRes = Result.size();
gen/lib/Target/ARM/ARMGenAsmMatcher.inc15124 if (ActualIdx < Operands.size())
15129 if (ActualIdx >= Operands.size()) {
16347 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/ARM/ARMGenDAGISel.inc54875 unsigned NextRes = Result.size();
gen/lib/Target/AVR/AVRGenAsmMatcher.inc 1263 if (Operands.size() > 4) {
1314 if (ActualIdx < Operands.size())
1319 if (ActualIdx >= Operands.size()) {
1506 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/AVR/AVRGenDAGISel.inc 1730 unsigned NextRes = Result.size();
gen/lib/Target/BPF/BPFGenAsmMatcher.inc 903 if (Operands.size() > 13) {
957 if (ActualIdx < Operands.size())
962 if (ActualIdx >= Operands.size()) {
gen/lib/Target/BPF/BPFGenDAGISel.inc 2110 unsigned NextRes = Result.size();
gen/lib/Target/Hexagon/HexagonGenAsmMatcher.inc10249 if (Operands.size() > 24) {
10303 if (ActualIdx < Operands.size())
10308 if (ActualIdx >= Operands.size()) {
gen/lib/Target/Hexagon/HexagonGenDAGISel.inc72907 unsigned NextRes = Result.size();
gen/lib/Target/Lanai/LanaiGenAsmMatcher.inc 1047 if (Operands.size() > 8) {
1098 if (ActualIdx < Operands.size())
1103 if (ActualIdx >= Operands.size()) {
1314 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/Lanai/LanaiGenDAGISel.inc 1518 unsigned NextRes = Result.size();
gen/lib/Target/MSP430/MSP430GenAsmMatcher.inc 1105 if (Operands.size() > 3) {
1156 if (ActualIdx < Operands.size())
1161 if (ActualIdx >= Operands.size()) {
gen/lib/Target/MSP430/MSP430GenDAGISel.inc 4891 unsigned NextRes = Result.size();
gen/lib/Target/Mips/MipsGenAsmMatcher.inc 8081 if (Operands.size() > 9) {
8132 if (ActualIdx < Operands.size())
8137 if (ActualIdx >= Operands.size()) {
11686 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/Mips/MipsGenDAGISel.inc30485 unsigned NextRes = Result.size();
gen/lib/Target/NVPTX/NVPTXGenDAGISel.inc72325 unsigned NextRes = Result.size();
gen/lib/Target/PowerPC/PPCGenAsmMatcher.inc 7007 if (Operands.size() > 7) {
7061 if (ActualIdx < Operands.size())
7066 if (ActualIdx >= Operands.size()) {
gen/lib/Target/PowerPC/PPCGenDAGISel.inc44833 unsigned NextRes = Result.size();
gen/lib/Target/RISCV/RISCVGenAsmMatcher.inc 2396 if (Operands.size() > 6) {
2450 if (ActualIdx < Operands.size())
2455 if (ActualIdx >= Operands.size()) {
2783 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/RISCV/RISCVGenDAGISel.inc14165 unsigned NextRes = Result.size();
gen/lib/Target/Sparc/SparcGenAsmMatcher.inc 4140 if (Operands.size() > 7) {
4194 if (ActualIdx < Operands.size())
4199 if (ActualIdx >= Operands.size()) {
4491 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/Sparc/SparcGenDAGISel.inc 3608 unsigned NextRes = Result.size();
gen/lib/Target/SystemZ/SystemZGenAsmMatcher.inc 5338 if (Operands.size() > 7) {
5389 if (ActualIdx < Operands.size())
5394 if (ActualIdx >= Operands.size()) {
9209 unsigned NextOpNum = Operands.size() - 1;
gen/lib/Target/SystemZ/SystemZGenDAGISel.inc30441 unsigned NextRes = Result.size();
gen/lib/Target/WebAssembly/WebAssemblyGenAsmMatcher.inc 1107 if (Operands.size() > 17) {
1158 if (ActualIdx < Operands.size())
1163 if (ActualIdx >= Operands.size()) {
gen/lib/Target/X86/X86GenAsmMatcher.inc36934 if (Operands.size() > 10) {
36989 if (ActualIdx < Operands.size())
36994 if (ActualIdx >= Operands.size()) {
gen/lib/Target/X86/X86GenDAGISel.inc254673 unsigned NextRes = Result.size();
gen/lib/Target/XCore/XCoreGenDAGISel.inc 2452 unsigned NextRes = Result.size();
gen/tools/clang/lib/Sema/OpenCLBuiltins.inc16873 for (unsigned I = 0; I < QT.size(); I++) {
16884 for (unsigned Index = 0; Index < QT.size(); Index++) {
16890 for (unsigned Index = 0; Index < QT.size(); Index++) {
16896 for (unsigned Index = 0; Index < QT.size(); Index++) {
16905 for (unsigned Index = 0; Index < QT.size(); Index++) {
include/llvm/ADT/ArrayRef.h 82 : Data(Vec.data()), Length(Vec.size()) {
121 : Data(Vec.data()), Length(Vec.size()) {
include/llvm/ADT/DirectedGraph.h 194 size_t size() const { return Nodes.size(); }
include/llvm/ADT/ImmutableSet.h 679 return stack.size() == 1 && getVisitState() == VisitedNone;
include/llvm/ADT/IndexedMap.h 46 assert(toIndex_(n) < storage_.size() && "index out of bounds!");
51 assert(toIndex_(n) < storage_.size() && "index out of bounds!");
69 if (NewSize > storage_.size())
74 return toIndex_(n) < storage_.size();
78 return storage_.size();
include/llvm/ADT/IntervalMap.h 816 unsigned height() const { return path.size() - 1; }
898 for (unsigned i = 0, e = path.size(); i != e; ++i)
1258 for (unsigned i = 0, e = Refs.size(); i != e; ++i) {
1268 for (unsigned i = 0, e = Refs.size(); i != e; ++i)
include/llvm/ADT/MapVector.h 60 size_type size() const { return Vector.size(); }
104 I = Vector.size() - 1;
123 I = Vector.size() - 1;
136 I = Vector.size() - 1;
include/llvm/ADT/PriorityWorklist.h 93 auto InsertResult = M.insert({X, V.size()});
102 if (Index != (ptrdiff_t)(V.size() - 1)) {
105 Index = (ptrdiff_t)V.size();
121 ptrdiff_t StartIndex = V.size();
124 for (ptrdiff_t i = V.size() - 1; i >= StartIndex; --i) {
169 if (I->second == (ptrdiff_t)(V.size() - 1)) {
include/llvm/ADT/SetVector.h 78 return vector_.size();
135 assert(n < vector_.size() && "SetVector access out of range!");
include/llvm/ADT/SmallSet.h 160 return isSmall() ? Vector.size() : Set.size();
187 if (Vector.size() < N) {
include/llvm/ADT/SmallString.h 266 StringRef str() const { return StringRef(this->begin(), this->size()); }
include/llvm/ADT/SmallVector.h 129 iterator end() { return begin() + size(); }
130 const_iterator end() const { return begin() + size(); }
138 size_type size_in_bytes() const { return size() * sizeof(T); }
149 assert(idx < size());
153 assert(idx < size());
212 if (LLVM_UNLIKELY(this->size() >= this->capacity()))
215 this->set_size(this->size() + 1);
219 if (LLVM_UNLIKELY(this->size() >= this->capacity()))
222 this->set_size(this->size() + 1);
226 this->set_size(this->size() - 1);
303 if (LLVM_UNLIKELY(this->size() >= this->capacity()))
306 this->set_size(this->size() + 1);
309 void pop_back() { this->set_size(this->size() - 1); }
345 if (N < this->size()) {
348 } else if (N > this->size()) {
358 if (N < this->size()) {
361 } else if (N > this->size()) {
389 if (NumInputs > this->capacity() - this->size())
390 this->grow(this->size()+NumInputs);
393 this->set_size(this->size() + NumInputs);
398 if (NumInputs > this->capacity() - this->size())
399 this->grow(this->size()+NumInputs);
402 this->set_size(this->size() + NumInputs);
476 if (this->size() >= this->capacity()) {
485 this->set_size(this->size() + 1);
506 if (this->size() >= this->capacity()) {
514 this->set_size(this->size() + 1);
539 reserve(this->size() + NumToInsert);
565 this->set_size(this->size() + NumToInsert);
596 reserve(this->size() + NumToInsert);
622 this->set_size(this->size() + NumToInsert);
642 if (LLVM_UNLIKELY(this->size() >= this->capacity()))
645 this->set_size(this->size() + 1);
654 if (this->size() != RHS.size()) return false;
654 if (this->size() != RHS.size()) return false;
678 if (RHS.size() > this->capacity())
679 this->grow(RHS.size());
680 if (this->size() > RHS.capacity())
681 RHS.grow(this->size());
684 size_t NumShared = this->size();
685 if (NumShared > RHS.size()) NumShared = RHS.size();
685 if (NumShared > RHS.size()) NumShared = RHS.size();
690 if (this->size() > RHS.size()) {
690 if (this->size() > RHS.size()) {
691 size_t EltDiff = this->size() - RHS.size();
691 size_t EltDiff = this->size() - RHS.size();
693 RHS.set_size(RHS.size() + EltDiff);
696 } else if (RHS.size() > this->size()) {
696 } else if (RHS.size() > this->size()) {
697 size_t EltDiff = RHS.size() - this->size();
697 size_t EltDiff = RHS.size() - this->size();
699 this->set_size(this->size() + EltDiff);
713 size_t RHSSize = RHS.size();
714 size_t CurSize = this->size();
772 size_t RHSSize = RHS.size();
773 size_t CurSize = this->size();
include/llvm/ADT/SparseMultiSet.h 162 return Dense.size() - 1;
236 assert(Idx < SMS->Dense.size() && "Out of range, non-INVALID Idx?");
336 assert(NumFree <= Dense.size() && "Out-of-bounds free entries");
337 return Dense.size() - NumFree;
357 for (unsigned i = Sparse[Idx], e = Dense.size(); i < e; i += Stride) {
include/llvm/ADT/SparseSet.h 190 size_type size() const { return Dense.size(); }
include/llvm/ADT/TinyPtrVector.h 177 return Val.template get<VecTy*>()->size();
225 assert(i < Val.template get<VecTy*>()->size() &&
include/llvm/ADT/Twine.h 448 return StringRef(LHS.smallString->data(), LHS.smallString->size());
459 return StringRef(Out.data(), Out.size());
include/llvm/Analysis/BlockFrequencyInfoImpl.h 235 NumHeaders = Nodes.size();
include/llvm/Analysis/DDG.h 145 setKind((InstList.size() == 0 && Input.size() == 1)
145 setKind((InstList.size() == 0 && Input.size() == 1)
include/llvm/Analysis/DominanceFrontier.h 63 assert(Roots.size() == 1 && "Should always have entry node!");
133 assert(DT.getRoots().size() == 1 &&
include/llvm/Analysis/LazyCallGraph.h 491 int size() const { return Nodes.size(); }
622 ssize_t size() const { return SCCs.size(); }
907 if (Index == (int)G.PostOrderRefSCCs.size())
include/llvm/Analysis/LoopAccessAnalysis.h 247 for (unsigned I = 0; I < InstMap.size(); ++I)
440 unsigned getNumberOfChecks() const { return Checks.size(); }
include/llvm/Analysis/LoopCacheAnalysis.h 54 size_t getNumSubscripts() const { return Subscripts.size(); }
include/llvm/Analysis/LoopInfoImpl.h 53 if (ExitingBlocks.size() == 1)
79 if (ExitBlocks.size() == 1)
134 if (UniqueExitBlocks.size() == 1)
326 for (unsigned i = 0, e = OutsideLoopPreds.size(); i != e; ++i)
include/llvm/Analysis/LoopPass.h 118 assert(N < PassVector.size() && "Pass number out of range!");
include/llvm/Analysis/PHITransAddr.h 66 for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
include/llvm/Analysis/RegionPass.h 118 assert(N < PassVector.size() && "Pass number out of range!");
include/llvm/Analysis/ScalarEvolution.h 430 unsigned getComplexity() const override { return Preds.size(); }
include/llvm/Analysis/SparsePropagation.h 334 Succs.assign(Succs.size(), true);
391 for (unsigned i = 0, e = SuccFeasible.size(); i != e; ++i)
include/llvm/Bitstream/BitCodes.h 177 return static_cast<unsigned>(OperandList.size());
include/llvm/Bitstream/BitstreamWriter.h 75 size_t GetBufferOffset() const { return Out.size(); }
include/llvm/CodeGen/CallingConvLower.h 465 unsigned getInRegsParamsCount() const { return ByValRegs.size(); }
474 assert(InRegsParamRecordIndex < ByValRegs.size() &&
491 unsigned e = ByValRegs.size();
545 unsigned NumFirstPassLocs = Locs.size();
include/llvm/CodeGen/GlobalISel/GISelWorkList.h 67 if (Worklist.size() > N)
68 WorklistMap.reserve(Worklist.size());
69 for (unsigned i = 0; i < Worklist.size(); ++i)
80 if (WorklistMap.try_emplace(I, Worklist.size()).second)
include/llvm/CodeGen/GlobalISel/InstructionSelectorImpl.h 69 << OnFailResumeAt.size() << " try-blocks remain)\n");
110 if ((size_t)NewInsnID < State.MIs.size())
113 assert((size_t)NewInsnID == State.MIs.size() &&
747 if (NewInsnID >= OutMIs.size())
763 if (NewInsnID >= OutMIs.size())
include/llvm/CodeGen/GlobalISel/LegalizerInfo.h 971 if (SpecifiedActions[OpcodeIdx].size() <= Aspect.Idx)
996 if (ScalarSizeChangeStrategies[OpcodeIdx].size() <= TypeIdx)
1007 if (VectorElementSizeChangeStrategies[OpcodeIdx].size() <= TypeIdx)
1298 if (Actions.size() <= TypeIndex)
include/llvm/CodeGen/GlobalISel/RegBankSelect.h 388 unsigned getNumInsertPoints() const { return InsertPoints.size(); }
include/llvm/CodeGen/LiveInterval.h 297 return segments.size();
302 bool containsOneValue() const { return valnos.size() == 1; }
304 unsigned getNumValNums() const { return (unsigned)valnos.size(); }
324 new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), def);
343 new (VNInfoAllocator) VNInfo((unsigned)valnos.size(), *orig);
include/llvm/CodeGen/LiveIntervals.h 261 assert(unsigned(MBB->getNumber()) == RegMaskBlocks.size() &&
263 RegMaskBlocks.push_back(std::make_pair(RegMaskSlots.size(), 0));
include/llvm/CodeGen/LiveRangeEdit.h 144 FirstNew(newRegs.size()), DeadRemats(deadRemats) {
161 unsigned size() const { return NewRegs.size() - FirstNew; }
include/llvm/CodeGen/MachineFrameInfo.h 406 assert (i >= 0 && (unsigned)i < LocalFrameObjects.size() &&
412 int64_t getLocalFrameObjectCount() const { return LocalFrameObjects.size(); }
include/llvm/CodeGen/MachineRegisterInfo.h 794 unsigned BestHint = (RegAllocHints[VReg.id()].second.size() ?
include/llvm/CodeGen/RegisterClassInfo.h 114 if (PhysReg < CalleeSavedAliases.size())
include/llvm/CodeGen/ScheduleDAG.h 645 return SUnitIterator(N, (unsigned)N->Preds.size());
include/llvm/CodeGen/SlotIndexes.h 632 assert(unsigned(mbb->getNumber()) == MBBRanges.size() &&
include/llvm/CodeGen/WinEHFuncInfo.h 102 int getLastStateNumber() const { return CxxUnwindMap.size() - 1; }
include/llvm/DebugInfo/CodeView/CodeViewRecordIO.h 146 Size = static_cast<SizeType>(Items.size());
156 Size = static_cast<SizeType>(Items.size());
include/llvm/DebugInfo/DIContext.h 88 assert(Index < Frames.size());
93 assert(Index < Frames.size());
98 return Frames.size();
include/llvm/DebugInfo/DWARF/DWARFAbbreviationDeclaration.h 101 assert(idx < AttributeSpecs.size());
106 return AttributeSpecs.size();
110 assert(idx < AttributeSpecs.size());
include/llvm/DebugInfo/DWARF/DWARFUnit.h 147 unsigned getNumUnits() const { return size(); }
150 return NumInfoUnits == -1 ? size() : NumInfoUnits;
153 unsigned getNumTypesUnits() const { return size() - NumInfoUnits; }
156 void finishedInfoUnits() { NumInfoUnits = size(); }
include/llvm/IR/CallSite.h 815 return CI.ParameterEncoding.size() - 1;
853 assert(CI.ParameterEncoding.size() && CI.ParameterEncoding[0] > 0);
include/llvm/IR/DebugInfo.h 123 unsigned compile_unit_count() const { return CUs.size(); }
124 unsigned global_variable_count() const { return GVs.size(); }
125 unsigned subprogram_count() const { return SPs.size(); }
126 unsigned type_count() const { return TYs.size(); }
127 unsigned scope_count() const { return Scopes.size(); }
include/llvm/IR/Instructions.h 2362 return (unsigned)Indices.size();
2493 return (unsigned)Indices.size();
include/llvm/IR/LegacyPassManagers.h 170 return (unsigned)PassManagers.size();
266 ID.AddInteger(Vec.size());
385 return (unsigned)PassVector.size();
512 assert ( N < PassVector.size() && "Pass number out of range!");
include/llvm/IR/PredIteratorCache.h 50 BlockToPredCountMap[BB] = PredCache.size() - 1;
52 Entry = Memory.Allocate<BasicBlock *>(PredCache.size());
include/llvm/MC/MCFragment.h 405 return InstInfo.InstFragment->getContents().size();
include/llvm/MC/MCInst.h 181 unsigned getNumOperands() const { return Operands.size(); }
191 size_t size() const { return Operands.size(); }
include/llvm/MC/MCStreamer.h 383 if (SectionStack.size() <= 1)
include/llvm/MCA/HardwareUnits/LSUnit.h 61 unsigned getNumSuccessors() const { return Succ.size(); }
include/llvm/MCA/HardwareUnits/RegisterFile.h 226 unsigned getNumRegisterFiles() const { return RegisterFiles.size(); }
include/llvm/MCA/HardwareUnits/ResourceManager.h 394 assert(ResourceID < ProcResID2Mask.size() &&
include/llvm/MCA/Instruction.h 182 unsigned NumUsers = Users.size();
include/llvm/MCA/Stages/MicroOpQueueStage.h 56 std::min(static_cast<unsigned>(Buffer.size()),
77 return AvailableEntries != Buffer.size();
include/llvm/Option/Arg.h 111 unsigned getNumValues() const { return Values.size(); }
include/llvm/Option/ArgList.h 185 unsigned size() const { return Args.size(); }
include/llvm/ProfileData/GCOV.h 287 size_t getNumBlocks() const { return Blocks.size(); }
344 if (DstEdges.size() && DstEdges.back()->Dst.Number > Edge->Dst.Number)
349 size_t getNumSrcEdges() const { return SrcEdges.size(); }
350 size_t getNumDstEdges() const { return DstEdges.size(); }
include/llvm/Support/Allocator.h 289 size_t GetNumSlabs() const { return Slabs.size() + CustomSizedSlabs.size(); }
289 size_t GetNumSlabs() const { return Slabs.size() + CustomSizedSlabs.size(); }
299 for (size_t Idx = 0, E = Slabs.size(); Idx < E; Idx++) {
308 for (size_t Idx = 0, E = CustomSizedSlabs.size(); Idx < E; Idx++) {
361 detail::printBumpPtrAllocatorStats(Slabs.size(), BytesAllocated,
403 size_t AllocatedSlabSize = computeSlabSize(Slabs.size());
include/llvm/Support/ArrayRecycler.h 44 if (Idx >= Bucket.size())
59 if (Idx >= Bucket.size())
include/llvm/Support/CommandLine.h 781 unsigned getNumOptions() const override { return unsigned(Values.size()); }
800 for (size_t i = 0, e = Values.size(); i != e; ++i)
813 assert(findOption(Name) == Values.size() && "Option already exists!");
823 assert(N != Values.size() && "Option not found!");
include/llvm/Support/FormatCommon.h 43 if (Amount <= Item.size()) {
48 size_t PadAmount = Amount - Item.size();
include/llvm/Support/GenericDomTree.h 295 if (Roots.size() != Other.Roots.size())
295 if (Roots.size() != Other.Roots.size())
439 assert(this->Roots.size() == 1 && "Should always have entry node!");
592 assert(Roots.size() == 1);
include/llvm/Support/GenericDomTreeConstruction.h 517 for (unsigned i = 0; i < Roots.size(); ++i) {
552 assert(DT.Roots.size() == 1 && "Dominators should have a singe root");
703 if (A.size() != B.size())
703 if (A.size() != B.size())
1173 LLVM_DEBUG(dbgs() << "Legalizing " << BUI.Updates.size() << " updates\n");
1176 const size_t NumLegalized = BUI.Updates.size();
1453 for (size_t i = 0, e = Children.size() - 1; i != e; ++i) {
1608 LLVM_DEBUG(dbgs() << "Legalizing " << BUI.Updates.size() << " updates\n");
1611 const size_t NumLegalized = BUI.Updates.size();
include/llvm/Support/JSON.h 760 assert(Stack.size() == 1 && "Unmatched begin()/end()");
include/llvm/Support/YAMLTraits.h 1885 static size_t size(IO &io, T &seq) { return seq.size(); }
1888 if (index >= seq.size())
include/llvm/Support/raw_ostream.h 207 return write(Str.data(), Str.size());
555 StringRef str() { return StringRef(OS.data(), OS.size()); }
include/llvm/TableGen/Record.h 1551 for (unsigned i = 0, e = Values.size(); i != e; ++i)
1810 size_t size() { return Parts.size(); }
1813 assert (i < Parts.size() && "Invalid idx!");
include/llvm/Transforms/InstCombine/InstCombineWorklist.h 41 if (WorklistMap.insert(std::make_pair(I, Worklist.size())).second) {
include/llvm/Transforms/Utils/SSAUpdaterImpl.h 98 if (BlockList.size() == 0) {
131 Info->NumPreds = Preds.size();
lib/Analysis/BasicAliasAnalysis.cpp 612 for (unsigned i = 0, e = Decomposed.VarIndices.size(); i != e; ++i) {
1470 for (unsigned i = 0, e = DecompGEP1.VarIndices.size(); i != e; ++i) {
1717 for (unsigned i = 1, e = V1Srcs.size(); i != e; ++i) {
1947 for (unsigned i = 0, e = Src.size(); i != e; ++i) {
1954 for (unsigned j = 0, e = Dest.size(); j != e; ++j) {
1981 if (VarIndices.size() != 2 || MaybeV1Size == LocationSize::unknown() ||
lib/Analysis/BlockFrequencyInfoImpl.cpp 181 HashTable Combined(NextPowerOf2(2 * Weights.size()));
186 if (Weights.size() == Combined.size())
198 if (Weights.size() > 128) {
220 if (Weights.size() > 1)
224 if (Weights.size() == 1) {
632 Nodes.reserve(OuterLoop.Nodes.size());
708 assert(Headers.size() >= 2 &&
710 if (Headers.size() == InSCC.size()) {
lib/Analysis/BranchProbabilityInfo.cpp 231 BranchProbability Prob(1, UnreachableEdges.size());
239 (BranchProbability::getOne() - UR_TAKEN_PROB * UnreachableEdges.size()) /
240 ReachableEdges.size();
294 assert(Weights.size() == TI->getNumSuccessors() && "Checked above");
311 if (WeightSum == 0 || ReachableIdxs.size() == 0) {
324 if (UnreachableIdxs.size() > 0 && ReachableIdxs.size() > 0) {
324 if (UnreachableIdxs.size() > 0 && ReachableIdxs.size() > 0) {
336 BranchProbability PerEdge = ToDistribute / ReachableIdxs.size();
377 BranchProbability Prob(1, ColdEdges.size());
385 (CC_TAKEN_WEIGHT + CC_NONTAKEN_WEIGHT) * uint64_t(ColdEdges.size()));
388 (CC_TAKEN_WEIGHT + CC_NONTAKEN_WEIGHT) * uint64_t(NormalEdges.size()));
626 if (uint32_t numBackEdges = BackEdges.size()) {
633 if (uint32_t numInEdges = InEdges.size()) {
640 if (uint32_t numExitingEdges = ExitingEdges.size()) {
648 if (uint32_t numUnlikelyEdges = UnlikelyEdges.size()) {
lib/Analysis/CFLGraph.h 377 assert(Fns.size() > 0);
lib/Analysis/CallGraphSCCPass.cpp 95 assert(N < PassVector.size() && "Pass number out of range!");
lib/Analysis/CodeMetrics.cpp 51 for (int i = 0; i < (int)Worklist.size(); ++i) {
lib/Analysis/ConstantFolding.cpp 989 NewIdxs.size() > *LastIRIndex) {
2434 if (NewElements.size() != VTy->getNumElements())
lib/Analysis/DDG.cpp 87 assert(((getKind() == NodeKind::SingleInstruction && InstList.size() == 1) ||
88 (getKind() == NodeKind::MultiInstruction && InstList.size() > 1)) &&
94 assert(((getKind() == NodeKind::SingleInstruction && InstList.size() == 1) ||
95 (getKind() == NodeKind::MultiInstruction && InstList.size() > 1)) &&
lib/Analysis/Delinearization.cpp 101 if (Subscripts.size() == 0 || Sizes.size() == 0 ||
101 if (Subscripts.size() == 0 || Sizes.size() == 0 ||
102 Subscripts.size() != Sizes.size()) {
102 Subscripts.size() != Sizes.size()) {
109 int Size = Subscripts.size();
lib/Analysis/DependenceAnalysis.cpp 3315 if (SrcSubscripts.size() < 2 || DstSubscripts.size() < 2 ||
3315 if (SrcSubscripts.size() < 2 || DstSubscripts.size() < 2 ||
3316 SrcSubscripts.size() != DstSubscripts.size())
3316 SrcSubscripts.size() != DstSubscripts.size())
3319 int size = SrcSubscripts.size();
3462 Pairs = Pair.size();
3863 Pairs = Pair.size();
lib/Analysis/DomTreeUpdater.cpp 69 PendDTUpdateIndex = PendUpdates.size();
91 PendPDTUpdateIndex = PendUpdates.size();
147 PendDTUpdateIndex = PendPDTUpdateIndex = PendUpdates.size();
158 return PendUpdates.size() != PendDTUpdateIndex;
164 return PendUpdates.size() != PendPDTUpdateIndex;
417 PendDTUpdateIndex = PendUpdates.size();
419 PendPDTUpdateIndex = PendUpdates.size();
lib/Analysis/InstructionSimplify.cpp 3746 if (ConstOps.size() == I->getNumOperands()) {
4378 assert(MaskNumElts == Indices.size() &&
lib/Analysis/LazyCallGraph.cpp 44 EdgeIndexMap.insert({&TargetN, Edges.size()});
65 if (!EdgeIndexMap.insert({&N, Edges.size()}).second)
334 for (int i = 0, Size = SCCs.size(); i < Size; ++i) {
880 for (int Idx = OldIdx, Size = SCCs.size(); Idx < Size; ++Idx)
884 SCCs.begin() + OldIdx + NewSCCs.size());
1190 const int NumRefSCCNodes = Worklist.size();
1327 for (int i : seq<int>(Idx, G->PostOrderRefSCCs.size()))
1342 int SCCIndex = RC.SCCs.size();
1400 SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});
1433 SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});
1540 for (int i = RCIndex, Size = PostOrderRefSCCs.size(); i < Size; ++i)
1696 for (int i = 0, Size = RC.SCCs.size(); i < Size; ++i)
1731 RefSCCIndices.insert({NewRC, PostOrderRefSCCs.size()}).second;
lib/Analysis/LoopAccessAnalysis.cpp 237 for (unsigned I = 0; I < CheckingGroups.size(); ++I) {
238 for (unsigned J = I + 1; J < CheckingGroups.size(); ++J) {
258 for (unsigned I = 0, EI = M.Members.size(); EI != I; ++I)
259 for (unsigned J = 0, EJ = N.Members.size(); EJ != J; ++J)
353 for (unsigned I = 0; I < Pointers.size(); ++I)
361 for (unsigned Index = 0; Index < Pointers.size(); ++Index)
371 for (unsigned I = 0; I < Pointers.size(); ++I) {
462 for (unsigned K = 0; K < First.size(); ++K)
466 for (unsigned K = 0; K < Second.size(); ++K)
477 for (unsigned I = 0; I < CheckingGroups.size(); ++I) {
483 for (unsigned J = 0; J < CG.Members.size(); ++J) {
779 unsigned NumPointers = RtCheck.Pointers.size();
1691 if (Dependences.size() >= MaxDependences) {
1707 LLVM_DEBUG(dbgs() << "Total Dependences: " << Dependences.size() << "\n");
1907 if (!Stores.size()) {
lib/Analysis/LoopCacheAnalysis.cpp 62 assert(Loops.size() == 1 && "Expecting a single loop");
337 Subscripts.size() != Sizes.size()) {
337 Subscripts.size() != Sizes.size()) {
lib/Analysis/MemoryDependenceAnalysis.cpp 1238 if (Result.size() > NumResultsLimit) {
1298 for (unsigned i = 0; i < NewBlocks.size(); i++)
1303 if (NewBlocks.size() > WorklistEntries) {
1306 for (unsigned i = 0; i < NewBlocks.size(); i++)
1311 WorklistEntries -= NewBlocks.size();
1365 for (unsigned i = 0, n = PredList.size(); i < n; ++i)
1377 for (unsigned i = 0, n = PredList.size(); i < n; ++i) {
lib/Analysis/MemorySSA.cpp 600 PausedSearches.push_back(Paths.size());
772 auto PriorPathsSize = Paths.size();
903 PriorPathsSize = Paths.size();
1397 LocInfo.LastKill = VersionStack.size() - 1;
1404 assert(LocInfo.LowerBound < VersionStack.size() &&
1406 assert(LocInfo.LastKill < VersionStack.size() &&
1409 unsigned long UpperBound = VersionStack.size() - 1;
1472 LocInfo.LowerBound = VersionStack.size() - 1;
1995 assert(AL->size() == ActualAccesses.size() &&
1998 assert((DL || ActualDefs.size() == 0) &&
2000 assert((!DL || DL->size() == ActualDefs.size()) &&
lib/Analysis/MemorySSAUpdater.cpp 267 if (RenameUses && InsertedPHIs.size()) {
345 unsigned NewPhiIndex = InsertedPHIs.size();
403 NewPhiIndex = InsertedPHIs.size();
414 unsigned NewPhiIndexEnd = InsertedPHIs.size();
417 unsigned StartingPHISize = InsertedPHIs.size();
1331 unsigned PhisSize = PhisToOptimize.size();
lib/Analysis/MustExecute.cpp 418 const auto NumLoops = Loops.size();
lib/Analysis/PHITransAddr.cpp 51 for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
101 for (unsigned i = 0, e = InstInputs.size(); i != e; ++i)
231 for (unsigned i = 0, e = GEPOps.size(); i != e; ++i)
242 GEPI->getNumOperands() == GEPOps.size() &&
344 unsigned NISize = NewInsts.size();
353 while (NewInsts.size() != NISize)
lib/Analysis/ScalarEvolution.cpp 804 if (Ops.size() < 2) return; // Noop
808 if (Ops.size() == 2) {
827 for (unsigned i = 0, e = Ops.size(); i != e-2; ++i) {
1005 if (Qs.size() == 1) {
1048 if (Qs.size() == 1)
1459 if (DiffOps.size() == SA->getNumOperands())
2412 if (Ops.size() == 1) return Ops[0];
2415 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
2429 assert(Idx < Ops.size());
2433 if (Ops.size() == 2) return Ops[0];
2444 if (Ops.size() == 1) return Ops[0];
2456 for (unsigned i = 0, e = Ops.size(); i != e-1; ++i)
2465 if (Ops.size() == Count)
2498 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
2541 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scAddExpr)
2545 if (Idx < Ops.size()) {
2548 if (Ops.size() > AddOpsInlineThreshold ||
2566 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scMulExpr)
2571 if (Idx < Ops.size() && isa<SCEVMulExpr>(Ops[Idx])) {
2577 Ops.data(), Ops.size(),
2603 if (Ops.size() == 1)
2612 for (; Idx < Ops.size() && isa<SCEVMulExpr>(Ops[Idx]); ++Idx) {
2618 for (unsigned AddOp = 0, e = Ops.size(); AddOp != e; ++AddOp)
2634 if (Ops.size() == 2) return OuterMul;
2648 OtherMulIdx < Ops.size() && isa<SCEVMulExpr>(Ops[OtherMulIdx]);
2676 if (Ops.size() == 2) return OuterMul;
2689 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scAddRecExpr)
2693 for (; Idx < Ops.size() && isa<SCEVAddRecExpr>(Ops[Idx]); ++Idx) {
2699 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2725 if (Ops.size() == 1) return NewRec;
2740 OtherIdx < Ops.size() && isa<SCEVAddRecExpr>(Ops[OtherIdx]);
2752 for (; OtherIdx != Ops.size() && isa<SCEVAddRecExpr>(Ops[OtherIdx]);
2758 if (i >= AddRecOps.size()) {
2913 if (Ops.size() == 1) return Ops[0];
2916 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
2934 if (Ops.size() == 2)
2957 if (Ops.size() == 1) return Ops[0];
2971 if (Ops.size() == 2) {
2996 if (Ops.size() == 1)
3001 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scMulExpr)
3005 if (Idx < Ops.size()) {
3008 if (Ops.size() > MulOpsInlineThreshold)
3027 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < scAddRecExpr)
3031 for (; Idx < Ops.size() && isa<SCEVAddRecExpr>(Ops[Idx]); ++Idx) {
3037 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
3063 if (Ops.size() == 1) return NewRec;
3090 OtherIdx != Ops.size() && isa<SCEVAddRecExpr>(Ops[OtherIdx]);
3136 if (Ops.size() == 2) return NewAddRec;
3291 if (Operands.size() == A->getNumOperands())
3412 if (Operands.size() == 1) return Operands[0];
3415 for (unsigned i = 1, e = Operands.size(); i != e; ++i)
3418 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
3552 if (Ops.size() == 1) return Ops[0];
3555 for (unsigned i = 1, e = Ops.size(); i != e; ++i)
3575 assert(Idx < Ops.size());
3594 if (Ops.size() == 1) return Ops[0];
3611 if (Ops.size() == 1) return Ops[0];
3615 while (Idx < Ops.size() && Ops[Idx]->getSCEVType() < Kind)
3620 if (Idx < Ops.size()) {
3642 for (unsigned i = 0, e = Ops.size() - 1; i != e; ++i) {
3659 if (Ops.size() == 1) return Ops[0];
3671 const SCEV **O = SCEVAllocator.Allocate<const SCEV *>(Ops.size());
3674 ID.Intern(SCEVAllocator), static_cast<SCEVTypes>(Kind), O, Ops.size());
4138 if (Ops.size() == 1)
7076 for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
7124 bool MaxOrZero = (MustExitMaxOrZero && ExitingBlocks.size() == 1);
11002 if (Operands.size() == 0)
11056 int Last = Terms.size() - 1;
11091 if (Terms.size() > 0)
11150 if (Terms.size() < 1 || !ElementSize)
11222 int Last = Sizes.size() - 1;
11493 if (ExitingBlocks.size() != 1)
11501 if (ExitingBlocks.size() > 1)
lib/Analysis/ScalarEvolutionExpander.cpp 320 for (unsigned i = Ops.size(); i > 0 && isa<SCEVAddRecExpr>(Ops[i-1]); --i)
350 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
lib/Analysis/ScalarEvolutionNormalization.cpp 65 for (int i = 0, e = Operands.size() - 1; i < e; i++)
89 for (int i = Operands.size() - 2; i >= 0; i--)
lib/Analysis/StackSafetyAnalysis.cpp 454 if (ParamNo >= FS.Params.size()) // possibly vararg
lib/Analysis/SyncDependenceAnalysis.cpp 337 if (LoopExits.size() < 1) {
lib/Analysis/VFABIDemangling.cpp 319 const unsigned ParameterPos = Parameters.size();
375 const unsigned Pos = Parameters.size();
lib/Analysis/ValueTracking.cpp 3358 unsigned IdxSkip = Idxs.size();
3443 assert(Idxs.size() == size
lib/Analysis/VectorUtils.cpp 584 if (Intersection.size() == 0)
586 if (Intersection.size() == 1)
746 NumVecs = ResList.size();
lib/AsmParser/LLParser.cpp 2656 for (unsigned i = 0, e = ArgList.size(); i != e; ++i) {
2665 for (unsigned i = 0, e = ArgList.size(); i != e; ++i)
3118 ID.ConstantStructElts = std::make_unique<Constant *[]>(Elts.size());
3119 ID.UIntVal = Elts.size();
3121 Elts.size() * sizeof(Elts[0]));
3140 ID.ConstantStructElts = std::make_unique<Constant *[]>(Elts.size());
3142 Elts.size() * sizeof(Elts[0]));
3143 ID.UIntVal = Elts.size();
3158 for (unsigned i = 1, e = Elts.size(); i != e; ++i)
3188 ArrayType *ATy = ArrayType::get(Elts[0]->getType(), Elts.size());
3191 for (unsigned i = 0, e = Elts.size(); i != e; ++i) {
3572 if (Elts.size() == 0 ||
3620 if (Elts.size() != 3)
3627 if (Elts.size() != 3)
3634 if (Elts.size() != 2)
3641 if (Elts.size() != 3)
3713 *InRangeOp = Elts.size();
5423 for (unsigned i = 0, e = ArgList.size(); i != e; ++i) {
5508 for (unsigned i = 0, e = ArgList.size(); i != e; ++i, ++ArgIt) {
5988 SwitchInst *SI = SwitchInst::Create(Cond, DefaultBB, Table.size());
5989 for (unsigned i = 0, e = Table.size(); i != e; ++i)
6028 IndirectBrInst *IBI = IndirectBrInst::Create(Address, DestList.size());
6029 for (unsigned i = 0, e = DestList.size(); i != e; ++i)
6072 for (unsigned i = 0, e = ArgList.size(); i != e; ++i)
6097 for (unsigned i = 0, e = ArgList.size(); i != e; ++i) {
6268 CatchSwitchInst::Create(ParentPad, UnwindBB, Table.size());
6399 for (unsigned i = 0, e = ArgList.size(); i != e; ++i)
6427 for (unsigned i = 0, e = ArgList.size(); i != e; ++i) {
6694 PHINode *PN = PHINode::Create(Ty, PHIVals.size());
6695 for (unsigned i = 0, e = PHIVals.size(); i != e; ++i)
6801 for (unsigned i = 0, e = ArgList.size(); i != e; ++i)
6827 for (unsigned i = 0, e = ArgList.size(); i != e; ++i) {
7368 Offset += Index - Indexes.size();
7370 IsOrdered &= Index == Indexes.size();
7378 if (Indexes.size() < 2)
7380 if (Offset != 0 || Max >= Indexes.size())
lib/BinaryFormat/MsgPackDocument.cpp 89 if (Multi && Stack.size() == 1) {
lib/Bitcode/Reader/BitcodeAnalyzer.cpp 873 for (unsigned i = 0, e = Record.size(); i != e; ++i)
880 if (Record.size() != 2)
900 if (Record.size() != 5)
940 for (unsigned j = i - 1, je = Record.size(); j != je; ++j) {
lib/Bitcode/Reader/BitcodeReader.cpp 655 if (Slot == Record.size()) return true;
666 if (Slot == Record.size())
699 if (Slot == Record.size()) return nullptr;
710 if (Slot == Record.size()) return nullptr;
1387 if (Record.size() & 1)
1390 for (unsigned i = 0, e = Record.size(); i != e; i += 2) {
1400 for (unsigned i = 0, e = Record.size(); i != e; ++i)
1599 if (Record.size() < 3)
1606 for (unsigned i = 2, e = Record.size(); i != e; ++i) {
1718 if (Record.size() < 1)
1756 if (Record.size() < 1)
1768 if (Record.size() < 1)
1771 if (Record.size() == 2)
1783 if (Record.size() < 3)
1786 for (unsigned i = 3, e = Record.size(); i != e; ++i) {
1794 if (!ResultTy || ArgTys.size() < Record.size()-3)
1794 if (!ResultTy || ArgTys.size() < Record.size()-3)
1802 if (Record.size() < 2)
1805 for (unsigned i = 2, e = Record.size(); i != e; ++i) {
1816 if (!ResultTy || ArgTys.size() < Record.size()-2)
1816 if (!ResultTy || ArgTys.size() < Record.size()-2)
1823 if (Record.size() < 1)
1826 for (unsigned i = 1, e = Record.size(); i != e; ++i) {
1832 if (EltTys.size() != Record.size()-1)
1832 if (EltTys.size() != Record.size()-1)
1843 if (Record.size() < 1)
1859 for (unsigned i = 1, e = Record.size(); i != e; ++i) {
1865 if (EltTys.size() != Record.size()-1)
1865 if (EltTys.size() != Record.size()-1)
1872 if (Record.size() != 1)
1890 if (Record.size() < 2)
1899 if (Record.size() < 2)
1906 bool Scalable = Record.size() > 2 ? Record[2] : false;
2019 StringRef NameStr(ValueName.data(), ValueName.size());
2209 BB->setName(StringRef(ValueName.data(), ValueName.size()));
2433 unsigned Size = Record.size();
2519 if (Record.size() < 2)
2532 if (Record.size() < 3)
2541 if (Record.size() >= 4) {
2563 if (Record.size() < 3)
2585 Record.size() % 2)
2599 while (OpNum != Record.size()) {
2608 if (Elts.size() < 1)
2625 if (Record.size() < 3)
2645 if (Record.size() < 3)
2653 if (Record.size() == 4) {
2668 if (Record.size() < 3 || !OpTy)
2674 if (Record.size() == 4) {
2688 if (Record.size() < 3 || !OpTy)
2702 if (Record.size() < 4 || !RTy || !OpTy)
2713 if (Record.size() < 4)
2730 if (Record.size() < 2)
2736 if (2+AsmStrSize >= Record.size())
2739 if (3+AsmStrSize+ConstStrSize > Record.size())
2755 if (Record.size() < 2)
2762 if (2+AsmStrSize >= Record.size())
2765 if (3+AsmStrSize+ConstStrSize > Record.size())
2780 if (Record.size() < 3)
2866 unsigned RecordLength = Record.size();
2882 if (++NumUses > Record.size())
2886 if (Order.size() != Record.size() || NumUses > Record.size())
2886 if (Order.size() != Record.size() || NumUses > Record.size())
3635 if (Record.size() < 1)
3793 if (Record.size() < 1 || Record[0] == 0)
3840 if (!I || Record.size() < 4)
3845 bool isImplicitCode = Record.size() == 5 && Record[4];
3869 OpNum+1 > Record.size())
3877 if (OpNum < Record.size()) {
3891 OpNum+1 > Record.size())
3899 if (OpNum < Record.size()) {
3927 OpNum+2 != Record.size())
3980 while (OpNum != Record.size()) {
4003 unsigned RecSize = Record.size();
4044 unsigned RecSize = Record.size();
4118 if (OpNum < Record.size() && isa<FPMathOperator>(I)) {
4187 if (OpNum >= Record.size())
4194 if (IsFP && Record.size() > OpNum+1)
4197 if (OpNum+1 != Record.size())
4213 unsigned Size = Record.size();
4224 if (OpNum != Record.size())
4232 if (Record.size() != 1 && Record.size() != 3)
4232 if (Record.size() != 1 && Record.size() != 3)
4238 if (Record.size() == 1) {
4254 if (Record.size() != 1 && Record.size() != 2)
4254 if (Record.size() != 1 && Record.size() != 2)
4262 if (Record.size() == 2) {
4273 if (Record.size() != 2)
4290 if (Record.size() < 2)
4309 if (Idx + 1 == Record.size()) {
4315 if (Record.size() != Idx)
4329 if (Record.size() < 2)
4347 if (Record.size() != Idx)
4421 if (Record.size() < 3 || (Record.size() & 1) == 0)
4421 if (Record.size() < 3 || (Record.size() & 1) == 0)
4428 unsigned NumCases = (Record.size()-3)/2;
4445 if (Record.size() < 2)
4451 unsigned NumDests = Record.size()-2;
4468 if (Record.size() < 4)
4502 if (Record.size() < FTy->getNumParams() + OpNum)
4516 if (Record.size() != OpNum)
4520 while (OpNum != Record.size()) {
4589 if (Record.size() < FTy->getNumParams() + OpNum)
4606 if (OpNum != Record.size())
4609 while (OpNum != Record.size()) {
4632 if (Record.size() < 1)
4643 size_t NumArgs = (Record.size() - 1) / 2;
4644 if ((Record.size() - 1) % 2 == 1 && !Ty->isFPOrFPVectorTy())
4667 if (Record.size() % 2 == 0) {
4669 FastMathFlags FMF = getDecodedFastMathFlags(Record[Record.size() - 1]);
4682 if (Record.size() < 3)
4686 if (Record.size() < 4)
4733 if (Record.size() != 4)
4776 (OpNum + 2 != Record.size() && OpNum + 3 != Record.size()))
4776 (OpNum + 2 != Record.size() && OpNum + 3 != Record.size()))
4783 if (OpNum + 3 == Record.size()) {
4804 (OpNum + 4 != Record.size() && OpNum + 5 != Record.size()))
4804 (OpNum + 4 != Record.size() && OpNum + 5 != Record.size()))
4811 if (OpNum + 5 == Record.size()) {
4846 OpNum + 2 != Record.size())
4870 OpNum + 4 != Record.size())
4913 Record.size() < OpNum + 3 || Record.size() > OpNum + 5)
4913 Record.size() < OpNum + 3 || Record.size() > OpNum + 5)
4925 if (Record.size() < 7)
4936 if (Record.size() < 8) {
4958 OpNum + 4 != Record.size())
4976 if (2 != Record.size())
4990 if (Record.size() < 3)
5030 if (Record.size() < FTy->getNumParams() + OpNum)
5049 if (OpNum != Record.size())
5052 while (OpNum != Record.size()) {
5087 if (Record.size() < 3)
5105 if (Record.size() < 1 || Record[0] >= BundleTags.size())
5111 while (OpNum != Record.size()) {
5212 if (Val >= SSIDs.size())
5580 if (Record.size() != 5)
5581 return error("Invalid hash length " + Twine(Record.size()).str());
5592 if (Record.size() < 1)
5891 assert(Record.size() >= RefListStartIndex + NumRefs &&
5982 for (unsigned I = VTableListStartIndex, E = Record.size(); I != E; ++I) {
6036 assert(Record.size() >= RefListStartIndex + NumRefs &&
6130 for (unsigned I = 0; I != Record.size(); I += 2)
6136 for (unsigned I = 0; I != Record.size(); I += 2)
6152 for (unsigned I = 0; I != Record.size(); I += 2)
6160 for (unsigned I = 0; I != Record.size(); I += 2)
6228 if (Record.size() != 5)
6229 return error("Invalid hash length " + Twine(Record.size()).str());
lib/Bitcode/Reader/MetadataLoader.cpp 144 unsigned size() const { return MetadataPtrs.size(); }
153 assert(i < MetadataPtrs.size());
158 if (I < MetadataPtrs.size())
742 if (Record.size() != 2)
767 GlobalMetadataBitPosIndex.reserve(Record.size());
809 unsigned Size = Record.size();
833 if (Record.size() % 2 == 0)
1124 unsigned Size = Record.size();
1138 if (Record.size() % 2 == 1)
1147 if (Record.size() != 2) {
1166 if (Record.size() % 2 == 1)
1169 unsigned Size = Record.size();
1191 if (Record.size() != 2)
1209 Elts.reserve(Record.size());
1219 if (Record.size() != 5 && Record.size() != 6)
1219 if (Record.size() != 5 && Record.size() != 6)
1227 bool ImplicitCode = Record.size() == 6 && Record[5];
1236 if (Record.size() < 4)
1248 for (unsigned I = 4, E = Record.size(); I != E; ++I)
1280 if (Record.size() != 3)
1293 if (Record.size() < 6 || Record.size() > 7)
1293 if (Record.size() < 6 || Record.size() > 7)
1297 DINode::DIFlags Flags = (Record.size() > 6) ?
1309 if (Record.size() < 12 || Record.size() > 13)
1309 if (Record.size() < 12 || Record.size() > 13)
1315 if (Record.size() > 12 && Record[12])
1333 if (Record.size() < 16 || Record.size() > 17)
1333 if (Record.size() < 16 || Record.size() > 17)
1377 if (Record.size() > 16)
1402 if (Record.size() < 3 || Record.size() > 4)
1402 if (Record.size() < 3 || Record.size() > 4)
1405 unsigned CC = (Record.size() > 3) ? Record[3] : 0;
1421 if (Record.size() != 6)
1436 if (Record.size() != 3 && Record.size() != 5 && Record.size() != 6)
1436 if (Record.size() != 3 && Record.size() != 5 && Record.size() != 6)
1436 if (Record.size() != 3 && Record.size() != 5 && Record.size() != 6)
1446 if (Record.size() > 4 && Record[3] && Record[4])
1453 Record.size() > 5 ? Optional<MDString *>(getMDString(Record[5]))
1460 if (Record.size() < 14 || Record.size() > 19)
1460 if (Record.size() < 14 || Record.size() > 19)
1471 Record.size() <= 15 ? nullptr : getMDOrNull(Record[15]),
1472 Record.size() <= 14 ? 0 : Record[14],
1473 Record.size() <= 16 ? true : Record[16],
1474 Record.size() <= 17 ? false : Record[17],
1475 Record.size() <= 18 ? 0 : Record[18],
1476 Record.size() <= 19 ? 0 : Record[19]);
1487 if (Record.size() < 18 || Record.size() > 21)
1487 if (Record.size() < 18 || Record.size() > 21)
1527 if (!HasSPFlags && HasUnit && Record.size() < 19)
1540 if (Record.size() >= 19) {
1544 HasThisAdj = Record.size() >= 20;
1545 HasThrownTypes = Record.size() >= 21;
1588 if (Record.size() != 5)
1601 if (Record.size() != 4)
1627 if (Record.size() == 3)
1629 else if (Record.size() == 5)
1644 if (Record.size() != 5)
1657 if (Record.size() != 5)
1670 if (Record.size() != 3)
1682 if (Record.size() != 5)
1696 if (Record.size() < 11 || Record.size() > 13)
1696 if (Record.size() < 11 || Record.size() > 13)
1732 if (Record.size() > 11) {
1774 if (Record.size() < 8 || Record.size() > 10)
1774 if (Record.size() < 8 || Record.size() > 10)
1782 bool HasTag = !HasAlignment && Record.size() > 8;
1802 if (Record.size() != 5)
1816 if (Record.size() < 1)
1833 if (Record.size() != 3)
1848 if (Record.size() != 8)
1863 if (Record.size() != 6 && Record.size() != 7)
1863 if (Record.size() != 6 && Record.size() != 7)
1867 bool HasFile = (Record.size() == 7);
1900 if (Record.size() % 2 == 0)
2013 unsigned RecordLength = Record.size();
2069 if (Record.size() < 2)
lib/Bitcode/Writer/BitcodeWriter.cpp 1986 Record.push_back(Blob.size());
2179 for (unsigned i = 0, e = MDs.size(); i != e; ++i) {
2202 for (unsigned MDKindID = 0, e = Names.size(); MDKindID != e; ++MDKindID) {
3700 unsigned SizeBeforeRefs = NameVals.size();
4207 Buffer.size() - BlockStartPos));
4226 size_t BlockStartPos = Buffer.size();
4329 assert(Buffer.size() >= BWH_HeaderSize &&
4332 unsigned BCSize = Buffer.size() - BWH_HeaderSize;
4343 while (Buffer.size() & 15)
4407 {Symtab.data(), Symtab.size()});
4480 Out.write((char*)&Buffer.front(), Buffer.size());
4511 Out.write((char *)&Buffer.front(), Buffer.size());
4672 Out.write((char *)&Buffer.front(), Buffer.size());
lib/Bitcode/Writer/ValueEnumerator.cpp 179 List.push_back(std::make_pair(&U, List.size()));
181 if (List.size() < 2)
233 Stack.emplace_back(V, F, List.size());
234 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
235 for (size_t I = 0, E = List.size(); I != E; ++I)
423 for (unsigned i = 0, e = MDs.size(); i != e; ++i)
755 for (unsigned I = 0, E = Order.size(); I != E && !Order[I].F; ++I) {
764 if (MDs.size() == Order.size())
771 for (unsigned I = MDs.size(), E = Order.size(), ID = MDs.size(); I != E;
996 for (unsigned i = 0, e = FnLocalMDVector.size(); i != e; ++i) {
lib/Bitstream/Reader/BitstreamReader.cpp 482 if (Record.size() < 1)
492 for (unsigned i = 0, e = Record.size(); i != e; ++i)
502 for (unsigned i = 1, e = Record.size(); i != e; ++i)
lib/CodeGen/AggressiveAntiDepBreaker.cpp 133 for (unsigned i = 0, e = CriticalPathRCs.size(); i < e; ++i) {
lib/CodeGen/AllocationOrder.cpp 44 for (unsigned I = 0, E = Hints.size(); I != E; ++I)
50 for (unsigned I = 0, E = Hints.size(); I != E; ++I)
lib/CodeGen/AllocationOrder.h 84 void rewind() { Pos = -int(Hints.size()); }
lib/CodeGen/Analysis.cpp 322 if (ValLoc.size() >= InsertLoc.size() &&
327 ValLoc.resize(ValLoc.size() - InsertLoc.size());
lib/CodeGen/AsmPrinter/AccelTable.cpp 298 Asm->emitInt32(Atoms.size());
lib/CodeGen/AsmPrinter/AsmPrinter.cpp 1732 unsigned SecIdx = CPSections.size();
1740 SecIdx = CPSections.size();
1752 for (unsigned i = 0, e = CPSections.size(); i != e; ++i) {
1753 for (unsigned j = 0, ee = CPSections[i].CPEs.size(); j != ee; ++j) {
lib/CodeGen/AsmPrinter/CodeViewDebug.cpp 1206 return Loc.LoadChain.size() == 2 && Loc.LoadChain.back() == 0;
1250 if (Location->Register == 0 || Location->LoadChain.size() > 1)
1863 if (ReturnAndArgTypeIndices.size() > 1 &&
1930 ArgTypeIndices.size(), ArgListIndex, ThisAdjustment);
2783 if (Ranges.size() != 1 || !getLabelAfterInsn(Ranges.front().second))
lib/CodeGen/AsmPrinter/DIE.cpp 62 for (unsigned i = 0, N = Data.size(); i < N; ++i)
76 for (unsigned i = 0, N = Data.size(); i < N; ++i) {
118 for (unsigned i = 0, N = Data.size(); i < N; ++i) {
lib/CodeGen/AsmPrinter/DbgEntityHistoryCalculator.cpp 69 NewIndex = Entries.size() - 1;
79 return Entries.size() - 1;
81 return Entries.size() - 1;
lib/CodeGen/AsmPrinter/DebugLocEntry.h 130 assert((Values.size() == 1 || all_of(Values, [](DbgValueLoc V) {
lib/CodeGen/AsmPrinter/DebugLocStream.cpp 16 if (Lists.back().EntryOffset == Entries.size()) {
28 if (Entries.back().ByteOffset != DWARFBytes.size())
36 assert(Lists.back().EntryOffset <= Entries.size() &&
lib/CodeGen/AsmPrinter/DebugLocStream.h 60 size_t getNumLists() const { return Lists.size(); }
81 size_t LI = Lists.size();
82 Lists.emplace_back(CU, Entries.size());
99 Entries.push_back({BeginSym, EndSym, DWARFBytes.size(), Comments.size()});
139 if (LI + 1 == Lists.size())
140 return Entries.size() - Lists[LI].EntryOffset;
144 if (EI + 1 == Entries.size())
145 return DWARFBytes.size() - Entries[EI].ByteOffset;
149 if (EI + 1 == Entries.size())
lib/CodeGen/AsmPrinter/DwarfCompileUnit.cpp 503 if (Ranges.size() == 1 || !DD->useRangesSection()) {
514 List.reserve(Ranges.size());
lib/CodeGen/AsmPrinter/DwarfDebug.cpp 211 return TmpBuf ? TmpBuf->Bytes.size() : 0;
269 if (FrameIndexExprs.size() == 1)
299 if (FrameIndexExprs.size()) {
312 assert((FrameIndexExprs.size() == 1 ||
494 if (Ranges.size() > 1)
856 InfoHolder.getUnits().size(), DIUnit, Asm, this, &InfoHolder);
1001 if (!GVMapEntry.size() || (Expr && Expr->isConstant()))
1116 if (unsigned NumRanges = TheCU.getRanges().size()) {
1309 if (LSRange.size() == 0)
1481 return DebugLoc.size() == 1 && isSafeForSingleLocation &&
1544 size_t HistSize = HistoryMapEntries.size();
2241 assert(Values.size() == 1 && "only fragments may have >1 value");
2295 Asm->emitInt32(Holder.getRangeLists().size());
2509 if (List.size() < 1)
2544 for (size_t n = 1, e = List.size(); n < e; n++) {
lib/CodeGen/AsmPrinter/DwarfDebug.h 171 assert(ValueLoc.get() && FrameIndexExprs.size() <= 1);
172 return FrameIndexExprs.size() ? FrameIndexExprs[0].Expr : nullptr;
213 (FrameIndexExprs.size() == 1 &&
lib/CodeGen/AsmPrinter/DwarfExpression.cpp 239 if (HasComplexExpression && DwarfRegs.size() > 1) {
277 assert(DwarfRegs.size() == 1);
536 assert(DwarfRegs.size() == 0 && "dwarf registers not emitted");
lib/CodeGen/AsmPrinter/DwarfFile.cpp 130 return std::make_pair(CURangeLists.size() - 1, &CURangeLists.back());
lib/CodeGen/AsmPrinter/EHStreamer.cpp 98 FirstActions.reserve(LandingPads.size());
118 assert(Actions.size());
119 PrevAction = Actions.size() - 1;
134 assert(-1 - TypeID < (int)FilterOffsets.size() && "Unknown filter id!");
145 PrevAction = Actions.size() - 1;
206 for (unsigned i = 0, N = LandingPads.size(); i != N; ++i) {
208 for (unsigned j = 0, E = LandingPad->BeginLabels.size(); j != E; ++j) {
309 if (CallSites.size() < SiteNo)
lib/CodeGen/AsmPrinter/WasmException.cpp 82 for (unsigned I = 0, N = LandingPads.size(); I < N; ++I) {
92 if (CallSites.size() < LPadIndex + 1)
lib/CodeGen/AsmPrinter/WinException.cpp 723 OS.EmitIntValue(FuncInfo.CxxUnwindMap.size(), 4);
729 OS.EmitIntValue(FuncInfo.TryBlockMap.size(), 4);
735 OS.EmitIntValue(IPToStateTable.size(), 4);
778 for (size_t I = 0, E = FuncInfo.TryBlockMap.size(); I != E; ++I) {
794 assert(TBME.CatchHigh < int(FuncInfo.CxxUnwindMap.size()) &&
807 OS.EmitIntValue(TBME.HandlerArray.size(), 4);
820 for (size_t I = 0, E = FuncInfo.TryBlockMap.size(); I != E; ++I) {
1109 int NumStates = FuncInfo.ClrEHUnwindMap.size();
1220 OS.EmitIntValue(Clauses.size(), 4);
lib/CodeGen/CallingConvLower.cpp 88 unsigned NumArgs = Ins.size();
103 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
117 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
129 unsigned NumOps = Outs.size();
147 unsigned NumOps = ArgVTs.size();
165 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
203 unsigned NumLocs = Locs.size();
225 assert(NumLocs < Locs.size() && "CC assignment failed to add location");
226 for (unsigned I = NumLocs, E = Locs.size(); I != E; ++I)
274 if (RVLocs1.size() != RVLocs2.size())
274 if (RVLocs1.size() != RVLocs2.size())
276 for (unsigned I = 0, E = RVLocs1.size(); I != E; ++I) {
lib/CodeGen/CodeGenPrepare.cpp 1054 if (AllRelocateCalls.size() < 2)
2401 for (unsigned It = 0, EndIt = OriginalValues.size(); It != EndIt; ++It)
2884 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) {
2920 iterator end() { return PhiNodeSetIterator(this, NodeList.size()); }
2939 while (CurrentIndex < NodeList.size()) {
2954 assert(CurrentIndex < Set->NodeList.size() &&
2960 assert(CurrentIndex < Set->NodeList.size() &&
3160 if (AddrModes.size() == 0)
3164 if (AddrModes.size() == 1 || DifferentField == ExtAddrMode::NoField)
4081 unsigned OldSize = AddrModeInsts.size();
4200 unsigned OldSize = AddrModeInsts.size();
4279 unsigned OldSize = AddrModeInsts.size();
4287 ExtCost + (AddrModeInsts.size() - OldSize),
4327 unsigned OldSize = AddrModeInsts.size();
4588 for (unsigned i = 0, e = MemoryUses.size(); i != e; ++i) {
5534 SpeculativelyMovedExts.size() == 1)) {
6103 for (unsigned i = 0; i < Mask.size(); ++i) {
lib/CodeGen/DwarfEHPrepare.cpp 144 BitVector ResumeReachable(Resumes.size());
158 return Resumes.size();
166 for (size_t I = 0, E = Resumes.size(); I < E; ++I) {
lib/CodeGen/EarlyIfConversion.cpp 566 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
586 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
840 for (unsigned i = 0, e = IfConv.PHIs.size(); i != e; ++i) {
lib/CodeGen/ExecutionDomainFix.cpp 170 assert(unsigned(pred->getNumber()) < MBBOutRegsInfos.size() &&
212 assert(MBBNumber < MBBOutRegsInfos.size() &&
lib/CodeGen/ExpandMemCmp.cpp 119 uint64_t getNumLoads() const { return LoadSequence.size(); }
133 if (LoadSequence.size() + NumLoadsForThisSize > MaxNumLoads) {
222 assert(LoadSequence.size() <= Options.MaxNumLoads && "broken invariant");
226 (LoadSequence.empty() || LoadSequence.size() > 2)) {
232 OverlappingLoads.size() < LoadSequence.size())) {
232 OverlappingLoads.size() < LoadSequence.size())) {
237 assert(LoadSequence.size() <= Options.MaxNumLoads && "broken invariant");
lib/CodeGen/GCRootLowering.cpp 233 if (Roots.size())
lib/CodeGen/GlobalISel/CallLowering.cpp 138 assert(LLTs.size() == SrcRegs.size() && "Regs / types mismatch");
161 assert(LLTs.size() == DstRegs.size() && "Regs / types mismatch");
186 unsigned NumArgs = Args.size();
285 for (unsigned i = 0, e = Args.size(), j = 0; i != e; ++i, ++j) {
286 assert(j < ArgLocs.size() && "Skipped too many arg locs");
305 unsigned NumArgRegs = Args[i].Regs.size();
309 assert((j + (NumArgRegs - 1)) < ArgLocs.size() &&
343 assert((j + (Args[i].Regs.size() - 1)) < ArgLocs.size() &&
343 assert((j + (Args[i].Regs.size() - 1)) < ArgLocs.size() &&
346 for (unsigned Part = 0; Part < Args[i].Regs.size(); ++Part) {
351 j += Args[i].Regs.size() - 1;
358 if (Args[i].Regs.size() > 1) {
383 for (unsigned i = 0, e = Args.size(); i < e; ++i) {
424 if (ArgLocs1.size() != ArgLocs2.size())
424 if (ArgLocs1.size() != ArgLocs2.size())
428 for (unsigned i = 0, e = ArgLocs1.size(); i < e; ++i) {
lib/CodeGen/GlobalISel/IRTranslator.cpp 168 for (unsigned i = 0; i < SplitTys.size(); ++i)
207 assert(SplitTys.size() == 1 && "unexpectedly split LLT");
975 for (unsigned i = 0; i < DstRegs.size(); ++i)
991 for (unsigned i = 0; i < DstRegs.size(); ++i) {
1761 assert(Tys.size() == 2 && "Only two-valued landingpads are supported");
2086 return SplitTys.size() > 1;
lib/CodeGen/GlobalISel/LegalizerHelper.cpp 1247 if (static_cast<int>(Unmerges.size()) != NumMerge * WideSize) {
1249 for (int I = Unmerges.size(); I != NumMerge * WideSize; ++I)
2476 assert(NewInsts.size() == PartRegs.size() + LeftoverRegs.size());
2476 assert(NewInsts.size() == PartRegs.size() + LeftoverRegs.size());
2476 assert(NewInsts.size() == PartRegs.size() + LeftoverRegs.size());
2482 for (unsigned J = 0, JE = PartRegs.size(); J != JE; ++J)
2484 for (unsigned J = 0, JE = LeftoverRegs.size(); J != JE; ++J)
2885 NumParts = NarrowRegs.size();
2886 NumLeftover = NarrowLeftoverRegs.size();
3355 unsigned DstParts = DstRegs.size();
3392 for (unsigned i = 2; i < Factors.size(); ++i) {
3402 for (unsigned i = 2; i < Factors.size(); ++i)
3577 assert(DstRegs.size() == (unsigned)NumParts && "not all parts covered");
3608 for (unsigned I = 0, E = Src1Regs.size(); I != E; ++I) {
3614 for (unsigned I = 0, E = Src1LeftoverRegs.size(); I != E; ++I) {
3655 for (unsigned I = 0, E = Src1Regs.size(); I != E; ++I) {
3661 for (unsigned I = 0, E = Src1LeftoverRegs.size(); I != E; ++I) {
4121 assert(Mask.size() == 1 && "Expected a single mask element");
lib/CodeGen/GlobalISel/LegalizerInfo.cpp 289 for (unsigned TypeIdx = 0; TypeIdx != SpecifiedActions[OpcodeIdx].size();
319 if (TypeIdx < ScalarSizeChangeStrategies[OpcodeIdx].size() &&
362 if (TypeIdx < VectorElementSizeChangeStrategies[OpcodeIdx].size() &&
635 if (Aspect.Idx >= Actions.size())
656 if (TypeIdx >= ScalarInVectorActions[OpcodeIdx].size())
lib/CodeGen/GlobalISel/MachineIRBuilder.cpp 586 assert(TmpVec.size() > 1);
596 assert(TmpVec.size() > 1);
615 assert(TmpVec.size() > 1);
lib/CodeGen/GlobalISel/RegisterBankInfo.cpp 666 StartIdx = NewVRegs.size();
685 assert((NewVRegs.size() == StartIdx + NumVal ||
686 NewVRegs.size() > StartIdx + NumVal) &&
688 return NewVRegs.size() <= StartIdx + NumVal ? NewVRegs.end()
lib/CodeGen/GlobalMerge.cpp 230 BitVector AllGlobals(Globals.size());
266 UsedGlobalSets.emplace_back(Globals.size());
294 for (size_t GI = 0, GE = Globals.size(); GI != GE; ++GI) {
398 BitVector AllGlobals(Globals.size());
415 BitVector PickedGlobals(Globals.size());
439 assert(Globals.size() > 1);
651 if (P.second.size() > 1)
655 if (P.second.size() > 1)
660 if (P.second.size() > 1)
lib/CodeGen/IfConversion.cpp 894 if (TrueBBI.BrCond.size() == 0 ||
895 FalseBBI.BrCond.size() == 0)
1032 BBI.IsBrReversible = (RevCond.size() == 0) ||
1036 if (BBI.BrCond.size()) {
1175 if (BBI.Predicate.size() && !BBI.IsBrAnalyzable)
1180 if (BBI.Predicate.size() && !TII->SubsumesPredicate(Pred, BBI.Predicate))
1183 if (!hasCommonTail && BBI.BrCond.size()) {
lib/CodeGen/ImplicitNullChecks.cpp 585 if (!canHandle(&MI) || InstsSeenSoFar.size() >= MaxInstsToConsider)
lib/CodeGen/IndirectBrExpandPass.cpp 144 int BBIndex = BBs.size() + 1;
185 if (IndirectBrs.size() == 1) {
196 auto *SwitchPN = PHINode::Create(CommonITy, IndirectBrs.size(),
211 auto *SI = SwitchInst::Create(SwitchValue, BBs[0], BBs.size(), SwitchBB);
214 for (int i : llvm::seq<int>(1, BBs.size()))
lib/CodeGen/InlineSpiller.cpp 686 LLVM_DEBUG(dbgs() << "Remat created " << DeadDefs.size() << " dead defs.\n");
709 LLVM_DEBUG(dbgs() << RegsToSpill.size()
1087 LLVM_DEBUG(dbgs() << "Eliminating " << DeadDefs.size() << " dead defs\n");
1301 } while (idx != Orders.size());
1302 assert(Orders.size() == WorkSet.size() &&
1306 LLVM_DEBUG(dbgs() << "Orders size is " << Orders.size() << "\n");
1518 NumSpills -= SpillsToRm.size();
lib/CodeGen/InterferenceCache.cpp 125 unsigned i = 0, e = RegUnits.size();
142 for (unsigned i = 0, e = RegUnits.size(); i != e; ++i) {
148 for (unsigned i = 0, e = RegUnits.size(); i != e; ++i) {
168 for (unsigned i = 0, e = RegUnits.size(); i != e; ++i) {
180 for (unsigned i = 0, e = RegUnits.size(); i != e; ++i) {
219 for (unsigned i = 0, e = RegUnits.size(); i != e; ++i) {
235 for (unsigned i = 0, e = RegUnits.size(); i != e; ++i) {
lib/CodeGen/InterleavedAccessPass.cpp 324 for (unsigned i = 1; i < Shuffles.size(); i++) {
384 for (unsigned I = 0; I < Indices.size(); ++I)
lib/CodeGen/InterleavedLoadCombinePass.cpp 528 if (B.size() != o.B.size())
528 if (B.size() != o.B.size())
lib/CodeGen/LexicalScopes.cpp 334 for (unsigned i = 0, e = Children.size(); i != e; ++i)
lib/CodeGen/LiveDebugVariables.cpp 232 for (unsigned i = 0, e = locations.size(); i != e; ++i)
238 for (unsigned i = 0, e = locations.size(); i != e; ++i)
250 return locations.size() - 1;
540 for (unsigned i = 0, e = locations.size(); i != e; ++i) {
567 for (unsigned i = 0, e = locations.size(); i != e; ++i)
805 LLVM_DEBUG(dbgs() << "Got " << CopyValues.size() << " copies of " << *LI
809 for (unsigned i = 0, e = Kills.size(); i != e; ++i) {
811 for (unsigned j = 0, e = CopyValues.size(); j != e; ++j) {
844 for (unsigned i = 0; i != Defs.size(); ++i) {
950 for (unsigned i = 0, e = userValues.size(); i != e; ++i) {
1120 for (unsigned i = locations.size(); i ; --i) {
1165 SmallVector<unsigned, 4> LocNoMap(locations.size());
1166 for (unsigned I = 0, E = locations.size(); I != E; ++I) {
lib/CodeGen/LiveInterval.cpp 539 VNI->id = (unsigned)valnos.size();
651 unsigned NumNewVals = NewVNInfo.size();
1066 assert(I->valno->id < valnos.size());
1145 for (unsigned I = 0, E = Spills.size(); I != E; ++I)
1257 size_t NumMoved = std::min(Spills.size(), GapSize);
1294 if (GapSize < Spills.size()) {
1297 LR->segments.insert(ReadI, Spills.size() - GapSize, LiveRange::Segment());
1302 LR->segments.erase(WriteI + Spills.size(), ReadI);
1304 ReadI = WriteI + Spills.size();
1388 unsigned NumValNos = SR.valnos.size();
lib/CodeGen/LiveIntervalUnion.cpp 120 if (SeenAllInterferences || InterferingVRegs.size() >= MaxInterferingRegs)
121 return InterferingVRegs.size();
151 if (InterferingVRegs.size() >= MaxInterferingRegs)
152 return InterferingVRegs.size();
157 return InterferingVRegs.size();
178 return InterferingVRegs.size();
lib/CodeGen/LiveIntervals.cpp 158 for (unsigned Unit = 0, UnitE = RegUnitRanges.size(); Unit != UnitE; ++Unit)
217 RMB.first = RegMaskSlots.size();
245 RMB.second = RegMaskSlots.size() - RMB.first;
343 LLVM_DEBUG(dbgs() << "Created " << NewRanges.size() << " new intervals.\n");
lib/CodeGen/LiveRangeCalc.cpp 361 for (unsigned i = 0; i != WorkList.size(); ++i) {
430 if (WorkList.size() > 4)
466 LiveIn.reserve(WorkList.size());
lib/CodeGen/LiveRangeEdit.cpp 383 for (unsigned i = 0, e = RegsToErase.size(); i != e; ++i) {
lib/CodeGen/LiveVariables.cpp 541 for (unsigned i = 0, e = UseRegs.size(); i != e; ++i) {
550 for (unsigned i = 0, e = RegMasks.size(); i != e; ++i)
554 for (unsigned i = 0, e = DefRegs.size(); i != e; ++i) {
lib/CodeGen/LocalStackSlotAllocation.cpp 346 for (int ref = 0, e = FrameReferenceInsns.size(); ref < e ; ++ref) {
lib/CodeGen/LoopTraversal.cpp 17 assert(MBBNumber < MBBInfos.size() && "Unexpected basic block number.");
36 assert(MBBNumber < MBBInfos.size() && "Unexpected basic block number.");
48 assert(SuccNumber < MBBInfos.size() &&
lib/CodeGen/MIRParser/MIParser.cpp 2325 VectorType *VT = VectorType::get(I32Ty, ShufMask.size());
lib/CodeGen/MIRPrinter.cpp 581 SmallVector<BranchProbability,8> Equal(Normalized.size());
600 if (GuessedSuccs.size() != MBB.succ_size())
lib/CodeGen/MachineBlockPlacement.cpp 776 if (SuccSuccs.size() == 0)
896 if (BB->succ_size() != 2 || ViableSuccs.size() != 2)
998 if (Successors.size() != 2 || ViableSuccs.size() != 2)
lib/CodeGen/MachineCSE.cpp 320 for (unsigned i = 0, e = PhysDefs.size(); i != e; ++i)
343 for (unsigned i = 0, e = PhysDefs.size(); i != e; ++i) {
lib/CodeGen/MachineCombiner.cpp 181 assert(II->second < InstrDepth.size() && "Bad Index");
203 unsigned NewRootIdx = InsInstrs.size() - 1;
282 for (unsigned i = 0; i < InsInstrs.size() - 1; i++)
552 unsigned NewInstCount = InsInstrs.size();
553 unsigned OldInstCount = DelInstrs.size();
lib/CodeGen/MachineDominators.cpp 95 SmallBitVector IsNewIDom(CriticalEdgesToSplit.size(), true);
lib/CodeGen/MachineFunction.cpp 732 for (unsigned j = 0, e = LandingPads[i].BeginLabels.size(); j != e; ++j) {
lib/CodeGen/MachineInstr.cpp 1106 unsigned CurGroup = GroupIdx.size();
lib/CodeGen/MachineInstrBundle.cpp 178 for (unsigned i = 0, e = Defs.size(); i != e; ++i) {
210 for (unsigned i = 0, e = LocalDefs.size(); i != e; ++i) {
220 for (unsigned i = 0, e = ExternUses.size(); i != e; ++i) {
lib/CodeGen/MachineLICM.cpp 718 if (Scopes.size() == 0)
1316 assert(NewMIs.size() == 2 &&
1390 for (unsigned i = 0, e = Defs.size(); i != e; ++i) {
lib/CodeGen/MachinePipeliner.cpp 832 for (int i = 0, e = RemoveDeps.size(); i != e; ++i)
875 for (int i = 0, e = Deps.size(); i != e; i++) {
884 for (int i = 0, e = Deps.size(); i != e; i++) {
1074 int Resmii = Resources.size();
1311 if (PHISUs.size() == 0 || SrcSUs.size() == 0)
1311 if (PHISUs.size() == 0 || SrcSUs.size() == 0)
1332 if (UseSUs.size() == 0)
1630 for (int i = 0, e = NodeSets.size(); i < e; ++i) {
1830 } else if (NodeSets.size() == 1) {
1832 if (N->Succs.size() == 0)
2410 for (unsigned i = 0, e = (unsigned)SU->Preds.size(); i != e; ++i) {
2434 for (unsigned i = 0, e = (unsigned)SU->Succs.size(); i != e; ++i) {
lib/CodeGen/MachineSSAUpdater.cpp 93 for (unsigned i = 0, e = PredValues.size(); i != e; ++i)
193 for (unsigned i = 0, e = PredValues.size(); i != e; ++i)
lib/CodeGen/MachineScheduler.cpp 1565 if (MemOpRecords.size() < 2)
1570 for (unsigned Idx = 0, End = MemOpRecords.size(); Idx < (End - 1); ++Idx) {
1616 unsigned NumChains = StoreChainDependents.size();
3266 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1)
3266 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1)
3695 return (Node->Preds.size() > ViewMISchedCutoff
3696 || Node->Succs.size() > ViewMISchedCutoff);
lib/CodeGen/MachineTraceMetrics.cpp 148 assert((MBBNum+1) * PRKinds <= ProcResourceCycles.size());
158 BlockInfo.resize(MTM.BlockInfo.size());
160 ProcResourceDepths.resize(MTM.BlockInfo.size() * PRKinds);
161 ProcResourceHeights.resize(MTM.BlockInfo.size() * PRKinds);
266 assert((MBBNum+1) * PRKinds <= ProcResourceDepths.size());
279 assert((MBBNum+1) * PRKinds <= ProcResourceHeights.size());
409 assert(BlockInfo.size() == MF->getNumBlockIDs() && "Outdated BlockInfo size");
587 assert(BlockInfo.size() == MTM.MF->getNumBlockIDs() &&
589 for (unsigned Num = 0, e = BlockInfo.size(); Num != e; ++Num) {
932 for (unsigned i = 0, e = ReadOps.size(); i != e; ++i) {
1185 assert(Deps.size() == 1 && "PHI doesn't have MBB as a predecessor");
1290 for (unsigned i = 0, e = BlockInfo.size(); i != e; ++i) {
lib/CodeGen/MachineVerifier.cpp 933 Types.resize(std::max(TypeIdx + 1, Types.size()));
1441 if (static_cast<int>(MaskIdxes.size()) != DstNumElts)
lib/CodeGen/ModuloSchedule.cpp 324 if (EpilogBBs.size() > 0) {
853 assert(PrologBBs.size() == EpilogBBs.size() && "Prolog/Epilog mismatch");
853 assert(PrologBBs.size() == EpilogBBs.size() && "Prolog/Epilog mismatch");
860 unsigned MaxIter = PrologBBs.size() - 1;
1413 LLVM_DEBUG(dbgs() << " -- padding defaults array from " << Defaults.size()
1414 << " to " << (Defaults.size() + StageDiff) << "\n");
1418 Defaults.resize(Defaults.size() + StageDiff, Defaults.empty()
1552 return PhiDefaults.size() == Other.PhiDefaults.size();
1552 return PhiDefaults.size() == Other.PhiDefaults.size();
1556 OS << "use of " << *Source << ": distance(" << PhiDefaults.size() << ") in "
1634 assert(Prologs.size() == Epilogs.size());
1634 assert(Prologs.size() == Epilogs.size());
lib/CodeGen/ParallelCG.cpp 71 BCOSs[ThreadCount]->write(BC.begin(), BC.size());
81 MemoryBufferRef(StringRef(BC.data(), BC.size()),
lib/CodeGen/PeepholeOptimizer.cpp 316 int getNumSources() const { return RegSrcs.size(); }
571 for (unsigned i = 0, e = Uses.size(); i != e; ++i) {
1509 if (RC.size() >= MaxRecurrenceChain)
lib/CodeGen/ReachingDefAnalysis.cpp 27 assert(MBBNumber < MBBReachingDefs.size() &&
56 assert(unsigned(pred->getNumber()) < MBBOutRegsInfos.size() &&
81 assert(MBBNumber < MBBOutRegsInfos.size() &&
99 assert(MBBNumber < MBBReachingDefs.size() &&
178 assert(MBBNumber < MBBReachingDefs.size() &&
lib/CodeGen/RegAllocBasic.cpp 214 for (unsigned i = Q.interferingVRegs().size(); i; --i) {
226 for (unsigned i = 0, e = Intfs.size(); i != e; ++i) {
lib/CodeGen/RegAllocFast.cpp 1287 NumCoalesced += Coalesced.size();
lib/CodeGen/RegAllocGreedy.cpp 900 for (unsigned i = Q.interferingVRegs().size(); i; --i) {
979 for (unsigned i = Q.interferingVRegs().size(); i; --i) {
1074 for (unsigned i = 0, e = Intfs.size(); i != e; ++i) {
1342 if (ActiveBlocks.size() == AddedTo)
1355 AddedTo = ActiveBlocks.size();
1630 for (unsigned i = 0, e = Cand.ActiveBlocks.size(); i != e; ++i) {
1903 if (GlobalCand.size() <= NumCands)
2326 for (unsigned i = 0, e = RegMaskGaps.size(); i != e; ++i)
2441 for (unsigned i = 0, e = IntvMap.size(); i != e; ++i)
2544 for (unsigned i = Q.interferingVRegs().size(); i; --i) {
3098 unsigned NewVRegSizeBefore = NewVRegs.size();
3100 if (PhysReg || (NewVRegs.size() - NewVRegSizeBefore)) {
lib/CodeGen/RegisterClassInfo.cpp 129 RCI.NumRegs = N + CSRAlias.size();
133 for (unsigned i = 0, e = CSRAlias.size(); i != e; ++i) {
lib/CodeGen/RegisterCoalescer.cpp 1170 for (unsigned I = 0; I != EndPoints.size(); ) {
1467 for (unsigned i = 0, e = NewMIImplDefs.size(); i != e; ++i) {
1694 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
2765 Assignments[ValNo] = NewVNInfo.size();
2888 if (++TaintNum == TaintExtent.size())
3261 dbgs() << "\t\trestoring liveness to " << EndPoints.size() << " points: ";
3262 for (unsigned i = 0, n = EndPoints.size(); i != n; ++i) {
3292 if (LI.valnos.size() < LargeIntervalSizeThreshold)
3401 dbgs() << "\t\trestoring liveness to " << EndPoints.size() << " points: ";
3402 for (unsigned i = 0, n = EndPoints.size(); i != n; ++i) {
3575 const unsigned PrevSize = WorkList.size();
3628 for (unsigned j = 0, je = LocalWorkList.size(); j != je; ++j) {
3713 LLVM_DEBUG(dbgs() << "Trying to inflate " << InflateRegs.size()
3715 for (unsigned i = 0, e = InflateRegs.size(); i != e; ++i) {
lib/CodeGen/RegisterPressure.cpp 1051 assert(RegOpers.DeadDefs.size() == 0);
lib/CodeGen/RegisterScavenging.cpp 470 unsigned SI = Scavenged.size(), Diff = std::numeric_limits<unsigned>::max();
472 for (unsigned I = 0; I < Scavenged.size(); ++I) {
496 if (SI == Scavenged.size()) {
lib/CodeGen/RenameIndependentSubregs.cpp 123 if (LI.valnos.size() < 2)
170 if (SubRangeInfos.size() < 2)
273 unsigned NumValNos = SR.valnos.size();
304 for (size_t I = 0, E = Intervals.size(); I < E; ++I) {
317 for (unsigned I = 0; I < SR.valnos.size(); ++I) {
lib/CodeGen/SafeStackLayout.cpp 31 for (unsigned i = 0; i < Regions.size(); ++i) {
109 for (unsigned i = 0; i < Regions.size(); ++i) {
143 if (StackObjects.size() > 2)
lib/CodeGen/ScheduleDAG.cpp 366 if (SU.Preds.size() > 0) {
376 if (SU.Succs.size() > 0) {
482 unsigned Degree = SU.Succs.size();
540 Dirty = Dirty || Updates.size() > 10;
622 for (int I = SU->Succs.size()-1; I >= 0; --I) {
656 for (int I = SU->Preds.size()-1; I >= 0; --I) {
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 248 if (WorklistMap.insert(std::make_pair(N, Worklist.size())).second)
1735 for (unsigned i = 0; i < TFs.size(); ++i) {
1739 if (Ops.size() > TokenFactorInlineLimit) {
1740 for (unsigned j = i; j < TFs.size(); j++)
1780 for (unsigned i = 1, e = TFs.size(); i < e; i++)
1808 while (OrigOpNumber < Ops.size() && Ops[OrigOpNumber].getNode() != Op)
1810 assert((OrigOpNumber != Ops.size()) &&
1813 for (unsigned i = CurIdx + 1; i < Worklist.size(); ++i) {
1829 for (unsigned i = 0; i < Worklist.size() && i < 1024; ++i) {
4875 if (Loads.size() == 0)
6424 unsigned Width = ByteOffsets.size();
6488 unsigned Width = Stores.size();
9028 return ExtendNodes.size();
10750 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
11284 EVT VT = EVT::getVectorVT(*DAG.getContext(), DstEltVT, Ops.size());
13671 for (unsigned i = 0, e = OtherUses.size(); i != e; ++i) {
14500 unsigned NumberOfSlices = LoadedSlices.size();
14566 unsigned NumberOfSlices = LoadedSlices.size();
15101 assert(Chains.size() > 0 && "Chain should have generated a chain");
15527 if (StoreNodes.size() < 2)
15545 while (StoreNodes.size() > 1) {
15547 while ((StartIdx + 1 < StoreNodes.size()) &&
15553 if (StartIdx + 1 >= StoreNodes.size())
15565 for (unsigned i = 1, e = StoreNodes.size(); i < e; ++i) {
15799 while (NumConsecutiveStores >= 2 && LoadNodes.size() >= 2) {
15803 if (LoadNodes.size() == 2 &&
15829 for (unsigned i = 1; i < LoadNodes.size(); ++i) {
15921 while ((NumSkip < LoadNodes.size()) &&
16659 assert(Ops.size() == NumElts && "Unexpected vector size");
16662 if (Elt < Ops.size()) {
17143 assert(Index < Ops.size() && "Invalid index");
17426 if (Idx == VecIn.size())
17433 if (VecIn.size() < 2)
17441 if (VecIn.size() == 2) {
17502 for (unsigned In = 0, Len = (VecIn.size() / 2); In < Len; ++In) {
17506 (LeftIdx + 1) < VecIn.size() ? VecIn[LeftIdx + 1] : SDValue();
17522 if (Shuffles.size() == 1)
17528 Vec = Shuffles.size() - 1;
17544 if (Shuffles.size() % 2)
17547 for (unsigned CurSize = Shuffles.size(); CurSize > 1; CurSize /= 2) {
17955 assert(VT.getVectorNumElements() == Opnds.size() &&
20722 if (Aliases.size() == 0)
20726 if (Aliases.size() == 1)
20811 if (ChainedStores.size() == 0)
20818 for (unsigned I = ChainedStores.size(); I;) {
lib/CodeGen/SelectionDAG/FastISel.cpp 980 unsigned NumCallRegArgs = IsAnyRegCC ? NumArgs : CLI.OutRegs.size();
1152 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp 369 for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) {
418 assert(ValueVTs.size() == 1 &&
lib/CodeGen/SelectionDAG/LegalizeDAG.cpp 281 assert(NewMask.size() == NumDestElts && "Non-integer NumEltsGrowth?");
1830 while (IntermedVals.size() > 2) {
1832 for (unsigned i = 0, e = (IntermedVals.size() & ~1u); i < e; i += 2) {
1838 FinalIndices.reserve(IntermedVals[i].second.size() +
1839 IntermedVals[i+1].second.size());
1842 for (unsigned j = 0, f = IntermedVals[i].second.size(); j != f;
1847 for (unsigned j = 0, f = IntermedVals[i+1].second.size(); j != f;
1866 if ((IntermedVals.size() & 1) != 0)
1872 assert(IntermedVals.size() <= 2 && IntermedVals.size() > 0 &&
1872 assert(IntermedVals.size() <= 2 && IntermedVals.size() > 0 &&
1876 if (IntermedVals.size() > 1)
1882 for (unsigned i = 0, e = IntermedVals[0].second.size(); i != e; ++i)
1884 for (unsigned i = 0, e = IntermedVals[1].second.size(); i != e; ++i)
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 178 for (unsigned i = 0, e = NewNodes.size(); i != e; ++i) {
894 if (Results.size() == N->getNumValues() + 1 && LegalizeResult) {
904 assert(Results.size() == N->getNumValues() &&
906 for (unsigned i = 0, e = Results.size(); i != e; ++i) {
928 assert(Results.size() == N->getNumValues() &&
930 for (unsigned i = 0, e = Results.size(); i != e; ++i) {
lib/CodeGen/SelectionDAG/LegalizeTypesGeneric.cpp 128 for (unsigned e = Vals.size(); e - Slot > 2; Slot += 2, e += 1) {
393 EVT NewVecVT = EVT::getVectorVT(*DAG.getContext(), NewVT, NewElts.size());
lib/CodeGen/SelectionDAG/LegalizeVectorOps.cpp 1077 EVT ByteVT = EVT::getVectorVT(*DAG.getContext(), MVT::i8, ShuffleMask.size());
1104 EVT ByteVT = EVT::getVectorVT(*DAG.getContext(), MVT::i8, BSWAPMask.size());
lib/CodeGen/SelectionDAG/LegalizeVectorTypes.cpp 3196 if (Chains.size() == 1)
3424 while (Ops.size() != WidenNumElts)
3724 if (LdChain.size() == 1)
4448 if (StChain.size() == 1)
4860 unsigned End = LdOps.size();
lib/CodeGen/SelectionDAG/ResourcePriorityQueue.cpp 530 HorizontalVerticalBalance += (SU->Succs.size() - numberCtrlDepsInSU(SU));
531 HorizontalVerticalBalance -= (SU->Preds.size() - numberCtrlPredInSU(SU));
lib/CodeGen/SelectionDAG/ScheduleDAGFast.cpp 239 assert(NewNodes.size() == 2 && "Expected a load folding node!");
303 for (unsigned i = 0, e = LoadPreds.size(); i != e; ++i) {
310 for (unsigned i = 0, e = NodePreds.size(); i != e; ++i) {
315 for (unsigned i = 0, e = NodeSuccs.size(); i != e; ++i) {
323 for (unsigned i = 0, e = ChainSuccs.size(); i != e; ++i) {
371 for (unsigned i = 0, e = DelDeps.size(); i != e; ++i)
406 for (unsigned i = 0, e = DelDeps.size(); i != e; ++i) {
569 assert(LRegs.size() == 1 && "Can't handle this yet!");
615 for (unsigned i = 0, e = NotReady.size(); i != e; ++i) {
741 for (unsigned i = 0, e = Glues.size(); i != e; ++i) {
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp 989 if (NewNodes.size() == 3)
992 assert(NewNodes.size() == 2 && "Expected a load folding node!");
1436 for (unsigned i = Interferences.size(); i > 0; --i) {
1452 if (i < Interferences.size())
1553 assert(LRegs.size() == 1 && "Can't handle this yet!");
1960 for (unsigned P = Temp.PredsProcessed; P < TempSU->Preds.size(); ++P) {
2267 if (PredSU->NumSuccsLeft != PredSU->Succs.size())
3029 for (unsigned i = 0; i != PredSU->Succs.size(); ++i) {
3091 while (SuccSU->Succs.size() == 1 &&
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 271 for (unsigned i = 1, e = Offsets.size(); i != e; ++i) {
289 for (unsigned I = 1, E = Loads.size(); I != E; ++I) {
950 for (unsigned i = 0, e = Orders.size(); i != e && DI != DE; ++i) {
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 4871 assert(VT.getVectorNumElements() == Outputs.size() &&
5748 assert(OutLoadChains.size() && "Missing loads in memcpy inlining");
5749 assert(OutStoreChains.size() && "Missing stores in memcpy inlining");
5910 unsigned NumLdStInMemcpy = OutStoreChains.size();
8490 for (unsigned UseIndex = 0, UseIndexEnd = Uses.size();
9587 while (Vals.size() > Limit) {
9588 unsigned SliceIdx = Vals.size() - Limit;
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 773 RegCount(1, regs.size()), CallConv(CC) {}
810 SmallVector<SDValue, 4> Values(ValueVTs.size());
812 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
894 unsigned NumRegs = Regs.size();
896 for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) {
948 unsigned Flag = InlineAsm::getFlagWord(Code, Regs.size());
969 assert(Regs.size() == RegVTs.size() && Regs.size() == ValueVTs.size() &&
969 assert(Regs.size() == RegVTs.size() && Regs.size() == ValueVTs.size() &&
969 assert(Regs.size() == RegVTs.size() && Regs.size() == ValueVTs.size() &&
969 assert(Regs.size() == RegVTs.size() && Regs.size() == ValueVTs.size() &&
973 for (unsigned I = 0, E = ValueVTs.size(); I != E; ++I) {
983 for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) {
987 assert(Reg < Regs.size() && "Mismatch in # registers expected");
1038 if (PendingLoads.size() == 1) {
1060 unsigned i = 0, e = PendingExports.size();
1509 unsigned NumElts = ValueVTs.size();
1697 assert(UnwindDests.size() <= 1 &&
1804 unsigned NumValues = ValueVTs.size();
1825 unsigned NumValues = ValueVTs.size();
2634 for (unsigned i = 0, e = B.Cases.size(); i != e; ++i)
2881 assert(ValueVTs.size() == 2 && "Only two-valued landingpads are supported");
3254 unsigned NumValues = ValueVTs.size();
3566 unsigned MaskNumElts = Mask.size();
3762 unsigned NumAggValues = AggValueVTs.size();
3763 unsigned NumValValues = ValValueVTs.size();
3812 unsigned NumValValues = ValValueVTs.size();
4037 unsigned NumValues = ValueVTs.size();
4135 assert(ValueVTs.size() == 1 && Offsets[0] == 0 &&
4173 assert(ValueVTs.size() == 1 && Offsets[0] == 0 &&
4210 unsigned NumValues = ValueVTs.size();
5507 if (ArgRegsAndSizes.size() == 1)
5563 } else if (ArgRegsAndSizes.size() > 1) {
8501 assert(ResultValues.size() == ResultTypes.size() &&
8532 for (unsigned i = 0, e = ValueVTs.size(); i != e; ++i)
8862 assert(ValueVTs.size() == 1 && "Expected only one return value type.");
9003 for (size_t i = 0, e = OldRetTys.size(); i != e; ++i) {
9060 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
9064 if (I == RetTys.size() - 1)
9120 for (unsigned Value = 0, NumValues = ValueVTs.size(); Value != NumValues;
9216 RetTys.size() == NumValues && "unexpected use of 'returned'");
9254 CLI.Outs[CLI.Outs.size() - 1].Flags.setInConsecutiveRegsLast();
9269 assert((CLI.IsTailCall || InVals.size() == CLI.Ins.size()) &&
9269 assert((CLI.IsTailCall || InVals.size() == CLI.Ins.size()) &&
9282 for (unsigned i = 0, e = CLI.Ins.size(); i != e; ++i) {
9297 assert(PVTs.size() == 1 && "Pointers should fit in one register");
9300 unsigned NumValues = RetTys.size();
9332 for (unsigned I = 0, E = RetTys.size(); I != E; ++I) {
9622 for (unsigned Value = 0, NumValues = ValueVTs.size();
9722 Ins[Ins.size() - 1].Flags.setInConsecutiveRegsLast();
9735 assert(InVals.size() == Ins.size() &&
9735 assert(InVals.size() == Ins.size() &&
9738 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
9784 unsigned NumValues = ValueVTs.size();
9903 assert(i == InVals.size() && "Argument register count mismatch!");
9987 for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) {
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.h 854 RegCount.push_back(RHS.Regs.size());
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 570 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
1788 for (unsigned j = 0, ej = BTB.Cases.size(); j != ej; ++j) {
1847 for (unsigned j = 0, ej = BTB.Cases.size();
1928 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
2294 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
2350 if (ChainNodesMatched.size() == 1)
2378 if (InputChains.size() == 0)
2393 if (InputChains.size() == 1)
2467 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2930 NewEntry.NumRecordedNodes = RecordedNodes.size();
2931 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
2941 if (NodeStack.size() > 1)
2942 Parent = NodeStack[NodeStack.size()-2].getNode();
3038 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
3177 assert(NodeStack.size() != 1 && "No parent node");
3181 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
3190 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
3192 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
3234 assert(RecNo < RecordedNodes.size() && "Invalid EmitConvertToTarget");
3262 assert(RecNo < RecordedNodes.size() && "Invalid EmitMergeInputChains");
3299 assert(RecNo < RecordedNodes.size() && "Invalid EmitMergeInputChains");
3327 assert(RecNo < RecordedNodes.size() && "Invalid EmitCopyToReg");
3346 assert(RecNo < RecordedNodes.size() && "Invalid EmitNodeXForm");
3394 if (VTs.size() == 1)
3396 else if (VTs.size() == 2)
3409 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
3447 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
3470 InputGlue = SDValue(Res, VTs.size()-1);
3472 InputChain = SDValue(Res, VTs.size()-2);
3474 InputChain = SDValue(Res, VTs.size()-1);
3533 assert(ResSlot < RecordedNodes.size() && "Invalid CompleteMatch");
3590 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
lib/CodeGen/SelectionDAG/StatepointLowering.cpp 82 AllocatedStackSlots.resize(Builder.FuncInfo.StatepointStackSlots.size());
109 Builder.FuncInfo.StatepointStackSlots.size() &&
132 Builder.FuncInfo.StatepointStackSlots.size() &&
136 Builder.FuncInfo.StatepointStackSlots.size());
285 for (size_t i = 0, e = Ptrs.size(); i < e; i++) {
300 assert(Bases.size() >= NewBases.size());
300 assert(Bases.size() >= NewBases.size());
301 assert(Ptrs.size() >= NewPtrs.size());
301 assert(Ptrs.size() >= NewPtrs.size());
302 assert(Relocs.size() >= NewRelocs.size());
302 assert(Relocs.size() >= NewRelocs.size());
306 assert(Ptrs.size() == Bases.size());
306 assert(Ptrs.size() == Bases.size());
307 assert(Ptrs.size() == Relocs.size());
307 assert(Ptrs.size() == Relocs.size());
504 assert(SI.Bases.size() == SI.Ptrs.size() && "Pointer without base!");
504 assert(SI.Bases.size() == SI.Ptrs.size() && "Pointer without base!");
537 for (unsigned i = 0; i < SI.Bases.size(); ++i) {
570 for (unsigned i = 0; i < SI.Bases.size(); ++i) {
658 assert(SI.Bases.size() == SI.Ptrs.size() &&
658 assert(SI.Bases.size() == SI.Ptrs.size() &&
659 SI.Ptrs.size() == SI.GCRelocates.size());
659 SI.Ptrs.size() == SI.GCRelocates.size());
lib/CodeGen/SelectionDAG/TargetLowering.cpp 78 for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
5081 assert(Built.size() <= 7 && "Max size prediction failed.");
5778 assert(Result.size() == 2);
lib/CodeGen/SjLjEHPrepare.cpp 378 NumInvokes += Invokes.size();
416 for (unsigned I = 0, E = Invokes.size(); I != E; ++I) {
lib/CodeGen/SlotIndexes.cpp 250 for (unsigned i = 0, e = MBBRanges.size(); i != e; ++i)
lib/CodeGen/SplitKit.cpp 204 LLVM_DEBUG(dbgs() << "Analyze counted " << UseSlots.size() << " instrs in "
205 << UseBlocks.size() << " blocks, through "
849 LLVM_DEBUG(dbgs() << "Removing " << Copies.size() << " back-copies.\n");
853 for (unsigned i = 0, e = Copies.size(); i != e; ++i) {
1549 assert(!LRMap || LRMap->size() == Edit->size());
lib/CodeGen/StackColoring.cpp 559 for (unsigned I = 0, E = Intervals.size(); I != E; ++I) {
712 BasicBlocks[MBB] = BasicBlockNumbering.size();
727 assert(slots.size() == 1 && "unexpected: MI ends multiple slots");
1262 int OldSize = FirstS.size();
lib/CodeGen/StackMaps.cpp 183 OS << WSMP << " has " << CSLocs.size() << " locations\n";
229 OS << WSMP << "\thas " << LiveOuts.size() << " live-out registers\n";
503 if (CSLocs.size() > UINT16_MAX || LiveOuts.size() > UINT16_MAX) {
503 if (CSLocs.size() > UINT16_MAX || LiveOuts.size() > UINT16_MAX) {
519 OS.EmitIntValue(CSLocs.size(), 2);
535 OS.EmitIntValue(LiveOuts.size(), 2);
lib/CodeGen/StackSlotColoring.cpp 247 NextColors.resize(AllColors.size());
250 for (unsigned I = 0, E = AllColors.size(); I != E; ++I)
259 for (unsigned i = 0, e = OtherLIs.size(); i != e; ++i) {
362 for (unsigned SS = 0, SE = SSRefs.size(); SS != SE; ++SS) {
369 for (unsigned i = 0, e = RefMMOs.size(); i != e; ++i)
381 for (int StackID = 0, E = AllColors.size(); StackID != E; ++StackID) {
519 for (unsigned i = 0, e = SSRefs.size(); i != e; ++i)
526 for (unsigned i = 0, e = Assignments.size(); i != e; ++i)
lib/CodeGen/SwiftErrorValueTracking.cpp 204 VRegs.size() >= 1 &&
lib/CodeGen/TailDuplicator.cpp 186 for (unsigned i = 0, e = SSAUpdateVRs.size(); i != e; ++i) {
234 for (unsigned i = 0, e = Copies.size(); i != e; ++i) {
248 if (NewPHIs.size())
249 NumAddedPHIs += NewPHIs.size();
522 for (unsigned j = 0, ee = TDBBs.size(); j != ee; ++j) {
lib/CodeGen/TargetInstrInfo.cpp 353 size_t StartSize = Accesses.size();
361 return Accesses.size() != StartSize;
367 size_t StartSize = Accesses.size();
375 return Accesses.size() != StartSize;
lib/CodeGen/TargetLoweringBase.cpp 1469 unsigned NumValues = ValueVTs.size();
1881 unsigned NumArgs = OverrideVector.size();
1941 unsigned NumArgs = OverrideVector.size();
lib/CodeGen/TwoAddressInstructionPass.cpp 1152 for (unsigned i = 0, e = OtherDefs.size(); i != e; ++i) {
1372 assert(NewMIs.size() == 2 &&
1506 for (unsigned tpi = 0, tpe = TiedPairs.size(); tpi != tpe; ++tpi) {
1517 for (unsigned tpi = 0, tpe = TiedPairs.size(); tpi != tpe; ++tpi) {
1739 if (TiedPairs.size() == 1) {
lib/CodeGen/VirtRegMap.cpp 434 for (int E = MIs.size(), PrevE = E; E > 1; PrevE = E) {
lib/CodeGen/WinEHPrepare.cpp 323 return FuncInfo.SEHUnwindMap.size() - 1;
334 return FuncInfo.SEHUnwindMap.size() - 1;
473 return FuncInfo.ClrEHUnwindMap.size() - 1;
lib/DebugInfo/CodeView/AppendingTypeTableBuilder.cpp 31 return TypeIndex::fromArrayIndex(SeenRecords.size());
64 return Index.toArrayIndex() < SeenRecords.size();
67 uint32_t AppendingTypeTableBuilder::size() { return SeenRecords.size(); }
69 uint32_t AppendingTypeTableBuilder::capacity() { return SeenRecords.size(); }
lib/DebugInfo/CodeView/ContinuationRecordBuilder.cpp 225 Types.reserve(SegmentOffsets.size());
lib/DebugInfo/CodeView/GlobalTypeTableBuilder.cpp 31 return TypeIndex::fromArrayIndex(SeenRecords.size());
67 return Index.toArrayIndex() < SeenRecords.size();
70 uint32_t GlobalTypeTableBuilder::size() { return SeenRecords.size(); }
72 uint32_t GlobalTypeTableBuilder::capacity() { return SeenRecords.size(); }
lib/DebugInfo/CodeView/MergingTypeTableBuilder.cpp 31 return TypeIndex::fromArrayIndex(SeenRecords.size());
67 return Index.toArrayIndex() < SeenRecords.size();
70 uint32_t MergingTypeTableBuilder::size() { return SeenRecords.size(); }
72 uint32_t MergingTypeTableBuilder::capacity() { return SeenRecords.size(); }
lib/DebugInfo/CodeView/TypeStreamMerger.cpp 71 CurIndex += SourceToDest.size();
222 assert(IndexMap.size() == slotForIndex(CurIndex) &&
226 assert(slotForIndex(CurIndex) < IndexMap.size());
395 assert((IsSecondPass || IndexMap.size() == slotForIndex(CurIndex)) &&
lib/DebugInfo/DWARF/DWARFAbbreviationDeclaration.cpp 143 for (uint32_t i = 0, e = AttributeSpecs.size(); i != e; ++i) {
lib/DebugInfo/DWARF/DWARFAcceleratorTable.cpp 212 W.printNumber("Number of atoms", uint64_t(HdrData.Atoms.size()));
262 Values.reserve(HdrData.Atoms.size());
279 assert(HdrData->Atoms.size() == Values.size());
279 assert(HdrData->Atoms.size() == Values.size());
533 assert(Abbr->Attributes.size() == Values.size());
567 assert(Abbr->Attributes.size() == Values.size());
882 if (CUToNameIndex.size() == 0 && NameIndices.size() > 0) {
lib/DebugInfo/DWARF/DWARFContext.cpp 1170 if (InlinedChain.size() == 0) {
1185 for (uint32_t i = 0, n = InlinedChain.size(); i != n; i++) {
lib/DebugInfo/DWARF/DWARFDebugFrame.cpp 282 for (unsigned i = 0; i < Instr.Ops.size(); ++i)
lib/DebugInfo/DWARF/DWARFGdbIndex.cpp 28 CuListOffset, (uint64_t)CuList.size())
38 TuListOffset, TuList.size());
48 AddressAreaOffset, (uint64_t)AddressArea.size())
60 SymbolTableOffset, (uint64_t)SymbolTable.size())
88 ConstantPoolOffset, (uint64_t)ConstantPoolVectors.size());
lib/ExecutionEngine/ExecutionEngine.cpp 157 for (unsigned i = 0, e = Modules.size(); i != e; ++i) {
166 for (unsigned i = 0, e = Modules.size(); i != e; ++i) {
320 for (unsigned i = 0, e = Modules.size(); i != e; ++i)
1195 if (Modules.size() != 1) {
1196 for (unsigned m = 0, e = Modules.size(); m != e; ++m) {
1226 for (unsigned m = 0, e = Modules.size(); m != e; ++m) {
lib/ExecutionEngine/JITLink/MachOLinkGraphBuilder.cpp 462 << BlockSyms.size() << " symbol(s)...\n";
lib/ExecutionEngine/Orc/SpeculateAnalyses.cpp 107 assert(IBBs.size() == BBFreqs.size() && "BB Count Mismatch");
107 assert(IBBs.size() == BBFreqs.size() && "BB Count Mismatch");
116 auto Topk = numBBToGet(BBFreqs.size());
144 assert(RearrangedBBSet.size() == BBList.size() &&
144 assert(RearrangedBBSet.size() == BBList.size() &&
259 HotBlocksRef.drop_back(BBFreqs.size() - getHottestBlocks(BBFreqs.size()));
259 HotBlocksRef.drop_back(BBFreqs.size() - getHottestBlocks(BBFreqs.size()));
lib/ExecutionEngine/Orc/ThreadSafeModule.cpp 52 StringRef(ClonedModuleBuffer.data(), ClonedModuleBuffer.size()),
lib/ExecutionEngine/RuntimeDyld/RuntimeDyld.cpp 127 LLVM_DEBUG(for (int i = 0, e = Sections.size(); i != e; ++i)
139 LLVM_DEBUG(for (int i = 0, e = Sections.size(); i != e; ++i)
161 for (unsigned i = 0, e = Sections.size(); i != e; ++i) {
725 unsigned SectionID = Sections.size();
806 unsigned SectionID = Sections.size();
1061 for (unsigned i = 0, e = Relocs.size(); i != e; ++i) {
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldELF.cpp 229 for (int i = 0, e = UnregisteredEHFrameSections.size(); i != e; ++i) {
1807 GOTSectionID = Sections.size();
lib/ExecutionEngine/RuntimeDyld/RuntimeDyldMachO.cpp 320 for (int i = 0, e = UnregisteredEHFrameSections.size(); i != e; ++i) {
lib/ExecutionEngine/SectionMemoryManager.cpp 79 FreeMB.PendingPrefixIndex = MemGroup.PendingMem.size() - 1;
lib/ExecutionEngine/TargetSelect.cpp 81 for (unsigned i = 0; i != MAttrs.size(); ++i)
lib/FuzzMutate/IRMutator.cpp 110 if (Insts.size() < 1)
114 size_t IP = uniform<size_t>(IB.Rand, 0, Insts.size() - 1);
lib/IR/AsmWriter.cpp 190 List.push_back(std::make_pair(&U, List.size()));
192 if (List.size() < 2)
238 Stack.emplace_back(V, F, List.size());
239 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size");
240 for (size_t I = 0, E = List.size(); I != E; ++I)
4098 if (Kind < MDNames.size()) {
4121 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
lib/IR/Attributes.cpp 759 void *Mem = ::operator new(totalSizeToAlloc<Attribute>(SortedAttrs.size()));
1174 if (Index >= AttrSets.size())
1191 if (MaxIndex >= AttrSets.size())
1210 assert(Index < AttrSets.size());
1223 assert(Index < AttrSets.size());
1238 if (Index >= AttrSets.size())
lib/IR/AutoUpgrade.cpp 3846 if (ValueComp.size() == 2) {
4020 if (ValueComp.size() != 1) {
lib/IR/ConstantFold.cpp 762 if (Result.size() == V1->getType()->getVectorNumElements())
lib/IR/Core.cpp 337 safe_malloc(MFEs.size() * sizeof(LLVMOpaqueModuleFlagEntry)));
338 for (unsigned i = 0; i < MFEs.size(); ++i) {
345 *Len = MFEs.size();
905 safe_malloc(MVEs.size() * sizeof(LLVMOpaqueValueMetadataEntry)));
906 for (unsigned i = 0; i < MVEs.size(); ++i) {
911 *NumEntries = MVEs.size();
1228 if (GVEs.size())
1252 if (GVEs.size())
1275 if (GVEs.size())
lib/IR/DIBuilder.cpp 83 for (unsigned I = 0, E = AllRetainTypes.size(); I < E; I++)
lib/IR/DebugInfoMetadata.cpp 70 return storeImpl(new (Ops.size()) DILocation(Context, Storage, Line, Column,
655 Ops.size());
lib/IR/DiagnosticInfo.cpp 359 FirstExtraArgIndex = Args.size();
lib/IR/Function.cpp 1174 if (D.getArgumentNumber() < ArgTys.size())
1177 if (D.getArgumentNumber() > ArgTys.size() ||
1181 assert(D.getArgumentNumber() == ArgTys.size() && !IsDeferredCheck &&
1197 if (D.getArgumentNumber() >= ArgTys.size())
1212 if (D.getArgumentNumber() >= ArgTys.size())
1227 if (D.getArgumentNumber() >= ArgTys.size())
1233 if (D.getArgumentNumber() >= ArgTys.size()) {
1254 if (D.getArgumentNumber() >= ArgTys.size())
1261 if (D.getArgumentNumber() >= ArgTys.size())
1272 if (RefArgNumber >= ArgTys.size()) {
1282 assert(D.getOverloadArgNumber() == ArgTys.size() &&
1304 if (D.getArgumentNumber() >= ArgTys.size())
1312 if (D.getArgumentNumber() >= ArgTys.size())
1331 if (D.getArgumentNumber() >= ArgTys.size())
1352 unsigned NumDeferredReturnChecks = DeferredChecks.size();
1358 for (unsigned I = 0, E = DeferredChecks.size(); I != E; ++I) {
lib/IR/Instructions.cpp 3906 assert(SI.getNumSuccessors() == Weights->size() &&
3912 if (AllZeroes || Weights.getValue().size() < 2)
3940 assert(SI.getNumSuccessors() == Weights->size() &&
3966 assert(SI.getNumSuccessors() == Weights->size() &&
lib/IR/LLVMContextImpl.h 1180 size_t size() const { return Attachments.size(); }
lib/IR/LegacyPassManager.cpp 362 assert(N < PassVector.size() && "Pass number out of range!");
433 assert(N < PassManagers.size() && "Pass number out of range!");
514 assert(N < PassVector.size() && "Pass number out of range!");
579 assert(N < PassManagers.size() && "Pass number out of range!");
861 for (unsigned i = 0, e = ImmutablePasses.size(); i != e; ++i) {
1308 for (unsigned i = 0; i != Set.size(); ++i) {
lib/IR/Metadata.cpp 951 unsigned Size = EndPoints.size();
1022 unsigned Size = EndPoints.size();
1036 if (EndPoints.size() == 2) {
1043 MDs.reserve(EndPoints.size());
1077 return (unsigned)getNMDOps(Operands).size();
1145 if (Result.size() > 1)
lib/IR/PassTimingInfo.cpp 223 assert(TimerStack.size() > 0 && "empty stack in popTimer");
lib/IR/ValueSymbolTable.cpp 45 unsigned BaseSize = UniqueName.size();
lib/IR/Verifier.cpp 2393 Assert(PN.getNumIncomingValues() == Preds.size(),
2406 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
5050 if (DebugFnArgs.size() < ArgNo)
lib/LTO/LTOBackend.cpp 378 MemoryBufferRef(StringRef(BC.data(), BC.size()), "ld-temp.o"),
lib/Linker/IRMover.cpp 92 SrcDefinitionsToResolve.resize(SrcDefinitionsToResolve.size() -
93 SpeculativeDstOpaqueTypes.size());
204 for (unsigned I = 0, E = Elements.size(); I != E; ++I)
914 uint64_t NewSize = DstNumElements + SrcElements.size();
lib/MC/ELFObjectWriter.cpp 838 if (Size <= HdrSize + CompressedContents.size())
859 if (Size <= Magic.size() + sizeof(Size) + CompressedContents.size())
895 StringRef(UncompressedData.data(), UncompressedData.size()),
903 if (!maybeWriteCompression(UncompressedData.size(), CompressedContents,
lib/MC/MCAsmStreamer.cpp 477 assert(NbArgs != -1 && ((size_t)NbArgs) == Args.size() && "Malformed LOH!");
1247 unsigned NumFiles = Table.getMCDwarfFiles().size();
1254 if (NumFiles == Table.getMCDwarfFiles().size())
1855 FixupMap.resize(Code.size() * 8);
1856 for (unsigned i = 0, e = Code.size() * 8; i != e; ++i)
1859 for (unsigned i = 0, e = Fixups.size(); i != e; ++i) {
1865 assert(Index < Code.size() * 8 && "Invalid offset in fixup!");
1873 for (unsigned i = 0, e = Code.size(); i != e; ++i) {
1920 for (unsigned i = 0, e = Fixups.size(); i != e; ++i) {
lib/MC/MCAssembler.cpp 292 return cast<MCDataFragment>(F).getContents().size();
294 return cast<MCRelaxableFragment>(F).getContents().size();
296 return cast<MCCompactEncodedInstFragment>(F).getContents().size();
314 return cast<MCLEBFragment>(F).getContents().size();
374 return cast<MCDwarfLineAddrFragment>(F).getContents().size();
376 return cast<MCDwarfCallFrameFragment>(F).getContents().size();
378 return cast<MCCVInlineLineTableFragment>(F).getContents().size();
380 return cast<MCCVDefRangeFragment>(F).getContents().size();
685 for (unsigned i = 0, e = DF.getContents().size(); i != e; ++i)
776 for (unsigned i = 0, e = Layout.getSectionOrder().size(); i != e; ++i) {
953 uint64_t OldSize = LF.getContents().size();
969 return OldSize != LF.getContents().size();
975 uint64_t OldSize = DF.getContents().size();
1010 return OldSize != Data.size();
1016 uint64_t OldSize = DF.getContents().size();
1040 return OldSize != Data.size();
1045 unsigned OldSize = F.getContents().size();
1047 return OldSize != F.getContents().size();
1052 unsigned OldSize = F.getContents().size();
1054 return OldSize != F.getContents().size();
1125 for (unsigned int i = 0, n = Layout.getSectionOrder().size(); i != n; ++i) {
lib/MC/MCCodePadder.cpp 131 Inst, InstDataFragment->getContents().size());
lib/MC/MCCodeView.cpp 41 if (Idx < Files.size())
54 if (Idx >= Files.size())
150 StringTable.insert(std::make_pair(S, unsigned(Contents.size())));
251 if (Idx >= Files.size())
518 if (Buffer.size() >= MaxBufferSize)
670 Fixups.push_back(MCFixup::create(Contents.size(), BE, FK_SecRel_4));
673 Fixups.push_back(MCFixup::create(Contents.size(), BE, FK_SecRel_2));
689 assert(I < GapAndRangeSizes.size());
lib/MC/MCContext.cpp 664 if (FileNumber >= LineTable.getMCDwarfFiles().size())
lib/MC/MCDisassembler/Disassembler.cpp 288 size_t OutputSize = std::min(OutStringSize-1, InsnStr.size());
lib/MC/MCDwarf.cpp 341 for (unsigned i = 1; i < MCDwarfFiles.size(); i++) {
389 MCOS->EmitULEB128IntValue(MCDwarfDirs.size() + 1);
436 MCOS->EmitULEB128IntValue(MCDwarfFiles.empty() ? 1 : MCDwarfFiles.size());
439 assert((!RootFile.Name.empty() || MCDwarfFiles.size() >= 1) &&
443 for (unsigned i = 1; i < MCDwarfFiles.size(); ++i)
579 FileNumber = MCDwarfFiles.empty() ? 1 : MCDwarfFiles.size();
588 if (FileNumber >= MCDwarfFiles.size())
622 if (DirIndex >= MCDwarfDirs.size())
1015 if (MCDwarfDirs.size() > 0) {
1022 assert(MCDwarfFiles.empty() || MCDwarfFiles.size() >= 2);
lib/MC/MCELFStreamer.cpp 57 uint64_t FSize = EF->getContents().size();
63 Assembler, EF, DF->getContents().size(), FSize);
78 flushPendingLabels(DF, DF->getContents().size());
80 for (unsigned i = 0, e = EF->getFixups().size(); i != e; ++i) {
82 DF->getContents().size());
502 for (unsigned i = 0, e = F.getFixups().size(); i != e; ++i)
523 for (unsigned i = 0, e = Fixups.size(); i != e; ++i)
562 else if (!isBundleLocked() && Fixups.size() == 0) {
591 for (unsigned i = 0, e = Fixups.size(); i != e; ++i) {
592 Fixups[i].setOffset(Fixups[i].getOffset() + DF->getContents().size());
lib/MC/MCFragment.cpp 356 for (unsigned i = 0, e = Contents.size(); i != e; ++i) {
360 OS << "] (" << Contents.size() << " bytes)";
380 for (unsigned i = 0, e = Contents.size(); i != e; ++i) {
384 OS << "] (" << Contents.size() << " bytes)";
lib/MC/MCLinkerOptimizationHint.cpp 31 encodeULEB128(Args.size(), OutStream);
lib/MC/MCMachOStreamer.cpp 466 Fixup.setOffset(Fixup.getOffset() + DF->getContents().size());
lib/MC/MCObjectStreamer.cpp 75 flushPendingLabels(PendingFixup.DF, PendingFixup.DF->getContents().size());
194 flushPendingLabels(DF, DF->getContents().size());
210 MCFixup::create(DF->getContents().size(), Value,
212 DF->getContents().resize(DF->getContents().size() + Size, 0);
244 Symbol->setOffset(F->getContents().size());
521 flushPendingLabels(DF, DF->getContents().size());
570 flushPendingLabels(DF, DF->getContents().size());
572 DF->getFixups().push_back(MCFixup::create(DF->getContents().size(),
574 DF->getContents().resize(DF->getContents().size() + 4, 0);
580 flushPendingLabels(DF, DF->getContents().size());
582 DF->getFixups().push_back(MCFixup::create(DF->getContents().size(),
584 DF->getContents().resize(DF->getContents().size() + 8, 0);
590 flushPendingLabels(DF, DF->getContents().size());
592 DF->getFixups().push_back(MCFixup::create(DF->getContents().size(),
594 DF->getContents().resize(DF->getContents().size() + 4, 0);
600 flushPendingLabels(DF, DF->getContents().size());
602 DF->getFixups().push_back(MCFixup::create(DF->getContents().size(),
604 DF->getContents().resize(DF->getContents().size() + 8, 0);
610 flushPendingLabels(DF, DF->getContents().size());
613 MCFixup::create(DF->getContents().size(), Value, FK_GPRel_4));
614 DF->getContents().resize(DF->getContents().size() + 4, 0);
620 flushPendingLabels(DF, DF->getContents().size());
623 MCFixup::create(DF->getContents().size(), Value, FK_GPRel_4));
624 DF->getContents().resize(DF->getContents().size() + 8, 0);
641 flushPendingLabels(DF, DF->getContents().size());
669 flushPendingLabels(DF, DF->getContents().size());
699 flushPendingLabels(DF, DF->getContents().size());
lib/MC/MCParser/AsmParser.cpp 2225 for (unsigned i = 0; i != Info.ParsedOperands.size(); ++i) {
2733 if (FALocs.size() <= PI)
5812 for (unsigned i = 1, e = Info.ParsedOperands.size(); i != e; ++i) {
5861 NumOutputs = OutputDecls.size();
5862 NumInputs = InputDecls.size();
5868 Clobbers.assign(ClobberRegs.size(), std::string());
5869 for (unsigned I = 0, E = ClobberRegs.size(); I != E; ++I) {
lib/MC/MCSectionMachO.cpp 194 return SplitSpec.size() > Idx ? SplitSpec[Idx].trim() : StringRef();
lib/MC/MCWasmStreamer.cpp 40 flushPendingLabels(DF, DF->getContents().size());
42 for (unsigned I = 0, E = EF->getFixups().size(); I != E; ++I) {
44 DF->getContents().size());
186 for (unsigned I = 0, E = Fixups.size(); I != E; ++I) {
187 Fixups[I].setOffset(Fixups[I].getOffset() + DF->getContents().size());
lib/MC/MCWinCOFFStreamer.cpp 61 for (unsigned i = 0, e = Fixups.size(); i != e; ++i) {
62 Fixups[i].setOffset(Fixups[i].getOffset() + DF->getContents().size());
223 MCFixup Fixup = MCFixup::create(DF->getContents().size(), SRE, FK_SecRel_2);
225 DF->getContents().resize(DF->getContents().size() + 2, 0);
239 MCFixup Fixup = MCFixup::create(DF->getContents().size(), MCE, FK_SecRel_4);
243 DF->getContents().resize(DF->getContents().size() + 4, 0);
258 MCFixup Fixup = MCFixup::create(DF->getContents().size(), MCE, FK_Data_4);
262 DF->getContents().resize(DF->getContents().size() + 4, 0);
lib/MC/MachObjectWriter.cpp 124 if (Next >= Layout.getSectionOrder().size())
lib/MC/WasmObjectWriter.cpp 590 DataBytes.resize(alignTo(DataBytes.size(), DataSection.getAlignment()));
602 std::min<uint64_t>(alignTo(DataBytes.size(), Align->getAlignment()),
603 DataBytes.size() + Align->getMaxBytesToEmit());
621 LLVM_DEBUG(dbgs() << "addData -> " << DataBytes.size() << "\n");
686 encodeULEB128(Sig.Params.size(), W.OS);
689 encodeULEB128(Sig.Returns.size(), W.OS);
818 encodeULEB128(DataSegments.size(), W.OS);
860 encodeULEB128(DataSegments.size(), W.OS); // count
871 encodeULEB128(Segment.Data.size(), W.OS); // size
974 if (DataSegments.size()) {
976 encodeULEB128(DataSegments.size(), W.OS);
1055 auto Pair = SignatureIndices.insert(std::make_pair(S, Signatures.size()));
1076 auto Pair = SignatureIndices.insert(std::make_pair(S, Signatures.size()));
1231 uint32_t SegmentIndex = DataSegments.size();
1243 DataSize += Segment.Data.size();
1315 Index = NumFunctionImports + Functions.size();
1379 Index = NumEventImports + Events.size();
1469 WS.setIndex(SymbolInfos.size());
1484 uint32_t TableIndex = TableElems.size() + InitialTableOffset;
1544 *End = (const uint8_t *)Contents.data() + Contents.size();
1570 writeImportSection(Imports, DataSize, TableElems.size());
lib/MC/WinCOFFObjectWriter.cpp 455 assert(Buffer.size() <= COFF::NameSize && Buffer.size() >= 2);
455 assert(Buffer.size() <= COFF::NameSize && Buffer.size() >= 2);
456 std::memcpy(S.Header.Name, Buffer.data(), Buffer.size());
468 if (S.Name.size() > COFF::NameSize)
471 std::memcpy(S.Data.Name, S.Name.c_str(), S.Name.size());
608 JC.update(makeArrayRef(reinterpret_cast<uint8_t*>(Buf.data()), Buf.size()));
629 assert(AuxSyms.size() == 1 && AuxSyms[0].AuxType == ATSectionDefinition);
937 assert(Sec->Symbol->Aux.size() == 1 &&
973 Symbol->Data.NumberOfAuxSymbols = Symbol->Aux.size();
982 if (S->Name.size() > COFF::NameSize)
996 assert(Symbol->Aux.size() == 1 && "Symbol must contain one aux symbol!");
lib/MC/XCOFFObjectWriter.cpp 533 assert(Csect.Syms.size() == 1 && "Csect should only contain 1 symbol "
lib/MCA/CodeEmitter.cpp 30 EI.first = Code.size();
32 EI.second = Code.size() - EI.first;
lib/MCA/HardwareUnits/RegisterFile.cpp 73 unsigned RegisterFileIndex = RegisterFiles.size();
380 if (Writes.size() > 1) {
411 RS.setDependentWrites(DependentWrites.size());
lib/MCA/InstrBuilder.cpp 681 APInt WriteMask(D.Writes.size(), 0);
lib/MCA/Stages/DispatchStage.cpp 99 assert(IS.getDefs().size() == 1 && "Expected a single input!");
100 assert(IS.getUses().size() == 1 && "Expected a single output!");
lib/MCA/Stages/EntryStage.cpp 68 if ((NumRetired * 2) >= Instructions.size()) {
lib/MCA/Stages/ExecuteStage.cpp 144 if (RegDeps.size()) {
151 if (MemDeps.size()) {
279 for (unsigned I = 0, E = BufferIDs.size(); I < E; ++I) {
lib/MCA/Stages/MicroOpQueueStage.cpp 30 CurrentInstructionSlotIdx %= Buffer.size();
43 AvailableEntries = Buffer.size();
50 NextAvailableSlotIdx %= Buffer.size();
lib/Object/IRSymtab.cpp 101 R.Offset = Symtab.size();
372 FC.TheReader = {{FC.Symtab.data(), FC.Symtab.size()},
373 {FC.Strtab.data(), FC.Strtab.size()}};
lib/Object/MachOObjectFile.cpp 1669 assert(LoadCommands.size() == LoadCommandCount);
1709 if (NSect == 0 || NSect > Sections.size())
1726 LibraryOrdinal - 1 >= Libraries.size() ) {
1887 if (DRI.d.a >= Sections.size()){
1985 if (SectionIndex < 1 || SectionIndex > Sections.size())
2433 if (Index >= Libraries.size())
2438 if (LibrariesShortNames.size() == 0) {
2439 for (unsigned i = 0; i < Libraries.size(); i++) {
2466 return Libraries.size();
2531 DRI.d.a = Sections.size();
2801 if (Stack.size() != Other.Stack.size())
2801 if (Stack.size() != Other.Stack.size())
2807 for (unsigned i=0; i < Stack.size(); ++i) {
2984 State.ParentStringLength = CumulativeString.size();
4155 assert(Sec.d.a < Sections.size() && "Should have detected this earlier");
4163 assert(Sec.d.a < Sections.size() && "Should have detected this earlier");
4241 if (SecNum == MachO::R_ABS || SecNum > Sections.size())
4249 assert(DRI.d.a < Sections.size() && "Should have detected this earlier");
4254 assert(DRI.d.a < Sections.size() && "Should have detected this earlier");
lib/Object/Object.cpp 347 char *str = static_cast<char*>(safe_malloc(ret.size()));
lib/ObjectYAML/CodeViewYAMLTypeHashing.cpp 82 assert((Hash.size() == 8) && "Invalid hash size!");
lib/ObjectYAML/MinidumpEmitter.cpp 102 allocateNewObject<support::ulittle32_t>(2 * (WStr.size() - 1)).first;
lib/Option/Arg.cpp 42 for (unsigned i = 0, e = Values.size(); i != e; ++i)
56 for (unsigned i = 0, e = Values.size(); i != e; ++i) {
lib/Option/ArgList.cpp 41 R.first = std::min<unsigned>(R.first, Args.size() - 1);
42 R.second = Args.size();
209 unsigned Index = ArgStrings.size();
lib/Passes/PassBuilder.cpp 1782 if (PipelineStack.size() == 1)
1798 if (PipelineStack.size() > 1)
1867 assert(Matches.size() == 3 && "Must capture two matched strings!");
lib/ProfileData/Coverage/CoverageMapping.cpp 81 if (Terms.size() == 0)
423 for (unsigned I = FirstCompletedRegion + 1, E = ActiveRegions.size(); I < E;
783 if (Segments.size())
lib/ProfileData/Coverage/CoverageMappingReader.cpp 288 for (unsigned InferredFileID = 0, S = VirtualFileMapping.size();
291 VirtualFileMapping.size()))
301 FileIDExpansionRegionMapping.resize(VirtualFileMapping.size(), nullptr);
302 for (unsigned Pass = 1, S = VirtualFileMapping.size(); Pass < S; ++Pass) {
lib/ProfileData/Coverage/CoverageMappingWriter.cpp 77 AdjustedExpressionIDs[C.getExpressionID()] = UsedExpressions.size();
lib/ProfileData/GCOV.cpp 75 for (size_t i = 0, e = Functions.size(); i < e; ++i) {
315 if (BlockNo >= Blocks.size()) {
319 if (BlockNo == Blocks.size() - 1)
389 assert(DstEdgeNo < DstEdges.size()); // up to caller to ensure EdgeNo is valid
lib/ProfileData/InstrProf.cpp 415 return WriteStringToResult(CompressedNameStrings.size(),
462 UncompressedNameStrings.size());
lib/ProfileData/SampleProf.cpp 188 if (S.size() == 0)
191 for (int i = S.size() - 1; i >= 0 && FS != nullptr; i--) {
lib/ProfileData/SampleProfReader.cpp 244 while (InlineStack.size() > Depth) {
253 while (InlineStack.size() > Depth) {
1072 if (InlineStack.size() == 0)
1091 if (InlineStack.size() == 0) {
lib/ProfileData/SampleProfWriter.cpp 109 encodeULEB128(CompressedStrings.size(), OS);
411 Writer.write(static_cast<uint64_t>(SectionHdrLayout.size()));
413 for (uint32_t i = 0; i < SectionHdrLayout.size(); i++) {
442 for (uint32_t i = 0; i < SectionHdrLayout.size(); i++) {
lib/Remarks/BitstreamRemarkParser.cpp 54 if (Record.size() != 2)
61 if (Record.size() != 1)
67 if (Record.size() != 0)
73 if (Record.size() != 0)
101 if (Record.size() != 4)
110 if (Record.size() != 3)
118 if (Record.size() != 1)
124 if (Record.size() != 5)
139 if (Record.size() != 2)
lib/Remarks/BitstreamRemarkSerializer.cpp 319 OS.write(Encoded.data(), Encoded.size());
324 return StringRef(Encoded.data(), Encoded.size());
lib/Remarks/Remark.cpp 107 return unwrap(Remark)->Args.size();
lib/Remarks/YAMLRemarkSerializer.cpp 239 OS.write(FilenameBuf.data(), FilenameBuf.size());
lib/Support/APFloat.cpp 3390 unsigned N = buffer.size();
3559 unsigned NDigits = buffer.size();
3611 if (!TruncateZero && expbuf.size() < 2)
3613 for (unsigned I = 0, E = expbuf.size(); I != E; ++I)
lib/Support/APInt.cpp 2228 unsigned StartDig = Str.size();
lib/Support/CommandLine.cpp 1072 for (unsigned I = 0; I < NewArgv.size(); ++I)
1113 FileStack.push_back({"", Argv.size()});
1116 for (unsigned I = 0; I != Argv.size();) {
1164 Record.End += ExpandedArgv.size() - 1;
1167 FileStack.push_back({FName, I + ExpandedArgv.size()});
1177 assert(FileStack.size() > 0 && Argv.size() == FileStack.back().End);
1177 assert(FileStack.size() > 0 && Argv.size() == FileStack.back().End);
1216 int newArgc = static_cast<int>(newArgv.size());
1239 int NewArgc = static_cast<int>(NewArgv.size());
1271 argc = static_cast<int>(newArgv.size());
1310 assert(PositionalOpts.size() > 0 &&
1317 for (size_t i = 0, e = PositionalOpts.size(); i != e; ++i) {
1324 if (PositionalOpts.size() > 1) {
1343 *Errs << PositionalOpts.size();
1388 if (PositionalVals.size() >= NumPositionalRequired && ConsumeAfterOpt) {
1479 if (NumPositionalRequired > PositionalVals.size()) {
1488 PositionalVals.size() > PositionalOpts.size()) {
1488 PositionalVals.size() > PositionalOpts.size()) {
1490 << "Can specify at most " << PositionalOpts.size()
1496 unsigned ValNo = 0, NumVals = static_cast<unsigned>(PositionalVals.size());
1497 for (size_t i = 0, e = PositionalOpts.size(); i != e; ++i) {
1529 assert(ConsumeAfterOpt && NumPositionalRequired <= PositionalVals.size());
1531 for (size_t j = 1, e = PositionalOpts.size(); j != e; ++j)
1544 if (PositionalOpts.size() == 1 && ValNo == 0 && !PositionalVals.empty()) {
1553 for (; ValNo != PositionalVals.size(); ++ValNo)
2061 for (size_t i = 0, e = Opts.size(); i != e; ++i)
2107 if (Subs.size() > 2)
2132 for (size_t i = 0, e = Subs.size(); i != e; ++i)
2148 for (size_t i = 0, e = Opts.size(); i != e; ++i)
2205 for (size_t I = 0, E = Opts.size(); I != E; ++I) {
2355 for (size_t i = 0, e = Opts.size(); i != e; ++i)
2358 for (size_t i = 0, e = Opts.size(); i != e; ++i)
lib/Support/ConvertUTFWrapper.cpp 163 UTF16 *DstEnd = Dst + DstUTF16.size();
lib/Support/FileCheck.cpp 674 assert(VariableDef.second < MatchInfo.size() && "Internal paren error");
684 assert(CaptureParenGroup < MatchInfo.size() && "Internal paren error");
925 return StringRef(OutputBuffer.data(), OutputBuffer.size() - 1);
lib/Support/FileCollector.cpp 239 if (Output.size() > 0)
lib/Support/FoldingSet.cpp 146 return FoldingSetNodeIDRef(Bits.data(), Bits.size()).ComputeHash();
152 return *this == FoldingSetNodeIDRef(RHS.Bits.data(), RHS.Bits.size());
158 return FoldingSetNodeIDRef(Bits.data(), Bits.size()) == RHS;
164 return *this < FoldingSetNodeIDRef(RHS.Bits.data(), RHS.Bits.size());
168 return FoldingSetNodeIDRef(Bits.data(), Bits.size()) < RHS;
176 unsigned *New = Allocator.Allocate<unsigned>(Bits.size());
178 return FoldingSetNodeIDRef(New, Bits.size());
lib/Support/Host.cpp 158 for (unsigned I = 0, E = Lines.size(); I != E; ++I) {
173 for (unsigned I = 0, E = Lines.size(); I != E; ++I)
201 for (unsigned I = 0, E = Lines.size(); I != E; ++I) {
217 for (unsigned I = 0, E = Lines.size(); I != E; ++I)
228 for (unsigned I = 0, E = Lines.size(); I != E; ++I)
292 for (unsigned I = 0, E = Lines.size(); I != E; ++I)
305 for (unsigned I = 0, E = CPUFeatures.size(); I != E; ++I) {
311 for (unsigned I = 0, E = Lines.size(); I != E; ++I) {
lib/Support/IntEqClasses.cpp 27 while (EC.size() < N)
28 EC.push_back(EC.size());
62 for (unsigned i = 0, e = EC.size(); i != e; ++i)
70 for (unsigned i = 0, e = EC.size(); i != e; ++i)
71 if (EC[i] < Leader.size())
lib/Support/MemoryBuffer.cpp 216 Buffer.reserve(Buffer.size() + ChunkSize);
223 Buffer.set_size(Buffer.size() + *ReadBytes);
lib/Support/Path.cpp 432 !path.empty() && is_separator(path[path.size() - 1], style);
475 size_t end_pos = parent_path_end(StringRef(path.begin(), path.size()), style);
482 StringRef p(path.begin(), path.size());
505 StringRef OrigPath(Path.begin(), Path.size());
537 if (Path[0] == '~' && (Path.size() == 1 || is_separator(Path[1], style))) {
718 StringRef p(path.data(), path.size());
761 for (unsigned i = 0, e = ModelStorage.size(); i != e; ++i) {
855 StringRef p(path.data(), path.size());
lib/Support/Regex.cpp 190 RefValue < Matches.size())
lib/Support/SmallVector.cpp 57 memcpy(NewElts, this->BeginX, size() * TSize);
lib/Support/SymbolRemappingReader.cpp 45 if (Parts.size() != 3)
lib/Support/TrigramIndex.cpp 71 if (Index[Tri].size() >= 4)
lib/Support/Triple.cpp 732 if (Components.size() > 0) {
735 if (Components.size() > 1) {
737 if (Components.size() > 2) {
739 if (Components.size() > 3) {
808 if (Components.size() > 0)
811 if (Components.size() > 1)
814 if (Components.size() > 2) {
820 if (Components.size() > 3)
823 if (Components.size() > 4)
841 for (unsigned Idx = 0; Idx != Components.size(); ++Idx) {
904 for (unsigned i = Idx; i < Components.size();) {
924 assert(Pos < Components.size() && Components[Pos] == Comp &&
932 for (unsigned i = 0, e = Components.size(); i < e; ++i) {
982 for (unsigned i = 0, e = Components.size(); i != e; ++i) {
lib/Support/Twine.cpp 54 return StringRef(Out.data(), Out.size());
lib/Support/Unix/Path.inc 582 StringRef PathStr(Path.begin(), Path.size());
lib/Support/VirtualFileSystem.cpp 1888 unsigned getDirIndent() { return 4 * DirStack.size(); }
1889 unsigned getFileIndent() { return 4 * (DirStack.size() + 1); }
lib/Support/YAMLParser.cpp 1902 return StringRef(Storage.begin(), Storage.size());
2050 return StringRef(Storage.begin(), Storage.size());
lib/Support/YAMLTraits.cpp 459 if (StateStack.size() > 1) {
460 auto &E = StateStack[StateStack.size() - 2];
714 unsigned Indent = StateStack.empty() ? 1 : StateStack.size();
743 if (StateStack.size() < 2)
747 return !inSeqAnyElement(StateStack[StateStack.size() - 2]);
780 if (StateStack.size() == 0)
783 unsigned Indent = StateStack.size() - 1;
789 } else if ((StateStack.size() > 1) &&
793 inSeqAnyElement(StateStack[StateStack.size() - 2])) {
lib/Support/raw_ostream.cpp 395 if (Buffer.size() < FN.Width)
396 indent(FN.Width - Buffer.size());
910 uint64_t raw_svector_ostream::current_pos() const { return OS.size(); }
lib/TableGen/Record.cpp 181 for (unsigned i = 0; i < Classes.size(); ++i) {
182 for (unsigned j = 0; j < Classes.size(); ++j) {
189 void *Mem = Allocator.Allocate(totalSizeToAlloc<Record *>(Classes.size()),
191 RecordRecTy *Ty = new(Mem) RecordRecTy(Classes.size());
lib/TableGen/TGParser.cpp 238 if (TArgs.size() < SubClass.TemplateArgs.size())
247 if (i < SubClass.TemplateArgs.size()) {
311 if (SMCTArgs.size() < SubMultiClass.TemplateArgs.size())
319 if (i < SubMultiClass.TemplateArgs.size()) {
1163 if (ItemType && InitList.size() == 1) {
1181 if (InitList.size() == 2 && !isa<IntRecTy>(ArgType)) {
1239 while (InitList.size() > 2) {
1246 if (InitList.size() == 2)
1713 if (Case.size() < 1) {
1847 if (ExpectedArgs.size() < Args.size()) {
1855 if (i < Args.size()) {
1899 for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
lib/Target/AArch64/AArch64CallLowering.cpp 232 if (SplitVTs.size() == 1) {
241 assert(OrigArg.Regs.size() == SplitVTs.size() && "Regs / types mismatch");
241 assert(OrigArg.Regs.size() == SplitVTs.size() && "Regs / types mismatch");
245 for (unsigned i = 0, e = SplitVTs.size(); i < e; ++i) {
277 assert(VRegs.size() == SplitEVTs.size() &&
283 for (unsigned i = 0; i < SplitEVTs.size(); ++i) {
600 for (unsigned i = 0; i < OutLocs.size(); ++i) {
631 if (OutInfo.Regs.size() > 1) {
lib/Target/AArch64/AArch64CallingConvention.cpp 120 RegList, alignTo(PendingMembers.size(), EltsPerReg) / EltsPerReg);
lib/Target/AArch64/AArch64ExpandPseudoInsts.cpp 124 assert(Insn.size() != 0);
lib/Target/AArch64/AArch64FalkorHWPFFix.cpp 692 auto Size = P.second.size();
729 if (OldCollisions.size() <= 1)
791 for (int I = 0, E = OldCollisions.size(); I != E; ++I)
lib/Target/AArch64/AArch64FastISel.cpp 3168 if (RVLocs.size() != 1)
3237 OutVTs.reserve(CLI.OutVals.size());
3872 if (ValLocs.size() != 1)
lib/Target/AArch64/AArch64ISelDAGToDAG.cpp 2646 if (Fields.size() == 1)
2649 assert(Fields.size() == 5
lib/Target/AArch64/AArch64ISelLowering.cpp 3154 unsigned NumArgs = Ins.size();
3179 assert(ArgLocs.size() == Ins.size());
3179 assert(ArgLocs.size() == Ins.size());
3181 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3349 for (unsigned I = 0, E = Ins.size(); I != E; ++I) {
3493 for (unsigned i = 0; i != RVLocs.size(); ++i) {
3762 unsigned NumArgs = Outs.size();
3780 unsigned NumArgs = Outs.size();
3860 for (unsigned i = 0, realArgIdx = 0, e = ArgLocs.size(); i != e;
4180 for (unsigned i = 0, realRVLocIdx = 0; i != RVLocs.size();
5737 IsLegal = Insn.size() <= Limit;
6312 if (Sources.size() > 2) {
6448 for (unsigned i = 0; i < Sources.size(); ++i)
8878 SubVec.size() > 1 ? concatenateVectors(Builder, SubVec) : SubVec[0];
9999 for (size_t i = 0; i < Mask.size(); ++i)
lib/Target/AArch64/AArch64RedundantCopyElimination.cpp 434 for (unsigned RI = 0; RI < KnownRegs.size();)
436 std::swap(KnownRegs[RI], KnownRegs[KnownRegs.size() - 1]);
lib/Target/AArch64/AArch64SpeculationHardening.cpp 212 assert(analyzeBranchCondCode.size() == 1 && "unknown Cond array format");
lib/Target/AArch64/AArch64StackTagging.cpp 631 if (UnrecognizedLifetimes.empty() && Info.LifetimeStart.size() == 1 &&
632 Info.LifetimeEnd.size() == 1) {
655 if (NumCoveredExits == ReachableRetVec.size()) {
lib/Target/AArch64/AArch64TargetTransformInfo.cpp 55 return Insn.size();
lib/Target/AArch64/AsmParser/AArch64AsmParser.cpp 3674 if (Operands.size() < 2 ||
4499 unsigned NumOperands = Operands.size();
4802 Operands.size() > 1 && ((AArch64Operand &)*Operands[1]).isToken() &&
4814 NumOperands = Operands.size();
4843 if (ErrorInfo >= Operands.size())
5001 if (ErrorInfo >= Operands.size())
lib/Target/AMDGPU/AMDGPUCallLowering.cpp 166 assert(OrigArg.Regs.size() == SplitVTs.size());
166 assert(OrigArg.Regs.size() == SplitVTs.size());
lib/Target/AMDGPU/AMDGPUCodeGenPrepare.cpp 450 if (Values.size() == 1)
454 for (int I = 0, E = Values.size(); I != E; ++I)
497 for (int I = 0, E = LHSVals.size(); I != E; ++I) {
lib/Target/AMDGPU/AMDGPUISelLowering.cpp 944 for (unsigned Value = 0, NumValues = ValueVTs.size();
1102 for (unsigned I = 0, E = CLI.Ins.size(); I != E; ++I)
lib/Target/AMDGPU/AMDGPUInstructionSelector.cpp 1882 if (AddrInfo.empty() || AddrInfo[0].SgprParts.size() != 1)
1903 if (AddrInfo.empty() || AddrInfo[0].SgprParts.size() != 1)
1928 if (AddrInfo.empty() || AddrInfo[0].SgprParts.size() != 1)
lib/Target/AMDGPU/AMDGPULibCalls.cpp 769 for (unsigned i = 0; i < DVal.size(); ++i) {
1064 for (unsigned i=0; i < DVal.size(); ++i) {
lib/Target/AMDGPU/AMDGPULibFunc.cpp 783 for(unsigned I = 0; I < Str.size(); ++I) {
lib/Target/AMDGPU/AMDGPUMCInstLower.cpp 360 for (size_t i = 0; i < CodeBytes.size(); i += 4) {
lib/Target/AMDGPU/AMDGPUMachineCFGStructurizer.cpp 1890 if (Cond.size() != 1)
2437 assert(PHIRegionIndices.size() == 1);
lib/Target/AMDGPU/AMDGPUPrintfRuntimeBinding.cpp 208 ArgCount <= OpConvSpecifiers.size();
405 ArgCount <= OpConvSpecifiers.size();
532 for (unsigned I = 0, E = WhatToStore.size(); I != E; ++I) {
lib/Target/AMDGPU/AMDGPURegisterBankInfo.cpp 207 Operands.size()));
1099 for (unsigned DefIdx = 0, e = DefRegs.size(); DefIdx != e; ++DefIdx) {
1143 assert(SrcReg.size() == 1);
1355 assert(Src0Regs.size() == 1);
1399 assert(DefRegs.size() == 2);
1400 assert(Src0Regs.size() == Src1Regs.size() &&
1400 assert(Src0Regs.size() == Src1Regs.size() &&
1401 (Src0Regs.empty() || Src0Regs.size() == 2));
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 787 for (unsigned I = 0; I < Succs.size(); ++I) {
lib/Target/AMDGPU/AMDGPUUnifyDivergentExitNodes.cpp 162 if (PDT.getRoots().size() <= 1)
214 if (UnreachableBlocks.size() == 1) {
256 if (ReturningBlocks.size() == 1)
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 697 for (unsigned i = 0; i < ContInstr.size(); ++i)
724 if (ExitingMBBs.size() == 0) {
744 if (RetBlks.size() >= 2) {
1043 LLVM_DEBUG(dbgs() << "Loop has " << ExitingMBBs.size()
1049 for (unsigned i = 0, e = ExitBlks.size(); i < e; ++i)
1059 for (unsigned i = 0, e = ExitingMBBs.size(); i < e; ++i)
1061 for (unsigned i = 0, e = LatchBlks.size(); i < e; ++i)
lib/Target/AMDGPU/AsmParser/AMDGPUAsmParser.cpp 3254 for (unsigned i = 1, e = Operands.size(); i != e; ++i) {
3536 if (ErrorInfo >= Operands.size()) {
4428 unsigned Prefix = Operands.size();
4445 if (Operands.size() - Prefix > 1) {
4492 if (IsMIMG && isGFX10() && Operands.size() == 2)
4732 for (unsigned i = 1, e = Operands.size(); i != e; ++i) {
4756 for (unsigned i = 1, e = Operands.size(); i != e; ++i) {
4795 for (unsigned i = 1, e = Operands.size(); i != e; ++i) {
5752 AMDGPUOperand &Opr = ((AMDGPUOperand &)*Operands[Operands.size() - 1]);
5804 for (unsigned i = FirstOperandIdx, e = Operands.size(); i != e; ++i) {
5869 for (unsigned i = 1, e = Operands.size(); i != e; ++i) {
5926 for (unsigned E = Operands.size(); I != E; ++I) {
6205 for (unsigned E = Operands.size(); I != E; ++I) {
6245 for (unsigned E = Operands.size(); I != E; ++I) {
6259 for (unsigned E = Operands.size(); I != E; ++I) {
6688 for (unsigned E = Operands.size(); I != E; ++I) {
6846 for (unsigned E = Operands.size(); I != E; ++I) {
lib/Target/AMDGPU/GCNMinRegStrategy.cpp 110 return SU->Succs.size() - getReadySuccessors(SU);
lib/Target/AMDGPU/GCNNSAReassign.cpp 113 unsigned NumRegs = Intervals.size();
146 unsigned NumRegs = Intervals.size();
lib/Target/AMDGPU/GCNRegBankReassign.cpp 534 for (unsigned I = 0, E = OperandMasks.size(); I + 1 < E; ++I) {
lib/Target/AMDGPU/GCNSchedStrategy.cpp 455 for (size_t E = Regions.size(); CurRegion != E; ++CurRegion)
507 BBStarters.reserve(Regions.size());
524 LiveIns.resize(Regions.size());
525 Pressure.resize(Regions.size());
lib/Target/AMDGPU/R600EmitClauseMarkers.cpp 142 for (unsigned i = 0, n = Consts.size(); i < n; ++i) {
173 for (unsigned i = 0, j = 0, n = Consts.size(); i < n; ++i) {
lib/Target/AMDGPU/R600ISelLowering.cpp 1594 for (unsigned i = 0, e = Ins.size(); i < e; ++i) {
1933 if (Elt < Ops.size()) {
lib/Target/AMDGPU/R600OpenCLImageTypeLoweringPass.cpp 147 assert(V.size() == NumKernelArgMDNodes);
261 for (unsigned i = 0; i < InstsToErase.size(); ++i) {
lib/Target/AMDGPU/R600Packetizer.cpp 194 for (unsigned i = 0, e = SUJ->Succs.size(); i < e; ++i) {
lib/Target/AMDGPU/SIFoldOperands.cpp 519 for (unsigned I = 0, E = Defs.size(); I != E; ++I) {
lib/Target/AMDGPU/SIISelLowering.cpp 2037 BitVector Skipped(Ins.size());
2121 for (unsigned i = 0, e = Ins.size(), ArgIdx = 0; i != e; ++i) {
2308 for (unsigned I = 0, RealRVLocIdx = 0, E = RVLocs.size(); I != E;
2382 for (unsigned i = 0; i != RVLocs.size(); ++i) {
2686 for (unsigned I = 0, E = CLI.Ins.size(); I != E; ++I)
2783 for (unsigned i = 0, realArgIdx = 0, e = ArgLocs.size(); i != e;
5489 ST->hasFeature(AMDGPU::FeatureNSAEncoding) && VAddrs.size() >= 3;
5545 if (ResultTypes.size() == 3) {
5599 UseNSA ? VAddrs.size() : VAddr.getValueType().getSizeInBits() / 32;
lib/Target/AMDGPU/SIInstrInfo.cpp 2105 if (Cond.size() != 2) {
lib/Target/AMDGPU/SILowerControlFlow.cpp 477 if (Ops.size() == 1) OpToReplace = 2; // First operand can be exec or its copy
479 if (Ops.size() != 3) return;
lib/Target/AMDGPU/SILowerI1Copies.cpp 325 assert(LoopLevel < CommonDominators.size());
367 for (unsigned i = 0; i < NextLevel.size();) {
379 unsigned Level = CommonDominators.size();
613 for (unsigned i = 0; i < IncomingRegs.size(); ++i) {
619 for (unsigned i = 0; i < IncomingRegs.size(); ++i) {
633 for (unsigned i = 0; i < IncomingRegs.size(); ++i) {
644 for (unsigned i = 0; i < IncomingRegs.size(); ++i) {
lib/Target/AMDGPU/SIMachineFunctionInfo.cpp 257 return NumVGPRSpillLanes + NumNeed <= WaveSize * SpillVGPRs.size();
lib/Target/AMDGPU/SIMachineScheduler.cpp 1020 if (SU->Preds.size() > 0 && !DAG->IsLowLatencySU[SU->NodeNum])
lib/Target/ARC/ARCISelLowering.cpp 262 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
314 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
339 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
376 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
388 std::make_pair(VA.getLocMemOffset(), InVals.size()));
397 for (unsigned i = 0, e = ResultMemLocs.size(); i != e; ++i) {
479 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
631 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
659 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
lib/Target/ARC/ARCInstrInfo.cpp 352 assert((Cond.size() == 3) && "Invalid ARC branch condition!");
lib/Target/ARM/A15SDOptimizer.cpp 185 while (Front.size() != 0) {
362 while (Front.size() != 0) {
lib/Target/ARM/ARMBaseInstrInfo.cpp 1259 Accesses.size() == 1) {
1502 Accesses.size() == 1) {
2514 for (int i = RegList.size() - 1; i >= 0; --i)
3175 for (unsigned i = 0, e = OperandsToUpdate.size(); i < e; i++)
lib/Target/ARM/ARMCallLowering.cpp 142 assert(Arg.Regs.size() == 1 && "Can't handle multple regs yet");
200 assert(OrigArg.Regs.size() == SplitVTs.size() && "Regs / types mismatch");
200 assert(OrigArg.Regs.size() == SplitVTs.size() && "Regs / types mismatch");
202 if (SplitVTs.size() == 1) {
213 for (unsigned i = 0, e = SplitVTs.size(); i != e; ++i) {
366 assert(Arg.Regs.size() == 1 && "Can't handle multple regs yet");
lib/Target/ARM/ARMCallingConv.cpp 180 if (PendingMembers.size() > 0)
230 unsigned RegResult = State.AllocateRegBlock(RegList, PendingMembers.size());
lib/Target/ARM/ARMConstantIslandPass.cpp 335 for (unsigned J = 0, E = BBInfo.size(); J !=E; ++J) {
1743 for (unsigned i = 0, e = PushPopMIs.size(); i != e; ++i) {
2167 for (unsigned i = 0, e = T2JumpTables.size(); i != e; ++i) {
2361 for (unsigned i = 0, e = T2JumpTables.size(); i != e; ++i) {
lib/Target/ARM/ARMFastISel.cpp 1902 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1952 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2050 if (RVLocs.size() == 2 && RetVT == MVT::f64) {
2067 assert(RVLocs.size() == 1 &&"Can't handle non-double multi-reg retvals!");
2124 if (ValLocs.size() != 1)
2220 if (RVLocs.size() >= 2 && RetVT != MVT::f64)
2328 if (RVLocs.size() >= 2 && RetVT != MVT::f64)
lib/Target/ARM/ARMFrameLowering.cpp 1023 if (Regs.size() > 1 || StrOpc== 0) {
1028 for (unsigned i = 0, e = Regs.size(); i < e; ++i)
1030 } else if (Regs.size() == 1) {
1119 if (Regs.size() > 1 || LdrOpc == 0) {
1123 for (unsigned i = 0, e = Regs.size(); i < e; ++i)
1132 } else if (Regs.size() == 1) {
2051 for (unsigned i = 0, e = UnspilledCS1GPRs.size(); i != e; ++i) {
lib/Target/ARM/ARMISelDAGToDAG.cpp 4302 if (Fields.size() > 1) {
4766 OpChanged[OpChanged.size() -1 ] = true;
lib/Target/ARM/ARMISelLowering.cpp 1937 for (unsigned i = 0; i != RVLocs.size(); ++i) {
2130 for (unsigned i = 0, realArgIdx = 0, e = ArgLocs.size();
2259 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
2397 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
2567 if (Subtarget->isThumb1Only() && Outs.size() >= 4 &&
2636 for (unsigned i = 0, realArgIdx = 0, e = ArgLocs.size();
2742 AFI->setReturnRegsCount(RVLocs.size());
2746 i != RVLocs.size();
3982 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
4012 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
7389 if (Sources.size() > 2)
7516 assert(Sources.size() <= 2 && "Too many sources!");
7519 for (unsigned i = 0; i < Sources.size(); ++i)
13059 SDValue &StVal = Ops[Ops.size()-2];
15569 switch (AsmPieces.size()) {
15577 if (AsmPieces.size() == 3 &&
16839 SubVec.size() > 1 ? concatenateVectors(Builder, SubVec) : SubVec[0];
lib/Target/ARM/ARMLegalizerInfo.cpp 433 Libcalls.size() == 1
455 if (Results.size() != 1) {
456 assert(Results.size() == 2 && "Unexpected number of results");
lib/Target/ARM/ARMLoadStoreOptimizer.cpp 1002 unsigned EIndex = MemOps.size();
1771 assert(Candidates.size() == 0);
1772 assert(MergeBaseCandidates.size() == 0);
1861 if (MemOps.size() > 0) {
1870 if (MemOps.size() > 0)
1900 assert(Candidate->Instrs.size() == 1);
2233 while (Ops.size() > 1) {
2242 for (int i = Ops.size() - 1; i >= 0; --i) {
2284 for (size_t i = Ops.size() - NumMove, e = Ops.size(); i != e; ++i) {
2284 for (size_t i = Ops.size() - NumMove, e = Ops.size(); i != e; ++i) {
2308 MachineInstr *Op1 = Ops[Ops.size()-2];
2428 for (unsigned i = 0, e = BI->second.size(); i != e; ++i) {
2452 for (unsigned i = 0, e = LdBases.size(); i != e; ++i) {
2455 if (Lds.size() > 1)
2460 for (unsigned i = 0, e = StBases.size(); i != e; ++i) {
2463 if (Sts.size() > 1)
lib/Target/ARM/ARMParallelDSP.cpp 369 if (Loads.empty() || Loads.size() > NumLoadLimit)
554 if (R.getMuls().size() < 2)
597 const unsigned Elems = Muls.size();
734 assert(Loads.size() == 2 && "currently only support widening two loads");
lib/Target/ARM/ARMTargetTransformInfo.cpp 1023 << "Exit blocks: " << ExitingBlocks.size() << "\n");
1027 if (ExitingBlocks.size() > 2)
lib/Target/ARM/AsmParser/ARMAsmParser.cpp 239 assert(PendingConditionalInsts.size() == 0);
251 assert(PendingConditionalInsts.size() <= 4);
3536 assert(Regs.size() > 0 && "RegList contains no registers?");
5558 if (Operands.size() == 6 &&
5629 assert(Operands.size() == 8);
6418 if (Operands.size() != 6)
6510 if (Mnemonic == "mov" && Operands.size() > 4 && !isThumb() &&
6518 if (isThumb() && Mnemonic == "add" && Operands.size() == 5 &&
6529 Operands.size() == 6 && static_cast<ARMOperand &>(*Operands[3]).isReg() &&
6542 Operands.size() == 6 && static_cast<ARMOperand &>(*Operands[3]).isReg() &&
6568 if (isThumbTwo() && Mnemonic == "mul" && Operands.size() == 6 &&
6588 if (isThumbTwo() && Mnemonic == "mul" && Operands.size() == 5 &&
6606 (Operands.size() == 5 || Operands.size() == 6) &&
6606 (Operands.size() == 5 || Operands.size() == 6) &&
6611 (Operands.size() == 6 &&
6643 if (!hasMVE() || Operands.size() < 3)
6714 if (Operands.size() < 4)
7022 if (Mnemonic.startswith("vcvtt") && Operands.size() >= 4) {
7060 for (unsigned I = 1; I < Operands.size(); ++I)
7083 if (!isThumb() && Mnemonic == "blx" && Operands.size() == 3 &&
7094 if (!isThumb() && Operands.size() > 4 &&
7133 if (isThumbTwo() && Mnemonic == "sub" && Operands.size() == 6 &&
7313 for (unsigned I = 1; I < Operands.size(); ++I)
7360 for (unsigned I = 1; I < Operands.size(); ++I)
7649 if (Operands.size() == 6 && (((ARMOperand &)*Operands[3]).getReg() !=
7890 if (RegList.size() < 1 || RegList.size() > 16)
7890 if (RegList.size() < 1 || RegList.size() > 16)
9775 if ((unsigned)Inst.getOperand(3).getImm() < 8 && Operands.size() == 6) {
9785 if ((unsigned)Inst.getOperand(3).getImm() < 8 && Operands.size() == 6) {
11698 if (Messages.size() == 0) {
11702 } else if (Messages.size() == 1) {
lib/Target/ARM/Disassembler/ARMDisassembler.cpp 107 return VPTStates.size() == 1;
lib/Target/ARM/MCTargetDesc/ARMELFStreamer.cpp 159 assert(RegList.size() && "RegList should not be empty");
167 for (unsigned i = 1, e = RegList.size(); i != e; ++i) {
313 for (size_t i = 0; i < Contents.size(); ++i)
622 EMS->Offset = DF->getContents().size();
1038 for (size_t i = 0; i < Contents.size(); ++i) {
1112 for (size_t i = 0; i < Contents.size(); ++i) {
1236 Frag->getFixups().push_back(MCFixup::create(Frag->getContents().size(), Expr,
1297 assert(Opcodes.size() == 4u &&
1303 EmitIntValue(Intval, Opcodes.size());
1324 DF->getFixups().push_back(MCFixup::create(DF->getContents().size(),
1375 assert((Opcodes.size() % 4) == 0 &&
1377 for (unsigned I = 0; I != Opcodes.size(); I += 4) {
1451 for (size_t i = 0; i < RegList.size(); ++i) {
lib/Target/ARM/MCTargetDesc/ARMUnwindOpAsm.cpp 59 while (Pos < Vec.size())
162 size_t TotalSize = Ops.size() + 1;
169 PersonalityIndex = (Ops.size() <= 3) ? ARM::EHABI::AEABI_UNWIND_CPP_PR0
173 assert(Ops.size() <= 3 && "too many opcodes for __aeabi_unwind_cpp_pr0");
178 size_t TotalSize = Ops.size() + 2;
187 for (size_t i = OpBegins.size() - 1; i > 0; --i)
lib/Target/ARM/MCTargetDesc/ARMUnwindOpAsm.h 64 OpBegins.push_back(OpBegins.back() + Opcodes.size());
lib/Target/AVR/AVRISelLowering.cpp 902 for (unsigned i = 0, e = In.size(); i != e;) {
967 for (unsigned i = 0, pos = 0, e = Args.size(); i != e; ++i) {
1197 for (AI = 0, AE = ArgLocs.size(); AI != AE; ++AI) {
1239 for (AE = AI, AI = ArgLocs.size(); AI != AE; --AI) {
1325 if (CallConv != CallingConv::AVR_BUILTIN && RVLocs.size() > 1) {
1389 unsigned e = RVLocs.size();
lib/Target/AVR/AVRInstrInfo.cpp 377 assert(Cond.size() == 1);
468 assert(Cond.size() == 1 && "Invalid AVR branch condition!");
lib/Target/AVR/AsmParser/AVRAsmParser.cpp 284 if (ErrorInfo >= Operands.size()) {
lib/Target/BPF/AsmParser/BPFAsmParser.cpp 263 if (Operands.size() == 4) {
308 if (ErrorInfo >= Operands.size())
lib/Target/BPF/BPFISelLowering.cpp 307 if (Outs.size() > MaxArgs)
325 e = std::min(static_cast<unsigned>(ArgLocs.size()), MaxArgs);
433 for (unsigned i = 0; i != RVLocs.size(); ++i) {
464 if (Ins.size() >= 2) {
466 for (unsigned i = 0, e = Ins.size(); i != e; ++i)
lib/Target/Hexagon/AsmParser/HexagonAsmParser.cpp 584 if (ErrorInfo >= InstOperands.size())
617 assert(Operands.size() == 1 && "Brackets should be by themselves");
627 assert(Operands.size() == 1 && "Brackets should be by themselves");
829 if (Index >= Operands.size())
831 MCParsedAsmOperand &Operand = *Operands[Operands.size() - Index - 1];
1053 if (Tokens.size() > 1)
lib/Target/Hexagon/BitTracker.cpp 116 unsigned n = RC.Bits.size();
126 for (unsigned i = 1, n = RC.Bits.size(); i < n; ++i) {
206 for (uint16_t i = 0, n = Bits.size(); i < n; ++i) {
311 uint16_t W = Bits.size();
312 if (RC.Bits.size() != W)
lib/Target/Hexagon/BitTracker.h 303 return Bits.size();
307 assert(BitN < Bits.size());
311 assert(BitN < Bits.size());
lib/Target/Hexagon/HexagonBitSimplify.cpp 1029 for (unsigned i = 0, n = Regs.size(); i != n; ++i)
lib/Target/Hexagon/HexagonConstPropagation.cpp 1019 for (unsigned i = 0, n = ToRemove.size(); i < n; ++i)
2531 for (unsigned i = 0; i < HiVs.size(); ++i) {
2533 for (unsigned j = 0; j < LoVs.size(); ++j) {
2852 for (unsigned i = 0, n = DefRegs.size(); i < n; ++i) {
2937 for (unsigned i = 1; i < NewInstrs.size(); ++i)
2942 AllDefs = (ChangedNum == DefRegs.size());
lib/Target/Hexagon/HexagonCopyToCombine.cpp 630 if (!DoInsertAtI1 && DbgMItoMove.size() != 0) {
lib/Target/Hexagon/HexagonEarlyIfConv.cpp 467 assert(Inc.size() <= 2);
468 if (Inc.size() < 2)
lib/Target/Hexagon/HexagonFrameLowering.cpp 456 for (unsigned i = 1, n = SFBlocks.size(); i < n; ++i) {
462 for (unsigned i = 1, n = SFBlocks.size(); i < n; ++i) {
lib/Target/Hexagon/HexagonGenInsert.cpp 1056 for (unsigned i = 0, n = Prune.size(); i < n; ++i)
1491 for (unsigned I = 0, N = Regs.size(); I != N; ++I)
1604 for (unsigned i = 0, n = Out.size(); i < n; ++i)
lib/Target/Hexagon/HexagonHardwareLoops.cpp 1110 for (unsigned i = 0; i < DeadPhis.size(); ++i)
1304 for (unsigned i = 0; i < OldInsts.size(); ++i)
1698 unsigned CSz = Cond.size();
lib/Target/Hexagon/HexagonISelDAGToDAG.cpp 1668 return Q.size() + HaveConst;
1729 for (int Pos = 0, End = Q.size(); Pos != End; ++Pos) {
1756 for (int Pos = 0, End = Q.size(); Pos != End; ++Pos) {
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 1834 unsigned LogPos, N = C.size();
1854 int D = Len - C.size();
1881 if (C.size() <= 1)
1912 for (unsigned I = 0, E = SwapElems.size(); I != E; ) {
lib/Target/Hexagon/HexagonISelLowering.cpp 214 for (unsigned i = 0; i != RVLocs.size(); ++i) {
277 for (unsigned i = 0; i != RVLocs.size(); ++i) {
357 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
380 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
459 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
476 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
505 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
718 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1946 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
1956 assert(ByteMask.size() <= 8);
1965 for (unsigned i = 0, e = ByteMask.size(); i != e; ++i) {
1973 if (ByteMask.size() == 4) {
2000 if (ByteMask.size() == 8) {
2563 for (unsigned i = 0, e = Words[IdxW].size(); i != e; i += 2) {
2576 assert(Scale == 2 && Words[IdxW].size() == 2);
lib/Target/Hexagon/HexagonISelLoweringHVX.cpp 337 assert(ResTy.getVectorNumElements() == ByteMask.size());
368 unsigned NumWords = Words.size();
460 if (Mask.size() == ExtLen)
475 assert(4*Words.size() == Subtarget.getVectorLength());
1064 for (unsigned i = 0, e = Elems.size(); i != e; ++i) {
1126 for (unsigned i = 0, e = Prefixes.size(); i != e; ++i) {
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 2136 if (ExitBlocks.size() != 1)
lib/Target/Hexagon/HexagonMachineScheduler.cpp 70 if (SUd->Succs.size() == 0)
836 CurrSize = (*I)->Succs.size();
837 CandSize = Candidate.SU->Succs.size();
839 CurrSize = (*I)->Preds.size();
840 CandSize = Candidate.SU->Preds.size();
lib/Target/Hexagon/HexagonOptAddrMode.cpp 459 SizeInc += AddaslUseList.size();
739 LLVM_DEBUG(dbgs() << "\t[Total reached uses] : " << UNodeList.size()
lib/Target/Hexagon/HexagonSplitDouble.cpp 492 if (BadLB || Cond.size() != 2)
lib/Target/Hexagon/HexagonVExtract.cpp 121 if (P.second.size() <= VExtractThreshold)
lib/Target/Hexagon/HexagonVLIWPacketizer.cpp 927 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
991 for (unsigned i = 0; i < PacketSU->Succs.size(); ++i) {
1395 for (unsigned i = 0; i < SUJ->Succs.size(); ++i) {
lib/Target/Hexagon/HexagonVectorLoopCarriedReuse.cpp 192 return Chain.size();
225 int ChainSize = CD.size();
486 LLVM_DEBUG(dbgs() << PNUsers.size() << " use(s) of the PHI in the block\n");
lib/Target/Hexagon/MCTargetDesc/HexagonMCChecker.cpp 331 for (unsigned J = 0, N = BranchLocations.size(); J < N; ++J) {
lib/Target/Hexagon/MCTargetDesc/HexagonMCShuffler.cpp 154 while (possibleDuplexes.size() > 0 && (!doneShuffling)) {
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.cpp 182 if (startIdx < hvxInsts.size()) {
607 if (hvxInsts.size() > 0) {
lib/Target/Hexagon/MCTargetDesc/HexagonShuffler.h 174 unsigned size() const { return (Packet.size()); }
lib/Target/Hexagon/RDFGraph.cpp 175 unsigned N = P.Obj.size();
207 unsigned N = P.List.size();
lib/Target/Lanai/AsmParser/LanaiAsmParser.cpp 670 if (ErrorInfo >= Operands.size())
1111 if (Operands.size() < 5)
1143 if (Operands.size() < 4 || !IsRegister(*Operands[1]) ||
1176 Operands.size() == 2) {
1189 Operands.size() == 3) {
lib/Target/Lanai/LanaiISelLowering.cpp 456 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
553 for (unsigned i = 0; i != RVLocs.size(); ++i) {
591 ArrayRef<SDValue>(&RetOps[0], RetOps.size()));
629 for (unsigned I = 0, E = Outs.size(); I != E; ++I) {
657 for (unsigned I = 0, J = 0, E = ArgLocs.size(); I != E; ++I) {
707 ArrayRef<SDValue>(&MemOpChains[0], MemOpChains.size()));
714 for (unsigned I = 0, E = RegsToPass.size(); I != E; ++I) {
747 for (unsigned I = 0, E = RegsToPass.size(); I != E; ++I)
755 ArrayRef<SDValue>(&Ops[0], Ops.size()));
786 for (unsigned I = 0; I != RVLocs.size(); ++I) {
lib/Target/Lanai/LanaiInstrInfo.cpp 648 assert((Condition.size() == 1) &&
lib/Target/MSP430/AsmParser/MSP430AsmParser.cpp 271 if (ErrorInfo >= Operands.size())
500 if (Operands.size() > 1) // Emulate @rd in destination position as 0(rd)
lib/Target/MSP430/MSP430BranchSelector.cpp 212 for (int i = MBB->getNumber() + 1, e = BlockOffsets.size(); i < e; ++i) {
lib/Target/MSP430/MSP430ISelLowering.cpp 474 assert(ArgsParts.size() == 2 &&
482 for (unsigned i = 0, e = ArgsParts.size(); i != e; i++) {
623 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
691 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
745 for (unsigned i = 0; i != RVLocs.size(); ++i) {
811 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
874 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
896 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
933 for (unsigned i = 0; i != RVLocs.size(); ++i) {
lib/Target/MSP430/MSP430InstrInfo.cpp 133 assert(Cond.size() == 1 && "Invalid Xbranch condition!");
246 assert(Cond.size() == 1);
lib/Target/Mips/AsmParser/MipsAsmParser.cpp 1374 int Size = RegList.List->size();
1551 assert(Regs.size() > 0 && "Empty list not allowed");
5572 if (ErrorInfo != ~0ULL && ErrorInfo < Operands.size()) {
5601 if (ErrorInfo >= Operands.size())
6076 assert(Operands.size() == 1);
6093 assert(Operands.size() == 0);
7028 if (AssemblerOptions.size() == 2)
lib/Target/Mips/MCTargetDesc/MipsMCCodeEmitter.cpp 182 unsigned long N = Fixups.size();
208 if (Fixups.size() > N)
lib/Target/Mips/MicroMipsSizeReduction.cpp 386 for (uint8_t i = 0; i < Registers.size() - 1; i++) {
lib/Target/Mips/MipsAnalyzeImmediate.cpp 92 if ((Seq.size() < 2) || (Seq[0].Opc != ADDiu) ||
116 assert(S->size() <= 7);
118 if (S->size() < ShortestLength) {
120 ShortestLength = S->size();
lib/Target/Mips/MipsBranchExpansion.cpp 293 for (unsigned I = 0, E = MBBInfos.size(); I < E; ++I) {
786 for (unsigned I = 0, E = MBBInfos.size(); I < E; ++I) {
lib/Target/Mips/MipsCCState.cpp 89 for (unsigned i = 0; i < Ins.size(); ++i) {
101 for (unsigned i = 0; i < Outs.size(); ++i) {
113 for (unsigned i = 0; i < Ins.size(); ++i) {
122 for (unsigned i = 0; i < Outs.size(); ++i) {
135 for (unsigned i = 0; i < Outs.size(); ++i) {
150 for (unsigned i = 0; i < Ins.size(); ++i) {
lib/Target/Mips/MipsCallLowering.cpp 69 assert(Args[ArgsIndex].Regs.size() == 1 && "Can't handle multple regs yet");
399 for (unsigned i = 0; i < ArgLocs.size(); ++i) {
586 FuncOrigArgs.reserve(Info.OrigArgs.size());
714 for (unsigned i = 0; i < SplitEVTs.size(); ++i) {
lib/Target/Mips/MipsFastISel.cpp 1155 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1292 if (RVLocs.size() != 1)
1527 OutVTs.reserve(CLI.OutVals.size());
1711 if (ValLocs.size() != 1)
1775 for (unsigned i = 0, e = RetRegs.size(); i != e; ++i)
lib/Target/Mips/MipsISelLowering.cpp 3126 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3353 for (unsigned i = 0; i != RVLocs.size(); ++i) {
3496 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3584 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3669 for (unsigned i = 0; i != RVLocs.size(); ++i) {
lib/Target/Mips/MipsInstrInfo.cpp 184 assert( (Cond.size() && Cond.size() <= 3) &&
184 assert( (Cond.size() && Cond.size() <= 3) &&
lib/Target/Mips/MipsSEISelLowering.cpp 2558 if (Indices.size() < 4)
2562 for (unsigned j = i; j < Indices.size(); j += 4) {
2637 assert((Indices.size() % 2) == 0);
2669 assert((Indices.size() % 2) == 0);
2680 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size(), 2))
2689 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size(), 2))
2715 assert((Indices.size() % 2) == 0);
2726 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size() + 1, 2))
2735 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size() + 1, 2))
2762 assert((Indices.size() % 2) == 0);
2773 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size(), 1))
2782 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size(), 1))
2809 assert((Indices.size() % 2) == 0);
2811 unsigned HalfSize = Indices.size() / 2;
2821 else if (fitsRegularPattern<int>(Begin, 2, End, Indices.size() + HalfSize, 1))
2830 else if (fitsRegularPattern<int>(Begin + 1, 2, End, Indices.size() + HalfSize,
2857 assert((Indices.size() % 2) == 0);
2862 const auto &Mid = Indices.begin() + Indices.size() / 2;
2867 else if (fitsRegularPattern<int>(Begin, 1, Mid, Indices.size(), 2))
2874 else if (fitsRegularPattern<int>(Mid, 1, End, Indices.size(), 2))
2900 assert((Indices.size() % 2) == 0);
2905 const auto &Mid = Indices.begin() + Indices.size() / 2;
2910 else if (fitsRegularPattern<int>(Begin, 1, Mid, Indices.size() + 1, 2))
2917 else if (fitsRegularPattern<int>(Mid, 1, End, Indices.size() + 1, 2))
lib/Target/Mips/MipsSEInstrInfo.cpp 626 assert(Seq.size() && (!LastInstrIsADDiu || (Seq.size() > 1)));
626 assert(Seq.size() && (!LastInstrIsADDiu || (Seq.size() > 1)));
lib/Target/NVPTX/NVPTXAsmPrinter.cpp 377 for (unsigned i = 0, e = vtparts.size(); i != e; ++i) {
836 for (unsigned i = 0, e = Globals.size(); i != e; ++i)
1588 for (unsigned i = 0, e = vtparts.size(); i != e; ++i) {
lib/Target/NVPTX/NVPTXISelLowering.cpp 195 for (unsigned i = 0, e = TempVTs.size(); i != e; ++i) {
258 if (Idx + NumElts > ValueVTs.size())
303 VectorInfo.assign(ValueVTs.size(), PVF_SCALAR);
306 for (int I = 0, E = ValueVTs.size(); I != E; ++I) {
1329 if (unsigned len = vtparts.size())
1508 for (unsigned j = 0, je = VTs.size(); j != je; ++j) {
1520 assert(VTs.size() == 1 && "Scalar can't have multiple parts.");
1535 unsigned NumElts = StoreOperands.size() - 3;
1571 if (VTs.size() > 0)
1603 for (unsigned j = 0, je = VTs.size(); j != je; ++j) {
1634 if (Ins.size() > 0) {
1709 Chain, DAG.getConstant((Ins.size() == 0) ? 0 : 1, dl, MVT::i32), InFlag
1764 if (Ins.size() > 0) {
1768 assert(VTs.size() == Ins.size() && "Bad value decomposition");
1768 assert(VTs.size() == Ins.size() && "Bad value decomposition");
1782 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
1806 unsigned NumElts = LoadVTs.size();
1862 for (unsigned i = 0; i < ProxyRegOps.size(); ++i) {
2522 assert(vtparts.size() > 0 && "empty aggregate type not expected");
2523 for (unsigned parti = 0, parte = vtparts.size(); parti != parte;
2528 if (vtparts.size() > 0)
2559 assert(VTs.size() > 0 && "Unexpected empty type.");
2565 for (unsigned parti = 0, parte = VTs.size(); parti != parte; ++parti) {
2623 if (VTs.size() > 0)
2677 assert(VTs.size() == OutVals.size() && "Bad return value decomposition");
2677 assert(VTs.size() == OutVals.size() && "Bad return value decomposition");
2689 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
2714 unsigned NumElts = StoreOperands.size() - 2;
lib/Target/NVPTX/NVPTXImageOptimizer.cpp 86 for (unsigned i = 0, e = InstrToDelete.size(); i != e; ++i)
lib/Target/NVPTX/NVPTXLowerAggrCopies.cpp 98 if (AggrLoads.size() == 0 && MemCalls.size() == 0) {
98 if (AggrLoads.size() == 0 && MemCalls.size() == 0) {
lib/Target/NVPTX/NVPTXMachineFunctionInfo.h 34 for (unsigned i = 0, e = ImageHandleList.size(); i != e; ++i)
39 return ImageHandleList.size()-1;
44 assert(ImageHandleList.size() > Idx && "Bad index");
lib/Target/NVPTX/NVVMReflect.cpp 179 return ToRemove.size() > 0;
lib/Target/PowerPC/AsmParser/PPCAsmParser.cpp 1159 if (ErrorInfo >= Operands.size())
1613 Operands.size() == 4 &&
lib/Target/PowerPC/PPCEarlyReturn.cpp 147 for (unsigned i = 0, ie = PredToRemove.size(); i != ie; ++i)
lib/Target/PowerPC/PPCExpandISEL.cpp 305 if (useSameRegister(TrueValue, FalseValue) && (BIL.size() == 1)) {
lib/Target/PowerPC/PPCFastISel.cpp 1392 for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
1430 for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
1506 assert(RVLocs.size() == 1 && "No support for multi-reg return values!");
1587 if (RVLocs.size() > 1)
1593 unsigned NumArgs = CLI.OutVals.size();
1667 for (unsigned II = 0, IE = RegArgs.size(); II != IE; ++II)
1712 if (ValLocs.size() > 1)
1740 for (unsigned i = 0; i < ValLocs.size(); ++i) {
1795 for (unsigned i = 0, e = RetRegs.size(); i != e; ++i)
lib/Target/PowerPC/PPCFrameLowering.cpp 973 if (isELFv2ABI && MustSaveCRs.size() == 1) {
979 for (unsigned i = 0, e = MustSaveCRs.size(); i != e; ++i)
998 if (isELFv2ABI && MustSaveCRs.size() == 1) {
1004 for (unsigned i = 0, e = MustSaveCRs.size(); i != e; ++i)
1609 for (unsigned i = 0, e = MustSaveCRs.size(); i != e; ++i)
1687 for (unsigned i = 0, e = MustSaveCRs.size(); i != e; ++i)
1949 for (unsigned i = 0, e = FPRegs.size(); i != e; ++i) {
1998 for (unsigned i = 0, e = GPRegs.size(); i != e; ++i) {
2007 for (unsigned i = 0, e = G8Regs.size(); i != e; ++i) {
2077 for (unsigned i = 0, e = VRegs.size(); i != e; ++i) {
lib/Target/PowerPC/PPCHazardRecognizers.cpp 38 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
46 for (unsigned j = 0, je = CurGroup.size(); j != je; ++j)
64 for (unsigned i = 0, ie = (unsigned) SU->Preds.size(); i != ie; ++i) {
72 for (unsigned j = 0, je = CurGroup.size(); j != je; ++j)
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 1440 RLAmt.resize(Bits.size());
1441 for (unsigned i = 0; i < Bits.size(); ++i)
1447 RLAmt[i] = Bits.size() - (VBI - i);
1466 for (unsigned i = 1; i < Bits.size(); ++i) {
1503 Bits.size()-1));
1509 if (BitGroups.size() > 1) {
1514 BitGroups[BitGroups.size()-1].EndIdx == Bits.size()-1 &&
1514 BitGroups[BitGroups.size()-1].EndIdx == Bits.size()-1 &&
1515 BitGroups[0].V == BitGroups[BitGroups.size()-1].V &&
1516 BitGroups[0].RLAmt == BitGroups[BitGroups.size()-1].RLAmt) {
1518 BitGroups[BitGroups.size()-1].EndIdx = BitGroups[0].EndIdx;
1579 for (unsigned i = BG.StartIdx; i < Bits.size(); ++i) {
1708 for (unsigned i = 0; i < Bits.size(); ++i) {
1755 for (unsigned i = 0; i < Bits.size(); ++i) {
1875 if (InstCnt) *InstCnt += BitGroups.size();
1882 getI32Imm(Bits.size() - BG.EndIdx - 1, dl),
1883 getI32Imm(Bits.size() - BG.StartIdx - 1, dl) };
1888 getI32Imm(Bits.size() - BG.EndIdx - 1, dl),
1889 getI32Imm(Bits.size() - BG.StartIdx - 1, dl) };
2106 for (unsigned i = BG.StartIdx; i < Bits.size(); ++i)
2241 for (unsigned i = 0, ie = ValueRotsVec.size(); i < ie; ++i)
2366 if (Bits.size() == 64)
2372 if (Bits.size() == 32) {
2375 assert(Bits.size() == 64 && "Not 64 bits here?");
lib/Target/PowerPC/PPCISelLowering.cpp 3477 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3737 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
3758 for (unsigned ArgNo = 0, e = Ins.size(); ArgNo != e; ++ArgNo) {
4153 for (unsigned ArgNo = 0, e = Ins.size(); ArgNo != e;
4202 for (unsigned ArgNo = 0, e = Ins.size(); ArgNo != e; ++ArgNo) {
4726 for (unsigned i = 0; i != Ins.size(); i++) {
4780 for (unsigned i = 0, e = TailCallArgs.size(); i != e; ++i) {
5132 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
5167 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
5457 unsigned NumArgs = Outs.size();
5528 for (unsigned i = 0, RealArgIdx = 0, j = 0, e = ArgLocs.size();
5540 assert((j < ByValArgLocs.size()) && "Index out of bounds!");
5619 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
5674 unsigned NumOps = Outs.size();
6310 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
6333 unsigned NumOps = Outs.size();
6691 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
6904 for (unsigned i = 0, RealResIdx = 0; i != RVLocs.size(); ++i, ++RealResIdx) {
12163 for (unsigned i = 0, ie = Inputs.size(); i != ie; ++i) {
12190 for (unsigned i = 0, ie = PromOps.size(); i != ie; ++i) {
12215 for (unsigned i = 0, ie = Inputs.size(); i != ie; ++i) {
12376 for (unsigned i = 0, ie = Inputs.size(); i != ie; ++i) {
12404 for (unsigned i = 0, ie = PromOps.size(); i != ie; ++i) {
12434 for (unsigned i = 0, ie = Inputs.size(); i != ie; ++i) {
12457 for (unsigned i = 0, ie = Inputs.size(); i != ie; ++i) {
lib/Target/PowerPC/PPCInstrInfo.cpp 1244 for (unsigned i = 0, e = NewMIs.size(); i != e; ++i)
1302 for (unsigned i = 0, e = NewMIs.size(); i != e; ++i)
1315 assert(Cond.size() == 2 && "Invalid PPC branch opcode!");
1998 for (unsigned i = 0, e = PredsToUpdate.size(); i < e; i++)
2001 for (unsigned i = 0, e = SubRegsToUpdate.size(); i < e; i++)
lib/Target/PowerPC/PPCLoopPreIncPrep.cpp 233 if (Buckets.size() == MaxCandidateNum)
296 for (int j = 0, je = BucketChain.Elements.size(); j != je; ++j) {
lib/Target/PowerPC/PPCReduceCRLogicals.cpp 400 for (unsigned i = 0; i < AllCRLogicalOps.size(); i++)
lib/Target/RISCV/AsmParser/RISCVAsmParser.cpp 799 if (ErrorInfo >= Operands.size())
815 if (ErrorInfo != ~0U && ErrorInfo >= Operands.size())
lib/Target/RISCV/MCTargetDesc/RISCVMCExpr.cpp 66 if (DF->getContents().size() == Offset) {
lib/Target/RISCV/RISCVISelLowering.cpp 1520 assert(PendingLocs.size() == PendingArgFlags.size() &&
1520 assert(PendingLocs.size() == PendingArgFlags.size() &&
1561 if (ArgFlags.isSplitEnd() && PendingLocs.size() <= 2) {
1562 assert(PendingLocs.size() == 2 && "Unexpected PendingLocs.size()");
1587 assert(PendingLocs.size() > 2 && "Unexpected PendingLocs.size()");
1621 unsigned NumArgs = Ins.size();
1648 unsigned NumArgs = Outs.size();
1909 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
2128 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
2156 for (unsigned i = 0, j = 0, e = ArgLocs.size(); i != e; ++i) {
2366 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
2400 for (unsigned i = 0, e = RVLocs.size(); i < e; ++i) {
lib/Target/RISCV/RISCVInstrInfo.cpp 177 assert(Seq.size() > 0);
182 if (++Num == Seq.size())
416 assert((Cond.size() == 3) && "Invalid branch condition!");
lib/Target/RISCV/Utils/RISCVMatInt.cpp 88 Cost += MatSeq.size();
lib/Target/Sparc/AsmParser/SparcAsmParser.cpp 615 if (ErrorInfo >= Operands.size())
lib/Target/Sparc/SparcISelDAGToDAG.cpp 292 OpChanged[OpChanged.size() -1 ] = true;
lib/Target/Sparc/SparcISelLowering.cpp 232 i != RVLocs.size();
316 for (unsigned i = 0; i != RVLocs.size(); ++i) {
345 if (i+1 < RVLocs.size() && RVLocs[i+1].getLocReg() == VA.getLocReg()) {
401 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i, ++InIdx) {
593 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
749 for (unsigned i = 0, e = Outs.size(); i != e; ++i) {
785 for (unsigned i = 0, realArgIdx = 0, byvalArgIdx = 0, e = ArgLocs.size();
933 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
957 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
988 for (unsigned i = 0; i != RVLocs.size(); ++i) {
1048 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1137 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1200 if (i+1 < ArgLocs.size() && ArgLocs[i+1].isRegLoc() &&
1236 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
1257 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
1295 if (CLI.Ins.size() == 1 && CLI.Ins[0].VT == MVT::f32 && !CLI.CS)
1301 for (unsigned i = 0; i != RVLocs.size(); ++i) {
lib/Target/Sparc/SparcInstrInfo.cpp 299 assert(Cond.size() == 1);
lib/Target/SystemZ/AsmParser/SystemZAsmParser.cpp 1097 for (size_t i = 0; i < Operands.size(); i++) {
1275 if (ErrorInfo >= Operands.size())
lib/Target/SystemZ/SystemZCallingConv.h 48 for (unsigned i = 0; i < Ins.size(); ++i)
52 for (unsigned i = 0; i < Ins.size(); ++i)
62 for (unsigned i = 0; i < Outs.size(); ++i)
66 for (unsigned i = 0; i < Outs.size(); ++i)
lib/Target/SystemZ/SystemZElimCompare.cpp 213 if (CCUsers.size() != 1)
257 if (CCUsers.size() != 1)
343 for (unsigned int I = 0, E = CCUsers.size(); I != E; ++I) {
371 for (unsigned I = 0, E = AlterMasks.size(); I != E; I += 2) {
494 if (CCUsers.size() != 1)
lib/Target/SystemZ/SystemZISelLowering.cpp 1228 for (unsigned i = 0; i < Ins.size(); ++i)
1233 for (unsigned i = 0; i < Outs.size(); ++i)
1317 for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
1443 for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
1501 for (unsigned I = 0, E = ArgLocs.size(); I != E; ++I) {
1573 for (unsigned I = 0, E = RegsToPass.size(); I != E; ++I) {
1586 for (unsigned I = 0, E = RegsToPass.size(); I != E; ++I)
1620 for (unsigned I = 0, E = RetLocs.size(); I != E; ++I) {
1682 for (unsigned I = 0, E = RetLocs.size(); I != E; ++I) {
4190 if (unsigned(Base) % Bytes.size() + BytesPerElement > Bytes.size())
4190 if (unsigned(Base) % Bytes.size() + BytesPerElement > Bytes.size())
4364 for (; OpNo < Ops.size(); ++OpNo)
4367 if (OpNo == Ops.size())
4380 assert(Bytes.size() == SystemZ::VectorBytes && "Incomplete vector");
4382 if (Ops.size() == 0)
4386 if (Ops.size() == 1)
4399 for (; Stride * 2 < Ops.size(); Stride *= 2) {
4400 for (unsigned I = 0; I < Ops.size() - Stride; I += Stride * 2) {
4545 if (!GS.add(SDValue(), ResidueOps.size()))
4557 while (ResidueOps.size() < NumElements)
4583 unsigned int NumElements = Elems.size();
5297 unsigned Byte = unsigned(First) % Bytes.size();
5302 Op = Op.getOperand(unsigned(First) / Bytes.size());
lib/Target/SystemZ/SystemZInstrInfo.cpp 425 assert(Cond.size() == 2 && TBB && "Should have seen a conditional branch");
472 assert(Cond.size() == 2 && "Invalid condition");
lib/Target/SystemZ/SystemZRegisterInfo.cpp 94 while (Worklist.size()) {
lib/Target/WebAssembly/AsmParser/WebAssemblyAsmParser.cpp 603 if (ExpectBlockType && Operands.size() == 1) {
820 if (ErrorInfo >= Operands.size())
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyInstPrinter.cpp 171 if (Depth >= ControlFlowStack.size()) {
lib/Target/WebAssembly/MCTargetDesc/WebAssemblyTargetStreamer.cpp 110 Streamer.EmitULEB128IntValue(Grouped.size());
lib/Target/WebAssembly/WebAssemblyAsmPrinter.cpp 208 OutStreamer->EmitULEB128IntValue(Producers.second->size());
251 if (EmittedFeatures.size() == 0)
260 OutStreamer->EmitULEB128IntValue(EmittedFeatures.size());
lib/Target/WebAssembly/WebAssemblyCFGStackify.cpp 999 NumUnwindMismatches += P.second.size();
1218 assert(Depth < Stack.size() && "Branch destination should be in scope");
lib/Target/WebAssembly/WebAssemblyFixFunctionBitcasts.cpp 162 LLVM_DEBUG(dbgs() << "Arg[" << Args.size() << "] Expected: "
lib/Target/WebAssembly/WebAssemblyFixIrreducibleControlFlow.cpp 339 if (SortedEntries.size() > 1) {
lib/Target/WebAssembly/WebAssemblyISelLowering.cpp 667 bool TypesMatch = CallerRetTys.size() == CalleeRetTys.size() &&
667 bool TypesMatch = CallerRetTys.size() == CalleeRetTys.size() &&
689 if (Ins.size() > 1)
698 if (CallConv == CallingConv::WASM_EmscriptenInvoke && Outs.size() >= 2 &&
705 for (unsigned I = 0; I < Outs.size(); ++I) {
744 for (unsigned I = NumFixedArgs; I < Outs.size(); ++I) {
754 CCInfo.addLoc(CCValAssign::getMem(ArgLocs.size(), VT.getSimpleVT(),
856 return Subtarget->hasMultivalue() || Outs.size() <= 1;
864 assert((Subtarget->hasMultivalue() || Outs.size() <= 1) &&
915 DAG.getTargetConstant(InVals.size(),
933 DAG.getTargetConstant(Ins.size(), DL, MVT::i32)));
946 assert(MFI->getParams().size() == Params.size() &&
1387 if (SwizzleCounts.size())
lib/Target/WebAssembly/WebAssemblyInstrInfo.cpp 221 assert(Cond.size() == 2 && "Expected a flag and a condition expression");
lib/Target/WebAssembly/WebAssemblyLowerEmscriptenEHSjLj.cpp 855 Function *FMCF = getFindMatchingCatch(M, FMCArgs.size());
lib/Target/WebAssembly/WebAssemblyMachineFunctionInfo.cpp 52 if (Results.size() > 1 &&
lib/Target/WebAssembly/WebAssemblyRegColoring.cpp 131 SmallVector<unsigned, 16> SlotMapping(SortedIntervals.size(), -1u);
133 SortedIntervals.size());
134 BitVector UsedColors(SortedIntervals.size());
136 for (size_t I = 0, E = SortedIntervals.size(); I < E; ++I) {
167 for (size_t I = 0, E = SortedIntervals.size(); I < E; ++I) {
lib/Target/X86/AsmParser/X86AsmParser.cpp 174 unsigned Idx = InfixOperatorStack.size() - 1;
189 Idx = InfixOperatorStack.size() - 1;
226 for (unsigned i = 0, e = PostfixStack.size(); i != e; ++i) {
231 assert (OperandStack.size() > 0 && "Too few operands.");
247 assert (OperandStack.size() > 1 && "Too few operands.");
315 assert (OperandStack.size() == 1 && "Expected a single result.");
1278 if (OrigOperands.size() > 1) {
1280 assert(OrigOperands.size() == FinalOperands.size() + 1 &&
1280 assert(OrigOperands.size() == FinalOperands.size() + 1 &&
1286 for (unsigned int i = 0; i < FinalOperands.size(); ++i) {
1347 for (unsigned int i = 0; i < FinalOperands.size(); ++i)
1351 for (unsigned int i = 0; i < FinalOperands.size(); ++i)
2682 if (IsFp && Operands.size() == 1) {
2692 (Operands.size() == 3)) {
2720 Operands.size() == 3) {
2729 Operands.size() == 3) {
2741 (Operands.size() == 1 || Operands.size() == 3) &&
2741 (Operands.size() == 1 || Operands.size() == 3) &&
2753 (Operands.size() == 1 || Operands.size() == 3) &&
2753 (Operands.size() == 1 || Operands.size() == 3) &&
2765 (Operands.size() == 1 || Operands.size() == 2) &&
2765 (Operands.size() == 1 || Operands.size() == 2) &&
2776 (Operands.size() == 1 || Operands.size() == 2) &&
2776 (Operands.size() == 1 || Operands.size() == 2) &&
2787 (Operands.size() == 1 || Operands.size() == 2) &&
2787 (Operands.size() == 1 || Operands.size() == 2) &&
2796 (Operands.size() == 1 || Operands.size() == 3) &&
2796 (Operands.size() == 1 || Operands.size() == 3) &&
2811 (Operands.size() == 1 || Operands.size() == 3)) {
2811 (Operands.size() == 1 || Operands.size() == 3)) {
2812 if (Name == "movsd" && Operands.size() == 1 && !isParsingIntelSyntax())
2830 Operands.size() == 3) {
2847 if (Name == "int" && Operands.size() == 2) {
2858 if ((Name == "xlat" || Name == "xlatb") && Operands.size() == 2) {
3299 if (ErrorInfo >= Operands.size())
3401 if (Mnemonic == "push" && Operands.size() == 2) {
lib/Target/X86/MCTargetDesc/X86InstComments.cpp 1279 for (unsigned i = 0, e = ShuffleMask.size(); i != e; ++i) {
1289 for (unsigned i = 0, e = ShuffleMask.size(); i != e; ++i) {
1299 bool isSrc1 = ShuffleMask[i] < (int)ShuffleMask.size();
1304 (ShuffleMask[i] < (int)ShuffleMask.size()) == isSrc1) {
1312 OS << ShuffleMask[i] % ShuffleMask.size();
lib/Target/X86/X86AvoidStoreForwardingBlocks.cpp 656 while (DispSizeStack.size()) {
lib/Target/X86/X86CallFrameOptimization.cpp 445 assert((size_t)StackDisp < Context.ArgStoreVector.size() &&
lib/Target/X86/X86CallLowering.cpp 64 assert(OrigArg.Regs.size() == 1 && "Can't handle multple regs yet");
204 assert(VRegs.size() == SplitEVTs.size() &&
208 for (unsigned i = 0; i < SplitEVTs.size(); ++i) {
414 if (OrigArg.Regs.size() > 1)
461 if (Info.OrigRet.Regs.size() > 1)
lib/Target/X86/X86CallingConv.cpp 46 if (AvailableRegs.size() < RequiredGprsUponSplit)
278 bool UseRegs = PendingMembers.size() <= std::min(2U, NumRegs - FirstFree);
lib/Target/X86/X86CmovConversion.cpp 226 for (int i = 0; i < (int)Loops.size(); ++i)
358 NumOfCmovGroupCandidate += CmovInstGroups.size();
lib/Target/X86/X86CondBrFolding.cpp 298 if (!(CC == X86::COND_E && BranchPath.size() == 1))
381 if (BranchPath.size() > 1)
409 LLVM_DEBUG(dbgs() << "Found one path (len=" << BranchPath.size() << "):\n");
415 LLVM_DEBUG(dbgs() << "Path MBB (" << Index << " of " << BranchPath.size()
425 NumFixedCondBrs += RemoveList.size();
lib/Target/X86/X86FastISel.cpp 1203 if (ValLocs.size() != 1)
1285 for (unsigned i = 0, e = RetRegs.size(); i != e; ++i)
3254 for (int i = 0, e = OutVals.size(); i != e; ++i) {
3318 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
3552 for (unsigned i = 0; i != RVLocs.size(); ++i) {
3595 CLI.NumResultRegs = RVLocs.size();
lib/Target/X86/X86FloatingPoint.cpp 467 for (unsigned i = 0, e = DeadRegs.size(); i != e; ++i) {
lib/Target/X86/X86ISelLowering.cpp 2494 for (unsigned I = 0, OutsIndex = 0, E = RVLocs.size(); I != E;
2577 assert(2 == RegsToPass.size() &&
2835 for (unsigned I = 0, InsIndex = 0, E = RVLocs.size(); I != E;
3216 for (unsigned I = 0, InsIndex = 0, E = ArgLocs.size(); I != E;
3218 assert(InsIndex < Ins.size() && "Invalid Ins index");
3314 for (unsigned I = 0, E = Ins.size(); I != E; ++I) {
3486 } else if (CallConv == CallingConv::X86_INTR && Ins.size() == 2) {
3753 for (unsigned I = 0, OutIndex = 0, E = ArgLocs.size(); I != E;
3755 assert(OutIndex < Outs.size() && "Invalid Out index");
3927 for (unsigned I = 0, OutsIndex = 0, E = ArgLocs.size(); I != E;
3987 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
4031 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
4366 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i)
4375 for (unsigned i = 0, e = Ins.size(); i != e; ++i) {
4385 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
4428 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
4456 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
5329 assert(WidenedMask.size() == Mask.size() / 2 &&
5339 for (int i = 0, Size = TargetMask.size(); i < Size; ++i) {
6177 while (EltBits.size() < NumElts)
6215 for (unsigned i = 0, e = EltSubBits.size(); i != e; ++i)
6298 for (int i = 0, e = EltBits.size(); i != e; ++i) {
6708 if (M >= (int)Mask.size())
6709 M -= Mask.size();
6736 int Size = Mask.size();
6744 assert((VT.getSizeInBits() % Mask.size()) == 0 &&
6814 unsigned NumElts = Mask.size();
6830 unsigned NumElts = Mask.size();
6892 for (int i = 0, e = (int)EltBits.size(); i != e; ++i) {
6955 size_t MaskSize = std::max(SrcMask0.size(), SrcMask1.size());
6955 size_t MaskSize = std::max(SrcMask0.size(), SrcMask1.size());
6957 scaleShuffleMask<int>(MaskSize / SrcMask0.size(), SrcMask0, Mask0);
6958 scaleShuffleMask<int>(MaskSize / SrcMask1.size(), SrcMask1, Mask1);
6967 Mask.push_back(Mask1[i] + (int)(MaskSize * SrcInputs0.size()));
7003 if (SubMask.size() != NumSubElts) {
7004 assert(((SubMask.size() % NumSubElts) == 0 ||
7005 (NumSubElts % SubMask.size()) == 0) && "Illegal submask scale");
7006 if ((NumSubElts % SubMask.size()) == 0) {
7007 int Scale = NumSubElts / SubMask.size();
7012 int Scale = SubMask.size() / NumSubElts;
7013 NumSubElts = SubMask.size();
7069 Mask.append(NumSrcElts - Mask.size(), SM_SentinelUndef);
7238 int MaskWidth = Mask.size();
7240 for (int i = 0, e = Inputs.size(); i < e; ++i) {
7241 int lo = UsedInputs.size() * MaskWidth;
7260 for (int j = 0, ue = UsedInputs.size(); j != ue; ++j) {
8065 assert(Elts.size() == VT.getVectorNumElements());
8433 if (InsertIndices.size() > 1)
8565 for (unsigned i = 0, e = NonConstIdx.size(); i != e; ++i) {
9940 Mask.append(NumElems - Mask.size(), SM_SentinelUndef);
11073 assert(RepeatedMask.size() == 8 && "Repeated mask size doesn't match!");
11143 for (int i = 0, Size = Mask.size(); i < Size; ++i)
11529 int NumElts = RepeatedMask.size();
13434 int NumHToL = LoInputs.size() - NumLToL;
13436 int NumHToH = HiInputs.size() - NumLToH;
13470 for (int j = 0, e = DWordPairs.size(); j < e; ++j) {
13482 PSHUFDMask[DWord] = DOffset + DWordPairs.size();
13487 if (DWordPairs.size() <= 2) {
14244 bool TargetLo = LoInputs.size() >= HiInputs.size();
14244 bool TargetLo = LoInputs.size() >= HiInputs.size();
15215 assert(HalfMask.size() == HalfNumElts && "Unexpected shuffle mask length");
15802 assert(RepeatedMask.size() == 4 &&
15921 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
16296 assert(WidenedMask.size() == 4);
16420 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
16546 assert(RepeatedMask.size() == 4 && "Unexpected repeated mask size!");
19907 for (unsigned Slot = 0, e = Opnds.size(); Slot < e; ++Slot) {
19980 for (unsigned i = 0, e = VecIns.size(); i < e; ++i)
19984 for (unsigned Slot = 0, e = VecIns.size(); e - Slot > 1; Slot += 2, e += 1) {
25859 if (ShuffleMask.size() == NumElts && Amt1 && Amt2 &&
31623 unsigned NumOps = Ops.size();
31625 if (Mask.size() == NumElts) {
31761 unsigned NumOps = Ops.size();
31763 if (Mask.size() == NumElts) {
32165 assert(RepeatedMask.size() == 8 &&
32388 unsigned NumMaskElts = Mask.size();
32891 if (WideInputs.size() > 2)
33070 for (int i = 0, e = Ops.size(); i < e; ++i)
33080 return Ops.size() - 1;
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()) &&
33098 assert(isPowerOf2_32(OpMask.size()) && "Non-power-of-2 shuffle mask sizes");
33100 unsigned OpMaskSizeLog2 = countTrailingZeros(OpMask.size());
33102 unsigned MaskWidth = std::max<unsigned>(OpMask.size(), RootMask.size());
33103 unsigned RootRatio = std::max<unsigned>(1, OpMask.size() >> RootMaskSizeLog2);
33157 int InputIdx = OpMask[OpIdx] / (int)OpMask.size();
33193 if (Ops.size() < (MaxRecursionDepth - Depth)) {
33194 for (int i = 0, e = Ops.size(); i < e; ++i) {
33212 if (Ops.size() <= 2) {
33219 while (Mask.size() > 1 && canWidenShuffleElements(Mask, WidenedMask)) {
33225 if (Ops.size() == 2 && canonicalizeShuffleMaskWithCommute(Mask)) {
33580 assert(Mask.size() == 4);
34653 if (OpMask.size() != (unsigned)NumElts ||
34664 int NumSrcs = OpInputs.size();
35020 int NumOps = ShuffleOps.size();
35021 if (ShuffleMask.size() == (unsigned)NumElts &&
35110 assert(ShuffleMask.size() == NumOriginalElts && "Shuffle mask size mismatch");
35133 (ShuffleOps.size() > 1 && ShuffleOps[0] == ShuffleOps[1]) ? 2 : 1;
35442 while (Ops.size() > 1) {
35443 unsigned NumOps = Ops.size();
36097 if (Mask.size() != NumSrcElts) {
36098 if ((NumSrcElts % Mask.size()) == 0) {
36100 int Scale = NumSrcElts / Mask.size();
36103 } else if ((Mask.size() % NumSrcElts) == 0) {
36106 int Scale = Mask.size() / NumSrcElts;
36109 for (int i = 0, e = (int)Mask.size(); i != e; ++i)
36114 while (Mask.size() > NumSrcElts &&
36123 if (Mask.size() != NumSrcElts)
36136 SDValue SrcOp = Ops[SrcIdx / Mask.size()];
36137 SrcIdx = SrcIdx % Mask.size();
36491 BoolExtracts.size() > 1) {
38603 assert(EltBits.size() == VT.getVectorNumElements() &&
39205 SrcOps.size() == 1) {
39320 for (unsigned i = 0, e = EltBits0.size(); i != e; ++i) {
39571 while (ORNodes.size() > 0) {
39610 SrcOps.size() == 1) {
40809 if (!UseSubVector && SrcShuffleMask.size() == NumElts &&
40810 SrcOps.size() <= 2) {
40811 N0 = SrcOps.size() > 0 ? SrcOps[0] : SDValue();
40812 N1 = SrcOps.size() > 1 ? SrcOps[1] : SDValue();
40815 if (UseSubVector && (SrcShuffleMask.size() == (NumElts * 2)) &&
40816 SrcOps.size() == 1) {
41479 for (unsigned I = 0, E = EltBits.size(); I < E; I++)
44491 if (SubVectorOps.size() == 2 &&
45228 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
45228 if (AsmPieces.size() == 3 || AsmPieces.size() == 4) {
45233 if (AsmPieces.size() == 3)
45255 switch (AsmPieces.size()) {
lib/Target/X86/X86InsertPrefetch.cpp 142 if (index >= Prefetches.size())
150 assert(static_cast<size_t>(max_index + 1) == Prefetches.size() &&
lib/Target/X86/X86InstrInfo.cpp 2421 assert(BranchCond.size() == 1);
2451 assert(BranchCond.size() == 1);
2616 assert(Cond.size() == 1);
2688 if (Cond.size() != 1)
5511 for (unsigned i = 0, e = AddrOps.size(); i != e; ++i)
5586 for (unsigned i = 0, e = AddrOps.size(); i != e; ++i)
5994 assert(Cond.size() == 1 && "Invalid X86 branch condition!");
lib/Target/X86/X86MCInstLower.cpp 87 CurrentShadowSize += Code.size();
1216 if (Code.size() < MinSize) {
1650 for (int i = 0, e = ShuffleMask.size(); i != e; ++i)
1675 for (int i = 0, e = ShuffleMask.size(); i != e; ++i) {
lib/Target/X86/X86SpeculativeLoadHardening.cpp 1997 assert((HardenOpRegs.size() == 1 || HardenOpRegs.size() == 2) &&
1997 assert((HardenOpRegs.size() == 1 || HardenOpRegs.size() == 2) &&
1999 assert((HardenOpRegs.size() == 1 ||
lib/Target/X86/X86TargetMachine.cpp 273 unsigned CPUFSWidth = Key.size();
lib/Target/X86/X86WinEHState.cpp 490 Args.push_back(Builder.getInt32(OptionalArgs.size()));
lib/Target/XCore/XCoreFrameLowering.cpp 195 for (unsigned i = 0, e = SpillList.size(); i != e; ++i) {
280 for (unsigned i = 0, e = SpillList.size(); i != e; ++i) {
332 assert(SpillList.size()==2 && "Unexpected SpillList size");
lib/Target/XCore/XCoreISelLowering.cpp 1066 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
1076 InVals.size()));
1084 for (unsigned i = 0, e = ResultMemLocs.size(); i != e; ++i) {
1141 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1186 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i) {
1211 for (unsigned i = 0, e = RegsToPass.size(); i != e; ++i)
1294 for (unsigned i = 0, e = ArgLocs.size(); i != e; ++i) {
1468 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
1496 for (unsigned i = 0, e = RVLocs.size(); i != e; ++i) {
lib/Target/XCore/XCoreInstrInfo.cpp 404 assert((Cond.size() == 2) &&
lib/Target/XCore/XCoreLowerThreadLocal.cpp 204 for (unsigned I = 0, E = Users.size(); I != E; ++I) {
229 for (unsigned I = 0, E = ThreadLocalGlobals.size(); I != E; ++I) {
lib/Testing/Support/Annotations.cpp 69 require(I != Points.end() && I->getValue().size() == 1,
81 require(I != Ranges.end() && I->getValue().size() == 1,
lib/TextAPI/MachO/PackedVersion.cpp 32 if (Parts.size() > 3)
44 for (unsigned i = 1, ShiftNum = 8; i < Parts.size(); ++i, ShiftNum -= 8) {
67 if (Parts.size() > 5)
83 for (unsigned i = 1, ShiftNum = 8; i < Parts.size() && i < 3;
98 if (Parts.size() > 3)
lib/Transforms/Coroutines/CoroElide.cpp 187 return ReferencedCoroBegins.size() == CoroBegins.size();
lib/Transforms/Coroutines/CoroFrame.cpp 48 size_t size() const { return V.size(); }
168 for (size_t I = 0, N = Block.size(); I < N; ++I) {
414 unsigned IndexBits = std::max(1U, Log2_64_Ceil(Shape.CoroSuspends.size()));
460 S.setFieldIndex(Types.size());
lib/Transforms/Coroutines/CoroSplit.cpp 287 Builder.CreateSwitch(Index, UnreachBB, Shape.CoroSuspends.size());
430 assert(Args.size() == 1);
450 for (size_t I = 0, E = Args.size(); I != E; ++I)
828 auto *ArrTy = ArrayType::get(Part->getType(), Args.size());
1140 size_t I = 0, N = S.size();
1240 Clones.reserve(Shape.CoroSuspends.size());
1241 for (size_t i = 0, e = Shape.CoroSuspends.size(); i != e; ++i) {
1269 Shape.CoroSuspends.size()));
1274 Shape.CoroSuspends.size()));
1283 (ReturnPHIs.size() == 1 ? RetTy : RetTy->getStructElementType(0));
1288 if (ReturnPHIs.size() == 1) {
1293 for (size_t I = 1, E = ReturnPHIs.size(); I != E; ++I)
1306 assert(NextPHIIndex == ReturnPHIs.size());
1309 assert(Clones.size() == Shape.CoroSuspends.size());
1309 assert(Clones.size() == Shape.CoroSuspends.size());
1310 for (size_t i = 0, e = Shape.CoroSuspends.size(); i != e; ++i) {
lib/Transforms/Coroutines/Coroutines.cpp 285 FinalSuspendIndex = CoroSuspends.size() - 1;
312 if (CoroEnds.size() > 1) {
480 FinalSuspendIndex != CoroSuspends.size() - 1)
lib/Transforms/IPO/Attributor.cpp 3225 while (T.isAssumed(NO_CAPTURE_MAYBE_RETURNED) && Idx < PotentialCopies.size())
3807 assert(Attrs.size() == 0);
3814 assert(Attrs.size() <= 1);
4449 << AllAbstractAttributes.size()
4465 size_t NumAAs = AllAbstractAttributes.size();
4522 size_t NumFinalAAs = AllAbstractAttributes.size();
4530 for (unsigned u = 0; u < ChangedAAs.size(); u++) {
4594 NumFinalAAs == AllAbstractAttributes.size() &&
4637 for (unsigned u = 0, e = InternalFns.size(); u < e; ++u) {
lib/Transforms/IPO/BlockExtractor.cpp 122 if (LineSplit.size()!=2)
176 unsigned NextGroupIdx = GroupsOfBlocks.size();
177 GroupsOfBlocks.resize(NextGroupIdx + BlocksByName.size());
lib/Transforms/IPO/ConstantMerge.cpp 235 for (unsigned i = 0, e = SameContentReplacements.size(); i != e; ++i) {
lib/Transforms/IPO/DeadArgumentElimination.cpp 311 for (unsigned I = 0, E = UnusedArgs.size(); I != E; ++I) {
853 assert(ArgAttrVec.size() == Params.size());
923 assert(ArgAttrVec.size() == Args.size());
lib/Transforms/IPO/FunctionAttrs.cpp 771 if (ArgumentSCC[0]->Uses.size() == 1 &&
lib/Transforms/IPO/GlobalOpt.cpp 252 for (int i = 0, e = Dead.size(); i != e; ++i) {
732 if (Idxs.size() == GEPI->getNumOperands()-1)
1843 if (Loads.size() * Stores.size() > Threshold)
1843 if (Loads.size() * Stores.size() > Threshold)
2521 Elts.reserve(SimpleCEs.size());
2617 ArrayType *ATy = ArrayType::get(Int8PtrTy, UsedArray.size());
lib/Transforms/IPO/IPConstantPropagation.cpp 72 if (F.isVarArg() ? ArgumentConstants.size() > NumActualArgs
73 : ArgumentConstants.size() != NumActualArgs)
79 for (unsigned i = 0, e = ArgumentConstants.size(); i != e; ++i, ++Arg) {
101 if (++NumNonconstant == ArgumentConstants.size())
117 if (++NumNonconstant == ArgumentConstants.size())
125 assert(NumNonconstant != ArgumentConstants.size());
128 for (unsigned i = 0, e = ArgumentConstants.size(); i != e; ++i, ++AI) {
180 for (unsigned i = 0, e = RetVals.size(); i != e; ++i) {
214 if (++NumNonConstant == RetVals.size())
lib/Transforms/IPO/Inliner.cpp 183 for (unsigned AllocaNo = 0, e = IFI.StaticAllocas.size(); AllocaNo != e;
486 assert(unsigned(InlineHistoryID) < InlineHistory.size() &&
592 LLVM_DEBUG(dbgs() << ": " << CallSites.size() << " call sites.\n");
600 unsigned FirstCallInSCC = CallSites.size();
618 for (unsigned CSi = 0; CSi != CallSites.size(); ++CSi) {
709 int NewHistoryID = InlineHistory.size();
972 for (int i = 0; i < (int)Calls.size(); ++i) {
1025 for (; i < (int)Calls.size() && Calls[i].first.getCaller() == &F; ++i) {
1097 int NewHistoryID = InlineHistory.size();
lib/Transforms/IPO/LoopExtractor.cpp 119 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
133 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
lib/Transforms/IPO/LowerTypeTests.cpp 1214 unsigned ArgIndex = AsmArgs.size();
1388 ArgTypes.reserve(AsmArgs.size());
lib/Transforms/IPO/PartialInlining.cpp 162 unsigned GetNumInlinedBlocks() const { return Entries.size() + 1; }
416 return BlockList.size() > 1 && Dom->hasNPredecessors(1);
911 2 * InlineConstants::InstrCost * Cloner.OutlinedFunctions.size();
1050 unsigned NumPredsFromEntries = ClonedOI->ReturnBlockPreds.size();
lib/Transforms/IPO/SampleProfile.cpp 1187 NumTotalEdges = Predecessors[BB].size();
1199 NumTotalEdges = Successors[BB].size();
1448 SortedCallTargets.size());
lib/Transforms/IPO/WholeProgramDevirt.cpp 1629 (LoadedPtrs.size() == 1 && !HasNonCallUses) ? LoadedPtrs[0] : CI);
1640 IRBuilder<> CallB((Preds.size() == 1 && !HasNonCallUses) ? Preds[0] : CI);
1662 NumUnsafeUses = DevirtCalls.size();
lib/Transforms/InstCombine/InstCombineAddSub.cpp 514 unsigned AddendNum = Addends.size();
543 unsigned StartIdx = SimpVect.size();
563 if (StartIdx + 1 != SimpVect.size()) {
566 for (unsigned Idx = StartIdx + 1; Idx < SimpVect.size(); Idx++)
701 unsigned OpndNum = Opnds.size();
lib/Transforms/InstCombine/InstCombineCalls.cpp 4619 assert((ArgAttrs.size() == FT->getNumParams() || FT->isVarArg()) &&
lib/Transforms/InstCombine/InstCombineCasts.cpp 1916 ElementIndex = Elements.size() - ElementIndex - 1;
2021 for (unsigned i = 0, e = Elements.size(); i != e; ++i) {
lib/Transforms/InstCombine/InstCombineCompares.cpp 1047 if (Worklist.size() >= MaxIter)
1054 assert(Worklist.size() <= MaxIter);
1089 if (Worklist.size() >= MaxIter)
lib/Transforms/InstCombine/InstCombineLoadStoreAlloca.cpp 410 for (unsigned i = 0, e = ToDelete.size(); i != e; ++i)
lib/Transforms/InstCombine/InstCombineMulDivRem.cpp 892 return Actions.size();
899 return Actions.size();
911 return Actions.size();
1017 for (unsigned i = 0, e = UDivActions.size(); i != e; ++i) {
lib/Transforms/InstCombine/InstCombinePHI.cpp 179 assert(AvailablePtrVals.size() == PN.getNumIncomingValues() &&
447 SmallVector<PHINode*, 16> OperandPhis(FixedOperands.size());
450 for (unsigned i = 0, e = FixedOperands.size(); i != e; ++i) {
470 for (unsigned op = 0, e = OperandPhis.size(); op != e; ++op)
966 for (unsigned PHIId = 0; PHIId != PHIsToSlice.size(); ++PHIId) {
1026 for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i) dbgs()
1037 for (unsigned UserI = 0, UserE = PHIUsers.size(); UserI != UserE; ++UserI) {
1120 for (unsigned i = 1, e = PHIsToSlice.size(); i != e; ++i)
lib/Transforms/InstCombine/InstCombineShifts.cpp 148 for (unsigned i = 0, NumElts = NewOps.size(); i != NumElts; ++i) {
lib/Transforms/InstCombine/InstCombineVectorOps.cpp 1397 for (unsigned i = 0, e = Mask.size(); i != e; ++i) {
1416 unsigned MaskElems = Mask.size();
1764 int NumElts = Mask.size();
1858 SmallVector<Constant *, 16> NewMask(Mask.size(), UndefValue::get(I32Ty));
1859 for (int i = 0, e = Mask.size(); i != e; ++i) {
1998 unsigned MaskElems = Mask.size();
2226 for (unsigned i = 0, e = newMask.size(); i != e; ++i) {
lib/Transforms/InstCombine/InstructionCombining.cpp 2376 for (unsigned i = 0, e = Users.size(); i != e; ++i) {
2394 for (unsigned i = 0, e = Users.size(); i != e; ++i) {
2935 if (NewFilterElts.size() < NumTypeInfos)
2940 NewFilterElts.size());
2951 if (MakeNewFilter && !NewFilterElts.size()) {
2964 for (unsigned i = 0, e = NewClauses.size(); i + 1 < e; ) {
2999 for (unsigned i = 0; i + 1 < NewClauses.size(); ++i) {
3009 for (unsigned j = NewClauses.size() - 1; j != i; --j) {
3091 NewClauses.size());
3092 for (unsigned i = 0, e = NewClauses.size(); i != e; ++i)
lib/Transforms/Instrumentation/AddressSanitizer.cpp 2223 size_t n = GlobalsToChange.size();
2703 ToInstrument.size() > (unsigned)ClInstrumentationWithCallsThreshold);
3011 SVD.reserve(AllocaVec.size());
3183 SmallVector<uint8_t, 64> ShadowClean(ShadowAfterScope.size(), 0);
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 182 assert(RegInfos.size() > 0 && "Empty CHRScope");
189 assert(RegInfos.size() > 0 && "Empty CHRScope");
194 assert(RegInfos.size() > 0 && "Empty CHRScope");
216 assert(RegInfos.size() > 0 && "Empty CHRScope");
217 assert(Next->RegInfos.size() > 0 && "Empty CHRScope");
470 assert(RegInfos.size() > 0 && "Empty CHRScope");
472 OS << RegInfos.size() << ", Regions[";
477 if (RI.Selects.size() > 0)
478 OS << " S" << RI.Selects.size();
832 if (Selects.size() > 0) {
1239 assert(Splits.size() == SplitsConditionValues.size() &&
1239 assert(Splits.size() == SplitsConditionValues.size() &&
1240 Splits.size() == SplitsSplitFromOuter.size() &&
1240 Splits.size() == SplitsSplitFromOuter.size() &&
1241 Splits.size() == SplitsInsertPoints.size() && "Mismatching sizes");
1241 Splits.size() == SplitsInsertPoints.size() && "Mismatching sizes");
1242 for (size_t I = 0; I < Splits.size(); ++I) {
1258 for (size_t I = 0; I < Splits.size(); ++I) {
1442 Output.resize(Input.size());
1611 if (Users.size() > 0) {
1698 assert(Scope->RegInfos.size() >= 1 && "Should have at least one Region");
1701 Region *LastRegion = Scope->RegInfos[Scope->RegInfos.size() - 1].R;
1790 for (unsigned i = 0, e = NewBlocks.size(); i != e; ++i)
1991 dbgs() << Label << " " << Scopes.size() << "\n";
2027 CHR_DEBUG(dbgs() << "Set per-scope bias " << SplitScopes.size() << "\n");
lib/Transforms/Instrumentation/DataFlowSanitizer.cpp 521 ArgumentIndexMapping.push_back(ArgTypes.size());
525 ArgumentIndexMapping.push_back(ArgTypes.size());
lib/Transforms/Instrumentation/GCOVProfiling.cpp 260 return lengthOfGCOVString(Filename) + 2 + Lines.size();
266 for (int i = 0, e = Lines.size(); i != e; ++i)
381 for (int i = 0, e = Block.OutEdges.size(); i != e; ++i)
427 write(Block.OutEdges.size() * 2 + 1);
429 for (int i = 0, e = Block.OutEdges.size(); i != e; ++i) {
1026 assert(CountersSize == (int)EmitFunctionCallArgsArray.size() &&
1028 assert(CountersSize == (int)EmitArcsCallArgsArray.size() &&
1070 if ((int64_t)FileInfos.size() > (int64_t)INT_MAX)
1075 auto *FileInfoArrayTy = ArrayType::get(FileInfoTy, FileInfos.size());
1179 Builder.CreateICmpSLT(NextIV, Builder.getInt32(FileInfos.size()));
lib/Transforms/Instrumentation/HWAddressSanitizer.cpp 1050 for (unsigned N = 0; N < Allocas.size(); ++N) {
lib/Transforms/Instrumentation/InstrProfiling.cpp 258 if (ExitBlocks.size() == 0)
308 if (ExitingBlocks.size() == 1)
310 if (ExitingBlocks.size() > SpeculativeCounterPromotionMaxExiting)
340 if (ExitingBlocks.size() == 1)
343 if (ExitingBlocks.size() > SpeculativeCounterPromotionMaxExiting)
357 unsigned PendingCandsInTarget = LoopToCandidates[TargetLoop].size();
lib/Transforms/Instrumentation/MemorySanitizer.cpp 1318 InstrumentationList.size() + StoreList.size() >
1318 InstrumentationList.size() + StoreList.size() >
3957 for (size_t i = 0, n = VAStartInstrumentationList.size(); i < n; i++) {
4100 for (size_t i = 0, n = VAStartInstrumentationList.size(); i < n; i++) {
4294 for (size_t i = 0, n = VAStartInstrumentationList.size(); i < n; i++) {
4537 for (size_t i = 0, n = VAStartInstrumentationList.size(); i < n; i++) {
lib/Transforms/Instrumentation/PGOInstrumentation.cpp 1103 if (SrcInfo.CountValid && SrcInfo.OutEdges.size() == 1)
1110 if (DestInfo.CountValid && DestInfo.InEdges.size() == 1)
1305 unsigned Size = BBCountInfo.OutEdges.size();
lib/Transforms/Instrumentation/PGOMemOPSizeOpt.cpp 356 SwitchInst *SI = IRB.CreateSwitch(SizeVar, DefaultBB, SizeIds.size());
370 Updates.reserve(2 * SizeIds.size());
lib/Transforms/Instrumentation/SanitizerCoverage.cpp 772 ArrayType *ArrayOfInt64Ty = ArrayType::get(Int64Ty, Initializers.size());
lib/Transforms/Scalar/CallSiteSplitting.cpp 181 assert(Preds.size() == 2 && "Expected exactly 2 predecessors!");
198 if (Preds.size() != 2 || isa<IndirectBrInst>(Preds[0]->getTerminator()) ||
318 CallPN = PHINode::Create(Instr->getType(), Preds.size(), "phi.call");
324 assert(Preds.size() == 2 && "The ValueToValueMaps array has size 2.");
328 for (unsigned i = 0; i < Preds.size(); i++) {
369 assert(Splits.size() == 2 && "Expected exactly 2 splits!");
370 for (unsigned i = 0; i < Splits.size(); i++) {
402 PHINode *NewPN = PHINode::Create(CurrentI->getType(), Preds.size());
lib/Transforms/Scalar/ConstantHoisting.cpp 250 while (Idx != Orders.size()) {
265 InsertPtsMap.reserve(Orders.size() + 1);
558 NumUses += ConstCand->Uses.size();
571 NumUses += ConstCand->Uses.size();
860 if (ToBeRebased.size() < MinNumOfDependentToRebase) {
861 NotRebasedNum += ToBeRebased.size();
909 NumConstantsRebased += ConstInfo.RebasedConstants.size() - 1;
lib/Transforms/Scalar/GVN.cpp 735 if (ValuesPerBlock.size() == 1 &&
986 unsigned NumDeps = Deps.size();
1020 assert(NumDeps == ValuesPerBlock.size() + UnavailableBlocks.size() &&
1020 assert(NumDeps == ValuesPerBlock.size() + UnavailableBlocks.size() &&
1138 unsigned NumUnavailablePreds = PredLoads.size() + CriticalEdgePred.size();
1222 << "INSERTED " << NewInsts.size() << " INSTS: " << *NewInsts.back()
1323 unsigned NumDeps = Deps.size();
1662 for (unsigned i = 0; i < Exp.varargs.size(); i++) {
1673 assert(Exp.varargs.size() == 2 && "Unsupported commutative expression!");
2168 NumGVNInstr += InstrsToErase.size();
2383 PHINode::Create(CurInst->getType(), predMap.size(),
2385 for (unsigned i = 0, e = predMap.size(); i != e; ++i) {
lib/Transforms/Scalar/GVNHoist.cpp 649 if (si != RenameStack.end() && si->second.size() &&
768 if (V.size() < 2)
788 for (unsigned i = 0; i < V.size(); ++i) {
794 for (unsigned i = 0; i < V.size(); ++i) {
lib/Transforms/Scalar/GVNSink.cpp 288 assert(Blocks.size() == NewBlocks.size());
772 if (Preds.size() < 2)
776 unsigned NumOrigPreds = Preds.size();
798 Cand->calculateCost(NumOrigPHIs, Preds.size());
815 if (C.Blocks.size() < NumOrigPreds) {
852 auto *PN = PHINode::Create(Op->getType(), Insts.size(),
882 NumRemoved += Insts.size() - 1;
lib/Transforms/Scalar/GuardWidening.cpp 393 if (Index == GuardsInCurBB.size())
398 assert(Index == GuardsInCurBB.size() &&
690 unsigned OldCount = Checks.size();
706 assert(CurrentChecks.size() != 0 && "We know we have at least one!");
708 if (CurrentChecks.size() < 3) {
782 assert(RangeChecksOut.size() <= OldCount && "We pessimized!");
783 return RangeChecksOut.size() != OldCount;
lib/Transforms/Scalar/IndVarSimplify.cpp 512 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
833 if (ExitBlocks.size() != 1 || ExitingBlocks.size() != 1)
833 if (ExitBlocks.size() != 1 || ExitingBlocks.size() != 1)
2889 for (unsigned i = 1; i < ExitingBlocks.size(); i++)
2895 for (unsigned i = 0, e = ExitingBlocks.size(); i < e; i++)
lib/Transforms/Scalar/InductiveRangeCheckElimination.cpp 1810 OS << "irce: loop has " << RangeChecks.size()
lib/Transforms/Scalar/JumpThreading.cpp 1429 if (PredsScanned.size() != AvailablePreds.size() &&
1438 if (PredsScanned.size() == AvailablePreds.size()+1 &&
1441 } else if (PredsScanned.size() != AvailablePreds.size()) {
1679 if (BB->hasNPredecessors(PredToDestList.size())) {
1878 if (BlocksToFoldInto.size() ==
1960 if (PredBBs.size() == 1)
1963 LLVM_DEBUG(dbgs() << " Factoring out " << PredBBs.size()
2126 Updates.reserve((2 * Preds.size()) + NewBBs.size());
2196 BBSuccProbs.assign(BBSuccFreq.size(),
2197 {1, static_cast<unsigned>(BBSuccFreq.size())});
2208 for (int I = 0, E = BBSuccProbs.size(); I < E; I++)
2245 if (BBSuccProbs.size() >= 2 && doesBlockHaveProfileData(BB)) {
2287 if (PredBBs.size() == 1)
2290 LLVM_DEBUG(dbgs() << " Factoring out " << PredBBs.size()
lib/Transforms/Scalar/LICM.cpp 417 InsertPts.reserve(ExitBlocks.size());
419 MSSAInsertPts.reserve(ExitBlocks.size());
1794 for (unsigned i = 0, e = LoopExitBlocks.size(); i != e; ++i) {
lib/Transforms/Scalar/LoopDistribute.cpp 509 unsigned N = RtPtrCheck->Pointers.size();
lib/Transforms/Scalar/LoopFuse.cpp 469 size_t size() const { return LoopsOnLevel.size() - RemovedLoops.size(); }
539 assert(LV.size() > 0 && "Empty loop set was build!");
543 if (LV.size() == 1)
548 dbgs() << " Visit loop set (#" << LV.size() << "):\n";
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 621 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i)
672 for (unsigned i = 0, e = SL.size(); i < e; ++i) {
1974 assert(ExitBlocks.size() <= 2U && "Can't have more than two exit blocks.");
2340 assert(LoopExitEdges.size() == 2 && "Should have only to two exit edges.");
2371 assert(DTUpdates.size() == 8 && "Update count prediction failed.");
2456 assert(DTUpdates.size() == 3 && "Update count prediction failed.");
2564 assert(DTUpdates.size() == 6 && "Update count prediction failed.");
lib/Transforms/Scalar/LoopInterchange.cpp 109 LLVM_DEBUG(dbgs() << "Found " << MemInstr.size()
487 return LoopList.size() - 1;
492 unsigned LoopNestDepth = LoopList.size();
777 if (Inductions.size() != 1) {
806 if (Inductions.size() != 1) {
lib/Transforms/Scalar/LoopLoadElimination.cpp 405 LLVM_DEBUG(dbgs() << "\nPointer Checks (count: " << Checks.size()
526 if (Checks.size() > Candidates.size() * CheckPerElim) {
526 if (Checks.size() > Candidates.size() * CheckPerElim) {
lib/Transforms/Scalar/LoopPredication.cpp 910 if (ExitEdges.size() == 1)
lib/Transforms/Scalar/LoopRerollPass.cpp 229 return Instructions.size()-1;
279 for (unsigned i = 0, e = PossibleReds.size(); i != e; ++i)
633 if (Instructions.size() < 2 ||
825 if (BaseUsers.size()) {
834 unsigned NumBaseUses = BaseUsers.size();
896 unsigned N = DRS.Roots.size() + 1;
987 if (V.Roots.empty() || V.Roots.size() != RootSets[0].Roots.size()) {
987 if (V.Roots.empty() || V.Roots.size() != RootSets[0].Roots.size()) {
995 Scale = RootSets[0].Roots.size() + 1;
1448 for (size_t i = 0, e = RootSets.size(); i != e; ++i)
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 258 assert(L.getNumBlocks() == LiveLoopBlocks.size() + DeadLoopBlocks.size() &&
470 NumLoopBlocksDeleted += DeadLoopBlocks.size();
565 if (BlocksInLoopAfterFolding.size() + DeadLoopBlocks.size() !=
579 LLVM_DEBUG(dbgs() << "Constant-folding " << FoldCandidates.size()
587 LLVM_DEBUG(dbgs() << "Deleting " << DeadLoopBlocks.size()
lib/Transforms/Scalar/LoopStrengthReduce.cpp 467 return BaseRegs.size() <= 1;
541 if (BaseRegs.size() != 1 || ScaledReg)
549 return !!ScaledReg + BaseRegs.size();
1528 return ((float)(Formulae.size() - FNum)) / Formulae.size();
1528 return ((float)(Formulae.size() - FNum)) / Formulae.size();
1886 bool hasIncs() const { return Incs.size() >= 2; }
2589 size_t LUIdx = Uses.size();
2606 RegUses.swapAndDropUse(LUIdx, Uses.size());
2615 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
2914 unsigned ChainIdx = 0, NChains = IVChainVec.size();
3063 for (unsigned ChainIdx = 0, NChains = IVChainVec.size();
3091 for (unsigned UsersIdx = 0, NChains = IVChainVec.size();
3473 CountRegisters(LU.Formulae.back(), Uses.size() - 1);
3585 if (AddOps.size() == 1)
3610 if (InnerAddOps.size() == 1 &&
3657 Depth + 1 + (Log2_32(AddOps.size()) >> 2));
3669 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i)
3682 if (Base.BaseRegs.size() + (Base.Scale == 1) +
3705 if (Ops.size() == 0)
3725 if (Ops.size() > 1) {
3766 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i)
3855 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i)
3922 for (size_t i = 0, e = F.BaseRegs.size(); i != e; ++i) {
3972 Base.HasBaseReg = Base.BaseRegs.size() > 1;
3992 for (size_t i = 0, e = Base.BaseRegs.size(); i != e; ++i) {
4195 for (size_t L = 0, LE = LU.Formulae.size(); L != LE; ++L) {
4230 for (size_t N = 0, NE = F.BaseRegs.size(); N != NE; ++N) {
4276 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4278 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4280 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4283 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4285 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4287 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4289 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4291 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4294 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4296 for (size_t i = 0, f = LU.Formulae.size(); i != f; ++i)
4324 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4330 for (size_t FIdx = 0, NumForms = LU.Formulae.size();
4414 size_t FSize = LU.Formulae.size();
4437 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4440 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
4504 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4531 for (size_t i = 0, e = LUThatHas->Formulae.size(); i != e; ++i) {
4601 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4637 for (size_t FIdx = 0, NumForms = LU.Formulae.size(); FIdx != NumForms;
4751 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4754 if (LU.Formulae.size() < 2)
4762 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
4794 while (LU.Formulae.size() != 1) {
4800 assert(LU.Formulae.size() == 1 && "Should be exactly 1 min regs formula");
4849 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx) {
4854 for (size_t i = 0, e = LU.Formulae.size(); i != e; ++i) {
4908 const LSRUse &LU = Uses[Workspace.size()];
4947 if (Workspace.size() != Uses.size()) {
4947 if (Workspace.size() != Uses.size()) {
4950 if (F.getNumRegs() == 1 && Workspace.size() == 1)
4976 Workspace.reserve(Uses.size());
4990 for (size_t i = 0, e = Uses.size(); i != e; ++i) {
4999 assert(Solution.size() == Uses.size() && "Malformed solution!");
4999 assert(Solution.size() == Uses.size() && "Malformed solution!");
5093 for (unsigned i = 1, e = ExitingBlocks.size(); i != e; ++i)
5382 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx)
5478 for (size_t LUIdx = 0, NumUses = Uses.size(); LUIdx != NumUses; ++LUIdx)
5575 LLVM_DEBUG(dbgs() << "LSR found " << Uses.size() << " uses:\n";
lib/Transforms/Scalar/LoopUnswitch.cpp 1218 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
1308 for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
lib/Transforms/Scalar/MemCpyOptimizer.cpp 106 if (TheStores.size() >= 4 || End-Start >= 16) return true;
109 if (TheStores.size() < 2) return false;
119 if (TheStores.size() == 2) return false;
143 return TheStores.size() > NumPointerStores+NumByteStores;
379 if (Range.TheStores.size() == 1) continue;
lib/Transforms/Scalar/NewGVN.cpp 221 unsigned ComponentID = Components.size();
222 Components.resize(Components.size() + 1);
3744 assert(ValueStack.size() == DFSStack.size() &&
3744 assert(ValueStack.size() == DFSStack.size() &&
lib/Transforms/Scalar/Reassociate.cpp 79 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
604 for (unsigned i = 0, e = LeafOrder.size(); i != e; ++i) {
636 assert(Ops.size() > 1 && "Single values should be used directly!");
664 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
675 if (i+2 == Ops.size()) {
804 for (unsigned i = 0, e = NodesToRewrite.size(); i != e; ++i)
1005 unsigned e = Ops.size();
1030 if (Ops.size() == 1) return Ops.back();
1049 Factors.reserve(Tree.size());
1050 for (unsigned i = 0, e = Tree.size(); i != e; ++i) {
1058 for (unsigned i = 0, e = Factors.size(); i != e; ++i) {
1097 if (Factors.size() == 1) {
1135 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1137 assert(i < Ops.size());
1152 assert(i < Ops.size());
1153 if (i+1 != Ops.size() && Ops[i+1].Op == Ops[i].Op) {
1316 if (Ops.size() == 1)
1325 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1343 for (unsigned i = 0, e = Opnds.size(); i != e; ++i)
1366 for (unsigned i = 0, e = Opnds.size(); i < e; i++) {
1407 for (unsigned int i = 0, e = Opnds.size(); i < e; i++) {
1419 unsigned Sz = Ops.size();
1441 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1446 if (i+1 != Ops.size() && Ops[i+1].Op == TheOp) {
1452 } while (i != Ops.size() && Ops[i].Op == TheOp);
1479 e = Ops.size();
1494 if (Ops.size() == 2 &&
1499 if (Ops.size() == 2 && match(TheOp, m_Not(m_Value())))
1531 for (unsigned i = 0, e = Ops.size(); i != e; ++i) {
1540 assert(Factors.size() > 1 && "Bad linearize!");
1544 for (unsigned i = 0, e = Factors.size(); i != e; ++i) {
1602 for (unsigned i = 0; i != Ops.size(); ++i) {
1612 for (unsigned j = Ops.size(); j != i;) {
1626 unsigned NumAddedValues = NewMulOps.size();
1674 for (unsigned Idx = 1, Size = Ops.size(); Idx < Size; ++Idx) {
1695 for (unsigned Idx = 1; Idx < Ops.size(); ++Idx) {
1700 for (; Idx < Ops.size() && Ops[Idx].Op == Op; ++Idx)
1725 if (Ops.size() == 1)
1750 for (unsigned LastIdx = 0, Idx = 1, Size = Factors.size();
1786 for (unsigned Idx = 0, Size = Factors.size(); Idx != Size; ++Idx) {
1796 if (OuterProduct.size() == 1)
1807 if (Ops.size() < 4)
1856 if (Ops.size() == 1) return Ops[0].Op;
1860 unsigned NumOps = Ops.size();
1887 if (Ops.size() != NumOps)
1920 for (unsigned i = 0, e = Ops.size(); i != e; ++i)
2007 bool NeedsSubtract = !IsFSub && Candidates.size() % 2 == 1;
2031 if (Candidates.size() % 2 == 0)
2036 assert(Candidates.size() % 2 == 1 && "Expected odd number");
2202 Ops.reserve(Tree.size());
2203 for (unsigned i = 0, e = Tree.size(); i != e; ++i) {
2260 if (Ops.size() == 1) {
2274 if (Ops.size() > 2 && Ops.size() <= GlobalReassociateLimit) {
2274 if (Ops.size() > 2 && Ops.size() <= GlobalReassociateLimit) {
2285 for (unsigned i = 0; i < Ops.size() - 1; ++i)
2286 for (unsigned j = i + 1; j < Ops.size(); ++j) {
2341 while (!Worklist.empty() && Ops.size() <= GlobalReassociateLimit) {
2355 if (Ops.size() > GlobalReassociateLimit)
2361 for (unsigned i = 0; i < Ops.size() - 1; ++i) {
2362 for (unsigned j = i + 1; j < Ops.size(); ++j) {
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 1419 assert(BasePtrs.size() == LiveVariables.size());
1419 assert(BasePtrs.size() == LiveVariables.size());
1617 assert(LiveVec.size() == BaseVec.size());
1617 assert(LiveVec.size() == BaseVec.size());
1864 assert(PromotableAllocas.size() == Live.size() + NumRematerializedValues &&
2037 if ( ChainToBase.size() == 0 ||
2038 ChainToBase.size() > ChainLengthThreshold)
2178 assert(Uniqued.size() == ToUpdate.size() && "no duplicates please!");
2217 SmallVector<PartiallyConstructedSafepointRecord, 64> Records(ToUpdate.size());
2230 for (size_t i = 0; i < Records.size(); i++) {
2249 Holders.reserve(Holders.size() + Records.size());
2249 Holders.reserve(Holders.size() + Records.size());
2250 for (size_t i = 0; i < Records.size(); i++) {
2299 for (size_t i = 0; i < Records.size(); i++)
2313 for (size_t i = 0; i < Records.size(); i++)
2338 for (size_t i = 0; i < Records.size(); i++) {
lib/Transforms/Scalar/SCCP.cpp 867 for (unsigned i = 0, e = SuccFeasible.size(); i != e; ++i)
2208 for (unsigned i = 0, e = ReturnsToZap.size(); i != e; ++i) {
lib/Transforms/Scalar/SROA.cpp 266 int OldSize = Slices.size();
594 assert(P.SplitTails.size() == RHS.P.SplitTails.size() &&
594 assert(P.SplitTails.size() == RHS.P.SplitTails.size() &&
901 MemTransferSliceMap.insert(std::make_pair(&II, AS.Slices.size()));
1404 if (Indices.size() == 1 && cast<ConstantInt>(Indices.back())->isZero())
3315 unsigned OldSize = Indices.size();
3319 assert(Indices.size() == OldSize && "Did not return to the old size");
3330 unsigned OldSize = Indices.size();
3334 assert(Indices.size() == OldSize && "Did not return to the old size");
lib/Transforms/Scalar/Scalarizer.cpp 251 assert(Size == CachePtr->size() && "Inconsistent vector sizes");
370 for (unsigned I = 0, E = SV.size(); I != E; ++I) {
404 for (unsigned I = 0, E = CV.size(); I != E; ++I) {
lib/Transforms/Scalar/SeparateConstOffsetFromGEP.cpp 634 distributeExtsAndCloneChain(UserChain.size() - 1);
644 return removeConstOffset(UserChain.size() - 1);
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 625 ExitCases.reserve(ExitCaseIndices.size());
676 auto *NewSI = SwitchInst::Create(LoopCond, NewPH, ExitCases.size(), OldPH);
2616 dbgs() << "Considering " << UnswitchCandidates.size()
lib/Transforms/Scalar/SimplifyCFGPass.cpp 155 for (unsigned i = 0, e = Edges.size(); i != e; ++i)
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 609 int NumSpecInsts = SpecList.size() * SpecPreds.size();
609 int NumSpecInsts = SpecList.size() * SpecPreds.size();
610 int NumRedundantInsts = NumSpecInsts - SpecList.size();
652 for (int PredIdx : llvm::seq<int>(0, SpecPreds.size())) {
704 auto *SpecIPN = IRB.CreatePHI(OrigI->getType(), SpecPreds.size(),
708 for (int PredIdx : llvm::seq<int>(0, SpecPreds.size()))
lib/Transforms/Scalar/StructurizeCFG.cpp 646 for (size_t i = 0; i < InsertedPhis.size(); ++i) {
lib/Transforms/Utils/ASanStackFrameLayout.cpp 60 const size_t NumVars = Vars.size();
101 StackDescription << Vars.size();
118 assert(Vars.size() > 0);
126 SB.resize(SB.size() + Var.Size / Granularity, 0);
lib/Transforms/Utils/BasicBlockUtils.cpp 164 for (unsigned i = 0, e = PHIs.size(); i != e; ++i)
lib/Transforms/Utils/CloneFunction.cpp 521 for (unsigned phino = 0, e = PHIToResolve.size(); phino != e; ) {
529 for (; phino != PHIToResolve.size() &&
609 for (unsigned Idx = 0, Size = PHIToResolve.size(); Idx != Size; ++Idx)
lib/Transforms/Utils/CodeExtractor.cpp 556 for (unsigned I = 0, E = Bitcasts.size(); I != E; ++I) {
713 if (IncomingVals.size() <= 1)
733 PHINode::Create(PN.getType(), IncomingVals.size(),
1372 for (unsigned I = 0, E = BranchDist.Weights.size(); I < E; ++I) {
lib/Transforms/Utils/CtorUtils.cpp 37 ArrayType::get(OldCA->getType()->getElementType(), CAList.size());
lib/Transforms/Utils/EscapeEnumerator.cpp 87 for (unsigned I = Calls.size(); I != 0;) {
lib/Transforms/Utils/InlineFunction.cpp 154 for (unsigned i = 0, e = UnwindDestPHIValues.size(); i != e; ++i, ++I) {
179 for (unsigned i = 0, e = UnwindDestPHIValues.size(); i != e; ++i, ++I) {
951 for (unsigned i = 0, e = NoAliasArgs.size(); i != e; ++i) {
1958 for (unsigned ai = 0, ae = IFI.StaticAllocas.size(); ai != ae; ++ai) {
2224 if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) {
2312 if (Returns.size() > 1) {
2316 PHI = PHINode::Create(RTy, Returns.size(), TheCall->getName(),
2326 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
2336 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
lib/Transforms/Utils/LCSSA.cpp 204 if (AddedPHIs.size() == 1) {
229 Value *V = AddedPHIs.size() == 1 ? AddedPHIs[0]
lib/Transforms/Utils/Local.cpp 933 for (unsigned i = 0, e = BBPreds.size(); i != e; ++i) {
1451 if (InsertedPHIs.size() == 0)
2707 for (unsigned i = 0; i < A->Provenance.size(); ++i) {
lib/Transforms/Utils/LoopSimplify.cpp 90 for (unsigned i = 0, e = SplitPreds.size(); i != e; ++i) {
102 for (unsigned i = 0, e = SplitPreds.size(); i != e; ++i) {
628 for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
732 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) {
lib/Transforms/Utils/LoopUnrollRuntime.cpp 492 if (ExitingBlocks.size() > 2)
499 return (OtherExits.size() == 1 &&
599 (!L->getExitingBlock() || OtherExits.size())) {
931 if (OtherExits.size() > 0) {
lib/Transforms/Utils/LoopUtils.cpp 374 if (MDs.size() == 1)
499 for (size_t I = 0; I < Worklist.size(); I++)
lib/Transforms/Utils/MisExpect.cpp 105 LLVM_DEBUG(for (int Idx = 0, Size = Weights.size(); Idx < Size; ++Idx) {
126 const uint64_t NumUnlikelyTargets = Weights.size() - 1;
lib/Transforms/Utils/ModuleUtils.cpp 54 ArrayType *AT = ArrayType::get(EltTy, CurrentCtors.size());
95 ArrayType *ATy = ArrayType::get(Int8PtrTy, Init.size());
lib/Transforms/Utils/PredicateInfo.cpp 725 ValueInfos.resize(ValueInfos.size() + 1);
727 auto InsertResult = ValueInfoNums.insert({Operand, ValueInfos.size() - 1});
738 assert(OINI < ValueInfos.size() &&
lib/Transforms/Utils/PromoteMemoryToRegister.cpp 565 if (Info.DefiningBlocks.size() == 1) {
786 for (unsigned i = 0, e = LiveInBlockWorklist.size(); i != e; ++i) {
lib/Transforms/Utils/SSAUpdater.cpp 161 PHINode *InsertedPHI = PHINode::Create(ProtoType, PredValues.size(),
lib/Transforms/Utils/SSAUpdaterBulk.cpp 41 unsigned Var = Rewrites.size();
52 assert(Var < Rewrites.size() && "Variable not found!");
62 assert(Var < Rewrites.size() && "Variable not found!");
71 return (Var < Rewrites.size()) ? Rewrites[Var].Defines.count(BB) : false;
137 LLVM_DEBUG(dbgs() << "SSAUpdater: rewriting " << R.Uses.size()
lib/Transforms/Utils/SimplifyCFG.cpp 981 assert(Weights.size() == 2);
1046 if (Weights.size() != 1 + PredCases.size())
1058 if (SuccWeights.size() != 1 + BBCases.size())
1093 unsigned CasesFromPred = Weights.size();
1594 auto *PN = PHINode::Create(Op->getType(), Insts.size(),
1757 if (UnconditionalPreds.size() < 2)
1787 unsigned NumPHIInsts = NumPHIdValues / UnconditionalPreds.size();
1788 if ((NumPHIdValues % UnconditionalPreds.size()) != 0)
2803 if (NewWeights.size() == 2) {
2814 for (unsigned i = 0, e = PHIs.size(); i != e; ++i) {
3539 if (Weights.size() == 1 + SI->getNumCases()) {
3727 if (ExtraCase && Values.size() < 2)
3746 LLVM_DEBUG(dbgs() << "Converting 'icmp' chain with " << Values.size()
3784 SwitchInst *New = Builder.CreateSwitch(CompVal, DefaultBB, Values.size());
3787 for (unsigned i = 0, e = Values.size(); i != e; ++i)
3796 for (unsigned i = 0, e = Values.size() - 1; i != e; ++i)
4222 for (unsigned i = 0, e = Preds.size(); i != e; ++i) {
4314 assert(Cases.size() >= 1);
4317 for (size_t I = 1, E = Cases.size(); I != E; ++I) {
4392 ConstantInt::get(Offset->getType(), ContiguousCases->size());
4410 if (Weights.size() == 1 + SI->getNumCases()) {
4413 for (size_t I = 0, E = Weights.size(); I != E; ++I) {
4429 unsigned PreviousEdges = ContiguousCases->size();
4436 unsigned PreviousEdges = SI->getNumCases() - ContiguousCases->size();
4592 if (Indexes.size() < 2)
4744 return Res.size() > 0;
4755 return I.second.size();
4783 if (Results.size() > 1)
4795 if (UniqueResults.size() > MaxUniqueResults)
4812 DefaultResults.size() == 1 ? DefaultResults.begin()->second : nullptr;
4834 assert(ResultVector.size() == 2 &&
4838 if (ResultVector[0].second.size() == 1 &&
4839 ResultVector[1].second.size() == 1) {
4899 if (UniqueResults.size() != 2)
4979 assert(Values.size() && "Can't build lookup table without values!");
4980 assert(TableSize >= Values.size() && "Can't fit values in table!");
4989 for (size_t I = 0, E = Values.size(); I != E; ++I) {
5002 if (Values.size() < TableSize) {
5360 uint64_t NumResults = ResultLists[PHIs[0]].size();
5449 for (size_t I = 0, E = ResultList.size(); I != E; ++I) {
lib/Transforms/Utils/ValueMapper.cpp 137 return MCs.size() - 1;
648 D.ID = G.POT.size();
824 unsigned PrefixSize = AppendingInits.size() - E.AppendingGVNumNewMembers;
998 assert(MCID < MCs.size() && "Invalid mapping context");
1014 assert(MCID < MCs.size() && "Invalid mapping context");
1030 assert(MCID < MCs.size() && "Invalid mapping context");
1042 assert(MCID < MCs.size() && "Invalid mapping context");
lib/Transforms/Vectorize/LoadStoreVectorizer.cpp 645 for (unsigned E = ChainInstrs.size(); ChainInstrIdx < E; ++ChainInstrIdx) {
852 unsigned Size = Chain.second.size();
905 for (unsigned TIt = 0; TIt < Tails.size(); TIt++)
lib/Transforms/Vectorize/LoopVectorizationLegality.cpp 204 assert(Args.size() == 0 && "too many arguments for MDString");
212 if (Args.size() == 1)
lib/Transforms/Vectorize/LoopVectorize.cpp 3421 if (OrigPHIsToFix.size()) {
3813 for (unsigned I = 0, E = LoopBypassBlocks.size(); I != E; ++I)
3938 assert(ScalarBBPredecessors.size() == VectorBBPredecessors.size() &&
3938 assert(ScalarBBPredecessors.size() == VectorBBPredecessors.size() &&
4994 for (int i = RUs.size() - 1; i >= 0; --i) {
5354 EndPoint[Instr] = IdxToInstr.size();
5391 for (unsigned int i = 0, s = IdxToInstr.size(); i < s; ++i) {
6489 assert(VPlans.size() == 1 && "Best VF has not a single VPlan.");
6514 assert(VPlans.size() == 1 && "Not a single VPlan to execute.");
7850 LoopsAnalyzed += Worklist.size();
lib/Transforms/Vectorize/SLPVectorizer.cpp 571 unsigned getTreeSize() const { return VectorizableTree.size(); }
917 unsigned getNumOperands() const { return OpsVec.size(); }
920 unsigned getNumLanes() const { return OpsVec[0].size(); }
971 ValueList OpVL(OpsVec[OpIdx].size());
972 assert(OpsVec[OpIdx].size() == getNumLanes() &&
1199 if (VL.size() == Scalars.size())
1201 return VL.size() == ReuseShuffleIndices.size() &&
1250 if (Operands.size() < OpIdx + 1)
1252 assert(Operands[OpIdx].size() == 0 && "Already resized?");
1253 Operands[OpIdx].resize(Scalars.size());
1254 for (unsigned Lane = 0, E = Scalars.size(); Lane != E; ++Lane)
1263 unsigned NumLanes = Scalars.size();
1278 assert(OpIdx < Operands.size() && "Off bounds");
1283 unsigned getNumOperands() const { return Operands.size(); }
1287 assert(OpIdx < Operands.size() && "Off bounds");
1348 for (unsigned OpI = 0, OpE = Operands.size(); OpI != OpE; ++OpI) {
1393 Last->Idx = VectorizableTree.size() - 1;
1432 for (unsigned Id = 0, IdE = VectorizableTree.size(); Id != IdE; ++Id) {
2038 static unsigned size(BoUpSLP *R) { return R->VectorizableTree.size(); }
2122 for (int Lane = 0, LE = Entry->Scalars.size(); Lane != LE; ++Lane) {
2275 auto Res = UniquePositions.try_emplace(V, UniqueValues.size());
2280 size_t NumUniqueScalarValues = UniqueValues.size();
2349 for (unsigned OpIdx = 0, OpE = OperandsVec.size(); OpIdx != OpE; ++OpIdx)
2923 unsigned ReuseShuffleNumbers = E->ReuseShuffleIndices.size();
3274 << VectorizableTree.size() << " is fully vectorizable .\n");
3277 if (VectorizableTree.size() == 1 && !VectorizableTree[0]->NeedToGather)
3280 if (VectorizableTree.size() != 2)
3300 unsigned NumElts = VectorizableTree[0]->Scalars.size();
3336 if (VectorizableTree.size() >= MinTreeSize)
3358 unsigned BundleWidth = VectorizableTree.front()->Scalars.size();
3425 << VectorizableTree.size() << ".\n");
3427 unsigned BundleWidth = VectorizableTree[0]->Scalars.size();
3429 for (unsigned I = 0, E = VectorizableTree.size(); I < E; ++I) {
3629 for (unsigned Lane = 0, LE = E->Scalars.size(); Lane != LE; ++Lane) {
3656 if (VL.size() == E->Scalars.size() && !E->ReuseShuffleIndices.empty()) {
3686 auto Res = UniquePositions.try_emplace(V, UniqueValues.size());
3693 if (UniqueValues.size() == VL.size() || UniqueValues.size() <= 1 ||
3693 if (UniqueValues.size() == VL.size() || UniqueValues.size() <= 1 ||
3694 !llvm::isPowerOf2_32(UniqueValues.size()))
3734 VectorType *VecTy = VectorType::get(ScalarTy, E->Scalars.size());
4137 Type *Tys[] = { VectorType::get(CI->getType(), E->Scalars.size()) };
4198 unsigned e = E->Scalars.size();
4256 auto BundleWidth = VectorizableTree[0]->Scalars.size();
4263 LLVM_DEBUG(dbgs() << "SLP: Extracting " << ExternalUses.size()
4366 for (int Lane = 0, LE = Entry->Scalars.size(); Lane != LE; ++Lane) {
6296 if (Stack.size() <= 1) {
6304 markExtraArg(Stack[Stack.size() - 2], TreeN);
6380 unsigned NumReducedVals = ReducedVals.size();
6505 return ReducedVals.size();
7026 if (Entry.second.size() < 2)
7030 << Entry.second.size() << ".\n");
7040 for (unsigned BI = 0, BE = Entry.second.size(); BI < BE; BI += MaxElts) {
7115 if (it->second.size() < 2)
7119 << it->second.size() << ".\n");
7125 for (unsigned CI = 0, CE = it->second.size(); CI < CE; CI += 16) {
lib/Transforms/Vectorize/VPlan.cpp 145 assert(PredVPSuccessors.size() == 1 &&
150 assert(PredVPSuccessors.size() == 2 &&
559 if (Successors.size() == 1)
561 else if (Successors.size() == 2) {
lib/Transforms/Vectorize/VPlan.h 141 assert(Entry.size() == UF && "VectorParts has wrong dimensions.");
157 assert(Entry.size() == UF && "ScalarParts has wrong dimensions.");
158 assert(Entry[Instance.Part].size() == VF &&
434 return (Successors.size() == 1 ? *Successors.begin() : nullptr);
440 return (Predecessors.size() == 1 ? *Predecessors.begin() : nullptr);
443 size_t getNumSuccessors() const { return Successors.size(); }
444 size_t getNumPredecessors() const { return Predecessors.size(); }
lib/Transforms/Vectorize/VPlanSLP.cpp 265 if (BestCandidates.size() == 1)
302 FinalOrder.reserve(MultiNodeOps.size());
303 Mode.reserve(MultiNodeOps.size());
316 for (unsigned Lane = 1, E = MultiNodeOps[0].second.size(); Lane < E; ++Lane) {
328 for (unsigned Op = 0, E = MultiNodeOps.size(); Op < E; ++Op) {
428 for (unsigned i = 0; i < CombinedOperands.size(); i++)
462 assert(CombinedOperands.size() > 0 && "Need more some operands");
lib/Transforms/Vectorize/VPlanValue.h 92 unsigned getNumUsers() const { return Users.size(); }
161 unsigned getNumOperands() const { return Operands.size(); }
163 assert(N < Operands.size() && "Operand index out of bounds");
tools/bugpoint/ExtractFunction.cpp 193 for (unsigned i = 0, e = aliases.size(); i < e; ++i) {
tools/bugpoint/OptimizerDriver.cpp 228 for (unsigned i = 0, e = Args.size() - 1; i != e; ++i) errs()
tools/clang/include/clang/AST/ASTImporter.h 195 assert(Nodes.size() >= 2);
tools/clang/include/clang/AST/ExternalASTSource.h 569 return iterator(this, -(int)Loaded.size());
573 return iterator(this, Local.size());
tools/clang/include/clang/AST/JSONNodeDumper.h 75 unsigned Depth = Pending.size();
82 while (Depth < Pending.size()) {
tools/clang/include/clang/AST/LexicallyOrderedRecursiveASTVisitor.h 129 Swap = Children.size() != 2;
135 if (Swap && Children.size() > 1)
tools/clang/include/clang/AST/OSLog.h 148 unsigned char getNumArgsByte() const { return Items.size(); }
tools/clang/include/clang/AST/OpenMPClause.h 4494 *DNLI = CL.size();
tools/clang/include/clang/AST/OptionalDiagnostic.h 44 *Diag << StringRef(Buffer.data(), Buffer.size());
61 *Diag << StringRef(Buffer.data(), Buffer.size());
70 *Diag << StringRef(Buffer.data(), Buffer.size());
tools/clang/include/clang/AST/RecursiveASTVisitor.h 654 size_t N = LocalQueue.size();
tools/clang/include/clang/AST/StmtOpenMP.h 291 for (unsigned Level = CaptureRegions.size(); Level > 1; --Level)
tools/clang/include/clang/AST/TemplateBase.h 576 unsigned size() const { return Arguments.size(); }
tools/clang/include/clang/AST/TextNodeDumper.h 97 unsigned Depth = Pending.size();
103 while (Depth < Pending.size()) {
tools/clang/include/clang/AST/UnresolvedSet.h 124 unsigned size() const { return decls().size(); }
tools/clang/include/clang/Analysis/CallGraph.h 168 unsigned size() const { return CalledFunctions.size(); }
tools/clang/include/clang/Analysis/CloneDetection.h 212 AllClones.reserve(Sequences.size());
320 return A.size() < MinGroupSize;
tools/clang/include/clang/Analysis/SelectorExtras.h 23 return Ctx.Selectors.getSelector(II.size(), &II[0]);
tools/clang/include/clang/Basic/Diagnostic.h 1395 return DiagObj->DiagRanges.size();
1410 return DiagObj->DiagFixItHints.size();
tools/clang/include/clang/Basic/PlistSupport.h 32 unsigned NewValue = V.size();
tools/clang/include/clang/Basic/SourceManager.h 1677 unsigned local_sloc_entry_size() const { return LocalSLocEntryTable.size(); }
1682 assert(Index < LocalSLocEntryTable.size() && "Invalid index");
1687 unsigned loaded_sloc_entry_size() const { return LoadedSLocEntryTable.size();}
1692 assert(Index < LoadedSLocEntryTable.size() && "Invalid index");
1806 if (FID.ID+1 == static_cast<int>(LocalSLocEntryTable.size()))
tools/clang/include/clang/CodeGen/ConstantInitBuilder.h 118 : Builder(builder), Parent(parent), Begin(builder.Buffer.size()) {
170 assert(this->Begin <= this->getBuffer().size());
171 return this->getBuffer().size() - this->Begin;
252 return getOffsetFromGlobalTo(Builder.Buffer.size());
275 return Builder.Buffer.size() - 1;
307 getGEPIndicesTo(indices, Builder.Buffer.size());
tools/clang/include/clang/Driver/Action.h 147 size_type size() const { return Inputs.size(); }
tools/clang/include/clang/Driver/Job.h 194 size_type size() const { return Jobs.size(); }
tools/clang/include/clang/Frontend/ASTUnit.h 605 unsigned stored_diag_size() const { return StoredDiagnostics.size(); }
608 if (NumStoredDiagnosticsFromDriver > StoredDiagnostics.size())
tools/clang/include/clang/Lex/MacroInfo.h 233 unsigned getNumTokens() const { return ReplacementTokens.size(); }
236 assert(Tok < ReplacementTokens.size() && "Invalid token #");
tools/clang/include/clang/Lex/Preprocessor.h 1444 if (CachedLexPos + N < CachedTokens.size())
tools/clang/include/clang/Lex/PreprocessorLexer.h 122 unsigned getConditionalStackDepth() const { return ConditionalStack.size(); }
tools/clang/include/clang/Lex/VariadicMacroSupport.h 87 bool isInVAOpt() const { return UnmatchedOpeningParens.size(); }
107 return !UnmatchedOpeningParens.size();
117 bool isAtTopLevel() const { return UnmatchedOpeningParens.size() == 1; }
tools/clang/include/clang/Parse/Parser.h 900 P.TentativelyDeclaredIdentifiers.size();
tools/clang/include/clang/Sema/CXXFieldCollector.h 72 Fields.resize(Fields.size() - getCurNumFields());
tools/clang/include/clang/Sema/DeclSpec.h 1933 for (unsigned i = 0, e = DeclTypeInfo.size(); i != e; ++i)
2185 unsigned getNumTypeObjects() const { return DeclTypeInfo.size(); }
2190 assert(i < DeclTypeInfo.size() && "Invalid type chunk");
2194 assert(i < DeclTypeInfo.size() && "Invalid type chunk");
2216 for (unsigned i = 0, i_end = DeclTypeInfo.size(); i < i_end; ++i) {
2227 for (unsigned i = DeclTypeInfo.size(), i_end = 0; i != i_end; --i) {
2248 for (unsigned i = 0, i_end = DeclTypeInfo.size(); i < i_end; ++i) {
tools/clang/include/clang/Sema/Designator.h 192 unsigned getNumDesignators() const { return Designators.size(); }
194 assert(Idx < Designators.size());
tools/clang/include/clang/Sema/Overload.h 1033 size_t size() const { return Candidates.size(); }
tools/clang/include/clang/Sema/ScopeInfo.h 665 CaptureMap[Var] = Captures.size();
892 NumExplicitCaptures = Captures.size();
998 return PotentiallyCapturingExprs.size();
1033 CXXThisCaptureIndex = Captures.size();
tools/clang/include/clang/Sema/Sema.h 5193 unsigned size() const { return Exceptions.size(); }
8071 return CodeSynthesisContexts.size() > NonInstantiationEntries;
8076 CodeSynthesisContexts.size() != LastEmittedCodeSynthesisContextDepth) {
8078 LastEmittedCodeSynthesisContextDepth = CodeSynthesisContexts.size();
8283 assert(Infos.size() <= index);
tools/clang/include/clang/Sema/SemaInternal.h 120 return CorrectionResults.empty() && ValidatedCorrections.size() == 1;
155 return CurrentTCIndex < ValidatedCorrections.size()
182 CurrentTCIndex >= ValidatedCorrections.size();
tools/clang/include/clang/Sema/Template.h 89 return TemplateArgumentLists.size() + NumRetainedOuterLevels;
95 return TemplateArgumentLists.size();
311 for (unsigned I = 0, N = ArgumentPacks.size(); I != N; ++I)
tools/clang/include/clang/Sema/TemplateDeduction.h 332 size_t size() const { return Candidates.size(); }
tools/clang/include/clang/Sema/TypoCorrection.h 216 return CorrectionDecls.size() > 1;
tools/clang/include/clang/Serialization/ASTReader.h 1759 return static_cast<unsigned>(SubmodulesLoaded.size());
1764 return static_cast<unsigned>(SelectorsLoaded.size());
1812 if (Idx >= Record.size())
2404 size_t size() const { return Record.size(); }
tools/clang/include/clang/Serialization/ASTWriter.h 802 size_t size() const { return Record->size(); }
828 OffsetIndices.push_back(Record->size());
tools/clang/include/clang/Serialization/ModuleManager.h 195 unsigned size() const { return Chain.size(); }
tools/clang/lib/ARCMigrate/ARCMT.cpp 608 StringRef(newText.data(), newText.size()), newFname));
tools/clang/lib/ARCMigrate/FileRemapper.cpp 73 for (unsigned idx = 0; idx+3 <= lines.size(); idx += 3) {
tools/clang/lib/ARCMigrate/ObjCMT.cpp 683 for (unsigned i = 0, e = ConformingProtocols.size(); i != e; i++) {
692 for (unsigned i = 0, e = ConformingProtocols.size(); i != e; i++) {
864 for (unsigned i = 0, e = PotentialImplicitProtocols.size(); i != e; i++)
875 for (unsigned i = 0, e = ConformingProtocols.size(); i != e; i++) {
878 for (unsigned i1 = 0, e1 = ConformingProtocols.size(); i1 != e1; i1++) {
1114 for (unsigned i = 0, e = Attrs1.size(); i != e; i++) {
1116 for (unsigned j = 0, f = Attrs2.size(); j != f; j++) {
1150 if (match && (Attrs2.size() > Attrs1.size()))
1150 if (match && (Attrs2.size() > Attrs1.size()))
1408 CFFunctionIBCandidates[CFFunctionIBCandidates.size()-1];
1982 StringRef(newText.data(), newText.size()), file->getName()));
2224 TmpOut.write(NewText.data(), NewText.size());
tools/clang/lib/ARCMigrate/TransAutoreleasePool.cpp 109 for (unsigned i = 0, e = VarsToHandle.size(); i != e; ++i) {
tools/clang/lib/ARCMigrate/TransBlockObjCVariable.cpp 89 for (unsigned i = 0, e = BlockVars.size(); i != e; ++i) {
tools/clang/lib/ARCMigrate/TransGCAttrs.cpp 283 for (unsigned i = 0, e = ATLs.size(); i != e; ++i) {
tools/clang/lib/ARCMigrate/TransProtectedScope.cpp 149 for (unsigned i = 0; i != Cases.size(); i++) {
181 for (unsigned i = 0, e = LocalRefs.size(); i != e; ++i) {
tools/clang/lib/AST/ASTContext.cpp 562 for (unsigned i = 0, e = Overridden.size(); i < e; i++)
976 llvm::errs() << " " << Types.size() << " types total.\n";
985 for (unsigned i = 0, e = Types.size(); i != e; ++i) {
1086 if (Imported.Initializers.size() + Imported.LazyInitializers.size() == 1) {
1086 if (Imported.Initializers.size() + Imported.LazyInitializers.size() == 1) {
4472 Args.reserve(Args.size() + Params->size());
7039 for (unsigned i = 0, e = Ivars.size(); i != e; ++i) {
9722 *IntegerConstantArgs |= 1 << ArgTypes.size();
10430 if (ParentStack.size() > 0) {
tools/clang/lib/AST/ASTDiagnostic.cpp 335 size_t OldEnd = Output.size();
tools/clang/lib/AST/ASTImporter.cpp 1884 ToCXX->setBases(Bases.data(), Bases.size());
2216 ConflictingDecls.size());
2340 Name, DC, IDNS, ConflictingDecls.data(), ConflictingDecls.size());
2418 Name, DC, IDNS, ConflictingDecls.data(), ConflictingDecls.size());
2533 ConflictingDecls.size());
2669 ConflictingDecls.size());
2839 Name, DC, IDNS, ConflictingDecls.data(), ConflictingDecls.size());
3074 Name, DC, IDNS, ConflictingDecls.data(), ConflictingDecls.size());
3261 for (unsigned I = 0, N = Parameters.size(); I != N; ++I)
3458 for (unsigned I = 0, N = FoundDecls.size(); I != N; ++I) {
3732 Name, DC, IDNS, ConflictingDecls.data(), ConflictingDecls.size());
3991 SmallVector<SourceLocation, 12> ToSelLocs(FromSelLocs.size());
4104 ToCategory->setProtocolList(Protocols.data(), Protocols.size(),
4161 To->setProtocolList(Protocols.data(), Protocols.size(),
4541 To->setProtocolList(Protocols.data(), Protocols.size(),
5081 ConflictingDecls.size());
5242 llvm::makeArrayRef(TemplateArgs.data(), TemplateArgs.size()),
5366 ConflictingDecls.size());
6124 ToCatchStmts.begin(), ToCatchStmts.size(),
6406 *ToTypeOrErr, ToLocations.data(), ToLocations.size());
tools/clang/lib/AST/CXXInheritance.cpp 741 if (Overriding.size() < 2)
tools/clang/lib/AST/CommentCommandTraits.cpp 80 return BestCommand.size() == 1 ? BestCommand[0] : nullptr;
124 for (unsigned i = 0, e = RegisteredCommands.size(); i != e; ++i) {
tools/clang/lib/AST/CommentLexer.cpp 509 const char *End = BufferPtr + VerbatimBlockEndCommandName.size();
tools/clang/lib/AST/CommentParser.cpp 53 return Pos.CurToken >= Toks.size();
116 if (Toks.size() == 1)
171 const unsigned Length = WordText.size();
221 const unsigned Length = WordText.size();
249 Pos.CurToken = Toks.size();
579 if (Content.size() == 0)
622 if (Content.size() > 0)
tools/clang/lib/AST/CommentSema.cpp 762 for (unsigned i = 0, e = ParamVarDocs.size(); i != e; ++i) {
770 for (unsigned i = 0, e = UnresolvedParamCommands.size(); i != e; ++i) {
779 if (OrphanedParamDecls.size() == 0)
783 if (OrphanedParamDecls.size() == 1) {
tools/clang/lib/AST/Decl.cpp 4382 for (unsigned i=0, e=Decls.size(); i != e; ++i)
tools/clang/lib/AST/DeclCXX.cpp 466 data().VBases = new (C) CXXBaseSpecifier[VBases.size()];
467 data().NumVBases = VBases.size();
468 for (int I = 0, E = VBases.size(); I != E; ++I) {
1884 assert(SO->second.size() > 0 &&
tools/clang/lib/AST/DeclObjC.cpp 470 data().AllReferencedProtocols.set(ProtocolRefs.data(), ProtocolRefs.size(),C);
1645 unsigned Ix = 0, EIx = layout.size();
tools/clang/lib/AST/DeclPrinter.cpp 283 Decl::printGroup(Decls.data(), Decls.size(), Out, Policy, Indentation);
tools/clang/lib/AST/DeclTemplate.cpp 332 new (Context) TemplateArgument[TemplateArgs.size()];
tools/clang/lib/AST/Expr.cpp 1985 unsigned PathSize = (BasePath ? BasePath->size() : 0);
1995 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
2012 unsigned PathSize = (BasePath ? BasePath->size() : 0);
2017 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
tools/clang/lib/AST/ExprCXX.cpp 781 unsigned PathSize = (BasePath ? BasePath->size() : 0);
787 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
806 unsigned PathSize = (BasePath ? BasePath->size() : 0);
812 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
863 unsigned PathSize = (BasePath ? BasePath->size() : 0);
869 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
898 unsigned PathSize = (BasePath ? BasePath->size() : 0);
903 std::uninitialized_copy_n(BasePath->data(), BasePath->size(),
tools/clang/lib/AST/ExprConstant.cpp 310 assert(NewLength <= Entries.size() && "not a truncation");
312 if (NewLength == Entries.size())
334 return Entries.size() == 1 && FirstEntryIsAnUnsizedArray;
366 bool IsArray = MostDerivedPathLength == Entries.size() &&
388 return MostDerivedPathLength == Entries.size()
401 MostDerivedPathLength = Entries.size();
414 MostDerivedPathLength = Entries.size();
426 MostDerivedPathLength = Entries.size();
438 MostDerivedPathLength = Entries.size();
460 bool IsArray = MostDerivedPathLength == Entries.size() &&
1287 : Info(Info), OldStackSize(Info.CleanupStack.size()) {
1307 assert(OldStackSize <= Info.CleanupStack.size() &&
1313 for (unsigned I = Info.CleanupStack.size(); I > OldStackSize; --I) {
1365 if (MostDerivedPathLength == Entries.size() && MostDerivedIsArrayElement)
1669 if (Path.size() >= 2)
1670 Expected = Path[Path.size() - 2];
2630 if (TruncatedElements == D.Entries.size())
2639 for (unsigned I = TruncatedElements, N = D.Entries.size(); I != N; ++I) {
2893 Notes.size() + 1) << VD;
2899 Notes.size() + 1) << VD;
3179 for (unsigned I = 0, N = Sub.Entries.size(); /**/; ++I) {
3454 unsigned I = 0, N = std::min(A.Entries.size(), B.Entries.size());
3454 unsigned I = 0, N = std::min(A.Entries.size(), B.Entries.size());
3490 if (A.Entries.size() != B.Entries.size())
3490 if (A.Entries.size() != B.Entries.size())
3494 if (IsArray && A.MostDerivedPathLength != A.Entries.size())
3503 return CommonLength >= A.Entries.size() - IsArray;
3756 assert(LVal.Designator.Entries.size() <= 1 &&
4116 if (LV.Designator.MostDerivedPathLength + MemPtr.Path.size() >
4117 LV.Designator.Entries.size()) {
4122 LV.Designator.Entries.size() - MemPtr.Path.size();
4122 LV.Designator.Entries.size() - MemPtr.Path.size();
4123 for (unsigned I = 0, N = MemPtr.Path.size(); I != N; ++I) {
4139 LV.Designator.Entries.reserve(LV.Designator.Entries.size() +
4140 MemPtr.Path.size() + IncludeMember);
4148 for (unsigned I = 1, N = MemPtr.Path.size(); I != N; ++I) {
4208 if (D.MostDerivedPathLength + E->path_size() > D.Entries.size()) {
4216 unsigned NewEntriesSize = D.Entries.size() - E->path_size();
5019 Designator.Entries.size() && "invalid path length");
5095 for (/**/; PathLength <= This.Designator.Entries.size(); ++PathLength) {
5120 CovariantPathLength != This.Designator.Entries.size();
5248 for (int PathLength = Ptr.Designator.Entries.size();
5326 unsigned PathLength = LHS.Designator.Entries.size();
6076 Subobject = Pointer.Designator.Entries.size() != 1 ||
6170 size_t size() { return Bytes.size(); }
6376 llvm::LoadIntFromMemory(Val, &*Bytes.begin(), Bytes.size());
7474 for (unsigned I = 0, N = CommaLHSs.size(); I != N; ++I)
7500 for (unsigned I = Adjustments.size(); I != 0; /**/) {
10273 for (unsigned E = LVal.Designator.Entries.size(); I != E; ++I) {
10340 Designator.Entries.size() == Designator.MostDerivedPathLength &&
10427 Designator.Entries.size() == Designator.MostDerivedPathLength) {
11202 Queue.resize(Queue.size()+1);
11639 if (!WasArrayIndex && Mismatch < LHSDesignator.Entries.size() &&
11640 Mismatch < RHSDesignator.Entries.size()) {
13229 if (!E->isArrayForm() && Pointer.Designator.Entries.size() != 0 &&
tools/clang/lib/AST/ExternalASTMerger.cpp 508 Decls.reserve(Candidates.size());
tools/clang/lib/AST/Interp/ByteCodeExprGen.h 289 Idx = this->Ctx->Descriptors.size();
tools/clang/lib/AST/Interp/Function.h 83 bool hasRVO() const { return ParamTypes.size() != Params.size(); }
tools/clang/lib/AST/Interp/Record.h 68 unsigned getNumFields() { return Fields.size(); }
76 unsigned getNumBases() { return Bases.size(); }
84 unsigned getNumVirtualBases() { return VirtualBases.size(); }
tools/clang/lib/AST/ItaniumMangle.cpp 692 AbiTagList AdditionalAbiTags(ReturnTypeAbiTags.size());
835 AbiTagList AdditionalAbiTags(VariableTypeAbiTags.size());
1412 Out << Str.size();
3272 Out << 'U' << QualStr.size() << QualStr;
4921 return TrackAbiTags.AbiTagsRoot.getUsedAbiTags().size();
tools/clang/lib/AST/MicrosoftMangle.cpp 1303 if (NameBackReferences.size() < 10)
2553 mangleNumber(Dimensions.size());
tools/clang/lib/AST/NSAPI.cpp 600 Sel = Ctx.Selectors.getSelector(Idents.size(), Idents.data());
tools/clang/lib/AST/ODRHash.cpp 209 const unsigned size = Bools.size();
494 ID.AddInteger(Decls.size());
591 ID.AddInteger(Decls.size());
618 ID.AddInteger(Decls.size());
tools/clang/lib/AST/OpenMPClause.cpp 882 TotalNum += C.size();
tools/clang/lib/AST/StmtPrinter.cpp 192 Decl::printGroup(Decls.data(), Decls.size(), OS, Policy, IndentLevel);
tools/clang/lib/AST/VTTBuilder.cpp 48 SecondaryVirtualPointerIndices[Base] = VTTComponents.size();
192 SubVTTIndicies[Base] = VTTComponents.size();
195 uint64_t VTableIndex = VTTVTables.size();
tools/clang/lib/AST/VTableBuilder.cpp 192 assert(M.second.size() == 1 && "Final overrider is not unique!");
227 for (int I = Path.size(), E = 0; I != E; --I) {
239 for (unsigned I = NonVirtualStart, E = Path.size(); I != E; ++I) {
663 int64_t OffsetIndex = -(int64_t)(3 + Components.size());
1307 VTableThunks[Components.size()].Return = ReturnAdjustment;
1571 Components.size());
1628 unsigned VTableIndex = Components.size();
1657 uint64_t AddressPoint = Components.size();
1690 unsigned(VTableIndices.size() - 1),
1886 Out << "' (" << Components.size() << " entries).\n";
1901 for (unsigned I = 0, E = Components.size(); I != E; ++I) {
2113 Out << "Thunks for '" << MethodName << "' (" << ThunksVector.size();
2114 Out << (ThunksVector.size() == 1 ? " entry" : " entries") << ").\n";
2116 for (unsigned I = 0, E = ThunksVector.size(); I != E; ++I) {
2471 VTableThunks[Components.size()] = TI;
2497 assert((HasRTTIComponent ? Components.size() - 1 : Components.size()) &&
2497 assert((HasRTTIComponent ? Components.size() - 1 : Components.size()) &&
2873 std::make_pair(ND->getDeclName(), Groups.size()));
2907 if (BaseDepth < WhichVFPtr.PathToIntroducingObject.size()) {
3016 HasRTTIComponent ? Components.size() - 1 : Components.size(),
3016 HasRTTIComponent ? Components.size() - 1 : Components.size(),
3105 Out << "' (" << Components.size()
3106 << (Components.size() == 1 ? " entry" : " entries") << ").\n";
3108 for (unsigned I = 0, E = Components.size(); I != E; ++I) {
3198 Out << "Thunks for '" << MethodName << "' (" << ThunksVector.size();
3199 Out << (ThunksVector.size() == 1 ? " entry" : " entries") << ").\n";
3201 for (unsigned I = 0, E = ThunksVector.size(); I != E; ++I) {
3342 PathsSorted.reserve(Paths.size());
3349 for (size_t I = 0, E = PathsSorted.size(); I != E;) {
tools/clang/lib/ASTMatchers/ASTMatchersInternal.cpp 414 for (size_t I = 0; I < Patterns.size();) {
tools/clang/lib/Analysis/CloneDetection.cpp 115 if (Group.size() < OtherGroup.size())
115 if (Group.size() < OtherGroup.size())
483 Indexes.resize(HashGroup.size());
485 for (unsigned i = 0; i < HashGroup.size(); ++i) {
499 for (unsigned j = i + 1; j < HashGroup.size(); ++j) {
tools/clang/lib/Analysis/ObjCNoReturn.cpp 39 C.Selectors.getSelector(II.size(), &II[0]);
44 C.Selectors.getSelector(II.size(), &II[0]);
tools/clang/lib/Analysis/ThreadSafety.cpp 193 bool isEmpty() const { return FactIDs.size() == 0; }
213 unsigned n = FactIDs.size();
tools/clang/lib/Basic/FileManager.cpp 422 StringRef pathRef(path.data(), path.size());
437 if (!llvm::sys::path::is_absolute(StringRef(Path.data(), Path.size()))) {
567 llvm::errs() << VirtualFileEntries.size() << " virtual files found, "
568 << VirtualDirectoryEntries.size() << " virtual dirs found.\n";
tools/clang/lib/Basic/Module.cpp 147 for (unsigned I = 0, N = Current->Requirements.size(); I != N; ++I) {
353 for (unsigned I = 0, N = Exports.size(); I != N; ++I) {
386 for (unsigned R = 0, NR = WildcardRestrictions.size(); R != NR; ++R) {
441 for (unsigned I = 0, N = Requirements.size(); I != N; ++I) {
527 for (unsigned I = 0, N = Exports.size(); I != N; ++I) {
540 for (unsigned I = 0, N = UnresolvedExports.size(); I != N; ++I) {
549 for (unsigned I = 0, N = DirectUses.size(); I != N; ++I) {
556 for (unsigned I = 0, N = UnresolvedDirectUses.size(); I != N; ++I) {
563 for (unsigned I = 0, N = LinkLibraries.size(); I != N; ++I) {
tools/clang/lib/Basic/SourceManager.cpp 407 for (unsigned I = 0, N = Old.LoadedSLocEntryTable.size(); I != N; ++I)
493 LoadedSLocEntryTable.resize(LoadedSLocEntryTable.size() + NumSLocEntries);
494 SLocEntryLoaded.resize(LoadedSLocEntryTable.size());
496 int ID = LoadedSLocEntryTable.size();
535 } else if (unsigned(-(ID-1) - 2) >= LoadedSLocEntryTable.size()) {
573 assert(Index < LoadedSLocEntryTable.size() && "FileID out of range");
593 FileID FID = FileID::get(LocalSLocEntryTable.size()-1);
637 assert(Index < LoadedSLocEntryTable.size() && "FileID out of range");
873 unsigned LessIndex = LoadedSLocEntryTable.size();
1273 FI->NumLines = LineOffsets.size();
1274 FI->SourceLineCache = Alloc.Allocate<unsigned>(LineOffsets.size());
2053 llvm::errs() << LocalSLocEntryTable.size() << " local SLocEntry's allocated ("
2057 llvm::errs() << LoadedSLocEntryTable.size()
2116 for (unsigned ID = 0, NumIDs = LocalSLocEntryTable.size(); ID != NumIDs; ++ID) {
2123 for (unsigned Index = 0; Index != LoadedSLocEntryTable.size(); ++Index) {
tools/clang/lib/CodeGen/BackendUtil.cpp 751 llvm::cl::ParseCommandLineOptions(BackendArgs.size() - 1,
1680 ArrayType *ATy = ArrayType::get(UsedElementType, UsedArray.size());
tools/clang/lib/CodeGen/CGBlocks.cpp 714 li->setIndex(info, elementTypes.size(), blockSize);
767 li->setIndex(info, elementTypes.size(), blockSize);
1841 Str += llvm::to_string(TyStr.size()) + TyStr.c_str();
2807 info.FieldIndex = types.size() - 1;
tools/clang/lib/CodeGen/CGBuiltin.cpp 1145 for (unsigned int I = 0, E = Layout.Items.size(); I < E; ++I) {
5538 for (unsigned I = 2; I < Ops.size() - 1; ++I)
10880 if (Ops.size() == 4)
11661 if (Ops.size() == 2) {
12874 assert(Args.size() == 5 || Args.size() == 6);
12874 assert(Args.size() == 5 || Args.size() == 6);
12875 if (Args.size() == 5)
tools/clang/lib/CodeGen/CGCUDANV.cpp 257 llvm::ConstantInt::get(SizeTy, std::max<size_t>(1, Args.size())));
259 for (unsigned i = 0; i < Args.size(); ++i) {
tools/clang/lib/CodeGen/CGCall.cpp 118 assert(paramInfos.size() <= prefixArgs);
134 assert(paramInfos.size() <= totalArgs &&
154 unsigned PrefixSize = prefix.size();
158 prefix.reserve(prefix.size() + FPT->getNumParams());
169 prefix.size());
179 RequiredArgs Required = RequiredArgs::forPrototypePlus(FTP, prefix.size());
340 (PassParams && MD->isVariadic() ? RequiredArgs(argTypes.size())
423 ArgTypes.size());
493 (MD->isVariadic() ? RequiredArgs(argTys.size()) : RequiredArgs::All);
568 assert(args.size() >= numExtraRequiredArgs);
583 args.size());
592 required = RequiredArgs(args.size());
629 auto paramInfos = getExtParameterInfosForCall(proto, 1, params.size());
678 assert(numPrefixArgs + 1 <= args.size() &&
683 getExtParameterInfosForCall(proto, numPrefixArgs + 1, args.size());
703 assert(signature.arg_size() <= args.size());
704 if (signature.arg_size() == args.size())
711 paramInfos.resize(args.size());
1402 assert(ArgNo < ArgInfo.size());
1413 assert(ArgNo < ArgInfo.size());
1486 assert(ArgNo == ArgInfo.size());
2252 assert(FnArgs.size() == IRFunctionArgs.totalIRArgs());
2275 ArgVals.reserve(Args.size());
2281 assert(FI.arg_size() == Args.size() &&
2566 for (int I = Args.size() - 1; I >= 0; --I)
2569 for (unsigned I = 0, E = Args.size(); I != E; ++I)
2937 if (results.size() == 1) {
2946 for (unsigned i = 0, e = results.size(); i != e; ++i) {
3454 size_t CallArgsStart = Args.size();
3458 unsigned InitialArgSize = Args.size();
3470 assert(InitialArgSize + 1 == Args.size() &&
3887 assert(CallInfo.arg_size() == CallArgs.size() &&
4283 assert(IRCallArgs.size() == IRFuncTy->getNumParams() || IRFuncTy->isVarArg());
4284 for (unsigned i = 0; i < IRCallArgs.size(); ++i) {
4295 for (unsigned i = 0; i < IRCallArgs.size(); ++i) {
tools/clang/lib/CodeGen/CGClass.cpp 785 assert(NumFields < SSV.size());
789 assert(NumFields == SSV.size());
790 if (SSV.size() <= 1) return;
806 for (size_t i = 0; i < SSV.size(); i++) {
808 uint64_t NextField = i == SSV.size() - 1 ? TypeSize : SSV[i + 1].Offset;
1089 if (AggregatedInits.size() <= 1) {
1112 for (unsigned i = 0; i < AggregatedInits.size(); ++i) {
1213 : FieldMemcpyizer(CGF, AD->getParent(), Args[Args.size() - 1]),
1215 assert(Args.size() == 2);
1230 if (AggregatedStmts.size() <= 1) {
2119 assert(Args.size() == 1 && "trivial default ctor with args");
2127 assert(Args.size() == 2 && "unexpected argcount for trivial ctor");
2196 assert(CXXInheritedCtorInitExprArgs.size() >= D->getNumParams() &&
2247 assert(Args.size() >= Params.size() && "too few arguments for call");
2247 assert(Args.size() >= Params.size() && "too few arguments for call");
2248 for (unsigned I = 0, N = Args.size(); I != N; ++I) {
2249 if (I < Params.size() && isa<ImplicitParamDecl>(Params[I])) {
tools/clang/lib/CodeGen/CGCleanup.cpp 189 BranchFixups.size(),
270 assert(BranchFixups.size() >= MinSize && "fixup stack out of order");
272 while (BranchFixups.size() > MinSize &&
480 E = LifetimeExtendedCleanupStack.size(); I != E; /**/) {
901 for (unsigned I = 0, E = InstsToAppend.size(); I != E; ++I)
tools/clang/lib/CodeGen/CGCleanup.h 381 return ExtInfo ? ExtInfo->BranchAfters.size() : 0;
416 return (ExtInfo->BranchAfters.size() != ExtInfo->Branches.size());
tools/clang/lib/CodeGen/CGDebugInfo.cpp 4666 for (size_t i = 0; i != ObjCInterfaceCache.size(); ++i) {
tools/clang/lib/CodeGen/CGDecl.cpp 1033 if (NestedIntact && Values.size() == STy->getNumElements())
tools/clang/lib/CodeGen/CGDeclCXX.cpp 483 OrderGlobalInits Key(IPA->getPriority(), PrioritizedCXXGlobalInits.size());
585 for (size_t i = 0; i < FileName.size(); ++i) {
tools/clang/lib/CodeGen/CGException.cpp 868 filterTypes.size());
870 for (unsigned i = 0, e = filterTypes.size(); i != e; ++i)
tools/clang/lib/CodeGen/CGExpr.cpp 560 for (unsigned I = Adjustments.size(); I != 0; --I) {
760 if (Checks.size() > 0) {
2138 if (getAccessedFieldNo(NumSrcElts - 1, Elts) == Mask.size())
2444 assert(Asm->getLabel().size() < 64-Name.size() &&
3850 for (unsigned i = 0, e = Indices.size(); i != e; ++i)
5081 for (unsigned i = 0, e = opaques.size(); i != e; ++i)
tools/clang/lib/CodeGen/CGExprAgg.cpp 1332 for (unsigned i = Cleanups.size(); i != 0; --i)
1629 for (unsigned i = cleanups.size(); i != 0; --i)
tools/clang/lib/CodeGen/CGExprCXX.cpp 56 RequiredArgs required = RequiredArgs::forPrototypePlus(FPT, Args.size());
57 unsigned PrefixSize = Args.size() - 1;
tools/clang/lib/CodeGen/CGExprConstant.cpp 288 return Offsets.size();
790 for (unsigned I = 0, N = Bases.size(); I != N; ++I) {
922 if (Elements.size() < NonzeroLength && Filler->isNullValue())
923 NonzeroLength = Elements.size();
924 if (NonzeroLength == Elements.size()) {
935 assert(Elements.size() >= NonzeroLength &&
955 } else if (Elements.size() != ArrayBound) {
969 Types.reserve(Elements.size());
1334 assert(saved.OldPlaceholdersSize == PlaceholderAddresses.size() &&
1478 assert(IndexValues.size() == Indices.size() && "mismatch");
1478 assert(IndexValues.size() == Indices.size() && "mismatch");
1479 assert(Indices.size() == 1 && "didn't pop all indices");
1536 assert(Indices.size() == IndexValues.size());
1536 assert(Indices.size() == IndexValues.size());
1537 for (size_t i = Indices.size() - 1; i != size_t(-1); --i) {
tools/clang/lib/CodeGen/CGExprScalar.cpp 2989 if (Checks.size() > 0)
tools/clang/lib/CodeGen/CGGPUBuiltin.cpp 94 if (Args.size() <= 1) {
99 for (unsigned I = 1, NumArgs = Args.size(); I < NumArgs; ++I)
110 for (unsigned I = 1, NumArgs = Args.size(); I < NumArgs; ++I) {
tools/clang/lib/CodeGen/CGLoopInfo.cpp 773 if (AccessGroups.size() == 1)
775 else if (AccessGroups.size() >= 2)
tools/clang/lib/CodeGen/CGObjC.cpp 393 Args.size() == 1 && Args.front().getType()->isPointerType() &&
2968 for (unsigned i = 0, e = opaques.size(); i != e; ++i)
tools/clang/lib/CodeGen/CGObjCGNU.cpp 1892 if (InstanceMethods.size() == 0)
3208 fields.addInt(Int32Ty, values.size());
3335 auto numProperties = Properties.size();
tools/clang/lib/CodeGen/CGObjCMac.cpp 2530 int OldIndex = RunSkipBlockVars.size() - 1;
2538 for (int FirstIndex = RunSkipBlockVars.size() - 1 ;ElIx < ElCount; ElIx++) {
2624 if (Layout.size() <= 3) {
2625 unsigned size = Layout.size();
2731 unsigned size = RunSkipBlockVars.size();
2813 for (unsigned i = 0, e = Layout.size(); i != e; i++)
3297 values.addInt(ObjCTypes.IntTy, Properties.size());
4225 for (unsigned I = 0, E = Locals.size(); I != E; ++I) {
4239 for (unsigned I = 0, E = Locals.size(); I != E; ++I) {
4323 SmallVector<llvm::Type *, 16> tys(Locals.size());
4324 for (unsigned i = 0, e = Locals.size(); i != e; ++i)
5046 unsigned NumClasses = DefinedClasses.size();
5047 unsigned NumCategories = DefinedCategories.size();
5227 size_t oldEnd = IvarsInfo.size();
5232 auto numEltEntries = IvarsInfo.size() - oldEnd;
6064 Symbols.size()),
6089 for (unsigned i=0, NumClasses=ImplementedClasses.size(); i<NumClasses; i++) {
tools/clang/lib/CodeGen/CGObjCRuntime.cpp 188 EHCatchScope *Catch = CGF.EHStack.pushCatch(Handlers.size());
189 for (unsigned I = 0, E = Handlers.size(); I != E; ++I)
226 for (unsigned I = 0, E = Handlers.size(); I != E; ++I) {
tools/clang/lib/CodeGen/CGOpenMPRuntime.cpp 988 assert(SharedAddresses.size() == N &&
1055 assert(SharedAddresses.size() > N && "No variable was generated");
5200 unsigned NumDependencies = Data.Dependences.size();
6213 unsigned Size = Data.ReductionVars.size();
7906 getMemberOfFlag(BasePointers.size() - 1);
8034 unsigned CurrentBasePointersIdx = CurBasePointers.size();
8043 assert(CurBasePointers.size() > CurrentBasePointersIdx &&
8228 for (unsigned I = 0, E = Types.size(); I < E; ++I) {
8565 Info.NumberOfPtrs = BasePointers.size();
8606 llvm::ArrayType::get(CGM.Int64Ty, ConstSizes.size()), ConstSizes);
8618 SmallVector<uint64_t, 4> Mapping(MapTypes.size(), 0);
8951 for (unsigned I = 0; I < BasePointers.size(); ++I) {
9366 assert(CurBasePointers.size() == CurPointers.size() &&
9366 assert(CurBasePointers.size() == CurPointers.size() &&
9367 CurBasePointers.size() == CurSizes.size() &&
9367 CurBasePointers.size() == CurSizes.size() &&
9368 CurBasePointers.size() == CurMapTypes.size() &&
9368 CurBasePointers.size() == CurMapTypes.size() &&
tools/clang/lib/CodeGen/CGOpenMPRuntimeNVPTX.cpp 463 if (CaptureRegions.size() == 1 && CaptureRegions.back() == OMPD_unknown) {
2201 assert(GlobalizedRecords.back().Records.size() < 2 &&
2218 if (GlobalizedRecords.back().Records.size() == 1) {
tools/clang/lib/CodeGen/CGRecordLayoutBuilder.cpp 682 Fields[Member->FD->getCanonicalDecl()] = FieldTypes.size() - 1;
687 NonVirtualBases[Member->RD] = FieldTypes.size() - 1;
689 VirtualBases[Member->RD] = FieldTypes.size() - 1;
tools/clang/lib/CodeGen/CGStmt.cpp 1411 unsigned StartSize = ResultStmts.size();
1618 for (unsigned i = 0, e = CaseStmts.size(); i != e; ++i)
1720 assert(SwitchWeights->size() == 1 + SwitchInsn->getNumCases() &&
1723 if (SwitchWeights->size() > 1)
tools/clang/lib/CodeGen/CGStmtOpenMP.cpp 757 CaptureRegions.size() == 1 && CaptureRegions.back() == OMPD_unknown;
3046 for (unsigned Cnt = 0, E = Data.ReductionVars.size(); Cnt < E; ++Cnt) {
3093 for (unsigned Cnt = 0, E = InRedVars.size(); Cnt < E; ++Cnt) {
tools/clang/lib/CodeGen/CGVTT.cpp 48 llvm::ArrayType::get(Int8PtrTy, Builder.getVTTComponents().size());
120 llvm::ArrayType::get(CGM.Int8PtrTy, Builder.getVTTComponents().size());
tools/clang/lib/CodeGen/CGVTables.cpp 332 unsigned PrefixArgs = CallArgs.size() - 1;
tools/clang/lib/CodeGen/CodeGenFunction.h 646 size_t OldSize = LifetimeExtendedCleanupStack.size();
648 LifetimeExtendedCleanupStack.size() + sizeof(Header) + Header.Size +
729 CGF.LifetimeExtendedCleanupStack.size();
tools/clang/lib/CodeGen/CodeGenModule.cpp 1914 llvm::ArrayType *ATy = llvm::ArrayType::get(CGM.Int8PtrTy, UsedArray.size());
1980 for (unsigned I = Mod->LinkLibraries.size(); I > 0; --I) {
2993 while (Options.size() > 1 &&
tools/clang/lib/CodeGen/ConstantEmitter.h 170 AbstractState saved = { Abstract, PlaceholderAddresses.size() };
tools/clang/lib/CodeGen/ConstantInitBuilder.cpp 44 assert(builder.Buffer.size() == 1);
62 assert(builder->Buffer.size() == 1);
196 CachedOffsetEnd = Builder.Buffer.size();
248 assert((Begin < buffer.size() ||
249 (Begin == buffer.size() && eltTy))
tools/clang/lib/CodeGen/CoverageMappingGen.cpp 255 FileIDMapping[SM.getFileID(Loc)] = std::make_pair(Mapping.size(), Loc);
tools/clang/lib/CodeGen/EHScopeStack.h 401 unsigned getNumBranchFixups() const { return BranchFixups.size(); }
tools/clang/lib/CodeGen/ItaniumCXXABI.cpp 297 return Args.size() - 1;
tools/clang/lib/CodeGen/MicrosoftCXXABI.cpp 82 assert(Args.size() >= 2 &&
348 llvm::ArrayType *VDispMapTy = llvm::ArrayType::get(CGM.IntTy, Map.size());
1241 for (unsigned I = 0, E = VBGlobals.VBTables->size(); I != E; ++I) {
1632 for (unsigned I = Info.PathToIntroducingObject.size() - 1; I != 0; --I) {
1746 for (size_t J = 0, F = VFPtrs.size(); J != F; ++J) {
2039 for (unsigned I = 0, E = VBGlobals.VBTables->size(); I != E; ++I) {
2114 assert(Offsets.size() ==
2118 llvm::ArrayType::get(CGM.IntTy, Offsets.size());
2627 if (fields.size() == 1)
2661 if (fields.size() == 1)
2759 assert(DerivedToBasePath.size() == MemberPointerPath.size());
2899 for (int I = 1, E = fields.size(); I < E; ++I) {
2925 if (Fields.size() == 1) {
2931 for (I = 0, E = Fields.size(); I != E; ++I) {
3607 llvm::ConstantInt::get(CGM.IntTy, Classes.size()),
3631 auto *ArrType = llvm::ArrayType::get(PtrType, Classes.size() + 1);
tools/clang/lib/CodeGen/ModuleBuilder.cpp 183 for (unsigned I = 0; I != DeferredInlineMemberFuncDefs.size(); ++I)
tools/clang/lib/CodeGen/ObjectFilePCHContainerOperations.cpp 272 auto Size = SerializedAST.size();
tools/clang/lib/CodeGen/PatternInit.cpp 82 for (unsigned El = 0; El != Struct.size(); ++El)
tools/clang/lib/CodeGen/SwiftCallingConv.cpp 207 assert(componentTys.size() >= 1);
210 for (size_t i = 0, e = componentTys.size(); i != e - 1; ++i) {
273 size_t index = Entries.size() - 1;
355 if (index == Entries.size() - 1 || end <= Entries[index + 1].Begin) {
465 for (size_t i = 1, e = Entries.size(); i != e; ++i) {
488 for (size_t i = 0, e = orig.size(); i != e; ++i) {
597 if (elts.size() == 1) {
602 } else if (Entries.size() == 1) {
616 if (Entries.size() == 1) {
623 componentTys.reserve(Entries.size());
tools/clang/lib/CodeGen/TargetInfo.cpp 1852 Info = ABIArgInfo::getInAlloca(FrameFields.size());
8294 if (Elems.size() == 1)
8954 size_t Start = Enc.size();
8982 unsigned E = FE.size();
9005 size_t Start = Enc.size();
9025 unsigned E = FE.size();
tools/clang/lib/CodeGen/VarBypassDetector.cpp 39 ParentScope = Scopes.size() - 1;
tools/clang/lib/Driver/Action.cpp 195 if (OKinds.size() == 1)
199 for (unsigned i = 0, e = getInputs().size(); i != e; ++i)
215 for (unsigned i = 0, e = DDeps.getActions().size(); i != e; ++i)
241 assert(getInputs().size() == DevToolChains.size() + (HostTC ? 1 : 0) &&
241 assert(getInputs().size() == DevToolChains.size() + (HostTC ? 1 : 0) &&
277 return getInputs().size() == (HostTC ? 2 : 1);
278 return !HostTC && getInputs().size() == 1;
tools/clang/lib/Driver/Driver.cpp 883 FixedArchPrefixLen = FixedConfigFile.size();
1865 if (AL->size()) {
1953 if (!Archs.size())
1968 if (Archs.size() > 1 && !types::canLipoType(Act->getType()))
1973 for (unsigned i = 0, e = Archs.size(); i != e; ++i)
1978 if (Inputs.size() == 1 || Act->getType() == types::TY_Nothing)
2393 for (unsigned I = 0, E = GpuArchList.size(); I != E; ++I) {
2456 assert(CudaDeviceActions.size() == GpuArchList.size() &&
2456 assert(CudaDeviceActions.size() == GpuArchList.size() &&
2458 assert(ToolChains.size() == 1 &&
2460 for (unsigned I = 0, E = GpuArchList.size(); I != E; ++I)
2575 assert(CudaDeviceActions.size() == GpuArchList.size() &&
2575 assert(CudaDeviceActions.size() == GpuArchList.size() &&
2588 for (unsigned I = 0, E = GpuArchList.size(); I != E; ++I) {
2615 assert(AssembleAction->getInputs().size() == 1);
2696 CudaDeviceActions.size() == GpuArchList.size()) &&
2696 CudaDeviceActions.size() == GpuArchList.size()) &&
2708 for (unsigned I = 0, E = GpuArchList.size(); I != E; ++I) {
2752 DeviceLinkerInputs.resize(CudaDeviceActions.size());
2809 assert(OpenMPDeviceActions.size() == ToolChains.size() &&
2809 assert(OpenMPDeviceActions.size() == ToolChains.size() &&
2815 assert(ToolChains.size() == DeviceLinkerInputs.size() &&
2815 assert(ToolChains.size() == DeviceLinkerInputs.size() &&
2841 for (unsigned I = 0; I < ToolChains.size(); ++I)
2861 for (unsigned I = 0; I < ToolChains.size(); ++I) {
2875 assert(ToolChains.size() == OpenMPDeviceActions.size() &&
2875 assert(ToolChains.size() == OpenMPDeviceActions.size() &&
2897 assert(OpenMPDeviceActions.size() == ToolChains.size() &&
2897 assert(OpenMPDeviceActions.size() == ToolChains.size() &&
2913 assert(ToolChains.size() == DeviceLinkerInputs.size() &&
2913 assert(ToolChains.size() == DeviceLinkerInputs.size() &&
2941 DeviceLinkerInputs.resize(ToolChains.size());
3051 SpecializedBuilders.size() == (InactiveBuilders + IgnoringBuilders))
3229 if (YcArg && Inputs.size() > 1) {
3263 LastPLSize = PL.size();
3350 if (Inputs.size() > 1 && !V.empty() &&
3362 if (Inputs.size() > 1 && !V.empty() &&
3743 if (Inputs.size() != 1)
3976 ActionChain.resize(ActionChain.size() + 1);
4204 if (InputInfos.size() != 1) {
4291 for (unsigned i = 0, e = InputInfos.size(); i != e; ++i) {
4300 for (unsigned i = 0, e = UnbundlingResults.size(); i != e; ++i) {
tools/clang/lib/Driver/Tool.cpp 30 assert(Outputs.size() == 1 && "Expected only one output by default!");
tools/clang/lib/Driver/ToolChains/Clang.cpp 3384 assert(Inputs.size() >= 1 && "Must have at least one input.");
6071 assert(Inputs.size() == 1 && "Unexpected number of inputs.");
6294 assert(JA.getInputs().size() == Inputs.size() &&
6294 assert(JA.getInputs().size() == Inputs.size() &&
6300 for (unsigned I = 0; I < Inputs.size(); ++I) {
6334 for (unsigned I = 0; I < Inputs.size(); ++I) {
6374 assert(Inputs.size() == 1 && "Expecting to unbundle a single file!");
6409 for (unsigned I = 0; I < Outputs.size(); ++I) {
tools/clang/lib/Driver/ToolChains/Cuda.cpp 467 assert(A->getInputs().size() == 1 &&
tools/clang/lib/Driver/ToolChains/Darwin.cpp 91 assert(Inputs.size() == 1 && "Unexpected number of inputs.");
570 if (InputFileList.size() > 0)
693 assert(Inputs.size() == 1 && "Unable to handle multiple inputs.");
714 assert(Inputs.size() == 1 && "Unable to handle multiple inputs.");
tools/clang/lib/Driver/ToolChains/MSVC.cpp 709 assert(Inputs.size() == 1);
tools/clang/lib/Driver/ToolChains/Myriad.cpp 30 assert(Inputs.size() == 1);
65 C.getActions().size() == 1 &&
91 assert(Inputs.size() == 1);
tools/clang/lib/Driver/ToolChains/PS4CPU.cpp 58 assert(Inputs.size() == 1 && "Unexpected number of inputs.");
tools/clang/lib/Driver/Types.cpp 297 assert(0 < P.size() && "Not enough phases in list");
298 assert(P.size() <= phases::MaxNumberOfPhases && "Too many phases in list");
tools/clang/lib/Edit/RewriteObjCFoundationAPI.cpp 573 if (Vals.size() != Keys.size())
573 if (Vals.size() != Keys.size())
581 for (unsigned i = 0, n = Vals.size(); i < n; ++i) {
629 if (Vals.size() != Keys.size())
629 if (Vals.size() != Keys.size())
tools/clang/lib/Format/BreakableToken.cpp 269 unsigned BreakableComment::getLineCount() const { return Lines.size(); }
349 Content.resize(Lines.size());
351 ContentColumn.resize(Lines.size());
354 Tokens.resize(Lines.size());
355 for (size_t i = 1; i < Lines.size(); ++i)
367 if (Lines.size() >= 2 && Content[1].startswith("**") &&
373 if (Lines.size() == 1 && !FirstInLine) {
381 for (size_t i = 1, e = Lines.size(); i < e && !Decoration.empty(); ++i) {
393 for (size_t i = 1, e = Lines.size(); i < e; ++i) {
432 if ((Lines[0] == "*" || Lines[0].startswith("* ")) && Lines.size() > 1) {
435 } else if (Lines[0].startswith("* ") && Lines.size() == 1) {
451 for (size_t i = 0; i < Lines.size(); ++i) {
517 if (LineIndex + 1 == Lines.size()) {
577 if (LineIndex + 1 == Lines.size() &&
665 if (LineIndex + 1 == Lines.size()) {
737 size_t FirstLineIndex = Lines.size();
739 Content.resize(Lines.size());
740 ContentColumn.resize(Lines.size());
741 OriginalContentColumn.resize(Lines.size());
742 Tokens.resize(Lines.size());
743 Prefix.resize(Lines.size());
744 OriginalPrefix.resize(Lines.size());
745 for (size_t i = FirstLineIndex, e = Lines.size(); i < e; ++i) {
tools/clang/lib/Format/ContinuationIndenter.cpp 625 Current.FakeLParens.size() > 0 &&
tools/clang/lib/Format/Format.cpp 1344 for (unsigned i = 0, e = AnnotatedLines.size(); i != e; ++i) {
1418 for (unsigned i = 0, e = AnnotatedLines.size(); i != e; ++i) {
1505 for (unsigned i = 0, e = AnnotatedLines.size(); i != e; ++i) {
1528 unsigned InitLine = CurrentLine, End = AnnotatedLines.size();
1847 for (int i = 0, e = Includes.size(); i != e; ++i) {
1905 for (unsigned i = 0, e = Includes.size(); i != e; ++i) {
1936 if (Indices.size() == Includes.size() &&
1936 if (Indices.size() == Includes.size() &&
2085 for (unsigned i = 0, e = Imports.size(); i != e; ++i) {
2422 for (size_t I = 0, E = Passes.size(); I < E; ++I) {
tools/clang/lib/Format/FormatToken.cpp 80 if (Formats.size() == 1)
114 if (Item < Commas.size() && State.NextToken->Previous == Commas[Item]) {
138 if (Formats.size() == 1 || HasNestedBracedList)
161 Commas.size() < 19)
167 if (Token->is(TT_ArrayInitializerLSquare) && Commas.size() < 19)
184 for (unsigned i = 0, e = Commas.size() + 1; i != e; ++i) {
195 if (i == Commas.size()) {
229 if (Commas.size() < 5 || HasSeparatingComment)
232 if (Token->NestingLevel != 0 && Token->is(tok::l_brace) && Commas.size() < 19)
248 for (unsigned i = 0, e = ItemLengths.size(); i != e; ++i) {
249 assert(i < MustBreakBeforeItem.size());
tools/clang/lib/Format/FormatTokenLexer.cpp 61 FirstInLineIndex = Tokens.size() - 1;
132 if (Tokens.size() < 2)
150 if (Tokens.size() < 2)
170 if (Tokens.size() < 2)
180 if (Tokens.size() >= 2 && At->is(tok::at)) {
207 if (Tokens.size() < 2)
224 if (Tokens.size() < 2)
244 if (Tokens.size() < 2)
261 if (Tokens.size() < 1)
276 if (Tokens.size() < 3)
280 if (Tokens.size() > 3)
302 if (Tokens.size() < Kinds.size())
316 Tokens.resize(Tokens.size() - Kinds.size() + 1);
349 return (Tokens.size() < 3 || precedesOperand(Tokens[Tokens.size() - 3]));
349 return (Tokens.size() < 3 || precedesOperand(Tokens[Tokens.size() - 3]));
507 if (Tokens.size() < 4)
513 FormatToken *String = Tokens[Tokens.size() - 2];
517 if (!Tokens[Tokens.size() - 3]->is(tok::l_paren))
520 FormatToken *Macro = Tokens[Tokens.size() - 4];
812 if (!(Tokens.size() > 0 && Tokens.back()->Tok.getIdentifierInfo() &&
tools/clang/lib/Format/NamespaceEndCommentsFixer.cpp 107 StringRef NamespaceTokenText = Groups.size() > 4 ? Groups[4] : "";
116 StringRef NamespaceNameInComment = Groups.size() > 5 ? Groups[5] : "";
120 StringRef AnonymousInComment = Groups.size() > 3 ? Groups[3] : "";
162 assert(StartLineIndex < AnnotatedLines.size());
194 for (size_t I = 0, E = AnnotatedLines.size(); I != E; ++I) {
tools/clang/lib/Format/SortJavaScriptImports.cpp 142 for (unsigned i = 0, e = References.size(); i != e; ++i)
151 for (unsigned i = 0, e = Indices.size(); i != e; ++i) {
171 InsertionPoint.setEnd(References[References.size() - 1].Range.getEnd());
313 for (size_t i = 0; i < Reference.Symbols.size(); ++i)
tools/clang/lib/Format/TokenAnalyzer.cpp 75 for (unsigned Run = 0, RunE = UnwrappedLines.size(); Run + 1 != RunE; ++Run) {
80 for (unsigned i = 0, e = UnwrappedLines[Run].size(); i != e; ++i) {
96 for (unsigned i = 0, e = AnnotatedLines.size(); i != e; ++i) {
tools/clang/lib/Format/TokenAnnotator.cpp 85 if (Previous.Previous->is(tok::r_paren) && Contexts.size() > 1 &&
145 Contexts[Contexts.size() - 2].IsExpression &&
172 Contexts.size() == 2 && Contexts[0].ColonIsForRangeExpr;
216 } else if (Contexts[Contexts.size() - 2].CaretFound) {
246 bool MightBeFunctionType = !Contexts[Contexts.size() - 2].IsExpression;
767 (Contexts.size() == 1 && // switch/case labels
773 (Contexts.size() == 1 &&
820 } else if (Contexts.size() == 1 &&
887 if (Line.MustBeDeclaration && Contexts.size() == 1 &&
991 (Contexts.size() == 1 || Line.startsWith(tok::kw_for))) {
1241 CurrentToken->NestingLevel = Contexts.size() - 1;
1501 Line.MightBeFunctionDecl && Contexts.size() == 1) {
2240 if (Current->Previous->Children.size() == 1) {
2246 if (Current->MustBreakBefore || Prev->Children.size() > 1 ||
2247 (Prev->Children.size() == 1 &&
3549 for (unsigned i = 0, e = Tok->FakeLParens.size(); i != e; ++i)
tools/clang/lib/Format/TokenAnnotator.h 73 for (unsigned i = 0, e = Children.size(); i != e; ++i) {
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 145 assert(StartLineIndex < AnnotatedLines.size());
767 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0)
790 if (Previous.Children.size() > 1)
tools/clang/lib/Format/UnwrappedLineParser.cpp 287 PPLevelBranchIndex.resize(PPLevelBranchIndex.size() - 1);
288 PPLevelBranchCount.resize(PPLevelBranchCount.size() - 1);
292 assert(PPLevelBranchIndex.size() == PPLevelBranchCount.size());
292 assert(PPLevelBranchIndex.size() == PPLevelBranchCount.size());
467 (!ExpectClassBody || LBraceStack.size() != 1)) ||
510 for (unsigned i = 0, e = LBraceStack.size(); i != e; ++i) {
549 CurrentLines == &Lines ? PreprocessorDirectives.size() : 0;
554 : (CurrentLines->size() - 1 - NbPreprocessorDirectives);
589 CurrentLines->size() - 1;
698 size_t Line = CurrentLines->size();
700 Line += Lines.size();
711 assert(PPBranchLevel >= 0 && PPBranchLevel <= (int)PPLevelBranchIndex.size());
712 if (PPBranchLevel == (int)PPLevelBranchIndex.size()) {
724 assert(PPBranchLevel < (int)PPLevelBranchIndex.size());
733 assert(PPBranchLevel < (int)PPLevelBranchIndex.size());
2672 for (unsigned i = Comments.size() - 1; i > 0; --i) {
2679 for (unsigned i = 0, e = Comments.size(); i < e; ++i) {
tools/clang/lib/Format/UsingDeclarationsSorter.cpp 40 size_t SizeA = NamesA.size();
41 size_t SizeB = NamesB.size();
138 for (size_t I = 0, E = UsingDeclarations->size(); I < E; ++I) {
139 if (I >= SortedUsingDeclarations.size()) {
191 for (size_t I = 0, E = AnnotatedLines.size(); I != E; ++I) {
tools/clang/lib/Format/WhitespaceManager.cpp 107 for (unsigned i = 1, e = Changes.size(); i != e; ++i) {
253 if (ScopeStack.size() != 0 &&
268 bool InsideNestedScope = ScopeStack.size() != 0;
296 if (i + 1 != Changes.size())
341 auto IndentAndNestingLevel = StartAt < Changes.size()
372 for (unsigned e = Changes.size(); i != e; ++i) {
466 if (I + 1 != Changes.size())
521 for (unsigned E = Changes.size(); I != E; ++I) {
616 for (unsigned i = 0, e = Changes.size(); i != e; ++i) {
689 alignTrailingComments(StartOfSequence, Changes.size(), MinColumn);
706 if (i + 1 != Changes.size())
719 for (unsigned i = 1, e = Changes.size(); i < e; ++i) {
731 alignEscapedNewlines(StartOfMacro + 1, Changes.size(), MaxEndOfLine);
749 for (unsigned i = 0, e = Changes.size(); i != e; ++i) {
tools/clang/lib/Frontend/ASTUnit.cpp 1781 AST->NumStoredDiagnosticsFromDriver = StoredDiagnostics.size();
2133 AllResults.size());
2330 OS.write(Buffer.data(), Buffer.size());
2362 Result.reserve(Diags.size());
tools/clang/lib/Frontend/ChainedIncludesSource.cpp 89 for (unsigned ti = 0; ti < bufNames.size(); ++ti) {
203 StringRef(serialAST.data(), serialAST.size())));
tools/clang/lib/Frontend/CompilerInstance.cpp 1918 if (Best.size() == 1) {
tools/clang/lib/Frontend/CompilerInvocation.cpp 1661 if (Args.size() < 5)
1668 if (Args.size() > 4)
tools/clang/lib/Frontend/DependencyFile.cpp 293 for (unsigned i = 0, e = NativePath.size(); i != e; ++i) {
tools/clang/lib/Frontend/DependencyGraph.cpp 130 for (unsigned I = 0, N = F->second.size(); I != N; ++I) {
tools/clang/lib/Frontend/DiagnosticRenderer.cpp 496 if (ValidCount > SpellingRanges.size())
545 IgnoredEnd = LocationStack.size();
560 unsigned MacroDepth = LocationStack.size();
tools/clang/lib/Frontend/FrontendActions.cpp 899 OS << Str.substr(0, Str.size() - 2);
913 OS << Str.substr(0, Str.size() - 2);
tools/clang/lib/Frontend/LayoutOverrideSource.cpp 175 if (NumFields >= Known->second.FieldOffsets.size())
182 if (NumFields != Known->second.FieldOffsets.size())
199 for (unsigned I = 0, N = L->second.FieldOffsets.size(); I != N; ++I) {
tools/clang/lib/Frontend/PrintPreprocessedOutput.cpp 846 for (unsigned i = 0, e = MacrosByID.size(); i != e; ++i) {
tools/clang/lib/Frontend/Rewrite/RewriteModernObjC.cpp 1091 for (unsigned i = 0; i < D.size(); i++) {
3105 for (unsigned i = 2; i < ArgTypes.size(); i++) {
3111 for (unsigned i = ArgTypes.size(); i < MsgExprs.size(); i++) {
3111 for (unsigned i = ArgTypes.size(); i < MsgExprs.size(); i++) {
3126 for (unsigned i = 2; i < ArgTypes.size(); i++) {
3130 for (unsigned i = ArgTypes.size(); i < MsgExprs.size(); i++) {
3130 for (unsigned i = ArgTypes.size(); i < MsgExprs.size(); i++) {
3141 for (unsigned i = 2; i < ArgTypes.size(); i++) {
3145 for (unsigned i = ArgTypes.size(); i < MsgExprs.size(); i++) {
3145 for (unsigned i = ArgTypes.size(); i < MsgExprs.size(); i++) {
3765 for (unsigned i = 0, e = IVars.size(); i < e; i++)
3787 for (unsigned i=0, e = IVars.size(); i < e; i++) {
3893 if ((!CDecl->isThisDeclarationADefinition() || IVars.size() == 0) &&
3903 for (unsigned i = 0, e = IVars.size(); i < e; i++)
3908 for (unsigned i = 0, e = IVars.size(); i < e; i++)
3928 for (unsigned i = 0, e = IVars.size(); i < e; i++) {
3997 int ClsDefCount = ClassImplementation.size();
3998 int CatDefCount = CategoryImplementation.size();
4190 if (BlockDeclRefs.size()) {
4334 for (unsigned i = 0, count=0; i < Blocks.size(); i++) {
4409 Tag += utostr(Blocks.size()-1);
5161 if (BlockDeclRefs.size()) {
5163 for (unsigned i = 0; i < BlockDeclRefs.size(); i++)
5171 for (unsigned i = 0; i < BlockDeclRefs.size(); i++)
5179 for (unsigned i = 0; i < BlockDeclRefs.size(); i++)
5206 for (unsigned i = 0; i < InnerBlockDeclRefs.size(); i++) {
5226 for (unsigned i = 0; i < InnerBlockDeclRefs.size(); i++)
5251 std::string BlockNumber = utostr(Blocks.size()-1);
5299 if (BlockDeclRefs.size()) {
5826 for (unsigned i = 0, e = FunctionDefinitionsSeen.size(); i < e; i++) {
5843 if (ClassImplementation.size() || CategoryImplementation.size())
5843 if (ClassImplementation.size() || CategoryImplementation.size())
5846 for (unsigned i = 0, e = ObjCInterfacesSeen.size(); i < e; i++) {
5865 if (ClassImplementation.size() || CategoryImplementation.size() ||
5865 if (ClassImplementation.size() || CategoryImplementation.size() ||
6782 Write__ivar_list_t_TypeDecl(Result, Ivars.size());
6787 Result += "\t"; Result += utostr(Ivars.size()); Result += ",\n";
6788 for (unsigned i =0, e = Ivars.size(); i < e; i++) {
6921 if (SuperProtocols.size() > 0) {
6955 if (ProtocolProperties.size() > 0) {
7155 int ClsDefCount = ClassImplementation.size();
7171 int ClsDefCount = ClassImplementation.size();
7172 int CatDefCount = CategoryImplementation.size();
7205 for (unsigned i = 0, e = DefinedNonLazyClasses.size(); i < e; i++) {
7236 for (unsigned i = 0, e = DefinedNonLazyCategories.size(); i < e; i++) {
7337 int CatDefCount = CategoryImplementation.size();
tools/clang/lib/Frontend/Rewrite/RewriteObjC.cpp 930 for (unsigned i = 0; i < D.size(); i++) {
3223 int ClsDefCount = ClassImplementation.size();
3224 int CatDefCount = CategoryImplementation.size();
3400 if (BlockDeclRefs.size()) {
3547 for (unsigned i = 0, count=0; i < Blocks.size(); i++) {
4315 if (BlockDeclRefs.size()) {
4317 for (unsigned i = 0; i < BlockDeclRefs.size(); i++)
4325 for (unsigned i = 0; i < BlockDeclRefs.size(); i++)
4333 for (unsigned i = 0; i < BlockDeclRefs.size(); i++)
4359 for (unsigned i = 0; i < InnerBlockDeclRefs.size(); i++) {
4379 for (unsigned i = 0; i < InnerBlockDeclRefs.size(); i++)
4396 std::string BlockNumber = utostr(Blocks.size()-1);
4437 if (BlockDeclRefs.size()) {
4911 if (ClassImplementation.size() || CategoryImplementation.size())
4911 if (ClassImplementation.size() || CategoryImplementation.size())
4924 if (ClassImplementation.size() || CategoryImplementation.size() ||
4924 if (ClassImplementation.size() || CategoryImplementation.size() ||
5515 int ClsDefCount = ClassImplementation.size();
5516 int CatDefCount = CategoryImplementation.size();
tools/clang/lib/Frontend/SerializedDiagnosticPrinter.cpp 792 OS->write((char *)&State->Buffer.front(), State->Buffer.size());
tools/clang/lib/Frontend/SerializedDiagnosticReader.cpp 201 if (Record.size() < 1)
266 if (Record.size() != 2)
274 if (Record.size() != 8)
283 if (Record.size() != 2)
291 if (Record.size() != 4)
298 if (Record.size() != 9)
307 if (Record.size() != 8)
316 if (Record.size() != 1)
tools/clang/lib/Frontend/TestModuleFileExtension.cpp 40 uint64_t Record[] = {FIRST_EXTENSION_RECORD_ID, Message.size()};
tools/clang/lib/Frontend/TextDiagnostic.cpp 143 while (expandedCP.size() < 8)
261 assert(m_byteToColumn.size()==SourceLine.size()+1);
262 assert(0 < m_byteToColumn.size() && 0 < m_columnToByte.size());
262 assert(0 < m_byteToColumn.size() && 0 < m_columnToByte.size());
263 assert(m_byteToColumn.size()
266 == m_columnToByte.size());
274 assert(0<=n && n<static_cast<int>(m_byteToColumn.size()));
280 assert(0 <= N && N < static_cast<int>(m_byteToColumn.size()));
290 assert(0<=n && n<static_cast<int>(m_columnToByte.size()));
296 assert(0 <= N && N < static_cast<int>(m_byteToColumn.size() - 1));
303 assert(0 < N && N < static_cast<int>(m_byteToColumn.size()));
793 Filename = StringRef(AbsoluteFilename.data(), AbsoluteFilename.size());
tools/clang/lib/Index/CommentToXML.cpp 451 for (unsigned i = 0, e = Parts.MiscBlocks.size(); i != e; ++i) {
458 if (Parts.TParams.size() != 0) {
460 for (unsigned i = 0, e = Parts.TParams.size(); i != e; ++i)
465 if (Parts.Params.size() != 0) {
467 for (unsigned i = 0, e = Parts.Params.size(); i != e; ++i)
472 if (Parts.Returns.size() != 0) {
474 for (unsigned i = 0, e = Parts.Returns.size(); i != e; ++i)
586 StringRef StringDecl(Declaration.c_str(), Declaration.size());
590 unsigned Length = Declaration.size();
955 if (Parts.TParams.size() != 0) {
957 for (unsigned i = 0, e = Parts.TParams.size(); i != e; ++i)
962 if (Parts.Params.size() != 0) {
964 for (unsigned i = 0, e = Parts.Params.size(); i != e; ++i)
976 if (Parts.Returns.size() != 0) {
978 for (unsigned i = 0, e = Parts.Returns.size(); i != e; ++i)
985 for (unsigned i = 0, e = Attrs.size(); i != e; i++) {
1051 for (unsigned i = 0, e = Parts.MiscBlocks.size(); i != e; ++i) {
tools/clang/lib/Index/IndexBody.cpp 27 return StmtStack.size() < 2 ? nullptr : StmtStack.end()[-2];
61 if (StmtStack.size() == 1)
tools/clang/lib/Index/USRGeneration.cpp 179 const unsigned startSize = Buf.size();
181 const unsigned endSize = Buf.size();
223 const unsigned StartSize = Buf.size();
225 if (Buf.size() == StartSize)
543 assert(Buf.size() > 0);
544 const unsigned off = Buf.size() - 1;
tools/clang/lib/Lex/DependencyDirectivesSourceMinimizer.cpp 69 Tokens.emplace_back(K, Out.size());
561 SplitIds.try_emplace(StringRef(Id.begin(), Id.size()), 0).first->first()};
701 size_t Size = Out.size();
tools/clang/lib/Lex/HeaderMap.cpp 240 return StringRef(DestPath.begin(), DestPath.size());
tools/clang/lib/Lex/HeaderSearch.cpp 411 Filename = StringRef(MappedName.begin(), MappedName.size());
557 unsigned OrigSize = FrameworkName.size();
1061 CacheLookup.first().size() == FrameworkName.size() &&
1371 for (unsigned I = 0, N = FixUpDirectories.size(); I != N; ++I)
tools/clang/lib/Lex/Lexer.cpp 231 typename T::size_type i = 0, e = Str.size();
357 return StringRef(buffer.data(), buffer.size());
tools/clang/lib/Lex/LiteralSupport.cpp 1265 uint32_t *buffer_end = buffer_begin + codepoint_buffer.size();
tools/clang/lib/Lex/MacroArgs.cpp 248 unsigned CurStrLen = Result.size();
272 unsigned FirstNonSlash = Result.size()-2;
276 if ((Result.size()-1-FirstNonSlash) & 1) {
289 Result[Result.size()-1] = '\'';
293 if (Result.size() == 3)
296 isBad = (Result.size() != 4 || Result[1] != '\\'); // Not '\x'
tools/clang/lib/Lex/MacroInfo.cpp 79 if (ReplacementTokens.size() != Other.ReplacementTokens.size() ||
79 if (ReplacementTokens.size() != Other.ReplacementTokens.size() ||
95 for (unsigned i = 0, e = ReplacementTokens.size(); i != e; ++i) {
tools/clang/lib/Lex/ModuleMap.cpp 138 for (unsigned I = 1, N = Id.size(); I != N; ++I) {
170 for (unsigned I = Paths.size() - 1; I != 0; --I)
191 unsigned FullPathLength = FullPathName.size();
193 unsigned RelativePathLength = RelativePathName.size();
346 Buffer.reserve(Buffer.size() + Name.size());
354 Name = StringRef(Buffer.data(), Buffer.size());
365 Name = StringRef(Buffer.data(), Buffer.size());
613 for (unsigned I = SkippedDirs.size(); I != 0; --I) {
649 for (unsigned I = 0, N = SkippedDirs.size(); I != N; ++I)
727 for (unsigned I = SkippedDirs.size(); I != 0; --I) {
1849 if (Id.size() > 1) {
1856 } else if (Id.size() == 1 && Explicit) {
1865 if (Id.size() > 1) {
1870 for (unsigned I = 0, N = Id.size() - 1; I != N; ++I) {
2644 for (unsigned I = 0, N = Id.size(); I != N; ++I) {
tools/clang/lib/Lex/PPCaching.cpp 56 if (CachedLexPos < CachedTokens.size()) {
73 if (CachedLexPos < CachedTokens.size()) {
106 assert(CachedLexPos + N > CachedTokens.size() && "Confused caching.");
108 for (size_t C = CachedLexPos + N - CachedTokens.size(); C > 0; --C) {
tools/clang/lib/Lex/PPDirectives.cpp 2112 Path.size() <= Filename.size() ? Filename[Path.size()-1] :
2112 Path.size() <= Filename.size() ? Filename[Path.size()-1] :
tools/clang/lib/Lex/PPLexerChange.cpp 160 if (CachedLexPos < CachedTokens.size()) {
650 PendingModuleMacroNames.size()));
695 PendingModuleMacroNames.size()));
751 I != PendingModuleMacroNames.size(); ++I) {
tools/clang/lib/Lex/PPMacroExpansion.cpp 785 size_t ArgTokenStart = ArgTokens.size();
870 if (ArgTokens.size() != ArgTokenStart)
878 if (ArgTokens.size() == ArgTokenStart && !LangOpts.C99)
1029 size_t newIndex = MacroExpandedTokens.size();
1031 MacroExpandedTokens.capacity()-MacroExpandedTokens.size();
1052 assert(tokIndex < MacroExpandedTokens.size());
tools/clang/lib/Lex/Pragma.cpp 145 auto Toks = std::make_unique<Token[]>(Tokens.size());
147 Toks[Tokens.size() - 1] = Tok;
148 Self.EnterTokenStream(std::move(Toks), Tokens.size(),
379 Token *TokArray = new Token[PragmaToks.size()];
383 EnterTokenStream(TokArray, PragmaToks.size(), true, true,
1596 << ModuleName.front().first << (ModuleName.size() > 1)
1610 for (unsigned I = 1; I != ModuleName.size(); ++I) {
tools/clang/lib/Lex/Preprocessor.cpp 1022 size_t PreAppendSize = FilenameBuffer.size();
tools/clang/lib/Lex/TokenLexer.cpp 191 const unsigned int NumVAOptTokens = ResultToks.size() - NumToksPriorToVAOpt;
272 ResultToks.size());
326 ResultToks.size() == VCtx.getNumberOfTokensPriorToVAOpt()) {
332 if (ResultToks.size() && ResultToks.back().is(tok::hashhash)) {
344 ResultToks.size() >= VCtx.getNumberOfTokensPriorToVAOpt() &&
461 size_t FirstResult = ResultToks.size();
520 if (NonEmptyPasteBefore && ResultToks.size() >= 2 &&
521 ResultToks[ResultToks.size()-2].is(tok::comma) &&
549 ResultToks[ResultToks.size() - NumToks].setFlagValue(Token::StartOfLine,
551 ResultToks[ResultToks.size() - NumToks].setFlagValue(
584 ResultToks.size() > VCtx.getNumberOfTokensPriorToVAOpt())
604 NumTokens = ResultToks.size();
tools/clang/lib/Parse/ParseCXXInlineMethods.cpp 35 TemplateInfo.TemplateParams ? TemplateInfo.TemplateParams->size() : 0);
281 for (size_t i = 0; i < Class.LateParsedDeclarations.size(); ++i) {
305 for (unsigned I = 0, N = LM.DefaultArgs.size(); I != N; ++I) {
355 assert(Toks->size() >= 3 && "expected a token in default arg");
358 (*Toks)[Toks->size() - 3].getLocation());
479 for (size_t i = 0; i < Class.LateParsedDeclarations.size(); ++i) {
599 for (size_t i = 0; i < Class.LateParsedDeclarations.size(); ++i) {
878 const Token &PreviousToken = Toks[Toks.size() - 2];
988 if (Toks.size()) {
989 auto Buffer = std::make_unique<Token[]>(Toks.size());
991 Buffer[Toks.size() - 1] = Self.Tok;
992 Self.PP.EnterTokenStream(std::move(Buffer), Toks.size(), true,
tools/clang/lib/Parse/ParseDecl.cpp 155 unsigned OldNumLateAttrs = LateAttrs ? LateAttrs->size() : 0;
239 for (unsigned i = OldNumLateAttrs; i < LateAttrs->size(); ++i)
417 ArgExprs.data(), ArgExprs.size(), Syntax);
424 return static_cast<unsigned>(ArgExprs.size() + !TheParsedType.get().isNull());
1447 for (unsigned i = 0, ni = Class.LateParsedDeclarations.size(); i < ni; ++i){
1462 for (unsigned i = 0, ni = LAs.size(); i < ni; ++i) {
1497 if (LA.Decls.size() > 0) {
1506 if (LA.Decls.size() == 1) {
1548 for (unsigned i = 0, ni = LA.Decls.size(); i < ni; ++i)
2127 if (LateParsedAttrs.size() > 0)
2436 assert(!Exprs.empty() && Exprs.size()-1 == CommaLocs.size() &&
2436 assert(!Exprs.empty() && Exprs.size()-1 == CommaLocs.size() &&
4522 TemplateInfo.TemplateParams->size());
4752 assert(EnumConstantDecls.size() == EnumAvailabilityDiags.size());
4752 assert(EnumConstantDecls.size() == EnumAvailabilityDiags.size());
4753 for (size_t i = 0, e = EnumConstantDecls.size(); i != e; ++i) {
6289 HasProto = ParamInfo.size() || getLangOpts().CPlusPlus
6424 ParamInfo.size(), EllipsisLoc, RParenLoc,
6428 DynamicExceptionRanges.data(), DynamicExceptions.size(),
tools/clang/lib/Parse/ParseDeclCXX.cpp 190 for (unsigned i = 0, e = ExtraNSs.size(); i != e; ++i)
241 if (index == InnerNSs.size()) {
762 if (DeclsInGroup.size() > 1)
849 TemplateParams ? TemplateParams->size() : 0);
1576 if (TemplateParams->size() > 1) {
1882 TemplateParams ? TemplateParams->size() : 0),
1905 TemplateParams ? TemplateParams->size() : 0));
1927 MultiTemplateParamsArg(&(*TemplateParams)[0], TemplateParams->size());
2623 TemplateInfo.TemplateParams? TemplateInfo.TemplateParams->size() : 0);
2743 for (unsigned i = 0, ni = CommonLateParsedAttrs.size(); i < ni; ++i) {
2746 for (unsigned i = 0, ni = LateParsedAttrs.size(); i < ni; ++i) {
2874 for (unsigned i = 0, ni = CommonLateParsedAttrs.size(); i < ni; ++i)
2877 for (unsigned i = 0, ni = LateParsedAttrs.size(); i < ni; ++i)
3647 assert(DynamicExceptions.size() == DynamicExceptionRanges.size() &&
3647 assert(DynamicExceptions.size() == DynamicExceptionRanges.size() &&
3810 for (unsigned I = 0, N = Class->LateParsedDeclarations.size(); I != N; ++I)
4275 Toks[0].setLength(StrBuffer.size());
4283 SourceLocation(), ArgExprs.data(), ArgExprs.size(),
tools/clang/lib/Parse/ParseExpr.cpp 1728 assert((ArgExprs.size() == 0 ||
1729 ArgExprs.size()-1 == CommaLocs.size())&&
1729 ArgExprs.size()-1 == CommaLocs.size())&&
2638 if (ExprType >= FoldExpr && ArgExprs.size() == 1 &&
tools/clang/lib/Parse/ParseExprCXX.cpp 1375 ParamInfo.size(), EllipsisLoc, RParenLoc,
1379 DynamicExceptionRanges.data(), DynamicExceptions.size(),
1877 assert((Exprs.size() == 0 || Exprs.size()-1 == CommaLocs.size())&&
1877 assert((Exprs.size() == 0 || Exprs.size()-1 == CommaLocs.size())&&
1877 assert((Exprs.size() == 0 || Exprs.size()-1 == CommaLocs.size())&&
3317 if (Arity && Args.size() != Arity) {
3319 << Arity << 0 << (Arity > 1) << (int)Args.size() << SourceRange(Loc);
3325 << 1 << 1 << 1 << (int)Args.size() << SourceRange(Loc);
tools/clang/lib/Parse/ParseObjc.cpp 162 ClassNames.size());
287 ProtocolRefs.data(), ProtocolRefs.size(), ProtocolLocs.data(),
359 protocols.size(), protocolLocs.data(), EndProtoLoc, attrs);
514 getCurScope(), variance, varianceLoc, typeParams.size(), paramName,
1383 selLoc, Sel, nullptr, CParamInfo.data(), CParamInfo.size(), methodAttrs,
1500 if (KeyIdents.size() == 0)
1503 Selector Sel = PP.getSelectorTable().getSelector(KeyIdents.size(),
1507 Sel, &ArgInfos[0], CParamInfo.data(), CParamInfo.size(), methodAttrs,
1624 for (unsigned i = 0, n = identifiers.size(); i != n; ++i) {
1680 for (unsigned i = 0, n = identifiers.size(); i != n; ++i) {
1747 if (unknownTypeArgs.size())
1748 for (unsigned i = 0, e = unknownTypeArgsLoc.size(); i < e; ++i)
2078 AtLoc, protocolName, nameLoc, ProtocolRefs.data(), ProtocolRefs.size(),
2254 for (size_t i = 0; i < LateParsedObjCMethods.size(); ++i)
2261 for (size_t i = 0; i < LateParsedObjCMethods.size(); ++i)
3294 unsigned nKeys = KeyIdents.size();
tools/clang/lib/Parse/ParseOpenMP.cpp 320 unsigned I = 0, E = ReductionTypes.size();
459 assert(!Exprs.empty() && Exprs.size() - 1 == CommaLocs.size() &&
459 assert(!Exprs.empty() && Exprs.size() - 1 == CommaLocs.size() &&
570 ParseOpenMPClause(OMPD_declare_mapper, CKind, Clauses.size() == 0);
735 Alignments.append(Aligneds.size() - Alignments.size(), Data.TailExpr);
735 Alignments.append(Aligneds.size() - Alignments.size(), Data.TailExpr);
740 LinModifiers.append(Linears.size() - LinModifiers.size(),
740 LinModifiers.append(Linears.size() - LinModifiers.size(),
742 Steps.append(Linears.size() - Steps.size(), Data.TailExpr);
742 Steps.append(Linears.size() - Steps.size(), Data.TailExpr);
890 llvm::makeMutableArrayRef(ImplVendors.begin(), ImplVendors.size()),
1354 if (Clauses.size() == 0) {
tools/clang/lib/Parse/ParsePragma.cpp 1990 PP.getPreprocessorAllocator().Allocate<Token>(2 * Identifiers.size()),
1991 2 * Identifiers.size());
1992 for (unsigned i=0; i != Identifiers.size(); i++) {
2242 auto Toks = std::make_unique<Token[]>(Pragma.size());
2244 PP.EnterTokenStream(std::move(Toks), Pragma.size(),
2459 auto TokenArray = std::make_unique<Token[]>(TokenVector.size());
2463 TokenVector.size());
2744 auto TokenArray = std::make_unique<Token[]>(TokenList.size());
2747 PP.EnterTokenStream(std::move(TokenArray), TokenList.size(),
2929 auto TokenArray = std::make_unique<Token[]>(TokenList.size());
2932 PP.EnterTokenStream(std::move(TokenArray), TokenList.size(),
tools/clang/lib/Parse/ParseStmtAsm.cpp 100 if (NumConsumedToks == 0 || NumConsumedToks == LineToks.size()) {
263 LineIndex = LineToks.size() - 2;
267 assert(LineIndex < LineToks.size() - 2); // we added two extra tokens
274 NumLineToksConsumed = LineToks.size() - 2;
282 for (unsigned i = 0, e = LineToks.size() - LineIndex - 2; i != e; ++i) {
321 TokOffsets.push_back(Asm.size());
348 assert(TokOffsets.size() == AsmToks.size());
777 unsigned NumOutputs = Names.size();
793 assert(Names.size() == Constraints.size() &&
793 assert(Names.size() == Constraints.size() &&
794 Constraints.size() == Exprs.size() && "Input operand size mismatch!");
794 Constraints.size() == Exprs.size() && "Input operand size mismatch!");
796 unsigned NumInputs = Names.size() - NumOutputs;
tools/clang/lib/Parse/ParseTemplate.cpp 327 if (LateParsedAttrs.size() > 0)
465 = ParseTemplateParameter(Depth, TemplateParams.size())) {
1432 TemplateParams->size());
tools/clang/lib/Rewrite/Rewriter.cpp 282 for (unsigned i = 0, e = lines.size(); i != e; ++i) {
tools/clang/lib/Sema/CodeCompleteConsumer.cpp 387 for (unsigned I = Contexts.size(); I != 0; --I) {
421 sizeof(CodeCompletionString) + sizeof(Chunk) * Chunks.size() +
422 sizeof(const char *) * Annotations.size(),
425 Chunks.data(), Chunks.size(), Priority, Availability, Annotations.data(),
426 Annotations.size(), ParentName, BriefComment);
tools/clang/lib/Sema/DeclSpec.cpp 313 for (unsigned i = 0, i_end = DeclTypeInfo.size(); i < i_end; ++i) {
tools/clang/lib/Sema/JumpDiagnostics.cpp 228 ParentScope = Scopes.size()-1;
275 ParentScope = Scopes.size()-1;
303 unsigned NewParentScope = Scopes.size();
369 unsigned NewParentScope = Scopes.size();
374 NewParentScope = Scopes.size();
378 NewParentScope = Scopes.size();
388 unsigned NewParentScope = Scopes.size();
400 unsigned NewParentScope = Scopes.size();
413 unsigned NewParentScope = Scopes.size();
424 unsigned NewParentScope = Scopes.size();
431 unsigned NewParentScope = Scopes.size();
459 unsigned NewParentScope = Scopes.size();
471 unsigned NewParentScope = Scopes.size();
482 unsigned NewParentScope = Scopes.size();
503 unsigned NewParentScope = Scopes.size();
517 unsigned NewParentScope = Scopes.size();
555 origParentScope = Scopes.size()-1;
726 llvm::BitVector Reachable(Scopes.size(), false);
tools/clang/lib/Sema/MultiplexExternalSemaSource.cpp 43 for(size_t i = 0; i < Sources.size(); ++i)
50 for (size_t i = 0; i < Sources.size(); ++i)
56 for(size_t i = 0; i < Sources.size(); ++i) {
66 for(size_t i = 0; i < Sources.size(); ++i)
72 for(size_t i = 0; i < Sources.size(); ++i)
80 for(size_t i = 0; i < Sources.size(); ++i)
106 for (size_t i = 0; i < Sources.size(); ++i)
112 for(size_t i = 0; i < Sources.size(); ++i)
119 for(size_t i = 0; i < Sources.size(); ++i)
127 for(size_t i = 0; i < Sources.size(); ++i)
132 for(size_t i = 0; i < Sources.size(); ++i)
137 for(size_t i = 0; i < Sources.size(); ++i)
142 for(size_t i = 0; i < Sources.size(); ++i)
147 for(size_t i = 0; i < Sources.size(); ++i)
152 for(size_t i = 0; i < Sources.size(); ++i)
157 for(size_t i = 0; i < Sources.size(); ++i)
162 for(size_t i = 0; i < Sources.size(); ++i)
167 for (size_t i = 0; i < Sources.size(); ++i)
186 for(size_t i = 0; i < Sources.size(); ++i)
195 for(size_t i = 0; i < Sources.size(); ++i)
206 for(size_t i = 0; i < Sources.size(); ++i)
211 for(size_t i = 0; i < Sources.size(); ++i)
216 for(size_t i = 0; i < Sources.size(); ++i)
221 for(size_t i = 0; i < Sources.size(); ++i)
227 for(size_t i = 0; i < Sources.size(); ++i)
233 for(size_t i = 0; i < Sources.size(); ++i)
246 for(size_t i = 0; i < Sources.size(); ++i)
254 for(size_t i = 0; i < Sources.size(); ++i)
260 for(size_t i = 0; i < Sources.size(); ++i)
266 for(size_t i = 0; i < Sources.size(); ++i)
272 for(size_t i = 0; i < Sources.size(); ++i)
278 for(size_t i = 0; i < Sources.size(); ++i)
284 for(size_t i = 0; i < Sources.size(); ++i)
290 for(size_t i = 0; i < Sources.size(); ++i)
296 for(size_t i = 0; i < Sources.size(); ++i)
303 for(size_t i = 0; i < Sources.size(); ++i)
310 for (size_t i = 0; i < Sources.size(); ++i)
321 for (size_t I = 0, E = Sources.size(); I < E; ++I) {
332 for (size_t I = 0, E = Sources.size(); I < E; ++I) {
tools/clang/lib/Sema/ParsedAttr.cpp 66 if (index < FreeLists.size() && !FreeLists[index].empty()) {
81 if (freeListIndex >= FreeLists.size())
tools/clang/lib/Sema/Sema.cpp 1819 for (int e = FunctionScopes.size() - 1; e >= 0; --e) {
1870 return (LSI->TemplateParams.size() ||
tools/clang/lib/Sema/SemaAccess.cpp 617 assert(I < CurPath.size());
618 for (unsigned E = CurPath.size(); I != E; ++I) {
649 BasePrivateDepth = CurPath.size() - 1;
tools/clang/lib/Sema/SemaAttr.cpp 783 for (size_t Index = PragmaAttributeStack.size(); Index;) {
tools/clang/lib/Sema/SemaCUDA.cpp 216 if (Matches.size() <= 1)
tools/clang/lib/Sema/SemaChecking.cpp 4849 for (unsigned i = 0; i != APIOrderedArgs.size(); ++i) {
4955 if (SubExprs.size() >= 2 && Form != Init) {
6531 if (Fields.size() != ExpectedFieldNum && !(AllowName && Fields.size() == 1))
6531 if (Fields.size() != ExpectedFieldNum && !(AllowName && Fields.size() == 1))
6539 if (Fields.size() > 1) {
6540 bool FiveFields = Fields.size() == 5;
6567 for (unsigned i=0; i<Fields.size(); ++i) {
6576 } else if (IsAArch64Builtin && Fields.size() == 1) {
7500 assert(hasUncoveredArg() && DiagnosticExprs.size() > 0 &&
12506 return Seq(Values.size() - 1);
12955 for (unsigned I = 0; I < Elts.size(); ++I)
12976 for (unsigned I = 0; I < Elts.size(); ++I)
tools/clang/lib/Sema/SemaCodeComplete.cpp 4023 for (unsigned I = 0, N = Modules.size(); I != N; ++I) {
4356 for (unsigned I = 0, N = Data.IgnoreDecls.size(); I != N; ++I)
8313 for (unsigned I = 0, N = Containers.size(); I != N; ++I)
tools/clang/lib/Sema/SemaDecl.cpp 2630 for (unsigned I = 0, E = NewAttributes.size(); I != E;) {
3638 Param->setScopeInfo(0, Params.size());
3694 for (unsigned Warn = 0; Warn < Warnings.size(); ++Warn) {
4717 unsigned OldChainingSize = Chaining.size();
4723 assert(Chaining.size() >= 2);
4725 new (SemaRef.Context)NamedDecl*[Chaining.size()];
4726 for (unsigned i = 0; i < Chaining.size(); i++)
4731 VD->getType(), {NamedChain, Chaining.size()});
9012 Param->setScopeInfo(0, Params.size());
12493 if (Notes.size() == 1 && Notes[0].second.getDiagID() ==
12500 for (unsigned I = 0, N = Notes.size(); I != N; ++I)
13649 for (unsigned I = 0, E = Scope->Returns.size(); I != E; ++I) {
14055 assert(ExprCleanupObjects.size() ==
14253 Context, Encoding.data(), Encoding.size(), FD->getLocation()));
16371 Decl *ivarDecl = AllIvarDecls[AllIvarDecls.size()-1];
16683 assert(SO->second.size() > 0 &&
16685 if (SO->second.size() == 1)
16796 for (unsigned i = 0, e = RecFields.size(); i != e; ++i) {
16807 for (unsigned I = 0, N = RecFields.size(); I != N; ++I)
16811 CheckImplementationIvars(IMPDecl, ClsFields, RecFields.size(), RBrac);
16823 for (unsigned i = 0, e = RecFields.size(); i != e; ++i) {
17301 assert(Vec->size() > 1 && "ECDVector should have at least 2 elements.");
tools/clang/lib/Sema/SemaDeclAttr.cpp 738 unsigned Size = Args.size();
793 AcquiredAfterAttr(S.Context, AL, StartArg, Args.size()));
803 AcquiredBeforeAttr(S.Context, AL, StartArg, Args.size()));
820 unsigned Size = Args.size();
832 unsigned Size = Args.size();
923 S.Context, AL, AL.getArgAsExpr(0), Args.data(), Args.size()));
933 S.Context, AL, AL.getArgAsExpr(0), Args.data(), Args.size()));
940 unsigned Size = Args.size();
954 unsigned Size = Args.size();
1172 CallableWhenAttr(S.Context, AL, States.data(), States.size()));
1485 unsigned Size = NonNullArgs.size();
1733 unsigned Size = OwnershipArgs.size();
1925 CPUSpecificAttr(S.Context, AL, CPUs.data(), CPUs.size()));
1928 CPUDispatchAttr(S.Context, AL, CPUs.data(), CPUs.size()));
2220 for (unsigned i = 0, e = Attrs.size(); i != e;) {
3456 if (CalleeFnProtoType->getNumParams() > EncodingIndices.size() - 1) {
3458 << AL << (unsigned)(EncodingIndices.size() - 1);
3462 if (CalleeFnProtoType->getNumParams() < EncodingIndices.size() - 1) {
3464 << AL << (unsigned)(EncodingIndices.size() - 1);
3480 S.Context, AL, EncodingIndices.data(), EncodingIndices.size()));
5428 AbiTagAttr(S.Context, AL, Tags.data(), Tags.size()));
6071 AssertCapabilityAttr(S.Context, AL, Args.data(), Args.size()));
6081 Args.size()));
6091 S.Context, AL, AL.getArgAsExpr(0), Args.data(), Args.size()));
6101 Args.size()));
6116 RequiresCapabilityAttr(S.Context, AL, Args.data(), Args.size());
7358 Param->setScopeInfo(0, Params.size());
7745 NumParams = SlotNames.size();
7747 if (SlotNames.size() != 1)
7991 assert(SelectorSlotNames.size() == Locs.size());
tools/clang/lib/Sema/SemaDeclCXX.cpp 402 if (Toks->size() > 1)
756 Err << (int)BadSpecifiers.size()
767 Warn << (int)CPlusPlus20Specifiers.size()
2263 } else if (ReturnStmts.size() > 1) {
2271 for (unsigned I = 0; I < ReturnStmts.size() - 1; ++I)
2303 for (size_t I = 0, N = Diags.size(); I != N; ++I)
2789 for (unsigned I = Path.size(); I != 0; --I) {
2797 for (unsigned I = Start, E = Path.size(); I != E; ++I)
2847 if (PossiblePath.size() == 1) {
2987 << "override" << (OverloadedMethods.size() > 1);
2992 << (OverloadedMethods.size() > 1);
5101 unsigned NumInitializers = Info.AllToInit.size();
5189 unsigned NumIdealInits = IdealInitKeys.size();
5566 if (SO->second.size() != 1)
8293 for (unsigned i = 0, e = OverloadedMethods.size(); i != e; ++i) {
8315 << MD << (OverloadedMethods.size() > 1);
13613 for (unsigned I = 0, N = Notes.size(); I != N; ++I)
13670 llvm::makeArrayRef(AllArgs.data(), AllArgs.size()),
15571 for (unsigned I = 0, N = VTables.size(); I != N; ++I) {
15660 for (unsigned I = 0; I != VTableUses.size(); ++I) {
15763 assert(OI->second.size() > 0 && "no final overrider");
15797 for (unsigned i = 0; i < ivars.size(); i++) {
15837 AllToInit.data(), AllToInit.size());
tools/clang/lib/Sema/SemaDeclObjC.cpp 1446 for (unsigned i = 0, n = protocols.size(); i != n; ++i) {
1515 assert(protocols.size() == identifierLocs.size());
3493 return Methods.size() > 1;
3507 return Methods.size() > 1;
3521 if (FilteredMethods.size() > 1)
3567 for (unsigned I = 1, N = Methods.size(); I != N; ++I) {
3580 for (unsigned I = 1, N = Methods.size(); I != N; ++I) {
3602 for (unsigned I = 1, N = Methods.size(); I != N; ++I) {
3715 for (unsigned i = 0, e = Methods.size(); i < e; i++) {
3719 return (SelectedMethods.size() == 1) ? SelectedMethods[0] : nullptr;
4828 for (unsigned i = 0; i < Ivars.size(); i++) {
4970 for (unsigned I = 0, N = Sels.size(); I != N; ++I)
tools/clang/lib/Sema/SemaExpr.cpp 1549 if (CompatIndices.size() > 1) {
1555 << (unsigned)CompatIndices.size();
1568 if (DefaultIndex == -1U && CompatIndices.size() == 0) {
1583 CompatIndices.size() ? CompatIndices[0] : DefaultIndex;
1698 StringTokLocs.size());
3356 << StringRef(buffer.data(), buffer.size());
4158 if (T->isVariablyModifiedType() && FunctionScopes.size() > 1) {
4774 FunctionScopes.size() > 1) {
5135 unsigned TotalNumArgs = AllArgs.size();
13907 Comps.push_back(OffsetOfNode(OC.LocStart, Exprs.size(), OC.LocEnd));
14986 if (Notes.size() == 1 && Notes[0].second.getDiagID() ==
15063 ExprEvalContexts[ExprEvalContexts.size()-2].Context;
15073 ExprEvalContexts.emplace_back(NewContext, ExprCleanupObjects.size(), Cleanup,
15559 CodeSynthesisContexts.size())
16033 ? *FunctionScopeIndexToStopAt : FunctionScopes.size() - 1;
16037 unsigned FSIndex = FunctionScopes.size() - 1;
17719 Param->setScopeInfo(0, Params.size());
tools/clang/lib/Sema/SemaExprCXX.cpp 1156 : FunctionScopes.size() - 1;
2585 if (Matches.size() == 1) {
2910 if (Matches.size() == 1) {
6206 NeedConstBefore = QualifierUnion.size();
6223 NeedConstBefore = QualifierUnion.size();
6247 if (QualifierUnion.size() == 1) {
6532 assert(ExprCleanupObjects.size() >= FirstCleanup);
6534 ExprCleanupObjects.size() == FirstCleanup);
6539 ExprCleanupObjects.size() - FirstCleanup);
6635 for (unsigned I = 0, N = ExprEvalContexts.back().DelayedDecltypeCalls.size();
6648 for (unsigned I = 0, N = ExprEvalContexts.back().DelayedDecltypeBinds.size();
6746 if (OperatorArrows.size() >= getLangOpts().ArrowDepth) {
tools/clang/lib/Sema/SemaExprObjC.cpp 70 CAT->getElementType(), llvm::APInt(32, StrBuf.size() + 1), nullptr,
74 StrLocs.size());
1489 for (unsigned i = 0, e = overrides.size(); i != e; ++i) {
tools/clang/lib/Sema/SemaInit.cpp 2280 &Replacements[0] + Replacements.size());
3153 Designators.push_back(ASTDesignator(InitExpressions.size(),
3193 Designators.push_back(ASTDesignator(InitExpressions.size(),
6670 unsigned OldSize = Path.size();
7286 for (unsigned N = Path.size(); I != N; ++I) {
7524 for (unsigned I = 0; I != Path.size(); ++I) {
tools/clang/lib/Sema/SemaLambda.cpp 750 if (CSI.Returns.size() == 1)
1066 LSI->ExplicitCaptureRanges[LSI->Captures.size() - 1] = C->ExplicitRange;
1218 LSI->ExplicitCaptureRanges[LSI->Captures.size() - 1] = C->ExplicitRange;
1688 for (unsigned I = 0, N = LSI->Captures.size(); I != N; ++I) {
tools/clang/lib/Sema/SemaLookup.cpp 694 GenTypeMaxCnt = RetTypes.size();
702 GenTypeMaxCnt = (Ty.size() > GenTypeMaxCnt) ? Ty.size() : GenTypeMaxCnt;
702 GenTypeMaxCnt = (Ty.size() > GenTypeMaxCnt) ? Ty.size() : GenTypeMaxCnt;
727 for (unsigned A = 0; A < ArgTypes.size(); A++) {
731 assert(GenTypeMaxCnt % ArgTypes[A].size() == 0 &&
733 unsigned Idx = IGenType % ArgTypes[A].size();
738 RetTypes[(RetTypes.size() != 1) ? IGenType : 0], ArgList, PI));
1549 unsigned N = CodeSynthesisContexts.size();
1550 for (unsigned I = CodeSynthesisContextLookupModules.size();
4304 for (unsigned I = 0; I != Types.size(); ++I) {
4318 if (++CurrentTCIndex < ValidatedCorrections.size())
4321 CurrentTCIndex = ValidatedCorrections.size();
tools/clang/lib/Sema/SemaModule.cpp 126 assert(ModuleScopes.size() <= 1 && "expected to be at global module scope");
tools/clang/lib/Sema/SemaObjCProperty.cpp 1844 for (unsigned i = 0, e = PropertyOrder.size(); i != e; i++) {
tools/clang/lib/Sema/SemaOpenMP.cpp 203 Stack.back().first.size() <= IgnoredStackElements;
207 : Stack.back().first.size() - IgnoredStackElements;
789 MEC.Components.resize(MEC.Components.size() + 1);
1979 FunctionScopesIndex -= Regions.size();
3501 return CaptureRegions.size();
3674 } else if (CaptureRegions.size() > 1 ||
3745 if (++CompletedRegions == CaptureRegions.size())
4266 if (CaptureRegions.size() > 1 && CaptureRegions.front() == OMPD_task)
4294 ImplicitFirstprivates.size();
4308 cast<OMPMapClause>(Implicit)->varlist_size() != ImplicitMaps.size();
4949 const_cast<Expr **>(NewAligns.data()), NewAligns.size(),
4952 NewSteps.data(), NewSteps.size(), SR);
6697 Pair.second.size() <= CurrentNestedLoopCount) {
13913 << (Vars.size() > 1);
14025 UsedExprs.append(Clause.varlist_size() + 1 - UsedExprs.size(), nullptr);
15355 MVLI.VarComponents.resize(MVLI.VarComponents.size() + 1);
15497 MVLI.VarComponents.resize(MVLI.VarComponents.size() + 1);
15657 DeclGroupRef::Create(Context, Decls.begin(), Decls.size()));
16456 MVLI.VarComponents.resize(MVLI.VarComponents.size() + 1);
16539 MVLI.VarComponents.resize(MVLI.VarComponents.size() + 1);
tools/clang/lib/Sema/SemaOverload.cpp 5609 if (Notes.size() == 1 &&
5615 for (unsigned I = 0; I < Notes.size(); ++I)
6301 if (Methods.size() <= 1)
6304 for (unsigned b = 0, e = Methods.size(); b < e; b++) {
6373 else if (Match && NumNamedArgs == 0 && Methods.size() > 1) {
6376 for (unsigned b = 0, e = Methods.size(); b < e; b++) {
7943 FirstIntegralType = ArithmeticTypes.size();
7944 FirstPromotedIntegralType = ArithmeticTypes.size();
7955 LastPromotedIntegralType = ArithmeticTypes.size();
7956 LastPromotedArithmeticType = ArithmeticTypes.size();
7970 LastIntegralType = ArithmeticTypes.size();
7971 NumArithmeticTypes = ArithmeticTypes.size();
7975 assert(ArithmeticTypes.size() <= ArithmeticTypesCap &&
11358 if (Matches.size() > 1 && !eliminiateSuboptimalOverloadCandidates()) {
11366 if (S.getLangOpts().CUDA && Matches.size() > 1)
11568 for (unsigned I = 0, E = Matches.size(); I != E; ++I)
11594 for (unsigned I = 0, N = Matches.size(); I != N; ) {
11662 assert(Matches.size() > 1);
11671 int getNumMatches() const { return Matches.size(); }
11674 if (Matches.size() != 1) return nullptr;
11679 if (Matches.size() != 1) return nullptr;
tools/clang/lib/Sema/SemaPseudoObject.cpp 208 ResultIndex = Semantics.size();
231 ResultIndex = Semantics.size() - 1;
401 assert(index < Semantics.size() &&
1117 for (unsigned int i = 0; i < ConversionDecls.size(); i++)
1463 assert(Idx <= CallArgs.size());
tools/clang/lib/Sema/SemaStmt.cpp 982 for (unsigned i = 0, e = CaseVals.size(); i != e; ++i) {
1235 << (int)UnhandledNames.size();
1237 for (size_t I = 0, E = std::min(UnhandledNames.size(), (size_t)3);
tools/clang/lib/Sema/SemaStmtAsm.cpp 136 while (WorkList.size()) {
470 for (unsigned i = 0, e = Pieces.size(); i != e; ++i) {
521 for (unsigned i = 0, e = OutputConstraintInfos.size(); i != e; ++i) {
534 SmallVector<size_t, 4> InputMatchedToOutput(OutputConstraintInfos.size(),
536 for (unsigned i = 0, e = InputConstraintInfos.size(); i != e; ++i) {
560 assert(TiedTo < InputMatchedToOutput.size() && "TiedTo value out of range");
tools/clang/lib/Sema/SemaTemplate.cpp 1849 NewParam->setScopeInfo(0, Params.size());
1850 FPTL.setParam(Params.size(), NewParam);
2750 for (unsigned TypeIdx = 0, NumTypes = NestedTypes.size(); TypeIdx != NumTypes;
3040 assert(Converted.size() == 2 &&
4090 for (unsigned I = 0, N = PartialSpecs.size(); I != N; ++I) {
4109 if (Matched.size() >= 1) {
4111 if (Matched.size() == 1) {
5239 if (*Expansions == ArgumentPack.size()) {
5265 ArgumentPack.size(), Converted))
5798 if (Notes.size() == 1 && Notes[0].second.getDiagID() ==
5806 for (unsigned I = 0, N = Notes.size(); I != N; ++I)
tools/clang/lib/Sema/SemaTemplateDeduction.cpp 733 for (unsigned I = 0, N = Unexpanded.size(); I != N; ++I) {
741 unsigned NumNamedPacks = Packs.size();
792 if (Info.PendingDeducedPacks.size() > Pack.Index)
845 while (Pack.New.size() < PackElements)
847 if (Pack.New.size() == PackElements)
851 DeducedArg = Pack.New.size() > PackElements + 1
894 new (S.Context) TemplateArgument[Pack.New.size()];
897 TemplateArgument(llvm::makeArrayRef(ArgumentPack, Pack.New.size())),
2553 if (ConvertArg(InnerArg, PackedArgsBuilder.size()))
3011 unsigned Index = Builder.size();
3038 auto *Param = TemplateParams->getParam(Builder.size() - 1);
3043 PartiallySubstitutedPackIndex = Builder.size() - 1;
3116 EPI.ExtParameterInfos = ExtParamInfos.getPointerOrNull(ParamTypes.size());
3394 for (unsigned I = 0, N = OriginalCallArgs->size(); I != N; ++I) {
3855 NumExplicitlySpecified = Deduced.size();
3882 for (unsigned ParamIdx = 0, NumParamTypes = ParamTypes.size(), ArgIdx = 0;
4051 NumExplicitlySpecified = Deduced.size();
4777 if (Args1.size() > NumComparedArguments)
4779 if (Args2.size() > NumComparedArguments)
4781 if (DeduceTemplateArguments(S, TemplateParams, Args2.data(), Args2.size(),
4782 Args1.data(), Args1.size(), Info, Deduced,
4816 unsigned ArgIdx = 0, NumArgs = Deduced.size();
4835 for (unsigned I = 0, N = Args2.size(); I != N; ++I)
tools/clang/lib/Sema/SemaTemplateInstantiate.cpp 407 assert(CodeSynthesisContexts.size() >=
408 CodeSynthesisContextLookupModules.size() &&
410 if (CodeSynthesisContexts.size() ==
411 CodeSynthesisContextLookupModules.size()) {
419 if (CodeSynthesisContexts.size() ==
446 SemaRef.CodeSynthesisContexts.size());
447 if ((SemaRef.CodeSynthesisContexts.size() -
465 unsigned SkipStart = CodeSynthesisContexts.size(), SkipEnd = SkipStart;
467 if (Limit && Limit < CodeSynthesisContexts.size()) {
469 SkipEnd = CodeSynthesisContexts.size() - Limit / 2;
485 << unsigned(CodeSynthesisContexts.size() - Limit);
2473 for (unsigned I = 0, N = PartialSpecs.size(); I != N; ++I) {
2515 for (unsigned I = 0, N = PartialSpecs.size(); I != N; ++I) {
2537 if (Matched.size() >= 1) {
2539 if (Matched.size() == 1) {
tools/clang/lib/Sema/SemaTemplateInstantiateDecl.cpp 1487 for (unsigned I = 0, N = PartialSpecs.size(); I != N; ++I)
1570 for (unsigned I = 0, N = PartialSpecs.size(); I != N; ++I)
1870 for (unsigned P = 0; P < Params.size(); ++P)
2236 for (unsigned P = 0; P < Params.size(); ++P)
3271 if (SemaRef.Subst(ArgLocs.data(), ArgLocs.size(),
tools/clang/lib/Sema/SemaTemplateVariadic.cpp 329 for (unsigned N = FunctionScopes.size(); N; --N) {
372 << (int)UPPC << (int)Names.size();
373 for (size_t I = 0, E = std::min(Names.size(), (size_t)2); I != E; ++I)
376 for (unsigned I = 0, N = Locations.size(); I != N; ++I)
691 NewPackSize = Instantiation->get<DeclArgumentPack *>()->size();
789 for (unsigned I = 0, N = Unexpanded.size(); I != N; ++I) {
812 unsigned Size = Instantiation->get<DeclArgumentPack *>()->size();
tools/clang/lib/Sema/SemaType.cpp 1019 if (!anyPackExpansions && finalTypeArgs.size() != numTypeParams) {
1023 << (unsigned)finalTypeArgs.size()
1213 assert(ObjCObjectTL.getNumTypeArgs() == ActualTypeArgInfos.size());
1216 for (unsigned i = 0, n = ActualTypeArgInfos.size(); i != n; ++i)
2986 const unsigned AutoParameterPosition = LSI->TemplateParams.size();
6385 if (I == Stack.size())
6399 if (I == Stack.size()) return QualType(Fn, 0);
tools/clang/lib/Sema/TreeTransform.h 5176 assert(Unexpanded.size() > 0 && "Could not find parameter packs!");
5208 PInfos.set(OutParamTypes.size(), ParamInfos[i]);
5227 PInfos.set(OutParamTypes.size(), ParamInfos[i]);
5259 PInfos.set(OutParamTypes.size(), ParamInfos[i]);
5308 PInfos.set(OutParamTypes.size(), ParamInfos[i]);
5327 PInfos.set(OutParamTypes.size(), ParamInfos[i]);
5351 PInfos.set(OutParamTypes.size(), ParamInfos[i]);
5359 for (unsigned i = 0, e = PVars->size(); i != e; ++i)
5444 ExtParamInfos.getPointerOrNull(ParamTypes.size())) {
5447 != llvm::makeArrayRef(NewExtParamInfos, ParamTypes.size())) {
7906 if (TClauses.size() != Clauses.size()) {
12118 Args.size(), None);
12320 Elements.size());
12754 epi.ExtParameterInfos = extParamInfos.getPointerOrNull(paramTypes.size());
tools/clang/lib/Sema/TypeLocBuilder.cpp 29 for (unsigned i = 0, e = TypeLocs.size(); i < e; ++i) {
tools/clang/lib/Serialization/ASTReader.cpp 637 for (unsigned I = 0, N = ExistingMacroNames.size(); I != N; ++I) {
1283 while (Idx < Record.size()) {
1764 if (NextIndex + 1 == Record.size() && PP.getPreprocessingRecord() &&
2142 for (int I = 2, N = Record.size(); I != N; ++I)
2183 unsigned Idx = 0, N = Record.size();
2414 if (ImportStack.size() > 1 && !Diags.isDiagnosticInFlight()) {
2417 for (unsigned I = 1; I < ImportStack.size(); ++I)
2777 unsigned Idx = 0, N = Record.size();
3217 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3225 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3231 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3236 if (SpecialTypes.size() != Record.size()) {
3236 if (SpecialTypes.size() != Record.size()) {
3241 for (unsigned I = 0, N = Record.size(); I != N; ++I) {
3258 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3263 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3268 if (Record.size() % 4 != 0) {
3278 for (unsigned I = 0, N = Record.size(); I < N; /* in loop */) {
3306 SelectorsLoaded.resize(SelectorsLoaded.size() + F.LocalNumSelectors);
3324 for (unsigned Idx = 0, N = Record.size() - 1; Idx < N; /* in loop */) {
3335 unsigned Idx = 0, End = Record.size() - 1;
3428 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3433 if (Record.size() % 3 != 0) {
3443 for (unsigned Idx = 0, N = Record.size(); Idx != N; /* In loop */) {
3452 if (PendingInstantiations.size() % 2 != 0) {
3457 if (Record.size() % 2 != 0) {
3462 for (unsigned I = 0, N = Record.size(); I != N; /* in loop */) {
3470 if (Record.size() != 3) {
3474 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3529 if (Record.size() % 2 != 0) {
3533 for (unsigned I = 0, N = Record.size(); I != N; I += 2) {
3563 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3591 for (unsigned I = 0, E = Record.size(); I != E; ) {
3602 for (unsigned I = 0, E = Record.size(); I != E;) {
3614 for (unsigned I = 0, E = Record.size(); I != E;) {
3626 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3631 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3636 if (UndefinedButUsed.size() % 2 != 0) {
3641 if (Record.size() % 2 != 0) {
3645 for (unsigned I = 0, N = Record.size(); I != N; /* in loop */) {
3653 for (unsigned I = 0, N = Record.size(); I != N;) {
3670 for (unsigned I = 0, N = Record.size(); I != N; /**/) {
3711 if (Record.size() != 1) {
3719 if (Record.size() != 1) {
3727 if (Record.size() != 2) {
3736 for (unsigned I = 0, N = Record.size(); I != N; ++I)
3742 if (Record.size() != 1) {
3750 if (Record.size() < 3) {
4232 for (unsigned I = 0, N = F.PreloadSLocEntries.size(); I != N; ++I) {
4309 for (unsigned I = 0, N = UnresolvedModuleRefs.size(); I != N; ++I) {
4370 for (unsigned I = 0, N = ObjCClassesLoaded.size(); I != N; ++I) {
4384 for (unsigned I = 0, N = Loaded.size(); I != N; ++I) {
4719 if (Record.size() < 4) return true;
4810 if (SpecialTypes.size() >= NumSpecialTypeIDs) {
4917 assert(CUDASpecialDeclRefs.size() == 1 && "More decl refs than expected!");
5276 unsigned Idx = 0, N = Record.size();
5434 if (Record.size() < 12) {
5468 if (GlobalIndex >= SubmodulesLoaded.size() ||
5590 SubmodulesLoaded.resize(SubmodulesLoaded.size() + F.LocalNumSubmodules);
5596 for (unsigned Idx = 0; Idx != Record.size(); ++Idx) {
5608 for (unsigned Idx = 0; Idx + 1 < Record.size(); Idx += 2) {
6182 assert(Idx + Size * 2 <= Record.size() &&
6219 assert(Idx < Record.size() &&
6253 assert(Idx < Record.size() &&
6266 F.StateTransitions.reserve(F.StateTransitions.size() + Transitions);
6276 assert(Idx < Record.size() &&
6350 if (Record.size() != 2) {
6360 if (Record.size() != 1) {
6369 if (Record.size() != 1) {
6378 if (Record.size() != 1) {
6390 if (Record.size() != 2) {
6400 if (Record.size() != 1) {
6409 if (Record.size() != 2) {
6418 if (Record.size() != 1) {
6427 if (Record.size() != 2) {
6469 if (Record.size() != 3) {
6482 if (Record.size() != 3) {
6493 if (Record.size() != 8) {
6531 if (Idx != Record.size()) {
6539 assert(Idx == Record.size());
6551 if (Record.size() != 2) {
6567 if (Record.size() != 1) {
6608 if (Record.size() != 2) {
6622 if (Record.size() != 2) {
6635 if (Record.size() != 3) {
6646 if (Record.size() != 1) {
6655 if (Record.size() != 2) {
6665 if (Record.size() != 2) {
6833 if (Record.size() != 1) {
6842 if (Record.size() != 2) {
7903 if (Idx >= Record.size()) {
8154 = SelectorsLoaded.size() - std::count(SelectorsLoaded.begin(),
8180 NumSelectorsLoaded, (unsigned)SelectorsLoaded.size(),
8181 ((float)NumSelectorsLoaded/SelectorsLoaded.size() * 100));
8298 assert(FPPragmaOptions.size() == 1 && "Wrong number of FP_PRAGMA_OPTIONS");
8315 assert(SemaDeclRefs.size() % 3 == 0);
8316 for (unsigned I = 0; I != SemaDeclRefs.size(); I += 3) {
8639 for (unsigned I = 0, N = KnownNamespaces.size(); I != N; ++I) {
8648 for (unsigned Idx = 0, N = UndefinedButUsed.size(); Idx != N;) {
8659 for (unsigned Idx = 0, N = DelayedDeleteExprs.size(); Idx != N;) {
8673 for (unsigned I = 0, N = TentativeDefinitions.size(); I != N; ++I) {
8683 for (unsigned I = 0, N = UnusedFileScopedDecls.size(); I != N; ++I) {
8694 for (unsigned I = 0, N = DelegatingCtorDecls.size(); I != N; ++I) {
8704 for (unsigned I = 0, N = ExtVectorDecls.size(); I != N; ++I) {
8715 for (unsigned I = 0, N = UnusedLocalTypedefNameCandidates.size(); I != N;
8732 unsigned int DataSize = ReferencedSelectorsData.size()-1;
8748 for (unsigned I = 0, N = WeakUndeclaredIdentifiers.size(); I < N; /*none*/) {
8764 for (unsigned Idx = 0, N = VTableUses.size(); Idx < N; /* In loop */) {
8777 for (unsigned Idx = 0, N = PendingInstantiations.size(); Idx < N;) {
8790 for (unsigned Idx = 0, N = LateParsedTemplates.size(); Idx < N;
8849 for (unsigned I = 0, N = DeclIDs.size(); I != N; ++I) {
8989 if (GlobalID > SubmodulesLoaded.size()) {
9069 if (ID > SelectorsLoaded.size()) {
9875 for (unsigned I = 0; I != PendingFunctionTypes.size(); ++I) {
9890 for (unsigned I = 0; I != PendingIncompleteDeclChains.size(); ++I) {
9896 for (unsigned I = 0; I != PendingDeclChains.size(); ++I)
9905 for (unsigned I = 0, N = TLD->second.size(); I != N; ++I) {
9916 for (unsigned IDIdx = 0, NumIDs = GlobalIDs.size(); IDIdx != NumIDs;
9923 for (unsigned IDIdx = 0, NumIDs = GlobalIDs.size(); IDIdx != NumIDs;
10183 for (unsigned I = 0, N = Candidates.size(); I != N; ++I)
10398 assert(FirstTemplateHashes.size() == SecondTemplateHashes.size() &&
10398 assert(FirstTemplateHashes.size() == SecondTemplateHashes.size() &&
11227 if (FirstExpandedList.size() != SecondExpandedList.size()) {
11227 if (FirstExpandedList.size() != SecondExpandedList.size()) {
11232 << (unsigned)FirstExpandedList.size();
11237 << (unsigned)SecondExpandedList.size();
11244 for (unsigned i = 0, e = FirstExpandedList.size(); i != e; ++i) {
12063 if (FirstHashes.size() != SecondHashes.size()) {
12063 if (FirstHashes.size() != SecondHashes.size()) {
12066 << (int)FirstHashes.size();
12069 << (int)SecondHashes.size();
12074 for (unsigned I = 0; I < FirstHashes.size(); ++I) {
tools/clang/lib/Serialization/ASTReaderDecl.cpp 280 auto *Result = new (C) serialization::DeclID[1 + IDs.size()];
281 *Result = IDs.size();
932 for (unsigned i = 0, e = TemplArgLocs.size(); i != e; ++i)
3257 if (Index < Previous.size() && Previous[Index])
3265 if (Previous.size() == Number)
3272 return Index < Previous.size() ? Previous[Index] : nullptr;
3281 if (Index >= Previous.size())
4091 for (unsigned I = 0, N = Record.size(); I != N; ++I) {
4524 assert(Attrs.size() == 1);
tools/clang/lib/Serialization/ASTReaderInternals.h 64 if (Data.size() <= 4) {
111 To.Data.reserve(To.Data.size() + From.size());
111 To.Data.reserve(To.Data.size() + From.size());
tools/clang/lib/Serialization/ASTReaderStmt.cpp 213 assert(NumAttrs == Attrs.size());
357 Decls.size())));
1012 Designators.data(), Designators.size());
2445 unsigned PrevNumStmts = StmtStack.size();
3559 assert(StmtStack.size() > PrevNumStmts && "Read too many sub-stmts!");
3560 assert(StmtStack.size() == PrevNumStmts + 1 && "Extra expressions on stack!");
tools/clang/lib/Serialization/ASTWriter.cpp 128 sizeof(T) * v.size());
2067 Offset = FrameworkStringData.size() + 1;
2169 if (FilesByUID.size() > HS.header_file_size())
2172 for (unsigned UID = 0, LastUID = FilesByUID.size(); UID != LastUID; ++UID) {
2233 NumHeaderSearchEntries, TableData.size()};
2238 for (unsigned I = 0, N = SavedStrings.size(); I != N; ++I)
2340 Record.push_back(FDI->second->DeclIDs.size());
2777 assert(PreprocessedEntityOffsets.size() == NumPreprocessingRecords);
3135 auto SizeIdx = Record.size();
3144 Record[SizeIdx] = (Record.size() - SizeIdx) / 2;
3151 auto NumLocationsIdx = Record.size();
3166 Record.push_back(FileIDAndFile.second.StateTransitions.size());
3289 Info.FirstDeclIndex = FileGroupedDeclIDs.size();
3300 FileGroupedDeclIDs.size()};
3887 unsigned Start = DeclIDs.size();
3892 return std::make_pair(Start, DeclIDs.size());
3896 unsigned Start = DeclIDs.size();
3899 return std::make_pair(Start, DeclIDs.size());
4409 unsigned StartIndex = Categories.size();
4446 RecordData::value_type Record[] = {OBJC_CATEGORIES_MAP, CategoriesMap.size()};
4449 CategoriesMap.size() * sizeof(ObjCCategoriesInfo));
4467 Record.push_back(LPT.Toks.size());
4510 Record.push_back(SemaRef.PackStack.Stack.size());
4725 StringRef(Buffer.begin(), Buffer.size())));
4823 for (unsigned I = 0, N = SemaRef.VTableUses.size(); I != N; ++I) {
4882 DeleteExprsToAnalyze.push_back(DeleteExprsInfo.second.size());
5074 Buffer.data(), Buffer.size());
5880 Record->push_back(NestedNames.size());
5927 Record->push_back(NestedNames.size());
tools/clang/lib/Serialization/ASTWriterStmt.cpp 2444 for (unsigned I = 0, N = StmtsToEmit.size(); I != N; ++I) {
2447 assert(N == StmtsToEmit.size() && "record modified while being written!");
2465 for (unsigned I = 0, N = StmtsToEmit.size(); I != N; ++I) {
2467 assert(N == StmtsToEmit.size() && "record modified while being written!");
tools/clang/lib/Serialization/GlobalModuleIndex.cpp 189 if (Record.size() < 1 || Record[0] != CurrentVersion)
198 if (ID == Modules.size())
222 assert(Idx == Record.size() && "More module info?");
286 for (unsigned I = 0, N = Modules.size(); I != N; ++I) {
327 for (unsigned I = 0, N = ModuleIDs.size(); I != N; ++I) {
629 unsigned Idx = 0, N = Record.size();
738 unsigned DataLen = Data.size() * 4;
751 for (unsigned I = 0, N = Data.size(); I != N; ++I)
807 Record.push_back(M->second.Dependencies.size());
918 llvm::StringRef(OutputBuffer.data(), OutputBuffer.size()));
tools/clang/lib/Serialization/ModuleManager.cpp 148 NewModule->Index = Chain.size();
333 if (VisitOrder.size() != Chain.size()) {
333 if (VisitOrder.size() != Chain.size()) {
373 assert(VisitOrder.size() == N && "Visitation order is wrong?");
386 for (unsigned I = 0, N = ModulesInCommonWithGlobalIndex.size(); I != N; ++I)
394 for (unsigned I = 0, N = VisitOrder.size(); I != N; ++I) {
tools/clang/lib/StaticAnalyzer/Checkers/CallAndMessageChecker.cpp 281 if (F.FieldChain.size() == 1)
tools/clang/lib/StaticAnalyzer/Checkers/CloneChecker.cpp 121 for (unsigned i = 1; i < Group.size(); ++i)
134 for (unsigned i = 0; i < Group.size(); ++i) {
137 for (unsigned j = i + 1; j < Group.size(); ++j) {
tools/clang/lib/StaticAnalyzer/Checkers/DebugCheckers.cpp 280 for (unsigned I = 0, E = Keys.size(); I != E; ++I)
285 llvm::errs() << "[stats]\n" << "num-entries = " << Keys.size() << '\n';
tools/clang/lib/StaticAnalyzer/Checkers/LLVMConventionsChecker.cpp 264 if (FieldChain.size() > 1) {
tools/clang/lib/StaticAnalyzer/Core/PlistDiagnostics.cpp 1239 std::advance(It, SuperExpArgTokens.size());
tools/clang/lib/StaticAnalyzer/Core/RegionStore.cpp 846 ptrdiff_t Delta = FieldsInBindingKey.size() - Fields.size();
846 ptrdiff_t Delta = FieldsInBindingKey.size() - Fields.size();
1618 if (Bindings.size() > 1)
2347 if (Fields.size() == SmallStructLimit)
tools/clang/lib/StaticAnalyzer/Core/WorkList.cpp 170 MaxQueueSize.updateMax(StackUnexplored.size() + StackOthers.size());
170 MaxQueueSize.updateMax(StackUnexplored.size() + StackOthers.size());
tools/clang/lib/Tooling/ASTDiff/ASTDiff.cpp 344 for (size_t I = 0, E = Siblings.size(); I < E; ++I) {
761 if (N1.Children.size() != N2.Children.size() ||
761 if (N1.Children.size() != N2.Children.size() ||
765 for (size_t Id = 0, E = N1.Children.size(); Id < E; ++Id)
tools/clang/lib/Tooling/Core/Lookup.cpp 60 if (UseNamespaces.size() < FromNamespaces.size())
60 if (UseNamespaces.size() < FromNamespaces.size())
62 unsigned Diff = UseNamespaces.size() - FromNamespaces.size();
62 unsigned Diff = UseNamespaces.size() - FromNamespaces.size();
tools/clang/lib/Tooling/DependencyScanning/DependencyScanningFilesystem.cpp 55 size_t Size = MinimizedFileContents.size();
61 assert(MinimizedFileContents.data()[MinimizedFileContents.size()] == '\0' &&
tools/clang/lib/Tooling/Inclusions/HeaderIncludes.cpp 192 for (unsigned i = 0, e = CategoryRegexs.size(); i != e; ++i)
205 for (unsigned i = 0, e = CategoryRegexs.size(); i != e; ++i)
tools/clang/lib/Tooling/Refactoring/ASTSelection.cpp 293 const Stmt *Parent = Parents[Parents.size() - 1].get().Node.get<Stmt>();
299 for (; (ParentIndex + 1) <= Parents.size() && isa<ImplicitCastExpr>(Parent);
302 Parents[Parents.size() - ParentIndex - 1].get().Node.get<Stmt>();
310 Node = Parents[Parents.size() - ParentIndex];
390 if (ContainSelection.size() != 1)
tools/clang/lib/Tooling/Refactoring/Rename/USRFinder.cpp 141 return std::string(Buff.data(), Buff.size());
tools/clang/lib/Tooling/Tooling.cpp 108 assert(Actions.size() > 1);
tools/clang/lib/Tooling/Transformer/RewriteRule.cpp 91 Matchers.reserve(Cases.size());
122 for (int I = 0, N = Cases.size(); I < N; ++I) {
166 if (Rule.Cases.size() == 1)
170 for (size_t i = 0, N = Rule.Cases.size(); i < N; ++i) {
tools/clang/tools/arcmt-test/arcmt-test.cpp 258 if (strs.size() % 2 != 0) {
263 for (unsigned i = 0, e = strs.size(); i != e; i += 2) {
tools/clang/tools/clang-diff/ClangDiff.cpp 378 if (N.Children.size() > 0) {
380 for (size_t I = 1, E = N.Children.size(); I < E; ++I) {
tools/clang/tools/clang-offload-wrapper/ClangOffloadWrapper.cpp 225 ArrayType::get(getDeviceImageTy(), ImagesInits.size()), ImagesInits);
239 ConstantInt::get(Type::getInt32Ty(C), ImagesInits.size()), ImagesB,
361 makeArrayRef(Images.data(), Images.size())),
tools/clang/tools/clang-refactor/ClangRefactor.cpp 565 if (MatchingRules.size() != 1) {
tools/clang/tools/clang-refactor/TestSupport.cpp 145 TestRanges.GroupedRanges[GroupIndex].Ranges.size()) {
244 llvm::outs() << TestGroup.Ranges.size() << " '" << TestGroup.Name
248 llvm::outs() << TestGroup.Ranges.size() << " '" << TestGroup.Name
tools/clang/tools/driver/driver.cpp 124 for (unsigned i = 1, e = Args.size(); i != e; ++i) {
137 for (unsigned i = 1; i < Args.size();) {
142 if (i < Args.size()) {
152 for (unsigned i = 1; i < Args.size();) {
216 if (ArgVector.size() > 0)
368 if (MarkEOLs && argv.size() > 1 && StringRef(argv[1]).startswith("-cc1"))
386 for (int i = 1, size = argv.size(); i < size; ++i) {
tools/clang/tools/extra/clang-change-namespace/ChangeNamespace.cpp 128 auto End = Loc.getLocWithOffset(Line.size());
297 if (SymbolSplitted.size() >= 1 && !Namespace.empty()) {
tools/clang/tools/extra/clang-doc/BitcodeWriter.cpp 334 assert(Loc.Filename.size() < (1U << BitCodeConstants::StringLengthSize));
336 Record.push_back(Loc.Filename.size());
tools/clang/tools/extra/clang-doc/MDGenerator.cpp 89 if (I.AttrKeys.size() != I.AttrValues.size())
89 if (I.AttrKeys.size() != I.AttrValues.size())
93 for (unsigned Idx = 0; Idx < I.AttrKeys.size(); ++Idx)
tools/clang/tools/extra/clang-doc/Representation.cpp 253 for (unsigned I = 0; I < Name.size() && I < Other.Name.size(); ++I) {
253 for (unsigned I = 0; I < Name.size() && I < Other.Name.size(); ++I) {
264 if (Name.size() == Other.Name.size())
264 if (Name.size() == Other.Name.size())
267 return Name.size() < Other.Name.size();
267 return Name.size() < Other.Name.size();
tools/clang/tools/extra/clang-include-fixer/YamlSymbolIndex.cpp 40 assert(Directory.size() <= PathStorage.size());
tools/clang/tools/extra/clang-include-fixer/tool/ClangIncludeFixer.cpp 179 for (size_t I = 0, E = CommaSplits.size(); I != E; ++I)
tools/clang/tools/extra/clang-move/Move.cpp 301 SourceLocation EndLoc = EndExpansionLoc.getLocWithOffset(Line.size());
696 HeaderWithSearchPath.size()));
tools/clang/tools/extra/clang-reorder-fields/ReorderFieldsAction.cpp 45 if (Results.size() > 1) {
77 assert(NewFieldsOrder.size() == NameToIndex.size());
209 assert(OldWrittenInitializersOrder.size() ==
210 NewWrittenInitializersOrder.size());
211 for (unsigned i = 0, e = NewWrittenInitializersOrder.size(); i < e; ++i)
tools/clang/tools/extra/clang-tidy/bugprone/BranchCloneCheck.cpp 40 if (LHS.size() != RHS.size())
40 if (LHS.size() != RHS.size())
43 for (size_t i = 0, Size = LHS.size(); i < Size; i++) {
112 size_t N = Branches.size();
tools/clang/tools/extra/clang-tidy/bugprone/ParentVirtualCallCheck.cpp 128 ParentsStr.reserve(30 * Parents.size());
140 << (Parents.size() > 1 ? "es" : "") << ParentsStr;
143 if (Parents.size() == 1 &&
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/NarrowingConversionsCheck.cpp 170 for (size_t I = HexValue.size(); I < (HexBits / 4); ++I)
tools/clang/tools/extra/clang-tidy/cppcoreguidelines/ProTypeMemberInitCheck.cpp 182 if (Insertions.size() == 1)
tools/clang/tools/extra/clang-tidy/modernize/AvoidBindCheck.cpp 157 if (F->getNumParams() != Args.size())
tools/clang/tools/extra/clang-tidy/modernize/ConcatNestedNamespacesCheck.cpp 104 if (!alreadyConcatenated(Namespaces.size(), FrontReplacement, Sources,
tools/clang/tools/extra/clang-tidy/modernize/LoopConvertCheck.cpp 528 bool VarNameFromAlias = (Usages.size() == 1) && AliasDecl;
tools/clang/tools/extra/clang-tidy/modernize/UseOverrideCheck.cpp 187 if (Tokens.size() > 2 &&
191 GetText(Tokens[Tokens.size() - 2], Sources) == "=") {
192 InsertLoc = Tokens[Tokens.size() - 2].getLocation();
194 if ((Tokens[Tokens.size() - 2].getFlags() & Token::LeadingSpace) == 0)
tools/clang/tools/extra/clang-tidy/modernize/UseTrailingReturnTypeCheck.cpp 289 for (size_t I = 0; I < Tokens.size(); I++) {
304 for (size_t J = I; J < Tokens.size() && Tokens[J].isQualifier; J++)
tools/clang/tools/extra/clang-tidy/readability/InconsistentDeclarationParameterNameCheck.cpp 250 << static_cast<int>(InconsistentDeclarations.size());
tools/clang/tools/extra/clang-tidy/readability/NamespaceCommentCheck.cpp 143 StringRef NamespaceNameInComment = Groups.size() > 5 ? Groups[5] : "";
144 StringRef Anonymous = Groups.size() > 3 ? Groups[3] : "";
tools/clang/tools/extra/clang-tidy/utils/ExceptionAnalyzer.cpp 70 return TypesToDelete.size() > 0;
tools/clang/tools/extra/clang-tidy/utils/IncludeSorter.cpp 103 if (IncludeLocations[FileName].size() > 1)
tools/clang/tools/extra/clangd/AST.cpp 224 auto MinLength = std::min(CurrentParts.size(), OriginalParts.size());
224 auto MinLength = std::min(CurrentParts.size(), OriginalParts.size());
232 for (unsigned i = DifferentAt; i < OriginalParts.size(); ++i) {
tools/clang/tools/extra/clangd/CodeComplete.cpp 387 Completion.BundleSize = Bundled.size();
tools/clang/tools/extra/clangd/FileDistance.cpp 182 return {"/" + llvm::join(Split, "/"), Split.size()};
tools/clang/tools/extra/clangd/Selection.cpp 507 while (Ancestor->Children.size() == 1 && !Ancestor->Selected)
529 if (Children.size() == 1 &&
tools/clang/tools/extra/clangd/SemanticHighlighting.cpp 315 for (I = 0; I + 2 < Bytes.size(); I += 3) {
322 if (I + 1 == Bytes.size()) {
327 } else if (I + 2 == Bytes.size()) {
tools/clang/tools/extra/clangd/SourceCode.cpp 954 if (Word.size() >= MinWordLength) {
tools/clang/tools/extra/clangd/index/FileIndex.cpp 197 llvm::ArrayRef<Ref>(&RefsStorage[RefsStorage.size() - SymRefs.size()],
198 SymRefs.size()));
tools/clang/tools/extra/clangd/index/Serialization.cpp 306 writeVar(Sym.IncludeHeaders.size(), OS);
tools/clang/tools/extra/clangd/refactor/tweaks/ExtractFunction.cpp 258 if (ExtZone.Parent->Children.size() == 1 &&
tools/clang/tools/extra/clangd/refactor/tweaks/ExtractVariable.cpp 281 Op.crossesMacroBoundary(SM) || Op.SelectedOperands.size() != 2)
296 if (Op.SelectedOperands.size() == 1) { // Only Op.RHS selected
tools/clang/tools/extra/clangd/unittests/ClangdTests.cpp 122 assert(Matches.size() == 1 && "Exactly one match expected");
tools/clang/tools/extra/clangd/unittests/CodeCompleteTests.cpp 2184 EXPECT_EQ(Results[0].Includes.size(), 2u);
tools/clang/tools/extra/clangd/unittests/DiagnosticsTests.cpp 59 return arg.Message == Message && arg.Edits.size() == 1 &&
85 if (arg.Edits.size() != Fix.Edits.size())
85 if (arg.Edits.size() != Fix.Edits.size())
87 for (std::size_t I = 0; I < arg.Edits.size(); ++I) {
tools/clang/tools/extra/clangd/unittests/SymbolCollectorTests.cpp 66 return (arg.IncludeHeaders.size() == 1) &&
tools/clang/tools/extra/clangd/unittests/TestTU.cpp 152 if (Visitor.Decls.size() != 1) {
153 ADD_FAILURE() << Visitor.Decls.size() << " symbols matched.";
154 assert(Visitor.Decls.size() == 1);
tools/clang/tools/extra/modularize/CoverageChecker.cpp 242 if (Directory.size() == 0)
306 HeaderName = HeaderName.substr(PathBuf.size() + 1);
357 if (Directory.size() == 0)
tools/clang/tools/extra/modularize/Modularize.cpp 361 if (int Count = FileDependents.size()) {
496 for (unsigned I = 0, N = Entries.size(); I != N; ++I) {
926 if (E->second.size() == 1)
935 for (unsigned I = 0, N = E->second.size(); I != N; ++I) {
942 int ECount = DI->size();
tools/clang/tools/extra/modularize/ModularizeUtilities.cpp 170 if (HeaderDirectory.size() != 0)
181 int Count = DependentsList.size();
187 if (HeaderDirectory.size() != 0)
242 if (HeaderDirectory.size() != 0)
362 if (Mod.Headers->size() == 0) {
374 int NormalHeaderCount = Mod.Headers[clang::Module::HK_Normal].size();
385 int MissingCountThisModule = Mod.MissingHeaders.size();
488 if (Directory.size() == 0)
tools/clang/tools/extra/modularize/ModuleAssistant.cpp 179 FilePath = NativePath.substr(NativePrefix.size() + 1);
182 int Count = FileDependents.size();
259 if ((HeaderDirectory.size() == 0) && (HeaderPrefix.size() != 0)) {
tools/clang/tools/extra/unittests/clang-doc/ClangDocTest.cpp 47 ASSERT_EQ(Expected.AttrKeys.size(), Actual.AttrKeys.size());
47 ASSERT_EQ(Expected.AttrKeys.size(), Actual.AttrKeys.size());
48 for (size_t Idx = 0; Idx < Actual.AttrKeys.size(); ++Idx)
51 ASSERT_EQ(Expected.AttrValues.size(), Actual.AttrValues.size());
51 ASSERT_EQ(Expected.AttrValues.size(), Actual.AttrValues.size());
52 for (size_t Idx = 0; Idx < Actual.AttrValues.size(); ++Idx)
55 ASSERT_EQ(Expected.Args.size(), Actual.Args.size());
55 ASSERT_EQ(Expected.Args.size(), Actual.Args.size());
56 for (size_t Idx = 0; Idx < Actual.Args.size(); ++Idx)
88 ASSERT_EQ(Expected->Namespace.size(), Actual->Namespace.size());
88 ASSERT_EQ(Expected->Namespace.size(), Actual->Namespace.size());
89 for (size_t Idx = 0; Idx < Actual->Namespace.size(); ++Idx)
103 ASSERT_EQ(Expected->Loc.size(), Actual->Loc.size());
103 ASSERT_EQ(Expected->Loc.size(), Actual->Loc.size());
104 for (size_t Idx = 0; Idx < Actual->Loc.size(); ++Idx)
115 ASSERT_EQ(Expected->Params.size(), Actual->Params.size());
115 ASSERT_EQ(Expected->Params.size(), Actual->Params.size());
116 for (size_t Idx = 0; Idx < Actual->Params.size(); ++Idx)
126 ASSERT_EQ(Expected->Members.size(), Actual->Members.size());
126 ASSERT_EQ(Expected->Members.size(), Actual->Members.size());
127 for (size_t Idx = 0; Idx < Actual->Members.size(); ++Idx)
160 ASSERT_EQ(Expected->Members.size(), Actual->Members.size());
160 ASSERT_EQ(Expected->Members.size(), Actual->Members.size());
161 for (size_t Idx = 0; Idx < Actual->Members.size(); ++Idx)
164 ASSERT_EQ(Expected->Parents.size(), Actual->Parents.size());
164 ASSERT_EQ(Expected->Parents.size(), Actual->Parents.size());
165 for (size_t Idx = 0; Idx < Actual->Parents.size(); ++Idx)
168 ASSERT_EQ(Expected->VirtualParents.size(), Actual->VirtualParents.size());
168 ASSERT_EQ(Expected->VirtualParents.size(), Actual->VirtualParents.size());
169 for (size_t Idx = 0; Idx < Actual->VirtualParents.size(); ++Idx)
tools/clang/tools/extra/unittests/clang-tidy/ClangTidyTest.h 44 "test-check-" + std::to_string(Result.size()), Context));
tools/clang/tools/libclang/CIndex.cpp 868 for (unsigned I = 0, N = WrittenInits.size(); I != N; ++I) {
2128 unsigned size = WL.size();
2132 if (size == WL.size())
2453 unsigned size = WL.size();
2456 if (size == WL.size())
2575 unsigned size = WL.size();
2581 if (size == WL.size())
3590 CIdx, source_filename, Args.data(), Args.size(), unsaved_files,
3831 std::string floatStr(Buffer.data(), Buffer.size());
6594 } else if (PieceIndex < Pieces.size()) {
6842 llvm::safe_malloc(sizeof(CXToken) * CXTokens.size()));
6843 memmove(*Tokens, CXTokens.data(), sizeof(CXToken) * CXTokens.size());
6844 *NumTokens = CXTokens.size();
7967 return AvailabilityAttrs.size();
tools/clang/tools/libclang/CIndexCodeCompletion.cpp 377 for (unsigned I = 0, N = TemporaryBuffers.size(); I != N; ++I)
579 StoredResults.reserve(StoredResults.size() + NumResults);
660 StoredResults.reserve(StoredResults.size() + NumCandidates);
682 AllocatedResults.Results = new CXCompletionResult [StoredResults.size()];
683 AllocatedResults.NumResults = StoredResults.size();
685 StoredResults.size() * sizeof(CXCompletionResult));
767 Results->DiagnosticsWrappers.resize(Results->Diagnostics.size());
906 return Results->Diagnostics.size();
914 if (!Results || Index >= Results->Diagnostics.size())
tools/clang/tools/libclang/CIndexInclusionStack.cpp 65 InclusionStack.data(), InclusionStack.size(), clientData);
tools/clang/tools/libclang/CXCursor.cpp 1529 if (Vec->size() == 1) {
1535 assert(Vec->size() > 1);
1537 *num_overridden = Vec->size() - 1;
tools/clang/tools/libclang/CXIndexDataConsumer.cpp 257 for (unsigned i = 0, e = ProtInfos.size(); i != e; ++i)
260 for (unsigned i = 0, e = ProtInfos.size(); i != e; ++i)
304 for (unsigned i = 0, e = IBCollAttrs.size(); i != e; ++i) {
327 for (unsigned i = 0, e = Attrs.size(); i != e; ++i)
364 for (unsigned i = 0, e = BaseInfos.size(); i != e; ++i) {
369 for (unsigned i = 0, e = BaseInfos.size(); i != e; ++i)
tools/clang/tools/libclang/CXIndexDataConsumer.h 260 unsigned getNumAttrs() const { return (unsigned)CXAttrs.size(); }
305 (unsigned)Prots.size() };
322 unsigned getNumBases() const { return (unsigned)CXBases.size(); }
tools/clang/tools/libclang/Indexing.cpp 879 index_options, source_filename, Args.data(), Args.size(), unsaved_files,
tools/clang/unittests/AST/ASTImporterFixtures.cpp 163 assert(FoundDecls.size() == 1);
tools/clang/unittests/AST/ASTImporterTest.cpp 82 if (FoundNodes.size() != 1)
224 EXPECT_TRUE(FoundDecl.size() == 1);
235 EXPECT_TRUE(FoundDecl.size() == 1);
260 ASSERT_EQ(Redecls.size(), 1u);
272 ASSERT_EQ(Redecls.size(), 3u);
4037 ASSERT_EQ(1u, L.getAsVector()->size());
4314 EXPECT_EQ(FoundDecls.size(), 0u);
4318 EXPECT_EQ(FoundDecls.size(), 0u);
4350 EXPECT_EQ(FoundDecls.size(), 0u);
4354 EXPECT_EQ(FoundDecls.size(), 0u);
4665 EXPECT_EQ(FoundDecls.size(), 1u);
4674 EXPECT_EQ(FoundDecls.size(), 1u);
4750 EXPECT_EQ(FoundDecls.size(), 1u);
4754 EXPECT_EQ(FoundDecls.size(), 1u);
tools/clang/unittests/AST/ASTTraverserTest.cpp 92 EXPECT_EQ(Result.size(), 1u);
216 EXPECT_EQ(Result.size(), 1u);
tools/clang/unittests/AST/DeclTest.cpp 85 ASSERT_TRUE(Decls.size() == 1);
tools/clang/unittests/Analysis/CloneDetectionTest.cpp 77 ASSERT_EQ(CloneGroups.front().size(), 2u);
94 ASSERT_EQ(CloneGroups.front().size(), 4u);
tools/clang/unittests/CodeGen/IRMatchers.h 87 size_t size() const { return MatchStack.size(); }
96 assert(MatchStack.size() > Offset);
97 return MatchStack[MatchStack.size() - 1 - Offset];
259 if (OperandMatchers.size() > I->getNumOperands())
261 for (unsigned N = 0, E = OperandMatchers.size(); N != E; ++N) {
339 if (MT->getNumOperands() != Operands.size())
tools/clang/unittests/Lex/DependencyDirectivesSourceMinimizerTest.cpp 35 ASSERT_EQ(1u, Tokens.size());
41 ASSERT_EQ(1u, Tokens.size());
94 ASSERT_EQ(2u, Tokens.size());
584 ASSERT_EQ(Tokens.size(), 3u);
678 ASSERT_EQ(Tokens.size(), 12u);
695 EXPECT_EQ(Ranges.size(), 1u);
716 EXPECT_EQ(Ranges.size(), 4u);
tools/clang/unittests/Serialization/InMemoryModuleCacheTest.cpp 21 return MemoryBuffer::getMemBuffer(StringRef(Bytes.data(), Bytes.size()), "",
tools/clang/unittests/StaticAnalyzer/Reusables.h 26 assert(Matches.size() <= 1 && "Ambiguous match!");
27 assert(Matches.size() >= 1 && "Match not found!");
tools/clang/unittests/Tooling/DiagnosticsYamlTest.cpp 163 EXPECT_EQ(2u, D3.Notes.size());
tools/clang/unittests/Tooling/RangeSelectorTest.cpp 51 assert(Matches.size() != 0 && "no matches found");
52 assert(Matches.size() == 1 && "too many matches");
tools/clang/unittests/Tooling/SourceCodeBuildersTest.cpp 62 if (Matches.size() != 1) {
63 ADD_FAILURE() << "Wrong number of matches: " << Matches.size();
tools/clang/unittests/Tooling/StencilTest.cpp 66 if (Matches.size() != 1) {
67 ADD_FAILURE() << "Wrong number of matches: " << Matches.size();
tools/dsymutil/DwarfLinker.cpp 2516 unsigned BaseLength = Path.size();
tools/dsymutil/DwarfStreamer.cpp 482 LineSectionSize += EncodingBuffer.size();
563 LineSectionSize += EncodingBuffer.size();
582 LineSectionSize += EncodingBuffer.size();
594 LineSectionSize += EncodingBuffer.size();
tools/dsymutil/MachOUtils.cpp 80 if (ArchFiles.size() == 1) {
291 for (unsigned int i = 0, n = Layout.getSectionOrder().size(); i != n; ++i) {
427 for (unsigned int i = 0, n = Layout.getSectionOrder().size(); i != n; ++i) {
tools/llc/llc.cpp 611 if (Buffer.size() != CompileTwiceBuffer.size() ||
611 if (Buffer.size() != CompileTwiceBuffer.size() ||
612 (memcmp(Buffer.data(), CompileTwiceBuffer.data(), Buffer.size()) !=
tools/lld/COFF/DriverUtils.cpp 827 if (args.hasArg(OPT_verbose) && argv.size() != expandedArgv.size()) {
tools/lld/COFF/LTO.cpp 200 ret.emplace_back(buf[i].data(), buf[i].size());
tools/lld/COFF/PDB.cpp 502 assert(precomp.getTypesCount() <= precompIndexMap.tpiMap.size());
674 assert(refs.size() == 1);
687 assert(indices.size() == 2);
tools/lld/COFF/Writer.cpp 150 return sizeof(codeview::DebugInfo) + config->pdbAltPath.size() + 1;
161 memcpy(p, config->pdbAltPath.data(), config->pdbAltPath.size());
162 p[config->pdbAltPath.size()] = '\0';
tools/lld/ELF/Driver.cpp 735 if (fields.size() != 3 || !to_integer(fields[2], count)) {
tools/lld/ELF/DriverUtils.cpp 101 for (size_t i = 0, e = args.size(); i != e; ++i) {
tools/lld/ELF/OutputSections.cpp 279 size = sizeof(Elf_Chdr) + compressedData.size();
306 compressedData.size());
tools/lld/ELF/SyntheticSections.cpp 1676 size_t oldSize = relocData.size();
1858 if (relocData.size() < oldSize)
1859 relocData.append(oldSize - relocData.size(), 0);
1866 return relocData.size() != oldSize;
tools/lld/ELF/SyntheticSections.h 531 size_t getSize() const override { return relocData.size(); }
533 memcpy(buf, relocData.data(), relocData.size());
tools/lld/lib/ReaderWriter/MachO/MachOLinkingContext.cpp 56 if (parts.size() > 1) {
64 if (parts.size() > 2) {
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileFromAtoms.cpp 894 fullPath = file.ownedAllocations.Allocate<char>(pathBuf.size() + 1);
895 memcpy(fullPath, pathBuf.c_str(), pathBuf.size() + 1);
tools/lld/wasm/LTO.cpp 158 ret.emplace_back(buf[i].data(), buf[i].size());
tools/lld/wasm/SyntheticSections.cpp 554 writeUleb128(os, field.second.size(), "number of entries");
566 writeUleb128(os, emitted.size(), "feature count");
tools/lld/wasm/WriterUtils.cpp 42 if (s.size() != 1)
110 writeUleb128(os, sig.Params.size(), "param Count");
114 writeUleb128(os, sig.Returns.size(), "result Count");
115 if (sig.Returns.size()) {
tools/lldb/include/lldb/Core/StreamBuffer.h 40 size_t GetSize() const { return m_packet.size(); }
tools/lldb/include/lldb/Symbol/ClangASTContext.h 272 return args.size() == names.size() &&
272 return args.size() == names.size() &&
tools/lldb/include/lldb/Utility/RangeMap.h 144 if (idx < m_entries.size()) {
152 if (m_entries.size() > 1)
173 if (m_entries.size() > 1) {
241 size_t GetSize() const { return m_entries.size(); }
244 return ((i < m_entries.size()) ? &m_entries[i] : nullptr);
638 if (m_entries.size() > 1)
696 size_t GetSize() const { return m_entries.size(); }
699 return ((i < m_entries.size()) ? &m_entries[i] : nullptr);
703 return ((i < m_entries.size()) ? &m_entries[i] : nullptr);
885 size_t GetSize() const { return m_entries.size(); }
888 return ((i < m_entries.size()) ? &m_entries[i] : nullptr);
tools/lldb/source/API/SBFileSpec.cpp 110 return std::min(dst_len - 1, result.size());
tools/lldb/source/Breakpoint/BreakpointResolver.cpp 210 while (all_scs.size()) {
tools/lldb/source/Commands/CommandCompletions.cpp 97 if (CompletionBuffer.size() >= PATH_MAX)
157 size_t FullPrefixLen = CompletionBuffer.size();
tools/lldb/source/Core/DumpDataExtractor.cpp 584 s->Printf("%*.*s", (int)sv.size(), (int)sv.size(), sv.data());
584 s->Printf("%*.*s", (int)sv.size(), (int)sv.size(), sv.data());
tools/lldb/source/Core/ValueObject.cpp 240 old_checksum.resize(m_value_checksum.size());
269 m_value_checksum.size()));
tools/lldb/source/Host/common/FileSystem.cpp 248 Resolver.ResolveFullPath(llvm::StringRef(path.begin(), path.size()),
tools/lldb/source/Host/common/HostInfoBase.cpp 287 file_spec = FileSpec(std::string(tmpdir.data(), tmpdir.size()));
tools/lldb/source/Host/common/NativeProcessProtocol.cpp 397 ReadMemory(addr, curr_break_op.data(), curr_break_op.size(), bytes_read);
398 if (error.Fail() || bytes_read < curr_break_op.size()) {
401 addr, curr_break_op.size(), bytes_read);
415 error = WriteMemory(addr, saved.data(), saved.size(), bytes_written);
416 if (error.Fail() || bytes_written < saved.size()) {
419 addr, saved.size(), bytes_written);
423 llvm::SmallVector<uint8_t, 4> verify_opcode(saved.size(), 0);
425 error = ReadMemory(addr, verify_opcode.data(), verify_opcode.size(),
427 if (error.Fail() || verify_bytes_read < verify_opcode.size()) {
430 addr, verify_opcode.size(), verify_bytes_read);
454 saved_opcode_bytes.size(), bytes_read);
459 if (bytes_read != saved_opcode_bytes.size()) {
464 saved_opcode_bytes.size(), bytes_read);
491 verify_bp_opcode_bytes.size(), verify_bytes_read);
496 if (verify_bytes_read != verify_bp_opcode_bytes.size()) {
502 verify_bp_opcode_bytes.size(), verify_bytes_read);
tools/lldb/source/Interpreter/CommandObjectRegexCommand.cpp 39 if (match_idx < matches.size()) {
tools/lldb/source/Plugins/Disassembler/llvm/DisassemblerLLVMC.cpp 835 if (disasm_sp && operands.size() > 1) {
842 operands[operands.size() - 1].m_clobbered = true;
855 operands.size());
tools/lldb/source/Plugins/ExpressionParser/Clang/ASTUtils.cpp 24 for (size_t i = 0; i < Sources.size(); ++i)
tools/lldb/source/Plugins/ExpressionParser/Clang/ASTUtils.h 268 for (size_t i = 0; i < Sources.size(); ++i)
275 for (size_t i = 0; i < Sources.size(); ++i)
281 for (size_t i = 0; i < Sources.size(); ++i) {
290 for (size_t i = 0; i < Sources.size(); ++i)
297 for (size_t i = 0; i < Sources.size(); ++i)
305 for (size_t i = 0; i < Sources.size(); ++i)
330 for (size_t i = 0; i < Sources.size(); ++i)
338 for (size_t i = 0; i < Sources.size(); ++i)
346 for (size_t i = 0; i < Sources.size(); ++i) {
356 for (size_t i = 0; i < Sources.size(); ++i)
362 for (size_t i = 0; i < Sources.size(); ++i) {
373 for (size_t i = 0; i < Sources.size(); ++i)
378 for (size_t i = 0; i < Sources.size(); ++i)
383 for (size_t i = 0; i < Sources.size(); ++i)
388 for (size_t i = 0; i < Sources.size(); ++i)
393 for (size_t i = 0; i < Sources.size(); ++i)
400 for (size_t i = 0; i < Sources.size(); ++i)
420 for (size_t i = 0; i < Sources.size(); ++i)
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangASTSource.cpp 223 return (method_decls.size() > 0);
266 return (name_decls.size() != 0);
tools/lldb/source/Plugins/ExpressionParser/Clang/ClangModulesDeclVendor.cpp 132 diagnostic_string.size())));
tools/lldb/source/Plugins/ExpressionParser/Clang/IRForTarget.cpp 1548 for (size_t i = 0; i < users.size(); ++i) {
tools/lldb/source/Plugins/Language/CPlusPlus/CPlusPlusNameParser.cpp 64 return m_next_token_index < m_tokens.size();
607 assert(range.begin_index < m_tokens.size());
608 assert(range.end_index <= m_tokens.size());
tools/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/RenderScriptRuntime.cpp 456 if (idx + 1 < matches.size()) {
2880 if (spec.size() != 8) {
2881 if (spec.size() < 8) {
3066 return info_lines.size() > 0;
tools/lldb/source/Plugins/ObjectFile/ELF/ObjectFileELF.cpp 1894 new DataBufferHeap(uncompressedData.data(), uncompressedData.size()));
tools/lldb/source/Plugins/Process/Linux/ProcessorTrace.cpp 193 if (columns.size() < 2)
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunication.cpp 1177 if (named_pipe_path.size() > 0) {
1220 if (named_pipe_path.size() > 0) {
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServerLLGS.cpp 2799 if (fields.size() != 5)
tools/lldb/source/Plugins/Process/gdb-remote/GDBRemoteCommunicationServerPlatform.cpp 345 response.PutBytesAsRawHex8(cwd.data(), cwd.size());
tools/lldb/source/Plugins/ScriptInterpreter/Python/ScriptInterpreterPython.cpp 305 llvm::StringRef path_ref(path.begin(), path.size());
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFASTParserClang.cpp 1216 if (array_info && array_info->element_orders.size() > 0) {
1883 return template_param_infos.args.size() == template_param_infos.names.size();
1883 return template_param_infos.args.size() == template_param_infos.names.size();
tools/lldb/source/Plugins/SymbolFile/DWARF/DWARFAttribute.h 72 size_t Size() const { return m_infos.size(); }
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARF.cpp 3772 if (log && parameters.size()) {
tools/lldb/source/Plugins/SymbolFile/NativePDB/CompileUnitIndex.cpp 202 if (item.m_build_info.size() < 3)
tools/lldb/source/Symbol/ClangASTContext.cpp 1435 const size_t num_template_params = template_param_infos.args.size();
1500 for (size_t i = 0, template_param_decl_count = template_param_decls.size();
1550 for (size_t i = 0, template_param_decl_count = template_param_decls.size();
1614 template_param_infos.args.size() +
1619 args[args.size() - 1] = TemplateArgument::CreatePackCopy(
5637 num_children = array_info->element_orders.size()
7214 const size_t num_path_elements = path->size();
8616 if (selector_idents.size() == 0)
8620 num_selectors_with_args ? selector_idents.size() : 0,
9735 if (buf.size() > 0) {
9736 s->Write(buf.data(), buf.size());
9912 if (buf.size() > 0)
9913 return ConstString(buf.data(), buf.size());
tools/lldb/source/Symbol/ClangExternalASTSourceCallbacks.cpp 56 return (results.size() != 0);
tools/lldb/source/Symbol/PostfixExpression.cpp 52 if (stack.size() < 2)
81 if (stack.size() != 1)
tools/lldb/source/Symbol/SymbolContext.cpp 878 if (external_symbols.size() > 1) {
887 } else if (external_symbols.size()) {
889 } else if (internal_symbols.size() > 1) {
898 } else if (internal_symbols.size()) {
tools/lldb/source/Target/StackFrame.cpp 1584 if (!instruction_sp->ParseOperands(operands) || operands.size() != 1) {
1627 if (!instruction_sp->ParseOperands(operands) || operands.size() != 2) {
tools/lldb/source/Target/ThreadPlanStepInRange.cpp 367 if (return_value && matches.size() > 1) {
tools/lldb/source/Utility/Broadcaster.cpp 58 listeners.reserve(m_listeners.size());
tools/lldb/source/Utility/Log.cpp 306 format_os << "{0,-" << llvm::alignTo<16>(thread_name.size()) << "} ";
tools/lldb/source/Utility/Status.cpp 276 return buf.size();
tools/lldb/source/Utility/Stream.cpp 120 size_t length = buf.size();
tools/lldb/source/Utility/UUID.cpp 79 if (uuid_bytes.size() == num_uuid_bytes)
104 if (bytes.size() == num_uuid_bytes) {
tools/lldb/source/Utility/VASprintf.cpp 30 int length = ::vsnprintf(buf.data(), buf.size(), fmt, args);
37 if (size_t(length) >= buf.size()) {
41 length = ::vsnprintf(buf.data(), buf.size(), fmt, copy_args);
47 assert(size_t(length) < buf.size());
tools/lldb/unittests/Host/SocketTest.cpp 98 if (Path.size() > 107u)
203 if (domain_path.size() > 107u)
tools/lldb/unittests/Utility/RegularExpressionTest.cpp 61 EXPECT_EQ(3u, matches.size());
tools/lldb/unittests/Utility/VASprintfTest.cpp 39 EXPECT_EQ(TestStr.size(), BigBuffer.size());
47 EXPECT_EQ(TestStr.size(), SmallBuffer.size());
tools/lldb/unittests/tools/lldb-server/tests/MessageObjects.cpp 219 &Info, Bytes.data(), Bytes.size(),
254 if (Val.size() != 1)
281 if (Elements.insert({Field, {""}}).first->second.size() != 1)
296 if (Threads.size() != Pcs.size())
296 if (Threads.size() != Pcs.size())
tools/llvm-ar/llvm-ar.cpp 1093 for (size_t i = 1; i < Argv.size(); ++i) {
1099 if (++i >= Argv.size())
1113 for (; i < Argv.size(); ++i)
tools/llvm-cat/llvm-cat.cpp 95 OS.write(Buffer.data(), Buffer.size());
tools/llvm-cfi-verify/llvm-cfi-verify.cpp 75 std::min<size_t>(Lines.size() + 1, LineInfo.Line + Context + 1);
tools/llvm-cov/CodeCoverage.cpp 502 if (Symbols.size() != NumSymbols) {
tools/llvm-cov/CoverageReport.cpp 127 unsigned NumRedundant = FirstPathComponents.size();
tools/llvm-cov/SourceCoverageViewHTML.cpp 524 for (unsigned I = 0, E = Snippets.size(); I < E; ++I)
tools/llvm-diff/DiffConsumer.cpp 72 unsigned N = contexts.size();
tools/llvm-diff/DiffLog.cpp 26 unsigned LogBuilder::getNumArguments() const { return Arguments.size(); }
43 unsigned DiffLogBuilder::getNumLines() const { return Diff.size(); }
tools/llvm-diff/DifferenceEngine.cpp 48 unsigned Index = Storage.size();
67 unsigned NewSize = Storage.size() - 1;
tools/llvm-dwarfdump/Statistics.cpp 259 if (List->Entries.size()) {
tools/llvm-dwp/llvm-dwp.cpp 497 DWOPaths.emplace_back(DWOPath.data(), DWOPath.size());
tools/llvm-exegesis/lib/BenchmarkResult.cpp 268 if (Pieces.size() == 2 && (RegNo = Context.getRegNo(Pieces[0]))) {
tools/llvm-exegesis/lib/CodeTemplate.cpp 19 : Instr(Instr), VariableValues(Instr.Variables.size()) {}
tools/llvm-exegesis/lib/LlvmState.cpp 74 return Tmp.size() > 0;
tools/llvm-exegesis/lib/MCInstrDescView.cpp 31 assert(TiedOperands.size() <= 2 &&
36 return TiedOperands.size() > 1;
134 Variables.reserve(Operands.size()); // Variables.size() <= Operands.size()
137 const size_t VariableIndex = Variables.size();
172 assert(PrimaryOperandIndex < Operands.size());
tools/llvm-exegesis/lib/SchedClassResolution.cpp 138 while (NumMinimalSU < Subunits.size() &&
143 if (NumMinimalSU == Subunits.size()) {
167 while (NumMinimalSU < Subunits.size() &&
tools/llvm-exegesis/lib/SnippetFile.cpp 53 if (Parts.size() != 2) {
tools/llvm-exegesis/lib/SnippetGenerator.cpp 182 return Container[randomIndex(Container.size() - 1)];
tools/llvm-exegesis/lib/X86/Target.cpp 192 assert(Instr.Operands.size() == 6 && "invalid LEA");
tools/llvm-lipo/llvm-lipo.cpp 357 if (ActionArgs.size() > 1 &&
358 ActionArgs.size() !=
376 if (C.InputFiles.size() > 1)
382 if (C.InputFiles.size() > 1)
392 if (C.InputFiles.size() > 1)
421 if (C.InputFiles.size() > 1)
682 FatHeader.nfat_arch = Slices.size();
706 for (size_t Index = 0, Size = Slices.size(); Index < Size; ++Index) {
719 sizeof(MachO::fat_arch) * FatArchList.size());
tools/llvm-mca/Views/BottleneckAnalysis.cpp 175 const unsigned Size = N.OutgoingEdges.size();
197 for (unsigned I = 0, E = Nodes.size(); I < E; ++I) {
280 for (unsigned I = Seq.size(), E = 0; I > E; --I) {
tools/llvm-mca/Views/RegisterFileStatistics.cpp 49 for (unsigned I = 0, E = PRFUsage.size(); I < E; ++I) {
83 for (unsigned I = 0, E = PRFUsage.size(); I < E; ++I)
115 for (unsigned I = 1, E = PRFUsage.size(); I < E; ++I) {
tools/llvm-nm/llvm-nm.cpp 1666 for (uint64_t f = 0; f < FoundFns.size(); f++) {
tools/llvm-objcopy/CopyConfig.cpp 147 if (NameAndFlags.size() > 1) {
332 size_t NumLines = Lines.size();
406 if (Positional.size() > 2)
412 Config.OutputFilename = Positional[Positional.size() == 1 ? 0 : 1];
792 if (Positional.size() > 1 && InputArgs.hasArg(STRIP_output))
862 if (Positional.size() == 1) {
tools/llvm-objcopy/ELF/ELFConfig.cpp 69 for (size_t I = 1, NumFlags = Flags.size(); I < NumFlags; ++I)
96 UnsupportedFlags.size() > 1 ? "s" : "",
tools/llvm-objcopy/ELF/Object.cpp 192 assert(Line.size());
381 memcpy(Out.getBufferStart() + Offset, HexData.data(), HexData.size());
382 Offset += HexData.size();
525 Size = ChdrSize + CompressedData.size();
1639 Records.reserve(Lines.size());
1640 for (size_t LineNo = 1; LineNo <= Lines.size(); ++LineNo) {
2221 memcpy(Buf, HexData.data(), HexData.size());
2222 return HexData.size();
2227 memcpy(Buf, HexData.data(), HexData.size());
2228 return HexData.size();
tools/llvm-objdump/MachODump.cpp 8010 if (EncodingIdx < CommonEncodings.size())
8015 (EncodingIdx - CommonEncodings.size()));
8172 for (unsigned i = 0; i < IndexEntries.size() - 1; ++i) {
tools/llvm-pdbutil/BytesOutputStyle.cpp 483 if (Spec.SI >= StreamPurposes.size()) {
tools/llvm-pdbutil/ExplainOutputStyle.cpp 246 assert(Stream <= Streams.size());
tools/llvm-profdata/llvm-profdata.cpp 311 std::min(hardware_concurrency(), unsigned((Inputs.size() + 1) / 2));
334 unsigned Mid = Contexts.size() / 2;
335 unsigned End = Contexts.size();
361 if (NumErrors == Inputs.size() ||
tools/llvm-rc/ResourceFileWriter.cpp 176 Result.reserve(Chars.size());
218 while (Pos < Chars.size()) {
224 if (Pos == Chars.size() || Chars[Pos] != '"')
252 while (RemainingChars && Pos < Chars.size() && Chars[Pos] < 0x80) {
276 while (RemainingChars && Pos < Chars.size() && Chars[Pos] >= '0' &&
316 if (Pos == Chars.size() || Chars[Pos] != '"')
342 for (size_t Pos = 0; Pos < Result.size(); ++Pos)
348 for (size_t Pos = 0; Pos + 1 < Result.size(); ++Pos)
351 if (Result.size() > 0 && Result.back() == '\0')
1270 checkNumberFits<uint16_t>(Data.size(), "STRINGTABLE string size"));
1271 writeInt<uint16_t>(Data.size());
tools/llvm-rc/ResourceScriptParser.cpp 297 if (Result.size() < MinCount)
821 if (Args->size() >= 1)
823 if (Args->size() >= 2)
825 if (Args->size() >= 3)
tools/llvm-readobj/ARMEHABIPrinter.h 177 for (unsigned BI = 0, BE = ULEB.size(); BI != BE; ++BI)
181 for (unsigned BI = 0, BE = ULEB.size(); BI != BE; ++BI)
tools/llvm-readobj/COFFDumper.cpp 1113 for (unsigned I = 0, E = FunctionNames.size(); I != E; ++I) {
tools/llvm-readobj/ELFDumper.cpp 673 if (Index >= VersionMap.size())
701 if (Index >= VersionMap.size())
789 if (VersionIndex >= VersionMap.size() || VersionMap[VersionIndex].isNull())
tools/llvm-reduce/deltas/ReduceMetadata.cpp 47 for (int I = 0, E = MDs.size(); I != E; ++I)
tools/llvm-size/llvm-size.cpp 167 return result.size();
tools/llvm-xray/xray-graph.cpp 214 if (ThreadStack.size() == 0 || ThreadStack.back().FuncId != Record.FuncId) {
230 assert(ThreadStack.size() != 0);
453 auto Level = ThreadStack.second.size();
tools/llvm-xray/xray-stacks.cpp 266 Data.TerminalDurations.reserve(Left.TerminalDurations.size() +
267 Right.TerminalDurations.size());
268 Data.IntermediateDurations.reserve(Left.IntermediateDurations.size() +
269 Right.IntermediateDurations.size());
304 return Node->ExtraData.TerminalDurations.size() +
305 Node->ExtraData.IntermediateDurations.size();
467 F->ExtraData.IntermediateDurations.size(), Sum);
477 Leaf->ExtraData.TerminalDurations.size(), LeafSum);
638 if (TopStacksBySum.size() == 11)
643 std::make_pair(Top, Top->ExtraData.TerminalDurations.size());
648 if (TopStacksByCount.size() == 11)
tools/opt/opt.cpp 908 if (Buffer.size() != FirstRunBuffer.size() ||
908 if (Buffer.size() != FirstRunBuffer.size() ||
909 (memcmp(Buffer.data(), FirstRunBuffer.data(), Buffer.size()) != 0)) {
tools/polly/include/polly/ScopDetectionDiagnostic.h 168 size_t size() const { return ErrorReports.size(); }
tools/polly/include/polly/ScopInfo.h 287 return DimensionSizes.size();
887 if (Incoming.size() == 1)
898 unsigned getNumSubscripts() const { return Subscripts.size(); }
1538 size_t size() const { return MemAccs.size(); }
tools/polly/lib/Analysis/ScopBuilder.cpp 940 assert(RN->isSubRegion() || TI->getNumSuccessors() == ConditionSets.size());
941 for (unsigned u = 0, e = ConditionSets.size(); u < e; u++) {
984 while (++u < ConditionSets.size())
1176 assert(LoopStack.size() == 1 && LoopStack.back().L == L);
1276 size_t Dimension = LoopStack.size();
3296 MinMaxAccesses.reserve(AliasGroup.size());
3330 if (scop->getAliasGroups().size())
3386 if (AG.size() < 2)
3433 if (AliasGroup.size() < 2)
3492 if (MinMaxAccessesReadWrite.size() + ReadOnlyArrays.size() >
3506 for (unsigned u = 0; u < AliasGroups.size(); u++) {
3522 if (NewAG.size() > 1)
tools/polly/lib/Analysis/ScopDetection.cpp 890 if (Operands.size())
911 if (Sizes.size() == 0)
987 if (Shape->DelinearizedSizes.size() == 0) {
992 if (Acc->DelinearizedSubscripts.size() == 0)
tools/polly/lib/Analysis/ScopInfo.cpp 304 assert(DimensionSizesPw.size() > 0 && !DimensionSizesPw[0]);
323 int SharedDims = std::min(NewSizes.size(), DimensionSizes.size());
325 int ExtraDimsOld = DimensionSizes.size() - SharedDims;
335 if (DimensionSizes.size() >= NewSizes.size())
705 assert(Subscripts.size() == 2 && Sizes.size() == 1);
705 assert(Subscripts.size() == 2 && Sizes.size() == 1);
773 if (Sizes.size() < 2 || isa<SCEVConstant>(Sizes[1]))
776 int Size = Subscripts.size();
871 for (int i = 0, Size = Subscripts.size(); i < Size; ++i) {
1242 unsigned ScopStmt::getNumIterators() const { return NestLoops.size(); }
2151 if (Pair.second.size() == 0)
2154 noOfGroups += Pair.second.size();
tools/polly/lib/CodeGen/BlockGenerators.cpp 1214 for (unsigned i = 0; i < ScalarMaps.size(); i++) {
tools/polly/lib/CodeGen/IRBuilder.cpp 72 if (Arrays.size() > MaxArraysInAliasScops)
tools/verify-uselistorder/verify-uselistorder.cpp 116 Filename.assign(Vector.data(), Vector.data() + Vector.size());
unittests/ADT/APFloatTest.cpp 34 return std::string(Buffer.data(), Buffer.size());
unittests/ADT/DirectedGraphTest.cpp 135 EXPECT_TRUE(EL.size() == 1);
276 EXPECT_TRUE(ListOfSCCs.size() == 2);
unittests/ADT/STLExtrasTest.cpp 268 ASSERT_EQ(3u, Enumerated.size());
unittests/ADT/SmallStringTest.cpp 32 EXPECT_EQ(0u, v.size());
48 EXPECT_EQ(3u, theString.size());
55 EXPECT_EQ(3u, theString.size());
62 EXPECT_EQ(3u, theString.size());
70 EXPECT_EQ(3u, theString.size());
78 EXPECT_EQ(6u, theString.size());
86 EXPECT_EQ(6u, theString.size());
95 EXPECT_EQ(6u, theString.size());
unittests/ADT/SmallVectorTest.cpp 163 EXPECT_EQ(0u, v.size());
173 EXPECT_EQ(size, v.size());
317 EXPECT_EQ(2u, this->theVector.size());
351 EXPECT_EQ(10u, this->theVector.size());
717 EXPECT_EQ(0u, constVector.size());
724 EXPECT_EQ(0u, this->theVector.size());
732 EXPECT_EQ(4u, this->theVector.size());
913 EXPECT_TRUE(V.size() == 1);
924 EXPECT_TRUE(V.size() == 1);
935 EXPECT_TRUE(V.size() == 1);
946 EXPECT_TRUE(V.size() == 1);
957 EXPECT_TRUE(V.size() == 1);
968 EXPECT_TRUE(V.size() == 1);
979 EXPECT_EQ(2U, V.size());
unittests/Analysis/LazyCallGraphTest.cpp 804 EXPECT_EQ(1u, MergedRCs.size());
896 EXPECT_EQ(1u, MergedRCs.size());
976 EXPECT_EQ(3u, MergedRCs.size());
1050 EXPECT_EQ(3u, MergedRCs.size());
1171 ASSERT_EQ(2u, NewRCs.size());
1346 EXPECT_EQ(0u, NewRCs.size());
1362 ASSERT_EQ(2u, NewRCs.size());
1428 ASSERT_EQ(2u, NewRCs.size());
1496 EXPECT_EQ(0u, NewRCs.size());
1512 EXPECT_EQ(0u, NewRCs.size());
unittests/Analysis/LoopInfoTest.cpp 211 ASSERT_EQ(8u, Preorder.size());
222 ASSERT_EQ(8u, ReverseSiblingPreorder.size());
1398 EXPECT_TRUE(Exits.size() == 2);
1402 EXPECT_TRUE(Exits.size() == 1);
1441 EXPECT_TRUE(Exits.size() == 1);
1445 EXPECT_TRUE(Exits.size() == 1);
unittests/Analysis/TBAATest.cpp 64 EXPECT_TRUE(StringRef(ErrorMsg.begin(), ErrorMsg.size())
unittests/Analysis/VectorFunctionABITest.cpp 50 EXPECT_EQ(VFS.Shape.Parameters.size(), (unsigned)5);
127 EXPECT_EQ(Parameters.size(), (unsigned)9);
147 EXPECT_EQ(Parameters.size(), (unsigned)1);
159 EXPECT_EQ(Parameters.size(), (unsigned)4);
210 EXPECT_EQ(Parameters.size(), (unsigned)8);
254 EXPECT_EQ(Parameters.size(), (unsigned)1);
276 EXPECT_EQ(Parameters.size(), (unsigned)1);
375 EXPECT_EQ(Parameters.size(), (unsigned)2);
387 EXPECT_EQ(Parameters.size(), (unsigned)2);
399 EXPECT_EQ(Parameters.size(), (unsigned)2);
411 EXPECT_EQ(Parameters.size(), (unsigned)2);
423 EXPECT_EQ(Parameters.size(), (unsigned)2);
435 EXPECT_EQ(Parameters.size(), (unsigned)2);
unittests/Bitstream/BitstreamReaderTest.cpp 94 for (unsigned I = 0, BlobSize = 0, E = BlobData.size(); BlobSize < E;
118 ArrayRef<uint8_t>((const uint8_t *)Buffer.begin(), Buffer.size()));
unittests/CodeGen/GlobalISel/KnownBitsTest.cpp 19 unsigned CopyReg = Copies[Copies.size() - 1];
39 unsigned CopyReg = Copies[Copies.size() - 1];
67 unsigned CopyReg = Copies[Copies.size() - 1];
83 unsigned CopyReg = Copies[Copies.size() - 1];
110 unsigned CopyReg = Copies[Copies.size() - 1];
unittests/DebugInfo/DWARF/DwarfGenerator.cpp 527 return StringRef(FileBytes.data(), FileBytes.size());
537 Strm.write(FileBytes.data(), FileBytes.size());
unittests/ExecutionEngine/JITLink/JITLinkTestCommon.cpp 33 return MemoryBufferRef(StringRef(ObjBuffer.data(), ObjBuffer.size()),
unittests/IR/BasicBlockTest.cpp 125 EXPECT_EQ(static_cast<size_t>(BB1->sizeWithoutDebug()), Exp.size());
126 EXPECT_EQ(static_cast<size_t>(BBConst->sizeWithoutDebug()), Exp.size());
unittests/IR/DominatorTreeBatchUpdatesTest.cpp 64 EXPECT_EQ(Legalized.size(), 3UL);
87 EXPECT_EQ(Legalized.size(), 3UL);
unittests/IR/DominatorTreeTest.cpp 211 EXPECT_EQ(DominatedBBs.size(), 4UL);
212 EXPECT_EQ(PostDominatedBBs.size(), 1UL);
219 EXPECT_EQ(DominatedBBs.size(), 0UL);
220 EXPECT_EQ(PostDominatedBBs.size(), 0UL);
659 EXPECT_EQ(IDFBlocks.size(), 2UL);
777 EXPECT_TRUE(PDT.getRoots().size() == 2);
unittests/IR/FunctionTest.cpp 71 EXPECT_EQ(2u, Args.size());
unittests/IR/IRBuilderTest.cpp 145 for (unsigned i = 0; i != ArgTys.size(); ++i)
166 for (unsigned i = 0; i != ArgTys.size(); ++i)
unittests/IR/MetadataTest.cpp 2713 ASSERT_EQ(4u, MDs.size());
unittests/Option/OptionParsingTest.cpp 109 ASSERT_EQ(2u, ASL.size());
unittests/ProfileData/SampleProfTest.cpp 65 RemapFile = StringRef(RemapPath.data(), RemapPath.size());
81 StringRef Profile(ProfilePath.data(), ProfilePath.size());
306 StringRef ProfileFile(ProfilePath.data(), ProfilePath.size());
unittests/Remarks/BitstreamRemarksParsingTest.cpp 182 EXPECT_EQ(Remark.Args.size(), 4U);
unittests/Remarks/YAMLRemarksParsingTest.cpp 424 EXPECT_EQ(Remark.Args.size(), 4U);
596 EXPECT_EQ(Remark.Args.size(), 4U);
unittests/Support/CommandLineTest.cpp 177 ASSERT_EQ(TestOption2.Categories.size(), 2U);
225 EXPECT_EQ(OutputSize, Actual.size());
226 for (unsigned I = 0, E = Actual.size(); I != E; ++I) {
835 EXPECT_EQ(Argv.size(), 13U);
911 EXPECT_EQ(Argv.size(), 9U);
951 ASSERT_EQ(Argv.size(), 1 + NON_RSP_AT_ARGS + 2);
1039 EXPECT_EQ(Argv.size(), 4U);
1131 sys::fs::remove(std::string(FilePath.data(), FilePath.size()));
unittests/Support/ConvertUTFTest.cpp 47 ASSERT_EQ(3u, Result.size());
unittests/Support/Path.cpp 182 StringRef filename(temp_store.begin(), temp_store.size()), stem, ext;
unittests/Support/RegexTest.cpp 29 EXPECT_EQ(1u, Matches.size());
34 EXPECT_EQ(3u, Matches.size());
40 EXPECT_EQ(3u, Matches.size());
50 EXPECT_EQ(1u, Matches.size());
67 EXPECT_EQ(2u, Matches.size());
72 EXPECT_EQ(2u, Matches.size());
78 EXPECT_EQ(3u, Matches.size());
unittests/Support/TargetParserTest.cpp 320 EXPECT_EQ(List.size(), NumARMCPUArchs);
919 EXPECT_EQ(List.size(), NumAArch64CPUArchs);
unittests/Support/VirtualFileSystemTest.cpp 763 EXPECT_EQ(InputToCheck.size(), Expected.size());
763 EXPECT_EQ(InputToCheck.size(), Expected.size());
765 unsigned LastElt = std::min(InputToCheck.size(), Expected.size());
765 unsigned LastElt = std::min(InputToCheck.size(), Expected.size());
unittests/Transforms/Utils/CloningTest.cpp 815 EXPECT_EQ(GVs.size(), 1U);
unittests/Transforms/Utils/LocalTest.cpp 736 EXPECT_EQ(2U, CDbgVals.size());
748 EXPECT_EQ(2U, DDbgVals.size());
767 EXPECT_EQ(0U, FDbgVals.size());
779 EXPECT_EQ(6U, ADbgVals.size());
unittests/Transforms/Utils/SSAUpdaterBulkTest.cpp 183 EXPECT_EQ(Inserted.size(), 1u);
utils/TableGen/AsmMatcherEmitter.cpp 618 if (AsmOperands.size() != RHS.AsmOperands.size())
618 if (AsmOperands.size() != RHS.AsmOperands.size())
619 return AsmOperands.size() < RHS.AsmOperands.size();
619 return AsmOperands.size() < RHS.AsmOperands.size();
623 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
636 if (RequiredFeatures.size() != RHS.RequiredFeatures.size())
636 if (RequiredFeatures.size() != RHS.RequiredFeatures.size())
637 return RequiredFeatures.size() > RHS.RequiredFeatures.size();
637 return RequiredFeatures.size() > RHS.RequiredFeatures.size();
655 if (AsmOperands.size() != RHS.AsmOperands.size())
655 if (AsmOperands.size() != RHS.AsmOperands.size())
664 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i)
675 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
806 for (unsigned i = 0, e = AsmOperands.size(); i != e; ++i) {
1451 for (unsigned i = 0, e = MI->AsmOperands.size(); i != e; ++i) {
1574 for (unsigned i = 0; i != II->AsmOperands.size(); ++i) {
1969 MaxNumOperands = std::max(MaxNumOperands, MI->AsmOperands.size());
2076 MaxRowLength = std::max(MaxRowLength, II->ResOperands.size()*2 + 1 );
2078 for (unsigned i = 0, e = II->ResOperands.size(); i != e; ++i) {
2905 for (unsigned i = 0, e = II.RequiredFeatures.size(); i != e; ++i)
3322 MaxNumOperands = std::max(MaxNumOperands, MI->AsmOperands.size());
3340 for (unsigned I = 0, E = MI->RequiredFeatures.size(); I != E; ++I)
3452 for (unsigned i = 0, e = MI->RequiredFeatures.size(); i != e; ++i)
3456 for (unsigned i = 0, e = MI->AsmOperands.size(); i != e; ++i) {
utils/TableGen/CodeGenDAGPatterns.cpp 207 for (unsigned i = 0, e = Types.size(); i != e; ++i) {
1406 for (unsigned i = 0, e = PredList.size(); i != e; ++i) {
2968 if (Entry.second.size() > 1) {
2969 for (unsigned i = 0, e = Nodes.size()-1; i != e; ++i) {
3931 if (PatInstrs.size() != 1)
4032 (Instrs.size() == 1 ?
utils/TableGen/CodeGenRegisters.cpp 147 I += SubIdx->ConcatenationOf.size();
273 HasDisjunctSubRegs = ExplicitSubRegs.size() > 1;
276 for (unsigned i = 0, e = ExplicitSubRegs.size(); i != e; ++i) {
309 for (unsigned i = 0; i != Indices.size(); ++i) {
389 for (unsigned i = 0, e = ExplicitSubRegs.size(); i != e; ++i) {
391 if (!SR->CoveredBySubRegs || SR->ExplicitSubRegs.size() <= 1 ||
397 for (unsigned j = 0, e = SR->ExplicitSubRegs.size(); j != e; ++j) {
413 for (unsigned i = 0, e = ExplicitSubRegs.size(); i != e; ++i) {
427 for (unsigned i = 0, e = ExplicitAliases.size(); i != e; ++i) {
490 if (Cand->ExplicitSubRegs.size() == 1)
532 for (unsigned i = 0, e = NewSubRegs.size(); i != e; ++i) {
580 for (unsigned i = 0, e = ExplicitSubRegs.size(); i != e; ++i) {
856 for (unsigned j = 0, je = Super.Orders[i].size(); j != je; ++j)
1184 NumNativeRegUnits = RegUnits.size();
1286 assert(Parts.size() > 1 && "Need two parts to concatenate");
1305 for (unsigned i = 1, e = Parts.size(); i != e; ++i) {
1509 if (LaneTransforms.size() == 1)
1515 if (LaneTransforms.size() == 0) {
2258 for (unsigned i = 0, e = SSPairs.size(); i != e; ++i)
2267 if (SubSetVec.size() == SSPairs.size()) {
utils/TableGen/CodeGenRegisters.h 349 unsigned getNumValueTypes() const { return VTs.size(); }
356 if (VTNum < VTs.size())
668 RegUnits.resize(RegUnits.size() + 1);
675 return RegUnits.size() - 1;
681 RegUnits.resize(RegUnits.size() + 1);
683 return RegUnits.size() - 1;
utils/TableGen/CodeGenSchedule.cpp 1533 unsigned OperIdx = RWSequences.size()-1;
1551 assert(OperIdx == RWSequences.size() && "missed a sequence");
utils/TableGen/DAGISelMatcher.cpp 105 return Operands.size();
109 assert(i < Operands.size());
295 for (unsigned i = 0, e = VTs.size(); i != e; ++i)
298 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
utils/TableGen/DAGISelMatcher.h 191 unsigned getNumChildren() const { return Children.size(); }
208 if (NC < Children.size()) {
210 for (unsigned i = NC, e = Children.size(); i != e; ++i)
478 unsigned getNumCases() const { return Cases.size(); }
528 unsigned getNumCases() const { return Cases.size(); }
912 unsigned getNumNodes() const { return ChainNodes.size(); }
915 assert(i < ChainNodes.size());
1009 unsigned getNumVTs() const { return VTs.size(); }
1011 assert(i < VTs.size());
1015 unsigned getNumOperands() const { return Operands.size(); }
1017 assert(i < Operands.size());
1099 unsigned getNumResults() const { return Results.size(); }
utils/TableGen/DAGISelMatcherGen.cpp 549 for (unsigned i = 0, e = ResultsToTypeCheck.size(); i != e; ++i)
586 for (unsigned i = 0, e = MatchedComplexPatterns.size(); i != e; ++i) {
838 unsigned FinalNumOps = InstOps.size() + NumSubOps;
839 while (InstOps.size() < FinalNumOps) {
841 unsigned BeforeAddingNumOps = InstOps.size();
843 assert(InstOps.size() > BeforeAddingNumOps && "Didn't add any operands");
870 for (unsigned i = 0, e = PhysRegInputs.size(); i != e; ++i) {
966 for (unsigned i = 0, e = ResultVTs.size(); i != e; ++i) {
987 assert(InputOps.size() == 1 && "Unexpected input to SDNodeXForm");
1050 assert(Ops.size() >= NumSrcResults && "Didn't provide enough results");
utils/TableGen/DAGISelMatcherOpt.cpp 227 for (unsigned OptionIdx = 0, e = OptionsToMatch.size(); OptionIdx != e;) {
309 if (EqualMatchers.size() == 1) {
321 for (unsigned i = 1, e = EqualMatchers.size(); i != e; ++i) {
337 if (NewOptionsToMatch.size() == 1) {
353 for (unsigned i = 0, e = NewOptionsToMatch.size(); i != e; ++i) {
395 for (unsigned i = 0, e = NewOptionsToMatch.size(); i != e; ++i) {
411 for (unsigned i = 0, e = NewOptionsToMatch.size(); i != e; ++i) {
435 Entry = Cases.size()+1;
449 if (Cases.size() != 1) {
461 Scope->setNumChildren(NewOptionsToMatch.size());
462 for (unsigned i = 0, e = NewOptionsToMatch.size(); i != e; ++i)
utils/TableGen/DFAEmitter.cpp 308 if (ActionTypes.size() == 1) {
utils/TableGen/FastISelEmitter.cpp 140 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
150 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
160 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
293 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
310 assert(PR.size() == Operands.size());
312 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
335 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
354 for (unsigned i = 0, e = Operands.size(); i != e; ++i) {
368 for (unsigned i = 0, e = Operands.size(); i != e; ++i)
utils/TableGen/FixedLenDecoderEmitter.cpp 1280 for (unsigned i = 0, e = PBytes.size(); i != e; ++i)
1337 for (unsigned i = 0, e = MaskBytes.size(); i != e; ++i)
1344 for (unsigned i = 0, e = MaskBytes.size(); i != e; ++i)
1418 for (unsigned i = 0, e = Bytes.size(); i != e; ++i)
utils/TableGen/GlobalISelEmitter.cpp 1908 << MatchTable::IntValue(AddrSpaces.size());
utils/TableGen/IntrinsicEmitter.cpp 404 assert(OriginalIdx >= Mapping.size());
utils/TableGen/RegisterInfoEmitter.cpp 714 for (unsigned r = 0, re = Rows.size(); r != re; ++r) {
721 Found = Rows.size();
730 if (Rows.size() > 1) {
731 OS << " static const " << getMinimalTypeForRange(Rows.size(), 32)
740 << " Rows[" << Rows.size() << "][" << SubRegIndicesSize << "] = {\n";
741 for (unsigned r = 0, re = Rows.size(); r != re; ++r) {
754 if (Rows.size() > 1)
778 for (size_t s = 0, se = Sequences.size(); s != se; ++s, SIdx = NextSIdx) {
780 NextSIdx = SIdx + Sequence.size() + 1;
799 for (size_t s = 0, se = Sequences.size(); s != se; ++s) {
802 for (size_t p = 0, pe = Sequence.size(); p != pe; ++p) {
811 Idx += Sequence.size() + 1;
utils/TableGen/SearchableTableEmitter.cpp 196 assert(Index.Fields.size() == 1);
361 if (Index.Fields.size() == 1 &&
utils/TableGen/SequenceToOffsetTable.h 59 return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin());
59 return A.size() <= B.size() && std::equal(A.rbegin(), A.rend(), B.rbegin());
98 Entries += I->first.size() + 1;
108 return I->second + (I->first.size() - Seq.size());
108 return I->second + (I->first.size() - Seq.size());
utils/TableGen/X86DisassemblerTables.cpp 851 for (unsigned i = 0, e = OperandList.size(); i != e; ++i) {
utils/unittest/googlemock/include/gmock/gmock-matchers.h 2432 SizeType size = container.size();
utils/unittest/googletest/include/gtest/internal/custom/gtest-printers.h 61 *OS << ::testing::PrintToString(std::string(S.data(), S.size()));
64 *OS << ::testing::PrintToString(std::string(S.data(), S.size()));