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 32 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
43 | 43 |
44 // New space. | 44 // New space. |
45 SimulateFullSpace(heap->new_space()); | 45 SimulateFullSpace(heap->new_space()); |
46 heap->AllocateByteArray(100).ToObjectChecked(); | 46 heap->AllocateByteArray(100).ToObjectChecked(); |
47 heap->AllocateFixedArray(100, NOT_TENURED).ToObjectChecked(); | 47 heap->AllocateFixedArray(100, NOT_TENURED).ToObjectChecked(); |
48 | 48 |
49 // Make sure we can allocate through optimized allocation functions | 49 // Make sure we can allocate through optimized allocation functions |
50 // for specific kinds. | 50 // for specific kinds. |
51 heap->AllocateFixedArray(100).ToObjectChecked(); | 51 heap->AllocateFixedArray(100).ToObjectChecked(); |
52 heap->AllocateHeapNumber(0.42).ToObjectChecked(); | 52 heap->AllocateHeapNumber(0.42).ToObjectChecked(); |
53 heap->AllocateArgumentsObject(Smi::FromInt(87), 10).ToObjectChecked(); | |
54 Object* object = heap->AllocateJSObject( | 53 Object* object = heap->AllocateJSObject( |
55 *CcTest::i_isolate()->object_function()).ToObjectChecked(); | 54 *CcTest::i_isolate()->object_function()).ToObjectChecked(); |
56 heap->CopyJSObject(JSObject::cast(object)).ToObjectChecked(); | 55 heap->CopyJSObject(JSObject::cast(object)).ToObjectChecked(); |
57 | 56 |
58 // Old data space. | 57 // Old data space. |
59 SimulateFullSpace(heap->old_data_space()); | 58 SimulateFullSpace(heap->old_data_space()); |
60 heap->AllocateByteArray(100, TENURED).ToObjectChecked(); | 59 heap->AllocateByteArray(100, TENURED).ToObjectChecked(); |
61 | 60 |
62 // Old pointer space. | 61 // Old pointer space. |
63 SimulateFullSpace(heap->old_pointer_space()); | 62 SimulateFullSpace(heap->old_pointer_space()); |
(...skipping 166 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
230 if (index < blocks.length() - 1) { | 229 if (index < blocks.length() - 1) { |
231 blocks[index] = blocks.RemoveLast(); | 230 blocks[index] = blocks.RemoveLast(); |
232 } else { | 231 } else { |
233 blocks.RemoveLast(); | 232 blocks.RemoveLast(); |
234 } | 233 } |
235 } | 234 } |
236 } | 235 } |
237 | 236 |
238 code_range.TearDown(); | 237 code_range.TearDown(); |
239 } | 238 } |
OLD | NEW |