qf
/
quakeforge
mirror of https://git.code.sf.net/p/quake/quakeforge
0
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Handle back edges in return type flow. 

Turns out the flow loop needs to be repeated until there are no changes.
This commit is contained in:
Bill Currie 2012-11-30 18:25:47 +09:00
parent 9e4fb3d3e7
commit df66669a87
1 changed files with 22 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

36
tools/qfcc/source/flow.c
View File

@ -595,26 +595,34 @@ static void
flow_return_type (flowgraph_t *graph)
{
etype_t return_type;
etype_t old_rtype;
flownode_t *node;
set_iter_t *pred_iter;
flownode_t *pred;
int i;
int changed;
node = graph->nodes[0];
flow_set_return_type (node, ev_void);
for (i = 1; i < graph->num_nodes; i++) {
node = graph->nodes[graph->dfo[i]];
return_type = ev_type_count;
for (pred_iter = set_first (node->predecessors); pred_iter;
pred_iter = set_next (pred_iter)) {
pred = graph->nodes[pred_iter->member];
if (return_type == ev_type_count)
return_type = pred->return_type.out;
if (return_type != pred->return_type.out)
return_type = ev_void;
do {
changed = 0;
node = graph->nodes[0];
flow_set_return_type (node, ev_void);
for (i = 1; i < graph->num_nodes; i++) {
node = graph->nodes[graph->dfo[i]];
return_type = ev_type_count;
old_rtype = node->return_type.in;
for (pred_iter = set_first (node->predecessors); pred_iter;
pred_iter = set_next (pred_iter)) {
pred = graph->nodes[pred_iter->member];
if (return_type == ev_type_count)
return_type = pred->return_type.out;
if (return_type != pred->return_type.out)
return_type = ev_void;
}
flow_set_return_type (node, return_type);
if (return_type != old_rtype)
changed = 1;
}
flow_set_return_type (node, return_type);
}
} while (changed);
}
static void