Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 96 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 107 bool IsStartBlock() const { return block_id() == 0; } | 107 bool IsStartBlock() const { return block_id() == 0; } |
| 108 void PostProcessLoopHeader(IterationStatement* stmt); | 108 void PostProcessLoopHeader(IterationStatement* stmt); |
| 109 | 109 |
| 110 bool IsFinished() const { return end_ != NULL; } | 110 bool IsFinished() const { return end_ != NULL; } |
| 111 void AddPhi(HPhi* phi); | 111 void AddPhi(HPhi* phi); |
| 112 void RemovePhi(HPhi* phi); | 112 void RemovePhi(HPhi* phi); |
| 113 void AddInstruction(HInstruction* instr, int position); | 113 void AddInstruction(HInstruction* instr, int position); |
| 114 bool Dominates(HBasicBlock* other) const; | 114 bool Dominates(HBasicBlock* other) const; |
| 115 int LoopNestingDepth() const; | 115 int LoopNestingDepth() const; |
| 116 | 116 |
| 117 void ReplaceControlWithGotoSuccessor(int succ); | |
| 118 | |
| 117 void SetInitialEnvironment(HEnvironment* env); | 119 void SetInitialEnvironment(HEnvironment* env); |
| 118 void ClearEnvironment() { | 120 void ClearEnvironment() { |
| 119 ASSERT(IsFinished()); | 121 ASSERT(IsFinished()); |
| 120 ASSERT(end()->SuccessorCount() == 0); | 122 ASSERT(end()->SuccessorCount() == 0); |
| 121 last_environment_ = NULL; | 123 last_environment_ = NULL; |
| 122 } | 124 } |
| 123 bool HasEnvironment() const { return last_environment_ != NULL; } | 125 bool HasEnvironment() const { return last_environment_ != NULL; } |
| 124 void UpdateEnvironment(HEnvironment* env); | 126 void UpdateEnvironment(HEnvironment* env); |
| 125 HBasicBlock* parent_loop_header() const { return parent_loop_header_; } | 127 HBasicBlock* parent_loop_header() const { return parent_loop_header_; } |
| 126 | 128 |
| (...skipping 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 158 } | 160 } |
| 159 HBasicBlock* inlined_entry_block() { return inlined_entry_block_; } | 161 HBasicBlock* inlined_entry_block() { return inlined_entry_block_; } |
| 160 | 162 |
| 161 bool IsDeoptimizing() const { | 163 bool IsDeoptimizing() const { |
| 162 return end() != NULL && end()->IsDeoptimize(); | 164 return end() != NULL && end()->IsDeoptimize(); |
| 163 } | 165 } |
| 164 | 166 |
| 165 void MarkUnreachable(); | 167 void MarkUnreachable(); |
| 166 bool IsUnreachable() const { return !is_reachable_; } | 168 bool IsUnreachable() const { return !is_reachable_; } |
| 167 bool IsReachable() const { return is_reachable_; } | 169 bool IsReachable() const { return is_reachable_; } |
| 170 void MarkSuccEdgeUnreachable(int succ); | |
|
titzer
2014/01/13 17:26:56
I think you can make this private.
Igor Sheludko
2014/01/14 10:41:36
Done.
| |
| 168 | 171 |
| 169 bool IsLoopSuccessorDominator() const { | 172 bool IsLoopSuccessorDominator() const { |
| 170 return dominates_loop_successors_; | 173 return dominates_loop_successors_; |
| 171 } | 174 } |
| 172 void MarkAsLoopSuccessorDominator() { | 175 void MarkAsLoopSuccessorDominator() { |
| 173 dominates_loop_successors_ = true; | 176 dominates_loop_successors_ = true; |
| 174 } | 177 } |
| 175 | 178 |
| 176 inline Zone* zone() const; | 179 inline Zone* zone() const; |
| 177 | 180 |
| (...skipping 2512 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2690 } | 2693 } |
| 2691 | 2694 |
| 2692 private: | 2695 private: |
| 2693 HGraphBuilder* builder_; | 2696 HGraphBuilder* builder_; |
| 2694 }; | 2697 }; |
| 2695 | 2698 |
| 2696 | 2699 |
| 2697 } } // namespace v8::internal | 2700 } } // namespace v8::internal |
| 2698 | 2701 |
| 2699 #endif // V8_HYDROGEN_H_ | 2702 #endif // V8_HYDROGEN_H_ |
| OLD | NEW |