6502/SixtyPical
1
0
Fork 0
mirror of https://github.com/catseye/SixtyPical.git synced 2025-02-19 20:30:45 +00:00
Code Issues Projects Releases Wiki Activity

Find the longest chain of routines in R and remove it.

Browse Source
This commit is contained in:
Chris Pressey 2018-04-04 16:54:12 +01:00
parent b1bcc21ffc
commit efe8859209
1 changed files with 26 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
src/sixtypical/fallthru.py
View File

@ -12,6 +12,17 @@ def make_transitive_closure(d, key, s):
make_transitive_closure(d, sub, s) make_transitive_closure(d, sub, s)
def find_chains(d, key, pred):
chains = []
for sub in d.get(key, []):
if pred(sub):
subchains = find_chains(d, sub, pred)
for subchain in subchains:
chains.append([key] + subchain)
chains.append([key])
return chains
class FallthruAnalyzer(object): class FallthruAnalyzer(object):
def __init__(self, debug=False): def __init__(self, debug=False):
@ -63,17 +74,23 @@ class FallthruAnalyzer(object):
self.fall_out_map[routine.name] = None self.fall_out_map[routine.name] = None
routine_list = [] routine_list = []
fall_out_map = copy(self.fall_out_map) pending_routines = copy(self.fall_out_map)
while fall_out_map: while pending_routines:
key = fall_out_map.keys()[0] # Pick a routine that is still pending to be serialized.
in_set = self.fall_in_map.get(key, []) key = pending_routines.keys()[0]
# Find the longest chain of routines r1,r2,...rn in R where out(r1) = {r2}, out(r2} = {r3}, ... out(rn-1) = {rn}, and rn = r.
# TODO implement this
routines = [key]
# Remove (r1,r2,...,rn) from R and append them to L in that order. Mark (r1,r2,...rn-1) as "will have their final goto removed." in_set = self.fall_in_map.get(key, [])
# Find the longest chain of routines r1,r2,...rn in R
# where out(r1) = {r2}, out(r2} = {r3}, ... out(rn-1) = {rn}, and rn = r.
chains = find_chains(self.fall_in_map, key, lambda k: k in pending_routines)
chains.sort(key=len, reverse=True)
routines = chains[0]
# Remove (r1,r2,...,rn) from R and append them to L in that order.
# Mark (r1,r2,...rn-1) as "will have their final goto removed."
for r in routines: for r in routines:
del fall_out_map[r] del pending_routines[r]
if r == routines[-1]: if r == routines[-1]:
routine_list.append(['retain', r]) routine_list.append(['retain', r])
else: else: