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
|
/*
* Copyright (c) 2021, 2024, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
package compiler.c2.irTests;
import jdk.test.lib.Asserts;
import compiler.lib.ir_framework.*;
/*
* @test
* @bug 8278471
* @summary Remove unreached rules in AddNode::IdealIL
* @library /test/lib /
* @run driver compiler.c2.irTests.TestSpecialCasesOf_AMinusB_Plus_CMinusD_InAddIdeal
*/
/* Test conversion from (a - b) + (b - c) to (a - c) and conversion
* from (a - b) + (c - a) to (c - b) have really happened so we can
* safely remove both. */
public class TestSpecialCasesOf_AMinusB_Plus_CMinusD_InAddIdeal {
public static void main(String[] args) {
TestFramework.run();
}
@Test
@Arguments(values = {Argument.RANDOM_ONCE, Argument.RANDOM_ONCE, Argument.RANDOM_ONCE})
@IR(failOn = {IRNode.ADD_I})
@IR(counts = {IRNode.SUB_I, "1"})
public int test1Int(int a, int b, int c) {
return (a - b) + (b - c); // transformed to a - c rather than (a + b) - (b + c)
}
@Test
@Arguments(values = {Argument.RANDOM_ONCE, Argument.RANDOM_ONCE, Argument.RANDOM_ONCE})
@IR(failOn = {IRNode.ADD_L})
@IR(counts = {IRNode.SUB_L, "1"})
public long test1Long(long a, long b, long c) {
return (a - b) + (b - c); // transformed to a - c rather than (a + b) - (b + c)
}
@Test
@Arguments(values = {Argument.RANDOM_ONCE, Argument.RANDOM_ONCE, Argument.RANDOM_ONCE})
@IR(failOn = {IRNode.ADD_I})
@IR(counts = {IRNode.SUB_I, "1"})
public int test2Int(int b, int a, int c) { // make sure inputs sorted
return (a - b) + (c - a); // transformed to c - b rather than (a + c) - (b + a)
}
@Test
@Arguments(values = {Argument.RANDOM_ONCE, Argument.RANDOM_ONCE, Argument.RANDOM_ONCE})
@IR(failOn = {IRNode.ADD_L})
@IR(counts = {IRNode.SUB_L, "1"})
public long test2Long(long b, long a, long c) { // make sure inputs sorted
return (a - b) + (c - a); // transformed to return c - b rather than (a + c) - (b + a)
}
}
|
