reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
219 LoopData *Parent; ///< The parent loop. 228 LoopData(LoopData *Parent, const BlockNode &Header) 232 LoopData(LoopData *Parent, It1 FirstHeader, It1 LastHeader, It2 FirstOther, 271 LoopData *Loop = nullptr; ///< The loop this block is inside. 283 LoopData *getContainingLoop() const { 309 LoopData *getPackagedLoop() const { 422 std::list<LoopData> Loops; 436 bool addLoopSuccessorsToDist(const LoopData *OuterLoop, LoopData &Loop, 436 bool addLoopSuccessorsToDist(const LoopData *OuterLoop, LoopData &Loop, 446 bool addToDist(Distribution &Dist, const LoopData *OuterLoop, 449 LoopData &getLoopPackage(const BlockNode &Head) { 462 iterator_range<std::list<LoopData>::iterator> 463 analyzeIrreducible(const bfi_detail::IrreducibleGraph &G, LoopData *OuterLoop, 464 std::list<LoopData>::iterator Insert); 472 void updateLoopWithIrreducible(LoopData &OuterLoop); 480 void distributeMass(const BlockNode &Source, LoopData *OuterLoop, 484 void computeLoopScale(LoopData &Loop); 494 void adjustLoopHeaderMass(LoopData &Loop); 499 void packageLoop(LoopData &Loop); 514 std::string getLoopName(const LoopData &Loop) const; 629 IrreducibleGraph(BFIBase &BFI, const BFIBase::LoopData *OuterLoop, 635 void initialize(const BFIBase::LoopData *OuterLoop, 637 void addNodesInLoop(const BFIBase::LoopData &OuterLoop); 647 void addEdges(const BlockNode &Node, const BFIBase::LoopData *OuterLoop, 650 const BFIBase::LoopData *OuterLoop); 654 void IrreducibleGraph::initialize(const BFIBase::LoopData *OuterLoop, 670 const BFIBase::LoopData *OuterLoop, 898 bool propagateMassToSuccessors(LoopData *OuterLoop, const BlockNode &Node); 908 bool computeMassInLoop(LoopData &Loop); 932 void computeIrreducibleMass(LoopData *OuterLoop, 933 std::list<LoopData>::iterator Insert); 1092 std::deque<std::pair<const LoopT *, LoopData *>> Q; 1097 LoopData *Parent = Q.front().second; 1116 LoopData *ContainingLoop = Working[Index].getContainingLoop(); 1154 bool BlockFrequencyInfoImpl<BT>::computeMassInLoop(LoopData &Loop) { 1261 using LoopData = BlockFrequencyInfoImplBase::LoopData; 1281 LoopData *OuterLoop, std::list<LoopData>::iterator Insert) { 1281 LoopData *OuterLoop, std::list<LoopData>::iterator Insert) { 1294 for (auto &L : analyzeIrreducible(G, OuterLoop, Insert)) 1309 BlockFrequencyInfoImpl<BT>::propagateMassToSuccessors(LoopData *OuterLoop, 1314 if (auto *Loop = Working[Node.Index].getPackagedLoop()) {lib/Analysis/BlockFrequencyInfoImpl.cpp
72 using LoopData = BlockFrequencyInfoImplBase::LoopData; 291 const LoopData *OuterLoop, 353 const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) { 353 const LoopData *OuterLoop, LoopData &Loop, Distribution &Dist) { 365 void BlockFrequencyInfoImplBase::computeLoopScale(LoopData &Loop) { 400 void BlockFrequencyInfoImplBase::packageLoop(LoopData &Loop) { 405 if (auto *Loop = Working[M.Index].getPackagedLoop()) 426 LoopData *OuterLoop, 526 for (LoopData &Loop : Loops) 611 BlockFrequencyInfoImplBase::getLoopName(const LoopData &Loop) const { 630 void IrreducibleGraph::addNodesInLoop(const BFIBase::LoopData &OuterLoop) { 652 const BFIBase::LoopData *OuterLoop) { 775 const IrreducibleGraph &G, LoopData *OuterLoop, 776 std::list<LoopData>::iterator Insert) { 794 BlockFrequencyInfoImplBase::updateLoopWithIrreducible(LoopData &OuterLoop) { 805 void BlockFrequencyInfoImplBase::adjustLoopHeaderMass(LoopData &Loop) {usr/include/c++/7.4.0/bits/alloc_traits.h
387 using allocator_type = allocator<_Tp>; 389 using value_type = _Tp; 392 using pointer = _Tp*; 395 using const_pointer = const _Tp*; 474 construct(allocator_type& __a, _Up* __p, _Args&&... __args) 486 destroy(allocator_type& __a, _Up* __p)usr/include/c++/7.4.0/bits/list.tcc
68 typedef _List_node<_Tp> _Node; 74 _Tp* __val = __tmp->_M_valptr();usr/include/c++/7.4.0/bits/stl_iterator_base_types.h
123 typedef _Tp value_type;
usr/include/c++/7.4.0/bits/stl_list.h112 __gnu_cxx::__aligned_membuf<_Tp> _M_storage; 113 _Tp* _M_valptr() { return _M_storage._M_ptr(); } 114 _Tp const* _M_valptr() const { return _M_storage._M_ptr(); } 130 typedef _List_iterator<_Tp> _Self; 131 typedef _List_node<_Tp> _Node; 135 typedef _Tp value_type; 136 typedef _Tp* pointer; 137 typedef _Tp& reference; 209 typedef _List_const_iterator<_Tp> _Self; 210 typedef const _List_node<_Tp> _Node; 211 typedef _List_iterator<_Tp> iterator; 215 typedef _Tp value_type; 216 typedef const _Tp* pointer; 217 typedef const _Tp& reference; 304 rebind<_Tp>::other _Tp_alloc_type; 307 rebind<_List_node<_Tp> >::other _Node_alloc_type; 503 class list : protected _List_base<_Tp, _Alloc> 514 typedef _List_base<_Tp, _Alloc> _Base; 521 typedef _Tp value_type; 526 typedef _List_iterator<_Tp> iterator; 527 typedef _List_const_iterator<_Tp> const_iterator; 537 typedef _List_node<_Tp> _Node; 1587 remove(const _Tp& __value);usr/include/c++/7.4.0/ext/aligned_buffer.h
52 struct _Tp2 { _Tp _M_t; }; 54 alignas(__alignof__(_Tp2::_M_t)) unsigned char _M_storage[sizeof(_Tp)]; 69 _Tp* 73 const _Tp*usr/include/c++/7.4.0/ext/alloc_traits.h
117 { typedef typename _Base_type::template rebind_alloc<_Tp> other; };
usr/include/c++/7.4.0/ext/new_allocator.h135 construct(_Up* __p, _Args&&... __args) 136 { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } 140 destroy(_Up* __p) { __p->~_Up(); }