OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 "macro-assembler.h" | 30 #include "macro-assembler.h" |
31 #include "mark-compact.h" | 31 #include "mark-compact.h" |
32 #include "platform.h" | 32 #include "platform.h" |
33 | 33 |
34 namespace v8 { | 34 namespace v8 { |
35 namespace internal { | 35 namespace internal { |
36 | 36 |
37 // For contiguous spaces, top should be in the space (or at the end) and limit | 37 // For contiguous spaces, top should be in the space (or at the end) and limit |
38 // should be the end of the space. | 38 // should be the end of the space. |
39 #define ASSERT_SEMISPACE_ALLOCATION_INFO(info, space) \ | 39 #define ASSERT_SEMISPACE_ALLOCATION_INFO(info, space) \ |
40 ASSERT((space).low() <= (info).top \ | 40 ASSERT((space).low() <= (info).top \ |
41 && (info).top <= (space).high() \ | 41 && (info).top <= (space).high() \ |
42 && (info).limit == (space).high()) | 42 && (info).limit == (space).high()) |
43 | 43 |
44 | 44 |
45 // ---------------------------------------------------------------------------- | 45 // ---------------------------------------------------------------------------- |
46 // HeapObjectIterator | 46 // HeapObjectIterator |
47 | 47 |
48 HeapObjectIterator::HeapObjectIterator(PagedSpace* space) { | 48 HeapObjectIterator::HeapObjectIterator(PagedSpace* space) { |
49 Initialize(space->bottom(), space->top(), NULL); | 49 Initialize(space->bottom(), space->top(), NULL); |
50 } | 50 } |
51 | 51 |
(...skipping 2539 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2591 reinterpret_cast<Object**>(object->address() | 2591 reinterpret_cast<Object**>(object->address() |
2592 + Page::kObjectAreaSize), | 2592 + Page::kObjectAreaSize), |
2593 allocation_top); | 2593 allocation_top); |
2594 PrintF("\n"); | 2594 PrintF("\n"); |
2595 } | 2595 } |
2596 } | 2596 } |
2597 } | 2597 } |
2598 #endif // DEBUG | 2598 #endif // DEBUG |
2599 | 2599 |
2600 } } // namespace v8::internal | 2600 } } // namespace v8::internal |
OLD | NEW |