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 365 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
376 Visit(node->key()); | 376 Visit(node->key()); |
377 } | 377 } |
378 | 378 |
379 | 379 |
380 void AstOptimizer::VisitCall(Call* node) { | 380 void AstOptimizer::VisitCall(Call* node) { |
381 Visit(node->expression()); | 381 Visit(node->expression()); |
382 OptimizeArguments(node->arguments()); | 382 OptimizeArguments(node->arguments()); |
383 } | 383 } |
384 | 384 |
385 | 385 |
386 void AstOptimizer::VisitCallEval(CallEval* node) { | |
387 Visit(node->expression()); | |
388 OptimizeArguments(node->arguments()); | |
389 } | |
390 | |
391 | |
392 void AstOptimizer::VisitCallNew(CallNew* node) { | 386 void AstOptimizer::VisitCallNew(CallNew* node) { |
393 Visit(node->expression()); | 387 Visit(node->expression()); |
394 OptimizeArguments(node->arguments()); | 388 OptimizeArguments(node->arguments()); |
395 } | 389 } |
396 | 390 |
397 | 391 |
398 void AstOptimizer::VisitCallRuntime(CallRuntime* node) { | 392 void AstOptimizer::VisitCallRuntime(CallRuntime* node) { |
399 ScopedFuncNameInferrer scoped_fni(&func_name_inferrer_); | 393 ScopedFuncNameInferrer scoped_fni(&func_name_inferrer_); |
400 if (Factory::InitializeVarGlobal_symbol()->Equals(*node->name()) && | 394 if (Factory::InitializeVarGlobal_symbol()->Equals(*node->name()) && |
401 node->arguments()->length() >= 2 && | 395 node->arguments()->length() >= 2 && |
(...skipping 350 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
752 UNREACHABLE(); | 746 UNREACHABLE(); |
753 } | 747 } |
754 | 748 |
755 | 749 |
756 void Processor::VisitCall(Call* node) { | 750 void Processor::VisitCall(Call* node) { |
757 USE(node); | 751 USE(node); |
758 UNREACHABLE(); | 752 UNREACHABLE(); |
759 } | 753 } |
760 | 754 |
761 | 755 |
762 void Processor::VisitCallEval(CallEval* node) { | |
763 USE(node); | |
764 UNREACHABLE(); | |
765 } | |
766 | |
767 | |
768 void Processor::VisitCallNew(CallNew* node) { | 756 void Processor::VisitCallNew(CallNew* node) { |
769 USE(node); | 757 USE(node); |
770 UNREACHABLE(); | 758 UNREACHABLE(); |
771 } | 759 } |
772 | 760 |
773 | 761 |
774 void Processor::VisitCallRuntime(CallRuntime* node) { | 762 void Processor::VisitCallRuntime(CallRuntime* node) { |
775 USE(node); | 763 USE(node); |
776 UNREACHABLE(); | 764 UNREACHABLE(); |
777 } | 765 } |
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
834 optimizer.Optimize(body); | 822 optimizer.Optimize(body); |
835 if (optimizer.HasStackOverflow()) { | 823 if (optimizer.HasStackOverflow()) { |
836 return false; | 824 return false; |
837 } | 825 } |
838 } | 826 } |
839 return true; | 827 return true; |
840 } | 828 } |
841 | 829 |
842 | 830 |
843 } } // namespace v8::internal | 831 } } // namespace v8::internal |
OLD | NEW |