OLD | NEW |
| (Empty) |
1 // Copyright 2009 the V8 project authors. All rights reserved. | |
2 // Redistribution and use in source and binary forms, with or without | |
3 // modification, are permitted provided that the following conditions are | |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
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. | |
27 | |
28 // Test the paths in the code generator where values in specific | |
29 // registers get moved around so that the shift operation can use | |
30 // register ECX on ia32 for the shift amount. Other codegen coverage | |
31 // tests should go here too. | |
32 | |
33 | |
34 | |
35 function identity(x) { | |
36 return x; | |
37 } | |
38 | |
39 function cover_codegen_paths() { | |
40 var x = 1; | |
41 var a; // Register EAX | |
42 var b; // Register EBX | |
43 var c; // Register ECX | |
44 var d; // Register EDX | |
45 // Register ESI is already used. | |
46 var di; // Register EDI | |
47 | |
48 while (x == 1) { | |
49 x = identity(1); | |
50 a = x + 1; | |
51 c = x + 1; | |
52 d = x + 1; | |
53 b = x + 1; | |
54 di = x + 1; | |
55 // Locals are in the corresponding registers here. | |
56 assertEquals(c << a, 8); | |
57 | |
58 x = identity(1); | |
59 a = x + 1; | |
60 c = x + 1; | |
61 d = x + 1; | |
62 b = x + 1; | |
63 di = x + 1; | |
64 // Locals are in the corresponding registers here. | |
65 assertEquals(a << c, 8); | |
66 | |
67 x = identity(1); | |
68 a = x + 1; | |
69 c = x + 1; | |
70 d = x + 1; | |
71 b = x + 1; | |
72 di = x + 1; | |
73 // Locals are in the corresponding registers here. | |
74 c = 0; // Free register ecx. | |
75 assertEquals(a << d, 8); | |
76 | |
77 x = identity(1); | |
78 a = x + 1; | |
79 c = x + 1; | |
80 d = x + 1; | |
81 b = x + 1; | |
82 di = x + 1; | |
83 // Locals are in the corresponding registers here. | |
84 b = 0; // Free register ebx. | |
85 assertEquals(a << d, 8); | |
86 | |
87 x = 3; | |
88 } | |
89 } | |
90 | |
91 cover_codegen_paths(); | |
OLD | NEW |