liveness.rs 15.4 KB
Newer Older
qinsoon's avatar
qinsoon committed
1 2
extern crate nalgebra;

qinsoon's avatar
qinsoon committed
3
use vm::CompiledFunction;
4
use ast::ir::*;
qinsoon's avatar
qinsoon committed
5 6
use ast::types;
use compiler::backend;
7
use utils::vec_utils;
8
use utils::LinkedHashSet;
9 10

use std::collections::LinkedList;
qinsoon's avatar
qinsoon committed
11 12 13 14
use std::collections::{HashMap, HashSet};

use self::nalgebra::DMatrix;

15 16
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub struct Node(usize);
17
#[derive(Clone, Debug, PartialEq)]
qinsoon's avatar
qinsoon committed
18 19
pub struct NodeProperty {
    color: Option<MuID>,
20 21 22
    group: backend::RegGroup,
    temp: MuID,
    spill_cost: f32
qinsoon's avatar
qinsoon committed
23 24 25
}
#[derive(Clone, Copy, Debug, PartialEq, Eq, Hash)]
pub struct Move{pub from: Node, pub to: Node}
26 27

pub struct InterferenceGraph {
qinsoon's avatar
qinsoon committed
28
    nodes: HashMap<MuID, Node>,
qinsoon's avatar
qinsoon committed
29
    nodes_property: HashMap<Node, NodeProperty>,
qinsoon's avatar
qinsoon committed
30 31 32
    
    matrix: Option<DMatrix<bool>>,
    
qinsoon's avatar
qinsoon committed
33
    moves: HashSet<Move>,
34 35 36 37
}

impl InterferenceGraph {
    fn new() -> InterferenceGraph {
qinsoon's avatar
qinsoon committed
38 39
        InterferenceGraph {
            nodes: HashMap::new(),
qinsoon's avatar
qinsoon committed
40
            nodes_property: HashMap::new(),
qinsoon's avatar
qinsoon committed
41 42 43 44 45
            matrix: None,
            moves: HashSet::new()
        }
    }
    
qinsoon's avatar
qinsoon committed
46 47 48 49
    fn new_node(&mut self, reg_id: MuID, context: &FunctionContext) -> Node {
        let entry = context.get_value(reg_id).unwrap();
        
        if !self.nodes.contains_key(&reg_id) {
qinsoon's avatar
qinsoon committed
50
            let index = self.nodes.len();
51
            let node = Node(index);
qinsoon's avatar
qinsoon committed
52 53 54 55 56 57 58 59 60 61
            
            // add the node
            self.nodes.insert(reg_id, node.clone());
            
            // add node property
            let group = {
                let ref ty = entry.ty;
                if types::is_scalar(ty) {
                    if types::is_fp(ty) {
                        backend::RegGroup::FPR
qinsoon's avatar
qinsoon committed
62 63
                    } else {
                        backend::RegGroup::GPR
qinsoon's avatar
qinsoon committed
64 65 66 67 68 69 70
                    }
                } else {
                    unimplemented!()
                }
            };
            let property = NodeProperty {
                color: None,
71 72 73
                group: group,
                temp: reg_id,
                spill_cost: 0.0f32
qinsoon's avatar
qinsoon committed
74 75
            };
            self.nodes_property.insert(node, property);
76 77 78 79 80 81 82 83 84 85
        } 
        
        
        let node = * self.nodes.get(&reg_id).unwrap();
        
        // increase node spill cost
        let property = self.nodes_property.get_mut(&node).unwrap();
        property.spill_cost += 1.0f32;
        
        node
qinsoon's avatar
qinsoon committed
86 87
    }
    
qinsoon's avatar
qinsoon committed
88
    pub fn get_node(&self, reg: MuID) -> Node {
qinsoon's avatar
qinsoon committed
89
        match self.nodes.get(&reg) {
qinsoon's avatar
qinsoon committed
90
            Some(index) => *index,
qinsoon's avatar
qinsoon committed
91
            None => panic!("do not have a node for {}", reg)
qinsoon's avatar
qinsoon committed
92 93 94
        }
    }
    
95 96 97 98 99 100 101 102
    pub fn temps(&self) -> Vec<MuID>{
        let mut ret = vec![];
        for reg in self.nodes.keys() {
            ret.push(*reg);
        }
        ret
    }
    
qinsoon's avatar
qinsoon committed
103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118
    pub fn nodes(&self) -> Vec<Node> {
        let mut ret = vec![];
        for node in self.nodes.values() {
            ret.push(node.clone());
        }
        ret
    }
    
