Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(145)

Side by Side Diff: src/lithium-allocator.cc

Issue 6542047: Basic implementation of incremental marking. (Closed) Base URL: https://v8.googlecode.com/svn/branches/experimental/gc
Patch Set: Created 9 years, 10 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright 2010 the V8 project authors. All rights reserved. 1 // Copyright 2010 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 1080 matching lines...) Expand 10 before | Expand all | Expand 10 after
1091 if (pred_cover != cur_cover) { 1091 if (pred_cover != cur_cover) {
1092 LOperand* pred_op = pred_cover->CreateAssignedOperand(); 1092 LOperand* pred_op = pred_cover->CreateAssignedOperand();
1093 LOperand* cur_op = cur_cover->CreateAssignedOperand(); 1093 LOperand* cur_op = cur_cover->CreateAssignedOperand();
1094 if (!pred_op->Equals(cur_op)) { 1094 if (!pred_op->Equals(cur_op)) {
1095 LGap* gap = NULL; 1095 LGap* gap = NULL;
1096 if (block->predecessors()->length() == 1) { 1096 if (block->predecessors()->length() == 1) {
1097 gap = GapAt(block->first_instruction_index()); 1097 gap = GapAt(block->first_instruction_index());
1098 } else { 1098 } else {
1099 ASSERT(pred->end()->SecondSuccessor() == NULL); 1099 ASSERT(pred->end()->SecondSuccessor() == NULL);
1100 gap = GetLastGap(pred); 1100 gap = GetLastGap(pred);
1101
1102 if (HasTaggedValue(range->id())) {
1103 LInstruction* branch = InstructionAt(pred->last_instruction_index());
1104 if (branch->HasPointerMap()) {
1105 branch->pointer_map()->RecordPointer(cur_op);
1106 }
1107 }
1101 } 1108 }
1102 gap->GetOrCreateParallelMove(LGap::START)->AddMove(pred_op, cur_op); 1109 gap->GetOrCreateParallelMove(LGap::START)->AddMove(pred_op, cur_op);
1103 } 1110 }
1104 } 1111 }
1105 } 1112 }
1106 1113
1107 1114
1108 LParallelMove* LAllocator::GetConnectingParallelMove(LifetimePosition pos) { 1115 LParallelMove* LAllocator::GetConnectingParallelMove(LifetimePosition pos) {
1109 int index = pos.InstructionIndex(); 1116 int index = pos.InstructionIndex();
1110 if (IsGapAt(index)) { 1117 if (IsGapAt(index)) {
(...skipping 963 matching lines...) Expand 10 before | Expand all | Expand 10 after
2074 LiveRange* current = live_ranges()->at(i); 2081 LiveRange* current = live_ranges()->at(i);
2075 if (current != NULL) current->Verify(); 2082 if (current != NULL) current->Verify();
2076 } 2083 }
2077 } 2084 }
2078 2085
2079 2086
2080 #endif 2087 #endif
2081 2088
2082 2089
2083 } } // namespace v8::internal 2090 } } // namespace v8::internal
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698