This is an archive of the discontinued LLVM Phabricator instance.

Show First 20 Lines • Show All 191 Lines • ▼ Show 20 Lines	with ir.Context() as ctx, ir.Location.unknown():
sparsification_options = (		sparsification_options = (
f'parallelization-strategy=none '		f'parallelization-strategy=none '
f's2s-strategy={s2s}')		f's2s-strategy={s2s}')
compiler = sparse_compiler.SparseCompiler(		compiler = sparse_compiler.SparseCompiler(
options=sparsification_options, opt_level=0, shared_libs=[support_lib])		options=sparsification_options, opt_level=0, shared_libs=[support_lib])
f64 = ir.F64Type.get()		f64 = ir.F64Type.get()
# Be careful about increasing this because		# Be careful about increasing this because
# len(types) = 1 + len(level_choices)^rank * rank! * len(bitwidths)^2		# len(types) = 1 + len(level_choices)^rank * rank! * len(bitwidths)^2
shape = range(2, 6)		shape = range(2, 3)
rank = len(shape)		rank = len(shape)
# All combinations.		# All combinations.
# TODO: add singleton here too; which requires updating how `np_arg0`		# TODO: add singleton here too; which requires updating how `np_arg0`
# is initialized below.		# is initialized below.
levels = list(itertools.product(*itertools.repeat(		levels = list(itertools.product(*itertools.repeat(
[st.DimLevelType.dense, st.DimLevelType.compressed], rank)))		[st.DimLevelType.dense, st.DimLevelType.compressed], rank)))
# All permutations.		# All permutations.
orderings = list(map(ir.AffineMap.get_permutation,		orderings = list(map(ir.AffineMap.get_permutation,
Show All 35 Lines

[mlir][sparse] reduce the input size in stress_test.py to make it finish in time.ClosedPublic