documentation: (toy) add toy accelerator dialect #1342
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,106 @@ | ||
| // RUN: python -m toy %s --emit=affine --accelerate --ir | filecheck %s | ||
|
|
||
| builtin.module { | ||
| func.func @main() { | ||
| %0 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<3x2xf64> | ||
| %1 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<3x2xf64> | ||
| %2 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<3x2xf64> | ||
| %3 = arith.constant 1.000000e+00 : f64 | ||
| %4 = arith.constant 2.000000e+00 : f64 | ||
| %5 = arith.constant 3.000000e+00 : f64 | ||
| %6 = arith.constant 4.000000e+00 : f64 | ||
| %7 = arith.constant 5.000000e+00 : f64 | ||
| %8 = arith.constant 6.000000e+00 : f64 | ||
| %9 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<2x3xf64> | ||
| %10 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<2x3xf64> | ||
| "affine.store"(%3, %10) {"map" = affine_map<() -> (0, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%4, %10) {"map" = affine_map<() -> (0, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%5, %10) {"map" = affine_map<() -> (0, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%6, %10) {"map" = affine_map<() -> (1, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%7, %10) {"map" = affine_map<() -> (1, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%8, %10) {"map" = affine_map<() -> (1, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%3, %9) {"map" = affine_map<() -> (0, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%4, %9) {"map" = affine_map<() -> (0, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%5, %9) {"map" = affine_map<() -> (0, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%6, %9) {"map" = affine_map<() -> (1, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%7, %9) {"map" = affine_map<() -> (1, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.store"(%8, %9) {"map" = affine_map<() -> (1, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| "affine.for"() ({ | ||
| ^0(%arg0 : index): | ||
| "affine.for"() ({ | ||
| ^1(%arg1 : index): | ||
| %11 = "affine.load"(%9, %arg1, %arg0) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (memref<2x3xf64>, index, index) -> f64 | ||
| "affine.store"(%11, %2, %arg0, %arg1) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (f64, memref<3x2xf64>, index, index) -> () | ||
| "affine.yield"() : () -> () | ||
| }) {"lower_bound" = affine_map<() -> (0)>, "step" = 1 : index, "upper_bound" = affine_map<() -> (2)>} : () -> () | ||
| "affine.yield"() : () -> () | ||
| }) {"lower_bound" = affine_map<() -> (0)>, "step" = 1 : index, "upper_bound" = affine_map<() -> (3)>} : () -> () | ||
| "affine.for"() ({ | ||
| ^2(%arg0_1 : index): | ||
| "affine.for"() ({ | ||
| ^3(%arg1_1 : index): | ||
| %12 = "affine.load"(%10, %arg1_1, %arg0_1) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (memref<2x3xf64>, index, index) -> f64 | ||
| "affine.store"(%12, %1, %arg0_1, %arg1_1) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (f64, memref<3x2xf64>, index, index) -> () | ||
| "affine.yield"() : () -> () | ||
| }) {"lower_bound" = affine_map<() -> (0)>, "step" = 1 : index, "upper_bound" = affine_map<() -> (2)>} : () -> () | ||
| "affine.yield"() : () -> () | ||
| }) {"lower_bound" = affine_map<() -> (0)>, "step" = 1 : index, "upper_bound" = affine_map<() -> (3)>} : () -> () | ||
| "affine.for"() ({ | ||
| ^4(%arg0_2 : index): | ||
| "affine.for"() ({ | ||
| ^5(%arg1_2 : index): | ||
| %13 = "affine.load"(%2, %arg0_2, %arg1_2) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (memref<3x2xf64>, index, index) -> f64 | ||
| %14 = "affine.load"(%1, %arg0_2, %arg1_2) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (memref<3x2xf64>, index, index) -> f64 | ||
| %15 = arith.mulf %13, %14 : f64 | ||
| "affine.store"(%15, %0, %arg0_2, %arg1_2) {"map" = affine_map<(d0, d1) -> (d0, d1)>} : (f64, memref<3x2xf64>, index, index) -> () | ||
| "affine.yield"() : () -> () | ||
| }) {"lower_bound" = affine_map<() -> (0)>, "step" = 1 : index, "upper_bound" = affine_map<() -> (2)>} : () -> () | ||
| "affine.yield"() : () -> () | ||
| }) {"lower_bound" = affine_map<() -> (0)>, "step" = 1 : index, "upper_bound" = affine_map<() -> (3)>} : () -> () | ||
| printf.print_format "{}", %0 : memref<3x2xf64> | ||
| "memref.dealloc"(%10) : (memref<2x3xf64>) -> () | ||
| "memref.dealloc"(%9) : (memref<2x3xf64>) -> () | ||
| "memref.dealloc"(%2) : (memref<3x2xf64>) -> () | ||
| "memref.dealloc"(%1) : (memref<3x2xf64>) -> () | ||
| "memref.dealloc"(%0) : (memref<3x2xf64>) -> () | ||
| func.return | ||
| } | ||
| } | ||
|
|
||
| // CHECK: builtin.module { | ||
| // CHECK-NEXT: func.func @main() { | ||
| // CHECK-NEXT: %0 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<3x2xf64> | ||
| // CHECK-NEXT: %1 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<3x2xf64> | ||
| // CHECK-NEXT: %2 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<3x2xf64> | ||
| // CHECK-NEXT: %3 = arith.constant 1.000000e+00 : f64 | ||
| // CHECK-NEXT: %4 = arith.constant 2.000000e+00 : f64 | ||
| // CHECK-NEXT: %5 = arith.constant 3.000000e+00 : f64 | ||
| // CHECK-NEXT: %6 = arith.constant 4.000000e+00 : f64 | ||
| // CHECK-NEXT: %7 = arith.constant 5.000000e+00 : f64 | ||
| // CHECK-NEXT: %8 = arith.constant 6.000000e+00 : f64 | ||
| // CHECK-NEXT: %9 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<2x3xf64> | ||
| // CHECK-NEXT: %10 = "memref.alloc"() {"operand_segment_sizes" = array<i32: 0, 0>} : () -> memref<2x3xf64> | ||
| // CHECK-NEXT: "affine.store"(%3, %10) {"map" = affine_map<() -> (0, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%4, %10) {"map" = affine_map<() -> (0, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%5, %10) {"map" = affine_map<() -> (0, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%6, %10) {"map" = affine_map<() -> (1, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%7, %10) {"map" = affine_map<() -> (1, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%8, %10) {"map" = affine_map<() -> (1, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%3, %9) {"map" = affine_map<() -> (0, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%4, %9) {"map" = affine_map<() -> (0, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%5, %9) {"map" = affine_map<() -> (0, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%6, %9) {"map" = affine_map<() -> (1, 0)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%7, %9) {"map" = affine_map<() -> (1, 1)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "affine.store"(%8, %9) {"map" = affine_map<() -> (1, 2)>} : (f64, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "toy_accelerator.transpose"(%2, %9) {"source_rows" = 2 : index, "source_cols" = 3 : index} : (memref<3x2xf64>, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "toy_accelerator.transpose"(%1, %10) {"source_rows" = 2 : index, "source_cols" = 3 : index} : (memref<3x2xf64>, memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "toy_accelerator.mul"(%0, %2, %1) : (memref<3x2xf64>, memref<3x2xf64>, memref<3x2xf64>) -> () | ||
| // CHECK-NEXT: printf.print_format "{}", %0 : memref<3x2xf64> | ||
| // CHECK-NEXT: "memref.dealloc"(%10) : (memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "memref.dealloc"(%9) : (memref<2x3xf64>) -> () | ||
| // CHECK-NEXT: "memref.dealloc"(%2) : (memref<3x2xf64>) -> () | ||
| // CHECK-NEXT: "memref.dealloc"(%1) : (memref<3x2xf64>) -> () | ||
| // CHECK-NEXT: "memref.dealloc"(%0) : (memref<3x2xf64>) -> () | ||
| // CHECK-NEXT: func.return | ||
| // CHECK-NEXT: } | ||
| // CHECK-NEXT: } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,104 @@ | ||
| from __future__ import annotations | ||
|
|
||
| import abc | ||
| from typing import Annotated | ||
|
|
||
| from xdsl.dialects.builtin import AnyIntegerAttr, ArrayAttr | ||
| from xdsl.dialects.memref import MemRefType | ||
| from xdsl.ir import Attribute, Dialect, Operation, SSAValue | ||
| from xdsl.irdl import ( | ||
| ConstraintVar, | ||
| IRDLOperation, | ||
| attr_def, | ||
| irdl_op_definition, | ||
| operand_def, | ||
| ) | ||
| from xdsl.utils.exceptions import VerifyException | ||
|
|
||
|
|
||
| @irdl_op_definition | ||
| class Transpose(IRDLOperation): | ||
| name = "toy_accelerator.transpose" | ||
|
|
||
| destination = operand_def(MemRefType) | ||
| source = operand_def(MemRefType) | ||
|
|
||
| source_rows = attr_def(AnyIntegerAttr) | ||
| source_cols = attr_def(AnyIntegerAttr) | ||
|
|
||
| def __init__( | ||
| self, | ||
| destination: SSAValue | Operation, | ||
| input: SSAValue | Operation, | ||
| source_rows: AnyIntegerAttr, | ||
| source_cols: AnyIntegerAttr, | ||
| ): | ||
| super().__init__( | ||
| operands=(destination, input), | ||
| attributes={ | ||
| "source_rows": source_rows, | ||
| "source_cols": source_cols, | ||
| }, | ||
| ) | ||
|
|
||
| def verify_(self) -> None: | ||
| if not isinstance(self.source.type, MemRefType): | ||
| raise VerifyException( | ||
| f"Invalid transpose source type {self.source.type}, expected MemRefType" | ||
| ) | ||
| if not isinstance(self.destination.type, MemRefType): | ||
| raise VerifyException( | ||
| f"Invalid transpose destination type {self.destination.type}, expected MemRefType" | ||
| ) | ||
|
|
||
| expected_source_shape = ArrayAttr((self.source_rows, self.source_cols)) | ||
| source_shape = self.source.type.shape | ||
|
|
||
| if source_shape != expected_source_shape: | ||
| raise VerifyException(f"Transpose source shape mismatch") | ||
|
|
||
| expected_destination_shape = ArrayAttr((self.source_cols, self.source_rows)) | ||
| destination_shape = self.destination.type.shape | ||
|
|
||
| if destination_shape != expected_destination_shape: | ||
| raise VerifyException(f"Transpose source shape mismatch") | ||
|
|
||
|
|
||
| class BinOp(IRDLOperation, abc.ABC): | ||
| """ | ||
| An in-place mutating binary operation. | ||
| """ | ||
|
|
||
| T = Annotated[MemRefType[Attribute], ConstraintVar("T")] | ||
|
|
||
| dest = operand_def(T) | ||
| lhs = operand_def(T) | ||
| rhs = operand_def(T) | ||
|
|
||
| def __init__( | ||
| self, | ||
| dest: SSAValue | Operation, | ||
| lhs: SSAValue | Operation, | ||
| rhs: SSAValue | Operation, | ||
| ): | ||
| super().__init__(operands=(dest, lhs, rhs)) | ||
|
|
||
|
|
||
| @irdl_op_definition | ||
| class Add(BinOp): | ||
| name = "toy_accelerator.add" | ||
|
|
||
|
|
||
| @irdl_op_definition | ||
| class Mul(BinOp): | ||
| name = "toy_accelerator.mul" | ||
|
|
||
|
|
||
| ToyAccelerator = Dialect( | ||
| [ | ||
| Transpose, | ||
| Add, | ||
| Mul, | ||
| ], | ||
| [], | ||
| ) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,51 @@ | ||
| from __future__ import annotations | ||
|
|
||
| from typing import Any | ||
|
|
||
| from xdsl.interpreter import Interpreter, InterpreterFunctions, impl, register_impls | ||
|
|
||
| from ..dialects import toy_accelerator | ||
|
|
||
|
|
||
| @register_impls | ||
| class ToyAcceleratorFunctions(InterpreterFunctions): | ||
| @impl(toy_accelerator.Transpose) | ||
| def run_transpose( | ||
| self, | ||
| interpreter: Interpreter, | ||
| op: toy_accelerator.Transpose, | ||
| args: tuple[Any, ...], | ||
| ) -> tuple[Any, ...]: | ||
| dest, source = args | ||
|
|
||
| source_rows = op.source_rows.value.data | ||
| source_cols = op.source_cols.value.data | ||
|
|
||
| for row in range(source_rows): | ||
| for col in range(source_cols): | ||
| value = source.load((row, col)) | ||
| dest.store((col, row), value) | ||
|
|
||
| return () | ||
|
|
||
| @impl(toy_accelerator.Add) | ||
| def run_add( | ||
| self, interpreter: Interpreter, op: toy_accelerator.Add, args: tuple[Any, ...] | ||
| ) -> tuple[Any, ...]: | ||
| dest, lhs, rhs = args | ||
|
|
||
| for i, (l, r) in enumerate(zip(lhs.data, rhs.data)): | ||
| dest.data[i] = l + r | ||
|
|
||
| return () | ||
|
|
||
| @impl(toy_accelerator.Mul) | ||
| def run_mul( | ||
| self, interpreter: Interpreter, op: toy_accelerator.Mul, args: tuple[Any, ...] | ||
| ) -> tuple[Any, ...]: | ||
| dest, lhs, rhs = args | ||
|
|
||
| for i, (l, r) in enumerate(zip(lhs.data, rhs.data)): | ||
| dest.data[i] = l * r | ||
|
|
||
| return () |
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Did you check that this run? I'm not sure if things run if they are not in the first lines.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Added an assert False, seems to work ok