1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281
|
from rpython.jit.metainterp.optimizeopt.optimizer import (
Optimization, OptimizationResult, REMOVED)
from rpython.jit.metainterp.resoperation import rop, OpHelpers, AbstractResOp,\
ResOperation
from rpython.jit.metainterp.optimizeopt.util import make_dispatcher_method
from rpython.jit.metainterp.optimizeopt.shortpreamble import PreambleOp
from rpython.jit.metainterp.optimize import SpeculativeError
class DefaultOptimizationResult(OptimizationResult):
def __init__(self, opt, op, save, nextop):
OptimizationResult.__init__(self, opt, op)
self.save = save
self.nextop = nextop
def callback(self):
self._callback(self.op, self.save, self.nextop)
def _callback(self, op, save, nextop):
if rop.returns_bool_result(op.opnum):
self.opt.getintbound(op).make_bool()
if save:
recentops = self.opt.getrecentops(op.getopnum())
recentops.add(op)
if nextop:
self.opt.emit_extra(nextop)
class CallPureOptimizationResult(OptimizationResult):
def callback(self):
self.opt.call_pure_positions.append(
len(self.opt.optimizer._newoperations) - 1)
class RecentPureOps(object):
REMEMBER_LIMIT = 16
def __init__(self):
self.lst = [None] * self.REMEMBER_LIMIT
self.next_index = 0
def add(self, op):
assert isinstance(op, AbstractResOp)
next_index = self.next_index
self.next_index = (next_index + 1) % self.REMEMBER_LIMIT
self.lst[next_index] = op
def force_preamble_op(self, opt, op, i):
if not isinstance(op, PreambleOp):
return op
op = opt.force_op_from_preamble(op)
self.lst[i] = op
return op
def lookup1(self, opt, box0, descr):
for i in range(self.REMEMBER_LIMIT):
op = self.lst[i]
if op is None:
break
if box0.same_box(opt.get_box_replacement(op.getarg(0))) and op.getdescr() is descr:
op = self.force_preamble_op(opt, op, i)
return opt.get_box_replacement(op)
return None
def lookup2(self, opt, box0, box1, descr):
for i in range(self.REMEMBER_LIMIT):
op = self.lst[i]
if op is None:
break
if (box0.same_box(opt.get_box_replacement(op.getarg(0))) and
box1.same_box(opt.get_box_replacement(op.getarg(1))) and
op.getdescr() is descr):
op = self.force_preamble_op(opt, op, i)
return opt.get_box_replacement(op)
return None
def lookup(self, optimizer, op):
numargs = op.numargs()
if numargs == 1:
return self.lookup1(optimizer,
optimizer.get_box_replacement(op.getarg(0)),
op.getdescr())
elif numargs == 2:
return self.lookup2(optimizer,
optimizer.get_box_replacement(op.getarg(0)),
optimizer.get_box_replacement(op.getarg(1)),
op.getdescr())
else:
assert False
class OptPure(Optimization):
def __init__(self):
self.postponed_op = None
self._pure_operations = [None] * (rop._ALWAYS_PURE_LAST -
rop._ALWAYS_PURE_FIRST)
self.call_pure_positions = []
self.extra_call_pure = []
def propagate_forward(self, op):
return dispatch_opt(self, op)
def propagate_postprocess(self, op):
dispatch_postprocess(self, op)
def optimize_default(self, op):
canfold = rop.is_always_pure(op.opnum)
if rop.is_ovf(op.opnum):
self.postponed_op = op
return
if self.postponed_op:
nextop = op
op = self.postponed_op
self.postponed_op = None
canfold = nextop.getopnum() == rop.GUARD_NO_OVERFLOW
else:
nextop = None
save = False
if canfold:
for i in range(op.numargs()):
if self.get_constant_box(op.getarg(i)) is None:
break
else:
# all constant arguments: constant-fold away
resbox = self.optimizer.constant_fold(op)
# note that INT_xxx_OVF is not done from here, and the
# overflows in the INT_xxx operations are ignored
self.optimizer.make_constant(op, resbox)
return
# did we do the exact same operation already?
recentops = self.getrecentops(op.getopnum())
save = True
oldop = recentops.lookup(self.optimizer, op)
if oldop is not None:
self.optimizer.make_equal_to(op, oldop)
return
# otherwise, the operation remains
return self.emit_result(DefaultOptimizationResult(self, op, save, nextop))
def getrecentops(self, opnum):
if rop._OVF_FIRST <= opnum <= rop._OVF_LAST:
opnum = opnum - rop._OVF_FIRST
else:
opnum = opnum - rop._ALWAYS_PURE_FIRST
assert 0 <= opnum < len(self._pure_operations)
recentops = self._pure_operations[opnum]
if recentops is None:
self._pure_operations[opnum] = recentops = RecentPureOps()
return recentops
def optimize_call_pure(self, op, start_index=0):
# Step 1: check if all arguments are constant
for i in range(start_index, op.numargs()):
self.optimizer.force_box(op.getarg(i))
# XXX hack to ensure that virtuals that are
# constant are presented that way
result = self._can_optimize_call_pure(op, start_index=start_index)
if result is not None:
# this removes a CALL_PURE with all constant arguments.
self.make_constant(op, result)
self.last_emitted_operation = REMOVED
return
# Step 2: check if all arguments are the same as a previous
# CALL_PURE.
for pos in self.call_pure_positions:
old_op = self.optimizer._newoperations[pos]
if self.optimize_call_pure_old(op, old_op, start_index):
return
if self.extra_call_pure:
for i, old_op in enumerate(self.extra_call_pure):
if self.optimize_call_pure_old(op, old_op, start_index):
if isinstance(old_op, PreambleOp):
old_op = self.optimizer.force_op_from_preamble(old_op)
self.extra_call_pure[i] = old_op
return
# replace CALL_PURE with just CALL (but keep COND_CALL_VALUE)
if start_index == 0:
opnum = OpHelpers.call_for_descr(op.getdescr())
newop = self.optimizer.replace_op_with(op, opnum)
else:
newop = op
return self.emit_result(CallPureOptimizationResult(self, newop))
def optimize_CALL_PURE_I(self, op):
return self.optimize_call_pure(op)
optimize_CALL_PURE_R = optimize_CALL_PURE_I
optimize_CALL_PURE_F = optimize_CALL_PURE_I
optimize_CALL_PURE_N = optimize_CALL_PURE_I
def optimize_COND_CALL_VALUE_I(self, op):
return self.optimize_call_pure(op, start_index=1)
optimize_COND_CALL_VALUE_R = optimize_COND_CALL_VALUE_I
def optimize_call_pure_old(self, op, old_op, start_index):
if op.getdescr() is not old_op.getdescr():
return False
# this will match a call_pure and a cond_call_value with
# the same function and arguments
j = start_index
old_start_index = OpHelpers.is_cond_call_value(old_op.opnum)
for i in range(old_start_index, old_op.numargs()):
box = old_op.getarg(i)
if not self.get_box_replacement(op.getarg(j)).same_box(box):
break
j += 1
else:
# all identical
# this removes a CALL_PURE that has the same (non-constant)
# arguments as a previous CALL_PURE.
if isinstance(old_op, PreambleOp):
# xxx obscure, it's dealt with in the caller
old_op = old_op.op
self.make_equal_to(op, old_op)
self.last_emitted_operation = REMOVED
return True
return False
def optimize_GUARD_NO_EXCEPTION(self, op):
if self.last_emitted_operation is REMOVED:
# it was a CALL_PURE that was killed; so we also kill the
# following GUARD_NO_EXCEPTION
return
return self.emit(op)
def flush(self):
assert self.postponed_op is None
def setup(self):
self.optimizer.optpure = self
def pure(self, opnum, op):
recentops = self.getrecentops(opnum)
recentops.add(op)
def pure_from_args(self, opnum, args, op, descr=None):
newop = ResOperation(opnum,
[self.get_box_replacement(arg) for arg in args],
descr=descr)
newop.set_forwarded(op)
self.pure(opnum, newop)
def has_pure_result(self, opnum, args, descr):
return False
# XXX
def get_pure_result(self, op):
recentops = self.getrecentops(op.getopnum())
return recentops.lookup(self.optimizer, op)
def produce_potential_short_preamble_ops(self, sb):
ops = self.optimizer._newoperations
for i, op in enumerate(ops):
if rop.is_always_pure(op.opnum):
sb.add_pure_op(op)
if rop.is_ovf(op.opnum) and ops[i + 1].getopnum() == rop.GUARD_NO_OVERFLOW:
sb.add_pure_op(op)
for i in self.call_pure_positions:
op = ops[i]
# don't move call_pure_with_exception in the short preamble...
# issue #2015
# Also, don't move cond_call_value in the short preamble.
# The issue there is that it's usually pointless to try to
# because the 'value' argument is typically not a loop
# invariant, and would really need to be in order to end up
# in the short preamble. Maybe the code works anyway in the
# other rare case, but better safe than sorry and don't try.
effectinfo = op.getdescr().get_extra_info()
if not effectinfo.check_can_raise(ignore_memoryerror=True):
assert rop.is_call(op.opnum)
if not OpHelpers.is_cond_call_value(op.opnum):
sb.add_pure_op(op)
dispatch_opt = make_dispatcher_method(OptPure, 'optimize_',
default=OptPure.optimize_default)
dispatch_postprocess = make_dispatcher_method(OptPure, 'postprocess_')
|