| 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 14 matching lines...) Expand all Loading... |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 // Regression test of a very rare corner case where left-trimming an | 28 // Regression test of a very rare corner case where left-trimming an |
| 29 // array caused invalid marking bit patterns on lazily swept pages. | 29 // array caused invalid marking bit patterns on lazily swept pages. |
| 30 // | 30 // |
| 31 // Lazy sweeping was deprecated. We are keeping the test case to make | 31 // Lazy sweeping was deprecated. We are keeping the test case to make |
| 32 // sure that concurrent sweeping, which relies on similar assumptions | 32 // sure that concurrent sweeping, which relies on similar assumptions |
| 33 // as lazy sweeping works correctly. | 33 // as lazy sweeping works correctly. |
| 34 | 34 |
| 35 // Flags: --expose-gc --noincremental-marking --max-new-space-size=2 | 35 // Flags: --expose-gc --noincremental-marking --max_semi_space_size=1 |
| 36 | 36 |
| 37 (function() { | 37 (function() { |
| 38 var head = new Array(1); | 38 var head = new Array(1); |
| 39 var tail = head; | 39 var tail = head; |
| 40 | 40 |
| 41 // Fill heap to increase old-space size and trigger concurrent sweeping on | 41 // Fill heap to increase old-space size and trigger concurrent sweeping on |
| 42 // some of the old-space pages. | 42 // some of the old-space pages. |
| 43 for (var i = 0; i < 200; i++) { | 43 for (var i = 0; i < 200; i++) { |
| 44 tail[1] = new Array(1000); | 44 tail[1] = new Array(1000); |
| 45 tail = tail[1]; | 45 tail = tail[1]; |
| (...skipping 12 matching lines...) Expand all Loading... |
| 58 | 58 |
| 59 // At this point "array" should have been trimmed from the left with | 59 // At this point "array" should have been trimmed from the left with |
| 60 // marking bits being correctly transfered to the new object start. | 60 // marking bits being correctly transfered to the new object start. |
| 61 // Scavenging operations cause concurrent sweeping to advance and verify | 61 // Scavenging operations cause concurrent sweeping to advance and verify |
| 62 // that marking bit patterns are still sane. | 62 // that marking bit patterns are still sane. |
| 63 for (var i = 0; i < 200; i++) { | 63 for (var i = 0; i < 200; i++) { |
| 64 tail[1] = new Array(1000); | 64 tail[1] = new Array(1000); |
| 65 tail = tail[1]; | 65 tail = tail[1]; |
| 66 } | 66 } |
| 67 })(); | 67 })(); |
| OLD | NEW |