|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/CodeGen/MachinePipeliner.h 332 for (unsigned i = 0, e = Nodes.size(); i < e; ++i)
350 unsigned size() const { return Nodes.size(); }
lib/Analysis/AliasAnalysisEvaluator.cpp 136 errs() << "Function: " << F.getName() << ": " << Pointers.size()
137 << " pointers, " << Calls.size() << " call sites\n";
lib/Analysis/InlineCost.cpp 1829 for (unsigned Idx = 0; Idx != BBWorklist.size(); ++Idx) {
lib/Analysis/InstructionSimplify.cpp 5444 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) {
lib/Analysis/LoopAccessAnalysis.cpp 825 LLVM_DEBUG(dbgs() << "LAA: Accesses(" << Accesses.size() << "):\n");
lib/Analysis/MemorySSAUpdater.cpp 935 assert(pred_size(BB) == AddedBlockSet.size() && "Duplicate edges added.");
944 assert(AddedBlockSet.size() == 1 &&
lib/Analysis/ModuleSummaryAnalysis.cpp 429 unsigned RefCnt = RefEdges.size();
436 unsigned FirstWORef = RefEdges.size();
lib/Analysis/TypeBasedAliasAnalysis.cpp 506 int IA = PathA.size() - 1;
507 int IB = PathB.size() - 1;
lib/Analysis/VectorUtils.cpp 538 if (Union.size() == 0)
540 if (Union.size() == 1)
lib/CodeGen/LiveRangeCalc.cpp 298 for (unsigned i = 0; i != WorkList.size(); ++i) {
597 for (unsigned i = 0; i != PredQueue.size(); ++i) {
lib/CodeGen/MachinePipeliner.cpp 1642 if (isSubset(S1, S2) && S1.size() == S2.size()) {
1642 if (isSubset(S1, S2) && S1.size() == S2.size()) {
1759 for (unsigned i = 0, e = Set1.size(); i != e; ++i) {
2672 std::vector<UnitIndex> Indices(NodeOrder.size(), std::make_pair(nullptr, 0));
2674 for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i)
2691 for (unsigned i = 0, s = NodeOrder.size(); i < s; ++i) {
lib/CodeGen/ProcessImplicitDefs.cpp 156 LLVM_DEBUG(dbgs() << printMBBReference(*MFI) << " has " << WorkList.size()
lib/CodeGen/SelectionDAG/DAGCombiner.cpp12490 if ((Users.size() * NumElts) < MinUses)
lib/Linker/IRMover.cpp 1355 for (unsigned I = 0, E = Requirements.size(); I != E; ++I) {
lib/Linker/LinkModules.cpp 530 for (unsigned I = 0; I < ValuesToLink.size(); ++I) {
lib/MC/MCDwarf.cpp 810 if (context.getGenDwarfSectionSyms().size() > 1 &&
877 Length += 2 * AddrSize * Sections.size();
1161 MCOS->getContext().getGenDwarfSectionSyms().size() > 1 &&
lib/TableGen/SetTheory.cpp 105 if (unsigned(N) < Set.size())
117 if (unsigned(N) > Set.size())
118 N = Set.size();
137 N = Set.size() - (-N % Set.size());
137 N = Set.size() - (-N % Set.size());
139 N %= Set.size();
152 for (unsigned I = 0; I < Set.size(); I += N)
166 MaxSize = std::max(MaxSize, unsigned(Args[i].size()));
171 if (n < Args[i].size())
lib/Target/Hexagon/BitTracker.cpp 945 for (unsigned i = 0, n = BTs.size(); i < n; ++i)
lib/Target/Hexagon/HexagonCommonGEP.cpp 292 OS << I->first << " -> #" << Us.size() << '{';
lib/Target/Hexagon/HexagonConstExtenders.cpp 1492 for (unsigned i = 1, e = Refs.size(); i != e; ++i) {
1899 if (Idxs.size() < CountThreshold)
lib/Target/Hexagon/HexagonConstPropagation.cpp 3133 unsigned NumTargets = Targets.size();
lib/Target/Hexagon/HexagonExpandCondsets.cpp 398 for (unsigned i = 0; i < Work.size(); ++i) {
lib/Target/Hexagon/HexagonFrameLowering.cpp 784 for (unsigned i = 0; i < Worklist.size(); ++i) {
lib/Target/Hexagon/HexagonISelDAGToDAGHVX.cpp 193 for (unsigned I = 0; I != Q.size(); ++I) {
963 for (unsigned i = 0; i != WorkQ.size(); ++i) {
1453 for (unsigned I = 0; I != SubNodes.size(); ++I) {
1467 for (unsigned I = 0; I != TmpQ.size(); ++I) {
1479 assert(SubNodes.size() == TmpQ.size());
1479 assert(SubNodes.size() == TmpQ.size());
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 1152 unsigned I, N = Cycle.size();
1325 for (unsigned i = 0; i < Users.size(); ++i) {
1354 for (unsigned i = 0; i < Internal.size(); ++i) {
2315 for (unsigned i = 0; i < Worklist.size(); ++i) {
lib/Target/Hexagon/HexagonVectorLoopCarriedReuse.cpp 741 LLVM_DEBUG(dbgs() << "Found " << Dependences.size() << " dependences\n");
742 LLVM_DEBUG(for (size_t i = 0; i < Dependences.size();
lib/Target/Hexagon/RDFGraph.cpp 1407 for (unsigned i = 0; i < IDF.size(); ++i) {
lib/Target/Hexagon/RDFLiveness.cpp 140 for (unsigned i = 0; i < DefQ.size(); ++i) {
467 for (unsigned i = 0; i < DefQ.size(); ++i) {
704 for (unsigned i = 0; i < IDFB.size(); ++i) {
lib/Target/WebAssembly/WebAssemblyCFGSort.cpp 396 while (OnStack.size() > 1 && &MBB == WebAssembly::getBottom(OnStack.back()))
lib/Transforms/IPO/Attributor.cpp 1021 ")[#UC: " + std::to_string(UnresolvedCalls.size()) + "]";
1079 size_t NumUnresolvedCalls = UnresolvedCalls.size();
1094 auto Size = RVS.RetValsMap[&Val].size();
1096 bool Inserted = RVS.RetValsMap[&Val].size() != Size;
1101 << " => " << RVS.RetInsts.size() << "\n";
1131 << " by #" << It.second.size() << " RIs\n");
1231 Changed |= (NumUnresolvedCalls != UnresolvedCalls.size());
2110 for (size_t i = 0; i < ToBeExploredPaths.size(); ++i)
2133 std::to_string(NoReturnCalls.size()) + "]";
2313 BUILD_STAT_NAME(PartiallyDeadBlocks, Function) += NoReturnCalls.size();
2388 size_t Size = ToBeExploredPaths.size();
2399 while (Size != ToBeExploredPaths.size()) {
3547 return "[H2S] Mallocs: " + std::to_string(MallocCalls.size());
3758 BUILD_STAT_NAME(MallocCalls, Function) += MallocCalls.size();
4106 for (unsigned i = 0; i < Uses.size() && !isAtFixpoint(); i++) {
4467 << ", Worklist size: " << Worklist.size() << "\n");
4488 << ", Worklist+Dependent size: " << Worklist.size()
lib/Transforms/IPO/CrossDSOCFI.cpp 141 SwitchInst *SI = IRB.CreateSwitch(&CallSiteTypeId, TrapBB, TypeIds.size());
lib/Transforms/IPO/FunctionAttrs.cpp 867 for (unsigned i = 0; i != FlowsToReturn.size(); ++i) {
982 for (unsigned i = 0; i != FlowsToReturn.size(); ++i) {
1358 if (SCCNodes.size() != 1)
lib/Transforms/IPO/FunctionImport.cpp 1193 ImportedCount += GlobalsToImport.size();
lib/Transforms/IPO/HotColdSplitting.cpp 311 getOutliningPenalty(Region, Inputs.size(), Outputs.size());
311 getOutliningPenalty(Region, Inputs.size(), Outputs.size());
lib/Transforms/IPO/PartialInlining.cpp 1142 dbgs() << "inputs: " << Inputs.size() << "\n";
1143 dbgs() << "outputs: " << Outputs.size() << "\n";
1151 if (Outputs.size() > 0 && !ForceLiveExit)
lib/Transforms/InstCombine/InstCombineCompares.cpp 537 if (Explored.size() >= 100)
lib/Transforms/Scalar/ConstantHoisting.cpp 276 (InsertPtsFreq == BFI.getBlockFreq(Node) && InsertPts.size() > 1))
297 (InsertPtsFreq == BFI.getBlockFreq(Node) && InsertPts.size() > 1)))) {
334 while (BBs.size() >= 2) {
345 assert((BBs.size() == 1) && "Expected only one element.");
851 if (IPSet.size() == 1 ||
lib/Transforms/Scalar/GVNSink.cpp 288 assert(Blocks.size() == NewBlocks.size());
661 unsigned InitialActivePredSize = ActivePreds.size();
676 if (ActivePreds.size() != InitialActivePredSize) {
753 Cand.NumBlocks = ActivePreds.size();
lib/Transforms/Scalar/LoopInterchange.cpp 1254 for (; i < WorkList.size(); i++) {
lib/Transforms/Scalar/LoopStrengthReduce.cpp 2708 if (Types.size() == 1)
3299 for (size_t i = 0, e = Factors.size(); i != e; ++i)
4925 int NumReqRegsToFind = std::min(F.getNumRegs(), ReqRegs.size());
lib/Transforms/Scalar/LoopUnrollPass.cpp 508 for (unsigned Idx = 0; Idx != BBWorklist.size(); ++Idx) {
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 384 dbgs() << "Number live values: " << LiveSet.size() << "\n";
1609 LiveVec.reserve(LiveSet.size());
1610 BaseVec.reserve(LiveSet.size());
2755 const auto OldLiveOutSize = LiveOut.size();
2761 if (OldLiveOutSize == LiveOut.size()) {
2777 if (OldLiveIn.size() != LiveTmp.size()) {
2777 if (OldLiveIn.size() != LiveTmp.size()) {
lib/Transforms/Scalar/SROA.cpp 4181 unsigned PPWOldSize = PostPromotionWorklist.size();
4236 while (PostPromotionWorklist.size() > PPWOldSize)
lib/Transforms/Scalar/SimpleLoopUnswitch.cpp 2025 VMaps.reserve(UnswitchedSuccBBs.size());
2100 assert(UnswitchedSuccBBs.size() == 1 &&
2136 assert(UnswitchedSuccBBs.size() == 1 &&
2199 assert(UnswitchedSuccBBs.size() == 1 &&
lib/Transforms/Scalar/SpeculateAroundPHIs.cpp 569 SpecPreds.reserve(PredSet.size());
789 if (PredSet.size() < 2) {
795 PNs, CostSavingsMap, PotentialSpecSet, PredSet.size(), DT, TTI);
lib/Transforms/Utils/CloneFunction.cpp 614 for (unsigned Idx = 0; Idx != Worklist.size(); ++Idx) {
lib/Transforms/Utils/CodeExtractor.cpp 773 LLVM_DEBUG(dbgs() << "inputs: " << inputs.size() << "\n");
774 LLVM_DEBUG(dbgs() << "outputs: " << outputs.size() << "\n");
809 if (AggregateArgs && (inputs.size() + outputs.size() > 0)) {
809 if (AggregateArgs && (inputs.size() + outputs.size() > 0)) {
930 for (unsigned i = 0, e = inputs.size(); i != e; ++i) {
954 for (unsigned i = 0, e = inputs.size(); i != e; ++i, ++AI)
956 for (unsigned i = 0, e = outputs.size(); i != e; ++i, ++AI)
1103 if (AggregateArgs && (inputs.size() + outputs.size() > 0)) {
1103 if (AggregateArgs && (inputs.size() + outputs.size() > 0)) {
1116 for (unsigned i = 0, e = inputs.size(); i != e; ++i) {
1148 unsigned FirstOut = inputs.size();
1150 std::advance(OutputArgBegin, inputs.size());
1153 for (unsigned i = 0, e = outputs.size(); i != e; ++i) {
1235 for (unsigned i = 0, e = outputs.size(); i != e; ++i) {
lib/Transforms/Vectorize/LoopVectorize.cpp 4485 while (Idx != Worklist.size()) {
4746 while (idx != Worklist.size()) {
lib/Transforms/Vectorize/SLPVectorizer.cpp 4392 LLVM_DEBUG(dbgs() << "SLP: Optimizing " << GatherSeq.size()
4425 CSEWorkList.reserve(CSEBlocks.size());
7061 for (int I = 0, E = GEPList.size(); I < E && Candidates.size() > 1; ++I) {
7066 for (int J = I + 1; J < E && Candidates.size() > 1; ++J) {
7080 if (Candidates.size() < 2)
7086 SmallVector<Value *, 16> Bundle(Candidates.size());
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h 482 unsigned size() const { return Impl.size(); }
tools/clang/lib/AST/CXXInheritance.cpp 46 NumDeclsFound = Decls.size();
tools/clang/lib/AST/VTableBuilder.cpp 2643 if (Bases.size() == 0)
tools/clang/lib/Basic/Module.cpp 381 for (unsigned I = 0, N = Imports.size(); I != N; ++I) {
tools/clang/lib/CodeGen/CodeGenModule.cpp 1965 for (unsigned I = Mod->Imports.size(); I > 0; --I) {
tools/clang/lib/CodeGen/MicrosoftCXXABI.cpp 4177 uint32_t NumEntries = CatchableTypes.size();
tools/clang/lib/Frontend/DependencyGraph.cpp 113 for (unsigned I = 0, N = AllFiles.size(); I != N; ++I) {
tools/clang/lib/Sema/SemaExprCXX.cpp 637 if (UuidAttrs.size() > 1)
660 if (UuidAttrs.size() > 1)
tools/clang/lib/Sema/SemaOverload.cpp12166 } else if (SuggestedNamespaces.size() == 1) {
tools/clang/lib/Sema/SemaStmt.cpp 1549 if (Decls.size() == 0) return;
1562 if (Decls.size() > 4) {
1565 PDiag << (unsigned)Decls.size();
tools/clang/lib/Serialization/ASTWriter.cpp 4407 for (unsigned I = 0, N = ObjCClassesWithCategories.size(); I != N; ++I) {
tools/clang/lib/Serialization/Module.cpp 51 for (unsigned I = 0, N = Imports.size(); I != N; ++I) {
tools/clang/lib/Serialization/ModuleManager.cpp 346 unsigned Size = M.ImportedBy.size();
tools/clang/unittests/AST/ASTImporterTest.cpp 4279 ASSERT_EQ(Res.size(), 1u);
4329 ASSERT_EQ(Res.size(), 1u);
4365 ASSERT_EQ(Res.size(), 1u);
4383 ASSERT_EQ(Res.size(), 1u);
4388 ASSERT_EQ(Res.size(), 1u);
4393 ASSERT_EQ(Res.size(), 1u);
4413 EXPECT_EQ(Res.size(), 3u);
4435 EXPECT_EQ(ResPlus.size(), 1u);
4440 EXPECT_EQ(ResMinus.size(), 1u);
4470 ASSERT_EQ(Res.size(), 1u);
4475 ASSERT_EQ(Res.size(), 0u);
4501 EXPECT_EQ(Res.size(), 1u);
4505 EXPECT_EQ(Res.size(), 0u);
4526 EXPECT_EQ(Res.size(), 1u);
4530 EXPECT_EQ(Res.size(), 0u);
4566 EXPECT_EQ(Res.size(), 2u);
4589 EXPECT_EQ(Res.size(), 2u);
4611 ASSERT_EQ(Res.size(), 3u);
4629 EXPECT_EQ(Res.size(), 1u);
4669 ASSERT_EQ(Res.size(), 1u);
4678 ASSERT_EQ(Res.size(), 1u);
4694 EXPECT_EQ(Res.size(), 2u);
4724 EXPECT_EQ(Res.size(), 1u);
4758 ASSERT_EQ(Res.size(), 1u);
4763 ASSERT_EQ(Res.size(), 1u);
4784 ASSERT_EQ(Res.size(), 1u);
tools/clang/utils/TableGen/NeonEmitter.cpp 1686 Elts.insert(Elts2.begin(), Elts2.begin() + (Elts2.size() / 2));
1696 Elts.insert(Elts2.begin() + (Elts2.size() / 2), Elts2.end());
1715 for (unsigned VI = 0; VI < Elts2.size(); VI += VectorSize) {
1773 if (Elts.size() > T.getNumElements()) {
1775 Elts.size() == T.getNumElements() * 2,
1778 } else if (Elts.size() < T.getNumElements()) {
1780 Elts.size() == T.getNumElements() / 2,
tools/llvm-extract/llvm-extract.cpp 322 for (size_t i = 0, e = GVs.size(); i != e; ++i)
tools/polly/include/polly/ScopInfo.h 2113 size_t getNumParams() const { return Parameters.size(); }
tools/polly/lib/Analysis/ScopDetection.cpp 350 NumScopRegions += ValidRegions.size();
369 NumProfScopRegions += ValidRegions.size();
379 assert(ValidRegions.size() <= DetectionContextMap.size() &&
1144 const unsigned int VariantSize = VariantLS.size(),
1145 InvariantSize = InvariantLS.size();
1166 if (InvariantSize == InvariantLS.size() &&
1167 VariantSize == VariantLS.size())
1614 int NumAffineLoops = NumLoops - Context.BoxedLoopsSet.size();
tools/polly/lib/Analysis/ScopInfo.cpp 2576 Result.NumBoxedLoops = getBoxedLoops().size();
tools/polly/lib/CodeGen/LoopGenerators.cpp 235 for (unsigned i = 0; i < Values.size(); i++) {
246 for (unsigned i = 0; i < OldValues.size(); i++) {
tools/polly/lib/Transform/Simplify.cpp 428 (!S->getBoxedLoops().size() && MA->getAccessInstruction() &&
unittests/ADT/SetVectorTest.cpp 29 EXPECT_EQ(2u, S.size());
utils/TableGen/AsmMatcherEmitter.cpp 1926 unsigned ID = IsNew ? Table.size() - 1 : find(Table, Name) - Table.begin();
1928 assert(ID < Table.size());
2051 unsigned KindID = OperandConversionKinds.size();
utils/TableGen/CodeGenRegisters.cpp 633 Length = std::min(Length, unsigned(Lists[i].size()));
2399 for (unsigned i = 0; i != Set.size(); ++i) {
2423 for (unsigned i = 0, e = Set.size(); i != e; ++i)