| 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 112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 123 #ifdef DEBUG | 123 #ifdef DEBUG |
| 124 if (strlen(FLAG_stop_at) > 0 && | 124 if (strlen(FLAG_stop_at) > 0 && |
| 125 info->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { | 125 info->function()->name()->IsEqualTo(CStrVector(FLAG_stop_at))) { |
| 126 __ int3(); | 126 __ int3(); |
| 127 } | 127 } |
| 128 #endif | 128 #endif |
| 129 | 129 |
| 130 // We can optionally optimize based on counters rather than statistical | 130 // We can optionally optimize based on counters rather than statistical |
| 131 // sampling. | 131 // sampling. |
| 132 if (info->ShouldSelfOptimize()) { | 132 if (info->ShouldSelfOptimize()) { |
| 133 if (FLAG_trace_opt) { | 133 if (FLAG_trace_opt_verbose) { |
| 134 PrintF("[adding self-optimization header to %s]\n", | 134 PrintF("[adding self-optimization header to %s]\n", |
| 135 *info->function()->debug_name()->ToCString()); | 135 *info->function()->debug_name()->ToCString()); |
| 136 } | 136 } |
| 137 MaybeObject* maybe_cell = isolate()->heap()->AllocateJSGlobalPropertyCell( | 137 MaybeObject* maybe_cell = isolate()->heap()->AllocateJSGlobalPropertyCell( |
| 138 Smi::FromInt(Compiler::kCallsUntilPrimitiveOpt)); | 138 Smi::FromInt(Compiler::kCallsUntilPrimitiveOpt)); |
| 139 JSGlobalPropertyCell* cell; | 139 JSGlobalPropertyCell* cell; |
| 140 if (maybe_cell->To(&cell)) { | 140 if (maybe_cell->To(&cell)) { |
| 141 __ movq(rax, Handle<JSGlobalPropertyCell>(cell), | 141 __ movq(rax, Handle<JSGlobalPropertyCell>(cell), |
| 142 RelocInfo::EMBEDDED_OBJECT); | 142 RelocInfo::EMBEDDED_OBJECT); |
| 143 __ SmiAddConstant(FieldOperand(rax, JSGlobalPropertyCell::kValueOffset), | 143 __ SmiAddConstant(FieldOperand(rax, JSGlobalPropertyCell::kValueOffset), |
| (...skipping 4237 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4381 *context_length = 0; | 4381 *context_length = 0; |
| 4382 return previous_; | 4382 return previous_; |
| 4383 } | 4383 } |
| 4384 | 4384 |
| 4385 | 4385 |
| 4386 #undef __ | 4386 #undef __ |
| 4387 | 4387 |
| 4388 } } // namespace v8::internal | 4388 } } // namespace v8::internal |
| 4389 | 4389 |
| 4390 #endif // V8_TARGET_ARCH_X64 | 4390 #endif // V8_TARGET_ARCH_X64 |
| OLD | NEW |