    pub fn moves(&self) -> &HashSet<Move> {
        &self.moves
    }
    
    pub fn n_nodes(&self) -> usize {
        self.nodes.len()
    }
    
qinsoon's avatar
qinsoon committed
119 120 121 122 123
    fn init_graph(&mut self) {
        let len = self.nodes.len();
        self.matrix = Some(DMatrix::from_element(len, len, false));
    }
    
qinsoon's avatar
qinsoon committed
124 125
    fn add_move(&mut self, src: Node, dst: Node) {
        self.moves.insert(Move{from: src, to: dst});
126 127
    }
    
qinsoon's avatar
qinsoon committed
128
    pub fn add_interference_edge(&mut self, from: Node, to: Node) {
qinsoon's avatar
qinsoon committed
129 130 131 132 133 134
        // only if two nodes are from the same RegGroup,
        // they may interefere
        if self.nodes_property.get(&from).unwrap().group 
           == self.nodes_property.get(&to).unwrap().group {
            self.matrix.as_mut().unwrap()[(from.0, to.0)] = true;
        }
qinsoon's avatar
qinsoon committed
135 136
    }
    
137
    pub fn color_node(&mut self, node: Node, color: MuID) {
qinsoon's avatar
qinsoon committed
138
        self.nodes_property.get_mut(&node).unwrap().color = Some(color);
qinsoon's avatar
qinsoon committed
139 140
    }
    
qinsoon's avatar
qinsoon committed
141 142 143 144
    pub fn is_colored(&self, node: Node) -> bool {
        self.nodes_property.get(&node).unwrap().color.is_some()
    }
    
145 146 147 148
    pub fn get_color_of(&self, node: Node) -> Option<MuID> {
        self.nodes_property.get(&node).unwrap().color
    }
    
qinsoon's avatar
qinsoon committed
149 150
    pub fn get_group_of(&self, node: Node) -> backend::RegGroup {
        self.nodes_property.get(&node).unwrap().group
qinsoon's avatar
qinsoon committed
151 152
    }
    
153 154 155 156 157 158 159 160
    pub fn get_temp_of(&self, node: Node) -> MuID {
        self.nodes_property.get(&node).unwrap().temp
    }
    
    pub fn get_spill_cost(&self, node: Node) -> f32 {
        self.nodes_property.get(&node).unwrap().spill_cost
    }
    
161
    fn is_same_node(&self, node1: Node, node2: Node) -> bool {
qinsoon's avatar
qinsoon committed
162
        node1 == node2
qinsoon's avatar
qinsoon committed
163 164
    }
    
qinsoon's avatar
qinsoon committed
165
    pub fn is_adj(&self, from: Node, to: Node) -> bool {
166 167
        let ref matrix = self.matrix.as_ref().unwrap();
        
168
        matrix[(from.0, to.0)] || matrix[(to.0, from.0)]
qinsoon's avatar
qinsoon committed
169 170
    }
    
171 172 173 174 175 176 177 178 179 180 181 182 183
    pub fn outedges_of(&self, node: Node) -> Vec<Node> {
        let mut ret = vec![];
        let matrix = self.matrix.as_ref().unwrap();
        
        for i in 0..self.nodes.len() {
            if matrix[(node.0, i)] {
                ret.push(Node(i));
            }
        }
        
        ret
    }
    
qinsoon's avatar
qinsoon committed
184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209
    pub fn outdegree_of(&self, node: Node) -> usize {
        let mut count = 0;
        for i in 0..self.nodes.len() {
            if self.matrix.as_ref().unwrap()[(node.0, i)] {
                count += 1;
            }
        }
        
        count
    }
    
