OLD | NEW |
1 //===- subzero/src/IceCfgNode.h - Control flow graph node -------*- C++ -*-===// | 1 //===- subzero/src/IceCfgNode.h - Control flow graph node -------*- C++ -*-===// |
2 // | 2 // |
3 // The Subzero Code Generator | 3 // The Subzero Code Generator |
4 // | 4 // |
5 // This file is distributed under the University of Illinois Open Source | 5 // This file is distributed under the University of Illinois Open Source |
6 // License. See LICENSE.TXT for details. | 6 // License. See LICENSE.TXT for details. |
7 // | 7 // |
8 //===----------------------------------------------------------------------===// | 8 //===----------------------------------------------------------------------===// |
9 /// | 9 /// |
10 /// \file | 10 /// \file |
(...skipping 94 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
105 void doBranchOpt(const CfgNode *NextNode); | 105 void doBranchOpt(const CfgNode *NextNode); |
106 void emit(Cfg *Func) const; | 106 void emit(Cfg *Func) const; |
107 void emitIAS(Cfg *Func) const; | 107 void emitIAS(Cfg *Func) const; |
108 void dump(Cfg *Func) const; | 108 void dump(Cfg *Func) const; |
109 | 109 |
110 void profileExecutionCount(VariableDeclaration *Var); | 110 void profileExecutionCount(VariableDeclaration *Var); |
111 | 111 |
112 private: | 112 private: |
113 CfgNode(Cfg *Func, SizeT LabelIndex); | 113 CfgNode(Cfg *Func, SizeT LabelIndex); |
114 Cfg *const Func; | 114 Cfg *const Func; |
115 SizeT Number; /// label index | 115 SizeT Number; /// invariant: Func->Nodes[Number]==this |
| 116 const SizeT LabelNumber; /// persistent number for label generation |
116 Cfg::IdentifierIndexType NameIndex = | 117 Cfg::IdentifierIndexType NameIndex = |
117 Cfg::IdentifierIndexInvalid; /// index into Cfg::NodeNames table | 118 Cfg::IdentifierIndexInvalid; /// index into Cfg::NodeNames table |
118 SizeT LoopNestDepth = 0; /// the loop nest depth of this node | 119 SizeT LoopNestDepth = 0; /// the loop nest depth of this node |
119 bool HasReturn = false; /// does this block need an epilog? | 120 bool HasReturn = false; /// does this block need an epilog? |
120 bool NeedsPlacement = false; | 121 bool NeedsPlacement = false; |
121 bool NeedsAlignment = false; /// is sandboxing required? | 122 bool NeedsAlignment = false; /// is sandboxing required? |
122 InstNumberT InstCountEstimate = 0; /// rough instruction count estimate | 123 InstNumberT InstCountEstimate = 0; /// rough instruction count estimate |
123 NodeList InEdges; /// in no particular order | 124 NodeList InEdges; /// in no particular order |
124 NodeList OutEdges; /// in no particular order | 125 NodeList OutEdges; /// in no particular order |
125 PhiList Phis; /// unordered set of phi instructions | 126 PhiList Phis; /// unordered set of phi instructions |
126 InstList Insts; /// ordered list of non-phi instructions | 127 InstList Insts; /// ordered list of non-phi instructions |
127 }; | 128 }; |
128 | 129 |
129 } // end of namespace Ice | 130 } // end of namespace Ice |
130 | 131 |
131 #endif // SUBZERO_SRC_ICECFGNODE_H | 132 #endif // SUBZERO_SRC_ICECFGNODE_H |
OLD | NEW |