Searched refs:HeaderNode (Results 1 – 8 of 8) sorted by relevance
41 BasicBlock *HeaderNode; variable47 inline Interval(BasicBlock *Header) : HeaderNode(Header) { in Interval()52 : HeaderNode(I.HeaderNode), Nodes(I.Nodes), Successors(I.Successors) {} in Interval()54 inline BasicBlock *getHeaderNode() const { return HeaderNode; } in getHeaderNode()94 return HeaderNode == I.HeaderNode;
41 BasicBlock *HeaderNode; variable47 inline Interval(BasicBlock *Header) : HeaderNode(Header) { in Interval()51 inline BasicBlock *getHeaderNode() const { return HeaderNode; } in getHeaderNode()93 return HeaderNode == I.HeaderNode;
32 for (::pred_iterator I = ::pred_begin(HeaderNode), E = ::pred_end(HeaderNode); in isLoop()
775 auto &HeaderNode = Loop.Nodes[H]; in adjustLoopHeaderMass() local776 auto &BackedgeMass = Loop.BackedgeMass[Loop.getHeaderIndex(HeaderNode)]; in adjustLoopHeaderMass()778 << getBlockName(HeaderNode) << ": " << BackedgeMass << "\n"); in adjustLoopHeaderMass()780 Dist.addLocal(HeaderNode, BackedgeMass.getMass()); in adjustLoopHeaderMass()
71 loop->depth(), loop_tree->HeaderNode(loop)->id(), in PeelOuterLoopsForOsr()72 loop_tree->HeaderNode(loop)->op()->mnemonic()); in PeelOuterLoopsForOsr()131 Node* loop_header = loop_tree->HeaderNode(loop); in PeelOuterLoopsForOsr()237 Node* loop_header = loop_tree->HeaderNode(outer); in PeelOuterLoopsForOsr()
99 Node* HeaderNode(Loop* loop);
519 Node* LoopTree::HeaderNode(Loop* loop) { in HeaderNode() function in v8::internal::compiler::LoopTree