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
|
// Philipp Klaus Krause, philipp@informatik.uni-frankfurt.de, pkk@spth.de, 2011
//
// (c) 2011 Goethe-Universität Frankfurt
//
// This program is free software; you can redistribute it and/or modify it
// under the terms of the GNU General Public License as published by the
// Free Software Foundation; either version 2, or (at your option) any
// later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
#include <set>
#include <map>
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include "common.h"
extern "C"
{
#include "SDCCbtree.h"
}
#undef BTREE_DEBUG
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, std::pair<std::set<symbol *>, int> > btree_t;
typedef std::map<int, btree_t::vertex_descriptor> bmap_t;
typedef std::map<btree_t::vertex_descriptor, int> bmaprev_t;
static btree_t btree;
static bmap_t bmap;
static bmaprev_t bmaprev;
void btree_clear_subtree(btree_t::vertex_descriptor v)
{
btree[v].first.clear();
boost::graph_traits<btree_t>::out_edge_iterator e, e_end;
for(boost::tie(e, e_end) = boost::out_edges(v, btree); e != e_end; ++e)
btree_clear_subtree(boost::target(*e, btree));
}
void btree_clear(void)
{
#ifdef BTREE_DEBUG
std::cout << "Clearing.\n"; std::cout.flush();
#endif
btree_clear_subtree(0);
}
void btree_add_child(short parent, short child)
{
#ifdef BTREE_DEBUG
std::cout << "Adding child " << child << " at parent " << parent << "\n"; std::cout.flush();
#endif
if(!boost::num_vertices(btree))
{
boost::add_vertex(btree);
bmap[0] = 0;
bmaprev[0] = 0;
}
wassert(parent != child);
wassert(bmap.find(parent) != bmap.end());
btree_t::vertex_descriptor c = boost::add_vertex(btree);
bmap[child] = c;
bmaprev[c] = child;
wassert(bmap[parent] != c);
boost::add_edge(bmap[parent], c, btree);
}
static btree_t::vertex_descriptor btree_lowest_common_ancestor_impl(btree_t::vertex_descriptor a, btree_t::vertex_descriptor b)
{
if(a == b)
return(a);
else if (a > b)
a = boost::source(*boost::in_edges(a, btree).first, btree);
else // (a < b)
b = boost::source(*boost::in_edges(b, btree).first, btree);
return(btree_lowest_common_ancestor(a, b));
}
short btree_lowest_common_ancestor(short a, short b)
{
return(bmaprev[btree_lowest_common_ancestor_impl(bmap[a], bmap[b])]);
}
void btree_add_symbol(struct symbol *s)
{
int block;
wassert(s);
block = s->_isparm ? 0 : s->block; // This is essentially a workaround. TODO: Ensure that the parameter block is placed correctly in the btree instead!
#ifdef BTREE_DEBUG
std::cout << "Adding symbol " << s->name << " at " << block << "\n";
#endif
wassert(bmap.find(block) != bmap.end());
wassert(bmap[block] < boost::num_vertices(btree));
btree[bmap[block]].first.insert(s);
}
static void btree_alloc_subtree(btree_t::vertex_descriptor v, int sPtr, int cssize, int *ssize)
{
std::set<symbol *>::iterator s, s_end;
wassert(v < boost::num_vertices(btree));
for(s = btree[v].first.begin(), s_end = btree[v].first.end(); s != s_end; ++s)
{
struct symbol *const sym = *s;
const int size = getSize (sym->type);
#ifdef BTREE_DEBUG
std::cout << "Allocating symbol " << sym->name << " (" << v << ") of size " << size << " to " << sPtr << "\n";
#endif
if(port->stack.direction > 0)
{
SPEC_STAK (sym->etype) = sym->stack = (sPtr + !TARGET_PDK_LIKE);
sPtr += size;
}
else
{
sPtr -= size;
SPEC_STAK (sym->etype) = sym->stack = sPtr;
}
cssize += size;
}
btree[v].second = cssize;
if(cssize > *ssize)
*ssize = cssize;
boost::graph_traits<btree_t>::out_edge_iterator e, e_end;
for(boost::tie(e, e_end) = boost::out_edges(v, btree); e != e_end; ++e)
btree_alloc_subtree(boost::target(*e, btree), sPtr, cssize, ssize);
}
void btree_alloc(void)
{
int ssize = 0;
if(!boost::num_vertices(btree))
return;
btree_alloc_subtree(0, 0, 0, &ssize);
if(currFunc)
{
#ifdef BTREE_DEBUG
std::cout << "btree stack allocation used total of " << ssize << " bytes\n";
#endif
if (TARGET_PDK_LIKE) // Stack pointer needs to be aligned to multiple of 2
if (ssize & 1) ssize++;
currFunc->stack += ssize;
SPEC_STAK (currFunc->etype) += ssize;
}
}
|
