vala/valabasicblock.vala

   1 /* valabasicblock.vala
   2  *
   3  * Copyright (C) 2008  Jürg Billeter
   4  *
   5  * This library is free software; you can redistribute it and/or
   6  * modify it under the terms of the GNU Lesser General Public
   7  * License as published by the Free Software Foundation; either
   8  * version 2.1 of the License, or (at your option) any later version.
   9
  10  * This library is distributed in the hope that it will be useful,
  11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  13  * Lesser General Public License for more details.
  14
  15  * You should have received a copy of the GNU Lesser General Public
  16  * License along with this library; if not, write to the Free Software
  17  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301  USA
  18  *
  19  * Author:
  20  *      Jürg Billeter <j@bitron.ch>
  21  */
  22
  23 using GLib;
  24 using Gee;
  25
  26 /**
  27  * Represents a basic block, i.e. a straight-line piece of code without any
  28  * jumps or jump targets.
  29  */
  30 public class Vala.BasicBlock {
  31         private Gee.List<CodeNode> nodes = new ArrayList<CodeNode> ();
  32
  33         // control flow graph
  34         private Gee.List<weak BasicBlock> predecessors = new ArrayList<weak BasicBlock> ();
  35         private Gee.List<BasicBlock> successors = new ArrayList<BasicBlock> ();
  36
  37         // dominator tree
  38         public BasicBlock parent { get; private set; }
  39         Gee.List<BasicBlock> children = new ArrayList<BasicBlock> ();
  40         Set<BasicBlock> df = new HashSet<BasicBlock> ();
  41
  42         Set<PhiFunction> phi_functions = new HashSet<PhiFunction> ();
  43
  44         public BasicBlock () {
  45         }
  46
  47         public BasicBlock.entry () {
  48         }
  49
  50         public BasicBlock.exit () {
  51         }
  52
  53         public void add_node (CodeNode node) {
  54                 nodes.add (node);
  55         }
  56
  57         public Gee.List<CodeNode> get_nodes () {
  58                 return nodes;
  59         }
  60
  61         public void connect (BasicBlock target) {
  62                 if (!successors.contains (target)) {
  63                         successors.add (target);
  64                 }
  65                 if (!target.predecessors.contains (this)) {
  66                         target.predecessors.add (this);
  67                 }
  68         }
  69
  70         public Gee.List<weak BasicBlock> get_predecessors () {
  71                 return new ReadOnlyList<weak BasicBlock> (predecessors);
  72         }
  73
  74         public Gee.List<weak BasicBlock> get_successors () {
  75                 return new ReadOnlyList<weak BasicBlock> (successors);
  76         }
  77
  78         public void add_child (BasicBlock block) {
  79                 children.add (block);
  80                 block.parent = this;
  81         }
  82
  83         public Gee.List<BasicBlock> get_children () {
  84                 return children;
  85         }
  86
  87         public void add_dominator_frontier (BasicBlock block) {
  88                 df.add (block);
  89         }
  90
  91         public Gee.Set<BasicBlock> get_dominator_frontier () {
  92                 return df;
  93         }
  94
  95         public void add_phi_function (PhiFunction phi) {
  96                 phi_functions.add (phi);
  97         }
  98
  99         public Gee.Set<PhiFunction> get_phi_functions () {
 100                 return phi_functions;
 101         }
 102 }