OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 5998 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6009 if (range->IsChild()) { | 6009 if (range->IsChild()) { |
6010 parent_index = range->parent()->id(); | 6010 parent_index = range->parent()->id(); |
6011 } else { | 6011 } else { |
6012 parent_index = range->id(); | 6012 parent_index = range->id(); |
6013 } | 6013 } |
6014 LOperand* op = range->FirstHint(); | 6014 LOperand* op = range->FirstHint(); |
6015 int hint_index = -1; | 6015 int hint_index = -1; |
6016 if (op != NULL && op->IsUnallocated()) hint_index = op->VirtualRegister(); | 6016 if (op != NULL && op->IsUnallocated()) hint_index = op->VirtualRegister(); |
6017 trace_.Add(" %d %d", parent_index, hint_index); | 6017 trace_.Add(" %d %d", parent_index, hint_index); |
6018 UseInterval* cur_interval = range->first_interval(); | 6018 UseInterval* cur_interval = range->first_interval(); |
6019 while (cur_interval != NULL) { | 6019 while (cur_interval != NULL && range->Covers(cur_interval->start())) { |
6020 trace_.Add(" [%d, %d[", | 6020 trace_.Add(" [%d, %d[", |
6021 cur_interval->start().Value(), | 6021 cur_interval->start().Value(), |
6022 cur_interval->end().Value()); | 6022 cur_interval->end().Value()); |
6023 cur_interval = cur_interval->next(); | 6023 cur_interval = cur_interval->next(); |
6024 } | 6024 } |
6025 | 6025 |
6026 UsePosition* current_pos = range->first_pos(); | 6026 UsePosition* current_pos = range->first_pos(); |
6027 while (current_pos != NULL) { | 6027 while (current_pos != NULL) { |
6028 if (current_pos->RegisterIsBeneficial()) { | 6028 if (current_pos->RegisterIsBeneficial() || FLAG_trace_all_uses) { |
6029 trace_.Add(" %d M", current_pos->pos().Value()); | 6029 trace_.Add(" %d M", current_pos->pos().Value()); |
6030 } | 6030 } |
6031 current_pos = current_pos->next(); | 6031 current_pos = current_pos->next(); |
6032 } | 6032 } |
6033 | 6033 |
6034 trace_.Add(" \"\"\n"); | 6034 trace_.Add(" \"\"\n"); |
6035 } | 6035 } |
6036 } | 6036 } |
6037 | 6037 |
6038 | 6038 |
(...skipping 87 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
6126 } | 6126 } |
6127 } | 6127 } |
6128 | 6128 |
6129 #ifdef DEBUG | 6129 #ifdef DEBUG |
6130 if (graph_ != NULL) graph_->Verify(); | 6130 if (graph_ != NULL) graph_->Verify(); |
6131 if (allocator_ != NULL) allocator_->Verify(); | 6131 if (allocator_ != NULL) allocator_->Verify(); |
6132 #endif | 6132 #endif |
6133 } | 6133 } |
6134 | 6134 |
6135 } } // namespace v8::internal | 6135 } } // namespace v8::internal |
OLD | NEW |