    pub fn indegree_of(&self, node: Node) -> usize {
        let mut count = 0;
        for i in 0..self.nodes.len() {
            if self.matrix.as_ref().unwrap()[(i, node.0)] {
                count += 1;
            }
        }
        
        count
    }
    
    pub fn degree_of(&self, node: Node) -> usize {
        self.outdegree_of(node) + self.indegree_of(node)
    }
    
210 211 212 213
    pub fn print(&self) {
        println!("");
        println!("Interference Graph");

qinsoon's avatar
qinsoon committed
214 215 216 217 218
        println!("nodes:");
        for id in self.nodes.keys() {
            println!("Reg {} -> {:?}", id, self.nodes.get(&id).unwrap());
        }

219
        println!("color:");
qinsoon's avatar
qinsoon committed
220 221
        for (n, c) in self.nodes_property.iter() {
            println!("{:?} -> Color/Reg {:?}", n, c);
222 223 224
        }
        println!("moves:");
        for mov in self.moves.iter() {
qinsoon's avatar
qinsoon committed
225
            println!("Move {:?} -> {:?}", mov.from, mov.to);
226 227 228
        }
        println!("graph:");
        {
qinsoon's avatar
qinsoon committed
229 230
            let node_to_reg_id = {
                let mut ret : HashMap<Node, MuID> = HashMap::new();
231
                
qinsoon's avatar
qinsoon committed
232 233
                for reg in self.nodes.keys() {
                    ret.insert(*self.nodes.get(reg).unwrap(), *reg);
234 235 236 237 238 239 240 241 242
                }
                
                ret 
            };
            
            let matrix = self.matrix.as_ref().unwrap();
            for i in 0..matrix.ncols() {
                for j in 0..matrix.nrows() {
                    if matrix[(i, j)] {
243 244
                        let from_node = node_to_reg_id.get(&Node(i)).unwrap();
                        let to_node = node_to_reg_id.get(&Node(j)).unwrap();
245
                        
246
                        println!("Reg {} -> Reg {}", from_node, to_node);
247 248 249 250 251 252
                    }
                }
            }
        }
        println!("");
    }
qinsoon's avatar
qinsoon committed
253 254
}

qinsoon's avatar
qinsoon committed
255
pub fn is_machine_reg(reg: MuID) -> bool {
qinsoon's avatar
qinsoon committed
256
    if reg < MACHINE_ID_END {
qinsoon's avatar
qinsoon committed
257 258 259
        true
    } else {
        false
260 261 262
    }
}

