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 192 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
203 HGraph* graph() const { return graph_; } | 203 HGraph* graph() const { return graph_; } |
204 HEnvironment* environment() const { | 204 HEnvironment* environment() const { |
205 ASSERT(HasExit()); | 205 ASSERT(HasExit()); |
206 return exit_block_->last_environment(); | 206 return exit_block_->last_environment(); |
207 } | 207 } |
208 | 208 |
209 bool HasExit() const { return exit_block_ != NULL; } | 209 bool HasExit() const { return exit_block_ != NULL; } |
210 | 210 |
211 void PreProcessOsrEntry(IterationStatement* statement); | 211 void PreProcessOsrEntry(IterationStatement* statement); |
212 | 212 |
213 void AppendOptional(HSubgraph* graph, | |
214 bool on_true_branch, | |
215 HValue* boolean_value); | |
216 void AppendJoin(HSubgraph* then_graph, HSubgraph* else_graph, AstNode* node); | 213 void AppendJoin(HSubgraph* then_graph, HSubgraph* else_graph, AstNode* node); |
217 void AppendWhile(HSubgraph* condition, | 214 void AppendWhile(HSubgraph* condition, |
218 HSubgraph* body, | 215 HSubgraph* body, |
219 IterationStatement* statement, | 216 IterationStatement* statement, |
220 HSubgraph* continue_subgraph, | 217 HSubgraph* continue_subgraph, |
221 HSubgraph* exit); | 218 HSubgraph* exit); |
222 void AppendDoWhile(HSubgraph* body, | 219 void AppendDoWhile(HSubgraph* body, |
223 IterationStatement* statement, | 220 IterationStatement* statement, |
224 HSubgraph* go_back, | 221 HSubgraph* go_back, |
225 HSubgraph* exit); | 222 HSubgraph* exit); |
(...skipping 845 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1071 const char* filename_; | 1068 const char* filename_; |
1072 HeapStringAllocator string_allocator_; | 1069 HeapStringAllocator string_allocator_; |
1073 StringStream trace_; | 1070 StringStream trace_; |
1074 int indent_; | 1071 int indent_; |
1075 }; | 1072 }; |
1076 | 1073 |
1077 | 1074 |
1078 } } // namespace v8::internal | 1075 } } // namespace v8::internal |
1079 | 1076 |
1080 #endif // V8_HYDROGEN_H_ | 1077 #endif // V8_HYDROGEN_H_ |
OLD | NEW |