reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
190 bool operator==(const BlockNode &X) const { return Index == X.Index; } 190 bool operator==(const BlockNode &X) const { return Index == X.Index; } 191 bool operator!=(const BlockNode &X) const { return Index != X.Index; } 191 bool operator!=(const BlockNode &X) const { return Index != X.Index; } 192 bool operator<=(const BlockNode &X) const { return Index <= X.Index; } 192 bool operator<=(const BlockNode &X) const { return Index <= X.Index; } 193 bool operator>=(const BlockNode &X) const { return Index >= X.Index; } 193 bool operator>=(const BlockNode &X) const { return Index >= X.Index; } 194 bool operator<(const BlockNode &X) const { return Index < X.Index; } 194 bool operator<(const BlockNode &X) const { return Index < X.Index; } 195 bool operator>(const BlockNode &X) const { return Index > X.Index; } 195 bool operator>(const BlockNode &X) const { return Index > X.Index; } 197 bool isValid() const { return Index <= getMaxIndex(); } 450 assert(Head.Index < Working.size()); 451 assert(Working[Head.Index].isLoopHeader()); 452 return *Working[Head.Index].Loop; 642 BFI.Working[Node.Index].getMass() = BlockMass::getEmpty(); 665 StartIrr = Lookup[Start.Index]; 672 auto L = Lookup.find(Node.Index); 676 const auto &Working = BFI.Working[Node.Index]; 874 assert(Node.Index < RPOT.size()); 875 return RPOT[Node.Index]; 1104 Working[Header.Index].Loop = &Loops.back(); 1129 const auto &HeaderData = Working[Header.Index]; 1168 IsIrrLoopHeader.set(Loop.Nodes[H].Index); 1213 Working[Loop.getHeader().Index].getMass() = BlockMass::getFull(); 1238 if (Working[Node.Index].isPackaged()) 1271 const BlockT *BB = BFI.RPOT[Irr.Node.Index]; 1314 if (auto *Loop = Working[Node.Index].getPackagedLoop()) {lib/Analysis/BlockFrequencyInfoImpl.cpp
183 combineWeight(Combined[W.TargetNode.Index], W); 302 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); 323 if (Working[Resolved.Index].getContainingLoop() != OuterLoop) { 405 if (auto *Loop = Working[M.Index].getPackagedLoop()) 407 LLVM_DEBUG(dbgs() << " - node: " << getBlockName(M.Index) << "\n"); 428 BlockMass Mass = Working[Source.Index].getMass(); 438 Working[W.TargetNode.Index].getMass() += Taken; 511 const auto &Working = BFI.Working[N.Index]; 513 : BFI.Freqs[N.Index].Scaled; 555 return Freqs[Node.Index].Integer; 588 return IsIrrLoopHeader.test(Node.Index); 595 return Freqs[Node.Index].Scaled; 601 assert(Node.Index < Freqs.size() && "Expected legal index"); 602 Freqs[Node.Index].Integer = Freq; 648 Lookup[I.Node.Index] = &I; 655 auto L = Lookup.find(Succ.Index); 767 if (BFI.Working[N.Index].isLoopHeader()) 768 BFI.Working[N.Index].Loop->Parent = &*Loop; 770 BFI.Working[N.Index].Loop = &*Loop; 800 if (!Working[I->Index].isPackaged()) 837 Working[W.TargetNode.Index].getMass() = Taken; 848 Working[W.TargetNode.Index].getMass() = Taken;lib/Transforms/Utils/CodeExtractor.cpp
1376 BranchWeights[Weight.TargetNode.Index] = Weight.Amount; 1378 BPI->setEdgeProbability(CodeReplacer, Weight.TargetNode.Index, BP);