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 7311 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
7322 } | 7322 } |
7323 } | 7323 } |
7324 int parent_index = -1; | 7324 int parent_index = -1; |
7325 if (range->IsChild()) { | 7325 if (range->IsChild()) { |
7326 parent_index = range->parent()->id(); | 7326 parent_index = range->parent()->id(); |
7327 } else { | 7327 } else { |
7328 parent_index = range->id(); | 7328 parent_index = range->id(); |
7329 } | 7329 } |
7330 LOperand* op = range->FirstHint(); | 7330 LOperand* op = range->FirstHint(); |
7331 int hint_index = -1; | 7331 int hint_index = -1; |
7332 if (op != NULL && op->IsUnallocated()) hint_index = op->VirtualRegister(); | 7332 if (op != NULL && op->IsUnallocated()) { |
| 7333 hint_index = LUnallocated::cast(op)->virtual_register(); |
| 7334 } |
7333 trace_.Add(" %d %d", parent_index, hint_index); | 7335 trace_.Add(" %d %d", parent_index, hint_index); |
7334 UseInterval* cur_interval = range->first_interval(); | 7336 UseInterval* cur_interval = range->first_interval(); |
7335 while (cur_interval != NULL && range->Covers(cur_interval->start())) { | 7337 while (cur_interval != NULL && range->Covers(cur_interval->start())) { |
7336 trace_.Add(" [%d, %d[", | 7338 trace_.Add(" [%d, %d[", |
7337 cur_interval->start().Value(), | 7339 cur_interval->start().Value(), |
7338 cur_interval->end().Value()); | 7340 cur_interval->end().Value()); |
7339 cur_interval = cur_interval->next(); | 7341 cur_interval = cur_interval->next(); |
7340 } | 7342 } |
7341 | 7343 |
7342 UsePosition* current_pos = range->first_pos(); | 7344 UsePosition* current_pos = range->first_pos(); |
(...skipping 110 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
7453 } | 7455 } |
7454 } | 7456 } |
7455 | 7457 |
7456 #ifdef DEBUG | 7458 #ifdef DEBUG |
7457 if (graph_ != NULL) graph_->Verify(false); // No full verify. | 7459 if (graph_ != NULL) graph_->Verify(false); // No full verify. |
7458 if (allocator_ != NULL) allocator_->Verify(); | 7460 if (allocator_ != NULL) allocator_->Verify(); |
7459 #endif | 7461 #endif |
7460 } | 7462 } |
7461 | 7463 |
7462 } } // namespace v8::internal | 7464 } } // namespace v8::internal |
OLD | NEW |