OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 30 matching lines...) Expand all Loading... |
41 AllocationResult v8::internal::HeapTester::AllocateAfterFailures() { | 41 AllocationResult v8::internal::HeapTester::AllocateAfterFailures() { |
42 Heap* heap = CcTest::heap(); | 42 Heap* heap = CcTest::heap(); |
43 | 43 |
44 // New space. | 44 // New space. |
45 heap->AllocateByteArray(100).ToObjectChecked(); | 45 heap->AllocateByteArray(100).ToObjectChecked(); |
46 heap->AllocateFixedArray(100, NOT_TENURED).ToObjectChecked(); | 46 heap->AllocateFixedArray(100, NOT_TENURED).ToObjectChecked(); |
47 | 47 |
48 // Make sure we can allocate through optimized allocation functions | 48 // Make sure we can allocate through optimized allocation functions |
49 // for specific kinds. | 49 // for specific kinds. |
50 heap->AllocateFixedArray(100).ToObjectChecked(); | 50 heap->AllocateFixedArray(100).ToObjectChecked(); |
51 heap->AllocateHeapNumber(0.42).ToObjectChecked(); | 51 heap->AllocateHeapNumber().ToObjectChecked(); |
52 Object* object = heap->AllocateJSObject( | 52 Object* object = heap->AllocateJSObject( |
53 *CcTest::i_isolate()->object_function()).ToObjectChecked(); | 53 *CcTest::i_isolate()->object_function()).ToObjectChecked(); |
54 heap->CopyJSObject(JSObject::cast(object)).ToObjectChecked(); | 54 heap->CopyJSObject(JSObject::cast(object)).ToObjectChecked(); |
55 | 55 |
56 // Old data space. | 56 // Old data space. |
57 heap::SimulateFullSpace(heap->old_space()); | 57 heap::SimulateFullSpace(heap->old_space()); |
58 heap->AllocateByteArray(100, TENURED).ToObjectChecked(); | 58 heap->AllocateByteArray(100, TENURED).ToObjectChecked(); |
59 | 59 |
60 // Old pointer space. | 60 // Old pointer space. |
61 heap::SimulateFullSpace(heap->old_space()); | 61 heap::SimulateFullSpace(heap->old_space()); |
(...skipping 181 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
243 code_range.FreeRawMemory(blocks[index].base, blocks[index].size); | 243 code_range.FreeRawMemory(blocks[index].base, blocks[index].size); |
244 current_allocated -= blocks[index].size; | 244 current_allocated -= blocks[index].size; |
245 if (index < blocks.length() - 1) { | 245 if (index < blocks.length() - 1) { |
246 blocks[index] = blocks.RemoveLast(); | 246 blocks[index] = blocks.RemoveLast(); |
247 } else { | 247 } else { |
248 blocks.RemoveLast(); | 248 blocks.RemoveLast(); |
249 } | 249 } |
250 } | 250 } |
251 } | 251 } |
252 } | 252 } |
OLD | NEW |