OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 82 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
93 } | 93 } |
94 | 94 |
95 | 95 |
96 void AstOptimizer::VisitLoopStatement(LoopStatement* node) { | 96 void AstOptimizer::VisitLoopStatement(LoopStatement* node) { |
97 if (node->init() != NULL) { | 97 if (node->init() != NULL) { |
98 Visit(node->init()); | 98 Visit(node->init()); |
99 } | 99 } |
100 if (node->cond() != NULL) { | 100 if (node->cond() != NULL) { |
101 has_function_literal_ = false; | 101 has_function_literal_ = false; |
102 Visit(node->cond()); | 102 Visit(node->cond()); |
103 node->has_function_literal_ = has_function_literal_; | 103 node->may_have_function_literal_ = has_function_literal_; |
104 } | 104 } |
105 if (node->body() != NULL) { | 105 if (node->body() != NULL) { |
106 Visit(node->body()); | 106 Visit(node->body()); |
107 } | 107 } |
108 if (node->next() != NULL) { | 108 if (node->next() != NULL) { |
109 Visit(node->next()); | 109 Visit(node->next()); |
110 } | 110 } |
111 } | 111 } |
112 | 112 |
113 | 113 |
(...skipping 687 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
801 if (optimizer.HasStackOverflow()) { | 801 if (optimizer.HasStackOverflow()) { |
802 return false; | 802 return false; |
803 } | 803 } |
804 } | 804 } |
805 } | 805 } |
806 return true; | 806 return true; |
807 } | 807 } |
808 | 808 |
809 | 809 |
810 } } // namespace v8::internal | 810 } } // namespace v8::internal |
OLD | NEW |