def test_promote_indirection_impossible():
""" Indirect access that cannot be promoted. """
@dace.program
def testprog13(A: dace.float64[20, 20], scal: dace.int32):
i = 2
with dace.tasklet:
s << scal
a << A(1)[:, :]
out >> A(1)[:, :]
out[i, s] = a[s, i]
sdfg: dace.SDFG = testprog13.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'i'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.simplify()
# [A,scal->Tasklet->A]
assert sdfg.number_of_nodes() == 1
assert sdfg.sink_nodes()[0].number_of_nodes() == 4
A = np.random.rand(20, 20)
expected = np.copy(A)
expected[2, 1] = expected[1, 2]
sdfg(A=A, scal=1)
assert np.allclose(A, expected)
def test_promote_simple():
""" Simple promotion with Python tasklets. """
@dace.program
def testprog2(A: dace.float64[20, 20]):
j = 5
A[:] += j
sdfg: dace.SDFG = testprog2.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'j'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_transformations_repeated(isxf.StateFusion)
# There should be two states:
# [empty] --j=5--> [A->MapEntry->Tasklet->MapExit->A]
assert sdfg.number_of_nodes() == 2
assert sdfg.source_nodes()[0].number_of_nodes() == 0
assert sdfg.sink_nodes()[0].number_of_nodes() == 5
tasklet = next(n for n in sdfg.sink_nodes()[0] if isinstance(n, dace.nodes.Tasklet))
assert '+ j' in tasklet.code.as_string
# Program should produce correct result
A = np.random.rand(20, 20)
expected = A + 5
sdfg(A=A)
assert np.allclose(A, expected)
def test_promote_output_indirection():
""" Indirect output access in promotion. """
@dace.program
def testprog11(A: dace.float64[10]):
i = 2
with dace.tasklet:
ii << i
a >> A(2)[:]
a[ii] = ii
a[ii + 1] = ii + 1
sdfg: dace.SDFG = testprog11.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'i'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.simplify()
assert sdfg.number_of_nodes() == 1
# Check result
A = np.random.rand(10)
expected = np.copy(A)
expected[2] = 2
expected[3] = 3
sdfg(A=A)
assert np.allclose(A, expected)
def test_promote_indirection_c():
""" Indirect access in promotion with C++ tasklets. """
@dace.program
def testprog12(A: dace.float64[10]):
i = 2
with dace.tasklet(dace.Language.CPP):
ii << i
a << A(1)[:]
aout >> A(2)[:]
'''
aout[ii] = a[ii + 1];
aout[ii + 1] = ii + 1;
'''
sdfg: dace.SDFG = testprog12.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'i'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
assert all('i' in e.data.free_symbols for e in sdfg.sink_nodes()[0].edges())
sdfg.simplify()
assert sdfg.number_of_nodes() == 1
# Check result
A = np.random.rand(10)
expected = np.copy(A)
expected[2] = A[3]
expected[3] = 3
sdfg(A=A)
assert np.allclose(A, expected)
def test_promote_array_assignment():
""" Simple promotion with array assignment. """
@dace.program
def testprog6(A: dace.float64[20, 20]):
j = A[1, 1]
if j >= 0.0:
A[:] += j
sdfg: dace.SDFG = testprog6.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'j'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_transformations_repeated(isxf.StateFusion)
# There should be 4 states:
# [empty] --j=A[1, 1]--> [A->MapEntry->Tasklet->MapExit->A] --> [empty]
# \--------------------------------------------/
assert sdfg.number_of_nodes() == 4
ctr = collections.Counter(s.number_of_nodes() for s in sdfg)
assert ctr[0] == 3
assert ctr[5] == 1
# Program should produce correct result
A = np.random.rand(20, 20)
expected = A + A[1, 1]
sdfg(A=A)
assert np.allclose(A, expected)
def test_promote_array_assignment_tasklet():
""" Simple promotion with array assignment. """
@dace.program
def testprog7(A: dace.float64[20, 20]):
j = dace.define_local_scalar(dace.int64)
with dace.tasklet:
inp << A[1, 1]
out >> j
out = inp
A[:] += j
sdfg: dace.SDFG = testprog7.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'j'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_transformations_repeated(isxf.StateFusion)
# There should be two states:
# [empty] --j=A[1, 1]--> [A->MapEntry->Tasklet->MapExit->A]
assert sdfg.number_of_nodes() == 2
assert sdfg.source_nodes()[0].number_of_nodes() == 0
assert sdfg.sink_nodes()[0].number_of_nodes() == 5
# Program should produce correct result
A = np.random.rand(20, 20)
expected = A + int(A[1, 1])
sdfg(A=A)
assert np.allclose(A, expected)
def test_nested_promotion_connector(with_subscript):
# Construct SDFG
postfix = 'a'
if with_subscript:
postfix = 'b'
sdfg = dace.SDFG('testprog14{}'.format(postfix))
sdfg.add_array('A', [20, 20], dace.float64)
sdfg.add_array('B', [1], dace.float64)
sdfg.add_transient('scal', [1], dace.int32)
initstate = sdfg.add_state()
initstate.add_edge(initstate.add_tasklet('do', {}, {'out'}, 'out = 5'),
'out', initstate.add_write('scal'), None,
dace.Memlet('scal'))
state = sdfg.add_state_after(initstate)
nsdfg = dace.SDFG('nested')
nsdfg.add_array('a', [20, 20], dace.float64)
nsdfg.add_array('b', [1], dace.float64)
nsdfg.add_array('s', [1], dace.int32)
nsdfg.add_symbol('s2', dace.int32)
nstate1 = nsdfg.add_state()
nstate2 = nsdfg.add_state()
nsdfg.add_edge(
nstate1, nstate2,
dace.InterstateEdge(assignments=dict(
s2='s[0]' if with_subscript else 's')))
a = nstate2.add_read('a')
t = nstate2.add_tasklet('do', {'inp'}, {'out'}, 'out = inp')
b = nstate2.add_write('b')
nstate2.add_edge(a, None, t, 'inp', dace.Memlet('a[s2, s2 + 1]'))
nstate2.add_edge(t, 'out', b, None, dace.Memlet('b[0]'))
nnode = state.add_nested_sdfg(nsdfg, None, {'a', 's'}, {'b'})
aouter = state.add_read('A')
souter = state.add_read('scal')
bouter = state.add_write('B')
state.add_edge(aouter, None, nnode, 'a', dace.Memlet('A'))
state.add_edge(souter, None, nnode, 's', dace.Memlet('scal'))
state.add_edge(nnode, 'b', bouter, None, dace.Memlet('B'))
#######################################################
# Promotion
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'scal'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.coarsen_dataflow()
assert sdfg.number_of_nodes() == 1
assert sdfg.node(0).number_of_nodes() == 3
assert not any(isinstance(n, dace.nodes.NestedSDFG) for n in sdfg.node(0))
# Correctness
A = np.random.rand(20, 20)
B = np.random.rand(1)
sdfg(A=A, B=B)
assert B[0] == A[5, 6]
def test_promote_indirection():
""" Indirect access in promotion. """
@dace.program
def testprog(A: dace.float64[2, 3, 4, 5], B: dace.float64[4]):
i = 2
j = 1
k = 0
# Complex numpy expression with double indirection
B[:] = A[:, i, :, j][k, :]
# Include tasklet with more than one statement (one with indirection
# and one without) and two outputs.
for m in dace.map[0:2]:
with dace.tasklet:
a << A(1)[:]
ii << i
b1in << B[m]
b2in << B[m + 2]
c = a[0, 0, 0, ii]
b1 = c + 1
b2 = b2in + 1
b1 >> B[m]
b2 >> B[m + 2]
sdfg: dace.SDFG = testprog.to_sdfg(strict=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'i', 'j', 'k'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
for cursdfg in sdfg.all_sdfgs_recursive():
scalar_to_symbol.remove_symbol_indirection(cursdfg)
sdfg.apply_strict_transformations()
assert sdfg.number_of_nodes() == 1
assert all(e.data.subset.num_elements() == 1 for e in sdfg.node(0).edges()
if isinstance(e.src, dace.nodes.Tasklet)
or isinstance(e.dst, dace.nodes.Tasklet))
# Check result
A = np.random.rand(2, 3, 4, 5)
B = np.random.rand(4)
expected = np.copy(A[0, 2, :, 1])
expected[0:2] = A[0, 0, 0, 2] + 1
expected[2:4] += 1
sdfg(A=A, B=B)
assert np.allclose(B, expected)
def test_promote_loop():
""" Loop promotion. """
N = dace.symbol('N')
@dace.program
def testprog8(A: dace.float32[20, 20]):
i = dace.ndarray([1], dtype=dace.int32)
i = 0
while i[0] < N:
A += i
i += 2
sdfg: dace.SDFG = testprog8.to_sdfg(simplify=False)
assert 'i' in scalar_to_symbol.find_promotable_scalars(sdfg)
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.simplify()
def test_promote_loop():
""" Loop promotion. """
N = dace.symbol('N')
@dace.program
def testprog(A: dace.float32[20, 20]):
i = dace.ndarray([1], dtype=dace.int32)
i = 0
while i[0] < N:
A += i
i += 2
sdfg: dace.SDFG = testprog.to_sdfg(strict=False)
assert 'i' in scalar_to_symbol.find_promotable_scalars(sdfg)
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_strict_transformations()
def _parse(self,
args,
kwargs,
strict=None,
save=False,
validate=False) -> SDFG:
"""
Try to parse a DaceProgram object and return the `dace.SDFG` object
that corresponds to it.
:param function: DaceProgram object (obtained from the ``@dace.program``
decorator).
:param args: The given arguments to the function.
:param kwargs: The given keyword arguments to the function.
:param strict: Whether to apply strict transformations or not (None
uses configuration-defined value).
:param save: If True, saves the generated SDFG to
``_dacegraphs/program.sdfg`` after parsing.
:param validate: If True, validates the resulting SDFG after creation.
:return: The generated SDFG object.
"""
# Avoid import loop
from dace.sdfg.analysis import scalar_to_symbol as scal2sym
from dace.transformation import helpers as xfh
# Obtain DaCe program as SDFG
sdfg, cached = self._generate_pdp(args, kwargs, strict=strict)
# Apply strict transformations automatically
if not cached and (
strict == True or (strict is None and Config.get_bool(
'optimizer', 'automatic_strict_transformations'))):
# Promote scalars to symbols as necessary
promoted = scal2sym.promote_scalars_to_symbols(sdfg)
if Config.get_bool('debugprint') and len(promoted) > 0:
print('Promoted scalars {%s} to symbols.' %
', '.join(p for p in sorted(promoted)))
sdfg.apply_strict_transformations()
# Split back edges with assignments and conditions to allow richer
# control flow detection in code generation
xfh.split_interstate_edges(sdfg)
# Save the SDFG. Skip this step if running from a cached SDFG, as
# it might overwrite the cached SDFG.
if not cached and not Config.get_bool('compiler',
'use_cache') and save:
sdfg.save(os.path.join('_dacegraphs', 'program.sdfg'))
# Validate SDFG
if validate:
sdfg.validate()
return sdfg
def test_promote_simple_c():
""" Simple promotion with C++ tasklets. """
@dace.program
def testprog(A: dace.float32[20, 20]):
i = 0
j = 0
k = dace.ndarray([1], dtype=dace.int32)
with dace.tasklet(dace.Language.CPP):
jj << j
"""
ii = jj + 1;
"""
ii >> i
with dace.tasklet(dace.Language.CPP):
jin << j
"""
int something = (int)jin;
jout = something + 1;
"""
jout >> j
with dace.tasklet(dace.Language.CPP):
"""
kout[0] = 0;
"""
kout >> k
sdfg: dace.SDFG = testprog.to_sdfg(strict=False)
scalars = scalar_to_symbol.find_promotable_scalars(sdfg)
assert scalars == {'i'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_transformations_repeated(isxf.StateFusion)
# SDFG: [empty] --i=0--> [Tasklet->j] --i=j+1--> [j->Tasklet->j, Tasklet->k]
assert sdfg.number_of_nodes() == 3
src_state = sdfg.source_nodes()[0]
sink_state = sdfg.sink_nodes()[0]
middle_state = next(s for s in sdfg.nodes()
if s not in [src_state, sink_state])
assert src_state.number_of_nodes() == 0
assert middle_state.number_of_nodes() == 2
assert sink_state.number_of_nodes() == 5
def test_promote_copy():
""" Promotion that has a connection to an array and to another symbol. """
# Create SDFG
sdfg = dace.SDFG('testprog')
sdfg.add_array('A', [20, 20], dace.float64)
sdfg.add_transient('i', [1], dace.int32)
sdfg.add_transient('j', [1], dace.int32)
state = sdfg.add_state()
state.add_edge(state.add_tasklet('seti', {}, {'out'}, 'out = 0'), 'out',
state.add_write('i'), None, dace.Memlet('i'))
state = sdfg.add_state_after(state)
state.add_edge(state.add_tasklet('setj', {}, {'out'}, 'out = 5'), 'out',
state.add_write('j'), None, dace.Memlet('j'))
state = sdfg.add_state_after(state)
state.add_nedge(state.add_read('j'), state.add_write('i'),
dace.Memlet('i'))
state = sdfg.add_state_after(state)
state.add_nedge(state.add_read('i'), state.add_write('A'),
dace.Memlet('A[5, 5]'))
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'i', 'j'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_transformations_repeated(isxf.StateFusion)
# There should be two states:
# [empty] --i=0,j=5--> [empty] --j=i--> [Tasklet->A]
assert sdfg.number_of_nodes() == 3
src_state = sdfg.source_nodes()[0]
sink_state = sdfg.sink_nodes()[0]
middle_state = next(s for s in sdfg.nodes()
if s not in [src_state, sink_state])
assert src_state.number_of_nodes() == 0
assert middle_state.number_of_nodes() == 0
assert sink_state.number_of_nodes() == 2
# Program should produce correct result
A = np.random.rand(20, 20)
expected = np.copy(A)
expected[5, 5] = 5.0
sdfg(A=A)
assert np.allclose(A, expected)
def test_promote_loops():
""" Nested loops. """
N = dace.symbol('N')
@dace.program
def testprog9(A: dace.float32[20, 20]):
i = 0
while i < N:
A += i
for j in range(5):
k = 0
while k < N / 2:
A += k
k += 1
i += 2
sdfg: dace.SDFG = testprog9.to_sdfg(simplify=False)
scalars = scalar_to_symbol.find_promotable_scalars(sdfg)
assert 'i' in scalars
assert 'k' in scalars
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.simplify()
def parse_from_function(function, *compilation_args, strict=None, save=True):
"""
Try to parse a DaceProgram object and return the `dace.SDFG` object
that corresponds to it.
:param function: DaceProgram object (obtained from the ``@dace.program``
decorator).
:param compilation_args: Various compilation arguments e.g. dtypes.
:param strict: Whether to apply strict transformations or not (None
uses configuration-defined value).
:param save: If True, saves the generated SDFG to
``_dacegraphs/program.sdfg`` after parsing.
:return: The generated SDFG object.
"""
# Avoid import loop
from dace.sdfg.analysis import scalar_to_symbol as scal2sym
from dace.transformation import helpers as xfh
if not isinstance(function, DaceProgram):
raise TypeError(
'Function must be of type dace.frontend.python.DaceProgram')
# Obtain DaCe program as SDFG
sdfg = function.generate_pdp(*compilation_args, strict=strict)
# Apply strict transformations automatically
if (strict == True or (strict is None and Config.get_bool(
'optimizer', 'automatic_strict_transformations'))):
# Promote scalars to symbols as necessary
promoted = scal2sym.promote_scalars_to_symbols(sdfg)
if Config.get_bool('debugprint') and len(promoted) > 0:
print('Promoted scalars {%s} to symbols.' %
', '.join(p for p in sorted(promoted)))
sdfg.apply_strict_transformations()
# Split back edges with assignments and conditions to allow richer
# control flow detection in code generation
xfh.split_interstate_edges(sdfg)
# Save the SDFG (again). Skip this step if running from a cached SDFG, as
# it might overwrite the cached SDFG.
if not Config.get_bool('compiler', 'use_cache') and save:
sdfg.save(os.path.join('_dacegraphs', 'program.sdfg'))
# Validate SDFG
sdfg.validate()
return sdfg
def test_promote_disconnect():
""" Promotion that disconnects tasklet from map. """
@dace.program
def testprog4(A: dace.float64[20, 20]):
j = 5
A[:] = j
sdfg: dace.SDFG = testprog4.to_sdfg(simplify=False)
assert scalar_to_symbol.find_promotable_scalars(sdfg) == {'j'}
scalar_to_symbol.promote_scalars_to_symbols(sdfg)
sdfg.apply_transformations_repeated(isxf.StateFusion)
# There should be two states:
# [empty] --j=5--> [MapEntry->Tasklet->MapExit->A]
assert sdfg.number_of_nodes() == 2
assert sdfg.source_nodes()[0].number_of_nodes() == 0
assert sdfg.sink_nodes()[0].number_of_nodes() == 4
# Program should produce correct result
A = np.random.rand(20, 20)
expected = np.zeros_like(A)
expected[:] = 5
sdfg(A=A)
assert np.allclose(A, expected)
