OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 196 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
207 HGraph* graph() const { return graph_; } | 207 HGraph* graph() const { return graph_; } |
208 HEnvironment* environment() const { | 208 HEnvironment* environment() const { |
209 ASSERT(HasExit()); | 209 ASSERT(HasExit()); |
210 return exit_block_->last_environment(); | 210 return exit_block_->last_environment(); |
211 } | 211 } |
212 | 212 |
213 bool HasExit() const { return exit_block_ != NULL; } | 213 bool HasExit() const { return exit_block_ != NULL; } |
214 | 214 |
215 void PreProcessOsrEntry(IterationStatement* statement); | 215 void PreProcessOsrEntry(IterationStatement* statement); |
216 | 216 |
217 void AppendOptional(HSubgraph* graph, | |
218 bool on_true_branch, | |
219 HValue* boolean_value); | |
220 void AppendJoin(HSubgraph* then_graph, HSubgraph* else_graph, AstNode* node); | 217 void AppendJoin(HSubgraph* then_graph, HSubgraph* else_graph, AstNode* node); |
221 void AppendWhile(HSubgraph* condition, | 218 void AppendWhile(HSubgraph* condition, |
222 HSubgraph* body, | 219 HSubgraph* body, |
223 IterationStatement* statement, | 220 IterationStatement* statement, |
224 HSubgraph* continue_subgraph, | 221 HSubgraph* continue_subgraph, |
225 HSubgraph* exit); | 222 HSubgraph* exit); |
226 void AppendDoWhile(HSubgraph* body, | 223 void AppendDoWhile(HSubgraph* body, |
227 IterationStatement* statement, | 224 IterationStatement* statement, |
228 HSubgraph* go_back, | 225 HSubgraph* go_back, |
229 HSubgraph* exit); | 226 HSubgraph* exit); |
(...skipping 836 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1066 const char* filename_; | 1063 const char* filename_; |
1067 HeapStringAllocator string_allocator_; | 1064 HeapStringAllocator string_allocator_; |
1068 StringStream trace_; | 1065 StringStream trace_; |
1069 int indent_; | 1066 int indent_; |
1070 }; | 1067 }; |
1071 | 1068 |
1072 | 1069 |
1073 } } // namespace v8::internal | 1070 } } // namespace v8::internal |
1074 | 1071 |
1075 #endif // V8_HYDROGEN_H_ | 1072 #endif // V8_HYDROGEN_H_ |
OLD | NEW |