blob: e6cde622acc1fed29df9b00cc9217d4a519acb36 (
plain)
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
|
/*
* 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.
*/
package com.android.dx.ssa.back;
import com.android.dx.ssa.SsaMethod;
import com.android.dx.ssa.SsaBasicBlock;
import com.android.dx.ssa.SsaInsn;
import com.android.dx.ssa.PhiInsn;
import com.android.dx.ssa.SetFactory;
import com.android.dx.rop.code.RegisterSpec;
import com.android.dx.util.IntSet;
import com.android.dx.util.BitIntSet;
import com.android.dx.util.ListIntSet;
import java.util.BitSet;
import java.util.List;
import java.util.ArrayList;
/**
* A register interference graph
*/
public class InterferenceGraph {
/**
* {@code non-null;} interference graph, indexed by register in
* both dimensions
*/
private final ArrayList<IntSet> interference;
/**
* Creates a new graph.
*
* @param countRegs {@code >= 0;} the start count of registers in
* the namespace. New registers can be added subsequently.
*/
public InterferenceGraph(int countRegs) {
interference = new ArrayList<IntSet>(countRegs);
for (int i = 0; i < countRegs; i++) {
interference.add(SetFactory.makeInterferenceSet(countRegs));
}
}
/**
* Adds a register pair to the interference/liveness graph. Parameter
* order is insignificant.
*
* @param regV one register index
* @param regW another register index
*/
public void add(int regV, int regW) {
ensureCapacity(Math.max(regV, regW) + 1);
interference.get(regV).add(regW);
interference.get(regW).add(regV);
}
/**
* Dumps interference graph to stdout for debugging.
*/
public void dumpToStdout() {
int oldRegCount = interference.size();
for (int i = 0; i < oldRegCount; i++) {
StringBuilder sb = new StringBuilder();
sb.append("Reg " + i + ":" + interference.get(i).toString());
System.out.println(sb.toString());
}
}
/**
* Merges the interference set for a register into a given bit set
*
* @param reg {@code >= 0;} register
* @param set {@code non-null;} interference set; will be merged
* with set for given register
*/
public void mergeInterferenceSet(int reg, IntSet set) {
if (reg < interference.size()) {
set.merge(interference.get(reg));
}
}
/**
* Ensures that the interference graph is appropriately sized.
*
* @param size requested minumum size
*/
private void ensureCapacity(int size) {
int countRegs = interference.size();
interference.ensureCapacity(size);
for (int i = countRegs; i < size; i++) {
interference.add(SetFactory.makeInterferenceSet(size));
}
}
}
|
