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
|
/*
* Copyright (C) 2015 The Android Open Source Project
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
public class Main {
public static void assertBooleanEquals(boolean expected, boolean result) {
if (expected != result) {
throw new Error("Expected: " + expected + ", found: " + result);
}
}
public static boolean inlinePhi(boolean x, boolean y, boolean z) {
boolean phi;
if (z) {
phi = x;
} else {
phi = y;
}
return phi;
}
public static boolean dontUseParam(boolean x) {
return false;
}
public static boolean testCase(boolean x, boolean y, boolean z) {
// First create a Phi(x, y).
boolean phi = inlinePhi(x, y, z);
// Now use the phi as a condition which the boolean simplifier will try to
// optimize out. If the result is not used, the algorithm will try to remove
// the original condition (phi) and crash.
return dontUseParam(phi == false ? false : true);
}
public static void main(String[] args) {
assertBooleanEquals(false, testCase(true, true, true));
}
}
|
