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 13 matching lines...) Expand all Loading... |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 #ifndef V8_SPACES_INL_H_ | 28 #ifndef V8_SPACES_INL_H_ |
29 #define V8_SPACES_INL_H_ | 29 #define V8_SPACES_INL_H_ |
30 | 30 |
31 #include "memory.h" | 31 #include "memory.h" |
32 #include "spaces.h" | 32 #include "spaces.h" |
33 | 33 |
34 namespace v8 { namespace internal { | 34 namespace v8 { |
| 35 namespace internal { |
35 | 36 |
36 | 37 |
37 // ----------------------------------------------------------------------------- | 38 // ----------------------------------------------------------------------------- |
38 // HeapObjectIterator | 39 // HeapObjectIterator |
39 | 40 |
40 bool HeapObjectIterator::has_next() { | 41 bool HeapObjectIterator::has_next() { |
41 if (cur_addr_ < cur_limit_) { | 42 if (cur_addr_ < cur_limit_) { |
42 return true; // common case | 43 return true; // common case |
43 } | 44 } |
44 ASSERT(cur_addr_ == cur_limit_); | 45 ASSERT(cur_addr_ == cur_limit_); |
(...skipping 310 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
355 ASSERT(space->low() <= alloc_info->top | 356 ASSERT(space->low() <= alloc_info->top |
356 && alloc_info->top <= space->high() | 357 && alloc_info->top <= space->high() |
357 && alloc_info->limit == space->high()); | 358 && alloc_info->limit == space->high()); |
358 #endif | 359 #endif |
359 return obj; | 360 return obj; |
360 } | 361 } |
361 | 362 |
362 } } // namespace v8::internal | 363 } } // namespace v8::internal |
363 | 364 |
364 #endif // V8_SPACES_INL_H_ | 365 #endif // V8_SPACES_INL_H_ |
OLD | NEW |