OLD | NEW |
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 508 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
519 UseInterval* a = FirstSearchIntervalForPosition(b->start()); | 519 UseInterval* a = FirstSearchIntervalForPosition(b->start()); |
520 while (a != NULL && b != NULL) { | 520 while (a != NULL && b != NULL) { |
521 if (a->start().Value() > other->End().Value()) break; | 521 if (a->start().Value() > other->End().Value()) break; |
522 if (b->start().Value() > End().Value()) break; | 522 if (b->start().Value() > End().Value()) break; |
523 LifetimePosition cur_intersection = a->Intersect(b); | 523 LifetimePosition cur_intersection = a->Intersect(b); |
524 if (cur_intersection.IsValid()) { | 524 if (cur_intersection.IsValid()) { |
525 return cur_intersection; | 525 return cur_intersection; |
526 } | 526 } |
527 if (a->start().Value() < b->start().Value()) { | 527 if (a->start().Value() < b->start().Value()) { |
528 a = a->next(); | 528 a = a->next(); |
529 if (a == NULL && a->start().Value() > other->End().Value()) break; | 529 if (a == NULL || a->start().Value() > other->End().Value()) break; |
530 AdvanceLastProcessedMarker(a, advance_last_processed_up_to); | 530 AdvanceLastProcessedMarker(a, advance_last_processed_up_to); |
531 } else { | 531 } else { |
532 b = b->next(); | 532 b = b->next(); |
533 } | 533 } |
534 } | 534 } |
535 return LifetimePosition::Invalid(); | 535 return LifetimePosition::Invalid(); |
536 } | 536 } |
537 | 537 |
538 | 538 |
539 void LAllocator::InitializeLivenessAnalysis() { | 539 void LAllocator::InitializeLivenessAnalysis() { |
(...skipping 1567 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2107 LiveRange* current = live_ranges()->at(i); | 2107 LiveRange* current = live_ranges()->at(i); |
2108 if (current != NULL) current->Verify(); | 2108 if (current != NULL) current->Verify(); |
2109 } | 2109 } |
2110 } | 2110 } |
2111 | 2111 |
2112 | 2112 |
2113 #endif | 2113 #endif |
2114 | 2114 |
2115 | 2115 |
2116 } } // namespace v8::internal | 2116 } } // namespace v8::internal |
OLD | NEW |