Lines Matching refs:block
41 HBasicBlock* block) {
42 HLoopInformation* block_loop = block->GetLoopInformation();
50 // The block can be processed immediately.
54 worklist->insert(insert_pos.base(), block);
66 for (HBasicBlock* block : linear_order) {
67 if (loop->Contains(*block)) {
69 if (found_blocks == 1u && block != header) {
70 // First block is not the header.
72 } else if (found_blocks == num_blocks && !loop->IsBackEdge(*block)) {
73 // Last block is not a back edge.
90 // - Back-edge is the last block before loop exits.
92 // (1): Record the number of forward predecessors for each block. This is to
100 for (HBasicBlock* block : graph->GetReversePostOrder()) {
101 size_t number_of_forward_predecessors = block->GetPredecessors().size();
102 if (block->IsLoopHeader()) {
103 number_of_forward_predecessors -= block->GetLoopInformation()->NumberOfBackEdges();
105 forward_predecessors[block->GetBlockId()] = number_of_forward_predecessors;
107 // (2): Following a worklist approach, first start with the entry block, and
109 // successor block are visited, the successor block is added in the worklist
