41                                       HBasicBlock* block) {  in AddToListForLinearization()  argument
42   HLoopInformation* block_loop = block->GetLoopInformation();  in AddToListForLinearization()
54   worklist->insert(insert_pos.base(), block);  in AddToListForLinearization()
66     for (HBasicBlock* block : linear_order) {  in IsLinearOrderWellFormed()
67       if (loop->Contains(*block)) {  in IsLinearOrderWellFormed()
69         if (found_blocks == 1u && block != header) {  in IsLinearOrderWellFormed()
72         } else if (found_blocks == num_blocks && !loop->IsBackEdge(*block)) {  in IsLinearOrderWellFormed()
100   for (HBasicBlock* block : graph->GetReversePostOrder()) {  in LinearizeGraphInternal()
101     size_t number_of_forward_predecessors = block->GetPredecessors().size();  in LinearizeGraphInternal()
102     if (block->IsLoopHeader()) {  in LinearizeGraphInternal()
103       number_of_forward_predecessors -= block->GetLoopInformation()->NumberOfBackEdges();  in LinearizeGraphInternal()
105     forward_predecessors[block->GetBlockId()] = number_of_forward_predecessors;  in LinearizeGraphInternal()