263
// from Tailoring Graph-coloring Register Allocation For Runtime Compilation, Figure 4
264
pub fn build_chaitin_briggs (cf: &CompiledFunction, func: &MuFunctionVersion) -> InterferenceGraph {
265 266 267
    let mut ig = InterferenceGraph::new();
    
    // precolor machine register nodes
268
    for reg in backend::all_regs().values() {
269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291
        let reg_id = reg.extract_ssa_id().unwrap();
        let node = ig.new_node(reg_id, &func.context);
        ig.color_node(node, reg_id);
    }
    
    // Initialize and creates nodes for all the involved temps/regs
    for i in 0..cf.mc.number_of_insts() {
        for reg_id in cf.mc.get_inst_reg_defines(i) {
            let reg_id = *reg_id;
            ig.new_node(reg_id, &func.context);
        }
        
        for reg_id in cf.mc.get_inst_reg_uses(i) {
            let reg_id = *reg_id;
            ig.new_node(reg_id, &func.context);
        }
    }
    
    // all nodes has been added, we init graph (create adjacency matrix)
    ig.init_graph();    
    
    for block in cf.mc.get_all_blocks() {
        // Current_Live(B) = LiveOut(B)
292
        let mut current_live = LinkedHashSet::from_vec(match cf.mc.get_ir_block_liveout(&block) {
293 294 295 296
            Some(liveout) => liveout.to_vec(),
            None => panic!("cannot find liveout for block {}", block)
        });
        
297
        let range = cf.mc.get_block_range(&block);
298 299 300 301 302 303 304 305 306 307 308
        if range.is_none() {
            continue;
        }
        
        // for every inst I in reverse order
        for i in range.unwrap().rev() {
            let src : Option<MuID> = {
                if cf.mc.is_move(i) {
                    let src = cf.mc.get_inst_reg_uses(i);
                    let dst = cf.mc.get_inst_reg_defines(i);
                    
qinsoon's avatar
qinsoon committed
309 310 311 312
                    // src:  reg/imm/mem
                    // dest: reg/mem
                    // we dont care if src/dest is mem
                    if cf.mc.is_using_mem_op(i) {
313
                        None
qinsoon's avatar
qinsoon committed
314 315 316 317 318 319 320 321 322 323
                    } else {
                        if src.len() == 1 {
                            let node1 = ig.get_node(src[0]);
                            let node2 = ig.get_node(dst[0]);
                            ig.add_move(node1, node2);
                            
                            Some(src[0])
                        } else {
                            None
                        }
324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367
                    }
                } else {
                    None
                }
            };
            
            // for every definition D in I
            for d in cf.mc.get_inst_reg_defines(i) {
                // add an interference from D to every element E in Current_Live - {D}
                // creating nodes if necessary
                for e in current_live.iter() {
                    if src.is_none() || (src.is_some() && *e != src.unwrap()) {
                        let from = ig.get_node(*d);
                        let to = ig.get_node(*e);
                        
                        if !ig.is_same_node(from, to) && !ig.is_adj(from, to) {
                            if !ig.is_colored(from) {
                                ig.add_interference_edge(from, to);
                            }
                            if !ig.is_colored(to) {
                                ig.add_interference_edge(to, from);
                            }
                        }
                    }
                }
            }
            
            // for every definition D in I
            for d in cf.mc.get_inst_reg_defines(i) {
                // remove D from Current_Live
                current_live.remove(d);
            }
            
            // for every use U in I
            for u in cf.mc.get_inst_reg_uses(i) {
                // add U to Current_live
                current_live.insert(*u);
            }
        }
    }
    
    ig
}

