seL4-l4v-10.1.1/graph-refine/logic.py

627 def compute_preds (nodes):
628 	preds = dict_list ([(c, n) for n in nodes
629 			for c in nodes[n].get_conts ()],
630 		keys = nodes)
647 def compute_var_flows (nodes, outputs, preds, override_lvals_rvals = {}):
651 	for (n, node) in nodes.iteritems ():
675 		for n in nodes:
690 def cont_with_conds (nodes, n, conds):
692 		if n not in nodes or nodes[n].kind != 'Cond':
694 		cond = nodes[n].cond
696 			n = nodes[n].left
698 			n = nodes[n].right
702 def contextual_conds (nodes, preds):
707 	visit = [n for n in nodes if not (preds[n])]
710 		if n not in nodes:
721 		if n not in nodes:
723 		if nodes[n].kind == 'Cond' and nodes[n].left == nodes[n].right:
725 		elif nodes[n].kind == 'Cond':
726 			c_conds = [nodes[n].cond, mk_not_red (nodes[n].cond)]
730 			upds = set (nodes[n].get_lvals ())
734 		for (cont, conds) in zip (nodes[n].get_conts (), c_conds):
739 def contextual_cond_simps (nodes, preds):
750 	(arc_conds, pre_conds) = contextual_conds (nodes, preds)
751 	nodes = dict (nodes)
752 	for n in nodes:
753 		if nodes[n].kind == 'Cond':
755 		cont = nodes[n].cont
757 		cont2 = cont_with_conds (nodes, cont, conds)
759 			nodes[n] = syntax.copy_rename (nodes[n],
761 	return nodes
773 	nodes = contextual_cond_simps (p.nodes, p.preds)
786 				conts = [n2 for n2 in nodes[n].get_conts ()
806 	for n in p.nodes:
807 		node = p.nodes[n]
821 			for c in p.nodes[n].get_conts ()]
825 		if p.nodes[n].kind != 'Cond' or p_ct > max_cost:
842 def compute_var_deps (nodes, outputs, preds, override_lvals_rvals = {},
850 	nodes = contextual_cond_simps (nodes, preds)
855 		node = simplify_node_elementary (nodes[n])
891 		nodes = p.nodes
893 		nodes = override_nodes
896 		if not nodes[n2].is_noop ()
897 		for v in nodes[n2].get_lvals ()])
901 	vca = compute_var_cycle_analysis (p, nodes, n,
911 def compute_var_cycle_analysis (p, nodes, n, const_vars, vs, diag = None):
927 				if v not in nodes[n3].get_lvals ()
965 		node = nodes[n2]
1015 		node = nodes[n2]
1155 	frontier = [n2 for n2 in p.nodes[loop].get_conts ()
1167 		if p.nodes[n].kind == 'Basic':
1168 			for ((v, typ), rexpr) in p.nodes[n].upds:
1170 		elif p.nodes[n].kind == 'Call':
1171 			for (v, typ) in p.nodes[n].get_lvals ():
1189 		frontier.extend ([n2 for n2 in p.nodes[n].get_conts ()
1214 	node = p.nodes[n]
1268 def first_aligned_address (nodes, radix):
1269 	ks = [k for k in nodes
1279 		ns = fun.nodes[n].get_conts ()
1290 			addr = first_aligned_address (func.nodes, radix)
1322 		# skip through nodes with single successors
1364 	"""find the nodes of a strongly connected
1460 	graph = dict ([(x, [y for y in p.nodes[x].get_conts ()