Mercurial > lcfOS
view python/transform.py @ 278:9fca39eebe50
First implementation of regalloc with coalsesc
author | Windel Bouwman |
---|---|
date | Sun, 29 Sep 2013 14:08:15 +0200 |
parents | ea93e0a7a31e |
children | 2ccd57b1d78c |
line wrap: on
line source
""" Transformation to optimize IR-code """ import logging from ir import * # Standard passes: class FunctionPass: def __init__(self): self.logger = logging.getLogger('optimize') def run(self, ir): """ Main entry point for the pass """ self.logger.info('Running pass {}'.format(type(self))) ir.check() self.prepare() for f in ir.Functions: self.onFunction(f) ir.check() def onFunction(self, f): """ Override this virtual method """ raise NotImplementedError() def prepare(self): pass class BasicBlockPass(FunctionPass): def onFunction(self, f): for bb in f.Blocks: self.onBasicBlock(bb) def onBasicBlock(self, bb): """ Override this virtual method """ raise NotImplementedError() class InstructionPass(BasicBlockPass): def onBasicBlock(self, bb): for ins in iter(bb.Instructions): self.onInstruction(ins) def onInstruction(self, ins): """ Override this virtual method """ raise NotImplementedError() # Usefull transforms: class ConstantFolder(BasicBlockPass): def onBasicBlock(self, bb): constMap = {} ins = [i for i in bb.Instructions if type(i) in [ImmLoad, BinaryOperator]] for i in ins: if type(i) is ImmLoad: constMap[i.target] = i.value elif type(i) is BinaryOperator: if i.value1 in constMap and i.value2 in constMap and i.operation in ['+', '-', '*', '<<']: op = i.operation va = constMap[i.value1] vb = constMap[i.value2] if op == '+': vr = va + vb elif op == '*': vr = va * vb elif op == '-': vr = va - vb elif op == '<<': vr = va << vb else: raise NotImplementedError() constMap[i.result] = vr i.removeDef(i.result) i2 = ImmLoad(i.result, vr) logging.debug('Replacing {} with {}'.format(i, i2)) i.Parent.replaceInstruction(i, i2) class DeadCodeDeleter(BasicBlockPass): def onBasicBlock(self, bb): def instructionUsed(ins): if not type(ins) in [ImmLoad, BinaryOperator]: return True if len(ins.defs) == 0: # In case this instruction does not define any # variables, assume it is usefull. return True return any(d.Used for d in ins.defs) change = True while change: change = False for i in bb.Instructions: if instructionUsed(i): continue bb.removeInstruction(i) change = True class CommonSubexpressionElimination(BasicBlockPass): def onBasicBlock(self, bb): constMap = {} to_remove = [] for i in bb.Instructions: if isinstance(i, ImmLoad): if i.value in constMap: t_new = constMap[i.value] t_old = i.target logging.debug('Replacing {} with {}'.format(t_old, t_new)) t_old.replaceby(t_new) to_remove.append(i) else: constMap[i.value] = i.target elif isinstance(i, BinaryOperator): k = (i.value1, i.operation, i.value2) if k in constMap: t_old = i.result t_new = constMap[k] logging.debug('Replacing {} with {}'.format(t_old, t_new)) t_old.replaceby(t_new) to_remove.append(i) else: constMap[k] = i.result for i in to_remove: logging.debug('removing {}'.format(i)) bb.removeInstruction(i) class CleanPass(FunctionPass): def onFunction(self, f): bbs = list(f.BasicBlocks) for bb in bbs: # If a block only contains a branch, it can be removed: if len(bb.Instructions) == 1 and type(bb.LastInstruction) is Branch: # This block is empty. # find predecessors of this block and replace this block reference with the jumped reference. ins = bb.LastInstruction preds = bb.Predecessors if bb in preds: # Do not remove if preceeded by itself pass else: for pred in bb.Predecessors: pred.LastInstruction.changeTarget(bb, ins.target) f.removeBasicBlock(bb)