1 /* 2 * Copyright (C) 2016 The Android Open Source Project 3 * 4 * Licensed under the Apache License, Version 2.0 (the "License"); 5 * you may not use this file except in compliance with the License. 6 * You may obtain a copy of the License at 7 * 8 * http://www.apache.org/licenses/LICENSE-2.0 9 * 10 * Unless required by applicable law or agreed to in writing, software 11 * distributed under the License is distributed on an "AS IS" BASIS, 12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 13 * See the License for the specific language governing permissions and 14 * limitations under the License. 15 */ 16 17 #ifndef ART_COMPILER_OPTIMIZING_LINEAR_ORDER_H_ 18 #define ART_COMPILER_OPTIMIZING_LINEAR_ORDER_H_ 19 20 #include "nodes.h" 21 22 namespace art { 23 24 // Linearizes the 'graph' such that: 25 // (1): a block is always after its dominator, 26 // (2): blocks of loops are contiguous. 27 // 28 // Storage is obtained through 'allocator' and the linear order it computed 29 // into 'linear_order'. Once computed, iteration can be expressed as: 30 // 31 // for (HBasicBlock* block : linear_order) // linear order 32 // 33 // for (HBasicBlock* block : ReverseRange(linear_order)) // linear post order 34 // 35 void LinearizeGraph(const HGraph* graph, 36 ArenaAllocator* allocator, 37 ArenaVector<HBasicBlock*>* linear_order); 38 39 } // namespace art 40 41 #endif // ART_COMPILER_OPTIMIZING_LINEAR_ORDER_H_ 42