Lines Matching defs:header
40 Node* header;
50 // loop header and the backedges of the loop. Graphs in the soup of nodes can
54 // phis are treated together as a set referred to here as the loop header.
60 // marks on edges into/out-of the loop header nodes.
61 // Note: this algorithm assumes there are no unreachable loop header nodes
110 PrintF("Loop %d headed at #%d\n", i, li.header->id());
322 SetForwardMark(li.header, LoopNum(li.header));
323 Queue(li.header);
446 // Place nodes into the loop header and body.
466 // Recursively serialize the list of header nodes and body nodes
472 // Serialize the header.
504 NodeInfo& ni = info(li.header);
654 // The loop header is allowed to point outside the loop.
715 Node* header = NodeProperties::GetControlInput(first);
716 DCHECK_EQ(IrOpcode::kLoop, header->opcode());
717 return header;