OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 124 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
135 str.start(), str.length() * kUC16Size); | 135 str.start(), str.length() * kUC16Size); |
136 | 136 |
137 return answer; | 137 return answer; |
138 } | 138 } |
139 | 139 |
140 MaybeObject* Heap::CopyFixedArray(FixedArray* src) { | 140 MaybeObject* Heap::CopyFixedArray(FixedArray* src) { |
141 return CopyFixedArrayWithMap(src, src->map()); | 141 return CopyFixedArrayWithMap(src, src->map()); |
142 } | 142 } |
143 | 143 |
144 | 144 |
| 145 MaybeObject* Heap::CopyFixedDoubleArray(FixedDoubleArray* src) { |
| 146 return CopyFixedDoubleArrayWithMap(src, src->map()); |
| 147 } |
| 148 |
| 149 |
145 MaybeObject* Heap::AllocateRaw(int size_in_bytes, | 150 MaybeObject* Heap::AllocateRaw(int size_in_bytes, |
146 AllocationSpace space, | 151 AllocationSpace space, |
147 AllocationSpace retry_space) { | 152 AllocationSpace retry_space) { |
148 ASSERT(allocation_allowed_ && gc_state_ == NOT_IN_GC); | 153 ASSERT(allocation_allowed_ && gc_state_ == NOT_IN_GC); |
149 ASSERT(space != NEW_SPACE || | 154 ASSERT(space != NEW_SPACE || |
150 retry_space == OLD_POINTER_SPACE || | 155 retry_space == OLD_POINTER_SPACE || |
151 retry_space == OLD_DATA_SPACE || | 156 retry_space == OLD_DATA_SPACE || |
152 retry_space == LO_SPACE); | 157 retry_space == LO_SPACE); |
153 #ifdef DEBUG | 158 #ifdef DEBUG |
154 if (FLAG_gc_interval >= 0 && | 159 if (FLAG_gc_interval >= 0 && |
(...skipping 533 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
688 #ifdef DEBUG | 693 #ifdef DEBUG |
689 UpdateLiveObjectCount(obj); | 694 UpdateLiveObjectCount(obj); |
690 #endif | 695 #endif |
691 obj->SetMark(); | 696 obj->SetMark(); |
692 } | 697 } |
693 | 698 |
694 | 699 |
695 } } // namespace v8::internal | 700 } } // namespace v8::internal |
696 | 701 |
697 #endif // V8_HEAP_INL_H_ | 702 #endif // V8_HEAP_INL_H_ |
OLD | NEW |