reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
235 NumHeaders = Nodes.size(); 236 Nodes.insert(Nodes.end(), FirstOther, LastOther); 236 Nodes.insert(Nodes.end(), FirstOther, LastOther); 242 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, 242 return std::binary_search(Nodes.begin(), Nodes.begin() + NumHeaders, 244 return Node == Nodes[0]; 247 BlockNode getHeader() const { return Nodes[0]; } 253 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - 253 return std::lower_bound(Nodes.begin(), Nodes.begin() + NumHeaders, B) - 254 Nodes.begin(); 259 return Nodes.begin() + NumHeaders; 262 NodeList::const_iterator members_end() const { return Nodes.end(); } 658 for (auto N : OuterLoop->Nodes) 1118 ContainingLoop->Nodes.push_back(Index); 1133 HeaderData.Loop->Nodes.push_back(Index); 1166 auto &HeaderNode = Loop.Nodes[H]; 1168 IsIrrLoopHeader.set(Loop.Nodes[H].Index); 1196 auto &HeaderNode = Loop.Nodes[H]; 1206 for (const BlockNode &M : Loop.Nodes)lib/Analysis/BlockFrequencyInfoImpl.cpp
404 for (const BlockNode &M : Loop.Nodes) { 510 for (const BlockNode &N : Loop.Nodes) { 632 Nodes.reserve(OuterLoop.Nodes.size()); 633 for (auto N : OuterLoop.Nodes) 766 for (const auto &N : Loop->Nodes) 798 auto O = OuterLoop.Nodes.begin() + 1; 799 for (auto I = O, E = OuterLoop.Nodes.end(); I != E; ++I) 802 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); 802 OuterLoop.Nodes.erase(O, OuterLoop.Nodes.end()); 819 auto &HeaderNode = Loop.Nodes[H];