| 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 122 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 133 #ifdef DEBUG | 133 #ifdef DEBUG |
| 134 if (strlen(FLAG_stop_at) > 0 && | 134 if (strlen(FLAG_stop_at) > 0 && |
| 135 info->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { | 135 info->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { |
| 136 __ stop("stop-at"); | 136 __ stop("stop-at"); |
| 137 } | 137 } |
| 138 #endif | 138 #endif |
| 139 | 139 |
| 140 // We can optionally optimize based on counters rather than statistical | 140 // We can optionally optimize based on counters rather than statistical |
| 141 // sampling. | 141 // sampling. |
| 142 if (info->ShouldSelfOptimize()) { | 142 if (info->ShouldSelfOptimize()) { |
| 143 if (FLAG_trace_opt) { | 143 if (FLAG_trace_opt_verbose) { |
| 144 PrintF("[adding self-optimization header to %s]\n", | 144 PrintF("[adding self-optimization header to %s]\n", |
| 145 *info->function()->debug_name()->ToCString()); | 145 *info->function()->debug_name()->ToCString()); |
| 146 } | 146 } |
| 147 MaybeObject* maybe_cell = isolate()->heap()->AllocateJSGlobalPropertyCell( | 147 MaybeObject* maybe_cell = isolate()->heap()->AllocateJSGlobalPropertyCell( |
| 148 Smi::FromInt(Compiler::kCallsUntilPrimitiveOpt)); | 148 Smi::FromInt(Compiler::kCallsUntilPrimitiveOpt)); |
| 149 JSGlobalPropertyCell* cell; | 149 JSGlobalPropertyCell* cell; |
| 150 if (maybe_cell->To(&cell)) { | 150 if (maybe_cell->To(&cell)) { |
| 151 __ mov(r2, Operand(Handle<JSGlobalPropertyCell>(cell))); | 151 __ mov(r2, Operand(Handle<JSGlobalPropertyCell>(cell))); |
| 152 __ ldr(r3, FieldMemOperand(r2, JSGlobalPropertyCell::kValueOffset)); | 152 __ ldr(r3, FieldMemOperand(r2, JSGlobalPropertyCell::kValueOffset)); |
| 153 __ sub(r3, r3, Operand(Smi::FromInt(1)), SetCC); | 153 __ sub(r3, r3, Operand(Smi::FromInt(1)), SetCC); |
| (...skipping 4265 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4419 *context_length = 0; | 4419 *context_length = 0; |
| 4420 return previous_; | 4420 return previous_; |
| 4421 } | 4421 } |
| 4422 | 4422 |
| 4423 | 4423 |
| 4424 #undef __ | 4424 #undef __ |
| 4425 | 4425 |
| 4426 } } // namespace v8::internal | 4426 } } // namespace v8::internal |
| 4427 | 4427 |
| 4428 #endif // V8_TARGET_ARCH_ARM | 4428 #endif // V8_TARGET_ARCH_ARM |
| OLD | NEW |