def split_if_nodes(self):
'''
Split IfNodes in two nodes, the first node is the header node, the
second one is only composed of the jump condition.
'''
node_map = {}
to_update = set()
for node in self.nodes[:]:
if node.is_cond():
if len(node.get_ins()) > 1:
pre_ins = node.get_ins()[:-1]
last_ins = node.get_ins()[-1]
pre_node = StatementBlock('%s-pre' % node.name, pre_ins)
cond_node = CondBlock('%s-cond' % node.name, [last_ins])
node_map[node] = pre_node
pre_node.copy_from(node)
cond_node.copy_from(node)
pre_node.set_stmt()
cond_node.set_true(node.true)
cond_node.set_false(node.false)
lpreds = self.preds(node)
lsuccs = self.sucs(node)
for pred in lpreds:
pred_node = node_map.get(pred, pred)
if pred is node:
pred_node = cond_node
if pred.is_cond(): # and not (pred is node):
if pred.true is node:
pred_node.set_true(pre_node)
if pred.false is node:
pred_node.set_false(pre_node)
self.add_edge(pred_node, pre_node)
for suc in lsuccs:
self.add_edge(cond_node, node_map.get(suc, suc))
if node is self.entry:
self.set_entry(pre_node)
self.add_node(pre_node)
self.add_node(cond_node)
self.add_edge(pre_node, cond_node)
pre_node.update_attribute_with(node_map)
cond_node.update_attribute_with(node_map)
self.remove_node(node)
else:
to_update.add(node)
for node in to_update:
node.update_attribute_with(node_map)
def split_if_nodes(self):
'''
Split IfNodes in two nodes, the first node is the header node, the
second one is only composed of the jump condition.
'''
node_map = {}
to_update = set()
for node in self.nodes[:]:
if node.is_cond():
if len(node.get_ins()) > 1:
pre_ins = node.get_ins()[:-1]
last_ins = node.get_ins()[-1]
pre_node = StatementBlock('%s-pre' % node.name, pre_ins)
cond_node = CondBlock('%s-cond' % node.name, [last_ins])
node_map[node] = pre_node
pre_node.copy_from(node)
cond_node.copy_from(node)
pre_node.set_stmt()
cond_node.set_true(node.true)
cond_node.set_false(node.false)
lpreds = self.preds(node)
lsuccs = self.sucs(node)
for pred in lpreds:
pred_node = node_map.get(pred, pred)
if pred is node:
pred_node = cond_node
if pred.is_cond(): # and not (pred is node):
if pred.true is node:
pred_node.set_true(pre_node)
if pred.false is node:
pred_node.set_false(pre_node)
self.add_edge(pred_node, pre_node)
for suc in lsuccs:
self.add_edge(cond_node, node_map.get(suc, suc))
if node is self.entry:
self.set_entry(pre_node)
self.add_node(pre_node)
self.add_node(cond_node)
self.add_edge(pre_node, cond_node)
pre_node.update_attribute_with(node_map)
cond_node.update_attribute_with(node_map)
self.remove_node(node)
else:
to_update.add(node)
for node in to_update:
node.update_attribute_with(node_map)
