| /seL4-l4v-10.1.1/HOL4/src/num/arith/src/ |
| H A D | Solve_ineqs.sml | 218 (* rise to the least number of pairings. *)
|
| /seL4-l4v-10.1.1/graph-refine/ |
| H A D | check.py | 17 from target_objects import functions, pairings, trace, printout namespace
62 in pairings.get (p.nodes[n].fname, [])
89 for pair in pairings.get (p.nodes[n].fname, [])
|
| H A D | debug.py | 9 from target_objects import functions, pairings namespace
603 for p in pairings.itervalues ():
725 [pair] = [pair for pair in pairings[f]
767 pairs = set ([pair for f in pairings for pair in pairings[f]])
831 pairs = set (pairings[name])
833 if [pair for pair in pairings[name2] if pair in pairs]]
|
| H A D | graph-refine.py | 20 from target_objects import pairings, functions namespace
122 if s in pairings and len (pairings[s]) == 1:
123 return pairings[s][0]
124 pairs = list (set ([pair for f in pairings for pair in pairings[f]
218 pairs = list (set ([pair for f in pairings for pair in pairings[f]
221 omitted = list (set ([pair for f in pairings for pair in pairings[
[all...] |
| H A D | inst_logic.py | 19 from target_objects import functions, trace, pairings, pre_pairings, printout namespace
106 assert l_fname not in pairings
107 assert r_fname not in pairings
110 pairings[l_fname] = [pair]
111 pairings[r_fname] = [pair]
|
| H A D | logic.py | 1222 from target_objects import functions, pairings namespace
1226 pairs = [pair for pair in pairings.get (node.fname, [])
|
| H A D | loop_bounds.py | 475 funs = [f for pair in target_objects.pairings[fname]
|
| H A D | problem.py | 13 from target_objects import functions, pairings, trace, printout namespace
|
| H A D | rep_graph.py | 17 from target_objects import functions, pairings, sections, trace, printout namespace
793 for pair in pairings.get (name, []):
818 pairs = [pair for pair in pairings[list (fnames)[0]]
1189 pairs = [pair for pair in pairings[fname]
|
| H A D | stack_logic.py | 17 from target_objects import functions, trace, pairings, pre_pairings, printout namespace
230 if fname not in pairings:
233 # revise if multi-pairings for ASM an option
234 [pair] = pairings[fname]
1177 visit.update ([pair.funs[tag] for f in pairings
1178 for pair in pairings[f] if tag in pair.funs])
1227 """build the stack-aware calling-convention-aware logical pairings
|
| H A D | stats.py | 7 from target_objects import pairings namespace
16 pairings_set = set ([p for f in pairings for p in pairings[f]])
167 pairings_set = set ([p for f in pairings for p in pairings[f]])
|
| H A D | target_objects.py | 34 pairings = {} variable
|
| H A D | trace_refute.py | 20 from target_objects import functions, trace, pairings, symbols, printout namespace
136 [pair] = pairings[fn]
|
| /seL4-l4v-10.1.1/graph-refine/example/ |
| H A D | target.py | 10 from target_objects import symbols, sections, rodata, pairings, danger_set namespace
37 pairings[f] = [pair]
38 pairings[f2] = [pair]
39 print '%d pairing halves built.' % (len (pairings))
|
| /seL4-l4v-10.1.1/graph-refine/loop-example/O1/ |
| H A D | target.py | 10 from target_objects import symbols, sections, rodata, pairings, danger_set namespace
49 pairings.update (new_pairings)
|
| /seL4-l4v-10.1.1/graph-refine/loop-example/O2/ |
| H A D | target.py | 11 from target_objects import symbols, sections, rodata, pairings, danger_set namespace
50 pairings.update (new_pairings)
|
| /seL4-l4v-10.1.1/graph-refine/loop-example/synth/ |
| H A D | target.py | 10 from target_objects import symbols, sections, rodata, pairings, danger_set namespace
37 pairings[f] = [pair]
38 pairings[f2] = [pair]
39 print '%d pairing halves built.' % (len (pairings))
|
| /seL4-l4v-10.1.1/graph-refine/seL4-example/ |
| H A D | target.py | 10 from target_objects import symbols, sections, rodata, pairings namespace
52 pairings.update (new_pairings)
|