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 1125 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1136 DONT_OPTIMIZE_NODE(ExportDeclaration) | 1136 DONT_OPTIMIZE_NODE(ExportDeclaration) |
1137 DONT_OPTIMIZE_NODE(ModuleVariable) | 1137 DONT_OPTIMIZE_NODE(ModuleVariable) |
1138 DONT_OPTIMIZE_NODE(ModulePath) | 1138 DONT_OPTIMIZE_NODE(ModulePath) |
1139 DONT_OPTIMIZE_NODE(ModuleUrl) | 1139 DONT_OPTIMIZE_NODE(ModuleUrl) |
1140 DONT_OPTIMIZE_NODE(ModuleStatement) | 1140 DONT_OPTIMIZE_NODE(ModuleStatement) |
1141 DONT_OPTIMIZE_NODE(Yield) | 1141 DONT_OPTIMIZE_NODE(Yield) |
1142 DONT_OPTIMIZE_NODE(WithStatement) | 1142 DONT_OPTIMIZE_NODE(WithStatement) |
1143 DONT_OPTIMIZE_NODE(TryCatchStatement) | 1143 DONT_OPTIMIZE_NODE(TryCatchStatement) |
1144 DONT_OPTIMIZE_NODE(TryFinallyStatement) | 1144 DONT_OPTIMIZE_NODE(TryFinallyStatement) |
1145 DONT_OPTIMIZE_NODE(DebuggerStatement) | 1145 DONT_OPTIMIZE_NODE(DebuggerStatement) |
1146 DONT_OPTIMIZE_NODE(NativeFunctionLiteral) | 1146 DONT_OPTIMIZE_NODE(SharedFunctionInfoLiteral) |
1147 | 1147 |
1148 DONT_SELFOPTIMIZE_NODE(DoWhileStatement) | 1148 DONT_SELFOPTIMIZE_NODE(DoWhileStatement) |
1149 DONT_SELFOPTIMIZE_NODE(WhileStatement) | 1149 DONT_SELFOPTIMIZE_NODE(WhileStatement) |
1150 DONT_SELFOPTIMIZE_NODE(ForStatement) | 1150 DONT_SELFOPTIMIZE_NODE(ForStatement) |
1151 DONT_SELFOPTIMIZE_NODE(ForInStatement) | 1151 DONT_SELFOPTIMIZE_NODE(ForInStatement) |
1152 DONT_SELFOPTIMIZE_NODE(ForOfStatement) | 1152 DONT_SELFOPTIMIZE_NODE(ForOfStatement) |
1153 | 1153 |
1154 DONT_CACHE_NODE(ModuleLiteral) | 1154 DONT_CACHE_NODE(ModuleLiteral) |
1155 | 1155 |
1156 void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) { | 1156 void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) { |
(...skipping 30 matching lines...) Expand all Loading... |
1187 OS::SNPrintF(buffer, "%d", Smi::cast(*value_)->value()); | 1187 OS::SNPrintF(buffer, "%d", Smi::cast(*value_)->value()); |
1188 str = arr; | 1188 str = arr; |
1189 } else { | 1189 } else { |
1190 str = DoubleToCString(value_->Number(), buffer); | 1190 str = DoubleToCString(value_->Number(), buffer); |
1191 } | 1191 } |
1192 return isolate_->factory()->NewStringFromAscii(CStrVector(str)); | 1192 return isolate_->factory()->NewStringFromAscii(CStrVector(str)); |
1193 } | 1193 } |
1194 | 1194 |
1195 | 1195 |
1196 } } // namespace v8::internal | 1196 } } // namespace v8::internal |
OLD | NEW |