1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
// Copyright 2013 the V8 project authors. All rights reserved.
// Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR ANY
// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
// ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
description(
"This tests that register allocation still works under register pressure induced by inlining, out-of-line function calls (i.e. unconditional register flushing), and slow paths for object creation (i.e. conditional register flushing)."
);
// Inlineable constructor.
function foo(a, b, c) {
this.a = a;
this.b = b;
this.c = c;
}
// Non-inlineable function. This relies on a size limit for inlining, but still
// produces integers. It also relies on the VM not reasoning about Math.log deeply
// enough to find some way of optimizing this code to be small enough to inline.
function bar(a, b) {
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
a += b;
a -= b;
b ^= a;
a += Math.log(b);
b += a;
b -= a;
a ^= b;
return (a - b) | 0;
}
// Function into which we will inline foo but not bar.
function baz(a, b) {
return new foo(bar(2 * a + 1, b - 1), bar(2 * a, b - 1), a);
}
// Do the test. It's crucial that o.a, o.b, and o.c are checked on each
// loop iteration.
for (var i = 0; i < 1000; ++i) {
var o = baz(i, i + 1);
shouldBe("o.a", "bar(2 * i + 1, i)");
shouldBe("o.b", "bar(2 * i, i)");
shouldBe("o.c", "i");
}
|
