| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 992 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1003 INCREASE_NODE_COUNT(Block) | 1003 INCREASE_NODE_COUNT(Block) |
| 1004 INCREASE_NODE_COUNT(ExpressionStatement) | 1004 INCREASE_NODE_COUNT(ExpressionStatement) |
| 1005 INCREASE_NODE_COUNT(EmptyStatement) | 1005 INCREASE_NODE_COUNT(EmptyStatement) |
| 1006 INCREASE_NODE_COUNT(IfStatement) | 1006 INCREASE_NODE_COUNT(IfStatement) |
| 1007 INCREASE_NODE_COUNT(ContinueStatement) | 1007 INCREASE_NODE_COUNT(ContinueStatement) |
| 1008 INCREASE_NODE_COUNT(BreakStatement) | 1008 INCREASE_NODE_COUNT(BreakStatement) |
| 1009 INCREASE_NODE_COUNT(ReturnStatement) | 1009 INCREASE_NODE_COUNT(ReturnStatement) |
| 1010 INCREASE_NODE_COUNT(Conditional) | 1010 INCREASE_NODE_COUNT(Conditional) |
| 1011 INCREASE_NODE_COUNT(Literal) | 1011 INCREASE_NODE_COUNT(Literal) |
| 1012 INCREASE_NODE_COUNT(ObjectLiteral) | 1012 INCREASE_NODE_COUNT(ObjectLiteral) |
| 1013 INCREASE_NODE_COUNT(FunctionLiteral) |
| 1013 INCREASE_NODE_COUNT(Assignment) | 1014 INCREASE_NODE_COUNT(Assignment) |
| 1014 INCREASE_NODE_COUNT(Throw) | 1015 INCREASE_NODE_COUNT(Throw) |
| 1015 INCREASE_NODE_COUNT(Property) | 1016 INCREASE_NODE_COUNT(Property) |
| 1016 INCREASE_NODE_COUNT(UnaryOperation) | 1017 INCREASE_NODE_COUNT(UnaryOperation) |
| 1017 INCREASE_NODE_COUNT(CountOperation) | 1018 INCREASE_NODE_COUNT(CountOperation) |
| 1018 INCREASE_NODE_COUNT(BinaryOperation) | 1019 INCREASE_NODE_COUNT(BinaryOperation) |
| 1019 INCREASE_NODE_COUNT(CompareOperation) | 1020 INCREASE_NODE_COUNT(CompareOperation) |
| 1020 INCREASE_NODE_COUNT(ThisFunction) | 1021 INCREASE_NODE_COUNT(ThisFunction) |
| 1021 INCREASE_NODE_COUNT(Call) | 1022 INCREASE_NODE_COUNT(Call) |
| 1022 INCREASE_NODE_COUNT(CallNew) | 1023 INCREASE_NODE_COUNT(CallNew) |
| (...skipping 55 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1078 } | 1079 } |
| 1079 | 1080 |
| 1080 | 1081 |
| 1081 void AstConstructionVisitor::VisitDebuggerStatement(DebuggerStatement* node) { | 1082 void AstConstructionVisitor::VisitDebuggerStatement(DebuggerStatement* node) { |
| 1082 increase_node_count(); | 1083 increase_node_count(); |
| 1083 add_flag(kDontOptimize); | 1084 add_flag(kDontOptimize); |
| 1084 add_flag(kDontInline); | 1085 add_flag(kDontInline); |
| 1085 } | 1086 } |
| 1086 | 1087 |
| 1087 | 1088 |
| 1088 void AstConstructionVisitor::VisitFunctionLiteral(FunctionLiteral* node) { | |
| 1089 increase_node_count(); | |
| 1090 add_flag(kDontInline); | |
| 1091 } | |
| 1092 | |
| 1093 | |
| 1094 void AstConstructionVisitor::VisitSharedFunctionInfoLiteral( | 1089 void AstConstructionVisitor::VisitSharedFunctionInfoLiteral( |
| 1095 SharedFunctionInfoLiteral* node) { | 1090 SharedFunctionInfoLiteral* node) { |
| 1096 increase_node_count(); | 1091 increase_node_count(); |
| 1097 add_flag(kDontOptimize); | 1092 add_flag(kDontOptimize); |
| 1098 add_flag(kDontInline); | 1093 add_flag(kDontInline); |
| 1099 } | 1094 } |
| 1100 | 1095 |
| 1101 | 1096 |
| 1102 void AstConstructionVisitor::VisitVariableProxy(VariableProxy* node) { | 1097 void AstConstructionVisitor::VisitVariableProxy(VariableProxy* node) { |
| 1103 increase_node_count(); | 1098 increase_node_count(); |
| (...skipping 27 matching lines...) Expand all Loading... |
| 1131 (node->name()->IsEqualTo(CStrVector("_ArgumentsLength")) || | 1126 (node->name()->IsEqualTo(CStrVector("_ArgumentsLength")) || |
| 1132 node->name()->IsEqualTo(CStrVector("_Arguments")))) { | 1127 node->name()->IsEqualTo(CStrVector("_Arguments")))) { |
| 1133 // Don't inline the %_ArgumentsLength or %_Arguments because their | 1128 // Don't inline the %_ArgumentsLength or %_Arguments because their |
| 1134 // implementation will not work. There is no stack frame to get them | 1129 // implementation will not work. There is no stack frame to get them |
| 1135 // from. | 1130 // from. |
| 1136 add_flag(kDontInline); | 1131 add_flag(kDontInline); |
| 1137 } | 1132 } |
| 1138 } | 1133 } |
| 1139 | 1134 |
| 1140 } } // namespace v8::internal | 1135 } } // namespace v8::internal |
| OLD | NEW |