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 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 // Check that we can traverse very deep stacks of ConsStrings using | 28 // Check that we can traverse very deep stacks of ConsStrings using |
29 // StringCharacterStram. Check that Get(int) works on very deep stacks | 29 // StringCharacterStram. Check that Get(int) works on very deep stacks |
30 // of ConsStrings. These operations may not be very fast, but they | 30 // of ConsStrings. These operations may not be very fast, but they |
31 // should be possible without getting errors due to too deep recursion. | 31 // should be possible without getting errors due to too deep recursion. |
32 | 32 |
33 #include <stdlib.h> | 33 #include <stdlib.h> |
34 | 34 |
35 // TODO(dcarney): remove | |
36 #define V8_ALLOW_ACCESS_TO_PERSISTENT_IMPLICIT | |
37 #define V8_ALLOW_ACCESS_TO_PERSISTENT_ARROW | |
38 | |
39 #include "v8.h" | 35 #include "v8.h" |
40 | 36 |
41 #include "api.h" | 37 #include "api.h" |
42 #include "factory.h" | 38 #include "factory.h" |
43 #include "objects.h" | 39 #include "objects.h" |
44 #include "cctest.h" | 40 #include "cctest.h" |
45 #include "zone-inl.h" | 41 #include "zone-inl.h" |
46 | 42 |
47 // Adapted from http://en.wikipedia.org/wiki/Multiply-with-carry | 43 // Adapted from http://en.wikipedia.org/wiki/Multiply-with-carry |
48 class RandomNumberGenerator { | 44 class RandomNumberGenerator { |
(...skipping 1292 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1341 CheckCanonicalEquivalence(c, test); | 1337 CheckCanonicalEquivalence(c, test); |
1342 continue; | 1338 continue; |
1343 } | 1339 } |
1344 if (upper != c && lower != c) { | 1340 if (upper != c && lower != c) { |
1345 CheckCanonicalEquivalence(c, test); | 1341 CheckCanonicalEquivalence(c, test); |
1346 continue; | 1342 continue; |
1347 } | 1343 } |
1348 CHECK_EQ(Min(upper, lower), test); | 1344 CHECK_EQ(Min(upper, lower), test); |
1349 } | 1345 } |
1350 } | 1346 } |
OLD | NEW |