/seL4-l4v-master/graph-refine/example/ |
H A D | target.py | 8 from target_objects import symbols, sections, rodata, pairings, danger_set namespace 35 pairings[f] = [pair] 36 pairings[f2] = [pair] 37 print '%d pairing halves built.' % (len (pairings))
|
/seL4-l4v-master/graph-refine/loop-example/synth/ |
H A D | target.py | 8 from target_objects import symbols, sections, rodata, pairings, danger_set namespace 35 pairings[f] = [pair] 36 pairings[f2] = [pair] 37 print '%d pairing halves built.' % (len (pairings))
|
/seL4-l4v-master/graph-refine/loop-example/O1/ |
H A D | target.py | 8 from target_objects import symbols, sections, rodata, pairings, danger_set namespace 47 pairings.update (new_pairings)
|
/seL4-l4v-master/graph-refine/seL4-example/ |
H A D | target.py | 8 from target_objects import symbols, sections, rodata, pairings namespace 50 pairings.update (new_pairings)
|
/seL4-l4v-master/graph-refine/loop-example/O2/ |
H A D | target.py | 8 from target_objects import symbols, sections, rodata, pairings, danger_set namespace 47 pairings.update (new_pairings)
|
/seL4-l4v-master/graph-refine/ |
H A D | graph-refine.py | 18 from target_objects import pairings, functions namespace 120 if s in pairings and len (pairings[s]) == 1: 121 return pairings[s][0] 122 pairs = list (set ([pair for f in pairings for pair in pairings[f] 216 pairs = list (set ([pair for f in pairings for pair in pairings[f] 219 omitted = list (set ([pair for f in pairings for pair in pairings[ [all...] |
H A D | inst_logic.py | 17 from target_objects import functions, trace, pairings, pre_pairings, printout namespace 104 assert l_fname not in pairings 105 assert r_fname not in pairings 108 pairings[l_fname] = [pair] 109 pairings[r_fname] = [pair]
|
H A D | stats.py | 13 from target_objects import pairings namespace 22 pairings_set = set ([p for f in pairings for p in pairings[f]]) 173 pairings_set = set ([p for f in pairings for p in pairings[f]])
|
H A D | target_objects.py | 32 pairings = {} variable
|
H A D | debug.py | 7 from target_objects import functions, pairings namespace 601 for p in pairings.itervalues (): 723 [pair] = [pair for pair in pairings[f] 765 pairs = set ([pair for f in pairings for pair in pairings[f]]) 829 pairs = set (pairings[name]) 831 if [pair for pair in pairings[name2] if pair in pairs]]
|
H A D | rep_graph.py | 15 from target_objects import functions, pairings, sections, trace, printout namespace 791 for pair in pairings.get (name, []): 816 pairs = [pair for pair in pairings[list (fnames)[0]] 1187 pairs = [pair for pair in pairings[fname]
|
H A D | trace_refute.py | 18 from target_objects import functions, trace, pairings, symbols, printout namespace 134 [pair] = pairings[fn]
|
H A D | stack_logic.py | 15 from target_objects import functions, trace, pairings, pre_pairings, printout namespace 228 if fname not in pairings: 231 # revise if multi-pairings for ASM an option 232 [pair] = pairings[fname] 1175 visit.update ([pair.funs[tag] for f in pairings 1176 for pair in pairings[f] if tag in pair.funs]) 1225 """build the stack-aware calling-convention-aware logical pairings
|
H A D | check.py | 15 from target_objects import functions, pairings, trace, printout namespace 60 in pairings.get (p.nodes[n].fname, []) 87 for pair in pairings.get (p.nodes[n].fname, [])
|
H A D | logic.py | 1220 from target_objects import functions, pairings namespace 1224 pairs = [pair for pair in pairings.get (node.fname, [])
|
H A D | loop_bounds.py | 481 funs = [f for pair in target_objects.pairings[fname]
|
H A D | problem.py | 11 from target_objects import functions, pairings, trace, printout namespace
|
/seL4-l4v-master/HOL4/src/num/arith/src/ |
H A D | Solve_ineqs.sml | 218 (* rise to the least number of pairings. *)
|