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 115 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
126 Object* Heap::AllocateRawMap() { | 126 Object* Heap::AllocateRawMap() { |
127 #ifdef DEBUG | 127 #ifdef DEBUG |
128 Counters::objs_since_last_full.Increment(); | 128 Counters::objs_since_last_full.Increment(); |
129 Counters::objs_since_last_young.Increment(); | 129 Counters::objs_since_last_young.Increment(); |
130 #endif | 130 #endif |
131 Object* result = map_space_->AllocateRaw(Map::kSize); | 131 Object* result = map_space_->AllocateRaw(Map::kSize); |
132 if (result->IsFailure()) old_gen_exhausted_ = true; | 132 if (result->IsFailure()) old_gen_exhausted_ = true; |
133 #ifdef DEBUG | 133 #ifdef DEBUG |
134 if (!result->IsFailure()) { | 134 if (!result->IsFailure()) { |
135 // Maps have their own alignment. | 135 // Maps have their own alignment. |
136 CHECK((OffsetFrom(result) & kMapAlignmentMask) == kHeapObjectTag); | 136 CHECK_EQ(static_cast<intptr_t>(kHeapObjectTag), |
| 137 reinterpret_cast<intptr_t>(result) & kMapAlignmentMask); |
137 } | 138 } |
138 #endif | 139 #endif |
139 return result; | 140 return result; |
140 } | 141 } |
141 | 142 |
142 | 143 |
143 Object* Heap::AllocateRawCell() { | 144 Object* Heap::AllocateRawCell() { |
144 #ifdef DEBUG | 145 #ifdef DEBUG |
145 Counters::objs_since_last_full.Increment(); | 146 Counters::objs_since_last_full.Increment(); |
146 Counters::objs_since_last_young.Increment(); | 147 Counters::objs_since_last_young.Increment(); |
(...skipping 267 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
414 | 415 |
415 | 416 |
416 void ExternalStringTable::ShrinkNewStrings(int position) { | 417 void ExternalStringTable::ShrinkNewStrings(int position) { |
417 new_space_strings_.Rewind(position); | 418 new_space_strings_.Rewind(position); |
418 Verify(); | 419 Verify(); |
419 } | 420 } |
420 | 421 |
421 } } // namespace v8::internal | 422 } } // namespace v8::internal |
422 | 423 |
423 #endif // V8_HEAP_INL_H_ | 424 #endif // V8_HEAP_INL_H_ |
OLD | NEW |