| 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 1043 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1054 | 1054 |
| 1055 | 1055 |
| 1056 void AstConstructionVisitor::VisitForStatement(ForStatement* node) { | 1056 void AstConstructionVisitor::VisitForStatement(ForStatement* node) { |
| 1057 increase_node_count(); | 1057 increase_node_count(); |
| 1058 add_flag(kDontSelfOptimize); | 1058 add_flag(kDontSelfOptimize); |
| 1059 } | 1059 } |
| 1060 | 1060 |
| 1061 | 1061 |
| 1062 void AstConstructionVisitor::VisitForInStatement(ForInStatement* node) { | 1062 void AstConstructionVisitor::VisitForInStatement(ForInStatement* node) { |
| 1063 increase_node_count(); | 1063 increase_node_count(); |
| 1064 add_flag(kDontOptimize); | |
| 1065 add_flag(kDontInline); | |
| 1066 add_flag(kDontSelfOptimize); | 1064 add_flag(kDontSelfOptimize); |
| 1067 } | 1065 } |
| 1068 | 1066 |
| 1069 | 1067 |
| 1070 void AstConstructionVisitor::VisitTryCatchStatement(TryCatchStatement* node) { | 1068 void AstConstructionVisitor::VisitTryCatchStatement(TryCatchStatement* node) { |
| 1071 increase_node_count(); | 1069 increase_node_count(); |
| 1072 add_flag(kDontOptimize); | 1070 add_flag(kDontOptimize); |
| 1073 add_flag(kDontInline); | 1071 add_flag(kDontInline); |
| 1074 } | 1072 } |
| 1075 | 1073 |
| (...skipping 77 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1153 OS::SNPrintF(buffer, "%d", Smi::cast(*handle_)->value()); | 1151 OS::SNPrintF(buffer, "%d", Smi::cast(*handle_)->value()); |
| 1154 str = arr; | 1152 str = arr; |
| 1155 } else { | 1153 } else { |
| 1156 str = DoubleToCString(handle_->Number(), buffer); | 1154 str = DoubleToCString(handle_->Number(), buffer); |
| 1157 } | 1155 } |
| 1158 return FACTORY->NewStringFromAscii(CStrVector(str)); | 1156 return FACTORY->NewStringFromAscii(CStrVector(str)); |
| 1159 } | 1157 } |
| 1160 | 1158 |
| 1161 | 1159 |
| 1162 } } // namespace v8::internal | 1160 } } // namespace v8::internal |
| OLD | NEW |