OLD | NEW |
1 // Copyright 2007-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2007-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 270 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
281 | 281 |
282 TEST(LinearAllocation) { | 282 TEST(LinearAllocation) { |
283 v8::V8::Initialize(); | 283 v8::V8::Initialize(); |
284 NewSpace* new_space = Heap::new_space(); | 284 NewSpace* new_space = Heap::new_space(); |
285 PagedSpace* old_pointer_space = Heap::old_pointer_space(); | 285 PagedSpace* old_pointer_space = Heap::old_pointer_space(); |
286 PagedSpace* old_data_space = Heap::old_data_space(); | 286 PagedSpace* old_data_space = Heap::old_data_space(); |
287 PagedSpace* code_space = Heap::code_space(); | 287 PagedSpace* code_space = Heap::code_space(); |
288 PagedSpace* map_space = Heap::map_space(); | 288 PagedSpace* map_space = Heap::map_space(); |
289 PagedSpace* cell_space = Heap::cell_space(); | 289 PagedSpace* cell_space = Heap::cell_space(); |
290 int new_space_max = 512 * KB; | 290 int new_space_max = 512 * KB; |
291 for (int size = 1000; size < 5 * MB; size *= 1.5) { | 291 for (int size = 1000; size < 5 * MB; size += size >> 1) { |
292 bool gc_performed = true; | 292 bool gc_performed = true; |
293 while (gc_performed) { | 293 while (gc_performed) { |
294 gc_performed = false; | 294 gc_performed = false; |
295 if (size < new_space_max) { | 295 if (size < new_space_max) { |
296 if (!new_space->ReserveSpace(size)) { | 296 if (!new_space->ReserveSpace(size)) { |
297 Heap::CollectGarbage(size, NEW_SPACE); | 297 Heap::CollectGarbage(size, NEW_SPACE); |
298 gc_performed = true; | 298 gc_performed = true; |
299 CHECK(new_space->ReserveSpace(size)); | 299 CHECK(new_space->ReserveSpace(size)); |
300 } | 300 } |
301 } | 301 } |
(...skipping 119 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
421 TEST(TestThatAlwaysFails) { | 421 TEST(TestThatAlwaysFails) { |
422 bool ArtificialFailure = false; | 422 bool ArtificialFailure = false; |
423 CHECK(ArtificialFailure); | 423 CHECK(ArtificialFailure); |
424 } | 424 } |
425 | 425 |
426 | 426 |
427 DEPENDENT_TEST(DependentTestThatAlwaysFails, TestThatAlwaysSucceeds) { | 427 DEPENDENT_TEST(DependentTestThatAlwaysFails, TestThatAlwaysSucceeds) { |
428 bool ArtificialFailure2 = false; | 428 bool ArtificialFailure2 = false; |
429 CHECK(ArtificialFailure2); | 429 CHECK(ArtificialFailure2); |
430 } | 430 } |
OLD | NEW |