368
// from tony's code src/RegAlloc/Liveness.java
369 370
// this function is no longer used
#[allow(dead_code)]
371
pub fn build (cf: &CompiledFunction, func: &MuFunctionVersion) -> InterferenceGraph {
372 373
    let mut ig = InterferenceGraph::new();
    
qinsoon's avatar
qinsoon committed
374
    // precolor machine register nodes
375
    for reg in backend::all_regs().values() {
qinsoon's avatar
qinsoon committed
376 377 378 379
        let reg_id = reg.extract_ssa_id().unwrap();
        let node = ig.new_node(reg_id, &func.context);
        ig.color_node(node, reg_id);
    }
380 381 382 383 384 385 386 387 388 389 390 391 392
    
    // Liveness Analysis
    let n_insts = cf.mc.number_of_insts();
    let mut live_in : Vec<Vec<MuID>> = vec![vec![]; n_insts];
    let mut live_out : Vec<Vec<MuID>> = vec![vec![]; n_insts];
    let mut work_list : LinkedList<usize> = LinkedList::new();
    
    // Initialize 'in' sets for each node in the flow graph
    // and creates nodes for all the involved temps/regs
    for i in 0..n_insts {
        let ref mut in_set = live_in[i];
        
        for reg_id in cf.mc.get_inst_reg_defines(i) {
qinsoon's avatar
qinsoon committed
393
            let reg_id = *reg_id;
qinsoon's avatar
qinsoon committed
394
            ig.new_node(reg_id, &func.context);
395 396 397
        }
        
        for reg_id in cf.mc.get_inst_reg_uses(i) {
qinsoon's avatar
qinsoon committed
398
            let reg_id = *reg_id;
qinsoon's avatar
qinsoon committed
399
            ig.new_node(reg_id, &func.context);
qinsoon's avatar
qinsoon committed
400 401
            
            in_set.push(reg_id);
402 403 404 405 406
        }
        
        work_list.push_front(i);
    }
    
qinsoon's avatar
qinsoon committed
407 408 409 410
    // all nodes has been added, we init graph (create adjacency matrix)
    ig.init_graph();
    
    // compute liveIn and liveOut iteratively
411
    trace!("build live outs");
412 413
    while !work_list.is_empty() {
        let n = work_list.pop_front().unwrap();
414
        trace!("build liveout for #{}", n);
415
        let ref mut out_set = live_out[n];
qinsoon's avatar
qinsoon committed
416 417 418
        
        // out = union(in[succ]) for all succs
        for succ in cf.mc.get_succs(n) {
419
            trace!("add successor's livein {:?} to #{}", &live_in[*succ], n); 
420
            vec_utils::add_all(out_set, &live_in[*succ]);
qinsoon's avatar
qinsoon committed
421 422 423 424 425
        }
        
        // in = use(i.e. live_in) + (out - def) 
        let mut diff = out_set.clone();
        for def in cf.mc.get_inst_reg_defines(n) {
426
            vec_utils::remove_value(&mut diff, *def);
427 428
            trace!("removing def: {}", *def);
            trace!("diff = {:?}", diff);
qinsoon's avatar
qinsoon committed
429
        }
430
        trace!("out - def = {:?}", diff);
qinsoon's avatar
qinsoon committed
431 432 433
        
        if !diff.is_empty() {
            let ref mut in_set = live_in[n];
434
            trace!("in = (use) {:?}", in_set);
qinsoon's avatar
qinsoon committed
435
            
436
            if vec_utils::add_all(in_set, &diff) {
qinsoon's avatar
qinsoon committed
437 438 439 440 441
                for p in cf.mc.get_preds(n) {
                    work_list.push_front(*p);
                }
            }
        }
442
        trace!("in = use + (out - def) = {:?}", live_in[n]);
443 444 445 446 447 448 449 450 451
    }
    
    // debug live-outs
    if cfg!(debug_assertions) {
        trace!("check live-outs");
        for n in 0..n_insts {
            let ref mut live = live_out[n];
            trace!("#{}\t{:?}", n, live);
        }
qinsoon's avatar
qinsoon committed
452 453 454 455 456 457 458 459 460 461 462
    }
    
    // build interference graph
    for n in 0..n_insts {
        let ref mut live = live_out[n];
        
        let src : Option<MuID> = {
            if cf.mc.is_move(n) {
                let src = cf.mc.get_inst_reg_uses(n);
                let dst = cf.mc.get_inst_reg_defines(n);
                
463 464
                // src may be an immediate number
                // but dest is definitly a register
qinsoon's avatar
qinsoon committed
465 466
                debug_assert!(dst.len() == 1);
                
467
                if src.len() == 1 {
qinsoon's avatar
qinsoon committed
468 469 470
                    let node1 = ig.get_node(src[0]);
                    let node2 = ig.get_node(dst[0]);
                    ig.add_move(node1, node2);
471 472 473 474 475
                    
                    Some(src[0])
                } else {
                    None
                }
qinsoon's avatar
qinsoon committed
476 477 478 479 480 481 482 483
            } else {
                None
            }
        };
        
        for d in cf.mc.get_inst_reg_defines(n) {
            for t in live.iter() {
                if src.is_none() || (src.is_some() && *t != src.unwrap()) {
484 485
                    let from = ig.get_node(*d);
                    let to = ig.get_node(*t);
qinsoon's avatar
qinsoon committed
486 487
                    
                    if !ig.is_same_node(from, to) && !ig.is_adj(from, to) {
qinsoon's avatar
qinsoon committed
488
                        if !ig.is_colored(from) {
qinsoon's avatar
qinsoon committed
489 490
                            ig.add_interference_edge(from, to);
                        }
qinsoon's avatar
qinsoon committed
491
                        if !ig.is_colored(to) {
qinsoon's avatar
qinsoon committed
492 493 494 495 496 497 498 499
                            ig.add_interference_edge(to, from);
                        }
                    }
                }
            }
        }
        
        for d in cf.mc.get_inst_reg_defines(n) {
500
            vec_utils::remove_value(live, *d);
qinsoon's avatar
qinsoon committed
501 502 503 504 505 506 507 508
        }
        
        for u in cf.mc.get_inst_reg_uses(n) {
            live.push(*u);
        }
    }
    
    ig
509
}