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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
use crate::{
impl_table_indexing,
ir::{Arg, Block, ExtUnit, ExtUnitData, Inst, InstData, Signature, Value, ValueData},
table::{PrimaryTable, SecondaryTable, TableKey},
ty::{void_ty, Type},
};
use std::collections::HashMap;
#[derive(Default)]
pub struct DataFlowGraph {
pub(crate) insts: PrimaryTable<Inst, InstData>,
pub(crate) results: SecondaryTable<Inst, Value>,
pub(crate) values: PrimaryTable<Value, ValueData>,
pub(crate) args: SecondaryTable<Arg, Value>,
pub(crate) ext_units: PrimaryTable<ExtUnit, ExtUnitData>,
pub(crate) names: HashMap<Value, String>,
}
impl_table_indexing!(DataFlowGraph, insts, Inst, InstData);
impl_table_indexing!(DataFlowGraph, values, Value, ValueData);
impl_table_indexing!(DataFlowGraph, ext_units, ExtUnit, ExtUnitData);
impl DataFlowGraph {
pub fn new() -> Self {
Default::default()
}
pub fn add_placeholder(&mut self, ty: Type) -> Value {
self.values.add(ValueData::Placeholder { ty })
}
pub fn remove_placeholder(&mut self, value: Value) {
assert!(!self.has_uses(value));
assert!(self[value].is_placeholder());
self.values.remove(value);
}
pub fn is_placeholder(&self, value: Value) -> bool {
self[value].is_placeholder()
}
pub fn add_inst(&mut self, data: InstData, ty: Type) -> Inst {
let inst = self.insts.add(data);
if !ty.is_void() {
let result = self.values.add(ValueData::Inst { ty, inst });
self.results.add(inst, result);
}
inst
}
pub fn remove_inst(&mut self, inst: Inst) {
if self.has_result(inst) {
let value = self.inst_result(inst);
assert!(!self.has_uses(value));
self.values.remove(value);
}
self.insts.remove(inst);
self.results.remove(inst);
}
pub fn has_result(&self, inst: Inst) -> bool {
self.results.storage.contains_key(&inst.index())
}
pub fn inst_result(&self, inst: Inst) -> Value {
self.results[inst]
}
pub fn arg_value(&self, arg: Arg) -> Value {
self.args[arg]
}
pub(crate) fn make_args_for_signature(&mut self, sig: &Signature) {
for arg in sig.args() {
let value = self.values.add(ValueData::Arg {
ty: sig.arg_type(arg),
arg: arg,
});
self.args.add(arg, value);
}
}
pub fn value_type(&self, value: Value) -> Type {
match &self[value] {
ValueData::Inst { ty, .. } => ty.clone(),
ValueData::Arg { ty, .. } => ty.clone(),
ValueData::Placeholder { ty, .. } => ty.clone(),
}
}
pub fn inst_type(&self, inst: Inst) -> Type {
if self.has_result(inst) {
self.value_type(self.inst_result(inst))
} else {
void_ty()
}
}
pub fn get_value_inst(&self, value: Value) -> Option<Inst> {
match self[value] {
ValueData::Inst { inst, .. } => Some(inst),
_ => None,
}
}
pub fn value_inst(&self, value: Value) -> Inst {
match self.get_value_inst(value) {
Some(inst) => inst,
None => panic!("value {} not the result of an instruction", value),
}
}
pub fn get_name(&self, value: Value) -> Option<&str> {
self.names.get(&value).map(AsRef::as_ref)
}
pub fn set_name(&mut self, value: Value, name: String) {
self.names.insert(value, name);
}
pub fn clear_name(&mut self, value: Value) -> Option<String> {
self.names.remove(&value)
}
pub fn replace_use(&mut self, from: Value, to: Value) -> usize {
let mut count = 0;
for inst in self.insts.storage.values_mut() {
count += inst.replace_value(from, to);
}
count
}
pub fn uses(&self, value: Value) -> impl Iterator<Item = (Inst, usize)> {
let mut uses = vec![];
for inst in self.insts.keys() {
for (i, arg) in self[inst].args().iter().cloned().enumerate() {
if arg == value {
uses.push((inst, i));
}
}
}
uses.into_iter()
}
pub fn has_uses(&self, value: Value) -> bool {
self.uses(value).count() > 0
}
pub fn has_one_use(&self, value: Value) -> bool {
self.uses(value).count() == 1
}
pub fn replace_block_use(&mut self, from: Block, to: Block) -> usize {
let mut count = 0;
for inst in self.insts.storage.values_mut() {
count += inst.replace_block(from, to);
}
count
}
}