Searched refs:get_conts (Results 1 - 12 of 12) sorted by last modified time

/seL4-l4v-10.1.1/graph-refine/
H A Dtrace_refute.py214 for c in p.nodes[n].get_conts ():
H A Dsyntax.py622 self.get_conts (), self.get_args ())
637 self.get_conts () == other.get_conts (),
651 def get_conts (self): member in class:Node
732 xs.extend ([str (c) for c in self.get_conts ()])
822 for c in node.get_conts ():
1252 for n2 in node.get_conts ()
H A Dstack_logic.py438 node.get_conts (), cond))
1098 frontier.extend (node.get_conts ())
H A Dsolver.py2161 if fun.nodes[n].get_conts ()[1:] == ['Err']
H A Dsearch.py143 for n in poss for c in p.nodes[n].get_conts ()
393 new_conts = [n2 for n2 in rep.p.nodes[n].get_conts ()
1553 exit_nodes = set ([n for n in body for n2 in p.nodes[n].get_conts ()
H A Drep_graph.py595 n2, self.p.nodes[n].get_conts ())
663 return [(c, false_term, {}) for c in node.get_conts()]
987 [c] = self.p.nodes[n].get_conts ()
996 if n2 not in self.p.nodes[n].get_conts ():
H A Dpseudo_compile.py430 new_conts = [renames.get (c, c) for c in node.get_conts ()]
H A Dproblem.py164 return dict ([(n, [c for c in self.nodes[n].get_conts ()
247 ns = [n2 for n2 in self.nodes[n].get_conts ()
262 n2s = [n2 for n2 in self.nodes[n].get_conts()
272 for n in self.nodes[arc[i]].get_conts ()
454 for n2 in self.nodes[n].get_conts ():
569 return [(node.get_conts () [0], 'N')]
582 graph = dict ([(n, [c for c in nodes[n].get_conts ()
753 graph = dict([(n, [c for c in p.nodes[n].get_conts ()
819 visit.extend (p.nodes[n].get_conts ())
H A Dlogic.py629 for c in nodes[n].get_conts ()],
734 for (cont, conds) in zip (nodes[n].get_conts (), c_conds):
786 conts = [n2 for n2 in nodes[n].get_conts ()
821 for c in p.nodes[n].get_conts ()]
869 for c in node.get_conts ():
1018 if 1 >= len ([n3 for n3 in node.get_conts ()
1155 frontier = [n2 for n2 in p.nodes[loop].get_conts ()
1189 frontier.extend ([n2 for n2 in p.nodes[n].get_conts ()
1279 ns = fun.nodes[n].get_conts ()
1460 graph = dict ([(x, [y for y in p.nodes[x].get_conts ()
[all...]
H A Ddebug.py58 opts = set ([n2 for n2 in p.nodes[n].get_conts ()
/seL4-l4v-10.1.1/graph-refine/graph-to-graph/
H A Delf_correlate.py452 p_conts = filter(lambda x: x != 'Err', p_node.get_conts())
504 next_addrs = p.nodes[call_pn].get_conts()
541 assert len(p.nodes[p_n].get_conts()) == 1
542 return ( (p.nodes[p_n].get_conts())[0] , f)
H A Ddot_utils.py31 if [x for x in p.nodes[n].get_conts() if x not in ns and not x == 'Err']:
40 conts = p.nodes[n].get_conts()

Completed in 84 milliseconds