OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/v8.h" | 5 #include "src/v8.h" |
6 | 6 |
7 #include "src/accessors.h" | 7 #include "src/accessors.h" |
8 #include "src/codegen.h" | 8 #include "src/codegen.h" |
9 #include "src/deoptimizer.h" | 9 #include "src/deoptimizer.h" |
10 #include "src/disasm.h" | 10 #include "src/disasm.h" |
(...skipping 360 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
371 ZoneList<Code*> codes(10, &zone); | 371 ZoneList<Code*> codes(10, &zone); |
372 | 372 |
373 // Walk over all optimized code objects in this native context. | 373 // Walk over all optimized code objects in this native context. |
374 Code* prev = NULL; | 374 Code* prev = NULL; |
375 Object* element = context->OptimizedCodeListHead(); | 375 Object* element = context->OptimizedCodeListHead(); |
376 while (!element->IsUndefined()) { | 376 while (!element->IsUndefined()) { |
377 Code* code = Code::cast(element); | 377 Code* code = Code::cast(element); |
378 CHECK_EQ(code->kind(), Code::OPTIMIZED_FUNCTION); | 378 CHECK_EQ(code->kind(), Code::OPTIMIZED_FUNCTION); |
379 Object* next = code->next_code_link(); | 379 Object* next = code->next_code_link(); |
380 | 380 |
381 if (code->marked_for_deoptimization()) { | 381 if (code->marked_for_deoptimization() && |
| 382 (!code->is_turbofanned() || FLAG_turbo_deoptimization)) { |
382 // Put the code into the list for later patching. | 383 // Put the code into the list for later patching. |
383 codes.Add(code, &zone); | 384 codes.Add(code, &zone); |
384 | 385 |
385 if (prev != NULL) { | 386 if (prev != NULL) { |
386 // Skip this code in the optimized code list. | 387 // Skip this code in the optimized code list. |
387 prev->set_next_code_link(next); | 388 prev->set_next_code_link(next); |
388 } else { | 389 } else { |
389 // There was no previous node, the next node is the new head. | 390 // There was no previous node, the next node is the new head. |
390 context->SetOptimizedCodeListHead(next); | 391 context->SetOptimizedCodeListHead(next); |
391 } | 392 } |
(...skipping 3284 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3676 } | 3677 } |
3677 | 3678 |
3678 | 3679 |
3679 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { | 3680 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { |
3680 v->VisitPointer(BitCast<Object**>(&function_)); | 3681 v->VisitPointer(BitCast<Object**>(&function_)); |
3681 v->VisitPointers(parameters_, parameters_ + parameters_count_); | 3682 v->VisitPointers(parameters_, parameters_ + parameters_count_); |
3682 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); | 3683 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); |
3683 } | 3684 } |
3684 | 3685 |
3685 } } // namespace v8::internal | 3686 } } // namespace v8::internal |
OLD | NEW |