| 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 1138 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1149 DONT_OPTIMIZE_NODE(WithStatement) | 1149 DONT_OPTIMIZE_NODE(WithStatement) |
| 1150 DONT_OPTIMIZE_NODE(TryCatchStatement) | 1150 DONT_OPTIMIZE_NODE(TryCatchStatement) |
| 1151 DONT_OPTIMIZE_NODE(TryFinallyStatement) | 1151 DONT_OPTIMIZE_NODE(TryFinallyStatement) |
| 1152 DONT_OPTIMIZE_NODE(DebuggerStatement) | 1152 DONT_OPTIMIZE_NODE(DebuggerStatement) |
| 1153 DONT_OPTIMIZE_NODE(SharedFunctionInfoLiteral) | 1153 DONT_OPTIMIZE_NODE(SharedFunctionInfoLiteral) |
| 1154 | 1154 |
| 1155 DONT_SELFOPTIMIZE_NODE(DoWhileStatement) | 1155 DONT_SELFOPTIMIZE_NODE(DoWhileStatement) |
| 1156 DONT_SELFOPTIMIZE_NODE(WhileStatement) | 1156 DONT_SELFOPTIMIZE_NODE(WhileStatement) |
| 1157 DONT_SELFOPTIMIZE_NODE(ForStatement) | 1157 DONT_SELFOPTIMIZE_NODE(ForStatement) |
| 1158 DONT_SELFOPTIMIZE_NODE(ForInStatement) | 1158 DONT_SELFOPTIMIZE_NODE(ForInStatement) |
| 1159 DONT_SELFOPTIMIZE_NODE(ForOfStatement) |
| 1159 | 1160 |
| 1160 DONT_CACHE_NODE(ModuleLiteral) | 1161 DONT_CACHE_NODE(ModuleLiteral) |
| 1161 | 1162 |
| 1162 void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) { | 1163 void AstConstructionVisitor::VisitCallRuntime(CallRuntime* node) { |
| 1163 increase_node_count(); | 1164 increase_node_count(); |
| 1164 if (node->is_jsruntime()) { | 1165 if (node->is_jsruntime()) { |
| 1165 // Don't try to inline JS runtime calls because we don't (currently) even | 1166 // Don't try to inline JS runtime calls because we don't (currently) even |
| 1166 // optimize them. | 1167 // optimize them. |
| 1167 add_flag(kDontInline); | 1168 add_flag(kDontInline); |
| 1168 } else if (node->function()->intrinsic_type == Runtime::INLINE && | 1169 } else if (node->function()->intrinsic_type == Runtime::INLINE && |
| (...skipping 25 matching lines...) Expand all Loading... |
| 1194 OS::SNPrintF(buffer, "%d", Smi::cast(*handle_)->value()); | 1195 OS::SNPrintF(buffer, "%d", Smi::cast(*handle_)->value()); |
| 1195 str = arr; | 1196 str = arr; |
| 1196 } else { | 1197 } else { |
| 1197 str = DoubleToCString(handle_->Number(), buffer); | 1198 str = DoubleToCString(handle_->Number(), buffer); |
| 1198 } | 1199 } |
| 1199 return factory->NewStringFromAscii(CStrVector(str)); | 1200 return factory->NewStringFromAscii(CStrVector(str)); |
| 1200 } | 1201 } |
| 1201 | 1202 |
| 1202 | 1203 |
| 1203 } } // namespace v8::internal | 1204 } } // namespace v8::internal |
| OLD | NEW |