| OLD | NEW |
| 1 // Copyright 2009 the V8 project authors. All rights reserved. | 1 // Copyright 2009 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 19 matching lines...) Expand all Loading... |
| 30 #include "codegen-inl.h" | 30 #include "codegen-inl.h" |
| 31 #include "jump-target-inl.h" | 31 #include "jump-target-inl.h" |
| 32 #include "register-allocator-inl.h" | 32 #include "register-allocator-inl.h" |
| 33 | 33 |
| 34 namespace v8 { | 34 namespace v8 { |
| 35 namespace internal { | 35 namespace internal { |
| 36 | 36 |
| 37 // ------------------------------------------------------------------------- | 37 // ------------------------------------------------------------------------- |
| 38 // JumpTarget implementation. | 38 // JumpTarget implementation. |
| 39 | 39 |
| 40 bool JumpTarget::compiling_deferred_code_ = false; | |
| 41 | |
| 42 | 40 |
| 43 void JumpTarget::Unuse() { | 41 void JumpTarget::Unuse() { |
| 44 reaching_frames_.Clear(); | 42 reaching_frames_.Clear(); |
| 45 merge_labels_.Clear(); | 43 merge_labels_.Clear(); |
| 46 entry_frame_ = NULL; | 44 entry_frame_ = NULL; |
| 47 entry_label_.Unuse(); | 45 entry_label_.Unuse(); |
| 48 } | 46 } |
| 49 | 47 |
| 50 | 48 |
| 51 void JumpTarget::ComputeEntryFrame() { | 49 void JumpTarget::ComputeEntryFrame() { |
| 52 // Given: a collection of frames reaching by forward CFG edges and | 50 // Given: a collection of frames reaching by forward CFG edges and |
| 53 // the directionality of the block. Compute: an entry frame for the | 51 // the directionality of the block. Compute: an entry frame for the |
| 54 // block. | 52 // block. |
| 55 | 53 |
| 56 Counters::compute_entry_frame.Increment(); | 54 INC_COUNTER(compute_entry_frame); |
| 57 #ifdef DEBUG | 55 #ifdef DEBUG |
| 58 if (compiling_deferred_code_) { | 56 if (v8_context()->code_generator_data_.compiling_deferred_code_) { |
| 59 ASSERT(reaching_frames_.length() > 1); | 57 ASSERT(reaching_frames_.length() > 1); |
| 60 VirtualFrame* frame = reaching_frames_[0]; | 58 VirtualFrame* frame = reaching_frames_[0]; |
| 61 bool all_identical = true; | 59 bool all_identical = true; |
| 62 for (int i = 1; i < reaching_frames_.length(); i++) { | 60 for (int i = 1; i < reaching_frames_.length(); i++) { |
| 63 if (!frame->Equals(reaching_frames_[i])) { | 61 if (!frame->Equals(reaching_frames_[i])) { |
| 64 all_identical = false; | 62 all_identical = false; |
| 65 break; | 63 break; |
| 66 } | 64 } |
| 67 } | 65 } |
| 68 ASSERT(!all_identical || all_identical); | 66 ASSERT(!all_identical || all_identical); |
| (...skipping 305 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 374 temp.CopyTo(this); | 372 temp.CopyTo(this); |
| 375 temp.Unuse(); | 373 temp.Unuse(); |
| 376 | 374 |
| 377 #ifdef DEBUG | 375 #ifdef DEBUG |
| 378 is_shadowing_ = false; | 376 is_shadowing_ = false; |
| 379 #endif | 377 #endif |
| 380 } | 378 } |
| 381 | 379 |
| 382 | 380 |
| 383 } } // namespace v8::internal | 381 } } // namespace v8::internal |
| OLD | NEW |