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 4685 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4696 // We don't want to add more than a certain number of nodes from inlining. | 4696 // We don't want to add more than a certain number of nodes from inlining. |
4697 if (FLAG_limit_inlining && inlined_count_ > kMaxInlinedNodes) { | 4697 if (FLAG_limit_inlining && inlined_count_ > kMaxInlinedNodes) { |
4698 TraceInline(target, caller, "cumulative AST node limit reached"); | 4698 TraceInline(target, caller, "cumulative AST node limit reached"); |
4699 return false; | 4699 return false; |
4700 } | 4700 } |
4701 | 4701 |
4702 int count_before = AstNode::Count(); | 4702 int count_before = AstNode::Count(); |
4703 | 4703 |
4704 // Parse and allocate variables. | 4704 // Parse and allocate variables. |
4705 CompilationInfo target_info(target); | 4705 CompilationInfo target_info(target); |
4706 if (!ParserApi::Parse(&target_info) || | 4706 if (!ParserApi::Parse(&target_info, kNoParsingFlags) || |
4707 !Scope::Analyze(&target_info)) { | 4707 !Scope::Analyze(&target_info)) { |
4708 if (target_info.isolate()->has_pending_exception()) { | 4708 if (target_info.isolate()->has_pending_exception()) { |
4709 // Parse or scope error, never optimize this function. | 4709 // Parse or scope error, never optimize this function. |
4710 SetStackOverflow(); | 4710 SetStackOverflow(); |
4711 target_shared->DisableOptimization(*target); | 4711 target_shared->DisableOptimization(*target); |
4712 } | 4712 } |
4713 TraceInline(target, caller, "parse failure"); | 4713 TraceInline(target, caller, "parse failure"); |
4714 return false; | 4714 return false; |
4715 } | 4715 } |
4716 | 4716 |
(...skipping 2435 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
7152 } | 7152 } |
7153 } | 7153 } |
7154 | 7154 |
7155 #ifdef DEBUG | 7155 #ifdef DEBUG |
7156 if (graph_ != NULL) graph_->Verify(false); // No full verify. | 7156 if (graph_ != NULL) graph_->Verify(false); // No full verify. |
7157 if (allocator_ != NULL) allocator_->Verify(); | 7157 if (allocator_ != NULL) allocator_->Verify(); |
7158 #endif | 7158 #endif |
7159 } | 7159 } |
7160 | 7160 |
7161 } } // namespace v8::internal | 7161 } } // namespace v8::internal |
OLD | NEW |