Mercurial > hg > truffle
annotate src/share/vm/opto/divnode.cpp @ 481:7d7a7c599c17
6578152: fill_region_with_object has usability and safety issues
Reviewed-by: apetrusenko, ysr
author | jcoomes |
---|---|
date | Thu, 11 Dec 2008 12:05:08 -0800 |
parents | 78c058bc5cdc |
children | bbef4344adb2 |
rev | line source |
---|---|
0 | 1 /* |
196 | 2 * Copyright 1997-2008 Sun Microsystems, Inc. All Rights Reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
20 * CA 95054 USA or visit www.sun.com if you need additional information or | |
21 * have any questions. | |
22 * | |
23 */ | |
24 | |
25 // Portions of code courtesy of Clifford Click | |
26 | |
27 // Optimization - Graph Style | |
28 | |
29 #include "incls/_precompiled.incl" | |
30 #include "incls/_divnode.cpp.incl" | |
31 #include <math.h> | |
32 | |
145 | 33 //----------------------magic_int_divide_constants----------------------------- |
34 // Compute magic multiplier and shift constant for converting a 32 bit divide | |
35 // by constant into a multiply/shift/add series. Return false if calculations | |
36 // fail. | |
37 // | |
38 // Borrowed almost verbatum from Hacker's Delight by Henry S. Warren, Jr. with | |
39 // minor type name and parameter changes. | |
40 static bool magic_int_divide_constants(jint d, jint &M, jint &s) { | |
41 int32_t p; | |
42 uint32_t ad, anc, delta, q1, r1, q2, r2, t; | |
43 const uint32_t two31 = 0x80000000L; // 2**31. | |
44 | |
45 ad = ABS(d); | |
46 if (d == 0 || d == 1) return false; | |
47 t = two31 + ((uint32_t)d >> 31); | |
48 anc = t - 1 - t%ad; // Absolute value of nc. | |
49 p = 31; // Init. p. | |
50 q1 = two31/anc; // Init. q1 = 2**p/|nc|. | |
51 r1 = two31 - q1*anc; // Init. r1 = rem(2**p, |nc|). | |
52 q2 = two31/ad; // Init. q2 = 2**p/|d|. | |
53 r2 = two31 - q2*ad; // Init. r2 = rem(2**p, |d|). | |
54 do { | |
55 p = p + 1; | |
56 q1 = 2*q1; // Update q1 = 2**p/|nc|. | |
57 r1 = 2*r1; // Update r1 = rem(2**p, |nc|). | |
58 if (r1 >= anc) { // (Must be an unsigned | |
59 q1 = q1 + 1; // comparison here). | |
60 r1 = r1 - anc; | |
61 } | |
62 q2 = 2*q2; // Update q2 = 2**p/|d|. | |
63 r2 = 2*r2; // Update r2 = rem(2**p, |d|). | |
64 if (r2 >= ad) { // (Must be an unsigned | |
65 q2 = q2 + 1; // comparison here). | |
66 r2 = r2 - ad; | |
67 } | |
68 delta = ad - r2; | |
69 } while (q1 < delta || (q1 == delta && r1 == 0)); | |
70 | |
71 M = q2 + 1; | |
72 if (d < 0) M = -M; // Magic number and | |
73 s = p - 32; // shift amount to return. | |
74 | |
75 return true; | |
76 } | |
77 | |
78 //--------------------------transform_int_divide------------------------------- | |
79 // Convert a division by constant divisor into an alternate Ideal graph. | |
80 // Return NULL if no transformation occurs. | |
81 static Node *transform_int_divide( PhaseGVN *phase, Node *dividend, jint divisor ) { | |
0 | 82 |
83 // Check for invalid divisors | |
145 | 84 assert( divisor != 0 && divisor != min_jint, |
85 "bad divisor for transforming to long multiply" ); | |
0 | 86 |
145 | 87 bool d_pos = divisor >= 0; |
88 jint d = d_pos ? divisor : -divisor; | |
89 const int N = 32; | |
0 | 90 |
91 // Result | |
145 | 92 Node *q = NULL; |
0 | 93 |
94 if (d == 1) { | |
145 | 95 // division by +/- 1 |
96 if (!d_pos) { | |
97 // Just negate the value | |
0 | 98 q = new (phase->C, 3) SubINode(phase->intcon(0), dividend); |
99 } | |
145 | 100 } else if ( is_power_of_2(d) ) { |
101 // division by +/- a power of 2 | |
0 | 102 |
103 // See if we can simply do a shift without rounding | |
104 bool needs_rounding = true; | |
105 const Type *dt = phase->type(dividend); | |
106 const TypeInt *dti = dt->isa_int(); | |
145 | 107 if (dti && dti->_lo >= 0) { |
108 // we don't need to round a positive dividend | |
0 | 109 needs_rounding = false; |
145 | 110 } else if( dividend->Opcode() == Op_AndI ) { |
111 // An AND mask of sufficient size clears the low bits and | |
112 // I can avoid rounding. | |
400
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
113 const TypeInt *andconi_t = phase->type( dividend->in(2) )->isa_int(); |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
114 if( andconi_t && andconi_t->is_con() ) { |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
115 jint andconi = andconi_t->get_con(); |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
116 if( andconi < 0 && is_power_of_2(-andconi) && (-andconi) >= d ) { |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
117 dividend = dividend->in(1); |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
118 needs_rounding = false; |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
119 } |
0 | 120 } |
121 } | |
122 | |
123 // Add rounding to the shift to handle the sign bit | |
145 | 124 int l = log2_intptr(d-1)+1; |
125 if (needs_rounding) { | |
126 // Divide-by-power-of-2 can be made into a shift, but you have to do | |
127 // more math for the rounding. You need to add 0 for positive | |
128 // numbers, and "i-1" for negative numbers. Example: i=4, so the | |
129 // shift is by 2. You need to add 3 to negative dividends and 0 to | |
130 // positive ones. So (-7+3)>>2 becomes -1, (-4+3)>>2 becomes -1, | |
131 // (-2+3)>>2 becomes 0, etc. | |
132 | |
133 // Compute 0 or -1, based on sign bit | |
134 Node *sign = phase->transform(new (phase->C, 3) RShiftINode(dividend, phase->intcon(N - 1))); | |
135 // Mask sign bit to the low sign bits | |
136 Node *round = phase->transform(new (phase->C, 3) URShiftINode(sign, phase->intcon(N - l))); | |
137 // Round up before shifting | |
138 dividend = phase->transform(new (phase->C, 3) AddINode(dividend, round)); | |
0 | 139 } |
140 | |
145 | 141 // Shift for division |
0 | 142 q = new (phase->C, 3) RShiftINode(dividend, phase->intcon(l)); |
143 | |
145 | 144 if (!d_pos) { |
0 | 145 q = new (phase->C, 3) SubINode(phase->intcon(0), phase->transform(q)); |
145 | 146 } |
147 } else { | |
148 // Attempt the jint constant divide -> multiply transform found in | |
149 // "Division by Invariant Integers using Multiplication" | |
150 // by Granlund and Montgomery | |
151 // See also "Hacker's Delight", chapter 10 by Warren. | |
152 | |
153 jint magic_const; | |
154 jint shift_const; | |
155 if (magic_int_divide_constants(d, magic_const, shift_const)) { | |
156 Node *magic = phase->longcon(magic_const); | |
157 Node *dividend_long = phase->transform(new (phase->C, 2) ConvI2LNode(dividend)); | |
158 | |
159 // Compute the high half of the dividend x magic multiplication | |
160 Node *mul_hi = phase->transform(new (phase->C, 3) MulLNode(dividend_long, magic)); | |
161 | |
162 if (magic_const < 0) { | |
163 mul_hi = phase->transform(new (phase->C, 3) RShiftLNode(mul_hi, phase->intcon(N))); | |
164 mul_hi = phase->transform(new (phase->C, 2) ConvL2INode(mul_hi)); | |
165 | |
166 // The magic multiplier is too large for a 32 bit constant. We've adjusted | |
167 // it down by 2^32, but have to add 1 dividend back in after the multiplication. | |
168 // This handles the "overflow" case described by Granlund and Montgomery. | |
169 mul_hi = phase->transform(new (phase->C, 3) AddINode(dividend, mul_hi)); | |
170 | |
171 // Shift over the (adjusted) mulhi | |
172 if (shift_const != 0) { | |
173 mul_hi = phase->transform(new (phase->C, 3) RShiftINode(mul_hi, phase->intcon(shift_const))); | |
174 } | |
175 } else { | |
176 // No add is required, we can merge the shifts together. | |
177 mul_hi = phase->transform(new (phase->C, 3) RShiftLNode(mul_hi, phase->intcon(N + shift_const))); | |
178 mul_hi = phase->transform(new (phase->C, 2) ConvL2INode(mul_hi)); | |
179 } | |
180 | |
181 // Get a 0 or -1 from the sign of the dividend. | |
182 Node *addend0 = mul_hi; | |
183 Node *addend1 = phase->transform(new (phase->C, 3) RShiftINode(dividend, phase->intcon(N-1))); | |
184 | |
185 // If the divisor is negative, swap the order of the input addends; | |
186 // this has the effect of negating the quotient. | |
187 if (!d_pos) { | |
188 Node *temp = addend0; addend0 = addend1; addend1 = temp; | |
189 } | |
190 | |
191 // Adjust the final quotient by subtracting -1 (adding 1) | |
192 // from the mul_hi. | |
193 q = new (phase->C, 3) SubINode(addend0, addend1); | |
194 } | |
195 } | |
196 | |
197 return q; | |
198 } | |
199 | |
200 //---------------------magic_long_divide_constants----------------------------- | |
201 // Compute magic multiplier and shift constant for converting a 64 bit divide | |
202 // by constant into a multiply/shift/add series. Return false if calculations | |
203 // fail. | |
204 // | |
205 // Borrowed almost verbatum from Hacker's Delight by Henry S. Warren, Jr. with | |
206 // minor type name and parameter changes. Adjusted to 64 bit word width. | |
207 static bool magic_long_divide_constants(jlong d, jlong &M, jint &s) { | |
208 int64_t p; | |
209 uint64_t ad, anc, delta, q1, r1, q2, r2, t; | |
210 const uint64_t two63 = 0x8000000000000000LL; // 2**63. | |
211 | |
212 ad = ABS(d); | |
213 if (d == 0 || d == 1) return false; | |
214 t = two63 + ((uint64_t)d >> 63); | |
215 anc = t - 1 - t%ad; // Absolute value of nc. | |
216 p = 63; // Init. p. | |
217 q1 = two63/anc; // Init. q1 = 2**p/|nc|. | |
218 r1 = two63 - q1*anc; // Init. r1 = rem(2**p, |nc|). | |
219 q2 = two63/ad; // Init. q2 = 2**p/|d|. | |
220 r2 = two63 - q2*ad; // Init. r2 = rem(2**p, |d|). | |
221 do { | |
222 p = p + 1; | |
223 q1 = 2*q1; // Update q1 = 2**p/|nc|. | |
224 r1 = 2*r1; // Update r1 = rem(2**p, |nc|). | |
225 if (r1 >= anc) { // (Must be an unsigned | |
226 q1 = q1 + 1; // comparison here). | |
227 r1 = r1 - anc; | |
228 } | |
229 q2 = 2*q2; // Update q2 = 2**p/|d|. | |
230 r2 = 2*r2; // Update r2 = rem(2**p, |d|). | |
231 if (r2 >= ad) { // (Must be an unsigned | |
232 q2 = q2 + 1; // comparison here). | |
233 r2 = r2 - ad; | |
234 } | |
235 delta = ad - r2; | |
236 } while (q1 < delta || (q1 == delta && r1 == 0)); | |
237 | |
238 M = q2 + 1; | |
239 if (d < 0) M = -M; // Magic number and | |
240 s = p - 64; // shift amount to return. | |
241 | |
242 return true; | |
243 } | |
244 | |
245 //---------------------long_by_long_mulhi-------------------------------------- | |
246 // Generate ideal node graph for upper half of a 64 bit x 64 bit multiplication | |
247 static Node *long_by_long_mulhi( PhaseGVN *phase, Node *dividend, jlong magic_const) { | |
248 // If the architecture supports a 64x64 mulhi, there is | |
249 // no need to synthesize it in ideal nodes. | |
250 if (Matcher::has_match_rule(Op_MulHiL)) { | |
251 Node *v = phase->longcon(magic_const); | |
252 return new (phase->C, 3) MulHiLNode(dividend, v); | |
0 | 253 } |
254 | |
145 | 255 const int N = 64; |
256 | |
257 Node *u_hi = phase->transform(new (phase->C, 3) RShiftLNode(dividend, phase->intcon(N / 2))); | |
258 Node *u_lo = phase->transform(new (phase->C, 3) AndLNode(dividend, phase->longcon(0xFFFFFFFF))); | |
259 | |
260 Node *v_hi = phase->longcon(magic_const >> N/2); | |
261 Node *v_lo = phase->longcon(magic_const & 0XFFFFFFFF); | |
262 | |
263 Node *hihi_product = phase->transform(new (phase->C, 3) MulLNode(u_hi, v_hi)); | |
264 Node *hilo_product = phase->transform(new (phase->C, 3) MulLNode(u_hi, v_lo)); | |
265 Node *lohi_product = phase->transform(new (phase->C, 3) MulLNode(u_lo, v_hi)); | |
266 Node *lolo_product = phase->transform(new (phase->C, 3) MulLNode(u_lo, v_lo)); | |
267 | |
268 Node *t1 = phase->transform(new (phase->C, 3) URShiftLNode(lolo_product, phase->intcon(N / 2))); | |
269 Node *t2 = phase->transform(new (phase->C, 3) AddLNode(hilo_product, t1)); | |
294
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
270 |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
271 // Construct both t3 and t4 before transforming so t2 doesn't go dead |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
272 // prematurely. |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
273 Node *t3 = new (phase->C, 3) RShiftLNode(t2, phase->intcon(N / 2)); |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
274 Node *t4 = new (phase->C, 3) AndLNode(t2, phase->longcon(0xFFFFFFFF)); |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
275 t3 = phase->transform(t3); |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
276 t4 = phase->transform(t4); |
616a07a75c3c
6732154: REG: Printing an Image using image/gif doc flavor crashes the VM, Solsparc
rasbold
parents:
196
diff
changeset
|
277 |
145 | 278 Node *t5 = phase->transform(new (phase->C, 3) AddLNode(t4, lohi_product)); |
279 Node *t6 = phase->transform(new (phase->C, 3) RShiftLNode(t5, phase->intcon(N / 2))); | |
280 Node *t7 = phase->transform(new (phase->C, 3) AddLNode(t3, hihi_product)); | |
281 | |
282 return new (phase->C, 3) AddLNode(t7, t6); | |
283 } | |
284 | |
285 | |
286 //--------------------------transform_long_divide------------------------------ | |
287 // Convert a division by constant divisor into an alternate Ideal graph. | |
288 // Return NULL if no transformation occurs. | |
289 static Node *transform_long_divide( PhaseGVN *phase, Node *dividend, jlong divisor ) { | |
290 // Check for invalid divisors | |
291 assert( divisor != 0L && divisor != min_jlong, | |
292 "bad divisor for transforming to long multiply" ); | |
293 | |
294 bool d_pos = divisor >= 0; | |
295 jlong d = d_pos ? divisor : -divisor; | |
296 const int N = 64; | |
297 | |
298 // Result | |
299 Node *q = NULL; | |
300 | |
301 if (d == 1) { | |
302 // division by +/- 1 | |
303 if (!d_pos) { | |
304 // Just negate the value | |
305 q = new (phase->C, 3) SubLNode(phase->longcon(0), dividend); | |
306 } | |
307 } else if ( is_power_of_2_long(d) ) { | |
308 | |
309 // division by +/- a power of 2 | |
310 | |
311 // See if we can simply do a shift without rounding | |
312 bool needs_rounding = true; | |
313 const Type *dt = phase->type(dividend); | |
314 const TypeLong *dtl = dt->isa_long(); | |
0 | 315 |
145 | 316 if (dtl && dtl->_lo > 0) { |
317 // we don't need to round a positive dividend | |
318 needs_rounding = false; | |
319 } else if( dividend->Opcode() == Op_AndL ) { | |
320 // An AND mask of sufficient size clears the low bits and | |
321 // I can avoid rounding. | |
400
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
322 const TypeLong *andconl_t = phase->type( dividend->in(2) )->isa_long(); |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
323 if( andconl_t && andconl_t->is_con() ) { |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
324 jlong andconl = andconl_t->get_con(); |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
325 if( andconl < 0 && is_power_of_2_long(-andconl) && (-andconl) >= d ) { |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
326 dividend = dividend->in(1); |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
327 needs_rounding = false; |
cc80376deb0c
6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents:
305
diff
changeset
|
328 } |
145 | 329 } |
330 } | |
331 | |
332 // Add rounding to the shift to handle the sign bit | |
333 int l = log2_long(d-1)+1; | |
334 if (needs_rounding) { | |
335 // Divide-by-power-of-2 can be made into a shift, but you have to do | |
336 // more math for the rounding. You need to add 0 for positive | |
337 // numbers, and "i-1" for negative numbers. Example: i=4, so the | |
338 // shift is by 2. You need to add 3 to negative dividends and 0 to | |
339 // positive ones. So (-7+3)>>2 becomes -1, (-4+3)>>2 becomes -1, | |
340 // (-2+3)>>2 becomes 0, etc. | |
341 | |
342 // Compute 0 or -1, based on sign bit | |
343 Node *sign = phase->transform(new (phase->C, 3) RShiftLNode(dividend, phase->intcon(N - 1))); | |
344 // Mask sign bit to the low sign bits | |
345 Node *round = phase->transform(new (phase->C, 3) URShiftLNode(sign, phase->intcon(N - l))); | |
346 // Round up before shifting | |
347 dividend = phase->transform(new (phase->C, 3) AddLNode(dividend, round)); | |
348 } | |
349 | |
350 // Shift for division | |
351 q = new (phase->C, 3) RShiftLNode(dividend, phase->intcon(l)); | |
352 | |
353 if (!d_pos) { | |
354 q = new (phase->C, 3) SubLNode(phase->longcon(0), phase->transform(q)); | |
355 } | |
356 } else { | |
357 // Attempt the jlong constant divide -> multiply transform found in | |
358 // "Division by Invariant Integers using Multiplication" | |
359 // by Granlund and Montgomery | |
360 // See also "Hacker's Delight", chapter 10 by Warren. | |
361 | |
362 jlong magic_const; | |
363 jint shift_const; | |
364 if (magic_long_divide_constants(d, magic_const, shift_const)) { | |
365 // Compute the high half of the dividend x magic multiplication | |
366 Node *mul_hi = phase->transform(long_by_long_mulhi(phase, dividend, magic_const)); | |
367 | |
368 // The high half of the 128-bit multiply is computed. | |
369 if (magic_const < 0) { | |
370 // The magic multiplier is too large for a 64 bit constant. We've adjusted | |
371 // it down by 2^64, but have to add 1 dividend back in after the multiplication. | |
372 // This handles the "overflow" case described by Granlund and Montgomery. | |
373 mul_hi = phase->transform(new (phase->C, 3) AddLNode(dividend, mul_hi)); | |
374 } | |
375 | |
376 // Shift over the (adjusted) mulhi | |
377 if (shift_const != 0) { | |
378 mul_hi = phase->transform(new (phase->C, 3) RShiftLNode(mul_hi, phase->intcon(shift_const))); | |
379 } | |
380 | |
381 // Get a 0 or -1 from the sign of the dividend. | |
382 Node *addend0 = mul_hi; | |
383 Node *addend1 = phase->transform(new (phase->C, 3) RShiftLNode(dividend, phase->intcon(N-1))); | |
384 | |
385 // If the divisor is negative, swap the order of the input addends; | |
386 // this has the effect of negating the quotient. | |
387 if (!d_pos) { | |
388 Node *temp = addend0; addend0 = addend1; addend1 = temp; | |
389 } | |
390 | |
391 // Adjust the final quotient by subtracting -1 (adding 1) | |
392 // from the mul_hi. | |
393 q = new (phase->C, 3) SubLNode(addend0, addend1); | |
394 } | |
0 | 395 } |
396 | |
145 | 397 return q; |
0 | 398 } |
399 | |
400 //============================================================================= | |
401 //------------------------------Identity--------------------------------------- | |
402 // If the divisor is 1, we are an identity on the dividend. | |
403 Node *DivINode::Identity( PhaseTransform *phase ) { | |
404 return (phase->type( in(2) )->higher_equal(TypeInt::ONE)) ? in(1) : this; | |
405 } | |
406 | |
407 //------------------------------Idealize--------------------------------------- | |
408 // Divides can be changed to multiplies and/or shifts | |
409 Node *DivINode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
410 if (in(0) && remove_dead_region(phase, can_reshape)) return this; | |
305 | 411 // Don't bother trying to transform a dead node |
412 if( in(0) && in(0)->is_top() ) return NULL; | |
0 | 413 |
414 const Type *t = phase->type( in(2) ); | |
415 if( t == TypeInt::ONE ) // Identity? | |
416 return NULL; // Skip it | |
417 | |
418 const TypeInt *ti = t->isa_int(); | |
419 if( !ti ) return NULL; | |
420 if( !ti->is_con() ) return NULL; | |
145 | 421 jint i = ti->get_con(); // Get divisor |
0 | 422 |
423 if (i == 0) return NULL; // Dividing by zero constant does not idealize | |
424 | |
425 set_req(0,NULL); // Dividing by a not-zero constant; no faulting | |
426 | |
427 // Dividing by MININT does not optimize as a power-of-2 shift. | |
428 if( i == min_jint ) return NULL; | |
429 | |
145 | 430 return transform_int_divide( phase, in(1), i ); |
0 | 431 } |
432 | |
433 //------------------------------Value------------------------------------------ | |
434 // A DivINode divides its inputs. The third input is a Control input, used to | |
435 // prevent hoisting the divide above an unsafe test. | |
436 const Type *DivINode::Value( PhaseTransform *phase ) const { | |
437 // Either input is TOP ==> the result is TOP | |
438 const Type *t1 = phase->type( in(1) ); | |
439 const Type *t2 = phase->type( in(2) ); | |
440 if( t1 == Type::TOP ) return Type::TOP; | |
441 if( t2 == Type::TOP ) return Type::TOP; | |
442 | |
443 // x/x == 1 since we always generate the dynamic divisor check for 0. | |
444 if( phase->eqv( in(1), in(2) ) ) | |
445 return TypeInt::ONE; | |
446 | |
447 // Either input is BOTTOM ==> the result is the local BOTTOM | |
448 const Type *bot = bottom_type(); | |
449 if( (t1 == bot) || (t2 == bot) || | |
450 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
451 return bot; | |
452 | |
453 // Divide the two numbers. We approximate. | |
454 // If divisor is a constant and not zero | |
455 const TypeInt *i1 = t1->is_int(); | |
456 const TypeInt *i2 = t2->is_int(); | |
457 int widen = MAX2(i1->_widen, i2->_widen); | |
458 | |
459 if( i2->is_con() && i2->get_con() != 0 ) { | |
460 int32 d = i2->get_con(); // Divisor | |
461 jint lo, hi; | |
462 if( d >= 0 ) { | |
463 lo = i1->_lo/d; | |
464 hi = i1->_hi/d; | |
465 } else { | |
466 if( d == -1 && i1->_lo == min_jint ) { | |
467 // 'min_jint/-1' throws arithmetic exception during compilation | |
468 lo = min_jint; | |
469 // do not support holes, 'hi' must go to either min_jint or max_jint: | |
470 // [min_jint, -10]/[-1,-1] ==> [min_jint] UNION [10,max_jint] | |
471 hi = i1->_hi == min_jint ? min_jint : max_jint; | |
472 } else { | |
473 lo = i1->_hi/d; | |
474 hi = i1->_lo/d; | |
475 } | |
476 } | |
477 return TypeInt::make(lo, hi, widen); | |
478 } | |
479 | |
480 // If the dividend is a constant | |
481 if( i1->is_con() ) { | |
482 int32 d = i1->get_con(); | |
483 if( d < 0 ) { | |
484 if( d == min_jint ) { | |
485 // (-min_jint) == min_jint == (min_jint / -1) | |
486 return TypeInt::make(min_jint, max_jint/2 + 1, widen); | |
487 } else { | |
488 return TypeInt::make(d, -d, widen); | |
489 } | |
490 } | |
491 return TypeInt::make(-d, d, widen); | |
492 } | |
493 | |
494 // Otherwise we give up all hope | |
495 return TypeInt::INT; | |
496 } | |
497 | |
498 | |
499 //============================================================================= | |
500 //------------------------------Identity--------------------------------------- | |
501 // If the divisor is 1, we are an identity on the dividend. | |
502 Node *DivLNode::Identity( PhaseTransform *phase ) { | |
503 return (phase->type( in(2) )->higher_equal(TypeLong::ONE)) ? in(1) : this; | |
504 } | |
505 | |
506 //------------------------------Idealize--------------------------------------- | |
507 // Dividing by a power of 2 is a shift. | |
508 Node *DivLNode::Ideal( PhaseGVN *phase, bool can_reshape) { | |
509 if (in(0) && remove_dead_region(phase, can_reshape)) return this; | |
305 | 510 // Don't bother trying to transform a dead node |
511 if( in(0) && in(0)->is_top() ) return NULL; | |
0 | 512 |
513 const Type *t = phase->type( in(2) ); | |
145 | 514 if( t == TypeLong::ONE ) // Identity? |
0 | 515 return NULL; // Skip it |
516 | |
145 | 517 const TypeLong *tl = t->isa_long(); |
518 if( !tl ) return NULL; | |
519 if( !tl->is_con() ) return NULL; | |
520 jlong l = tl->get_con(); // Get divisor | |
521 | |
522 if (l == 0) return NULL; // Dividing by zero constant does not idealize | |
523 | |
524 set_req(0,NULL); // Dividing by a not-zero constant; no faulting | |
0 | 525 |
526 // Dividing by MININT does not optimize as a power-of-2 shift. | |
145 | 527 if( l == min_jlong ) return NULL; |
0 | 528 |
145 | 529 return transform_long_divide( phase, in(1), l ); |
0 | 530 } |
531 | |
532 //------------------------------Value------------------------------------------ | |
533 // A DivLNode divides its inputs. The third input is a Control input, used to | |
534 // prevent hoisting the divide above an unsafe test. | |
535 const Type *DivLNode::Value( PhaseTransform *phase ) const { | |
536 // Either input is TOP ==> the result is TOP | |
537 const Type *t1 = phase->type( in(1) ); | |
538 const Type *t2 = phase->type( in(2) ); | |
539 if( t1 == Type::TOP ) return Type::TOP; | |
540 if( t2 == Type::TOP ) return Type::TOP; | |
541 | |
542 // x/x == 1 since we always generate the dynamic divisor check for 0. | |
543 if( phase->eqv( in(1), in(2) ) ) | |
544 return TypeLong::ONE; | |
545 | |
546 // Either input is BOTTOM ==> the result is the local BOTTOM | |
547 const Type *bot = bottom_type(); | |
548 if( (t1 == bot) || (t2 == bot) || | |
549 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
550 return bot; | |
551 | |
552 // Divide the two numbers. We approximate. | |
553 // If divisor is a constant and not zero | |
554 const TypeLong *i1 = t1->is_long(); | |
555 const TypeLong *i2 = t2->is_long(); | |
556 int widen = MAX2(i1->_widen, i2->_widen); | |
557 | |
558 if( i2->is_con() && i2->get_con() != 0 ) { | |
559 jlong d = i2->get_con(); // Divisor | |
560 jlong lo, hi; | |
561 if( d >= 0 ) { | |
562 lo = i1->_lo/d; | |
563 hi = i1->_hi/d; | |
564 } else { | |
565 if( d == CONST64(-1) && i1->_lo == min_jlong ) { | |
566 // 'min_jlong/-1' throws arithmetic exception during compilation | |
567 lo = min_jlong; | |
568 // do not support holes, 'hi' must go to either min_jlong or max_jlong: | |
569 // [min_jlong, -10]/[-1,-1] ==> [min_jlong] UNION [10,max_jlong] | |
570 hi = i1->_hi == min_jlong ? min_jlong : max_jlong; | |
571 } else { | |
572 lo = i1->_hi/d; | |
573 hi = i1->_lo/d; | |
574 } | |
575 } | |
576 return TypeLong::make(lo, hi, widen); | |
577 } | |
578 | |
579 // If the dividend is a constant | |
580 if( i1->is_con() ) { | |
581 jlong d = i1->get_con(); | |
582 if( d < 0 ) { | |
583 if( d == min_jlong ) { | |
584 // (-min_jlong) == min_jlong == (min_jlong / -1) | |
585 return TypeLong::make(min_jlong, max_jlong/2 + 1, widen); | |
586 } else { | |
587 return TypeLong::make(d, -d, widen); | |
588 } | |
589 } | |
590 return TypeLong::make(-d, d, widen); | |
591 } | |
592 | |
593 // Otherwise we give up all hope | |
594 return TypeLong::LONG; | |
595 } | |
596 | |
597 | |
598 //============================================================================= | |
599 //------------------------------Value------------------------------------------ | |
600 // An DivFNode divides its inputs. The third input is a Control input, used to | |
601 // prevent hoisting the divide above an unsafe test. | |
602 const Type *DivFNode::Value( PhaseTransform *phase ) const { | |
603 // Either input is TOP ==> the result is TOP | |
604 const Type *t1 = phase->type( in(1) ); | |
605 const Type *t2 = phase->type( in(2) ); | |
606 if( t1 == Type::TOP ) return Type::TOP; | |
607 if( t2 == Type::TOP ) return Type::TOP; | |
608 | |
609 // Either input is BOTTOM ==> the result is the local BOTTOM | |
610 const Type *bot = bottom_type(); | |
611 if( (t1 == bot) || (t2 == bot) || | |
612 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
613 return bot; | |
614 | |
615 // x/x == 1, we ignore 0/0. | |
616 // Note: if t1 and t2 are zero then result is NaN (JVMS page 213) | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
617 // Does not work for variables because of NaN's |
0 | 618 if( phase->eqv( in(1), in(2) ) && t1->base() == Type::FloatCon) |
619 if (!g_isnan(t1->getf()) && g_isfinite(t1->getf()) && t1->getf() != 0.0) // could be negative ZERO or NaN | |
620 return TypeF::ONE; | |
621 | |
622 if( t2 == TypeF::ONE ) | |
623 return t1; | |
624 | |
625 // If divisor is a constant and not zero, divide them numbers | |
626 if( t1->base() == Type::FloatCon && | |
627 t2->base() == Type::FloatCon && | |
628 t2->getf() != 0.0 ) // could be negative zero | |
629 return TypeF::make( t1->getf()/t2->getf() ); | |
630 | |
631 // If the dividend is a constant zero | |
632 // Note: if t1 and t2 are zero then result is NaN (JVMS page 213) | |
633 // Test TypeF::ZERO is not sufficient as it could be negative zero | |
634 | |
635 if( t1 == TypeF::ZERO && !g_isnan(t2->getf()) && t2->getf() != 0.0 ) | |
636 return TypeF::ZERO; | |
637 | |
638 // Otherwise we give up all hope | |
639 return Type::FLOAT; | |
640 } | |
641 | |
642 //------------------------------isA_Copy--------------------------------------- | |
643 // Dividing by self is 1. | |
644 // If the divisor is 1, we are an identity on the dividend. | |
645 Node *DivFNode::Identity( PhaseTransform *phase ) { | |
646 return (phase->type( in(2) ) == TypeF::ONE) ? in(1) : this; | |
647 } | |
648 | |
649 | |
650 //------------------------------Idealize--------------------------------------- | |
651 Node *DivFNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
652 if (in(0) && remove_dead_region(phase, can_reshape)) return this; | |
305 | 653 // Don't bother trying to transform a dead node |
654 if( in(0) && in(0)->is_top() ) return NULL; | |
0 | 655 |
656 const Type *t2 = phase->type( in(2) ); | |
657 if( t2 == TypeF::ONE ) // Identity? | |
658 return NULL; // Skip it | |
659 | |
660 const TypeF *tf = t2->isa_float_constant(); | |
661 if( !tf ) return NULL; | |
662 if( tf->base() != Type::FloatCon ) return NULL; | |
663 | |
664 // Check for out of range values | |
665 if( tf->is_nan() || !tf->is_finite() ) return NULL; | |
666 | |
667 // Get the value | |
668 float f = tf->getf(); | |
669 int exp; | |
670 | |
671 // Only for special case of dividing by a power of 2 | |
672 if( frexp((double)f, &exp) != 0.5 ) return NULL; | |
673 | |
674 // Limit the range of acceptable exponents | |
675 if( exp < -126 || exp > 126 ) return NULL; | |
676 | |
677 // Compute the reciprocal | |
678 float reciprocal = ((float)1.0) / f; | |
679 | |
680 assert( frexp((double)reciprocal, &exp) == 0.5, "reciprocal should be power of 2" ); | |
681 | |
682 // return multiplication by the reciprocal | |
683 return (new (phase->C, 3) MulFNode(in(1), phase->makecon(TypeF::make(reciprocal)))); | |
684 } | |
685 | |
686 //============================================================================= | |
687 //------------------------------Value------------------------------------------ | |
688 // An DivDNode divides its inputs. The third input is a Control input, used to | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
689 // prevent hoisting the divide above an unsafe test. |
0 | 690 const Type *DivDNode::Value( PhaseTransform *phase ) const { |
691 // Either input is TOP ==> the result is TOP | |
692 const Type *t1 = phase->type( in(1) ); | |
693 const Type *t2 = phase->type( in(2) ); | |
694 if( t1 == Type::TOP ) return Type::TOP; | |
695 if( t2 == Type::TOP ) return Type::TOP; | |
696 | |
697 // Either input is BOTTOM ==> the result is the local BOTTOM | |
698 const Type *bot = bottom_type(); | |
699 if( (t1 == bot) || (t2 == bot) || | |
700 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
701 return bot; | |
702 | |
703 // x/x == 1, we ignore 0/0. | |
704 // Note: if t1 and t2 are zero then result is NaN (JVMS page 213) | |
705 // Does not work for variables because of NaN's | |
706 if( phase->eqv( in(1), in(2) ) && t1->base() == Type::DoubleCon) | |
707 if (!g_isnan(t1->getd()) && g_isfinite(t1->getd()) && t1->getd() != 0.0) // could be negative ZERO or NaN | |
708 return TypeD::ONE; | |
709 | |
710 if( t2 == TypeD::ONE ) | |
711 return t1; | |
712 | |
404
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
713 #if defined(IA32) |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
714 if (!phase->C->method()->is_strict()) |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
715 // Can't trust native compilers to properly fold strict double |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
716 // division with round-to-zero on this platform. |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
717 #endif |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
718 { |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
719 // If divisor is a constant and not zero, divide them numbers |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
720 if( t1->base() == Type::DoubleCon && |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
721 t2->base() == Type::DoubleCon && |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
722 t2->getd() != 0.0 ) // could be negative zero |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
723 return TypeD::make( t1->getd()/t2->getd() ); |
78c058bc5cdc
6717150: improper constant folding of subnormal strictfp multiplications and divides
rasbold
parents:
400
diff
changeset
|
724 } |
0 | 725 |
726 // If the dividend is a constant zero | |
727 // Note: if t1 and t2 are zero then result is NaN (JVMS page 213) | |
728 // Test TypeF::ZERO is not sufficient as it could be negative zero | |
729 if( t1 == TypeD::ZERO && !g_isnan(t2->getd()) && t2->getd() != 0.0 ) | |
730 return TypeD::ZERO; | |
731 | |
732 // Otherwise we give up all hope | |
733 return Type::DOUBLE; | |
734 } | |
735 | |
736 | |
737 //------------------------------isA_Copy--------------------------------------- | |
738 // Dividing by self is 1. | |
739 // If the divisor is 1, we are an identity on the dividend. | |
740 Node *DivDNode::Identity( PhaseTransform *phase ) { | |
741 return (phase->type( in(2) ) == TypeD::ONE) ? in(1) : this; | |
742 } | |
743 | |
744 //------------------------------Idealize--------------------------------------- | |
745 Node *DivDNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
746 if (in(0) && remove_dead_region(phase, can_reshape)) return this; | |
305 | 747 // Don't bother trying to transform a dead node |
748 if( in(0) && in(0)->is_top() ) return NULL; | |
0 | 749 |
750 const Type *t2 = phase->type( in(2) ); | |
751 if( t2 == TypeD::ONE ) // Identity? | |
752 return NULL; // Skip it | |
753 | |
754 const TypeD *td = t2->isa_double_constant(); | |
755 if( !td ) return NULL; | |
756 if( td->base() != Type::DoubleCon ) return NULL; | |
757 | |
758 // Check for out of range values | |
759 if( td->is_nan() || !td->is_finite() ) return NULL; | |
760 | |
761 // Get the value | |
762 double d = td->getd(); | |
763 int exp; | |
764 | |
765 // Only for special case of dividing by a power of 2 | |
766 if( frexp(d, &exp) != 0.5 ) return NULL; | |
767 | |
768 // Limit the range of acceptable exponents | |
769 if( exp < -1021 || exp > 1022 ) return NULL; | |
770 | |
771 // Compute the reciprocal | |
772 double reciprocal = 1.0 / d; | |
773 | |
774 assert( frexp(reciprocal, &exp) == 0.5, "reciprocal should be power of 2" ); | |
775 | |
776 // return multiplication by the reciprocal | |
777 return (new (phase->C, 3) MulDNode(in(1), phase->makecon(TypeD::make(reciprocal)))); | |
778 } | |
779 | |
780 //============================================================================= | |
781 //------------------------------Idealize--------------------------------------- | |
782 Node *ModINode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
783 // Check for dead control input | |
305 | 784 if( in(0) && remove_dead_region(phase, can_reshape) ) return this; |
785 // Don't bother trying to transform a dead node | |
786 if( in(0) && in(0)->is_top() ) return NULL; | |
0 | 787 |
788 // Get the modulus | |
789 const Type *t = phase->type( in(2) ); | |
790 if( t == Type::TOP ) return NULL; | |
791 const TypeInt *ti = t->is_int(); | |
792 | |
793 // Check for useless control input | |
794 // Check for excluding mod-zero case | |
795 if( in(0) && (ti->_hi < 0 || ti->_lo > 0) ) { | |
796 set_req(0, NULL); // Yank control input | |
797 return this; | |
798 } | |
799 | |
800 // See if we are MOD'ing by 2^k or 2^k-1. | |
801 if( !ti->is_con() ) return NULL; | |
802 jint con = ti->get_con(); | |
803 | |
804 Node *hook = new (phase->C, 1) Node(1); | |
805 | |
806 // First, special check for modulo 2^k-1 | |
807 if( con >= 0 && con < max_jint && is_power_of_2(con+1) ) { | |
808 uint k = exact_log2(con+1); // Extract k | |
809 | |
810 // Basic algorithm by David Detlefs. See fastmod_int.java for gory details. | |
811 static int unroll_factor[] = { 999, 999, 29, 14, 9, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1 /*past here we assume 1 forever*/}; | |
812 int trip_count = 1; | |
813 if( k < ARRAY_SIZE(unroll_factor)) trip_count = unroll_factor[k]; | |
814 | |
815 // If the unroll factor is not too large, and if conditional moves are | |
816 // ok, then use this case | |
817 if( trip_count <= 5 && ConditionalMoveLimit != 0 ) { | |
818 Node *x = in(1); // Value being mod'd | |
819 Node *divisor = in(2); // Also is mask | |
820 | |
821 hook->init_req(0, x); // Add a use to x to prevent him from dying | |
822 // Generate code to reduce X rapidly to nearly 2^k-1. | |
823 for( int i = 0; i < trip_count; i++ ) { | |
145 | 824 Node *xl = phase->transform( new (phase->C, 3) AndINode(x,divisor) ); |
825 Node *xh = phase->transform( new (phase->C, 3) RShiftINode(x,phase->intcon(k)) ); // Must be signed | |
826 x = phase->transform( new (phase->C, 3) AddINode(xh,xl) ); | |
827 hook->set_req(0, x); | |
0 | 828 } |
829 | |
830 // Generate sign-fixup code. Was original value positive? | |
831 // int hack_res = (i >= 0) ? divisor : 1; | |
832 Node *cmp1 = phase->transform( new (phase->C, 3) CmpINode( in(1), phase->intcon(0) ) ); | |
833 Node *bol1 = phase->transform( new (phase->C, 2) BoolNode( cmp1, BoolTest::ge ) ); | |
834 Node *cmov1= phase->transform( new (phase->C, 4) CMoveINode(bol1, phase->intcon(1), divisor, TypeInt::POS) ); | |
835 // if( x >= hack_res ) x -= divisor; | |
836 Node *sub = phase->transform( new (phase->C, 3) SubINode( x, divisor ) ); | |
837 Node *cmp2 = phase->transform( new (phase->C, 3) CmpINode( x, cmov1 ) ); | |
838 Node *bol2 = phase->transform( new (phase->C, 2) BoolNode( cmp2, BoolTest::ge ) ); | |
839 // Convention is to not transform the return value of an Ideal | |
840 // since Ideal is expected to return a modified 'this' or a new node. | |
841 Node *cmov2= new (phase->C, 4) CMoveINode(bol2, x, sub, TypeInt::INT); | |
842 // cmov2 is now the mod | |
843 | |
844 // Now remove the bogus extra edges used to keep things alive | |
845 if (can_reshape) { | |
846 phase->is_IterGVN()->remove_dead_node(hook); | |
847 } else { | |
848 hook->set_req(0, NULL); // Just yank bogus edge during Parse phase | |
849 } | |
850 return cmov2; | |
851 } | |
852 } | |
853 | |
854 // Fell thru, the unroll case is not appropriate. Transform the modulo | |
855 // into a long multiply/int multiply/subtract case | |
856 | |
857 // Cannot handle mod 0, and min_jint isn't handled by the transform | |
858 if( con == 0 || con == min_jint ) return NULL; | |
859 | |
860 // Get the absolute value of the constant; at this point, we can use this | |
861 jint pos_con = (con >= 0) ? con : -con; | |
862 | |
863 // integer Mod 1 is always 0 | |
864 if( pos_con == 1 ) return new (phase->C, 1) ConINode(TypeInt::ZERO); | |
865 | |
866 int log2_con = -1; | |
867 | |
868 // If this is a power of two, they maybe we can mask it | |
869 if( is_power_of_2(pos_con) ) { | |
870 log2_con = log2_intptr((intptr_t)pos_con); | |
871 | |
872 const Type *dt = phase->type(in(1)); | |
873 const TypeInt *dti = dt->isa_int(); | |
874 | |
875 // See if this can be masked, if the dividend is non-negative | |
876 if( dti && dti->_lo >= 0 ) | |
877 return ( new (phase->C, 3) AndINode( in(1), phase->intcon( pos_con-1 ) ) ); | |
878 } | |
879 | |
880 // Save in(1) so that it cannot be changed or deleted | |
881 hook->init_req(0, in(1)); | |
882 | |
883 // Divide using the transform from DivI to MulL | |
145 | 884 Node *result = transform_int_divide( phase, in(1), pos_con ); |
885 if (result != NULL) { | |
886 Node *divide = phase->transform(result); | |
0 | 887 |
145 | 888 // Re-multiply, using a shift if this is a power of two |
889 Node *mult = NULL; | |
0 | 890 |
145 | 891 if( log2_con >= 0 ) |
892 mult = phase->transform( new (phase->C, 3) LShiftINode( divide, phase->intcon( log2_con ) ) ); | |
893 else | |
894 mult = phase->transform( new (phase->C, 3) MulINode( divide, phase->intcon( pos_con ) ) ); | |
0 | 895 |
145 | 896 // Finally, subtract the multiplied divided value from the original |
897 result = new (phase->C, 3) SubINode( in(1), mult ); | |
898 } | |
0 | 899 |
900 // Now remove the bogus extra edges used to keep things alive | |
901 if (can_reshape) { | |
902 phase->is_IterGVN()->remove_dead_node(hook); | |
903 } else { | |
904 hook->set_req(0, NULL); // Just yank bogus edge during Parse phase | |
905 } | |
906 | |
907 // return the value | |
908 return result; | |
909 } | |
910 | |
911 //------------------------------Value------------------------------------------ | |
912 const Type *ModINode::Value( PhaseTransform *phase ) const { | |
913 // Either input is TOP ==> the result is TOP | |
914 const Type *t1 = phase->type( in(1) ); | |
915 const Type *t2 = phase->type( in(2) ); | |
916 if( t1 == Type::TOP ) return Type::TOP; | |
917 if( t2 == Type::TOP ) return Type::TOP; | |
918 | |
919 // We always generate the dynamic check for 0. | |
920 // 0 MOD X is 0 | |
921 if( t1 == TypeInt::ZERO ) return TypeInt::ZERO; | |
922 // X MOD X is 0 | |
923 if( phase->eqv( in(1), in(2) ) ) return TypeInt::ZERO; | |
924 | |
925 // Either input is BOTTOM ==> the result is the local BOTTOM | |
926 const Type *bot = bottom_type(); | |
927 if( (t1 == bot) || (t2 == bot) || | |
928 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
929 return bot; | |
930 | |
931 const TypeInt *i1 = t1->is_int(); | |
932 const TypeInt *i2 = t2->is_int(); | |
933 if( !i1->is_con() || !i2->is_con() ) { | |
934 if( i1->_lo >= 0 && i2->_lo >= 0 ) | |
935 return TypeInt::POS; | |
936 // If both numbers are not constants, we know little. | |
937 return TypeInt::INT; | |
938 } | |
939 // Mod by zero? Throw exception at runtime! | |
940 if( !i2->get_con() ) return TypeInt::POS; | |
941 | |
942 // We must be modulo'ing 2 float constants. | |
943 // Check for min_jint % '-1', result is defined to be '0'. | |
944 if( i1->get_con() == min_jint && i2->get_con() == -1 ) | |
945 return TypeInt::ZERO; | |
946 | |
947 return TypeInt::make( i1->get_con() % i2->get_con() ); | |
948 } | |
949 | |
950 | |
951 //============================================================================= | |
952 //------------------------------Idealize--------------------------------------- | |
953 Node *ModLNode::Ideal(PhaseGVN *phase, bool can_reshape) { | |
954 // Check for dead control input | |
305 | 955 if( in(0) && remove_dead_region(phase, can_reshape) ) return this; |
956 // Don't bother trying to transform a dead node | |
957 if( in(0) && in(0)->is_top() ) return NULL; | |
0 | 958 |
959 // Get the modulus | |
960 const Type *t = phase->type( in(2) ); | |
961 if( t == Type::TOP ) return NULL; | |
145 | 962 const TypeLong *tl = t->is_long(); |
0 | 963 |
964 // Check for useless control input | |
965 // Check for excluding mod-zero case | |
145 | 966 if( in(0) && (tl->_hi < 0 || tl->_lo > 0) ) { |
0 | 967 set_req(0, NULL); // Yank control input |
968 return this; | |
969 } | |
970 | |
971 // See if we are MOD'ing by 2^k or 2^k-1. | |
145 | 972 if( !tl->is_con() ) return NULL; |
973 jlong con = tl->get_con(); | |
974 | |
975 Node *hook = new (phase->C, 1) Node(1); | |
0 | 976 |
977 // Expand mod | |
145 | 978 if( con >= 0 && con < max_jlong && is_power_of_2_long(con+1) ) { |
979 uint k = log2_long(con); // Extract k | |
980 | |
0 | 981 // Basic algorithm by David Detlefs. See fastmod_long.java for gory details. |
982 // Used to help a popular random number generator which does a long-mod | |
983 // of 2^31-1 and shows up in SpecJBB and SciMark. | |
984 static int unroll_factor[] = { 999, 999, 61, 30, 20, 15, 12, 10, 8, 7, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1 /*past here we assume 1 forever*/}; | |
985 int trip_count = 1; | |
986 if( k < ARRAY_SIZE(unroll_factor)) trip_count = unroll_factor[k]; | |
987 | |
145 | 988 // If the unroll factor is not too large, and if conditional moves are |
989 // ok, then use this case | |
990 if( trip_count <= 5 && ConditionalMoveLimit != 0 ) { | |
991 Node *x = in(1); // Value being mod'd | |
992 Node *divisor = in(2); // Also is mask | |
0 | 993 |
145 | 994 hook->init_req(0, x); // Add a use to x to prevent him from dying |
995 // Generate code to reduce X rapidly to nearly 2^k-1. | |
996 for( int i = 0; i < trip_count; i++ ) { | |
0 | 997 Node *xl = phase->transform( new (phase->C, 3) AndLNode(x,divisor) ); |
998 Node *xh = phase->transform( new (phase->C, 3) RShiftLNode(x,phase->intcon(k)) ); // Must be signed | |
999 x = phase->transform( new (phase->C, 3) AddLNode(xh,xl) ); | |
1000 hook->set_req(0, x); // Add a use to x to prevent him from dying | |
145 | 1001 } |
1002 | |
1003 // Generate sign-fixup code. Was original value positive? | |
1004 // long hack_res = (i >= 0) ? divisor : CONST64(1); | |
1005 Node *cmp1 = phase->transform( new (phase->C, 3) CmpLNode( in(1), phase->longcon(0) ) ); | |
1006 Node *bol1 = phase->transform( new (phase->C, 2) BoolNode( cmp1, BoolTest::ge ) ); | |
1007 Node *cmov1= phase->transform( new (phase->C, 4) CMoveLNode(bol1, phase->longcon(1), divisor, TypeLong::LONG) ); | |
1008 // if( x >= hack_res ) x -= divisor; | |
1009 Node *sub = phase->transform( new (phase->C, 3) SubLNode( x, divisor ) ); | |
1010 Node *cmp2 = phase->transform( new (phase->C, 3) CmpLNode( x, cmov1 ) ); | |
1011 Node *bol2 = phase->transform( new (phase->C, 2) BoolNode( cmp2, BoolTest::ge ) ); | |
1012 // Convention is to not transform the return value of an Ideal | |
1013 // since Ideal is expected to return a modified 'this' or a new node. | |
1014 Node *cmov2= new (phase->C, 4) CMoveLNode(bol2, x, sub, TypeLong::LONG); | |
1015 // cmov2 is now the mod | |
1016 | |
1017 // Now remove the bogus extra edges used to keep things alive | |
1018 if (can_reshape) { | |
1019 phase->is_IterGVN()->remove_dead_node(hook); | |
1020 } else { | |
1021 hook->set_req(0, NULL); // Just yank bogus edge during Parse phase | |
1022 } | |
1023 return cmov2; | |
0 | 1024 } |
145 | 1025 } |
1026 | |
1027 // Fell thru, the unroll case is not appropriate. Transform the modulo | |
1028 // into a long multiply/int multiply/subtract case | |
1029 | |
1030 // Cannot handle mod 0, and min_jint isn't handled by the transform | |
1031 if( con == 0 || con == min_jlong ) return NULL; | |
1032 | |
1033 // Get the absolute value of the constant; at this point, we can use this | |
1034 jlong pos_con = (con >= 0) ? con : -con; | |
1035 | |
1036 // integer Mod 1 is always 0 | |
1037 if( pos_con == 1 ) return new (phase->C, 1) ConLNode(TypeLong::ZERO); | |
1038 | |
1039 int log2_con = -1; | |
1040 | |
1041 // If this is a power of two, they maybe we can mask it | |
1042 if( is_power_of_2_long(pos_con) ) { | |
1043 log2_con = log2_long(pos_con); | |
1044 | |
1045 const Type *dt = phase->type(in(1)); | |
1046 const TypeLong *dtl = dt->isa_long(); | |
1047 | |
1048 // See if this can be masked, if the dividend is non-negative | |
1049 if( dtl && dtl->_lo >= 0 ) | |
1050 return ( new (phase->C, 3) AndLNode( in(1), phase->longcon( pos_con-1 ) ) ); | |
1051 } | |
0 | 1052 |
145 | 1053 // Save in(1) so that it cannot be changed or deleted |
1054 hook->init_req(0, in(1)); | |
1055 | |
1056 // Divide using the transform from DivI to MulL | |
1057 Node *result = transform_long_divide( phase, in(1), pos_con ); | |
1058 if (result != NULL) { | |
1059 Node *divide = phase->transform(result); | |
1060 | |
1061 // Re-multiply, using a shift if this is a power of two | |
1062 Node *mult = NULL; | |
1063 | |
1064 if( log2_con >= 0 ) | |
1065 mult = phase->transform( new (phase->C, 3) LShiftLNode( divide, phase->intcon( log2_con ) ) ); | |
1066 else | |
1067 mult = phase->transform( new (phase->C, 3) MulLNode( divide, phase->longcon( pos_con ) ) ); | |
1068 | |
1069 // Finally, subtract the multiplied divided value from the original | |
1070 result = new (phase->C, 3) SubLNode( in(1), mult ); | |
0 | 1071 } |
145 | 1072 |
1073 // Now remove the bogus extra edges used to keep things alive | |
1074 if (can_reshape) { | |
1075 phase->is_IterGVN()->remove_dead_node(hook); | |
1076 } else { | |
1077 hook->set_req(0, NULL); // Just yank bogus edge during Parse phase | |
1078 } | |
1079 | |
1080 // return the value | |
1081 return result; | |
0 | 1082 } |
1083 | |
1084 //------------------------------Value------------------------------------------ | |
1085 const Type *ModLNode::Value( PhaseTransform *phase ) const { | |
1086 // Either input is TOP ==> the result is TOP | |
1087 const Type *t1 = phase->type( in(1) ); | |
1088 const Type *t2 = phase->type( in(2) ); | |
1089 if( t1 == Type::TOP ) return Type::TOP; | |
1090 if( t2 == Type::TOP ) return Type::TOP; | |
1091 | |
1092 // We always generate the dynamic check for 0. | |
1093 // 0 MOD X is 0 | |
1094 if( t1 == TypeLong::ZERO ) return TypeLong::ZERO; | |
1095 // X MOD X is 0 | |
1096 if( phase->eqv( in(1), in(2) ) ) return TypeLong::ZERO; | |
1097 | |
1098 // Either input is BOTTOM ==> the result is the local BOTTOM | |
1099 const Type *bot = bottom_type(); | |
1100 if( (t1 == bot) || (t2 == bot) || | |
1101 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
1102 return bot; | |
1103 | |
1104 const TypeLong *i1 = t1->is_long(); | |
1105 const TypeLong *i2 = t2->is_long(); | |
1106 if( !i1->is_con() || !i2->is_con() ) { | |
1107 if( i1->_lo >= CONST64(0) && i2->_lo >= CONST64(0) ) | |
1108 return TypeLong::POS; | |
1109 // If both numbers are not constants, we know little. | |
1110 return TypeLong::LONG; | |
1111 } | |
1112 // Mod by zero? Throw exception at runtime! | |
1113 if( !i2->get_con() ) return TypeLong::POS; | |
1114 | |
1115 // We must be modulo'ing 2 float constants. | |
1116 // Check for min_jint % '-1', result is defined to be '0'. | |
1117 if( i1->get_con() == min_jlong && i2->get_con() == -1 ) | |
1118 return TypeLong::ZERO; | |
1119 | |
1120 return TypeLong::make( i1->get_con() % i2->get_con() ); | |
1121 } | |
1122 | |
1123 | |
1124 //============================================================================= | |
1125 //------------------------------Value------------------------------------------ | |
1126 const Type *ModFNode::Value( PhaseTransform *phase ) const { | |
1127 // Either input is TOP ==> the result is TOP | |
1128 const Type *t1 = phase->type( in(1) ); | |
1129 const Type *t2 = phase->type( in(2) ); | |
1130 if( t1 == Type::TOP ) return Type::TOP; | |
1131 if( t2 == Type::TOP ) return Type::TOP; | |
1132 | |
1133 // Either input is BOTTOM ==> the result is the local BOTTOM | |
1134 const Type *bot = bottom_type(); | |
1135 if( (t1 == bot) || (t2 == bot) || | |
1136 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
1137 return bot; | |
1138 | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1139 // If either number is not a constant, we know nothing. |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1140 if ((t1->base() != Type::FloatCon) || (t2->base() != Type::FloatCon)) { |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1141 return Type::FLOAT; // note: x%x can be either NaN or 0 |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1142 } |
0 | 1143 |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1144 float f1 = t1->getf(); |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1145 float f2 = t2->getf(); |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1146 jint x1 = jint_cast(f1); // note: *(int*)&f1, not just (int)f1 |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1147 jint x2 = jint_cast(f2); |
0 | 1148 |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1149 // If either is a NaN, return an input NaN |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1150 if (g_isnan(f1)) return t1; |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1151 if (g_isnan(f2)) return t2; |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1152 |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1153 // If an operand is infinity or the divisor is +/- zero, punt. |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1154 if (!g_isfinite(f1) || !g_isfinite(f2) || x2 == 0 || x2 == min_jint) |
0 | 1155 return Type::FLOAT; |
1156 | |
1157 // We must be modulo'ing 2 float constants. | |
1158 // Make sure that the sign of the fmod is equal to the sign of the dividend | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1159 jint xr = jint_cast(fmod(f1, f2)); |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1160 if ((x1 ^ xr) < 0) { |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1161 xr ^= min_jint; |
0 | 1162 } |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1163 |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1164 return TypeF::make(jfloat_cast(xr)); |
0 | 1165 } |
1166 | |
1167 | |
1168 //============================================================================= | |
1169 //------------------------------Value------------------------------------------ | |
1170 const Type *ModDNode::Value( PhaseTransform *phase ) const { | |
1171 // Either input is TOP ==> the result is TOP | |
1172 const Type *t1 = phase->type( in(1) ); | |
1173 const Type *t2 = phase->type( in(2) ); | |
1174 if( t1 == Type::TOP ) return Type::TOP; | |
1175 if( t2 == Type::TOP ) return Type::TOP; | |
1176 | |
1177 // Either input is BOTTOM ==> the result is the local BOTTOM | |
1178 const Type *bot = bottom_type(); | |
1179 if( (t1 == bot) || (t2 == bot) || | |
1180 (t1 == Type::BOTTOM) || (t2 == Type::BOTTOM) ) | |
1181 return bot; | |
1182 | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1183 // If either number is not a constant, we know nothing. |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1184 if ((t1->base() != Type::DoubleCon) || (t2->base() != Type::DoubleCon)) { |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1185 return Type::DOUBLE; // note: x%x can be either NaN or 0 |
0 | 1186 } |
1187 | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1188 double f1 = t1->getd(); |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1189 double f2 = t2->getd(); |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1190 jlong x1 = jlong_cast(f1); // note: *(long*)&f1, not just (long)f1 |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1191 jlong x2 = jlong_cast(f2); |
0 | 1192 |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1193 // If either is a NaN, return an input NaN |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1194 if (g_isnan(f1)) return t1; |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1195 if (g_isnan(f2)) return t2; |
0 | 1196 |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1197 // If an operand is infinity or the divisor is +/- zero, punt. |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1198 if (!g_isfinite(f1) || !g_isfinite(f2) || x2 == 0 || x2 == min_jlong) |
0 | 1199 return Type::DOUBLE; |
1200 | |
1201 // We must be modulo'ing 2 double constants. | |
131
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1202 // Make sure that the sign of the fmod is equal to the sign of the dividend |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1203 jlong xr = jlong_cast(fmod(f1, f2)); |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1204 if ((x1 ^ xr) < 0) { |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1205 xr ^= min_jlong; |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1206 } |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1207 |
6e825ad773c6
6695288: runThese tests expr30303 and drem00301m1 fail when compiled code executes without deopt
jrose
parents:
0
diff
changeset
|
1208 return TypeD::make(jdouble_cast(xr)); |
0 | 1209 } |
1210 | |
1211 //============================================================================= | |
1212 | |
1213 DivModNode::DivModNode( Node *c, Node *dividend, Node *divisor ) : MultiNode(3) { | |
1214 init_req(0, c); | |
1215 init_req(1, dividend); | |
1216 init_req(2, divisor); | |
1217 } | |
1218 | |
1219 //------------------------------make------------------------------------------ | |
1220 DivModINode* DivModINode::make(Compile* C, Node* div_or_mod) { | |
1221 Node* n = div_or_mod; | |
1222 assert(n->Opcode() == Op_DivI || n->Opcode() == Op_ModI, | |
1223 "only div or mod input pattern accepted"); | |
1224 | |
1225 DivModINode* divmod = new (C, 3) DivModINode(n->in(0), n->in(1), n->in(2)); | |
1226 Node* dproj = new (C, 1) ProjNode(divmod, DivModNode::div_proj_num); | |
1227 Node* mproj = new (C, 1) ProjNode(divmod, DivModNode::mod_proj_num); | |
1228 return divmod; | |
1229 } | |
1230 | |
1231 //------------------------------make------------------------------------------ | |
1232 DivModLNode* DivModLNode::make(Compile* C, Node* div_or_mod) { | |
1233 Node* n = div_or_mod; | |
1234 assert(n->Opcode() == Op_DivL || n->Opcode() == Op_ModL, | |
1235 "only div or mod input pattern accepted"); | |
1236 | |
1237 DivModLNode* divmod = new (C, 3) DivModLNode(n->in(0), n->in(1), n->in(2)); | |
1238 Node* dproj = new (C, 1) ProjNode(divmod, DivModNode::div_proj_num); | |
1239 Node* mproj = new (C, 1) ProjNode(divmod, DivModNode::mod_proj_num); | |
1240 return divmod; | |
1241 } | |
1242 | |
1243 //------------------------------match------------------------------------------ | |
1244 // return result(s) along with their RegMask info | |
1245 Node *DivModINode::match( const ProjNode *proj, const Matcher *match ) { | |
1246 uint ideal_reg = proj->ideal_reg(); | |
1247 RegMask rm; | |
1248 if (proj->_con == div_proj_num) { | |
1249 rm = match->divI_proj_mask(); | |
1250 } else { | |
1251 assert(proj->_con == mod_proj_num, "must be div or mod projection"); | |
1252 rm = match->modI_proj_mask(); | |
1253 } | |
1254 return new (match->C, 1)MachProjNode(this, proj->_con, rm, ideal_reg); | |
1255 } | |
1256 | |
1257 | |
1258 //------------------------------match------------------------------------------ | |
1259 // return result(s) along with their RegMask info | |
1260 Node *DivModLNode::match( const ProjNode *proj, const Matcher *match ) { | |
1261 uint ideal_reg = proj->ideal_reg(); | |
1262 RegMask rm; | |
1263 if (proj->_con == div_proj_num) { | |
1264 rm = match->divL_proj_mask(); | |
1265 } else { | |
1266 assert(proj->_con == mod_proj_num, "must be div or mod projection"); | |
1267 rm = match->modL_proj_mask(); | |
1268 } | |
1269 return new (match->C, 1)MachProjNode(this, proj->_con, rm, ideal_reg); | |
1270 } |