1 // Philipp Klaus Krause, philipp@informatik.uni-frankfurt.de, pkk@spth.de, 2011
3 // (c) 2011 Goethe-Universität Frankfurt
5 // This program is free software; you can redistribute it and/or modify it
6 // under the terms of the GNU General Public License as published by the
7 // Free Software Foundation; either version 2, or (at your option) any
10 // This program 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
13 // GNU General Public License for more details.
15 // You should have received a copy of the GNU General Public License
16 // along with this program; if not, write to the Free Software
17 // Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
23 // Clear block tree. To be called after each function.
24 void btree_clear(void);
26 // Add child as a sub-block of parent.
27 void btree_add_child(int parent
, int child
);
29 // Gives the lowest common ancestor for blocks a and b.
30 int btree_lowest_common_ancestor(int a
, int b
);
32 // Add symbol to block tree for allocation.
33 void btree_add_symbol(struct symbol
*s
);
35 // Allocate all previously added symbols on the stack.
36 void btree_alloc(void);