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
|
/*
* Copyright (C) 2007 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 Blort
{
/**
* This method requires the edge-splitter to add a node
* to get to the finally block, since there are
* two exception sources.
*
*/
public int edgeSplitPredTest(int x) {
int y = 1;
try {
Integer.toString(x);
Integer.toString(x);
y++;
} finally {
return y;
}
}
/**
* just because this should do nothing
*/
void voidFunction() {
}
/**
* Current SSA form requires each move-exception block to have
* a unique predecessor
*/
void edgeSplitMoveException() {
try {
hashCode();
hashCode();
} catch (Throwable tr) {
}
}
/**
* Presently, any basic block ending in an instruction with
* a result needs to have a unique successor. This appies
* only to the block between the switch instruction and the return
* in this case.
*/
int edgeSplitSuccessor(int x) {
int y = 0;
switch(x) {
case 1: y++;
break;
case 2: y++;
break;
case 3: y++;
break;
}
return y;
}
}
|
