| OLD | NEW |
| 1 // Copyright 2007-2010 the V8 project authors. All rights reserved. | 1 // Copyright 2007-2010 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 566 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 577 int paged_space_size = (size < paged_space_max) ? size : paged_space_max; | 577 int paged_space_size = (size < paged_space_max) ? size : paged_space_max; |
| 578 HEAP->ReserveSpace( | 578 HEAP->ReserveSpace( |
| 579 new_space_size, | 579 new_space_size, |
| 580 paged_space_size, // Old pointer space. | 580 paged_space_size, // Old pointer space. |
| 581 paged_space_size, // Old data space. | 581 paged_space_size, // Old data space. |
| 582 HEAP->code_space()->RoundSizeDownToObjectAlignment(code_space_max), | 582 HEAP->code_space()->RoundSizeDownToObjectAlignment(code_space_max), |
| 583 HEAP->map_space()->RoundSizeDownToObjectAlignment(paged_space_size), | 583 HEAP->map_space()->RoundSizeDownToObjectAlignment(paged_space_size), |
| 584 HEAP->cell_space()->RoundSizeDownToObjectAlignment(paged_space_size), | 584 HEAP->cell_space()->RoundSizeDownToObjectAlignment(paged_space_size), |
| 585 size); // Large object space. | 585 size); // Large object space. |
| 586 LinearAllocationScope linear_allocation_scope; | 586 LinearAllocationScope linear_allocation_scope; |
| 587 DisallowAllocationFailure disallow_allocation_failure; |
| 587 const int kSmallFixedArrayLength = 4; | 588 const int kSmallFixedArrayLength = 4; |
| 588 const int kSmallFixedArraySize = | 589 const int kSmallFixedArraySize = |
| 589 FixedArray::kHeaderSize + kSmallFixedArrayLength * kPointerSize; | 590 FixedArray::kHeaderSize + kSmallFixedArrayLength * kPointerSize; |
| 590 const int kSmallStringLength = 16; | 591 const int kSmallStringLength = 16; |
| 591 const int kSmallStringSize = | 592 const int kSmallStringSize = |
| 592 (SeqAsciiString::kHeaderSize + kSmallStringLength + | 593 (SeqAsciiString::kHeaderSize + kSmallStringLength + |
| 593 kObjectAlignmentMask) & ~kObjectAlignmentMask; | 594 kObjectAlignmentMask) & ~kObjectAlignmentMask; |
| 594 const int kMapSize = Map::kSize; | 595 const int kMapSize = Map::kSize; |
| 595 | 596 |
| 596 Object* new_last = NULL; | 597 Object* new_last = NULL; |
| (...skipping 88 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 685 TEST(TestThatAlwaysFails) { | 686 TEST(TestThatAlwaysFails) { |
| 686 bool ArtificialFailure = false; | 687 bool ArtificialFailure = false; |
| 687 CHECK(ArtificialFailure); | 688 CHECK(ArtificialFailure); |
| 688 } | 689 } |
| 689 | 690 |
| 690 | 691 |
| 691 DEPENDENT_TEST(DependentTestThatAlwaysFails, TestThatAlwaysSucceeds) { | 692 DEPENDENT_TEST(DependentTestThatAlwaysFails, TestThatAlwaysSucceeds) { |
| 692 bool ArtificialFailure2 = false; | 693 bool ArtificialFailure2 = false; |
| 693 CHECK(ArtificialFailure2); | 694 CHECK(ArtificialFailure2); |
| 694 } | 695 } |
| OLD | NEW |