mirror of
https://github.com/tinygrad/tinygrad.git
synced 2026-01-23 13:58:00 -05:00
* expand UOps with rewrite rules [run_process_replay] * progress * much closer * close, way less bugs * bunch of expander tests * fix contract * ops tests pass * fix barrier * mostly passing * bitcast in expanded ops * support more expand merges * all tests pass maybe * fix empty EXPAND * fix LIN fuzzing * add ALL_SAME assert * all same * all same work * raise CompileError * pass fuzz linearizer * revert whitespace * fix nv tensor core test * fix mypy * bug fix * fuzzer passes * put tests back * expand arg to idx
393 lines
18 KiB
Python
393 lines
18 KiB
Python
import unittest
|
|
from test.helpers import TestUOps
|
|
from tinygrad import dtypes, Variable
|
|
from tinygrad.dtype import PtrDType
|
|
from tinygrad.ops import BinaryOps, TernaryOps, UnaryOps, ReduceOps
|
|
from tinygrad.codegen.uops import UOps, UOp
|
|
from tinygrad.codegen.uopgraph import UOpGraph, PatternMatcher, graph_rewrite
|
|
from tinygrad.engine.graph import print_tree # noqa: F401 # pylint: disable=unused-import
|
|
|
|
simple_pm = PatternMatcher([
|
|
(UOp.cvar('x', dtypes.int), lambda x: UOp.const(dtypes.float, 1.0) + UOp.const(dtypes.float, 2.0)),
|
|
(UOp.cvar('x') + UOp.cvar('y'), lambda x,y: UOp.const(dtypes.float, x.arg+y.arg)),
|
|
(UOp.cvar('x') * UOp.cvar('y') * UOp.cvar('z'), lambda x,y,z: UOp.const(dtypes.float, x.arg*y.arg*z.arg)),
|
|
((UOp.var('x') + UOp.cvar('c1')) + UOp.cvar('c2'), lambda x,c1,c2: x + UOp.const(x.dtype, c1.arg+c2.arg)),
|
|
])
|
|
|
|
class TestGraphRewrite(unittest.TestCase):
|
|
def test_dedup(self):
|
|
v1 = UOp(UOps.DEFINE_VAR, dtypes.float)
|
|
v2 = UOp(UOps.DEFINE_VAR, dtypes.float)
|
|
nout = graph_rewrite(v1+v2, PatternMatcher([]))
|
|
self.assertIs(nout.src[0], nout.src[1])
|
|
|
|
def test_simple(self):
|
|
c1 = UOp.const(dtypes.float, 1.0)
|
|
c2 = UOp.const(dtypes.float, 2.0)
|
|
nout = graph_rewrite(c1+c2, simple_pm)
|
|
self.assertEqual(nout.op, UOps.CONST)
|
|
self.assertEqual(nout.arg, 3.0)
|
|
|
|
def test_depth_2_late(self):
|
|
c1 = UOp.const(dtypes.float, 1.0)
|
|
c2 = UOp.const(dtypes.float, 2.0)
|
|
c3 = UOp.const(dtypes.float, 3.0)
|
|
nout = graph_rewrite(c1*c2*(c3+c3), simple_pm)
|
|
self.assertEqual(nout.op, UOps.CONST)
|
|
self.assertEqual(nout.arg, 12.0)
|
|
|
|
def test_double(self):
|
|
c1 = UOp.const(dtypes.float, 1.0)
|
|
c2 = UOp.const(dtypes.float, 2.0)
|
|
c3 = UOp.const(dtypes.float, 3.0)
|
|
nout = graph_rewrite(c1+c2+c3, simple_pm)
|
|
self.assertEqual(nout.op, UOps.CONST)
|
|
self.assertEqual(nout.arg, 6.0)
|
|
|
|
def test_triple(self):
|
|
c1 = UOp.const(dtypes.float, 1.0)
|
|
c2 = UOp.const(dtypes.float, 2.0)
|
|
c3 = UOp.const(dtypes.float, 3.0)
|
|
c4 = UOp.const(dtypes.float, 4.0)
|
|
nout = graph_rewrite(c1+c2+c3+c4, simple_pm)
|
|
self.assertEqual(nout.op, UOps.CONST)
|
|
self.assertEqual(nout.arg, 10.0)
|
|
|
|
def test_diamond(self):
|
|
c1 = UOp.const(dtypes.float, 1.0)
|
|
c2 = UOp.const(dtypes.float, 2.0)
|
|
c3 = UOp.const(dtypes.float, 3.0)
|
|
nout = graph_rewrite((c1+c2)+(c1+c3), simple_pm)
|
|
self.assertEqual(nout.op, UOps.CONST)
|
|
self.assertEqual(nout.arg, 7.0)
|
|
|
|
def test_magic_4(self):
|
|
c1 = UOp.const(dtypes.int, 4.0)
|
|
nout = graph_rewrite(c1, simple_pm)
|
|
self.assertEqual(nout.op, UOps.CONST)
|
|
self.assertEqual(nout.arg, 3.0)
|
|
|
|
def test_depth_2_fold(self):
|
|
v = UOp(UOps.DEFINE_VAR, dtypes.float)
|
|
c1 = UOp.const(dtypes.float, 1.0)
|
|
c2 = UOp.const(dtypes.float, 2.0)
|
|
nout = graph_rewrite(v+c1+c2, simple_pm)
|
|
self.assertEqual(nout.op, UOps.ALU)
|
|
self.assertEqual(nout.src[0].op, UOps.DEFINE_VAR)
|
|
self.assertEqual(nout.src[1].op, UOps.CONST)
|
|
self.assertEqual(nout.src[1].arg, 3.0)
|
|
|
|
class TestUOpGraph(TestUOps):
|
|
def test_add_constant_fold(self):
|
|
c1 = UOp(UOps.CONST, dtypes.float, arg=1.0)
|
|
c2 = UOp(UOps.CONST, dtypes.float, arg=2.0)
|
|
out = UOp(UOps.ALU, dtypes.float, (c1, c2), BinaryOps.ADD)
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len(g.uops), 1)
|
|
out = g.uops[-1]
|
|
self.assertEqual(out.op, UOps.CONST)
|
|
self.assertEqual(out.arg, 3.0)
|
|
|
|
def test_where_same_fold(self):
|
|
v = UOp(UOps.DEFINE_VAR, dtypes.int, arg=Variable('tmp', 0, 1))
|
|
c0 = UOp(UOps.CONST, dtypes.int, arg=0)
|
|
vc = UOp(UOps.ALU, dtypes.bool, (v, c0), BinaryOps.CMPNE)
|
|
c1 = UOp(UOps.CONST, dtypes.float, arg=1.0)
|
|
out = UOp(UOps.ALU, dtypes.float, (vc, c1, c1), TernaryOps.WHERE)
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len(g.uops), 1)
|
|
out = g.uops[-1]
|
|
self.assertEqual(out.op, UOps.CONST)
|
|
self.assertEqual(out.arg, 1.0)
|
|
|
|
def test_where_const_fold(self):
|
|
bf = UOp(UOps.CONST, dtypes.bool, arg=False)
|
|
c1 = UOp(UOps.CONST, dtypes.float, arg=1.0)
|
|
c2 = UOp(UOps.CONST, dtypes.float, arg=2.0)
|
|
out = UOp(UOps.ALU, dtypes.float, (bf, c1, c2), TernaryOps.WHERE)
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len(g.uops), 1)
|
|
out = g.uops[-1]
|
|
self.assertEqual(out.op, UOps.CONST)
|
|
self.assertEqual(out.arg, 2.0)
|
|
|
|
def test_const_cast(self):
|
|
bf = UOp(UOps.CONST, dtypes.bool, arg=False)
|
|
out = UOp(UOps.CAST, dtypes.int, (bf,))
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len(g.uops), 1)
|
|
out = g.uops[-1]
|
|
self.assertEqual(out.op, UOps.CONST)
|
|
self.assertEqual(out.arg, 0)
|
|
|
|
def test_const_vectorize_fold(self):
|
|
c0 = UOp(UOps.CONST, dtypes.half, arg=0.0)
|
|
out = UOp(UOps.VECTORIZE, dtypes.half.vec(2), (c0, c0))
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len(g.uops), 1)
|
|
out = g.uops[-1]
|
|
self.assertEqual(out.op, UOps.CONST)
|
|
self.assertEqual(out.arg, 0.0)
|
|
|
|
def test_noop_vectorize_fold(self):
|
|
d0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.float), arg=(0, True))
|
|
idx = UOp.const(dtypes.int, 0)
|
|
ld = UOp(UOps.LOAD, dtypes.float.vec(2), (d0, idx))
|
|
vec = UOp(UOps.VECTORIZE, dtypes.float.vec(2), (ld,))
|
|
x = UOp(UOps.GEP, dtypes.float, (vec, ), arg=0)
|
|
alu = UOp(UOps.ALU, dtypes.float, (x, ), UnaryOps.SQRT)
|
|
out = UOp(UOps.STORE, None, (d0, idx, alu))
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len([x for x in g.uops if x.op is UOps.VECTORIZE]), 0)
|
|
|
|
def test_gep_vec_fold(self):
|
|
d0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.float), (), (0, True))
|
|
d1 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.float), (), (1, False))
|
|
d2 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.float), (), (2, False))
|
|
idx = UOp.const(dtypes.int, 0)
|
|
def _test_vec(geps):
|
|
vec = UOp(UOps.VECTORIZE, dtypes.float.vec(4), geps)
|
|
out = UOp(UOps.STORE, None, (d0, idx, vec))
|
|
return UOpGraph([out]).uops[-1].src[-1]
|
|
|
|
# possible
|
|
val = UOp(UOps.LOAD, dtypes.float.vec(4), (d1, idx))
|
|
xyzw = tuple(UOp(UOps.GEP, dtypes.float, (val,), i) for i in range(4))
|
|
self.assert_equiv_uops(_test_vec(xyzw), val)
|
|
|
|
# unaligned
|
|
val = UOp(UOps.LOAD, dtypes.float.vec(4), (d1, idx))
|
|
wzyx = tuple(UOp(UOps.GEP, dtypes.float, (val,), i) for i in reversed(range(4)))
|
|
self.assertIs(_test_vec(wzyx).op, UOps.VECTORIZE)
|
|
|
|
# different_size
|
|
val = UOp(UOps.LOAD, dtypes.float.vec(2), (d1, idx))
|
|
xy = tuple(UOp(UOps.GEP, dtypes.float, (val, ), i) for i in range(2))
|
|
self.assertIs(_test_vec(xy+xy).op, UOps.VECTORIZE)
|
|
|
|
# different vals
|
|
val1 = UOp(UOps.LOAD, dtypes.float.vec(2), (d1, idx))
|
|
val2 = UOp(UOps.LOAD, dtypes.float.vec(2), (d2, idx))
|
|
xy1 = tuple(UOp(UOps.GEP, dtypes.float, (val1, ), i) for i in range(2))
|
|
xy2 = tuple(UOp(UOps.GEP, dtypes.float, (val2, ), i) for i in range(2))
|
|
self.assertIs(_test_vec(xy1+xy2).op, UOps.VECTORIZE)
|
|
|
|
def test_cast_alu_fold(self):
|
|
d0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.bool), arg=(0, True))
|
|
d1 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), arg=(1, False))
|
|
idx = UOp.const(dtypes.int, 0)
|
|
ld = UOp(UOps.LOAD, dtypes.int, (d1, idx))
|
|
alu = ld.lt(1).cast(dtypes.bool)
|
|
out = UOp(UOps.STORE, None, (d0, idx, alu))
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len([x for x in g.uops if x.op is UOps.CAST]), 0)
|
|
|
|
def test_double_cast_fold(self):
|
|
d0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.float), arg=(0, True))
|
|
d1 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), arg=(1, False))
|
|
idx = UOp.const(dtypes.int, 0)
|
|
ld = UOp(UOps.LOAD, dtypes.int, (d1, idx))
|
|
alu = ld.cast(dtypes.float).cast(dtypes.float)
|
|
out = UOp(UOps.STORE, None, (d0, idx, alu))
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len([x for x in g.uops if x.op is UOps.CAST]), 1)
|
|
|
|
def test_depth_2_const_fold(self):
|
|
v = UOp(UOps.DEFINE_VAR, dtypes.int, arg=Variable('tmp', 0, 1))
|
|
c2 = UOp(UOps.CONST, dtypes.int, arg=2)
|
|
c4 = UOp(UOps.CONST, dtypes.int, arg=4)
|
|
vc = UOp(UOps.ALU, dtypes.int, (v, c2), BinaryOps.ADD)
|
|
out = UOp(UOps.ALU, dtypes.int, (vc, c4), BinaryOps.ADD)
|
|
g = UOpGraph([out])
|
|
self.assertEqual(len(g.uops), 3)
|
|
out = g.uops[-1]
|
|
self.assertEqual(out.op, UOps.ALU)
|
|
self.assertEqual(out.arg, BinaryOps.ADD)
|
|
self.assertEqual(out.src[1].op, UOps.CONST)
|
|
self.assertEqual(out.src[1].arg, 6)
|
|
|
|
def test_fold_gated_load(self):
|
|
glbl0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (0, True))
|
|
glbl1 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (1, False))
|
|
glbl2 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (2, False))
|
|
idx = UOp.const(dtypes.int, 0)
|
|
ld0 = UOp(UOps.LOAD, dtypes.int, (glbl1, idx, UOp.const(dtypes.bool, False), UOp.const(dtypes.int, 2)))
|
|
ld1 = UOp(UOps.LOAD, dtypes.int, (glbl2, idx, UOp.const(dtypes.bool, True), UOp.const(dtypes.int, 3)))
|
|
uops = UOpGraph([UOp(UOps.STORE, None, (glbl0, idx, ld0+ld1))])
|
|
ld0, ld1 = uops[-1].src[2].src
|
|
# ld0 becomes the invalid value
|
|
self.assert_equiv_uops(ld0, UOp.const(dtypes.int, 2))
|
|
# the gate and invalid value are deleted from ld1
|
|
self.assert_equiv_uops(ld1, UOp.load(glbl2, idx, dtype=dtypes.int))
|
|
|
|
def test_fold_gated_load_local(self):
|
|
glbl0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (0, True))
|
|
smem = UOp(UOps.DEFINE_LOCAL, PtrDType(dtypes.int), (), ("temp", 1))
|
|
lidx = UOp(UOps.SPECIAL, dtypes.int, (), (0, "lidx1", 16))
|
|
st = UOp(UOps.STORE, None, (smem, lidx, UOp.load(glbl0, lidx, dtype=dtypes.int)))
|
|
barrier = UOp(UOps.BARRIER, None, (st, ))
|
|
ld0 = UOp(UOps.LOAD, dtypes.int, (smem, lidx+1, UOp.const(dtypes.bool, False), UOp.const(dtypes.int, 2), barrier))
|
|
ld1 = UOp(UOps.LOAD, dtypes.int, (smem, lidx+2, UOp.const(dtypes.bool, True), UOp.const(dtypes.int, 3), barrier))
|
|
uops = UOpGraph([UOp(UOps.STORE, None, (glbl0, lidx, ld0+ld1))])
|
|
ld0, ld1 = uops[-1].src[2].src
|
|
# ld0 becomes the invalid value
|
|
self.assert_equiv_uops(ld0, UOp.const(dtypes.int, 2))
|
|
# the gate and invalid value are deleted from ld1
|
|
self.assert_equiv_uops(ld1, UOp.load(smem, lidx+2, barrier, dtype=dtypes.int))
|
|
|
|
def test_fold_gated_store(self):
|
|
glbl = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (0, True))
|
|
idx0 = UOp.const(dtypes.int, 0)
|
|
idx1 = UOp.const(dtypes.int, 0)
|
|
val = UOp.const(dtypes.int, 42)
|
|
st0 = UOp(UOps.STORE, None, (glbl, idx0, val, UOp.const(dtypes.bool, False)))
|
|
st1 = UOp(UOps.STORE, None, (glbl, idx1, val, UOp.const(dtypes.bool, True)))
|
|
uops = UOpGraph([st0, st1])
|
|
# only the second store happens
|
|
self.assertEqual(len(uops.uops), 4)
|
|
self.assert_equiv_uops(uops[-1], UOp.store(glbl, idx1, val))
|
|
|
|
def test_asserts_bad_gate(self):
|
|
glbl0 = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (0, True))
|
|
idx = UOp.const(dtypes.int, 0)
|
|
bad_gate = UOp.const(dtypes.int, 1)
|
|
uops = UOpGraph([UOp(UOps.STORE, None, (glbl0, idx, UOp.const(dtypes.int, 42), bad_gate))])
|
|
with self.assertRaises(AssertionError): uops.linearize()
|
|
|
|
def test_switched_range_order(self):
|
|
glbl = UOp(UOps.DEFINE_GLOBAL, PtrDType(dtypes.int), (), (0, True))
|
|
c0 = UOp.const(dtypes.int, 0)
|
|
c2 = UOp.const(dtypes.int, 2)
|
|
cf = UOp.const(dtypes.float, 0.0)
|
|
r1 = UOp(UOps.RANGE, dtypes.int, (c0, c2), (1, 0, False))
|
|
r2 = UOp(UOps.RANGE, dtypes.int, (c0, c2), (1, 1, False))
|
|
alu = UOp(UOps.ALU, dtypes.int, (r2, r1), BinaryOps.MUL)
|
|
store = UOp(UOps.STORE, None, (glbl, alu, cf))
|
|
uops = UOpGraph([store]).uops
|
|
ranges = [x for x in uops if x.op is UOps.RANGE]
|
|
endranges = [x for x in uops if x.op is UOps.ENDRANGE]
|
|
# ranges are closed in the right order
|
|
self.assertEqual(endranges[-1].src[0], ranges[0])
|
|
|
|
def expander_rewrite(sink):
|
|
from tinygrad.codegen.uopgraph import expander, constant_folder
|
|
together = PatternMatcher(expander.patterns + constant_folder.patterns)
|
|
return graph_rewrite(sink, together)
|
|
#out = UOpGraph(UOp(UOps.SINK, None, (sink,)))
|
|
#out.linearize()
|
|
#return out.uops[-1]
|
|
|
|
class TestExpander(unittest.TestCase):
|
|
def test_expand_add_broadcast(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
sink = expander_rewrite(e1+3)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 4
|
|
self.assertListEqual([x.arg for x in sink.src], [3,4,5,6])
|
|
|
|
def test_contract_simple(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
con = UOp(UOps.CONTRACT, dtypes.int.vec(4), (e1,), (1,))
|
|
sink = expander_rewrite(con)
|
|
assert sink.op is UOps.VECTORIZE and len(sink.src) == 4
|
|
self.assertListEqual([x.arg for x in sink.src], [0,1,2,3])
|
|
|
|
def test_contract_axis_1(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(16)), ((1,4),(2,4)))
|
|
con = UOp(UOps.CONTRACT, dtypes.int.vec(4), (e1,), (1,))
|
|
sink = expander_rewrite(con)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 4 and sink.arg == ((2,4),)
|
|
assert sink.src[0].op is UOps.VECTORIZE and len(sink.src[0].src) == 4
|
|
self.assertListEqual([x.arg for x in sink.src[0].src], [0,4,8,12])
|
|
self.assertListEqual([x.arg for x in sink.src[3].src], [3,7,11,15])
|
|
|
|
def test_contract_axis_2(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(16)), ((1,4),(2,4)))
|
|
con = UOp(UOps.CONTRACT, dtypes.int.vec(4), (e1,), (2,))
|
|
sink = expander_rewrite(con)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 4 and sink.arg == ((1,4),)
|
|
assert sink.src[0].op is UOps.VECTORIZE and len(sink.src[0].src) == 4
|
|
self.assertListEqual([x.arg for x in sink.src[0].src], [0,1,2,3])
|
|
self.assertListEqual([x.arg for x in sink.src[3].src], [12,13,14,15])
|
|
|
|
def test_contract_mid(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(8)), ((1,2),(2,2),(3,2)))
|
|
con = UOp(UOps.CONTRACT, dtypes.int.vec(2), (e1,), (2,))
|
|
sink = expander_rewrite(con)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 4 and sink.arg == ((1,2),(3,2))
|
|
assert sink.src[0].op is UOps.VECTORIZE and len(sink.src[0].src) == 2
|
|
self.assertListEqual([x.arg for x in sink.src[0].src], [0,2])
|
|
self.assertListEqual([x.arg for x in sink.src[1].src], [1,3])
|
|
self.assertListEqual([x.arg for x in sink.src[2].src], [4,6])
|
|
self.assertListEqual([x.arg for x in sink.src[3].src], [5,7])
|
|
|
|
def test_expand_same_axis(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
e2 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, 4*x) for x in range(4)), ((1,4),))
|
|
sink = expander_rewrite(e1+e2)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 4
|
|
self.assertListEqual([x.arg for x in sink.src], [0,5,10,15])
|
|
|
|
def test_expand_different_axis(self, flip=False):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, 4*x) for x in range(4)), ((1,4),))
|
|
e2 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((2,4),))
|
|
sink = expander_rewrite((e2+e1) if flip else (e1+e2))
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 16
|
|
assert sink.arg == ((1, 4), (2, 4))
|
|
self.assertListEqual([x.arg for x in sink.src], [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15])
|
|
|
|
def test_expand_different_axis_flip(self): self.test_expand_different_axis(True)
|
|
|
|
def test_reduce_known_axis(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
sink = UOp(UOps.REDUCE, dtypes.int, (3*e1,e1), ReduceOps.SUM)
|
|
sink = expander_rewrite(sink)
|
|
assert sink.op is UOps.CONST
|
|
self.assertEqual(sink.arg, 3*(0+1+2+3))
|
|
|
|
def test_reduce_const(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
sink = UOp(UOps.REDUCE, dtypes.int, (UOp.const(dtypes.int, 3), e1), ReduceOps.SUM)
|
|
sink = expander_rewrite(sink)
|
|
assert sink.op is UOps.CONST
|
|
self.assertEqual(sink.arg, 3*4)
|
|
|
|
def test_double_expand(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((2,4),))
|
|
e2 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, 4+x) for x in range(4)), ((2,4),))
|
|
e = UOp(UOps.EXPAND, dtypes.int, (e1, e2), ((1,2),))
|
|
sink = expander_rewrite(e)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 8
|
|
assert sink.arg == ((1, 2), (2, 4))
|
|
self.assertListEqual([x.arg for x in sink.src], [0,1,2,3,4,5,6,7])
|
|
|
|
def test_double_expand_reverse(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
e2 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, 4+x) for x in range(4)), ((1,4),))
|
|
e = UOp(UOps.EXPAND, dtypes.int, (e1, e2), ((2,2),))
|
|
sink = expander_rewrite(e)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 8
|
|
assert sink.arg == ((1, 4), (2, 2))
|
|
self.assertListEqual([x.arg for x in sink.src], [0, 4, 1, 5, 2, 6, 3, 7])
|
|
|
|
def test_double_expand_middle(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,2),(3,2)))
|
|
e2 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, 4+x) for x in range(4)), ((1,2),(3,2)))
|
|
e = UOp(UOps.EXPAND, dtypes.int, (e1, e2), ((2,2),))
|
|
sink = expander_rewrite(e)
|
|
assert sink.op is UOps.EXPAND and len(sink.src) == 8
|
|
assert sink.arg == ((1, 2), (2, 2), (3, 2))
|
|
self.assertListEqual([x.arg for x in sink.src], [0, 1, 4, 5, 2, 3, 6, 7])
|
|
|
|
# does this need to work?
|
|
@unittest.expectedFailure
|
|
@unittest.skip
|
|
def test_reduce_different_axis(self):
|
|
e1 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((1,4),))
|
|
e2 = UOp(UOps.EXPAND, dtypes.int, tuple(UOp.const(dtypes.int, x) for x in range(4)), ((2,4),))
|
|
sink = UOp(UOps.REDUCE, dtypes.int, (e1,e2), ReduceOps.SUM)
|
|
sink = expander_rewrite(sink)
|
|
print_tree(sink)
|
|
|
|
if __name__ == '__main__':
|
|
unittest.main(verbosity=2)
|