Searched refs:vc_num (Results 1 - 4 of 4) sorted by relevance

/seL4-l4v-master/graph-refine/
H A Dcheck.py17 from rep_graph import (vc_num, vc_offs, vc_double_range, vc_upto, mk_vc_opts, namespace
356 (l_visit, _) = split_visit_visits (tags, split, restrs, vc_num (n))
372 visit = vc_num (seq_start + (visit.n * step))
392 (l_start, r_start) = split_visit_visits (tags, split, restrs, vc_num (0))
495 min_vc = vc_num (x - 1)
522 restrs, vc_num (i))
527 vis_hyps = split_hyps_at_visit (tags, split, restrs, vc_num (i))
570 start = split_visit_one_visit (tag, details, restrs, vc_num (0))
592 vis = ((point, restrs + tuple ([(point, vc_num (0))])), tag)
599 reach = split_visit_one_visit (tag, details, restrs, vc_num (
[all...]
H A Drep_graph.py115 return mk_vc_opts (map (vc_num, nums) + map (vc_offs, offsets))
117 def vc_num (n): function
121 return mk_vc_opts (map (vc_num, range (n)))
130 return mk_vc_opts (map (vc_num, range (n)) + map (vc_offs, range (m)))
414 vcount2[split] = vc_num (0)
H A Dloop_bounds.py8 from rep_graph import vc_num, vc_offs, pc_true_hyp, Hyp, eq_hyp namespace
127 return [(n, tuple (general + [(head, rep_graph.vc_num (1))])),
H A Dsearch.py11 from rep_graph import (mk_graph_slice, vc_num, vc_offs, vc_upto, namespace
143 no_loop_restrs = tuple ([(n, vc_num (0)) for n in p.loop_heads ()])
171 no_loop_restrs = tuple ([(n, vc_num (0)) for n in p.loop_heads ()])
411 return ((head, vc_num (visit_num + offs)), ) + restrs
1649 restr = ((split, vc_num (unroll)), )

Completed in 51 milliseconds