Compare commits
33 Commits
main
...
013ae0ac2a
| Author | SHA1 | Date | |
|---|---|---|---|
| 013ae0ac2a | |||
| c6b02af7a9 | |||
| d2048bd394 | |||
| 158f0f0c54 | |||
| 532cac8246 | |||
| d609e84054 | |||
| addfc8a86e | |||
| 0f240af271 | |||
| bdc4ca33f3 | |||
| b79c333c6c | |||
| eea9261c7b | |||
| e8a08f6dd0 | |||
| 4855a2e105 | |||
| 3a7a832198 | |||
| 48ca6bd28d | |||
| f595cc6ffd | |||
| c734f1b37e | |||
| b79ce8eeaa | |||
| 76a37e198f | |||
| 7f3c7464b4 | |||
| c77ffa9c56 | |||
| 495186503c | |||
| 2c1da813b5 | |||
| 8337a11ce9 | |||
| d136136d22 | |||
| 074eb183c7 | |||
| 43ed3914b8 | |||
| 6aaf1c0870 | |||
| fe35b3ed43 | |||
| 90a9339686 | |||
| a50e77ff38 | |||
| f56c4159b5 | |||
| a103ba328b |
+2
-5
@@ -4,14 +4,11 @@
|
|||||||
|
|
||||||
.claude
|
.claude
|
||||||
.codex
|
.codex
|
||||||
AGENTS.md
|
|
||||||
|
|
||||||
CMakeUserPresets.json
|
CMakeUserPresets.json
|
||||||
|
|
||||||
build
|
build_*
|
||||||
build_release
|
|
||||||
cmake-build-debug
|
|
||||||
cmake-build-release
|
|
||||||
compile.sh
|
compile.sh
|
||||||
|
pimcomp_utils/*
|
||||||
|
|
||||||
**/__*
|
**/__*
|
||||||
|
|||||||
@@ -0,0 +1,91 @@
|
|||||||
|
- Always read the full README.md before doing anything.
|
||||||
|
- Build commands:
|
||||||
|
- `cmake --build ./build_release`
|
||||||
|
- `cmake --build ./build_debug`
|
||||||
|
- Never use `ninja` directly: it bypasses cmake's configuration and invalidates the build cache.
|
||||||
|
|
||||||
|
# Code changes
|
||||||
|
|
||||||
|
- Keep changes minimal and localized to the relevant parts of the code.
|
||||||
|
- Preserve the existing naming conventions and coding style used in the surrounding code.
|
||||||
|
- Keep code easy to read, well organized, and suitable for future extensibility. A function must not be longer than
|
||||||
|
200/250 lines for readability and cognitive complexity.
|
||||||
|
- Prefer clear naming and structure over comments. Add comments only when they materially improve clarity.
|
||||||
|
- Do not rename symbols, move files, or restructure modules unless that is necessary for the requested change.
|
||||||
|
|
||||||
|
# Working style
|
||||||
|
|
||||||
|
- Infer style and conventions from the existing code before introducing new patterns.
|
||||||
|
- When several implementation options are possible, prefer the simplest one that fits the current architecture and
|
||||||
|
minimizes churn.
|
||||||
|
- Avoid broad refactors unless I explicitly ask for them.
|
||||||
|
|
||||||
|
# Responses
|
||||||
|
|
||||||
|
- When showing code in chat, make it easy to copy-paste into the codebase.
|
||||||
|
- Keep outputs focused on the changed parts.
|
||||||
|
- At the end of the response, briefly list any bad practices, mistakes, or cleaner alternatives you noticed, separate
|
||||||
|
from the main solution.
|
||||||
|
|
||||||
|
# Guidelines
|
||||||
|
|
||||||
|
## 1. Think Before Coding
|
||||||
|
|
||||||
|
**Don't assume. Don't hide confusion. Surface tradeoffs.**
|
||||||
|
|
||||||
|
Before implementing:
|
||||||
|
|
||||||
|
- State your assumptions explicitly. If uncertain, ask.
|
||||||
|
- If multiple interpretations exist, present them - don't pick silently.
|
||||||
|
- If a simpler approach exists, say so. Push back when warranted.
|
||||||
|
- If something is unclear, stop. Name what's confusing. Ask.
|
||||||
|
|
||||||
|
## 2. Simplicity First
|
||||||
|
|
||||||
|
**Minimum code that solves the problem. Nothing speculative.**
|
||||||
|
|
||||||
|
- No features beyond what was asked.
|
||||||
|
- No error handling for impossible scenarios.
|
||||||
|
- If you write 200 lines and it could be 50, rewrite it.
|
||||||
|
|
||||||
|
Ask yourself: "Would a senior engineer say this is overcomplicated?" If yes, simplify.
|
||||||
|
|
||||||
|
## 3. Surgical Changes
|
||||||
|
|
||||||
|
**Touch only what you must. Clean up only your own mess.**
|
||||||
|
|
||||||
|
When editing existing code:
|
||||||
|
|
||||||
|
- Don't "improve" adjacent code, comments, or formatting.
|
||||||
|
- Don't refactor things that aren't broken.
|
||||||
|
- Match existing style, even if you'd do it differently.
|
||||||
|
- If you notice unrelated dead code, mention it - don't delete it.
|
||||||
|
|
||||||
|
When your changes create orphans:
|
||||||
|
|
||||||
|
- Remove imports/variables/functions that YOUR changes made unused.
|
||||||
|
- Don't remove pre-existing dead code unless asked, but mention it.
|
||||||
|
|
||||||
|
The test: Every changed line should trace directly to the user's request.
|
||||||
|
|
||||||
|
## 4. Goal-Driven Execution
|
||||||
|
|
||||||
|
**Define success criteria. Loop until verified.**
|
||||||
|
|
||||||
|
Transform tasks into verifiable goals:
|
||||||
|
|
||||||
|
- "Add validation" → "Write tests for invalid inputs, then make them pass"
|
||||||
|
- "Fix the bug" → "Write a test that reproduces it, then make it pass"
|
||||||
|
- "Refactor X" → "Ensure tests pass before and after"
|
||||||
|
|
||||||
|
For multi-step tasks, state a brief plan:
|
||||||
|
|
||||||
|
```
|
||||||
|
1. [Step] → verify: [check]
|
||||||
|
2. [Step] → verify: [check]
|
||||||
|
3. [Step] → verify: [check]
|
||||||
|
```
|
||||||
|
|
||||||
|
Strong success criteria let you loop independently. Weak criteria ("make it work") require constant clarification.
|
||||||
|
|
||||||
|
---
|
||||||
+92
-24
@@ -3,31 +3,99 @@ cmake_minimum_required(VERSION 3.20.0)
|
|||||||
|
|
||||||
project(raptor)
|
project(raptor)
|
||||||
|
|
||||||
# Add symlink to PIM as accelerator in onnx-mlir
|
# Materialize a CMake shim directory
|
||||||
function(raptor_ensure_symlink link_path target_path)
|
function(raptor_write_external_cmake_shim shim_dir external_source_dir description)
|
||||||
get_filename_component(link_parent "${link_path}" DIRECTORY)
|
get_filename_component(real_external_source_dir "${external_source_dir}" REALPATH)
|
||||||
|
file(RELATIVE_PATH relative_external_source_dir "${shim_dir}" "${real_external_source_dir}")
|
||||||
|
|
||||||
if(NOT EXISTS "${link_parent}")
|
if (NOT EXISTS "${real_external_source_dir}/CMakeLists.txt")
|
||||||
message(FATAL_ERROR "Directory not found: ${link_parent}")
|
message(FATAL_ERROR
|
||||||
endif()
|
"External CMake source directory not found or missing CMakeLists.txt:\n"
|
||||||
|
" ${real_external_source_dir}"
|
||||||
if(NOT EXISTS "${link_path}")
|
|
||||||
message(STATUS "Creating symlink ${link_path} -> ${target_path}")
|
|
||||||
file(CREATE_LINK
|
|
||||||
"${target_path}"
|
|
||||||
"${link_path}"
|
|
||||||
SYMBOLIC
|
|
||||||
)
|
)
|
||||||
endif()
|
endif ()
|
||||||
|
|
||||||
|
if (IS_SYMLINK "${shim_dir}")
|
||||||
|
message(STATUS "Removing old full-directory symlink: ${shim_dir}")
|
||||||
|
file(REMOVE "${shim_dir}")
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
if (EXISTS "${shim_dir}" AND NOT IS_DIRECTORY "${shim_dir}")
|
||||||
|
message(FATAL_ERROR "Expected directory or absent path, got file: ${shim_dir}")
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
file(MAKE_DIRECTORY "${shim_dir}")
|
||||||
|
|
||||||
|
set(shim_file "${shim_dir}/CMakeLists.txt")
|
||||||
|
set(shim_contents
|
||||||
|
"get_filename_component(raptor_external_source_dir
|
||||||
|
\"\${CMAKE_CURRENT_LIST_DIR}/${relative_external_source_dir}\"
|
||||||
|
REALPATH
|
||||||
|
)
|
||||||
|
add_subdirectory(
|
||||||
|
\"\${raptor_external_source_dir}\"
|
||||||
|
\"\${CMAKE_CURRENT_BINARY_DIR}/raptor-external\"
|
||||||
|
)
|
||||||
|
if (DEFINED PIM_ENABLED)
|
||||||
|
set(PIM_ENABLED \"\${PIM_ENABLED}\" PARENT_SCOPE)
|
||||||
|
endif ()
|
||||||
|
"
|
||||||
|
)
|
||||||
|
|
||||||
|
if (EXISTS "${shim_file}")
|
||||||
|
file(READ "${shim_file}" old_contents)
|
||||||
|
else ()
|
||||||
|
set(old_contents "")
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
if (NOT old_contents STREQUAL shim_contents)
|
||||||
|
file(WRITE "${shim_file}" "${shim_contents}")
|
||||||
|
message(STATUS "Wrote CMake shim for ${description}: ${shim_file}")
|
||||||
|
else ()
|
||||||
|
message(STATUS "CMake shim already up to date for ${description}")
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
# Mirror the external tree's first-level entries into the shim directory
|
||||||
|
# so legacy includes like src/Accelerators/PIM/Compiler/... keep working.
|
||||||
|
file(GLOB children RELATIVE "${real_external_source_dir}" "${real_external_source_dir}/*")
|
||||||
|
|
||||||
|
foreach (child IN LISTS children)
|
||||||
|
if (child STREQUAL "CMakeLists.txt")
|
||||||
|
continue()
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
set(real_child "${real_external_source_dir}/${child}")
|
||||||
|
set(shim_child "${shim_dir}/${child}")
|
||||||
|
|
||||||
|
if (IS_SYMLINK "${shim_child}")
|
||||||
|
file(READ_SYMLINK "${shim_child}" existing_link_target)
|
||||||
|
if (existing_link_target STREQUAL real_child)
|
||||||
|
continue()
|
||||||
|
endif ()
|
||||||
|
file(REMOVE_RECURSE "${shim_child}")
|
||||||
|
elseif (EXISTS "${shim_child}")
|
||||||
|
# Do not delete real files/directories. This protects the generated shim.
|
||||||
|
continue()
|
||||||
|
endif ()
|
||||||
|
|
||||||
|
file(CREATE_LINK
|
||||||
|
"${real_child}"
|
||||||
|
"${shim_child}"
|
||||||
|
SYMBOLIC
|
||||||
|
)
|
||||||
|
endforeach ()
|
||||||
endfunction()
|
endfunction()
|
||||||
|
|
||||||
raptor_ensure_symlink(
|
raptor_write_external_cmake_shim(
|
||||||
"${CMAKE_CURRENT_SOURCE_DIR}/onnx-mlir/src/Accelerators/PIM"
|
"${CMAKE_CURRENT_SOURCE_DIR}/onnx-mlir/src/Accelerators/PIM"
|
||||||
"${CMAKE_CURRENT_SOURCE_DIR}/src/PIM"
|
"${CMAKE_CURRENT_SOURCE_DIR}/src/PIM"
|
||||||
|
"PIM accelerator"
|
||||||
)
|
)
|
||||||
raptor_ensure_symlink(
|
|
||||||
"${CMAKE_CURRENT_SOURCE_DIR}/onnx-mlir/test/accelerators/PIM"
|
raptor_write_external_cmake_shim(
|
||||||
"${CMAKE_CURRENT_SOURCE_DIR}/test/PIM"
|
"${CMAKE_CURRENT_SOURCE_DIR}/onnx-mlir/test/accelerators/PIM"
|
||||||
|
"${CMAKE_CURRENT_SOURCE_DIR}/test/PIM"
|
||||||
|
"PIM accelerator tests"
|
||||||
)
|
)
|
||||||
|
|
||||||
# Patch onnx-mlir sources for PIM accelerator support.
|
# Patch onnx-mlir sources for PIM accelerator support.
|
||||||
@@ -38,21 +106,21 @@ function(raptor_apply_patch file_path anchor replacement description)
|
|||||||
|
|
||||||
# Already applied – replacement text is present
|
# Already applied – replacement text is present
|
||||||
string(FIND "${contents}" "${replacement}" already_applied_pos)
|
string(FIND "${contents}" "${replacement}" already_applied_pos)
|
||||||
if(NOT already_applied_pos EQUAL -1)
|
if (NOT already_applied_pos EQUAL -1)
|
||||||
message(STATUS "Patch already applied: ${description}")
|
message(STATUS "Patch already applied: ${description}")
|
||||||
return()
|
return()
|
||||||
endif()
|
endif ()
|
||||||
|
|
||||||
# Anchor must exist for the patch to be applicable
|
# Anchor must exist for the patch to be applicable
|
||||||
string(FIND "${contents}" "${anchor}" anchor_pos)
|
string(FIND "${contents}" "${anchor}" anchor_pos)
|
||||||
if(anchor_pos EQUAL -1)
|
if (anchor_pos EQUAL -1)
|
||||||
message(FATAL_ERROR
|
message(FATAL_ERROR
|
||||||
"Patch anchor not found – onnx-mlir may have changed.\n"
|
"Patch anchor not found – onnx-mlir may have changed.\n"
|
||||||
" Patch : ${description}\n"
|
" Patch : ${description}\n"
|
||||||
" File : ${file_path}\n"
|
" File : ${file_path}\n"
|
||||||
" Anchor: ${anchor}"
|
" Anchor: ${anchor}"
|
||||||
)
|
)
|
||||||
endif()
|
endif ()
|
||||||
|
|
||||||
string(REPLACE "${anchor}" "${replacement}" patched "${contents}")
|
string(REPLACE "${anchor}" "${replacement}" patched "${contents}")
|
||||||
file(WRITE "${file_path}" "${patched}")
|
file(WRITE "${file_path}" "${patched}")
|
||||||
|
|||||||
@@ -1,226 +1,321 @@
|
|||||||
# Raptor
|
# Raptor
|
||||||
|
|
||||||
Raptor is a domain-specific MLIR compiler for neural networks (ONNX format)
|
Raptor is a domain-specific MLIR compiler for neural networks in ONNX format,
|
||||||
targeting in-memory computing / processing-in-memory (PIM) architectures.
|
targeting in-memory computing / processing-in-memory (PIM) architectures. It
|
||||||
It progressively lowers ONNX-MLIR through a set of MLIR dialects down to
|
extends ONNX-MLIR with a PIM accelerator and progressively lowers ONNX-MLIR
|
||||||
target-specific artifacts (currently JSON code for the `pimsim-nn` simulator).
|
through custom MLIR dialects to simulator artifacts.
|
||||||
|
|
||||||
|
The current target is the PIM simulator stack under `backend-simulators/pim`.
|
||||||
|
Raptor emits binary per-core `.pim` instruction files by default, plus
|
||||||
|
`memory.bin`, `config.json`, and weight binaries. It can also emit per-core JSON
|
||||||
|
instruction files with `--pim-emit-json`.
|
||||||
|
|
||||||
## Overview
|
## Overview
|
||||||
|
|
||||||
PIM architectures perform most of the computation directly in memory.
|
PIM architectures perform most computation directly in memory. The supported
|
||||||
Raptor's first supported target is `pimsim-nn`, which simulates a chip with:
|
target models a chip with:
|
||||||
- a shared host memory,
|
- shared host memory,
|
||||||
- a number of cores that do most of the computation directly in their memory
|
- multiple PIM cores,
|
||||||
(vector ops, vmm/mvm on ReRAM crossbars),
|
- ReRAM crossbars for vector-matrix / matrix-vector work,
|
||||||
- no branching instructions (branchless architecture) and no hardware loop
|
- explicit communication between cores,
|
||||||
support — any repeated work (e.g. convolutions) must be unrolled into
|
- no hardware branch or loop support in emitted simulator code.
|
||||||
explicit per-iteration instructions.
|
|
||||||
|
|
||||||
Because of this, the amount of emitted instructions explodes quickly and the
|
Because repeated work such as convolutions is eventually made explicit, emitted
|
||||||
compiler must optimize aggressively at every stage to keep compilation
|
instruction counts can grow quickly. Most compiler work therefore focuses on
|
||||||
tractable.
|
lowering, scheduling, memory layout, and code-generation optimizations.
|
||||||
|
|
||||||
A second target, `PulPim`, is planned for an accelerator with RISC-V cores
|
|
||||||
each carrying its own in-memory computing unit and crossbars. It will live in
|
|
||||||
a dedicated dialect (future work).
|
|
||||||
|
|
||||||
### Targets and simulators
|
### Targets and simulators
|
||||||
|
|
||||||
`pimsim-nn` (under `backend-simulators/pim/pimsim-nn`) is used for
|
- `backend-simulators/pim/pim-simulator` is the in-tree Rust functional
|
||||||
**performance** estimates (latency, energy), but does not functionally execute
|
simulator used by validation. It reads Raptor's `pim/` artifact directory and
|
||||||
the JSON code it consumes. To validate the numerical correctness of the JSON
|
compares simulator output against native ONNX-MLIR execution.
|
||||||
code produced by Raptor (or, for comparison, by the `pimcomp` compiler), we use
|
- `backend-simulators/pim/pimsim-nn` is the performance simulator submodule.
|
||||||
a Rust simulator we maintain in-tree at
|
The helper scripts in `pimcomp_utils/` are for comparison with PIMCOMP-NN and
|
||||||
`backend-simulators/pim/pim-simulator`.
|
contain local paths; treat them as local utilities, not portable workflows.
|
||||||
|
|
||||||
## Compilation pipeline
|
## Compilation pipeline
|
||||||
|
|
||||||
The PIM-related sources live under `src/PIM` and the tests under `test/PIM`.
|
The PIM sources live under `src/PIM` and tests under `test/PIM`. CMake exposes
|
||||||
When working on this codebase, most changes should stay confined to those
|
them to ONNX-MLIR through generated shim directories under
|
||||||
trees (you only need to look outside, e.g. at `onnx-mlir` or `llvm`, for
|
`onnx-mlir/src/Accelerators/PIM` and `onnx-mlir/test/accelerators/PIM`.
|
||||||
framework-level details).
|
|
||||||
|
|
||||||
High-level lowering flow:
|
High-level lowering flow:
|
||||||
|
|
||||||
```
|
```
|
||||||
ONNX-MLIR ──► Spatial ──► Pim (tensor) ──► Pim (bufferized) ──► PIM JSON
|
ONNX-MLIR -> Spatial -> Pim (tensor) -> Pim (bufferized) -> PIM artifacts
|
||||||
```
|
```
|
||||||
|
|
||||||
1. **ONNX → Spatial** (`src/PIM/Conversion/ONNXToSpatial`).
|
1. **ONNX -> Spatial** (`src/PIM/Conversion/ONNXToSpatial`).
|
||||||
Lowers ONNX ops into the `spat` dialect (`src/PIM/Dialect/Spatial`).
|
Lowers supported ONNX ops into the `spat` dialect
|
||||||
Spatial models a high-level spatial in-memory accelerator: vmm/mvm
|
(`src/PIM/Dialect/Spatial`). Conversion patterns are split by op family under
|
||||||
operations are accelerated by storing a constant RHS matrix into a
|
`Patterns/{Math,NN,Tensor}` and currently cover Conv, Gemm, MatMul,
|
||||||
crossbar. Crossbars cannot be re-programmed during execution, have a
|
elementwise Add/Mul/Div, ReduceMean, pooling, Relu, Sigmoid, Softmax,
|
||||||
limited fixed size, and there is a limited number of them per core.
|
Concat, Gather, Reshape, Resize, and Split.
|
||||||
Conversion patterns are split by op family under
|
|
||||||
`Conversion/ONNXToSpatial/Patterns/{Math,NN,Tensor}` (Conv, Gemm, MatMul,
|
|
||||||
Elementwise, ReduceMean, Pool, Relu, Sigmoid, Softmax, Concat, Gather,
|
|
||||||
Reshape, Resize, Split).
|
|
||||||
|
|
||||||
2. **Spatial → Pim** (`src/PIM/Conversion/SpatialToPim`).
|
2. **Merge compute nodes**
|
||||||
Lowers Spatial to the `pim` dialect (`src/PIM/Dialect/Pim`), which
|
(`src/PIM/Dialect/Spatial/Transforms/MergeComputeNodes`).
|
||||||
materializes PIM cores (`pim.core`), inter-core communication
|
Builds a compute graph, schedules it with the PEFT scheduler, and materializes
|
||||||
(`pim.send` / `pim.receive`), halts, and crossbar-level operations.
|
the merge schedule into Spatial IR. Supporting scheduling code lives under
|
||||||
|
`MergeComputeNodes/Scheduling`.
|
||||||
|
|
||||||
3. **Merge compute nodes** (`src/PIM/Dialect/Spatial/Transforms/MergeComputeNodes`).
|
3. **Spatial -> Pim** (`src/PIM/Conversion/SpatialToPim`).
|
||||||
A DCP-inspired heuristic (Dynamic Critical Path — see the original
|
Lowers Spatial operations to the `pim` dialect (`src/PIM/Dialect/Pim`),
|
||||||
scheduling paper by Kwok & Ahmad,
|
including `pim.core`, `pim.core_batch`, communication, tensor packing, global
|
||||||
[DCP-eScience2007](https://clouds.cis.unimelb.edu.au/papers/DCP-eScience2007.pdf))
|
tensor materialization, and return-path normalization.
|
||||||
that coarsens the virtual node graph and decides how to group compute
|
|
||||||
nodes onto cores. Our implementation is only DCP-*inspired*: it is a
|
|
||||||
heuristic with different assumptions from the paper (different cost
|
|
||||||
model, constraints from crossbar capacity / core resources, and a
|
|
||||||
windowed coarsening loop instead of full-graph reprioritization). The
|
|
||||||
`dcp-critical-window-size` option controls how many lowest-slack virtual
|
|
||||||
nodes each coarsening iteration considers (0 = legacy full-graph
|
|
||||||
analysis). Related sources: `DCPGraph/DCPAnalysis.cpp`, `Graph.cpp/.hpp`,
|
|
||||||
`MergeComputeNodesPass.cpp`.
|
|
||||||
|
|
||||||
4. **Bufferization** (`src/PIM/Dialect/Pim/Transforms/Bufferization`).
|
4. **Bufferization** (`src/PIM/Dialect/Pim/Transforms/Bufferization`).
|
||||||
Converts tensor-semantics PIM IR into memref-semantics PIM IR using the
|
Converts tensor-semantics PIM IR into memref-semantics PIM IR using MLIR's
|
||||||
standard MLIR `BufferizableOpInterface` machinery
|
bufferization interfaces.
|
||||||
(`OpBufferizationInterfaces.*`, `PimBufferization.td`).
|
|
||||||
|
|
||||||
5. **Static memory coalescing** (`src/PIM/Dialect/Pim/Transforms/StaticMemoryCoalescing`).
|
5. **Static memory coalescing**
|
||||||
Conservatively reuses same-typed local memref allocations inside PIM cores
|
(`src/PIM/Dialect/Pim/Transforms/StaticMemoryCoalescing`).
|
||||||
after bufferization and before code generation.
|
Reuses compatible local memref allocations inside PIM cores before codegen.
|
||||||
|
|
||||||
6. **PIM code generation** (`src/PIM/Pass/PimCodegen`):
|
6. **PIM code generation** (`src/PIM/Pass/PimCodegen` and
|
||||||
- `HostConstantFolding` — folds host-side constants.
|
`src/PIM/Compiler`).
|
||||||
- `MaterializeHostConstantsPass` — materializes the remaining host
|
Folds host constants, materializes remaining host constants, verifies PIM IR,
|
||||||
constants for emission.
|
emits `.pim` core files, writes weights, and writes `memory.bin` /
|
||||||
- `VerificationPass` — checks invariants before emission.
|
`config.json`.
|
||||||
- `EmitPimJsonPass` — emits the final PIM JSON consumed by `pimsim-nn`
|
|
||||||
and `pim-simulator`.
|
|
||||||
|
|
||||||
Supporting pieces:
|
Supporting pieces:
|
||||||
- `src/PIM/Compiler` — PIM-specific compiler options (crossbar size/count,
|
- `src/PIM/Common` - shared IR, filesystem, diagnostics, reports, and utility
|
||||||
core count, DCP window, experimental conv impl, concat error handling, …)
|
helpers.
|
||||||
and `PimCodeGen` entry points.
|
- `src/PIM/Compiler` - PIM compiler options, memory/address planning, binary
|
||||||
- `src/PIM/Common` — shared utilities (`PimCommon`, `LabeledList`).
|
instruction format, artifact writing, weight emission, and codegen entry
|
||||||
- `src/PIM/Pass` — auxiliary passes (`MessagePass`, `CountInstructionPass`)
|
points.
|
||||||
and the `PIMPasses.h` registry used by `PimAccelerator`.
|
- `src/PIM/Conversion/SpatialToGraphviz` - optional Spatial graphviz conversion
|
||||||
- `src/PIM/PimAccelerator.{cpp,hpp}` — accelerator entry point: registers
|
pass.
|
||||||
dialects, passes, and plugs Raptor into the ONNX-MLIR driver.
|
- `src/PIM/Pass` - pass registration and auxiliary passes.
|
||||||
|
- `src/PIM/PimAccelerator.{cpp,hpp}` - ONNX-MLIR accelerator entry point.
|
||||||
|
|
||||||
## Key compiler options
|
## Key compiler options
|
||||||
|
|
||||||
Pass these on the `onnx-mlir` command line when compiling for PIM:
|
Pass these to `onnx-mlir` when compiling for PIM:
|
||||||
|
|
||||||
- `--maccel=PIM` — select the PIM accelerator.
|
- `--maccel=PIM` - select the PIM accelerator.
|
||||||
- `--EmitSpatial` / `--EmitPim` / `--EmitPimBufferized` / `--EmitPimCodegen`
|
- `--EmitSpatial`, `--EmitPim`, `--EmitPimBufferized`,
|
||||||
— stop the pipeline at the requested stage (default: `EmitPimCodegen`).
|
`--EmitPimCodegen` - stop the PIM pipeline at the requested stage. The PIM
|
||||||
- `--pim-only-codegen` — assume the input is already bufferized PIM IR and
|
default is `--EmitPimCodegen`.
|
||||||
run only the codegen tail.
|
- `--core-count=<N>` - required positive core count for PIM compilation.
|
||||||
- `--crossbar-size=<N>` / `--crossbar-count=<N>` — crossbar dimensions and
|
- `--crossbar-size=<N>` - crossbar width/height. Default in code is `2`.
|
||||||
per-core count.
|
- `--crossbar-count=<N>` - crossbars per core. Default in code is `256`.
|
||||||
- `--core-count=<N>` — number of cores. Required for PIM compilation.
|
- `--pim-merge-scheduler=peft` - merge scheduler. `peft` is the only accepted
|
||||||
- `--pim-merge-scheduler={peft,dcp}` — scheduler used by the Spatial
|
value in the current code.
|
||||||
merge-compute-nodes pass (default: `peft`).
|
- `--pim-only-codegen` - assume input is already bufferized PIM IR and only run
|
||||||
- `--dcp-critical-window-size=<N>` — DCP coarsening window (0 = legacy).
|
the codegen tail.
|
||||||
- `--use-experimental-conv-impl` — alternative convolution lowering.
|
- `--pim-emit-json` - also emit `core_*.json` instruction files alongside
|
||||||
- `--ignore-concat-error` — soft-fail corner case in `ConcatOp`.
|
`core_*.pim`.
|
||||||
|
- `--use-experimental-conv-impl` - use the alternate convolution lowering.
|
||||||
|
- `--ignore-concat-error` - soft-fail a ConcatOp corner case.
|
||||||
|
|
||||||
|
Example:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
./build_release/Release/bin/onnx-mlir model.onnx -o /tmp/raptor/model \
|
||||||
|
--maccel=PIM --EmitPimCodegen \
|
||||||
|
--crossbar-size=2048 --crossbar-count=256 --core-count=1000
|
||||||
|
```
|
||||||
|
|
||||||
|
This writes PIM artifacts under `/tmp/raptor/pim/`.
|
||||||
|
|
||||||
## Validation
|
## Validation
|
||||||
|
|
||||||
Functional validation lives in `validation/` and drives the Rust
|
Functional validation lives in `validation/`. It compiles ONNX models, builds a
|
||||||
`pim-simulator` to compare Raptor's output against a reference.
|
native ONNX-MLIR reference runner, generates random inputs, runs Raptor, runs
|
||||||
|
the Rust PIM simulator, and compares outputs.
|
||||||
|
|
||||||
Per-operation validation (from `validation/`):
|
Python dependencies used by the validation scripts are `numpy`, `onnx`, and
|
||||||
|
`colorama`. The simulator requires the Rust toolchain.
|
||||||
|
|
||||||
```
|
Per-operation validation from the repository root:
|
||||||
validate.py \
|
|
||||||
--raptor-path ../cmake-build-release/Release/bin/onnx-mlir \
|
```bash
|
||||||
--onnx-include-dir ../onnx-mlir/include \
|
python3 validation/validate.py \
|
||||||
--core-count 1000
|
--raptor-path build_release/Release/bin/onnx-mlir \
|
||||||
|
--onnx-include-dir onnx-mlir/include \
|
||||||
|
--core-count 1000
|
||||||
```
|
```
|
||||||
|
|
||||||
End-to-end network validation (example: first 4 layers of YOLOv11n):
|
Validate one network or a subset by pointing `--operations-dir` at any directory
|
||||||
|
containing `.onnx` files:
|
||||||
|
|
||||||
```
|
```bash
|
||||||
validate.py \
|
python3 validation/validate.py \
|
||||||
--raptor-path ../cmake-build-release/Release/bin/onnx-mlir \
|
--raptor-path build_release/Release/bin/onnx-mlir \
|
||||||
--onnx-include-dir ../onnx-mlir/include \
|
--onnx-include-dir onnx-mlir/include \
|
||||||
--operations-dir ./networks/yolo11n/depth_04 \
|
--operations-dir validation/networks/yolo11n/depth_04 \
|
||||||
--crossbar-size 2048 --crossbar-count 256 --core-count 1000
|
--crossbar-size 2048 --crossbar-count 256 --core-count 1000
|
||||||
```
|
```
|
||||||
|
|
||||||
Available networks under `validation/networks/`: `vgg16`, `yolo11n`.
|
Useful validation options:
|
||||||
Available operations under `validation/operations/`: `add`, `conv`, `div`,
|
- `--simulator-dir <path>` - override the auto-detected
|
||||||
`gather`, `gemm`, `gemv`, `mul`, `pool`, `reduce_mean`, `relu`, `resize`,
|
`backend-simulators/pim/pim-simulator` path.
|
||||||
`sigmoid`, `softmax`, `split`.
|
- `--threshold <float>` - maximum allowed per-element output difference.
|
||||||
|
- `--seed <int>` - RNG seed for generated inputs.
|
||||||
|
- `--command-timeout-seconds <float>` - timeout for compiler, runner, and
|
||||||
|
simulator subprocesses.
|
||||||
|
- `--verbose` - print subprocess logs and average PIM pass timings.
|
||||||
|
- `--clean` - remove generated validation artifacts and exit.
|
||||||
|
|
||||||
## Rebuilding
|
Each validation run writes artifacts in the model workspace, for example under
|
||||||
|
`validation/operations/gemm/small/`:
|
||||||
|
- `inputs/` - generated input CSV files.
|
||||||
|
- `outputs/` - native ONNX-MLIR reference outputs.
|
||||||
|
- `raptor/` - compiler artifacts, including `*.onnx.mlir`, dialect dumps under
|
||||||
|
`dialects/`, reports under `reports/`, and final PIM artifacts under `pim/`.
|
||||||
|
- `runner/` - generated reference runner source, build tree, and shared library.
|
||||||
|
- `simulation/out.bin` - raw simulator output used for comparison.
|
||||||
|
|
||||||
Release build (fast):
|
The compiler currently dumps dialect snapshots such as `spatial0.mlir`,
|
||||||
|
`spatial1_dcp_merged.mlir`, `pim0.mlir`, `pim1_buff.mlir`,
|
||||||
|
`pim2_coalesced.mlir`, `pim3_folded.mlir`, and
|
||||||
|
`pim4_materialized.mlir` when an output directory is available.
|
||||||
|
|
||||||
```
|
To rerun the simulator manually with tracing after validation has produced a
|
||||||
cmake --build /home/nico/raptor/raptor/cmake-build-release --target onnx-mlir -j 30
|
`raptor/pim/` directory:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
cd backend-simulators/pim/pim-simulator
|
||||||
|
cargo run --no-default-features --features tracing --release \
|
||||||
|
--package pim-simulator --bin pim-simulator -- \
|
||||||
|
-f /path/to/workspace/raptor/pim \
|
||||||
|
-o /path/to/workspace/simulation/out.bin \
|
||||||
|
-d <addr0>,<size0>,<addr1>,<size1>,...
|
||||||
```
|
```
|
||||||
|
|
||||||
A slower debug build is also available — configure it the same way but with
|
With `--features tracing`, the simulator writes per-core traces as
|
||||||
`-DCMAKE_BUILD_TYPE=Debug` (see installation instructions below).
|
`TraceCore0`, `TraceCore1`, ... next to `out.bin`. The validator normally
|
||||||
|
computes the `-d` ranges from `raptor/pim/config.json` and model output shapes.
|
||||||
|
|
||||||
|
Available validation networks under `validation/networks/`: `vgg16`,
|
||||||
|
`yolo11n`, `yolo11nv2`.
|
||||||
|
|
||||||
|
Available operation suites under `validation/operations/`: `add`, `concat`,
|
||||||
|
`conv`, `div`, `gather`, `gemm`, `gemv`, `matmul`, `mul`, `pool`,
|
||||||
|
`reduce_mean`, `relu`, `reshape`, `resize`, `sigmoid`, `softmax`, `split`.
|
||||||
|
|
||||||
|
Generated operation tests can be regenerated with:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
python3 validation/operations/gen_tests.py
|
||||||
|
```
|
||||||
|
|
||||||
## Build
|
## Build
|
||||||
|
|
||||||
|
Initialize submodules first:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
git submodule update --init --recursive
|
||||||
|
```
|
||||||
|
|
||||||
|
The project follows ONNX-MLIR's build requirements. The CI workflow documents
|
||||||
|
the currently used versions and setup:
|
||||||
|
- CMake 4.3.0 in CI,
|
||||||
|
- LLVM/MLIR checked out under `onnx-mlir/llvm-project`,
|
||||||
|
- Protobuf `v34.0`,
|
||||||
|
- Rust stable for `pim-simulator`,
|
||||||
|
- Python packages `numpy`, `onnx`, `colorama` for validation.
|
||||||
|
|
||||||
### Protobuf
|
### Protobuf
|
||||||
|
|
||||||
Use the following commands to install protobuf:
|
Install Protobuf if your system does not already provide a compatible version:
|
||||||
```
|
|
||||||
|
```bash
|
||||||
git clone --depth 1 --branch v34.0 https://github.com/protocolbuffers/protobuf
|
git clone --depth 1 --branch v34.0 https://github.com/protocolbuffers/protobuf
|
||||||
cd protobuf
|
cmake -S protobuf -B protobuf/build -G Ninja \
|
||||||
mkdir build
|
-DCMAKE_BUILD_TYPE=Release \
|
||||||
cd build
|
-Dprotobuf_BUILD_TESTS=OFF
|
||||||
cmake .. -G Ninja -DCMAKE_BUILD_TYPE=Release
|
cmake --build protobuf/build
|
||||||
ninja
|
sudo cmake --install protobuf/build
|
||||||
sudo ninja install
|
|
||||||
```
|
```
|
||||||
|
|
||||||
You can now remove the protobuf repo directory with:
|
You can then remove the temporary checkout:
|
||||||
```
|
|
||||||
cd ../..
|
```bash
|
||||||
rm -rf protobuf
|
rm -rf protobuf
|
||||||
```
|
```
|
||||||
|
|
||||||
### Mlir
|
### MLIR
|
||||||
|
|
||||||
Follow the first part of instructions [here](onnx-mlir/docs/BuildOnLinuxOSX.md) to build mlir.
|
Follow the ONNX-MLIR instructions in
|
||||||
|
`onnx-mlir/docs/BuildOnLinuxOSX.md` to build LLVM/MLIR. The local Raptor build
|
||||||
|
expects `MLIR_DIR` to point at the MLIR CMake package, for example:
|
||||||
|
|
||||||
Remember to set ```-DCMAKE_BUILD_TYPE=Debug``` for developing on Raptor
|
```bash
|
||||||
|
MLIR_DIR=$(pwd)/onnx-mlir/llvm-project/build_release/lib/cmake/mlir
|
||||||
Moreover, if compiling with build type debug, it is also suggested to use
|
|
||||||
mold as linker (you will need to install it if you don't have it already)
|
|
||||||
to reduce memory usage during linking. You can use it by setting the options:
|
|
||||||
```
|
|
||||||
-DLLVM_USE_LINKER=mold
|
|
||||||
```
|
```
|
||||||
|
|
||||||
|
If your LLVM build directory is named `build` instead of `build_release`, adjust
|
||||||
|
the path accordingly.
|
||||||
|
|
||||||
### Raptor
|
### Raptor
|
||||||
|
|
||||||
Use the following commands to build Raptor.
|
Configure a release build:
|
||||||
|
|
||||||
Remember to set ```-DCMAKE_BUILD_TYPE=Debug``` for developing on Raptor.
|
```bash
|
||||||
|
MLIR_DIR=$(pwd)/onnx-mlir/llvm-project/build_release/lib/cmake/mlir
|
||||||
Also in this case, it is suggested to use mold as linker to reduce link time and memory usage,
|
cmake -S . -B build_release -G Ninja \
|
||||||
setting the options:
|
|
||||||
```
|
|
||||||
-DCMAKE_EXE_LINKER_FLAGS="-fuse-ld=mold" \
|
|
||||||
-DCMAKE_SHARED_LINKER_FLAGS="-fuse-ld=mold" \
|
|
||||||
-DCMAKE_MODULE_LINKER_FLAGS="-fuse-ld=mold"
|
|
||||||
```
|
|
||||||
|
|
||||||
```
|
|
||||||
git submodule update --init --recursive
|
|
||||||
|
|
||||||
MLIR_DIR=$(pwd)/onnx-mlir/llvm-project/build/lib/cmake/mlir
|
|
||||||
mkdir build && cd build
|
|
||||||
cmake .. -G Ninja \
|
|
||||||
-DCMAKE_BUILD_TYPE=Release \
|
-DCMAKE_BUILD_TYPE=Release \
|
||||||
-DONNX_MLIR_ACCELERATORS=PIM \
|
-DONNX_MLIR_ACCELERATORS=PIM \
|
||||||
-DLLVM_ENABLE_ASSERTIONS=ON \
|
-DLLVM_ENABLE_ASSERTIONS=ON \
|
||||||
-DMLIR_DIR=${MLIR_DIR}
|
-DMLIR_DIR=${MLIR_DIR}
|
||||||
cmake --build .
|
|
||||||
```
|
```
|
||||||
|
|
||||||
If the build fails because of protobuf missing uint definitions,
|
Configure a debug build similarly:
|
||||||
just patch the problematic files by adding ```#include <cstdint>``` to their includes.
|
|
||||||
|
```bash
|
||||||
|
MLIR_DIR=$(pwd)/onnx-mlir/llvm-project/build_debug/lib/cmake/mlir
|
||||||
|
cmake -S . -B build_debug -G Ninja \
|
||||||
|
-DCMAKE_BUILD_TYPE=Debug \
|
||||||
|
-DONNX_MLIR_ACCELERATORS=PIM \
|
||||||
|
-DLLVM_ENABLE_ASSERTIONS=ON \
|
||||||
|
-DMLIR_DIR=${MLIR_DIR}
|
||||||
|
```
|
||||||
|
|
||||||
|
For debug development, using `mold` can reduce link time and memory use:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
cmake -S . -B build_debug -G Ninja \
|
||||||
|
-DCMAKE_BUILD_TYPE=Debug \
|
||||||
|
-DONNX_MLIR_ACCELERATORS=PIM \
|
||||||
|
-DLLVM_ENABLE_ASSERTIONS=ON \
|
||||||
|
-DMLIR_DIR=${MLIR_DIR} \
|
||||||
|
-DCMAKE_EXE_LINKER_FLAGS="-fuse-ld=mold" \
|
||||||
|
-DCMAKE_SHARED_LINKER_FLAGS="-fuse-ld=mold" \
|
||||||
|
-DCMAKE_MODULE_LINKER_FLAGS="-fuse-ld=mold"
|
||||||
|
```
|
||||||
|
|
||||||
|
Build the compiler with CMake:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
cmake --build ./build_release
|
||||||
|
cmake --build ./build_debug
|
||||||
|
```
|
||||||
|
|
||||||
|
Do not invoke `ninja` directly for this project; use `cmake --build` so CMake's
|
||||||
|
configuration and generated shims stay consistent.
|
||||||
|
|
||||||
|
If a build fails because Protobuf headers are missing fixed-width integer
|
||||||
|
definitions, patch the affected Protobuf-generated files by adding
|
||||||
|
`#include <cstdint>`.
|
||||||
|
|
||||||
|
## Tests
|
||||||
|
|
||||||
|
The Rust simulator has its own tests:
|
||||||
|
|
||||||
|
```bash
|
||||||
|
cd backend-simulators/pim/pim-simulator
|
||||||
|
cargo test
|
||||||
|
```
|
||||||
|
|
||||||
|
## Repository Layout
|
||||||
|
|
||||||
|
- `src/PIM/` - PIM accelerator implementation.
|
||||||
|
- `test/PIM/` - PIM C++ unit tests.
|
||||||
|
- `validation/` - functional validation scripts, ONNX operation tests, network
|
||||||
|
slices, and pimsim config generation.
|
||||||
|
- `backend-simulators/pim/pim-simulator/` - in-tree Rust functional simulator.
|
||||||
|
- `backend-simulators/pim/pimsim-nn/` - performance simulator submodule.
|
||||||
|
- `pimcomp_utils/` - local comparison helpers for PIMCOMP-NN.
|
||||||
|
- `.github/actions/` and `.github/workflows/validate_operations.yml` - CI setup
|
||||||
|
for MLIR/Protobuf caching, building Raptor, and validation.
|
||||||
|
|||||||
@@ -299,10 +299,11 @@ fn detect_deadlock(cores_instructions: &[CoreInstructions]) -> Option<DeadlockIn
|
|||||||
if in_path.contains(&waiting_for) {
|
if in_path.contains(&waiting_for) {
|
||||||
let cycle_start = path.iter().position(|&c| c == waiting_for).unwrap();
|
let cycle_start = path.iter().position(|&c| c == waiting_for).unwrap();
|
||||||
let cycle = &path[cycle_start..];
|
let cycle = &path[cycle_start..];
|
||||||
|
let format_core = |core: &i32| (core - 1).to_string();
|
||||||
|
|
||||||
let cycle_str = cycle
|
let cycle_str = cycle
|
||||||
.iter()
|
.iter()
|
||||||
.map(|c| c.to_string())
|
.map(format_core)
|
||||||
.collect::<Vec<_>>()
|
.collect::<Vec<_>>()
|
||||||
.join(" -> ");
|
.join(" -> ");
|
||||||
|
|
||||||
@@ -311,19 +312,19 @@ fn detect_deadlock(cores_instructions: &[CoreInstructions]) -> Option<DeadlockIn
|
|||||||
.copied()
|
.copied()
|
||||||
.chain(std::iter::once(waiting_for))
|
.chain(std::iter::once(waiting_for))
|
||||||
.collect::<Vec<_>>();
|
.collect::<Vec<_>>();
|
||||||
let cycle_msg = format!("{} -> {}", cycle_str, waiting_for);
|
let cycle_msg = format!("{} -> {}", cycle_str, waiting_for - 1);
|
||||||
let states_msg = cycle
|
let states_msg = cycle
|
||||||
.iter()
|
.iter()
|
||||||
.filter_map(|core| {
|
.filter_map(|core| {
|
||||||
states.get(core).map(|state| match state {
|
states.get(core).map(|state| match state {
|
||||||
CoreState::SendingTo(target, size) => {
|
CoreState::SendingTo(target, size) => {
|
||||||
format!("core {} send {}B -> {}", core, size, target)
|
format!("core {} send {}B -> {}", core - 1, size, target - 1)
|
||||||
}
|
}
|
||||||
CoreState::ReceivingFrom(source, size) => {
|
CoreState::ReceivingFrom(source, size) => {
|
||||||
format!("core {} recv {}B <- {}", core, size, source)
|
format!("core {} recv {}B <- {}", core - 1, size, source - 1)
|
||||||
}
|
}
|
||||||
CoreState::Working => format!("core {} working", core),
|
CoreState::Working => format!("core {} working", core - 1),
|
||||||
CoreState::Halted => format!("core {} halted", core),
|
CoreState::Halted => format!("core {} halted", core - 1),
|
||||||
})
|
})
|
||||||
})
|
})
|
||||||
.collect::<Vec<_>>()
|
.collect::<Vec<_>>()
|
||||||
|
|||||||
@@ -10,6 +10,56 @@ set(PIM_INCLUDE_PATH ${CMAKE_INCLUDE_OUTPUT_DIRECTORY})
|
|||||||
set(PIM_ONNX_MLIR_SRC_ROOT ${ONNX_MLIR_SRC_ROOT})
|
set(PIM_ONNX_MLIR_SRC_ROOT ${ONNX_MLIR_SRC_ROOT})
|
||||||
set(PIM_ONNX_MLIR_BIN_ROOT ${ONNX_MLIR_BIN_ROOT})
|
set(PIM_ONNX_MLIR_BIN_ROOT ${ONNX_MLIR_BIN_ROOT})
|
||||||
|
|
||||||
|
set(PIM_GENERATED_PATH_SHIM_TARGET "")
|
||||||
|
get_filename_component(PIM_BIN_ROOT_NAME "${PIM_BIN_ROOT}" NAME)
|
||||||
|
if (PIM_BIN_ROOT_NAME STREQUAL "raptor-external")
|
||||||
|
get_filename_component(PIM_GENERATED_PATH_SHIM_ROOT "${PIM_BIN_ROOT}" DIRECTORY)
|
||||||
|
set(PIM_GENERATED_PATH_SHIM_OUTPUTS)
|
||||||
|
|
||||||
|
function(add_pim_generated_path_shim relative_path)
|
||||||
|
set(real_file "${PIM_BIN_ROOT}/${relative_path}")
|
||||||
|
set(shim_file "${PIM_GENERATED_PATH_SHIM_ROOT}/${relative_path}")
|
||||||
|
get_filename_component(shim_dir "${shim_file}" DIRECTORY)
|
||||||
|
|
||||||
|
add_custom_command(
|
||||||
|
OUTPUT "${shim_file}"
|
||||||
|
DEPENDS "${real_file}"
|
||||||
|
COMMAND "${CMAKE_COMMAND}" -E make_directory "${shim_dir}"
|
||||||
|
COMMAND "${CMAKE_COMMAND}" -E rm -f "${shim_file}"
|
||||||
|
COMMAND "${CMAKE_COMMAND}" -E create_symlink "${real_file}" "${shim_file}"
|
||||||
|
VERBATIM
|
||||||
|
)
|
||||||
|
|
||||||
|
list(APPEND PIM_GENERATED_PATH_SHIM_OUTPUTS "${shim_file}")
|
||||||
|
set(PIM_GENERATED_PATH_SHIM_OUTPUTS "${PIM_GENERATED_PATH_SHIM_OUTPUTS}" PARENT_SCOPE)
|
||||||
|
endfunction()
|
||||||
|
|
||||||
|
file(GLOB_RECURSE pim_generated_path_scan_sources
|
||||||
|
CONFIGURE_DEPENDS
|
||||||
|
"${PIM_SRC_ROOT}/*.cpp"
|
||||||
|
"${PIM_SRC_ROOT}/*.hpp"
|
||||||
|
)
|
||||||
|
|
||||||
|
set(pim_generated_path_shims)
|
||||||
|
foreach (source_file IN LISTS pim_generated_path_scan_sources)
|
||||||
|
file(READ "${source_file}" source_contents)
|
||||||
|
string(REGEX MATCHALL "#include \"src/Accelerators/PIM/[^\"]+\\.inc\"" source_inc_matches "${source_contents}")
|
||||||
|
|
||||||
|
foreach (inc_match IN LISTS source_inc_matches)
|
||||||
|
string(REGEX REPLACE "^#include \"src/Accelerators/PIM/(.+)\"$" "\\1" relative_inc_path "${inc_match}")
|
||||||
|
list(APPEND pim_generated_path_shims "${relative_inc_path}")
|
||||||
|
endforeach ()
|
||||||
|
endforeach ()
|
||||||
|
|
||||||
|
list(REMOVE_DUPLICATES pim_generated_path_shims)
|
||||||
|
foreach (relative_inc_path IN LISTS pim_generated_path_shims)
|
||||||
|
add_pim_generated_path_shim("${relative_inc_path}")
|
||||||
|
endforeach ()
|
||||||
|
|
||||||
|
add_custom_target(OMPimGeneratedPathShims DEPENDS ${PIM_GENERATED_PATH_SHIM_OUTPUTS})
|
||||||
|
set(PIM_GENERATED_PATH_SHIM_TARGET OMPimGeneratedPathShims)
|
||||||
|
endif ()
|
||||||
|
|
||||||
set(PIM_PUBLIC_INCLUDE_DIRS
|
set(PIM_PUBLIC_INCLUDE_DIRS
|
||||||
${ONNX_MLIR_SRC_ROOT}/include
|
${ONNX_MLIR_SRC_ROOT}/include
|
||||||
${ONNX_MLIR_SRC_ROOT}
|
${ONNX_MLIR_SRC_ROOT}
|
||||||
@@ -37,6 +87,9 @@ set(PIM_GENERATED_INCLUDE_DIRS
|
|||||||
|
|
||||||
function(add_pim_library name)
|
function(add_pim_library name)
|
||||||
add_onnx_mlir_library(${name} STATIC ${ARGN})
|
add_onnx_mlir_library(${name} STATIC ${ARGN})
|
||||||
|
if (PIM_GENERATED_PATH_SHIM_TARGET)
|
||||||
|
add_dependencies(${name} ${PIM_GENERATED_PATH_SHIM_TARGET})
|
||||||
|
endif ()
|
||||||
endfunction()
|
endfunction()
|
||||||
|
|
||||||
add_subdirectory(Dialect)
|
add_subdirectory(Dialect)
|
||||||
|
|||||||
@@ -1,5 +1,7 @@
|
|||||||
add_pim_library(OMPimCommon
|
add_pim_library(OMPimCommon
|
||||||
IR/AddressAnalysis.cpp
|
IR/AddressAnalysis.cpp
|
||||||
|
IR/BatchCoreUtils.cpp
|
||||||
|
IR/ConstantUtils.cpp
|
||||||
IR/CoreBlockUtils.cpp
|
IR/CoreBlockUtils.cpp
|
||||||
IR/EntryPointUtils.cpp
|
IR/EntryPointUtils.cpp
|
||||||
IR/ShapeUtils.cpp
|
IR/ShapeUtils.cpp
|
||||||
|
|||||||
@@ -1,7 +1,11 @@
|
|||||||
#include "mlir/Dialect/Arith/IR/Arith.h"
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
||||||
#include "mlir/Dialect/SCF/IR/SCF.h"
|
#include "mlir/Dialect/SCF/IR/SCF.h"
|
||||||
|
#include "mlir/IR/BuiltinAttributes.h"
|
||||||
#include "mlir/Interfaces/DestinationStyleOpInterface.h"
|
#include "mlir/Interfaces/DestinationStyleOpInterface.h"
|
||||||
|
|
||||||
|
#include <limits>
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/IR/AddressAnalysis.hpp"
|
#include "src/Accelerators/PIM/Common/IR/AddressAnalysis.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
@@ -28,6 +32,14 @@ mlir::Value resolveAlias(mlir::Value value, const StaticValueKnowledge* knowledg
|
|||||||
return value;
|
return value;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledIndexExpr> compileIndexValueImpl(mlir::Value value);
|
||||||
|
llvm::FailureOr<CompiledAddressExpr> compileContiguousAddressExprImpl(mlir::Value value);
|
||||||
|
|
||||||
|
template <typename... Args>
|
||||||
|
CompiledIndexExpr makeCompiledIndexExpr(Args&&... args) {
|
||||||
|
return CompiledIndexExpr(std::make_shared<CompiledIndexExprNode>(std::forward<Args>(args)...));
|
||||||
|
}
|
||||||
|
|
||||||
mlir::Value resolveLoopCarriedAliasImpl(mlir::Value value, const StaticValueKnowledge* knowledge) {
|
mlir::Value resolveLoopCarriedAliasImpl(mlir::Value value, const StaticValueKnowledge* knowledge) {
|
||||||
value = resolveAlias(value, knowledge);
|
value = resolveAlias(value, knowledge);
|
||||||
|
|
||||||
@@ -55,6 +67,293 @@ mlir::Value resolveLoopCarriedAliasImpl(mlir::Value value, const StaticValueKnow
|
|||||||
}
|
}
|
||||||
|
|
||||||
llvm::FailureOr<int64_t> resolveOpFoldResult(mlir::OpFoldResult ofr, const StaticValueKnowledge* knowledge);
|
llvm::FailureOr<int64_t> resolveOpFoldResult(mlir::OpFoldResult ofr, const StaticValueKnowledge* knowledge);
|
||||||
|
llvm::FailureOr<int64_t> resolveIndexValueImpl(mlir::Value value, const StaticValueKnowledge* knowledge);
|
||||||
|
|
||||||
|
static llvm::FailureOr<int64_t> resolveConstantGlobalLoad(mlir::memref::LoadOp loadOp,
|
||||||
|
const StaticValueKnowledge* knowledge) {
|
||||||
|
auto getGlobalOp = loadOp.getMemRef().getDefiningOp<mlir::memref::GetGlobalOp>();
|
||||||
|
if (!getGlobalOp)
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto moduleOp = loadOp->getParentOfType<mlir::ModuleOp>();
|
||||||
|
auto globalOp = lookupGlobalForGetGlobal(moduleOp, getGlobalOp);
|
||||||
|
if (!globalOp || !globalOp.getConstant() || !globalOp.getInitialValue())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto denseAttr = mlir::dyn_cast<mlir::DenseElementsAttr>(*globalOp.getInitialValue());
|
||||||
|
auto globalType = mlir::dyn_cast<mlir::MemRefType>(getGlobalOp.getType());
|
||||||
|
if (!denseAttr || !globalType || !globalType.hasStaticShape())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto elementType = denseAttr.getElementType();
|
||||||
|
if (!elementType.isIndex() && !elementType.isInteger())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
llvm::SmallVector<int64_t> indices;
|
||||||
|
indices.reserve(loadOp.getIndices().size());
|
||||||
|
for (mlir::Value index : loadOp.getIndices()) {
|
||||||
|
auto resolvedIndex = resolveIndexValueImpl(index, knowledge);
|
||||||
|
if (failed(resolvedIndex))
|
||||||
|
return mlir::failure();
|
||||||
|
indices.push_back(*resolvedIndex);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (indices.size() != static_cast<size_t>(globalType.getRank()))
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto strides = computeRowMajorStrides(globalType.getShape());
|
||||||
|
int64_t linearIndex = linearizeIndex(indices, strides);
|
||||||
|
if (linearIndex < 0 || linearIndex >= globalType.getNumElements())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
return denseAttr.getValues<llvm::APInt>()[linearIndex].getSExtValue();
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool evaluateCmpPredicate(mlir::arith::CmpIPredicate predicate, int64_t lhs, int64_t rhs) {
|
||||||
|
switch (predicate) {
|
||||||
|
case mlir::arith::CmpIPredicate::eq:
|
||||||
|
return lhs == rhs;
|
||||||
|
case mlir::arith::CmpIPredicate::ne:
|
||||||
|
return lhs != rhs;
|
||||||
|
case mlir::arith::CmpIPredicate::slt:
|
||||||
|
return lhs < rhs;
|
||||||
|
case mlir::arith::CmpIPredicate::sle:
|
||||||
|
return lhs <= rhs;
|
||||||
|
case mlir::arith::CmpIPredicate::sgt:
|
||||||
|
return lhs > rhs;
|
||||||
|
case mlir::arith::CmpIPredicate::sge:
|
||||||
|
return lhs >= rhs;
|
||||||
|
case mlir::arith::CmpIPredicate::ult:
|
||||||
|
return static_cast<uint64_t>(lhs) < static_cast<uint64_t>(rhs);
|
||||||
|
case mlir::arith::CmpIPredicate::ule:
|
||||||
|
return static_cast<uint64_t>(lhs) <= static_cast<uint64_t>(rhs);
|
||||||
|
case mlir::arith::CmpIPredicate::ugt:
|
||||||
|
return static_cast<uint64_t>(lhs) > static_cast<uint64_t>(rhs);
|
||||||
|
case mlir::arith::CmpIPredicate::uge:
|
||||||
|
return static_cast<uint64_t>(lhs) >= static_cast<uint64_t>(rhs);
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm_unreachable("unknown cmpi predicate");
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<int64_t> evaluateCompiledIndexExpr(const CompiledIndexExpr& expr, const StaticValueKnowledge& knowledge) {
|
||||||
|
if (!expr.node)
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
switch (expr.node->kind) {
|
||||||
|
case CompiledIndexExprNode::Kind::Constant:
|
||||||
|
return expr.node->constant;
|
||||||
|
case CompiledIndexExprNode::Kind::Symbol: {
|
||||||
|
auto value = resolveAlias(expr.node->symbol, &knowledge);
|
||||||
|
auto iter = knowledge.indexValues.find(value);
|
||||||
|
if (iter != knowledge.indexValues.end())
|
||||||
|
return iter->second;
|
||||||
|
return mlir::failure();
|
||||||
|
}
|
||||||
|
case CompiledIndexExprNode::Kind::Add:
|
||||||
|
case CompiledIndexExprNode::Kind::Sub:
|
||||||
|
case CompiledIndexExprNode::Kind::Mul:
|
||||||
|
case CompiledIndexExprNode::Kind::DivUI:
|
||||||
|
case CompiledIndexExprNode::Kind::DivSI:
|
||||||
|
case CompiledIndexExprNode::Kind::RemUI:
|
||||||
|
case CompiledIndexExprNode::Kind::RemSI:
|
||||||
|
case CompiledIndexExprNode::Kind::MinUI:
|
||||||
|
case CompiledIndexExprNode::Kind::CmpI: {
|
||||||
|
auto lhs = evaluateCompiledIndexExpr(expr.node->operands[0], knowledge);
|
||||||
|
auto rhs = evaluateCompiledIndexExpr(expr.node->operands[1], knowledge);
|
||||||
|
if (failed(lhs) || failed(rhs))
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
switch (expr.node->kind) {
|
||||||
|
case CompiledIndexExprNode::Kind::Add:
|
||||||
|
return *lhs + *rhs;
|
||||||
|
case CompiledIndexExprNode::Kind::Sub:
|
||||||
|
return *lhs - *rhs;
|
||||||
|
case CompiledIndexExprNode::Kind::Mul:
|
||||||
|
return *lhs * *rhs;
|
||||||
|
case CompiledIndexExprNode::Kind::DivUI:
|
||||||
|
if (*rhs == 0)
|
||||||
|
return mlir::failure();
|
||||||
|
return static_cast<int64_t>(static_cast<uint64_t>(*lhs) / static_cast<uint64_t>(*rhs));
|
||||||
|
case CompiledIndexExprNode::Kind::DivSI:
|
||||||
|
if (*rhs == 0 || (*lhs == std::numeric_limits<int64_t>::min() && *rhs == -1))
|
||||||
|
return mlir::failure();
|
||||||
|
return *lhs / *rhs;
|
||||||
|
case CompiledIndexExprNode::Kind::RemUI:
|
||||||
|
if (*rhs == 0)
|
||||||
|
return mlir::failure();
|
||||||
|
return static_cast<int64_t>(static_cast<uint64_t>(*lhs) % static_cast<uint64_t>(*rhs));
|
||||||
|
case CompiledIndexExprNode::Kind::RemSI:
|
||||||
|
if (*rhs == 0)
|
||||||
|
return mlir::failure();
|
||||||
|
if (*lhs == std::numeric_limits<int64_t>::min() && *rhs == -1)
|
||||||
|
return 0;
|
||||||
|
return *lhs % *rhs;
|
||||||
|
case CompiledIndexExprNode::Kind::MinUI:
|
||||||
|
return static_cast<int64_t>(std::min(static_cast<uint64_t>(*lhs), static_cast<uint64_t>(*rhs)));
|
||||||
|
case CompiledIndexExprNode::Kind::CmpI:
|
||||||
|
return evaluateCmpPredicate(expr.node->predicate, *lhs, *rhs) ? 1 : 0;
|
||||||
|
default:
|
||||||
|
llvm_unreachable("unexpected binary compiled index kind");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
case CompiledIndexExprNode::Kind::Select: {
|
||||||
|
auto condition = evaluateCompiledIndexExpr(expr.node->operands[0], knowledge);
|
||||||
|
if (failed(condition))
|
||||||
|
return mlir::failure();
|
||||||
|
return evaluateCompiledIndexExpr(*condition != 0 ? expr.node->operands[1] : expr.node->operands[2], knowledge);
|
||||||
|
}
|
||||||
|
case CompiledIndexExprNode::Kind::ConstantGlobalLoad: {
|
||||||
|
if (!expr.node->globalOp || !expr.node->globalOp.getInitialValue())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto denseAttr = mlir::dyn_cast<mlir::DenseElementsAttr>(*expr.node->globalOp.getInitialValue());
|
||||||
|
auto globalType = mlir::dyn_cast<mlir::MemRefType>(expr.node->globalOp.getType());
|
||||||
|
if (!denseAttr || !globalType)
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
llvm::SmallVector<int64_t> indices;
|
||||||
|
indices.reserve(expr.node->operands.size());
|
||||||
|
for (const CompiledIndexExpr& operand : expr.node->operands) {
|
||||||
|
auto resolvedIndex = evaluateCompiledIndexExpr(operand, knowledge);
|
||||||
|
if (failed(resolvedIndex))
|
||||||
|
return mlir::failure();
|
||||||
|
indices.push_back(*resolvedIndex);
|
||||||
|
}
|
||||||
|
|
||||||
|
int64_t linearIndex = linearizeIndex(indices, expr.node->globalStrides);
|
||||||
|
if (linearIndex < 0 || linearIndex >= globalType.getNumElements())
|
||||||
|
return mlir::failure();
|
||||||
|
return denseAttr.getValues<llvm::APInt>()[linearIndex].getSExtValue();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm_unreachable("unknown compiled index kind");
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledIndexExpr> compileConstantGlobalLoad(mlir::memref::LoadOp loadOp) {
|
||||||
|
auto getGlobalOp = loadOp.getMemRef().getDefiningOp<mlir::memref::GetGlobalOp>();
|
||||||
|
if (!getGlobalOp)
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto moduleOp = loadOp->getParentOfType<mlir::ModuleOp>();
|
||||||
|
auto globalOp = lookupGlobalForGetGlobal(moduleOp, getGlobalOp);
|
||||||
|
if (!globalOp || !globalOp.getConstant() || !globalOp.getInitialValue())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto denseAttr = mlir::dyn_cast<mlir::DenseElementsAttr>(*globalOp.getInitialValue());
|
||||||
|
auto globalType = mlir::dyn_cast<mlir::MemRefType>(getGlobalOp.getType());
|
||||||
|
if (!denseAttr || !globalType || !globalType.hasStaticShape())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto elementType = denseAttr.getElementType();
|
||||||
|
if (!elementType.isIndex() && !elementType.isInteger())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::ConstantGlobalLoad;
|
||||||
|
expr.globalOp = globalOp;
|
||||||
|
expr.globalStrides = computeRowMajorStrides(globalType.getShape());
|
||||||
|
expr.operands.reserve(loadOp.getIndices().size());
|
||||||
|
for (mlir::Value index : loadOp.getIndices()) {
|
||||||
|
auto compiledIndex = compileIndexValueImpl(index);
|
||||||
|
if (failed(compiledIndex))
|
||||||
|
return mlir::failure();
|
||||||
|
expr.operands.push_back(*compiledIndex);
|
||||||
|
}
|
||||||
|
return makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledIndexExpr> compileIndexValueImpl(mlir::Value value) {
|
||||||
|
if (auto constantOp = value.getDefiningOp<mlir::arith::ConstantOp>()) {
|
||||||
|
if (auto integerAttr = mlir::dyn_cast<mlir::IntegerAttr>(constantOp.getValue())) {
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = integerAttr.getInt();
|
||||||
|
return makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
mlir::Operation* definingOp = value.getDefiningOp();
|
||||||
|
if (!definingOp) {
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Symbol;
|
||||||
|
expr.symbol = value;
|
||||||
|
return makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
auto buildBinaryExpr = [&](CompiledIndexExprNode::Kind kind, mlir::Value lhsValue, mlir::Value rhsValue) {
|
||||||
|
auto lhs = compileIndexValueImpl(lhsValue);
|
||||||
|
auto rhs = compileIndexValueImpl(rhsValue);
|
||||||
|
if (failed(lhs) || failed(rhs))
|
||||||
|
return llvm::FailureOr<CompiledIndexExpr>(mlir::failure());
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = kind;
|
||||||
|
expr.operands = {*lhs, *rhs};
|
||||||
|
return llvm::FailureOr<CompiledIndexExpr>(makeCompiledIndexExpr(std::move(expr)));
|
||||||
|
};
|
||||||
|
|
||||||
|
if (auto indexCastOp = mlir::dyn_cast<mlir::arith::IndexCastOp>(definingOp))
|
||||||
|
return compileIndexValueImpl(indexCastOp.getIn());
|
||||||
|
if (auto addOp = mlir::dyn_cast<mlir::arith::AddIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::Add, addOp.getLhs(), addOp.getRhs());
|
||||||
|
if (auto subOp = mlir::dyn_cast<mlir::arith::SubIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::Sub, subOp.getLhs(), subOp.getRhs());
|
||||||
|
if (auto mulOp = mlir::dyn_cast<mlir::arith::MulIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::Mul, mulOp.getLhs(), mulOp.getRhs());
|
||||||
|
if (auto divOp = mlir::dyn_cast<mlir::arith::DivUIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::DivUI, divOp.getLhs(), divOp.getRhs());
|
||||||
|
if (auto divOp = mlir::dyn_cast<mlir::arith::DivSIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::DivSI, divOp.getLhs(), divOp.getRhs());
|
||||||
|
if (auto minOp = mlir::dyn_cast<mlir::arith::MinUIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::MinUI, minOp.getLhs(), minOp.getRhs());
|
||||||
|
if (auto remOp = mlir::dyn_cast<mlir::arith::RemUIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::RemUI, remOp.getLhs(), remOp.getRhs());
|
||||||
|
if (auto remOp = mlir::dyn_cast<mlir::arith::RemSIOp>(definingOp))
|
||||||
|
return buildBinaryExpr(CompiledIndexExprNode::Kind::RemSI, remOp.getLhs(), remOp.getRhs());
|
||||||
|
if (auto cmpOp = mlir::dyn_cast<mlir::arith::CmpIOp>(definingOp)) {
|
||||||
|
auto expr = buildBinaryExpr(CompiledIndexExprNode::Kind::CmpI, cmpOp.getLhs(), cmpOp.getRhs());
|
||||||
|
if (failed(expr))
|
||||||
|
return mlir::failure();
|
||||||
|
auto exprNode = std::make_shared<CompiledIndexExprNode>(*expr->node);
|
||||||
|
exprNode->predicate = cmpOp.getPredicate();
|
||||||
|
return CompiledIndexExpr(exprNode);
|
||||||
|
}
|
||||||
|
if (auto maxOp = mlir::dyn_cast<mlir::arith::MaxUIOp>(definingOp)) {
|
||||||
|
auto lhs = compileIndexValueImpl(maxOp.getLhs());
|
||||||
|
auto rhs = compileIndexValueImpl(maxOp.getRhs());
|
||||||
|
if (failed(lhs) || failed(rhs))
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
CompiledIndexExprNode cmpExpr;
|
||||||
|
cmpExpr.kind = CompiledIndexExprNode::Kind::CmpI;
|
||||||
|
cmpExpr.predicate = mlir::arith::CmpIPredicate::uge;
|
||||||
|
cmpExpr.operands = {*lhs, *rhs};
|
||||||
|
|
||||||
|
CompiledIndexExprNode selectExpr;
|
||||||
|
selectExpr.kind = CompiledIndexExprNode::Kind::Select;
|
||||||
|
selectExpr.operands = {makeCompiledIndexExpr(std::move(cmpExpr)), *lhs, *rhs};
|
||||||
|
return makeCompiledIndexExpr(std::move(selectExpr));
|
||||||
|
}
|
||||||
|
if (auto selectOp = mlir::dyn_cast<mlir::arith::SelectOp>(definingOp)) {
|
||||||
|
auto condition = compileIndexValueImpl(selectOp.getCondition());
|
||||||
|
auto trueValue = compileIndexValueImpl(selectOp.getTrueValue());
|
||||||
|
auto falseValue = compileIndexValueImpl(selectOp.getFalseValue());
|
||||||
|
if (failed(condition) || failed(trueValue) || failed(falseValue))
|
||||||
|
return mlir::failure();
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Select;
|
||||||
|
expr.operands = {*condition, *trueValue, *falseValue};
|
||||||
|
return makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
if (auto loadOp = mlir::dyn_cast<mlir::memref::LoadOp>(definingOp))
|
||||||
|
return compileConstantGlobalLoad(loadOp);
|
||||||
|
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Symbol;
|
||||||
|
expr.symbol = value;
|
||||||
|
return makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
llvm::FailureOr<int64_t> resolveIndexValueImpl(mlir::Value value, const StaticValueKnowledge* knowledge) {
|
llvm::FailureOr<int64_t> resolveIndexValueImpl(mlir::Value value, const StaticValueKnowledge* knowledge) {
|
||||||
value = resolveAlias(value, knowledge);
|
value = resolveAlias(value, knowledge);
|
||||||
@@ -110,6 +409,16 @@ llvm::FailureOr<int64_t> resolveIndexValueImpl(mlir::Value value, const StaticVa
|
|||||||
return static_cast<int64_t>(static_cast<uint64_t>(*lhs) / static_cast<uint64_t>(*rhs));
|
return static_cast<int64_t>(static_cast<uint64_t>(*lhs) / static_cast<uint64_t>(*rhs));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (auto divOp = mlir::dyn_cast<mlir::arith::DivSIOp>(definingOp)) {
|
||||||
|
auto lhs = resolveIndexValueImpl(divOp.getLhs(), knowledge);
|
||||||
|
auto rhs = resolveIndexValueImpl(divOp.getRhs(), knowledge);
|
||||||
|
if (failed(lhs) || failed(rhs) || *rhs == 0)
|
||||||
|
return mlir::failure();
|
||||||
|
if (*lhs == std::numeric_limits<int64_t>::min() && *rhs == -1)
|
||||||
|
return mlir::failure();
|
||||||
|
return *lhs / *rhs;
|
||||||
|
}
|
||||||
|
|
||||||
if (auto minOp = mlir::dyn_cast<mlir::arith::MinUIOp>(definingOp)) {
|
if (auto minOp = mlir::dyn_cast<mlir::arith::MinUIOp>(definingOp)) {
|
||||||
auto lhs = resolveIndexValueImpl(minOp.getLhs(), knowledge);
|
auto lhs = resolveIndexValueImpl(minOp.getLhs(), knowledge);
|
||||||
auto rhs = resolveIndexValueImpl(minOp.getRhs(), knowledge);
|
auto rhs = resolveIndexValueImpl(minOp.getRhs(), knowledge);
|
||||||
@@ -126,6 +435,34 @@ llvm::FailureOr<int64_t> resolveIndexValueImpl(mlir::Value value, const StaticVa
|
|||||||
return static_cast<int64_t>(static_cast<uint64_t>(*lhs) % static_cast<uint64_t>(*rhs));
|
return static_cast<int64_t>(static_cast<uint64_t>(*lhs) % static_cast<uint64_t>(*rhs));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (auto remOp = mlir::dyn_cast<mlir::arith::RemSIOp>(definingOp)) {
|
||||||
|
auto lhs = resolveIndexValueImpl(remOp.getLhs(), knowledge);
|
||||||
|
auto rhs = resolveIndexValueImpl(remOp.getRhs(), knowledge);
|
||||||
|
if (failed(lhs) || failed(rhs) || *rhs == 0)
|
||||||
|
return mlir::failure();
|
||||||
|
if (*lhs == std::numeric_limits<int64_t>::min() && *rhs == -1)
|
||||||
|
return 0;
|
||||||
|
return *lhs % *rhs;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto cmpOp = mlir::dyn_cast<mlir::arith::CmpIOp>(definingOp)) {
|
||||||
|
auto lhs = resolveIndexValueImpl(cmpOp.getLhs(), knowledge);
|
||||||
|
auto rhs = resolveIndexValueImpl(cmpOp.getRhs(), knowledge);
|
||||||
|
if (failed(lhs) || failed(rhs))
|
||||||
|
return mlir::failure();
|
||||||
|
return evaluateCmpPredicate(cmpOp.getPredicate(), *lhs, *rhs) ? 1 : 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto selectOp = mlir::dyn_cast<mlir::arith::SelectOp>(definingOp)) {
|
||||||
|
auto condition = resolveIndexValueImpl(selectOp.getCondition(), knowledge);
|
||||||
|
if (failed(condition))
|
||||||
|
return mlir::failure();
|
||||||
|
return resolveIndexValueImpl(*condition != 0 ? selectOp.getTrueValue() : selectOp.getFalseValue(), knowledge);
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto loadOp = mlir::dyn_cast<mlir::memref::LoadOp>(definingOp))
|
||||||
|
return resolveConstantGlobalLoad(loadOp, knowledge);
|
||||||
|
|
||||||
return mlir::failure();
|
return mlir::failure();
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -218,7 +555,7 @@ llvm::FailureOr<ResolvedContiguousAddress> resolveContiguousAddressImpl(mlir::Va
|
|||||||
return mlir::failure();
|
return mlir::failure();
|
||||||
|
|
||||||
auto sourceStrides = computeRowMajorStrides(sourceType.getShape());
|
auto sourceStrides = computeRowMajorStrides(sourceType.getShape());
|
||||||
byteOffset += linearizeIndex(offsets, sourceStrides) * subviewType.getElementTypeBitWidth() / 8;
|
byteOffset += linearizeIndex(offsets, sourceStrides) * getElementTypeSizeInBytes(subviewType.getElementType());
|
||||||
value = resolveAlias(subviewOp.getSource(), knowledge);
|
value = resolveAlias(subviewOp.getSource(), knowledge);
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
@@ -243,6 +580,191 @@ llvm::FailureOr<ResolvedContiguousAddress> resolveContiguousAddressImpl(mlir::Va
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledAddressExpr> compileContiguousAddressExprImpl(mlir::Value value) {
|
||||||
|
int64_t constantByteOffset = 0;
|
||||||
|
CompiledIndexExpr byteOffsetExpr;
|
||||||
|
{
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = 0;
|
||||||
|
byteOffsetExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
while (true) {
|
||||||
|
if (mlir::isa<mlir::BlockArgument>(value))
|
||||||
|
return CompiledAddressExpr {value, byteOffsetExpr};
|
||||||
|
|
||||||
|
mlir::Operation* definingOp = value.getDefiningOp();
|
||||||
|
if (!definingOp)
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
if (auto dpsDefiningOp = mlir::dyn_cast<mlir::DestinationStyleOpInterface>(definingOp)) {
|
||||||
|
mlir::OpOperand* tiedOperand = dpsDefiningOp.getTiedOpOperand(mlir::dyn_cast<mlir::OpResult>(value));
|
||||||
|
if (!tiedOperand)
|
||||||
|
return mlir::failure();
|
||||||
|
value = tiedOperand->get();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto forOp = mlir::dyn_cast<mlir::scf::ForOp>(definingOp)) {
|
||||||
|
auto result = mlir::dyn_cast<mlir::OpResult>(value);
|
||||||
|
if (!result)
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto yieldOp = mlir::cast<mlir::scf::YieldOp>(forOp.getBody()->getTerminator());
|
||||||
|
mlir::Value yieldedValue = yieldOp.getOperand(result.getResultNumber());
|
||||||
|
if (auto blockArgument = mlir::dyn_cast<mlir::BlockArgument>(yieldedValue)) {
|
||||||
|
if (blockArgument.getOwner() == forOp.getBody() && blockArgument.getArgNumber() > 0
|
||||||
|
&& static_cast<unsigned>(blockArgument.getArgNumber() - 1) < forOp.getInitArgs().size()) {
|
||||||
|
value = forOp.getInitArgs()[blockArgument.getArgNumber() - 1];
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
value = yieldedValue;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto subviewOp = mlir::dyn_cast<mlir::memref::SubViewOp>(definingOp)) {
|
||||||
|
auto sourceType = mlir::dyn_cast<mlir::MemRefType>(subviewOp.getSource().getType());
|
||||||
|
auto subviewType = mlir::dyn_cast<mlir::MemRefType>(subviewOp.getType());
|
||||||
|
if (!sourceType || !subviewType || !sourceType.hasStaticShape() || !subviewType.hasStaticShape())
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
llvm::SmallVector<int64_t> staticOffsets;
|
||||||
|
staticOffsets.reserve(subviewOp.getMixedOffsets().size());
|
||||||
|
llvm::SmallVector<int64_t> staticSizes;
|
||||||
|
staticSizes.reserve(subviewOp.getMixedSizes().size());
|
||||||
|
llvm::SmallVector<int64_t> staticStrides;
|
||||||
|
staticStrides.reserve(subviewOp.getMixedStrides().size());
|
||||||
|
bool allStatic = true;
|
||||||
|
|
||||||
|
for (mlir::OpFoldResult offset : subviewOp.getMixedOffsets()) {
|
||||||
|
if (auto attr = mlir::dyn_cast<mlir::Attribute>(offset))
|
||||||
|
staticOffsets.push_back(mlir::cast<mlir::IntegerAttr>(attr).getInt());
|
||||||
|
else
|
||||||
|
allStatic = false;
|
||||||
|
}
|
||||||
|
for (mlir::OpFoldResult size : subviewOp.getMixedSizes()) {
|
||||||
|
if (auto attr = mlir::dyn_cast<mlir::Attribute>(size))
|
||||||
|
staticSizes.push_back(mlir::cast<mlir::IntegerAttr>(attr).getInt());
|
||||||
|
else
|
||||||
|
allStatic = false;
|
||||||
|
}
|
||||||
|
for (mlir::OpFoldResult stride : subviewOp.getMixedStrides()) {
|
||||||
|
if (auto attr = mlir::dyn_cast<mlir::Attribute>(stride))
|
||||||
|
staticStrides.push_back(mlir::cast<mlir::IntegerAttr>(attr).getInt());
|
||||||
|
else
|
||||||
|
allStatic = false;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (allStatic) {
|
||||||
|
if (!isMemoryContiguous(sourceType.getShape(), staticOffsets, staticSizes, staticStrides))
|
||||||
|
return mlir::failure();
|
||||||
|
|
||||||
|
auto sourceStrides = computeRowMajorStrides(sourceType.getShape());
|
||||||
|
constantByteOffset +=
|
||||||
|
linearizeIndex(staticOffsets, sourceStrides) * getElementTypeSizeInBytes(subviewType.getElementType());
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
llvm::SmallVector<int64_t> sourceStrides = computeRowMajorStrides(sourceType.getShape());
|
||||||
|
CompiledIndexExpr offsetExpr;
|
||||||
|
{
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = 0;
|
||||||
|
offsetExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
for (auto [mixedOffset, sourceStride] : llvm::zip_equal(subviewOp.getMixedOffsets(), sourceStrides)) {
|
||||||
|
CompiledIndexExpr operandExpr;
|
||||||
|
if (auto attr = mlir::dyn_cast<mlir::Attribute>(mixedOffset)) {
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = mlir::cast<mlir::IntegerAttr>(attr).getInt() * sourceStride
|
||||||
|
* getElementTypeSizeInBytes(subviewType.getElementType());
|
||||||
|
operandExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
auto compiledOffset = compileIndexValueImpl(mlir::cast<mlir::Value>(mixedOffset));
|
||||||
|
if (failed(compiledOffset))
|
||||||
|
return mlir::failure();
|
||||||
|
CompiledIndexExpr scaleExpr;
|
||||||
|
{
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = sourceStride * getElementTypeSizeInBytes(subviewType.getElementType());
|
||||||
|
scaleExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Mul;
|
||||||
|
expr.operands = {*compiledOffset, scaleExpr};
|
||||||
|
operandExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Add;
|
||||||
|
expr.operands = {offsetExpr, operandExpr};
|
||||||
|
offsetExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
|
||||||
|
CompiledIndexExpr constantExpr;
|
||||||
|
{
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = constantByteOffset;
|
||||||
|
constantExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Add;
|
||||||
|
expr.operands = {constantExpr, offsetExpr};
|
||||||
|
byteOffsetExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
constantByteOffset = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
value = subviewOp.getSource();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto castOp = mlir::dyn_cast<mlir::memref::CastOp>(definingOp)) {
|
||||||
|
value = castOp.getSource();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if (auto collapseOp = mlir::dyn_cast<mlir::memref::CollapseShapeOp>(definingOp)) {
|
||||||
|
value = collapseOp.getSrc();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if (auto expandOp = mlir::dyn_cast<mlir::memref::ExpandShapeOp>(definingOp)) {
|
||||||
|
value = expandOp.getSrc();
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (mlir::isa<mlir::memref::AllocOp, mlir::memref::GetGlobalOp>(definingOp)) {
|
||||||
|
if (constantByteOffset != 0) {
|
||||||
|
CompiledIndexExpr constantExpr;
|
||||||
|
{
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Constant;
|
||||||
|
expr.constant = constantByteOffset;
|
||||||
|
constantExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
if (byteOffsetExpr.node->kind == CompiledIndexExprNode::Kind::Constant && byteOffsetExpr.node->constant == 0)
|
||||||
|
byteOffsetExpr = constantExpr;
|
||||||
|
else {
|
||||||
|
CompiledIndexExprNode expr;
|
||||||
|
expr.kind = CompiledIndexExprNode::Kind::Add;
|
||||||
|
expr.operands = {constantExpr, byteOffsetExpr};
|
||||||
|
byteOffsetExpr = makeCompiledIndexExpr(std::move(expr));
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return CompiledAddressExpr {value, byteOffsetExpr};
|
||||||
|
}
|
||||||
|
|
||||||
|
return mlir::failure();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value) { return resolveIndexValueImpl(value, nullptr); }
|
llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value) { return resolveIndexValueImpl(value, nullptr); }
|
||||||
@@ -251,6 +773,8 @@ llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value, const StaticValueK
|
|||||||
return resolveIndexValueImpl(value, &knowledge);
|
return resolveIndexValueImpl(value, &knowledge);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledIndexExpr> compileIndexExpr(mlir::Value value) { return compileIndexValueImpl(value); }
|
||||||
|
|
||||||
llvm::FailureOr<ResolvedContiguousAddress> resolveContiguousAddress(mlir::Value value) {
|
llvm::FailureOr<ResolvedContiguousAddress> resolveContiguousAddress(mlir::Value value) {
|
||||||
return resolveContiguousAddressImpl(value, nullptr);
|
return resolveContiguousAddressImpl(value, nullptr);
|
||||||
}
|
}
|
||||||
@@ -264,4 +788,21 @@ mlir::Value resolveLoopCarriedAlias(mlir::Value value, const StaticValueKnowledg
|
|||||||
return resolveLoopCarriedAliasImpl(value, &knowledge);
|
return resolveLoopCarriedAliasImpl(value, &knowledge);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledAddressExpr> compileContiguousAddressExpr(mlir::Value value) {
|
||||||
|
return compileContiguousAddressExprImpl(value);
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<int64_t> CompiledIndexExpr::evaluate(const StaticValueKnowledge& knowledge) const {
|
||||||
|
return evaluateCompiledIndexExpr(*this, knowledge);
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::FailureOr<ResolvedContiguousAddress>
|
||||||
|
CompiledAddressExpr::evaluate(const StaticValueKnowledge& knowledge, std::optional<unsigned> lane) const {
|
||||||
|
(void) lane;
|
||||||
|
auto resolvedOffset = byteOffset.evaluate(knowledge);
|
||||||
|
if (failed(resolvedOffset))
|
||||||
|
return mlir::failure();
|
||||||
|
return ResolvedContiguousAddress {base, *resolvedOffset};
|
||||||
|
}
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -1,10 +1,14 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
||||||
#include "mlir/IR/Value.h"
|
#include "mlir/IR/Value.h"
|
||||||
|
|
||||||
#include "llvm/ADT/DenseMap.h"
|
#include "llvm/ADT/DenseMap.h"
|
||||||
|
|
||||||
|
#include <memory>
|
||||||
|
#include <optional>
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
|
|
||||||
/// Describes a value as a base addressable object plus a statically known
|
/// Describes a value as a base addressable object plus a statically known
|
||||||
@@ -23,6 +27,51 @@ struct StaticValueKnowledge {
|
|||||||
StaticValueKnowledge() {}
|
StaticValueKnowledge() {}
|
||||||
};
|
};
|
||||||
|
|
||||||
|
struct CompiledIndexExprNode;
|
||||||
|
|
||||||
|
struct CompiledIndexExpr {
|
||||||
|
std::shared_ptr<CompiledIndexExprNode> node;
|
||||||
|
|
||||||
|
CompiledIndexExpr() = default;
|
||||||
|
explicit CompiledIndexExpr(std::shared_ptr<CompiledIndexExprNode> node) : node(std::move(node)) {}
|
||||||
|
|
||||||
|
llvm::FailureOr<int64_t> evaluate(const StaticValueKnowledge& knowledge) const;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct CompiledIndexExprNode {
|
||||||
|
enum class Kind {
|
||||||
|
Constant,
|
||||||
|
Symbol,
|
||||||
|
Add,
|
||||||
|
Sub,
|
||||||
|
Mul,
|
||||||
|
DivUI,
|
||||||
|
DivSI,
|
||||||
|
RemUI,
|
||||||
|
RemSI,
|
||||||
|
MinUI,
|
||||||
|
CmpI,
|
||||||
|
Select,
|
||||||
|
ConstantGlobalLoad
|
||||||
|
};
|
||||||
|
|
||||||
|
Kind kind = Kind::Constant;
|
||||||
|
int64_t constant = 0;
|
||||||
|
mlir::Value symbol;
|
||||||
|
mlir::arith::CmpIPredicate predicate = mlir::arith::CmpIPredicate::eq;
|
||||||
|
mlir::memref::GlobalOp globalOp;
|
||||||
|
llvm::SmallVector<int64_t, 4> globalStrides;
|
||||||
|
llvm::SmallVector<CompiledIndexExpr, 4> operands;
|
||||||
|
};
|
||||||
|
|
||||||
|
struct CompiledAddressExpr {
|
||||||
|
mlir::Value base;
|
||||||
|
CompiledIndexExpr byteOffset;
|
||||||
|
|
||||||
|
llvm::FailureOr<ResolvedContiguousAddress>
|
||||||
|
evaluate(const StaticValueKnowledge& knowledge, std::optional<unsigned> lane) const;
|
||||||
|
};
|
||||||
|
|
||||||
mlir::memref::GlobalOp lookupGlobalForGetGlobal(mlir::ModuleOp moduleOp, mlir::memref::GetGlobalOp getGlobalOp);
|
mlir::memref::GlobalOp lookupGlobalForGetGlobal(mlir::ModuleOp moduleOp, mlir::memref::GetGlobalOp getGlobalOp);
|
||||||
|
|
||||||
/// Resolves a value to contiguous backing storage when that storage can be
|
/// Resolves a value to contiguous backing storage when that storage can be
|
||||||
@@ -35,9 +84,12 @@ llvm::FailureOr<ResolvedContiguousAddress> resolveContiguousAddress(mlir::Value
|
|||||||
/// arithmetic and loop facts recorded in `knowledge`.
|
/// arithmetic and loop facts recorded in `knowledge`.
|
||||||
llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value);
|
llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value);
|
||||||
llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value, const StaticValueKnowledge& knowledge);
|
llvm::FailureOr<int64_t> resolveIndexValue(mlir::Value value, const StaticValueKnowledge& knowledge);
|
||||||
|
llvm::FailureOr<CompiledIndexExpr> compileIndexExpr(mlir::Value value);
|
||||||
|
|
||||||
/// Follows alias, view, and DPS chains to recover the backing value of a
|
/// Follows alias, view, and DPS chains to recover the backing value of a
|
||||||
/// loop-carried memref/result.
|
/// loop-carried memref/result.
|
||||||
mlir::Value resolveLoopCarriedAlias(mlir::Value value, const StaticValueKnowledge& knowledge);
|
mlir::Value resolveLoopCarriedAlias(mlir::Value value, const StaticValueKnowledge& knowledge);
|
||||||
|
|
||||||
|
llvm::FailureOr<CompiledAddressExpr> compileContiguousAddressExpr(mlir::Value value);
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -0,0 +1,22 @@
|
|||||||
|
#include "src/Accelerators/PIM/Common/IR/BatchCoreUtils.hpp"
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
|
||||||
|
llvm::SmallVector<int32_t> getBatchCoreIds(pim::PimCoreBatchOp coreBatchOp) {
|
||||||
|
auto coreIdsAttr = coreBatchOp->getAttrOfType<mlir::DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName);
|
||||||
|
assert(coreIdsAttr && "pim.core_batch requires coreIds array attribute");
|
||||||
|
return llvm::SmallVector<int32_t>(coreIdsAttr.asArrayRef().begin(), coreIdsAttr.asArrayRef().end());
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::SmallVector<int32_t>
|
||||||
|
getLaneChunkCoreIds(llvm::ArrayRef<int32_t> coreIds, size_t laneCount, unsigned lane) {
|
||||||
|
llvm::SmallVector<int32_t> laneCoreIds;
|
||||||
|
laneCoreIds.reserve(coreIds.size() / laneCount);
|
||||||
|
for (size_t chunkIndex = 0; chunkIndex < coreIds.size() / laneCount; ++chunkIndex)
|
||||||
|
laneCoreIds.push_back(coreIds[chunkIndex * laneCount + lane]);
|
||||||
|
return laneCoreIds;
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
@@ -0,0 +1,15 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "llvm/ADT/ArrayRef.h"
|
||||||
|
#include "llvm/ADT/SmallVector.h"
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
|
||||||
|
llvm::SmallVector<int32_t> getBatchCoreIds(pim::PimCoreBatchOp coreBatchOp);
|
||||||
|
|
||||||
|
llvm::SmallVector<int32_t>
|
||||||
|
getLaneChunkCoreIds(llvm::ArrayRef<int32_t> coreIds, size_t laneCount, unsigned lane);
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
@@ -0,0 +1,82 @@
|
|||||||
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
|
#include "mlir/IR/Builders.h"
|
||||||
|
#include "mlir/IR/BuiltinOps.h"
|
||||||
|
#include "mlir/IR/Dialect.h"
|
||||||
|
|
||||||
|
#include "ConstantUtils.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
|
using namespace mlir;
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
|
||||||
|
Block* getHostConstantBlock(Operation* anchorOp) {
|
||||||
|
assert(anchorOp && "expected a valid anchor operation");
|
||||||
|
|
||||||
|
for (Operation* current = anchorOp; current; current = current->getParentOp())
|
||||||
|
if (isa<spatial::SpatCompute, spatial::SpatComputeBatch, pim::PimCoreOp, pim::PimCoreBatchOp>(current))
|
||||||
|
return current->getBlock();
|
||||||
|
|
||||||
|
if (auto funcOp = anchorOp->getParentOfType<func::FuncOp>())
|
||||||
|
return &funcOp.getBody().front();
|
||||||
|
if (auto moduleOp = anchorOp->getParentOfType<ModuleOp>())
|
||||||
|
return moduleOp.getBody();
|
||||||
|
return anchorOp->getBlock();
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostConstant(Operation* anchorOp, Attribute value, Type type, OperationFolder& folder) {
|
||||||
|
assert(anchorOp && "expected a valid anchor operation");
|
||||||
|
Block* hostBlock = getHostConstantBlock(anchorOp);
|
||||||
|
for (Operation& op : *hostBlock) {
|
||||||
|
auto constantOp = dyn_cast<arith::ConstantOp>(&op);
|
||||||
|
if (!constantOp || constantOp.getType() != type || constantOp.getValue() != value)
|
||||||
|
continue;
|
||||||
|
return constantOp.getResult();
|
||||||
|
}
|
||||||
|
|
||||||
|
auto* arithDialect = anchorOp->getContext()->getOrLoadDialect<arith::ArithDialect>();
|
||||||
|
return folder.getOrCreateConstant(hostBlock, arithDialect, value, type);
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostConstant(Operation* anchorOp, Attribute value, Type type, RewriterBase& rewriter) {
|
||||||
|
assert(anchorOp && "expected a valid anchor operation");
|
||||||
|
Block* hostBlock = getHostConstantBlock(anchorOp);
|
||||||
|
for (Operation& op : *hostBlock) {
|
||||||
|
auto constantOp = dyn_cast<arith::ConstantOp>(&op);
|
||||||
|
if (!constantOp || constantOp.getType() != type || constantOp.getValue() != value)
|
||||||
|
continue;
|
||||||
|
return constantOp.getResult();
|
||||||
|
}
|
||||||
|
|
||||||
|
OpBuilder::InsertionGuard guard(rewriter);
|
||||||
|
rewriter.setInsertionPointToStart(hostBlock);
|
||||||
|
return arith::ConstantOp::create(rewriter, anchorOp->getLoc(), type, cast<TypedAttr>(value)).getResult();
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostConstantLike(arith::ConstantOp constantOp, OperationFolder& folder) {
|
||||||
|
return getOrCreateHostConstant(constantOp.getOperation(), constantOp.getValue(), constantOp.getType(), folder);
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostIndexConstant(Operation* anchorOp, int64_t value, OperationFolder& folder) {
|
||||||
|
Builder builder(anchorOp->getContext());
|
||||||
|
return getOrCreateHostConstant(anchorOp, builder.getIndexAttr(value), builder.getIndexType(), folder);
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostIndexConstant(Operation* anchorOp, int64_t value, RewriterBase& rewriter) {
|
||||||
|
Builder builder(anchorOp->getContext());
|
||||||
|
return getOrCreateHostConstant(anchorOp, builder.getIndexAttr(value), builder.getIndexType(), rewriter);
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostI32Constant(Operation* anchorOp, int32_t value, OperationFolder& folder) {
|
||||||
|
Builder builder(anchorOp->getContext());
|
||||||
|
return getOrCreateHostConstant(anchorOp, builder.getI32IntegerAttr(value), builder.getI32Type(), folder);
|
||||||
|
}
|
||||||
|
|
||||||
|
Value getOrCreateHostI64Constant(Operation* anchorOp, int64_t value, OperationFolder& folder) {
|
||||||
|
Builder builder(anchorOp->getContext());
|
||||||
|
return getOrCreateHostConstant(anchorOp, builder.getI64IntegerAttr(value), builder.getI64Type(), folder);
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
@@ -0,0 +1,32 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
|
#include "mlir/IR/PatternMatch.h"
|
||||||
|
#include "mlir/IR/Value.h"
|
||||||
|
#include "mlir/Transforms/FoldUtils.h"
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
|
||||||
|
mlir::Block* getHostConstantBlock(mlir::Operation* anchorOp);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostConstant(mlir::Operation* anchorOp,
|
||||||
|
mlir::Attribute value,
|
||||||
|
mlir::Type type,
|
||||||
|
mlir::OperationFolder& folder);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostConstant(mlir::Operation* anchorOp,
|
||||||
|
mlir::Attribute value,
|
||||||
|
mlir::Type type,
|
||||||
|
mlir::RewriterBase& rewriter);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostConstantLike(mlir::arith::ConstantOp constantOp, mlir::OperationFolder& folder);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostIndexConstant(mlir::Operation* anchorOp, int64_t value, mlir::OperationFolder& folder);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostIndexConstant(mlir::Operation* anchorOp, int64_t value, mlir::RewriterBase& rewriter);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostI32Constant(mlir::Operation* anchorOp, int32_t value, mlir::OperationFolder& folder);
|
||||||
|
|
||||||
|
mlir::Value getOrCreateHostI64Constant(mlir::Operation* anchorOp, int64_t value, mlir::OperationFolder& folder);
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
@@ -1,25 +1,37 @@
|
|||||||
#include "mlir/Dialect/Arith/IR/Arith.h"
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
||||||
#include "mlir/Dialect/SCF/IR/SCF.h"
|
#include "mlir/Dialect/SCF/IR/SCF.h"
|
||||||
|
|
||||||
|
#include "llvm/ADT/SmallVector.h"
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/IR/CoreBlockUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/CoreBlockUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
|
|
||||||
bool isCoreStaticAddressOp(mlir::Operation* op) {
|
bool isCoreStaticAddressOp(mlir::Operation* op) {
|
||||||
return mlir::isa<mlir::arith::ConstantOp,
|
if (mlir::isa<mlir::arith::ConstantOp,
|
||||||
mlir::arith::AddIOp,
|
mlir::arith::AddIOp,
|
||||||
mlir::arith::SubIOp,
|
mlir::arith::SubIOp,
|
||||||
mlir::arith::MulIOp,
|
mlir::arith::MulIOp,
|
||||||
mlir::arith::DivUIOp,
|
mlir::arith::DivUIOp,
|
||||||
mlir::arith::MinUIOp,
|
mlir::arith::DivSIOp,
|
||||||
mlir::arith::RemUIOp,
|
mlir::arith::MinUIOp,
|
||||||
mlir::arith::IndexCastOp,
|
mlir::arith::RemUIOp,
|
||||||
mlir::memref::AllocOp,
|
mlir::arith::RemSIOp,
|
||||||
mlir::memref::SubViewOp,
|
mlir::arith::IndexCastOp,
|
||||||
mlir::memref::CastOp,
|
mlir::arith::CmpIOp,
|
||||||
mlir::memref::CollapseShapeOp,
|
mlir::memref::AllocOp,
|
||||||
mlir::memref::ExpandShapeOp>(op);
|
mlir::memref::SubViewOp,
|
||||||
|
mlir::memref::CastOp,
|
||||||
|
mlir::memref::CollapseShapeOp,
|
||||||
|
mlir::memref::ExpandShapeOp>(op))
|
||||||
|
return true;
|
||||||
|
|
||||||
|
if (auto selectOp = mlir::dyn_cast<mlir::arith::SelectOp>(op))
|
||||||
|
return selectOp.getType().isIntOrIndex();
|
||||||
|
|
||||||
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
mlir::LogicalResult
|
mlir::LogicalResult
|
||||||
@@ -30,6 +42,9 @@ walkPimCoreBlock(mlir::Block& block,
|
|||||||
for (mlir::Operation& op : block) {
|
for (mlir::Operation& op : block) {
|
||||||
if (mlir::isa<pim::PimHaltOp, mlir::scf::YieldOp>(op) || isCoreStaticAddressOp(&op))
|
if (mlir::isa<pim::PimHaltOp, mlir::scf::YieldOp>(op) || isCoreStaticAddressOp(&op))
|
||||||
continue;
|
continue;
|
||||||
|
if (auto loadOp = mlir::dyn_cast<mlir::memref::LoadOp>(op);
|
||||||
|
loadOp && succeeded(resolveIndexValue(loadOp.getResult(), knowledge)))
|
||||||
|
continue;
|
||||||
|
|
||||||
if (auto forOp = mlir::dyn_cast<mlir::scf::ForOp>(op)) {
|
if (auto forOp = mlir::dyn_cast<mlir::scf::ForOp>(op)) {
|
||||||
mlir::Block& loopBody = forOp.getRegion().front();
|
mlir::Block& loopBody = forOp.getRegion().front();
|
||||||
@@ -65,4 +80,58 @@ walkPimCoreBlock(mlir::Block& block,
|
|||||||
return mlir::success(!hasFailure);
|
return mlir::success(!hasFailure);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
mlir::LogicalResult walkPimCoreBlockStructurally(
|
||||||
|
mlir::Block& block,
|
||||||
|
const StaticValueKnowledge& knowledge,
|
||||||
|
llvm::function_ref<mlir::LogicalResult(mlir::Operation&, const StaticValueKnowledge&)> callback) {
|
||||||
|
bool hasFailure = false;
|
||||||
|
for (mlir::Operation& op : block) {
|
||||||
|
if (mlir::isa<pim::PimHaltOp, mlir::scf::YieldOp>(op) || isCoreStaticAddressOp(&op))
|
||||||
|
continue;
|
||||||
|
if (auto loadOp = mlir::dyn_cast<mlir::memref::LoadOp>(op);
|
||||||
|
loadOp && succeeded(resolveIndexValue(loadOp.getResult(), knowledge)))
|
||||||
|
continue;
|
||||||
|
|
||||||
|
if (auto forOp = mlir::dyn_cast<mlir::scf::ForOp>(op)) {
|
||||||
|
mlir::Block& loopBody = forOp.getRegion().front();
|
||||||
|
auto lowerBound = resolveIndexValue(forOp.getLowerBound(), knowledge);
|
||||||
|
auto upperBound = resolveIndexValue(forOp.getUpperBound(), knowledge);
|
||||||
|
auto step = resolveIndexValue(forOp.getStep(), knowledge);
|
||||||
|
if (failed(lowerBound) || failed(upperBound) || failed(step)) {
|
||||||
|
forOp.emitOpError("requires statically evaluable scf.for bounds for PIM verification");
|
||||||
|
hasFailure = true;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if (*step <= 0) {
|
||||||
|
forOp.emitOpError("requires positive scf.for step for PIM verification");
|
||||||
|
hasFailure = true;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
llvm::SmallVector<int64_t, 2> samples;
|
||||||
|
if (*lowerBound < *upperBound) {
|
||||||
|
samples.push_back(*lowerBound);
|
||||||
|
int64_t last = *lowerBound + ((*upperBound - 1 - *lowerBound) / *step) * *step;
|
||||||
|
if (last != *lowerBound)
|
||||||
|
samples.push_back(last);
|
||||||
|
}
|
||||||
|
|
||||||
|
for (int64_t inductionValue : samples) {
|
||||||
|
StaticValueKnowledge loopKnowledge = knowledge;
|
||||||
|
loopKnowledge.indexValues[forOp.getInductionVar()] = inductionValue;
|
||||||
|
for (auto [iterArg, iterValue] : llvm::zip_equal(forOp.getRegionIterArgs(), forOp.getInitArgs()))
|
||||||
|
loopKnowledge.aliases[iterArg] = iterValue;
|
||||||
|
|
||||||
|
if (failed(walkPimCoreBlockStructurally(loopBody, loopKnowledge, callback)))
|
||||||
|
hasFailure = true;
|
||||||
|
}
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (failed(callback(op, knowledge)))
|
||||||
|
hasFailure = true;
|
||||||
|
}
|
||||||
|
return mlir::success(!hasFailure);
|
||||||
|
}
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -21,4 +21,13 @@ walkPimCoreBlock(mlir::Block& block,
|
|||||||
const StaticValueKnowledge& knowledge,
|
const StaticValueKnowledge& knowledge,
|
||||||
llvm::function_ref<mlir::LogicalResult(mlir::Operation&, const StaticValueKnowledge&)> callback);
|
llvm::function_ref<mlir::LogicalResult(mlir::Operation&, const StaticValueKnowledge&)> callback);
|
||||||
|
|
||||||
|
/// Walks a `pim.core`-like body structurally for verification without
|
||||||
|
/// enumerating full loop trip counts. Loop bounds must still be statically
|
||||||
|
/// evaluable so address resolution remains well-defined.
|
||||||
|
mlir::LogicalResult
|
||||||
|
walkPimCoreBlockStructurally(mlir::Block& block,
|
||||||
|
const StaticValueKnowledge& knowledge,
|
||||||
|
llvm::function_ref<mlir::LogicalResult(mlir::Operation&, const StaticValueKnowledge&)>
|
||||||
|
callback);
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -1,4 +1,5 @@
|
|||||||
#include "llvm/ADT/STLExtras.h"
|
#include "llvm/ADT/STLExtras.h"
|
||||||
|
#include "llvm/Support/ErrorHandling.h"
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
||||||
|
|
||||||
@@ -35,6 +36,30 @@ int64_t getNumElements(llvm::ArrayRef<int64_t> shape) {
|
|||||||
return numElements;
|
return numElements;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
bool hasByteSizedElementType(mlir::Type elementType) {
|
||||||
|
if (mlir::isa<mlir::IndexType>(elementType))
|
||||||
|
return true;
|
||||||
|
if (auto intType = mlir::dyn_cast<mlir::IntegerType>(elementType))
|
||||||
|
return intType.getWidth() > 0 && intType.getWidth() % 8 == 0;
|
||||||
|
if (auto floatType = mlir::dyn_cast<mlir::FloatType>(elementType))
|
||||||
|
return floatType.getWidth() > 0 && floatType.getWidth() % 8 == 0;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
size_t getElementTypeSizeInBytes(mlir::Type elementType) {
|
||||||
|
if (mlir::isa<mlir::IndexType>(elementType))
|
||||||
|
return mlir::IndexType::kInternalStorageBitWidth / 8;
|
||||||
|
if (auto intType = mlir::dyn_cast<mlir::IntegerType>(elementType))
|
||||||
|
return static_cast<size_t>(intType.getWidth() / 8);
|
||||||
|
if (auto floatType = mlir::dyn_cast<mlir::FloatType>(elementType))
|
||||||
|
return static_cast<size_t>(floatType.getWidth() / 8);
|
||||||
|
llvm_unreachable("expected byte-sized integer, float, or index element type");
|
||||||
|
}
|
||||||
|
|
||||||
|
size_t getShapedTypeSizeInBytes(mlir::ShapedType shapedType) {
|
||||||
|
return static_cast<size_t>(shapedType.getNumElements()) * getElementTypeSizeInBytes(shapedType.getElementType());
|
||||||
|
}
|
||||||
|
|
||||||
bool isMemoryContiguous(llvm::ArrayRef<int64_t> srcShape,
|
bool isMemoryContiguous(llvm::ArrayRef<int64_t> srcShape,
|
||||||
llvm::ArrayRef<int64_t> offsets,
|
llvm::ArrayRef<int64_t> offsets,
|
||||||
llvm::ArrayRef<int64_t> sizes,
|
llvm::ArrayRef<int64_t> sizes,
|
||||||
|
|||||||
@@ -1,8 +1,13 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
|
#include "mlir/IR/BuiltinTypes.h"
|
||||||
|
#include "mlir/IR/Value.h"
|
||||||
|
|
||||||
#include "llvm/ADT/ArrayRef.h"
|
#include "llvm/ADT/ArrayRef.h"
|
||||||
#include "llvm/ADT/SmallVector.h"
|
#include "llvm/ADT/SmallVector.h"
|
||||||
|
|
||||||
|
#include <cstddef>
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
|
|
||||||
llvm::SmallVector<int64_t> computeRowMajorStrides(llvm::ArrayRef<int64_t> shape);
|
llvm::SmallVector<int64_t> computeRowMajorStrides(llvm::ArrayRef<int64_t> shape);
|
||||||
@@ -14,6 +19,12 @@ int64_t linearizeIndex(llvm::ArrayRef<int64_t> indices, llvm::ArrayRef<int64_t>
|
|||||||
|
|
||||||
int64_t getNumElements(llvm::ArrayRef<int64_t> shape);
|
int64_t getNumElements(llvm::ArrayRef<int64_t> shape);
|
||||||
|
|
||||||
|
bool hasByteSizedElementType(mlir::Type elementType);
|
||||||
|
|
||||||
|
size_t getElementTypeSizeInBytes(mlir::Type elementType);
|
||||||
|
|
||||||
|
size_t getShapedTypeSizeInBytes(mlir::ShapedType shapedType);
|
||||||
|
|
||||||
bool isMemoryContiguous(llvm::ArrayRef<int64_t> srcShape,
|
bool isMemoryContiguous(llvm::ArrayRef<int64_t> srcShape,
|
||||||
llvm::ArrayRef<int64_t> offsets,
|
llvm::ArrayRef<int64_t> offsets,
|
||||||
llvm::ArrayRef<int64_t> sizes,
|
llvm::ArrayRef<int64_t> sizes,
|
||||||
|
|||||||
@@ -19,29 +19,35 @@ void markWeightAlways(mlir::Operation* op) {
|
|||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
template <typename MVMOpTy, typename VMMOpTy, typename ParentOpTy>
|
template <typename VMMOpTy, typename ParentOpTy>
|
||||||
bool hasMvmVmmWeightUse(ParentOpTy parentOp, unsigned weightIndex) {
|
bool hasVmmWeightUse(ParentOpTy parentOp, unsigned weightIndex) {
|
||||||
|
auto weightArg = parentOp.getWeightArgument(weightIndex);
|
||||||
|
if (!weightArg)
|
||||||
|
return false;
|
||||||
bool found = false;
|
bool found = false;
|
||||||
parentOp.walk([&](mlir::Operation* op) {
|
parentOp.walk([&](mlir::Operation* op) {
|
||||||
if (auto mvmOp = mlir::dyn_cast<MVMOpTy>(op))
|
if (auto vmmOp = mlir::dyn_cast<VMMOpTy>(op))
|
||||||
found |= mvmOp.getWeightIndex() == weightIndex;
|
found |= vmmOp.getWeight() == *weightArg;
|
||||||
else if (auto vmmOp = mlir::dyn_cast<VMMOpTy>(op))
|
|
||||||
found |= vmmOp.getWeightIndex() == weightIndex;
|
|
||||||
});
|
});
|
||||||
return found;
|
return found;
|
||||||
}
|
}
|
||||||
|
|
||||||
template <typename MVMOpTy, typename VMMOpTy, typename ParentOpTy>
|
template <typename VMMOpTy, typename ParentOpTy>
|
||||||
void walkMvmVmmWeightUses(ParentOpTy parentOp, llvm::function_ref<void(mlir::OpOperand&)> callback) {
|
void walkVmmWeightUses(ParentOpTy parentOp, llvm::function_ref<void(mlir::OpOperand&)> callback) {
|
||||||
auto weights = parentOp.getWeights();
|
auto weights = parentOp.getWeights();
|
||||||
llvm::SmallSet<unsigned, 8> visited;
|
llvm::SmallSet<unsigned, 8> visited;
|
||||||
auto walkWeightIndex = [&](unsigned weightIndex) {
|
auto walkWeight = [&](mlir::Value weight) {
|
||||||
if (weightIndex < weights.size() && visited.insert(weightIndex).second)
|
for (unsigned weightIndex = 0; weightIndex < weights.size(); ++weightIndex) {
|
||||||
callback(parentOp->getOpOperand(weightIndex));
|
auto weightArg = parentOp.getWeightArgument(weightIndex);
|
||||||
|
if (!weightArg || *weightArg != weight)
|
||||||
|
continue;
|
||||||
|
if (visited.insert(weightIndex).second)
|
||||||
|
callback(parentOp->getOpOperand(weightIndex));
|
||||||
|
break;
|
||||||
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
parentOp.walk([&](MVMOpTy op) { walkWeightIndex(op.getWeightIndex()); });
|
parentOp.walk([&](VMMOpTy op) { walkWeight(op.getWeight()); });
|
||||||
parentOp.walk([&](VMMOpTy op) { walkWeightIndex(op.getWeightIndex()); });
|
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
@@ -54,7 +60,7 @@ bool isSpatialMvmVmmWeightUse(mlir::OpOperand& use) {
|
|||||||
if (!computeOp || operandIndex >= computeOp.getWeights().size())
|
if (!computeOp || operandIndex >= computeOp.getWeights().size())
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
return hasMvmVmmWeightUse<spatial::SpatMVMOp, spatial::SpatVMMOp>(computeOp, operandIndex);
|
return hasVmmWeightUse<spatial::SpatVMMOp>(computeOp, operandIndex);
|
||||||
}
|
}
|
||||||
|
|
||||||
bool hasOnlySpatialMvmVmmWeightUses(mlir::Value value) {
|
bool hasOnlySpatialMvmVmmWeightUses(mlir::Value value) {
|
||||||
@@ -90,19 +96,40 @@ void walkPimMvmVmmWeightUses(mlir::Operation* root, llvm::function_ref<void(mlir
|
|||||||
assert(root && "expected valid root op");
|
assert(root && "expected valid root op");
|
||||||
root->walk([&](pim::PimCoreOp coreOp) {
|
root->walk([&](pim::PimCoreOp coreOp) {
|
||||||
coreOp.walk([&](pim::PimVMMOp vmmOp) {
|
coreOp.walk([&](pim::PimVMMOp vmmOp) {
|
||||||
auto weights = coreOp.getWeights();
|
for (unsigned weightIndex = 0; weightIndex < coreOp.getWeights().size(); ++weightIndex)
|
||||||
unsigned weightIndex = vmmOp.getWeightIndex();
|
if (coreOp.getWeightArgument(weightIndex) == vmmOp.getWeight()) {
|
||||||
if (weightIndex < weights.size())
|
callback(coreOp->getOpOperand(weightIndex));
|
||||||
callback(coreOp->getOpOperand(weightIndex));
|
break;
|
||||||
|
}
|
||||||
});
|
});
|
||||||
});
|
});
|
||||||
root->walk([&](pim::PimCoreBatchOp coreBatchOp) {
|
root->walk([&](pim::PimCoreBatchOp coreBatchOp) {
|
||||||
auto weights = coreBatchOp.getWeights();
|
coreBatchOp.walk([&](pim::PimVMMOp vmmOp) {
|
||||||
for (auto weight : weights)
|
for (unsigned weightIndex = 0; weightIndex < coreBatchOp.getWeights().size(); ++weightIndex)
|
||||||
for (mlir::OpOperand& use : weight.getUses())
|
if (coreBatchOp.getWeightArgument(weightIndex) == vmmOp.getWeight()) {
|
||||||
if (use.getOwner() == coreBatchOp.getOperation())
|
callback(coreBatchOp->getOpOperand(weightIndex));
|
||||||
callback(use);
|
break;
|
||||||
|
}
|
||||||
|
});
|
||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
|
std::optional<unsigned> resolveWeightIndex(mlir::Operation* weightOwner, pim::PimVMMOp vmmOp) {
|
||||||
|
if (auto coreOp = mlir::dyn_cast_or_null<pim::PimCoreOp>(weightOwner)) {
|
||||||
|
for (unsigned weightIndex = 0; weightIndex < coreOp.getWeights().size(); ++weightIndex)
|
||||||
|
if (coreOp.getWeightArgument(weightIndex) == vmmOp.getWeight())
|
||||||
|
return weightIndex;
|
||||||
|
return std::nullopt;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (auto coreBatchOp = mlir::dyn_cast_or_null<pim::PimCoreBatchOp>(weightOwner)) {
|
||||||
|
for (unsigned weightIndex = 0; weightIndex < coreBatchOp.getWeights().size(); ++weightIndex)
|
||||||
|
if (coreBatchOp.getWeightArgument(weightIndex) == vmmOp.getWeight())
|
||||||
|
return weightIndex;
|
||||||
|
return std::nullopt;
|
||||||
|
}
|
||||||
|
|
||||||
|
return std::nullopt;
|
||||||
|
}
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -3,9 +3,15 @@
|
|||||||
#include "mlir/IR/Operation.h"
|
#include "mlir/IR/Operation.h"
|
||||||
#include "mlir/IR/Value.h"
|
#include "mlir/IR/Value.h"
|
||||||
|
|
||||||
|
#include "llvm/ADT/SmallVector.h"
|
||||||
|
#include "llvm/ADT/STLExtras.h"
|
||||||
#include "llvm/ADT/STLFunctionalExtras.h"
|
#include "llvm/ADT/STLFunctionalExtras.h"
|
||||||
#include "llvm/ADT/StringRef.h"
|
#include "llvm/ADT/StringRef.h"
|
||||||
|
|
||||||
|
#include <optional>
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
|
||||||
inline constexpr llvm::StringRef PimWeightAlwaysAttrName = "weightAlways";
|
inline constexpr llvm::StringRef PimWeightAlwaysAttrName = "weightAlways";
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
@@ -26,4 +32,24 @@ bool hasOnlySpatialMvmVmmWeightUses(mlir::Value value);
|
|||||||
/// passes can identify globals that must remain weight-backed.
|
/// passes can identify globals that must remain weight-backed.
|
||||||
void walkPimMvmVmmWeightUses(mlir::Operation* root, llvm::function_ref<void(mlir::OpOperand&)> callback);
|
void walkPimMvmVmmWeightUses(mlir::Operation* root, llvm::function_ref<void(mlir::OpOperand&)> callback);
|
||||||
|
|
||||||
|
template <typename CoreLikeOpTy>
|
||||||
|
llvm::SmallVector<unsigned, 8> getUsedWeightIndices(CoreLikeOpTy coreLikeOp) {
|
||||||
|
llvm::SmallVector<unsigned, 8> indices;
|
||||||
|
auto addWeight = [&](mlir::Value weight) {
|
||||||
|
for (unsigned weightIndex = 0; weightIndex < coreLikeOp.getWeights().size(); ++weightIndex) {
|
||||||
|
if (coreLikeOp.getWeightArgument(weightIndex) != weight)
|
||||||
|
continue;
|
||||||
|
if (!llvm::is_contained(indices, weightIndex))
|
||||||
|
indices.push_back(weightIndex);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
|
coreLikeOp.walk([&](pim::PimVMMOp vmmOp) { addWeight(vmmOp.getWeight()); });
|
||||||
|
llvm::sort(indices);
|
||||||
|
return indices;
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<unsigned> resolveWeightIndex(mlir::Operation* weightOwner, pim::PimVMMOp vmmOp);
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -12,6 +12,7 @@
|
|||||||
#include "llvm/ADT/StringRef.h"
|
#include "llvm/ADT/StringRef.h"
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/IR/AddressAnalysis.hpp"
|
#include "src/Accelerators/PIM/Common/IR/AddressAnalysis.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Common/IR/ConstantUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/CoreBlockUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/CoreBlockUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/EntryPointUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/EntryPointUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
||||||
|
|||||||
@@ -13,7 +13,8 @@
|
|||||||
namespace onnx_mlir::pim {
|
namespace onnx_mlir::pim {
|
||||||
|
|
||||||
struct CappedDiagnosticReporter {
|
struct CappedDiagnosticReporter {
|
||||||
explicit CappedDiagnosticReporter(int64_t maxReportedFailures = 8) : maxReportedFailures(maxReportedFailures) {}
|
explicit CappedDiagnosticReporter(int64_t maxReportedFailures = 8)
|
||||||
|
: maxReportedFailures(maxReportedFailures) {}
|
||||||
|
|
||||||
template <typename EmitFn>
|
template <typename EmitFn>
|
||||||
void report(mlir::Operation* op, EmitFn&& emit) {
|
void report(mlir::Operation* op, EmitFn&& emit) {
|
||||||
@@ -24,8 +25,7 @@ struct CappedDiagnosticReporter {
|
|||||||
|
|
||||||
void emitSuppressedSummary(mlir::Operation* op, llvm::StringRef failureDescription) const {
|
void emitSuppressedSummary(mlir::Operation* op, llvm::StringRef failureDescription) const {
|
||||||
if (numFailures > maxReportedFailures)
|
if (numFailures > maxReportedFailures)
|
||||||
op->emitError() << "suppressed " << (numFailures - maxReportedFailures) << " additional "
|
op->emitError() << "suppressed " << (numFailures - maxReportedFailures) << " additional " << failureDescription;
|
||||||
<< failureDescription;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
bool hasFailure() const { return numFailures != 0; }
|
bool hasFailure() const { return numFailures != 0; }
|
||||||
|
|||||||
@@ -16,7 +16,6 @@ add_pim_library(OMPimCompilerOptions
|
|||||||
add_pim_library(OMPimCompilerUtils
|
add_pim_library(OMPimCompilerUtils
|
||||||
PimCompilerUtils.cpp
|
PimCompilerUtils.cpp
|
||||||
PimArtifactWriter.cpp
|
PimArtifactWriter.cpp
|
||||||
PimBatchEmission.cpp
|
|
||||||
PimCodeGen.cpp
|
PimCodeGen.cpp
|
||||||
PimWeightEmitter.cpp
|
PimWeightEmitter.cpp
|
||||||
|
|
||||||
|
|||||||
@@ -48,7 +48,7 @@ writeMemoryBinary(ModuleOp moduleOp, func::FuncOp funcOp, PimAcceleratorMemory&
|
|||||||
if (!denseAttr)
|
if (!denseAttr)
|
||||||
return;
|
return;
|
||||||
|
|
||||||
MemEntry memEntry = memory.hostMem.getMemEntry(getGlobalOp.getResult());
|
MemEntry memEntry = memory.hostMem.getMemEntry({getGlobalOp.getResult(), std::nullopt});
|
||||||
ArrayRef<char> rawData = denseAttr.getRawData();
|
ArrayRef<char> rawData = denseAttr.getRawData();
|
||||||
char* dst = memoryBuffer.data() + memEntry.address;
|
char* dst = memoryBuffer.data() + memEntry.address;
|
||||||
|
|
||||||
|
|||||||
@@ -1,136 +0,0 @@
|
|||||||
#include "mlir/IR/Builders.h"
|
|
||||||
#include "mlir/IR/BuiltinOps.h"
|
|
||||||
#include "mlir/IR/IRMapping.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Compiler/PimBatchEmission.hpp"
|
|
||||||
|
|
||||||
using namespace mlir;
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
static SmallVector<int32_t> getBatchCoreIds(pim::PimCoreBatchOp coreBatchOp) {
|
|
||||||
auto coreIdsAttr = coreBatchOp->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName);
|
|
||||||
assert(coreIdsAttr && "pim.core_batch requires coreIds array attribute");
|
|
||||||
return SmallVector<int32_t>(coreIdsAttr.asArrayRef().begin(), coreIdsAttr.asArrayRef().end());
|
|
||||||
}
|
|
||||||
|
|
||||||
static SmallVector<int32_t> getLaneChunkCoreIds(ArrayRef<int32_t> coreIds, size_t laneCount, unsigned lane) {
|
|
||||||
SmallVector<int32_t> laneCoreIds;
|
|
||||||
laneCoreIds.reserve(coreIds.size() / laneCount);
|
|
||||||
for (size_t chunkIndex = 0; chunkIndex < coreIds.size() / laneCount; ++chunkIndex)
|
|
||||||
laneCoreIds.push_back(coreIds[chunkIndex * laneCount + lane]);
|
|
||||||
return laneCoreIds;
|
|
||||||
}
|
|
||||||
|
|
||||||
static void scalarizeBatchOpsInCore(pim::PimCoreOp scalarCore, size_t laneCount, unsigned lane) {
|
|
||||||
IRRewriter rewriter(scalarCore.getContext());
|
|
||||||
SmallVector<Operation*> batchOps;
|
|
||||||
scalarCore.walk([&](Operation* op) {
|
|
||||||
if (isa<pim::PimSendBatchOp,
|
|
||||||
pim::PimSendTensorBatchOp,
|
|
||||||
pim::PimReceiveBatchOp,
|
|
||||||
pim::PimReceiveTensorBatchOp,
|
|
||||||
pim::PimMemCopyHostToDevBatchOp>(op)) {
|
|
||||||
batchOps.push_back(op);
|
|
||||||
}
|
|
||||||
});
|
|
||||||
|
|
||||||
for (Operation* op : batchOps) {
|
|
||||||
rewriter.setInsertionPoint(op);
|
|
||||||
|
|
||||||
if (auto sendBatchOp = dyn_cast<pim::PimSendBatchOp>(op)) {
|
|
||||||
pim::PimSendOp::create(rewriter,
|
|
||||||
sendBatchOp.getLoc(),
|
|
||||||
sendBatchOp.getInput(),
|
|
||||||
sendBatchOp.getSizeAttr(),
|
|
||||||
rewriter.getI32IntegerAttr(sendBatchOp.getTargetCoreIds()[lane]));
|
|
||||||
rewriter.eraseOp(op);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (auto sendTensorBatchOp = dyn_cast<pim::PimSendTensorBatchOp>(op)) {
|
|
||||||
pim::PimSendTensorOp::create(
|
|
||||||
rewriter,
|
|
||||||
sendTensorBatchOp.getLoc(),
|
|
||||||
sendTensorBatchOp.getInput(),
|
|
||||||
rewriter.getDenseI32ArrayAttr(getLaneChunkCoreIds(sendTensorBatchOp.getTargetCoreIds(), laneCount, lane)));
|
|
||||||
rewriter.eraseOp(op);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (auto receiveBatchOp = dyn_cast<pim::PimReceiveBatchOp>(op)) {
|
|
||||||
auto scalarReceive =
|
|
||||||
pim::PimReceiveOp::create(rewriter,
|
|
||||||
receiveBatchOp.getLoc(),
|
|
||||||
receiveBatchOp.getOutput().getType(),
|
|
||||||
receiveBatchOp.getOutputBuffer(),
|
|
||||||
receiveBatchOp.getSizeAttr(),
|
|
||||||
rewriter.getI32IntegerAttr(receiveBatchOp.getSourceCoreIds()[lane]));
|
|
||||||
rewriter.replaceOp(op, scalarReceive->getResults());
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (auto receiveTensorBatchOp = dyn_cast<pim::PimReceiveTensorBatchOp>(op)) {
|
|
||||||
auto scalarReceive = pim::PimReceiveTensorOp::create(
|
|
||||||
rewriter,
|
|
||||||
receiveTensorBatchOp.getLoc(),
|
|
||||||
receiveTensorBatchOp.getOutput().getType(),
|
|
||||||
receiveTensorBatchOp.getOutputBuffer(),
|
|
||||||
rewriter.getDenseI32ArrayAttr(getLaneChunkCoreIds(receiveTensorBatchOp.getSourceCoreIds(), laneCount, lane)));
|
|
||||||
rewriter.replaceOp(op, scalarReceive->getResults());
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
auto memcpBatchOp = cast<pim::PimMemCopyHostToDevBatchOp>(op);
|
|
||||||
auto scalarCopy = pim::PimMemCopyHostToDevOp::create(rewriter,
|
|
||||||
memcpBatchOp.getLoc(),
|
|
||||||
memcpBatchOp.getOutput().getType(),
|
|
||||||
memcpBatchOp.getDeviceTarget(),
|
|
||||||
memcpBatchOp.getHostSource(),
|
|
||||||
memcpBatchOp.getDeviceTargetOffsetAttr(),
|
|
||||||
memcpBatchOp.getHostSourceOffsetAttr(),
|
|
||||||
memcpBatchOp.getSizeAttr());
|
|
||||||
rewriter.replaceOp(op, scalarCopy->getResults());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace
|
|
||||||
|
|
||||||
LogicalResult withScalarCoreFromBatchLane(pim::PimCoreBatchOp coreBatchOp,
|
|
||||||
unsigned lane,
|
|
||||||
llvm::function_ref<LogicalResult(pim::PimCoreOp)> callback) {
|
|
||||||
OwningOpRef<ModuleOp> scratchModule = ModuleOp::create(coreBatchOp.getLoc());
|
|
||||||
OpBuilder builder(scratchModule->getContext());
|
|
||||||
builder.setInsertionPointToStart(scratchModule->getBody());
|
|
||||||
|
|
||||||
size_t laneCount = static_cast<size_t>(coreBatchOp.getLaneCount());
|
|
||||||
size_t weightsPerLane = coreBatchOp.getWeights().size() / laneCount;
|
|
||||||
SmallVector<Value> laneWeights;
|
|
||||||
laneWeights.reserve(weightsPerLane);
|
|
||||||
for (size_t weightIndex = 0; weightIndex < weightsPerLane; ++weightIndex)
|
|
||||||
laneWeights.push_back(coreBatchOp.getWeights()[lane * weightsPerLane + weightIndex]);
|
|
||||||
|
|
||||||
auto coreIds = getBatchCoreIds(coreBatchOp);
|
|
||||||
auto scalarCore = pim::PimCoreOp::create(
|
|
||||||
builder, coreBatchOp.getLoc(), ValueRange(laneWeights), builder.getI32IntegerAttr(coreIds[lane]));
|
|
||||||
Block* block = builder.createBlock(&scalarCore.getBody(), scalarCore.getBody().end());
|
|
||||||
IRMapping mapper;
|
|
||||||
if (coreBatchOp.getBody().front().getNumArguments() == 1)
|
|
||||||
mapper.map(coreBatchOp.getBody().front().getArgument(0), coreBatchOp.getInputs()[lane]);
|
|
||||||
|
|
||||||
builder.setInsertionPointToEnd(block);
|
|
||||||
for (Operation& op : coreBatchOp.getBody().front()) {
|
|
||||||
Operation* cloned = builder.clone(op, mapper);
|
|
||||||
for (auto [originalResult, clonedResult] : llvm::zip(op.getResults(), cloned->getResults()))
|
|
||||||
mapper.map(originalResult, clonedResult);
|
|
||||||
}
|
|
||||||
|
|
||||||
if (block->empty() || !isa<pim::PimHaltOp>(block->back()))
|
|
||||||
pim::PimHaltOp::create(builder, coreBatchOp.getLoc());
|
|
||||||
scalarizeBatchOpsInCore(scalarCore, laneCount, lane);
|
|
||||||
return callback(scalarCore);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -1,13 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "llvm/ADT/STLFunctionalExtras.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
mlir::LogicalResult withScalarCoreFromBatchLane(pim::PimCoreBatchOp coreBatchOp,
|
|
||||||
unsigned lane,
|
|
||||||
llvm::function_ref<mlir::LogicalResult(pim::PimCoreOp)> callback);
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
+639
-250
File diff suppressed because it is too large
Load Diff
@@ -4,13 +4,16 @@
|
|||||||
|
|
||||||
#include "llvm-project/clang/include/clang/Basic/LLVM.h"
|
#include "llvm-project/clang/include/clang/Basic/LLVM.h"
|
||||||
#include "llvm/ADT/DenseMap.h"
|
#include "llvm/ADT/DenseMap.h"
|
||||||
|
#include "llvm/ADT/Hashing.h"
|
||||||
#include "llvm/Support/JSON.h"
|
#include "llvm/Support/JSON.h"
|
||||||
#include "llvm/Support/raw_os_ostream.h"
|
#include "llvm/Support/raw_os_ostream.h"
|
||||||
|
|
||||||
#include <fstream>
|
#include <fstream>
|
||||||
|
#include <limits>
|
||||||
#include <optional>
|
#include <optional>
|
||||||
|
|
||||||
#include "onnx-mlir/Compiler/OMCompilerTypes.h"
|
#include "onnx-mlir/Compiler/OMCompilerTypes.h"
|
||||||
|
#include "src/Accelerators/PIM/Common/IR/AddressAnalysis.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/Support/ReportUtils.hpp"
|
#include "src/Accelerators/PIM/Common/Support/ReportUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimBinaryFormat.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimBinaryFormat.hpp"
|
||||||
@@ -23,6 +26,13 @@ struct MemEntry {
|
|||||||
size_t size;
|
size_t size;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
struct MemoryValueKey {
|
||||||
|
mlir::Value value;
|
||||||
|
std::optional<unsigned> lane;
|
||||||
|
|
||||||
|
bool operator==(const MemoryValueKey& other) const { return value == other.value && lane == other.lane; }
|
||||||
|
};
|
||||||
|
|
||||||
struct MemoryReportRow {
|
struct MemoryReportRow {
|
||||||
uint64_t numAlloca = 0;
|
uint64_t numAlloca = 0;
|
||||||
uint64_t sizeAlloca = 0;
|
uint64_t sizeAlloca = 0;
|
||||||
@@ -50,33 +60,33 @@ struct MemoryReportEntry {
|
|||||||
};
|
};
|
||||||
|
|
||||||
class PimMemory {
|
class PimMemory {
|
||||||
llvm::SmallVector<std::pair<MemEntry, mlir::Value>, 32> memEntries;
|
llvm::SmallVector<std::pair<MemEntry, MemoryValueKey>, 32> memEntries;
|
||||||
llvm::SmallDenseMap<mlir::Value, MemEntry, 32>& globalMemEntriesMap;
|
llvm::SmallDenseMap<MemoryValueKey, MemEntry, 32>& globalMemEntriesMap;
|
||||||
llvm::SmallDenseMap<mlir::Value, MemEntry, 32> ownedMemEntriesMap;
|
llvm::SmallDenseMap<MemoryValueKey, MemEntry, 32> ownedMemEntriesMap;
|
||||||
|
|
||||||
size_t minAlignment = 4;
|
size_t minAlignment = 4;
|
||||||
size_t firstAvailableAddress = 0;
|
size_t firstAvailableAddress = 0;
|
||||||
|
|
||||||
MemEntry* gatherMemEntry(mlir::Value value);
|
MemEntry* gatherMemEntry(mlir::Value value, std::optional<unsigned> lane = std::nullopt);
|
||||||
void allocateGatheredMemory();
|
void allocateGatheredMemory();
|
||||||
void allocateMemoryForValue(mlir::Value value, MemEntry& memEntry);
|
void allocateMemoryForValue(const MemoryValueKey& key, MemEntry& memEntry);
|
||||||
|
|
||||||
public:
|
public:
|
||||||
PimMemory(llvm::SmallDenseMap<mlir::Value, MemEntry, 32>& globalMemEntriesMap)
|
PimMemory(llvm::SmallDenseMap<MemoryValueKey, MemEntry, 32>& globalMemEntriesMap)
|
||||||
: globalMemEntriesMap(globalMemEntriesMap) {}
|
: globalMemEntriesMap(globalMemEntriesMap) {}
|
||||||
|
|
||||||
void allocateHost(mlir::ModuleOp moduleOp, mlir::func::FuncOp funcOp);
|
void allocateHost(mlir::ModuleOp moduleOp, mlir::func::FuncOp funcOp);
|
||||||
void allocateCore(mlir::Operation* op);
|
void allocateCore(mlir::Operation* op, std::optional<unsigned> lane = std::nullopt);
|
||||||
MemoryReportRow getReportRow() const;
|
MemoryReportRow getReportRow() const;
|
||||||
void remove(mlir::Value val);
|
void remove(mlir::Value val);
|
||||||
|
|
||||||
size_t getFirstAvailableAddress() const { return firstAvailableAddress; }
|
size_t getFirstAvailableAddress() const { return firstAvailableAddress; }
|
||||||
MemEntry getMemEntry(mlir::Value value) const;
|
MemEntry getMemEntry(const MemoryValueKey& key) const;
|
||||||
};
|
};
|
||||||
|
|
||||||
class PimAcceleratorMemory {
|
class PimAcceleratorMemory {
|
||||||
public:
|
public:
|
||||||
llvm::SmallDenseMap<mlir::Value, MemEntry, 32> memEntriesMap;
|
llvm::SmallDenseMap<MemoryValueKey, MemEntry, 32> memEntriesMap;
|
||||||
PimMemory hostMem;
|
PimMemory hostMem;
|
||||||
|
|
||||||
private:
|
private:
|
||||||
@@ -84,14 +94,21 @@ private:
|
|||||||
std::fstream fileReport;
|
std::fstream fileReport;
|
||||||
std::optional<MemoryReportRow> hostReportRow;
|
std::optional<MemoryReportRow> hostReportRow;
|
||||||
llvm::SmallVector<MemoryReportEntry, 32> reportEntries;
|
llvm::SmallVector<MemoryReportEntry, 32> reportEntries;
|
||||||
|
mutable llvm::DenseMap<mlir::Value, CompiledIndexExpr> compiledIndexExprs;
|
||||||
|
mutable llvm::DenseMap<mlir::Value, CompiledAddressExpr> compiledAddressExprs;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
PimAcceleratorMemory()
|
PimAcceleratorMemory()
|
||||||
: hostMem(memEntriesMap), fileReport(openReportFile("memory_report")) {}
|
: hostMem(memEntriesMap), fileReport(openReportFile("memory_report")) {}
|
||||||
|
PimAcceleratorMemory(const llvm::SmallDenseMap<MemoryValueKey, MemEntry, 32>& initialMemEntries, bool enableReport)
|
||||||
|
: memEntriesMap(initialMemEntries), hostMem(memEntriesMap), fileReport(enableReport ? openReportFile("memory_report") : std::fstream()) {}
|
||||||
|
|
||||||
PimMemory& getOrCreateDeviceMem(size_t id);
|
PimMemory& getOrCreateDeviceMem(size_t id);
|
||||||
|
|
||||||
size_t getValueAddress(mlir::Value value, const StaticValueKnowledge& knowledge = {}) const;
|
size_t getValueAddress(mlir::Value value,
|
||||||
|
const StaticValueKnowledge& knowledge = {},
|
||||||
|
std::optional<unsigned> lane = std::nullopt) const;
|
||||||
|
llvm::FailureOr<int64_t> getIndexValue(mlir::Value value, const StaticValueKnowledge& knowledge = {}) const;
|
||||||
void reportHost();
|
void reportHost();
|
||||||
void recordCoreReport(size_t coreId, const MemoryReportRow& row);
|
void recordCoreReport(size_t coreId, const MemoryReportRow& row);
|
||||||
void recordBatchReport(uint64_t batchId,
|
void recordBatchReport(uint64_t batchId,
|
||||||
@@ -103,15 +120,24 @@ public:
|
|||||||
void clean(mlir::Operation* op);
|
void clean(mlir::Operation* op);
|
||||||
};
|
};
|
||||||
|
|
||||||
|
struct CoreEmissionJob {
|
||||||
|
mlir::Operation* coreLikeOp = nullptr;
|
||||||
|
size_t originalCoreId = 0;
|
||||||
|
size_t emittedCoreId = 0;
|
||||||
|
llvm::SmallVector<unsigned, 4> lanes;
|
||||||
|
std::optional<uint64_t> batchReportId;
|
||||||
|
};
|
||||||
|
|
||||||
class PimCodeGen {
|
class PimCodeGen {
|
||||||
PimAcceleratorMemory& memory;
|
PimAcceleratorMemory& memory;
|
||||||
llvm::raw_fd_ostream& coreBinaryStream;
|
llvm::raw_fd_ostream& coreBinaryStream;
|
||||||
llvm::raw_fd_ostream* coreJsonStream;
|
llvm::raw_fd_ostream* coreJsonStream;
|
||||||
const llvm::DenseMap<size_t, size_t>& emittedCoreIds;
|
const llvm::DenseMap<size_t, size_t>& emittedCoreIds;
|
||||||
|
std::optional<unsigned> batchLane;
|
||||||
mutable uint32_t emittedInstructionCount = 0;
|
mutable uint32_t emittedInstructionCount = 0;
|
||||||
|
|
||||||
size_t addressOf(mlir::Value value, const StaticValueKnowledge& knowledge) const {
|
size_t addressOf(mlir::Value value, const StaticValueKnowledge& knowledge) const {
|
||||||
return memory.getValueAddress(value, knowledge);
|
return memory.getValueAddress(value, knowledge, batchLane);
|
||||||
}
|
}
|
||||||
size_t remapCoreId(size_t coreId) const;
|
size_t remapCoreId(size_t coreId) const;
|
||||||
|
|
||||||
@@ -141,15 +167,18 @@ public:
|
|||||||
: memory(memory), coreBinaryStream(coreBinary), coreJsonStream(coreJson), emittedCoreIds(emittedCoreIds) {}
|
: memory(memory), coreBinaryStream(coreBinary), coreJsonStream(coreJson), emittedCoreIds(emittedCoreIds) {}
|
||||||
|
|
||||||
uint32_t getEmittedInstructionCount() const { return emittedInstructionCount; }
|
uint32_t getEmittedInstructionCount() const { return emittedInstructionCount; }
|
||||||
|
void setBatchLane(std::optional<unsigned> lane) { batchLane = lane; }
|
||||||
|
llvm::FailureOr<int64_t> indexOf(mlir::Value value, const StaticValueKnowledge& knowledge) const {
|
||||||
|
return memory.getIndexValue(value, knowledge);
|
||||||
|
}
|
||||||
|
|
||||||
void codeGenLoadOp(pim::PimMemCopyHostToDevOp loadOp, const StaticValueKnowledge& knowledge) const;
|
void codeGenLoadOp(pim::PimMemCopyHostToDevOp loadOp, const StaticValueKnowledge& knowledge) const;
|
||||||
|
void codeGenLoadBatchOp(pim::PimMemCopyHostToDevBatchOp loadOp, const StaticValueKnowledge& knowledge) const;
|
||||||
void codeGenStoreOp(pim::PimMemCopyDevToHostOp storeOp, const StaticValueKnowledge& knowledge) const;
|
void codeGenStoreOp(pim::PimMemCopyDevToHostOp storeOp, const StaticValueKnowledge& knowledge) const;
|
||||||
void codeGenLmvOp(pim::PimMemCopyOp lmvOp, const StaticValueKnowledge& knowledge) const;
|
void codeGenLmvOp(pim::PimMemCopyOp lmvOp, const StaticValueKnowledge& knowledge) const;
|
||||||
|
|
||||||
void codeGenReceiveOp(pim::PimReceiveOp receiveOp, const StaticValueKnowledge& knowledge) const;
|
void codeGenReceiveOp(pim::PimReceiveOp receiveOp, const StaticValueKnowledge& knowledge) const;
|
||||||
void codeGenReceiveTensorOp(pim::PimReceiveTensorOp receiveTensorOp, const StaticValueKnowledge& knowledge) const;
|
|
||||||
void codeGenSendOp(pim::PimSendOp sendOp, const StaticValueKnowledge& knowledge) const;
|
void codeGenSendOp(pim::PimSendOp sendOp, const StaticValueKnowledge& knowledge) const;
|
||||||
void codeGenSendTensorOp(pim::PimSendTensorOp sendTensorOp, const StaticValueKnowledge& knowledge) const;
|
|
||||||
void codeGenConcatOp(pim::PimConcatOp concatOp, const StaticValueKnowledge& knowledge) const;
|
void codeGenConcatOp(pim::PimConcatOp concatOp, const StaticValueKnowledge& knowledge) const;
|
||||||
|
|
||||||
template <typename MVMTy>
|
template <typename MVMTy>
|
||||||
@@ -172,3 +201,24 @@ public:
|
|||||||
OnnxMlirCompilerErrorCodes compileToPimCode(mlir::ModuleOp& moduleOpRef, std::string& outputDirName);
|
OnnxMlirCompilerErrorCodes compileToPimCode(mlir::ModuleOp& moduleOpRef, std::string& outputDirName);
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|
||||||
|
namespace llvm {
|
||||||
|
|
||||||
|
template <>
|
||||||
|
struct DenseMapInfo<onnx_mlir::MemoryValueKey> {
|
||||||
|
static onnx_mlir::MemoryValueKey getEmptyKey() {
|
||||||
|
return {DenseMapInfo<mlir::Value>::getEmptyKey(), 0};
|
||||||
|
}
|
||||||
|
|
||||||
|
static onnx_mlir::MemoryValueKey getTombstoneKey() {
|
||||||
|
return {DenseMapInfo<mlir::Value>::getTombstoneKey(), 0};
|
||||||
|
}
|
||||||
|
|
||||||
|
static unsigned getHashValue(const onnx_mlir::MemoryValueKey& key) {
|
||||||
|
return hash_combine(key.value, key.lane.value_or(std::numeric_limits<unsigned>::max()));
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isEqual(const onnx_mlir::MemoryValueKey& lhs, const onnx_mlir::MemoryValueKey& rhs) { return lhs == rhs; }
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace llvm
|
||||||
|
|||||||
@@ -1,7 +1,7 @@
|
|||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
|
||||||
|
|
||||||
#include "llvm/Support/ErrorHandling.h"
|
#include "llvm/Support/ErrorHandling.h"
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
||||||
|
|
||||||
#define DEBUG_TYPE "PimCompilerOptions"
|
#define DEBUG_TYPE "PimCompilerOptions"
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
@@ -15,13 +15,12 @@ llvm::cl::opt<PimEmissionTargetType> pimEmissionTarget(
|
|||||||
llvm::cl::init(EmitPimCodegen),
|
llvm::cl::init(EmitPimCodegen),
|
||||||
llvm::cl::cat(OnnxMlirOptions));
|
llvm::cl::cat(OnnxMlirOptions));
|
||||||
|
|
||||||
llvm::cl::opt<PimMergeSchedulerType> pimMergeScheduler(
|
llvm::cl::opt<PimMergeSchedulerType>
|
||||||
"pim-merge-scheduler",
|
pimMergeScheduler("pim-merge-scheduler",
|
||||||
llvm::cl::desc("Scheduler used by the Spatial merge-compute-nodes pass"),
|
llvm::cl::desc("Scheduler used by the Spatial merge-compute-nodes pass"),
|
||||||
llvm::cl::values(clEnumValN(MergeSchedulerPeft, "peft", "Use PEFT scheduling")),
|
llvm::cl::values(clEnumValN(MergeSchedulerPeft, "peft", "Use PEFT scheduling")),
|
||||||
llvm::cl::values(clEnumValN(MergeSchedulerDcp, "dcp", "Use the legacy DCP-inspired scheduler")),
|
llvm::cl::init(MergeSchedulerPeft),
|
||||||
llvm::cl::init(MergeSchedulerPeft),
|
llvm::cl::cat(OnnxMlirOptions));
|
||||||
llvm::cl::cat(OnnxMlirOptions));
|
|
||||||
|
|
||||||
llvm::cl::opt<bool>
|
llvm::cl::opt<bool>
|
||||||
pimOnlyCodegen("pim-only-codegen",
|
pimOnlyCodegen("pim-only-codegen",
|
||||||
@@ -49,12 +48,6 @@ llvm::cl::opt<long> coresCount("core-count",
|
|||||||
llvm::cl::desc("Number of cores in the chip. Required for PIM compilation."),
|
llvm::cl::desc("Number of cores in the chip. Required for PIM compilation."),
|
||||||
llvm::cl::init(-1));
|
llvm::cl::init(-1));
|
||||||
|
|
||||||
llvm::cl::opt<size_t> dcpCriticalWindowSize(
|
|
||||||
"dcp-critical-window-size",
|
|
||||||
llvm::cl::desc("Number of lowest-slack virtual nodes considered by each DCP coarsening iteration. "
|
|
||||||
"Use 0 to run the legacy full-graph DCP analysis. Only used by the DCP scheduler."),
|
|
||||||
llvm::cl::init(4000));
|
|
||||||
|
|
||||||
llvm::cl::opt<bool>
|
llvm::cl::opt<bool>
|
||||||
ignoreConcatError("ignore-concat-error",
|
ignoreConcatError("ignore-concat-error",
|
||||||
llvm::cl::desc("Ignore ConcatOp corner case: do not assert and do a simplification"),
|
llvm::cl::desc("Ignore ConcatOp corner case: do not assert and do a simplification"),
|
||||||
|
|||||||
@@ -22,7 +22,6 @@ typedef enum {
|
|||||||
|
|
||||||
typedef enum {
|
typedef enum {
|
||||||
MergeSchedulerPeft = 0,
|
MergeSchedulerPeft = 0,
|
||||||
MergeSchedulerDcp = 1,
|
|
||||||
} PimMergeSchedulerType;
|
} PimMergeSchedulerType;
|
||||||
|
|
||||||
extern llvm::cl::OptionCategory OnnxMlirOptions;
|
extern llvm::cl::OptionCategory OnnxMlirOptions;
|
||||||
@@ -36,7 +35,6 @@ extern llvm::cl::opt<bool> pimEmitJson;
|
|||||||
extern llvm::cl::opt<size_t> crossbarSize;
|
extern llvm::cl::opt<size_t> crossbarSize;
|
||||||
extern llvm::cl::opt<size_t> crossbarCountInCore;
|
extern llvm::cl::opt<size_t> crossbarCountInCore;
|
||||||
extern llvm::cl::opt<long> coresCount;
|
extern llvm::cl::opt<long> coresCount;
|
||||||
extern llvm::cl::opt<size_t> dcpCriticalWindowSize;
|
|
||||||
|
|
||||||
bool hasExplicitPimCoreCount();
|
bool hasExplicitPimCoreCount();
|
||||||
void verifyExplicitPimCoreCount();
|
void verifyExplicitPimCoreCount();
|
||||||
|
|||||||
@@ -30,20 +30,17 @@ void addPassesPim(OwningOpRef<ModuleOp>& module,
|
|||||||
if (pimEmissionTarget >= EmitSpatial) {
|
if (pimEmissionTarget >= EmitSpatial) {
|
||||||
pm.addPass(createONNXToSpatialPass());
|
pm.addPass(createONNXToSpatialPass());
|
||||||
pm.addPass(createMergeComputeNodesPass());
|
pm.addPass(createMergeComputeNodesPass());
|
||||||
// pm.addPass(createCountInstructionPass());
|
|
||||||
pm.addPass(createMessagePass("Onnx lowered to Spatial"));
|
pm.addPass(createMessagePass("Onnx lowered to Spatial"));
|
||||||
}
|
}
|
||||||
|
|
||||||
if (pimEmissionTarget >= EmitPim) {
|
if (pimEmissionTarget >= EmitPim) {
|
||||||
pm.addPass(createSpatialToPimPass());
|
pm.addPass(createSpatialToPimPass());
|
||||||
// pm.addPass(createCountInstructionPass());
|
|
||||||
pm.addPass(createMessagePass("Spatial lowered to Pim"));
|
pm.addPass(createMessagePass("Spatial lowered to Pim"));
|
||||||
}
|
}
|
||||||
|
|
||||||
if (pimEmissionTarget >= EmitPimBufferized) {
|
if (pimEmissionTarget >= EmitPimBufferized) {
|
||||||
pm.addPass(createPimBufferizationPass());
|
pm.addPass(createPimBufferizationPass());
|
||||||
pm.addPass(createPimStaticMemoryCoalescingPass());
|
pm.addPass(createPimStaticMemoryCoalescingPass());
|
||||||
// pm.addPass(createCountInstructionPass());
|
|
||||||
pm.addPass(createMessagePass("Pim bufferized"));
|
pm.addPass(createMessagePass("Pim bufferized"));
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -54,7 +51,6 @@ void addPassesPim(OwningOpRef<ModuleOp>& module,
|
|||||||
pm.addPass(createPimVerificationPass());
|
pm.addPass(createPimVerificationPass());
|
||||||
pm.addPass(createMessagePass("Pim verified"));
|
pm.addPass(createMessagePass("Pim verified"));
|
||||||
pm.addPass(createEmitPimCodePass());
|
pm.addPass(createEmitPimCodePass());
|
||||||
// pm.addPass(createCountInstructionPass());
|
|
||||||
pm.addPass(createMessagePass("Pim code emitted"));
|
pm.addPass(createMessagePass("Pim code emitted"));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -3,17 +3,19 @@
|
|||||||
#include "mlir/IR/BuiltinOps.h"
|
#include "mlir/IR/BuiltinOps.h"
|
||||||
#include "mlir/IR/BuiltinTypes.h"
|
#include "mlir/IR/BuiltinTypes.h"
|
||||||
|
|
||||||
|
#include "llvm/ADT/SmallSet.h"
|
||||||
#include "llvm/ADT/STLExtras.h"
|
#include "llvm/ADT/STLExtras.h"
|
||||||
#include "llvm/Support/FileSystem.h"
|
#include "llvm/Support/FileSystem.h"
|
||||||
#include "llvm/Support/raw_ostream.h"
|
#include "llvm/Support/raw_ostream.h"
|
||||||
|
|
||||||
#include <cassert>
|
#include <cassert>
|
||||||
|
#include <type_traits>
|
||||||
|
|
||||||
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Common/IR/BatchCoreUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/ShapeUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/SubviewUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/SubviewUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/WeightUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/WeightUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimBatchEmission.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCodeGen.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimCodeGen.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimWeightEmitter.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimWeightEmitter.hpp"
|
||||||
@@ -126,22 +128,6 @@ FailureOr<DenseWeightView> resolveDenseWeightView(ModuleOp moduleOp, mlir::Value
|
|||||||
return view;
|
return view;
|
||||||
}
|
}
|
||||||
|
|
||||||
SmallVector<unsigned, 8> getUsedWeightIndices(Block& block) {
|
|
||||||
SmallVector<unsigned, 8> indices;
|
|
||||||
auto addIndex = [&](unsigned weightIndex) {
|
|
||||||
if (!llvm::is_contained(indices, weightIndex))
|
|
||||||
indices.push_back(weightIndex);
|
|
||||||
};
|
|
||||||
|
|
||||||
block.walk([&](pim::PimVMMOp vmmOp) { addIndex(vmmOp.getWeightIndex()); });
|
|
||||||
llvm::sort(indices);
|
|
||||||
return indices;
|
|
||||||
}
|
|
||||||
|
|
||||||
SmallVector<unsigned, 8> getUsedWeightIndices(pim::PimCoreOp coreOp) {
|
|
||||||
return getUsedWeightIndices(coreOp.getBody().front());
|
|
||||||
}
|
|
||||||
|
|
||||||
SmallVector<Operation*> collectTopLevelCoreLikeOps(func::FuncOp funcOp) {
|
SmallVector<Operation*> collectTopLevelCoreLikeOps(func::FuncOp funcOp) {
|
||||||
SmallVector<Operation*> coreLikeOps;
|
SmallVector<Operation*> coreLikeOps;
|
||||||
for (Operation& op : funcOp.getBody().front())
|
for (Operation& op : funcOp.getBody().front())
|
||||||
@@ -163,86 +149,117 @@ createAndPopulateWeightFolder(func::FuncOp funcOp, StringRef outputDirPath) {
|
|||||||
int64_t xbarSize = crossbarSize.getValue();
|
int64_t xbarSize = crossbarSize.getValue();
|
||||||
llvm::DenseMap<size_t, llvm::DenseMap<mlir::Value, std::string>> mapCoreWeightToFileName;
|
llvm::DenseMap<size_t, llvm::DenseMap<mlir::Value, std::string>> mapCoreWeightToFileName;
|
||||||
llvm::DenseMap<memref::GlobalOp, std::string> mapGlobalOpToFileName;
|
llvm::DenseMap<memref::GlobalOp, std::string> mapGlobalOpToFileName;
|
||||||
|
llvm::DenseMap<mlir::Value, std::string> mapWeightValueToFileName;
|
||||||
|
|
||||||
SmallVector<Operation*> coreLikeOps = collectTopLevelCoreLikeOps(funcOp);
|
SmallVector<Operation*> coreLikeOps = collectTopLevelCoreLikeOps(funcOp);
|
||||||
|
|
||||||
for (Operation* op : coreLikeOps) {
|
for (Operation* op : coreLikeOps) {
|
||||||
auto processCore = [&](pim::PimCoreOp coreOp) {
|
auto processWeight = [&](Operation* ownerOp,
|
||||||
size_t coreId = static_cast<size_t>(coreOp.getCoreId());
|
mlir::Value weight,
|
||||||
for (unsigned index : getUsedWeightIndices(coreOp)) {
|
size_t weightIndex,
|
||||||
if (index >= coreOp.getWeights().size()) {
|
size_t coreId) -> LogicalResult {
|
||||||
coreOp.emitWarning("Weight index " + std::to_string(index) + " is out of range");
|
auto weightView = resolveDenseWeightView(moduleOp, weight);
|
||||||
assert(index < coreOp.getWeights().size() && "Weight index is out of range");
|
if (failed(weightView)) {
|
||||||
}
|
ownerOp->emitWarning("Weight is not from a memref.get_global at index " + std::to_string(weightIndex));
|
||||||
mlir::Value weight = coreOp.getWeights()[index];
|
assert(succeeded(weightView) && "Weight is not from a dense memref.global view");
|
||||||
|
}
|
||||||
|
|
||||||
auto weightView = resolveDenseWeightView(moduleOp, weight);
|
if (mapCoreWeightToFileName[coreId].contains(weight))
|
||||||
if (failed(weightView)) {
|
return success();
|
||||||
coreOp.emitWarning("Weight is not from a memref.get_global at index " + std::to_string(index));
|
|
||||||
assert(succeeded(weightView) && "Weight is not from a dense memref.global view");
|
|
||||||
}
|
|
||||||
|
|
||||||
if (mapCoreWeightToFileName[coreId].contains(weight))
|
if (auto weightFile = mapWeightValueToFileName.find(weight); weightFile != mapWeightValueToFileName.end()) {
|
||||||
continue;
|
mapCoreWeightToFileName[coreId].insert({weight, weightFile->second});
|
||||||
|
return success();
|
||||||
|
}
|
||||||
|
|
||||||
auto getGlobalOp = weight.getDefiningOp<memref::GetGlobalOp>();
|
auto getGlobalOp = weight.getDefiningOp<memref::GetGlobalOp>();
|
||||||
auto globalOp = getGlobalOp ? lookupGlobalForGetGlobal(moduleOp, getGlobalOp) : memref::GlobalOp {};
|
auto globalOp = getGlobalOp ? lookupGlobalForGetGlobal(moduleOp, getGlobalOp) : memref::GlobalOp {};
|
||||||
if (globalOp && mapGlobalOpToFileName.contains(globalOp)) {
|
if (globalOp && mapGlobalOpToFileName.contains(globalOp)) {
|
||||||
auto& fileName = mapGlobalOpToFileName[globalOp];
|
auto& fileName = mapGlobalOpToFileName[globalOp];
|
||||||
mapCoreWeightToFileName[coreId].insert({weight, fileName});
|
mapWeightValueToFileName[weight] = fileName;
|
||||||
continue;
|
mapCoreWeightToFileName[coreId].insert({weight, fileName});
|
||||||
}
|
return success();
|
||||||
|
}
|
||||||
|
|
||||||
DenseElementsAttr denseAttr = weightView->denseAttr;
|
DenseElementsAttr denseAttr = weightView->denseAttr;
|
||||||
ArrayRef<int64_t> shape = weightView->shape;
|
ArrayRef<int64_t> shape = weightView->shape;
|
||||||
assert(isMatrixShape(shape) && "Weight matrix must be 2-dimensional");
|
assert(isMatrixShape(shape) && "Weight matrix must be 2-dimensional");
|
||||||
int64_t numRows = shape[0];
|
int64_t numRows = shape[0];
|
||||||
int64_t numCols = shape[1];
|
int64_t numCols = shape[1];
|
||||||
assert(numRows <= xbarSize && numCols <= xbarSize && "Weight dimensions must not exceed crossbar size");
|
assert(numRows <= xbarSize && numCols <= xbarSize && "Weight dimensions must not exceed crossbar size");
|
||||||
|
|
||||||
size_t elementByteWidth = denseAttr.getElementType().getIntOrFloatBitWidth() / 8;
|
size_t elementByteWidth = getElementTypeSizeInBytes(denseAttr.getElementType());
|
||||||
|
|
||||||
std::string newFileName = "crossbar_" + std::to_string(indexFileName++) + ".bin";
|
std::string newFileName = "crossbar_" + std::to_string(indexFileName++) + ".bin";
|
||||||
auto weightFilePath = (coreWeightsDirPath + "/" + newFileName).str();
|
auto weightFilePath = (coreWeightsDirPath + "/" + newFileName).str();
|
||||||
std::error_code errorCode;
|
std::error_code errorCode;
|
||||||
raw_fd_ostream weightFileStream(weightFilePath, errorCode, sys::fs::OF_None);
|
raw_fd_ostream weightFileStream(weightFilePath, errorCode, sys::fs::OF_None);
|
||||||
if (errorCode) {
|
if (errorCode) {
|
||||||
errs() << "Error while opening weight file `" << weightFilePath << "`: " << errorCode.message() << '\n';
|
errs() << "Error while opening weight file `" << weightFilePath << "`: " << errorCode.message() << '\n';
|
||||||
assert(errorCode);
|
assert(errorCode);
|
||||||
}
|
}
|
||||||
|
|
||||||
uint64_t zero = 0;
|
uint64_t zero = 0;
|
||||||
for (int64_t row = 0; row < xbarSize; row++) {
|
for (int64_t row = 0; row < xbarSize; row++) {
|
||||||
for (int64_t col = 0; col < xbarSize; col++) {
|
for (int64_t col = 0; col < xbarSize; col++) {
|
||||||
if (row < numRows && col < numCols) {
|
if (row < numRows && col < numCols) {
|
||||||
int64_t elementIndex = weightView->offset + row * weightView->strides[0] + col * weightView->strides[1];
|
int64_t elementIndex = weightView->offset + row * weightView->strides[0] + col * weightView->strides[1];
|
||||||
APInt bits = denseAttr.getValues<APFloat>()[elementIndex].bitcastToAPInt();
|
APInt bits = denseAttr.getValues<APFloat>()[elementIndex].bitcastToAPInt();
|
||||||
uint64_t word = bits.getZExtValue();
|
uint64_t word = bits.getZExtValue();
|
||||||
weightFileStream.write(reinterpret_cast<const char*>(&word), elementByteWidth);
|
weightFileStream.write(reinterpret_cast<const char*>(&word), elementByteWidth);
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
weightFileStream.write(reinterpret_cast<const char*>(&zero), elementByteWidth);
|
weightFileStream.write(reinterpret_cast<const char*>(&zero), elementByteWidth);
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
weightFileStream.close();
|
|
||||||
if (globalOp)
|
|
||||||
mapGlobalOpToFileName.insert({globalOp, newFileName});
|
|
||||||
mapCoreWeightToFileName[coreId].insert({weight, newFileName});
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
weightFileStream.close();
|
||||||
|
if (globalOp)
|
||||||
|
mapGlobalOpToFileName.insert({globalOp, newFileName});
|
||||||
|
mapWeightValueToFileName[weight] = newFileName;
|
||||||
|
mapCoreWeightToFileName[coreId].insert({weight, newFileName});
|
||||||
return success();
|
return success();
|
||||||
};
|
};
|
||||||
|
|
||||||
|
auto processCoreLike = [&](auto coreLikeOp) {
|
||||||
|
auto usedIndices = getUsedWeightIndices(coreLikeOp);
|
||||||
|
for (unsigned index : usedIndices) {
|
||||||
|
if (index >= coreLikeOp.getWeights().size()) {
|
||||||
|
coreLikeOp.emitWarning("Weight index " + std::to_string(index) + " is out of range");
|
||||||
|
assert(index < coreLikeOp.getWeights().size() && "Weight index is out of range");
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if constexpr (std::is_same_v<std::decay_t<decltype(coreLikeOp)>, pim::PimCoreOp>) {
|
||||||
|
size_t coreId = static_cast<size_t>(coreLikeOp.getCoreId());
|
||||||
|
for (unsigned index : usedIndices)
|
||||||
|
if (failed(processWeight(coreLikeOp, coreLikeOp.getWeights()[index], index, coreId)))
|
||||||
|
return failure();
|
||||||
|
return success();
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
auto batchCoreIds = getBatchCoreIds(coreLikeOp);
|
||||||
|
SmallVector<size_t> orderedCoreIds;
|
||||||
|
llvm::SmallSet<size_t, 8> seenCoreIds;
|
||||||
|
for (int32_t coreId : batchCoreIds)
|
||||||
|
if (seenCoreIds.insert(static_cast<size_t>(coreId)).second)
|
||||||
|
orderedCoreIds.push_back(static_cast<size_t>(coreId));
|
||||||
|
|
||||||
|
for (size_t coreId : orderedCoreIds)
|
||||||
|
for (unsigned index : usedIndices)
|
||||||
|
if (failed(processWeight(coreLikeOp, coreLikeOp.getWeights()[index], index, coreId)))
|
||||||
|
return failure();
|
||||||
|
return success();
|
||||||
|
}
|
||||||
|
};
|
||||||
|
|
||||||
if (auto coreOp = dyn_cast<pim::PimCoreOp>(op)) {
|
if (auto coreOp = dyn_cast<pim::PimCoreOp>(op)) {
|
||||||
(void) processCore(coreOp);
|
(void) processCoreLike(coreOp);
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
auto coreBatchOp = cast<pim::PimCoreBatchOp>(op);
|
(void) processCoreLike(cast<pim::PimCoreBatchOp>(op));
|
||||||
for (unsigned lane = 0; lane < static_cast<unsigned>(coreBatchOp.getLaneCount()); ++lane)
|
|
||||||
if (failed(withScalarCoreFromBatchLane(coreBatchOp, lane, processCore)))
|
|
||||||
return mapCoreWeightToFileName;
|
|
||||||
}
|
}
|
||||||
return mapCoreWeightToFileName;
|
return mapCoreWeightToFileName;
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -4,8 +4,8 @@ add_public_tablegen_target(ONNXToSpatialIncGen)
|
|||||||
|
|
||||||
add_pim_library(OMONNXToSpatial
|
add_pim_library(OMONNXToSpatial
|
||||||
ConversionPatterns.cpp
|
ConversionPatterns.cpp
|
||||||
HostFoldability.cpp
|
CompileTime.cpp
|
||||||
HostLegality.cpp
|
ONNXToSpatialVerifier.cpp
|
||||||
PrePatterns.cpp
|
PrePatterns.cpp
|
||||||
PostPatterns.cpp
|
PostPatterns.cpp
|
||||||
Patterns/Math/Conv.cpp
|
Patterns/Math/Conv.cpp
|
||||||
|
|||||||
@@ -18,13 +18,17 @@ namespace detail {
|
|||||||
|
|
||||||
inline mlir::ValueRange getBlockArgs(mlir::Block* block) { return mlir::ValueRange(block->getArguments()); }
|
inline mlir::ValueRange getBlockArgs(mlir::Block* block) { return mlir::ValueRange(block->getArguments()); }
|
||||||
|
|
||||||
|
inline mlir::ValueRange getInputBlockArgs(mlir::Block* block, size_t weightCount) {
|
||||||
|
return mlir::ValueRange(block->getArguments()).drop_front(weightCount);
|
||||||
|
}
|
||||||
|
|
||||||
template <typename Fn, size_t... Is>
|
template <typename Fn, size_t... Is>
|
||||||
decltype(auto) invokeWithBlockArgs(Fn&& fn, mlir::Block* block, std::index_sequence<Is...>) {
|
decltype(auto) invokeWithBlockArgs(Fn&& fn, mlir::Block* block, std::index_sequence<Is...>) {
|
||||||
return std::forward<Fn>(fn)(block->getArgument(Is)...);
|
return std::forward<Fn>(fn)(block->getArgument(Is)...);
|
||||||
}
|
}
|
||||||
|
|
||||||
template <typename Fn, size_t... Is>
|
template <typename Fn, size_t... Is>
|
||||||
decltype(auto) invokeWithValues(Fn&& fn, mlir::ArrayRef<mlir::Value> values, std::index_sequence<Is...>) {
|
decltype(auto) invokeWithValues(Fn&& fn, mlir::ValueRange values, std::index_sequence<Is...>) {
|
||||||
return std::forward<Fn>(fn)(values[Is]...);
|
return std::forward<Fn>(fn)(values[Is]...);
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -85,6 +89,8 @@ auto createSpatCompute(RewriterT& rewriter,
|
|||||||
auto computeOp = spatial::SpatCompute::create(rewriter, loc, resultTypes, weights, inputs);
|
auto computeOp = spatial::SpatCompute::create(rewriter, loc, resultTypes, weights, inputs);
|
||||||
|
|
||||||
auto* block = new mlir::Block();
|
auto* block = new mlir::Block();
|
||||||
|
for (mlir::Value weight : weights)
|
||||||
|
block->addArgument(weight.getType(), loc);
|
||||||
for (mlir::Value input : inputs)
|
for (mlir::Value input : inputs)
|
||||||
block->addArgument(input.getType(), loc);
|
block->addArgument(input.getType(), loc);
|
||||||
|
|
||||||
@@ -93,14 +99,17 @@ auto createSpatCompute(RewriterT& rewriter,
|
|||||||
|
|
||||||
using BodyResult = detail::InvokeWithBlockArgsResultT<std::decay_t<BodyFn>, std::make_index_sequence<NumInputs>>;
|
using BodyResult = detail::InvokeWithBlockArgsResultT<std::decay_t<BodyFn>, std::make_index_sequence<NumInputs>>;
|
||||||
if constexpr (std::is_same_v<BodyResult, void>) {
|
if constexpr (std::is_same_v<BodyResult, void>) {
|
||||||
detail::invokeWithBlockArgs(std::forward<BodyFn>(body), block, std::make_index_sequence<NumInputs> {});
|
detail::invokeWithValues(std::forward<BodyFn>(body),
|
||||||
|
detail::getInputBlockArgs(block, weights.size()),
|
||||||
|
std::make_index_sequence<NumInputs> {});
|
||||||
|
|
||||||
rewriter.setInsertionPointAfter(computeOp);
|
rewriter.setInsertionPointAfter(computeOp);
|
||||||
return computeOp;
|
return computeOp;
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
auto bodyResult =
|
auto bodyResult = detail::invokeWithValues(std::forward<BodyFn>(body),
|
||||||
detail::invokeWithBlockArgs(std::forward<BodyFn>(body), block, std::make_index_sequence<NumInputs> {});
|
detail::getInputBlockArgs(block, weights.size()),
|
||||||
|
std::make_index_sequence<NumInputs> {});
|
||||||
if (mlir::failed(bodyResult)) {
|
if (mlir::failed(bodyResult)) {
|
||||||
rewriter.setInsertionPointAfter(computeOp);
|
rewriter.setInsertionPointAfter(computeOp);
|
||||||
rewriter.eraseOp(computeOp);
|
rewriter.eraseOp(computeOp);
|
||||||
@@ -123,6 +132,8 @@ auto createSpatCompute(RewriterT& rewriter,
|
|||||||
auto computeOp = spatial::SpatCompute::create(rewriter, loc, resultTypes, weights, inputs);
|
auto computeOp = spatial::SpatCompute::create(rewriter, loc, resultTypes, weights, inputs);
|
||||||
|
|
||||||
auto* block = new mlir::Block();
|
auto* block = new mlir::Block();
|
||||||
|
for (mlir::Value weight : weights)
|
||||||
|
block->addArgument(weight.getType(), loc);
|
||||||
for (mlir::Value input : inputs)
|
for (mlir::Value input : inputs)
|
||||||
block->addArgument(input.getType(), loc);
|
block->addArgument(input.getType(), loc);
|
||||||
|
|
||||||
@@ -131,13 +142,13 @@ auto createSpatCompute(RewriterT& rewriter,
|
|||||||
|
|
||||||
using BodyResult = detail::InvokeWithValueRangeResultT<std::decay_t<BodyFn>>;
|
using BodyResult = detail::InvokeWithValueRangeResultT<std::decay_t<BodyFn>>;
|
||||||
if constexpr (std::is_same_v<BodyResult, void>) {
|
if constexpr (std::is_same_v<BodyResult, void>) {
|
||||||
std::forward<BodyFn>(body)(detail::getBlockArgs(block));
|
std::forward<BodyFn>(body)(detail::getInputBlockArgs(block, weights.size()));
|
||||||
|
|
||||||
rewriter.setInsertionPointAfter(computeOp);
|
rewriter.setInsertionPointAfter(computeOp);
|
||||||
return computeOp;
|
return computeOp;
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
auto bodyResult = std::forward<BodyFn>(body)(detail::getBlockArgs(block));
|
auto bodyResult = std::forward<BodyFn>(body)(detail::getInputBlockArgs(block, weights.size()));
|
||||||
if (mlir::failed(bodyResult)) {
|
if (mlir::failed(bodyResult)) {
|
||||||
rewriter.setInsertionPointAfter(computeOp);
|
rewriter.setInsertionPointAfter(computeOp);
|
||||||
rewriter.eraseOp(computeOp);
|
rewriter.eraseOp(computeOp);
|
||||||
|
|||||||
@@ -6,7 +6,7 @@
|
|||||||
#include "ShapeTilingUtils.hpp"
|
#include "ShapeTilingUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
|
|
||||||
@@ -44,7 +44,7 @@ SmallVector<Value> sliceTensor(
|
|||||||
RankedTensorType::get(sliceShape, cast<RankedTensorType>(tensorToSlice.getType()).getElementType());
|
RankedTensorType::get(sliceShape, cast<RankedTensorType>(tensorToSlice.getType()).getElementType());
|
||||||
|
|
||||||
Value slice;
|
Value slice;
|
||||||
if (isHostFoldableValue(tensorToSlice)) {
|
if (isCompileTimeComputable(tensorToSlice)) {
|
||||||
slice = tensor::ExtractSliceOp::create(rewriter, loc, tensorToSlice, offsets, sizes, strides);
|
slice = tensor::ExtractSliceOp::create(rewriter, loc, tensorToSlice, offsets, sizes, strides);
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
@@ -113,7 +113,7 @@ Value broadcastToVector(Value scalarToBroadcast, int64_t length, ConversionPatte
|
|||||||
return tensor::SplatOp::create(rewriter, loc, type, elementValue);
|
return tensor::SplatOp::create(rewriter, loc, type, elementValue);
|
||||||
};
|
};
|
||||||
|
|
||||||
if (isHostFoldableValue(scalarToBroadcast))
|
if (isCompileTimeComputable(scalarToBroadcast))
|
||||||
return buildBroadcast(scalarToBroadcast);
|
return buildBroadcast(scalarToBroadcast);
|
||||||
|
|
||||||
auto broadcastCompute =
|
auto broadcastCompute =
|
||||||
|
|||||||
+63
-27
@@ -7,8 +7,11 @@
|
|||||||
#include "llvm/ADT/SmallBitVector.h"
|
#include "llvm/ADT/SmallBitVector.h"
|
||||||
#include "llvm/ADT/SmallPtrSet.h"
|
#include "llvm/ADT/SmallPtrSet.h"
|
||||||
#include "llvm/ADT/SmallVector.h"
|
#include "llvm/ADT/SmallVector.h"
|
||||||
|
#include "llvm/Support/ErrorHandling.h"
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include <utility>
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -145,7 +148,7 @@ static DenseElementsAttr getDirectDenseConstantAttr(Value value) {
|
|||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
static DenseElementsAttr getHostFoldableDenseElementsAttrImpl(Value value, llvm::SmallPtrSetImpl<Operation*>& visited) {
|
static DenseElementsAttr getHostConstantDenseElementsAttrImpl(Value value, llvm::SmallPtrSetImpl<Operation*>& visited) {
|
||||||
auto* definingOp = value.getDefiningOp();
|
auto* definingOp = value.getDefiningOp();
|
||||||
if (!definingOp || !visited.insert(definingOp).second)
|
if (!definingOp || !visited.insert(definingOp).second)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
@@ -156,7 +159,7 @@ static DenseElementsAttr getHostFoldableDenseElementsAttrImpl(Value value, llvm:
|
|||||||
return denseAttr;
|
return denseAttr;
|
||||||
|
|
||||||
if (auto transposeOp = dyn_cast<ONNXTransposeOp>(definingOp)) {
|
if (auto transposeOp = dyn_cast<ONNXTransposeOp>(definingOp)) {
|
||||||
auto inputAttr = getHostFoldableDenseElementsAttrImpl(transposeOp.getData(), visited);
|
auto inputAttr = getHostConstantDenseElementsAttrImpl(transposeOp.getData(), visited);
|
||||||
if (!inputAttr)
|
if (!inputAttr)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
|
|
||||||
@@ -169,7 +172,7 @@ static DenseElementsAttr getHostFoldableDenseElementsAttrImpl(Value value, llvm:
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (auto collapseShapeOp = dyn_cast<tensor::CollapseShapeOp>(definingOp)) {
|
if (auto collapseShapeOp = dyn_cast<tensor::CollapseShapeOp>(definingOp)) {
|
||||||
auto inputAttr = getHostFoldableDenseElementsAttrImpl(collapseShapeOp.getSrc(), visited);
|
auto inputAttr = getHostConstantDenseElementsAttrImpl(collapseShapeOp.getSrc(), visited);
|
||||||
if (!inputAttr)
|
if (!inputAttr)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
auto reshapedAttr = reshapeDenseElements(inputAttr, cast<RankedTensorType>(collapseShapeOp.getType()));
|
auto reshapedAttr = reshapeDenseElements(inputAttr, cast<RankedTensorType>(collapseShapeOp.getType()));
|
||||||
@@ -177,7 +180,7 @@ static DenseElementsAttr getHostFoldableDenseElementsAttrImpl(Value value, llvm:
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (auto expandShapeOp = dyn_cast<tensor::ExpandShapeOp>(definingOp)) {
|
if (auto expandShapeOp = dyn_cast<tensor::ExpandShapeOp>(definingOp)) {
|
||||||
auto inputAttr = getHostFoldableDenseElementsAttrImpl(expandShapeOp.getSrc(), visited);
|
auto inputAttr = getHostConstantDenseElementsAttrImpl(expandShapeOp.getSrc(), visited);
|
||||||
if (!inputAttr)
|
if (!inputAttr)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
auto reshapedAttr = reshapeDenseElements(inputAttr, cast<RankedTensorType>(expandShapeOp.getType()));
|
auto reshapedAttr = reshapeDenseElements(inputAttr, cast<RankedTensorType>(expandShapeOp.getType()));
|
||||||
@@ -185,7 +188,7 @@ static DenseElementsAttr getHostFoldableDenseElementsAttrImpl(Value value, llvm:
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (auto extractSliceOp = dyn_cast<tensor::ExtractSliceOp>(definingOp)) {
|
if (auto extractSliceOp = dyn_cast<tensor::ExtractSliceOp>(definingOp)) {
|
||||||
auto inputAttr = getHostFoldableDenseElementsAttrImpl(extractSliceOp.getSource(), visited);
|
auto inputAttr = getHostConstantDenseElementsAttrImpl(extractSliceOp.getSource(), visited);
|
||||||
if (!inputAttr)
|
if (!inputAttr)
|
||||||
return nullptr;
|
return nullptr;
|
||||||
auto slicedAttr = extractSliceDenseElements(inputAttr, extractSliceOp);
|
auto slicedAttr = extractSliceDenseElements(inputAttr, extractSliceOp);
|
||||||
@@ -195,62 +198,95 @@ static DenseElementsAttr getHostFoldableDenseElementsAttrImpl(Value value, llvm:
|
|||||||
return nullptr;
|
return nullptr;
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool isHostFoldableOpImpl(Operation* op, llvm::SmallPtrSetImpl<Operation*>& visited) {
|
|
||||||
if (!op || !visited.insert(op).second)
|
static std::optional<CompileTimeSource>
|
||||||
return false;
|
getCompileTimeSourceImpl(Operation* op, llvm::SmallPtrSetImpl<Operation*>& visited, size_t chainLength = 0) {
|
||||||
|
if (!op)
|
||||||
|
return std::nullopt;
|
||||||
|
|
||||||
|
if (!visited.insert(op).second)
|
||||||
|
return {
|
||||||
|
{op, chainLength}
|
||||||
|
};
|
||||||
|
|
||||||
if (isa<arith::ConstantOp, ONNXConstantOp, ONNXNoneOp>(op))
|
if (isa<arith::ConstantOp, ONNXConstantOp, ONNXNoneOp>(op))
|
||||||
return true;
|
return {
|
||||||
|
{op, chainLength}
|
||||||
|
};
|
||||||
|
|
||||||
|
chainLength += 1;
|
||||||
|
|
||||||
if (auto extractOp = dyn_cast<tensor::ExtractOp>(op))
|
if (auto extractOp = dyn_cast<tensor::ExtractOp>(op))
|
||||||
return hasConstantIndices(extractOp) && isHostFoldableValue(extractOp.getTensor());
|
return hasConstantIndices(extractOp) ? getCompileTimeSourceImpl(extractOp.getTensor().getDefiningOp(), visited, chainLength) : std::nullopt;
|
||||||
|
|
||||||
if (!isStaticTensorResult(op))
|
if (!isStaticTensorResult(op))
|
||||||
return false;
|
return std::nullopt;
|
||||||
|
|
||||||
if (auto transposeOp = dyn_cast<ONNXTransposeOp>(op))
|
if (auto transposeOp = dyn_cast<ONNXTransposeOp>(op))
|
||||||
return isHostFoldableValue(transposeOp.getData());
|
return getCompileTimeSourceImpl(transposeOp.getData().getDefiningOp(), visited, chainLength);
|
||||||
|
|
||||||
if (auto collapseShapeOp = dyn_cast<tensor::CollapseShapeOp>(op))
|
if (auto collapseShapeOp = dyn_cast<tensor::CollapseShapeOp>(op))
|
||||||
return isHostFoldableValue(collapseShapeOp.getSrc());
|
return getCompileTimeSourceImpl(collapseShapeOp.getSrc().getDefiningOp(), visited, chainLength);
|
||||||
|
|
||||||
if (auto expandShapeOp = dyn_cast<tensor::ExpandShapeOp>(op))
|
if (auto expandShapeOp = dyn_cast<tensor::ExpandShapeOp>(op))
|
||||||
return isHostFoldableValue(expandShapeOp.getSrc());
|
return getCompileTimeSourceImpl(expandShapeOp.getSrc().getDefiningOp(), visited, chainLength);
|
||||||
|
|
||||||
if (auto extractSliceOp = dyn_cast<tensor::ExtractSliceOp>(op))
|
if (auto extractSliceOp = dyn_cast<tensor::ExtractSliceOp>(op))
|
||||||
return hasStaticUnitStrides(extractSliceOp) && isHostFoldableValue(extractSliceOp.getSource());
|
return hasStaticUnitStrides(extractSliceOp) ? getCompileTimeSourceImpl(extractSliceOp.getSource().getDefiningOp(), visited, chainLength)
|
||||||
|
: std::nullopt;
|
||||||
|
|
||||||
if (auto splatOp = dyn_cast<tensor::SplatOp>(op))
|
if (auto splatOp = dyn_cast<tensor::SplatOp>(op))
|
||||||
return isHostFoldableValue(splatOp.getInput());
|
return getCompileTimeSourceImpl(splatOp.getInput().getDefiningOp(), visited, chainLength);
|
||||||
|
|
||||||
if (auto extractRowsOp = dyn_cast<spatial::SpatExtractRowsOp>(op))
|
if (auto extractRowsOp = dyn_cast<spatial::SpatExtractRowsOp>(op))
|
||||||
return isHostFoldableValue(extractRowsOp.getInput());
|
return getCompileTimeSourceImpl(extractRowsOp.getInput().getDefiningOp(), visited, chainLength);
|
||||||
|
|
||||||
if (auto concatOp = dyn_cast<spatial::SpatConcatOp>(op))
|
if (auto concatOp = dyn_cast<spatial::SpatConcatOp>(op)) {
|
||||||
return llvm::all_of(concatOp.getInputs(), isHostFoldableValue);
|
std::optional<CompileTimeSource> res = {};
|
||||||
|
for (auto operandValue : concatOp.getOperands()) {
|
||||||
|
auto partialRes = getCompileTimeSourceImpl(operandValue.getDefiningOp(), visited, chainLength);
|
||||||
|
if (!partialRes)
|
||||||
|
return std::nullopt;
|
||||||
|
|
||||||
return false;
|
if (!res) {
|
||||||
|
res = partialRes;
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
if(res->chainLength < partialRes->chainLength){
|
||||||
|
res = partialRes;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return res;
|
||||||
|
}
|
||||||
|
|
||||||
|
return std::nullopt;
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
bool isHostFoldableValue(Value value) {
|
|
||||||
|
std::optional<CompileTimeSource> getCompileTimeSource(Operation* op) {
|
||||||
|
llvm::SmallPtrSet<Operation*, 8> visited;
|
||||||
|
return getCompileTimeSourceImpl(op, visited);
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isCompileTimeComputable(Value value) {
|
||||||
auto* definingOp = value.getDefiningOp();
|
auto* definingOp = value.getDefiningOp();
|
||||||
if (!definingOp)
|
if (!definingOp)
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
llvm::SmallPtrSet<Operation*, 8> visited;
|
llvm::SmallPtrSet<Operation*, 8> visited;
|
||||||
return isHostFoldableOpImpl(definingOp, visited);
|
return getCompileTimeSourceImpl(definingOp, visited).has_value();
|
||||||
}
|
}
|
||||||
|
|
||||||
bool isHostFoldableOp(Operation* op) {
|
bool isCompileTimeOp(Operation* op) {
|
||||||
llvm::SmallPtrSet<Operation*, 8> visited;
|
llvm::SmallPtrSet<Operation*, 8> visited;
|
||||||
return isHostFoldableOpImpl(op, visited);
|
return getCompileTimeSourceImpl(op, visited).has_value();
|
||||||
}
|
}
|
||||||
|
|
||||||
DenseElementsAttr getHostFoldableDenseElementsAttr(Value value) {
|
DenseElementsAttr getHostConstDenseElementsAttr(Value value) {
|
||||||
llvm::SmallPtrSet<Operation*, 8> visited;
|
llvm::SmallPtrSet<Operation*, 8> visited;
|
||||||
return getHostFoldableDenseElementsAttrImpl(value, visited);
|
return getHostConstantDenseElementsAttrImpl(value, visited);
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
@@ -0,0 +1,22 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "mlir/IR/BuiltinAttributes.h"
|
||||||
|
#include "mlir/IR/Operation.h"
|
||||||
|
#include "mlir/IR/Value.h"
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
|
||||||
|
struct CompileTimeSource {
|
||||||
|
mlir::Operation* source;
|
||||||
|
size_t chainLength;
|
||||||
|
};
|
||||||
|
|
||||||
|
std::optional<CompileTimeSource> getCompileTimeSource(mlir::Operation* op);
|
||||||
|
|
||||||
|
bool isCompileTimeComputable(mlir::Value value);
|
||||||
|
|
||||||
|
bool isCompileTimeOp(mlir::Operation* op);
|
||||||
|
|
||||||
|
mlir::DenseElementsAttr getHostConstDenseElementsAttr(mlir::Value value);
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
@@ -1,15 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/IR/BuiltinAttributes.h"
|
|
||||||
#include "mlir/IR/Operation.h"
|
|
||||||
#include "mlir/IR/Value.h"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
bool isHostFoldableValue(mlir::Value value);
|
|
||||||
|
|
||||||
bool isHostFoldableOp(mlir::Operation* op);
|
|
||||||
|
|
||||||
mlir::DenseElementsAttr getHostFoldableDenseElementsAttr(mlir::Value value);
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -1,34 +0,0 @@
|
|||||||
#include "mlir/Dialect/Arith/IR/Arith.h"
|
|
||||||
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
|
||||||
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/Support/Diagnostics.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostLegality.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
|
|
||||||
using namespace mlir;
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
LogicalResult verifyONNXToSpatialHostLegality(func::FuncOp funcOp) {
|
|
||||||
pim::CappedDiagnosticReporter diagnostics;
|
|
||||||
|
|
||||||
for (Operation& op : funcOp.getFunctionBody().front()) {
|
|
||||||
if (isa<func::ReturnOp, spatial::SpatCompute, spatial::SpatComputeBatch>(&op))
|
|
||||||
continue;
|
|
||||||
if (isHostFoldableOp(&op))
|
|
||||||
continue;
|
|
||||||
|
|
||||||
diagnostics.report(&op, [](Operation* illegalOp) {
|
|
||||||
illegalOp->emitOpError("non-foldable top-level runtime op remains after ONNX-to-Spatial; lower it inside "
|
|
||||||
"spat.compute");
|
|
||||||
});
|
|
||||||
}
|
|
||||||
|
|
||||||
diagnostics.emitSuppressedSummary(funcOp, "ONNX-to-Spatial host legality failures");
|
|
||||||
|
|
||||||
return success(!diagnostics.hasFailure());
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -1,3 +1,4 @@
|
|||||||
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
||||||
#include "mlir/Dialect/Arith/IR/Arith.h"
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
#include "mlir/Dialect/SCF/IR/SCF.h"
|
#include "mlir/Dialect/SCF/IR/SCF.h"
|
||||||
@@ -12,13 +13,12 @@
|
|||||||
|
|
||||||
#include "Common/Common.hpp"
|
#include "Common/Common.hpp"
|
||||||
#include "Common/PimCommon.hpp"
|
#include "Common/PimCommon.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ONNXToSpatialVerifier.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostLegality.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/PostPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/PostPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/PrePatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/PrePatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Compiler/CompilerOptions.hpp"
|
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
@@ -44,7 +44,8 @@ static void populateEmptyFunction(func::FuncOp funcOp) {
|
|||||||
IRRewriter rewriter(funcOp.getContext());
|
IRRewriter rewriter(funcOp.getContext());
|
||||||
IRMapping mapper;
|
IRMapping mapper;
|
||||||
SmallVector<spatial::SpatCompute> computes(funcOp.getOps<spatial::SpatCompute>());
|
SmallVector<spatial::SpatCompute> computes(funcOp.getOps<spatial::SpatCompute>());
|
||||||
if (!computes.empty())
|
SmallVector<spatial::SpatComputeBatch> computeBatches(funcOp.getOps<spatial::SpatComputeBatch>());
|
||||||
|
if (!computes.empty() || !computeBatches.empty())
|
||||||
return;
|
return;
|
||||||
|
|
||||||
auto returnOp = cast<func::ReturnOp>(funcOp.getFunctionBody().front().getTerminator());
|
auto returnOp = cast<func::ReturnOp>(funcOp.getFunctionBody().front().getTerminator());
|
||||||
@@ -91,7 +92,7 @@ static void wrapTopLevelRuntimeTransposes(func::FuncOp funcOp) {
|
|||||||
|
|
||||||
for (Operation& op : llvm::make_early_inc_range(entryBlock)) {
|
for (Operation& op : llvm::make_early_inc_range(entryBlock)) {
|
||||||
auto transposeOp = dyn_cast<ONNXTransposeOp>(&op);
|
auto transposeOp = dyn_cast<ONNXTransposeOp>(&op);
|
||||||
if (!transposeOp || isHostFoldableOp(transposeOp))
|
if (!transposeOp || isCompileTimeOp(transposeOp))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
// Transpose stays globally legal because constant/view-only cases are
|
// Transpose stays globally legal because constant/view-only cases are
|
||||||
@@ -117,6 +118,7 @@ void ONNXToSpatialPass::runOnOperation() {
|
|||||||
preTarget.addLegalDialect<spatial::SpatialDialect,
|
preTarget.addLegalDialect<spatial::SpatialDialect,
|
||||||
ONNXDialect,
|
ONNXDialect,
|
||||||
tensor::TensorDialect,
|
tensor::TensorDialect,
|
||||||
|
affine::AffineDialect,
|
||||||
arith::ArithDialect,
|
arith::ArithDialect,
|
||||||
scf::SCFDialect>();
|
scf::SCFDialect>();
|
||||||
preTarget.addIllegalOp<ONNXConstantOp, ONNXFlattenOp>();
|
preTarget.addIllegalOp<ONNXConstantOp, ONNXFlattenOp>();
|
||||||
@@ -155,6 +157,7 @@ void ONNXToSpatialPass::runOnOperation() {
|
|||||||
target.addLegalDialect<spatial::SpatialDialect,
|
target.addLegalDialect<spatial::SpatialDialect,
|
||||||
ONNXDialect,
|
ONNXDialect,
|
||||||
tensor::TensorDialect,
|
tensor::TensorDialect,
|
||||||
|
affine::AffineDialect,
|
||||||
arith::ArithDialect,
|
arith::ArithDialect,
|
||||||
scf::SCFDialect>();
|
scf::SCFDialect>();
|
||||||
target.addIllegalOp<ONNXMatMulOp>();
|
target.addIllegalOp<ONNXMatMulOp>();
|
||||||
@@ -188,18 +191,9 @@ void ONNXToSpatialPass::runOnOperation() {
|
|||||||
earlyPostTarget.addLegalDialect<spatial::SpatialDialect,
|
earlyPostTarget.addLegalDialect<spatial::SpatialDialect,
|
||||||
ONNXDialect,
|
ONNXDialect,
|
||||||
tensor::TensorDialect,
|
tensor::TensorDialect,
|
||||||
|
affine::AffineDialect,
|
||||||
arith::ArithDialect,
|
arith::ArithDialect,
|
||||||
scf::SCFDialect>();
|
scf::SCFDialect>();
|
||||||
earlyPostTarget.addDynamicallyLegalOp<spatial::SpatComputeBatch>(
|
|
||||||
[](spatial::SpatComputeBatch batchOp) { return !requiresEarlyPostRewrite(batchOp); });
|
|
||||||
|
|
||||||
RewritePatternSet earlyPostPatterns(ctx);
|
|
||||||
populateEarlyPostPatterns(earlyPostPatterns, ctx);
|
|
||||||
if (failed(applyPartialConversion(*entryFunc, earlyPostTarget, std::move(earlyPostPatterns)))) {
|
|
||||||
moduleOp.emitError("failed to normalize single-lane spat.compute_batch ops before core assignment checks");
|
|
||||||
signalPassFailure();
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
PassManager cleanupPM(ctx);
|
PassManager cleanupPM(ctx);
|
||||||
cleanupPM.addPass(createCanonicalizerPass());
|
cleanupPM.addPass(createCanonicalizerPass());
|
||||||
@@ -212,6 +206,7 @@ void ONNXToSpatialPass::runOnOperation() {
|
|||||||
postTarget.addLegalDialect<spatial::SpatialDialect,
|
postTarget.addLegalDialect<spatial::SpatialDialect,
|
||||||
ONNXDialect,
|
ONNXDialect,
|
||||||
tensor::TensorDialect,
|
tensor::TensorDialect,
|
||||||
|
affine::AffineDialect,
|
||||||
arith::ArithDialect,
|
arith::ArithDialect,
|
||||||
scf::SCFDialect>();
|
scf::SCFDialect>();
|
||||||
postTarget.addDynamicallyLegalOp<spatial::SpatCompute>(
|
postTarget.addDynamicallyLegalOp<spatial::SpatCompute>(
|
||||||
@@ -229,7 +224,7 @@ void ONNXToSpatialPass::runOnOperation() {
|
|||||||
|
|
||||||
wrapTopLevelRuntimeTransposes(*entryFunc);
|
wrapTopLevelRuntimeTransposes(*entryFunc);
|
||||||
|
|
||||||
if (failed(verifyONNXToSpatialHostLegality(*entryFunc))) {
|
if (failed(verifyONNXToSpatial(*entryFunc))) {
|
||||||
moduleOp.emitError("ONNX-to-Spatial host legality verification failed");
|
moduleOp.emitError("ONNX-to-Spatial host legality verification failed");
|
||||||
signalPassFailure();
|
signalPassFailure();
|
||||||
return;
|
return;
|
||||||
|
|||||||
@@ -0,0 +1,56 @@
|
|||||||
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
|
#include "mlir/Support/LLVM.h"
|
||||||
|
|
||||||
|
#include "Common/IR/WeightUtils.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Common/Support/Diagnostics.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ONNXToSpatialVerifier.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
|
using namespace mlir;
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
|
||||||
|
namespace {
|
||||||
|
|
||||||
|
void checkWeightUseChains(func::FuncOp func, pim::CappedDiagnosticReporter& diagnostics) {
|
||||||
|
func.walk([&](Operation* op) {
|
||||||
|
if (!hasWeightAlways(op))
|
||||||
|
return;
|
||||||
|
|
||||||
|
for (Value result : op->getResults()) {
|
||||||
|
if (hasOnlySpatialMvmVmmWeightUses(result))
|
||||||
|
continue;
|
||||||
|
|
||||||
|
diagnostics.report(op, [&](Operation* illegalOp) {
|
||||||
|
illegalOp->emitOpError(
|
||||||
|
"weight-marked values may only flow through static view/slice helper chains into Spatial VMM weights");
|
||||||
|
});
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace
|
||||||
|
|
||||||
|
LogicalResult verifyONNXToSpatial(func::FuncOp funcOp) {
|
||||||
|
pim::CappedDiagnosticReporter diagnostics;
|
||||||
|
|
||||||
|
for (Operation& op : funcOp.getOps()) {
|
||||||
|
if (isa<func::ReturnOp, spatial::SpatCompute, spatial::SpatComputeBatch>(&op))
|
||||||
|
continue;
|
||||||
|
if (isCompileTimeOp(&op))
|
||||||
|
continue;
|
||||||
|
|
||||||
|
diagnostics.report(&op, [](Operation* illegalOp) {
|
||||||
|
illegalOp->emitOpError(
|
||||||
|
"non-foldable top-level runtime op remains after ONNX-to-Spatial; lower it inside spat.compute");
|
||||||
|
});
|
||||||
|
}
|
||||||
|
checkWeightUseChains(funcOp, diagnostics);
|
||||||
|
diagnostics.emitSuppressedSummary(funcOp, "ONNX-to-Spatial verification failed");
|
||||||
|
|
||||||
|
return success(!diagnostics.hasFailure());
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
+1
-1
@@ -5,6 +5,6 @@
|
|||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
|
|
||||||
mlir::LogicalResult verifyONNXToSpatialHostLegality(mlir::func::FuncOp funcOp);
|
mlir::LogicalResult verifyONNXToSpatial(mlir::func::FuncOp funcOp);
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
@@ -11,7 +11,7 @@
|
|||||||
#include "src/Accelerators/PIM/Common/Support/Diagnostics.hpp"
|
#include "src/Accelerators/PIM/Common/Support/Diagnostics.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -391,7 +391,7 @@ static Value lowerSingleConvGroup(Value x,
|
|||||||
const int64_t xbarSize = static_cast<int64_t>(crossbarSize.getValue());
|
const int64_t xbarSize = static_cast<int64_t>(crossbarSize.getValue());
|
||||||
const int64_t wMaxDim = std::max(patchSize, numChannelsOut);
|
const int64_t wMaxDim = std::max(patchSize, numChannelsOut);
|
||||||
const int64_t maxParallelPixels = std::max<int64_t>(1, xbarSize / wMaxDim);
|
const int64_t maxParallelPixels = std::max<int64_t>(1, xbarSize / wMaxDim);
|
||||||
auto wDenseAttr = getHostFoldableDenseElementsAttr(w);
|
auto wDenseAttr = getHostConstDenseElementsAttr(w);
|
||||||
|
|
||||||
// Prepare weight matrix W for crossbar storage:
|
// Prepare weight matrix W for crossbar storage:
|
||||||
// W: [numChannelsOut, numChannelsIn, wHeight, wWidth] -> [numChannelsOut, patchSize] -> [patchSize, numChannelsOut]
|
// W: [numChannelsOut, numChannelsIn, wHeight, wWidth] -> [numChannelsOut, patchSize] -> [patchSize, numChannelsOut]
|
||||||
@@ -412,7 +412,7 @@ static Value lowerSingleConvGroup(Value x,
|
|||||||
DenseElementsAttr biasDenseAttr;
|
DenseElementsAttr biasDenseAttr;
|
||||||
if (hasB) {
|
if (hasB) {
|
||||||
gemmBias = b;
|
gemmBias = b;
|
||||||
biasDenseAttr = getHostFoldableDenseElementsAttr(b);
|
biasDenseAttr = getHostConstDenseElementsAttr(b);
|
||||||
biasMatrix = expandBiasIfNeeded(b, rewriter, loc);
|
biasMatrix = expandBiasIfNeeded(b, rewriter, loc);
|
||||||
}
|
}
|
||||||
const bool canPackWeightsAsConstants = static_cast<bool>(wDenseAttr);
|
const bool canPackWeightsAsConstants = static_cast<bool>(wDenseAttr);
|
||||||
@@ -717,7 +717,7 @@ LogicalResult ConvToGemm::matchAndRewrite(ONNXConvOp convOp,
|
|||||||
}
|
}
|
||||||
|
|
||||||
Value result;
|
Value result;
|
||||||
if (llvm::all_of(groupResults, isHostFoldableValue)) {
|
if (llvm::all_of(groupResults, isCompileTimeComputable)) {
|
||||||
result = createSpatConcat(rewriter, loc, /*axis=*/1, groupResults);
|
result = createSpatConcat(rewriter, loc, /*axis=*/1, groupResults);
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
|
|||||||
File diff suppressed because it is too large
Load Diff
@@ -10,7 +10,7 @@
|
|||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -38,23 +38,16 @@ static FailureOr<SmallVector<int64_t>> inferSupportedBatchShape(ArrayRef<int64_t
|
|||||||
return SmallVector<int64_t>(lhsBatchShape.begin(), lhsBatchShape.end());
|
return SmallVector<int64_t>(lhsBatchShape.begin(), lhsBatchShape.end());
|
||||||
}
|
}
|
||||||
|
|
||||||
static Value collapseBatchDims(Value value,
|
static Value
|
||||||
int64_t batchSize,
|
collapseBatchDims(Value value, int64_t batchSize, int64_t rows, int64_t cols, PatternRewriter& rewriter, Location loc) {
|
||||||
int64_t rows,
|
|
||||||
int64_t cols,
|
|
||||||
PatternRewriter& rewriter,
|
|
||||||
Location loc) {
|
|
||||||
auto type = cast<RankedTensorType>(value.getType());
|
auto type = cast<RankedTensorType>(value.getType());
|
||||||
if (type.getRank() == 2 || type.getRank() == 3)
|
if (type.getRank() == 2 || type.getRank() == 3)
|
||||||
return value;
|
return value;
|
||||||
|
|
||||||
auto collapsedType =
|
auto collapsedType = RankedTensorType::get({batchSize, rows, cols}, type.getElementType(), type.getEncoding());
|
||||||
RankedTensorType::get({batchSize, rows, cols}, type.getElementType(), type.getEncoding());
|
SmallVector<ReassociationIndices> reassociation = {ReassociationIndices {},
|
||||||
SmallVector<ReassociationIndices> reassociation = {
|
ReassociationIndices {static_cast<int64_t>(type.getRank() - 2)},
|
||||||
ReassociationIndices {},
|
ReassociationIndices {static_cast<int64_t>(type.getRank() - 1)}};
|
||||||
ReassociationIndices {static_cast<int64_t>(type.getRank() - 2)},
|
|
||||||
ReassociationIndices {static_cast<int64_t>(type.getRank() - 1)}
|
|
||||||
};
|
|
||||||
for (int64_t dim = 0; dim < type.getRank() - 2; ++dim)
|
for (int64_t dim = 0; dim < type.getRank() - 2; ++dim)
|
||||||
reassociation.front().push_back(dim);
|
reassociation.front().push_back(dim);
|
||||||
|
|
||||||
@@ -62,7 +55,7 @@ static Value collapseBatchDims(Value value,
|
|||||||
return tensor::CollapseShapeOp::create(rewriter, loc, collapsedType, input, reassociation);
|
return tensor::CollapseShapeOp::create(rewriter, loc, collapsedType, input, reassociation);
|
||||||
};
|
};
|
||||||
|
|
||||||
if (isHostFoldableValue(value))
|
if (isCompileTimeComputable(value))
|
||||||
return buildCollapsed(value);
|
return buildCollapsed(value);
|
||||||
|
|
||||||
auto collapseCompute =
|
auto collapseCompute =
|
||||||
@@ -72,19 +65,14 @@ static Value collapseBatchDims(Value value,
|
|||||||
return collapseCompute.getResult(0);
|
return collapseCompute.getResult(0);
|
||||||
}
|
}
|
||||||
|
|
||||||
static Value expandBatchDims(Value value,
|
static Value
|
||||||
RankedTensorType outputType,
|
expandBatchDims(Value value, RankedTensorType outputType, size_t batchRank, PatternRewriter& rewriter, Location loc) {
|
||||||
size_t batchRank,
|
|
||||||
PatternRewriter& rewriter,
|
|
||||||
Location loc) {
|
|
||||||
if (cast<RankedTensorType>(value.getType()) == outputType)
|
if (cast<RankedTensorType>(value.getType()) == outputType)
|
||||||
return value;
|
return value;
|
||||||
|
|
||||||
SmallVector<ReassociationIndices> reassociation = {
|
SmallVector<ReassociationIndices> reassociation = {ReassociationIndices {},
|
||||||
ReassociationIndices {},
|
ReassociationIndices {static_cast<int64_t>(batchRank)},
|
||||||
ReassociationIndices {static_cast<int64_t>(batchRank)},
|
ReassociationIndices {static_cast<int64_t>(batchRank + 1)}};
|
||||||
ReassociationIndices {static_cast<int64_t>(batchRank + 1)}
|
|
||||||
};
|
|
||||||
for (size_t dim = 0; dim < batchRank; ++dim)
|
for (size_t dim = 0; dim < batchRank; ++dim)
|
||||||
reassociation.front().push_back(static_cast<int64_t>(dim));
|
reassociation.front().push_back(static_cast<int64_t>(dim));
|
||||||
|
|
||||||
@@ -126,7 +114,7 @@ static Value extractBatchMatrix(Value value,
|
|||||||
});
|
});
|
||||||
};
|
};
|
||||||
|
|
||||||
if (isHostFoldableValue(value))
|
if (isCompileTimeComputable(value))
|
||||||
return buildMatrix(value);
|
return buildMatrix(value);
|
||||||
|
|
||||||
auto batchMatrixCompute =
|
auto batchMatrixCompute =
|
||||||
@@ -154,7 +142,7 @@ static Value transposeLastTwoDims(Value value, PatternRewriter& rewriter, Locati
|
|||||||
return ONNXTransposeOp::create(rewriter, loc, transposedType, input, rewriter.getI64ArrayAttr(perm));
|
return ONNXTransposeOp::create(rewriter, loc, transposedType, input, rewriter.getI64ArrayAttr(perm));
|
||||||
};
|
};
|
||||||
|
|
||||||
if (isHostFoldableValue(value))
|
if (isCompileTimeComputable(value))
|
||||||
return buildTranspose(value);
|
return buildTranspose(value);
|
||||||
|
|
||||||
auto transposeCompute =
|
auto transposeCompute =
|
||||||
@@ -194,7 +182,7 @@ static Value concatValues(ValueRange inputs, int64_t axis, PatternRewriter& rewr
|
|||||||
outputShape[axis] = concatDimSize;
|
outputShape[axis] = concatDimSize;
|
||||||
auto resultType = RankedTensorType::get(outputShape, firstType.getElementType(), firstType.getEncoding());
|
auto resultType = RankedTensorType::get(outputShape, firstType.getElementType(), firstType.getEncoding());
|
||||||
|
|
||||||
if (llvm::all_of(inputs, isHostFoldableValue))
|
if (llvm::all_of(inputs, isCompileTimeComputable))
|
||||||
return createSpatConcat(rewriter, loc, axis, inputs);
|
return createSpatConcat(rewriter, loc, axis, inputs);
|
||||||
|
|
||||||
auto concatCompute = createSpatCompute(rewriter, loc, TypeRange {resultType}, {}, inputs, [&](ValueRange args) {
|
auto concatCompute = createSpatCompute(rewriter, loc, TypeRange {resultType}, {}, inputs, [&](ValueRange args) {
|
||||||
@@ -247,7 +235,7 @@ struct MatMulToGemm : OpRewritePattern<ONNXMatMulOp> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
Location loc = matmulOp.getLoc();
|
Location loc = matmulOp.getLoc();
|
||||||
bool useTransposedForm = isHostFoldableValue(matmulOp.getA()) && !isHostFoldableValue(matmulOp.getB());
|
bool useTransposedForm = isCompileTimeComputable(matmulOp.getA()) && !isCompileTimeComputable(matmulOp.getB());
|
||||||
|
|
||||||
Value lhs = collapseBatchDims(matmulOp.getA(), lhsBatch, m, k, rewriter, loc);
|
Value lhs = collapseBatchDims(matmulOp.getA(), lhsBatch, m, k, rewriter, loc);
|
||||||
Value rhs = collapseBatchDims(matmulOp.getB(), rhsBatch, k, n, rewriter, loc);
|
Value rhs = collapseBatchDims(matmulOp.getB(), rhsBatch, k, n, rewriter, loc);
|
||||||
|
|||||||
@@ -7,7 +7,7 @@
|
|||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -91,7 +91,7 @@ static Value concatValues(ValueRange inputs, int64_t axis, ConversionPatternRewr
|
|||||||
outputShape[axis] = concatDimSize;
|
outputShape[axis] = concatDimSize;
|
||||||
auto resultType = RankedTensorType::get(outputShape, firstType.getElementType(), firstType.getEncoding());
|
auto resultType = RankedTensorType::get(outputShape, firstType.getElementType(), firstType.getEncoding());
|
||||||
|
|
||||||
if (llvm::all_of(inputs, isHostFoldableValue))
|
if (llvm::all_of(inputs, isCompileTimeComputable))
|
||||||
return createSpatConcat(rewriter, loc, axis, inputs);
|
return createSpatConcat(rewriter, loc, axis, inputs);
|
||||||
|
|
||||||
auto concatCompute = createSpatCompute(rewriter, loc, TypeRange {resultType}, {}, inputs, [&](ValueRange args) {
|
auto concatCompute = createSpatCompute(rewriter, loc, TypeRange {resultType}, {}, inputs, [&](ValueRange args) {
|
||||||
@@ -135,7 +135,7 @@ static Value squeezeReducedAxes(Value keepdimsValue,
|
|||||||
}
|
}
|
||||||
|
|
||||||
auto reassociation = buildCollapseReassociation(reducedAxes);
|
auto reassociation = buildCollapseReassociation(reducedAxes);
|
||||||
if (isHostFoldableValue(keepdimsValue))
|
if (isCompileTimeComputable(keepdimsValue))
|
||||||
return tensor::CollapseShapeOp::create(rewriter, loc, resultType, keepdimsValue, reassociation).getResult();
|
return tensor::CollapseShapeOp::create(rewriter, loc, resultType, keepdimsValue, reassociation).getResult();
|
||||||
|
|
||||||
auto squeezeCompute =
|
auto squeezeCompute =
|
||||||
|
|||||||
@@ -3,7 +3,7 @@
|
|||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/ComputeRegionBuilder.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/ComputeRegionBuilder.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -20,7 +20,7 @@ struct Concat : public OpConversionPattern<ONNXConcatOp> {
|
|||||||
auto inputs = adaptor.getInputs();
|
auto inputs = adaptor.getInputs();
|
||||||
int64_t axis = adaptor.getAxis();
|
int64_t axis = adaptor.getAxis();
|
||||||
|
|
||||||
if (llvm::all_of(inputs, isHostFoldableValue)) {
|
if (llvm::all_of(inputs, isCompileTimeComputable)) {
|
||||||
rewriter.replaceOp(maxpoolOp, createSpatConcat(rewriter, maxpoolOp.getLoc(), axis, inputs));
|
rewriter.replaceOp(maxpoolOp, createSpatConcat(rewriter, maxpoolOp.getLoc(), axis, inputs));
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -5,7 +5,7 @@
|
|||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -115,7 +115,7 @@ struct Reshape : OpConversionPattern<ONNXReshapeOp> {
|
|||||||
}
|
}
|
||||||
|
|
||||||
auto replaceWithReshape = [&](auto buildReshape) -> LogicalResult {
|
auto replaceWithReshape = [&](auto buildReshape) -> LogicalResult {
|
||||||
if (isHostFoldableValue(adaptor.getData())) {
|
if (isCompileTimeComputable(adaptor.getData())) {
|
||||||
rewriter.replaceOp(reshapeOp, buildReshape(adaptor.getData()));
|
rewriter.replaceOp(reshapeOp, buildReshape(adaptor.getData()));
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -58,24 +58,21 @@ static Value buildNearestResizeLoop(Value input,
|
|||||||
|
|
||||||
Value outputC = channelLoop.getInductionVar();
|
Value outputC = channelLoop.getInductionVar();
|
||||||
Value outputChannelAcc = channelLoop.getRegionIterArgs().front();
|
Value outputChannelAcc = channelLoop.getRegionIterArgs().front();
|
||||||
Value inputC =
|
Value inputC = buildNearestAsymmetricIndex(outputC, inputType.getDimSize(1), resultType.getDimSize(1), rewriter, loc);
|
||||||
buildNearestAsymmetricIndex(outputC, inputType.getDimSize(1), resultType.getDimSize(1), rewriter, loc);
|
|
||||||
|
|
||||||
auto heightLoop = scf::ForOp::create(rewriter, loc, c0, cOutputH, c1, ValueRange {outputChannelAcc});
|
auto heightLoop = scf::ForOp::create(rewriter, loc, c0, cOutputH, c1, ValueRange {outputChannelAcc});
|
||||||
rewriter.setInsertionPointToStart(heightLoop.getBody());
|
rewriter.setInsertionPointToStart(heightLoop.getBody());
|
||||||
|
|
||||||
Value outputH = heightLoop.getInductionVar();
|
Value outputH = heightLoop.getInductionVar();
|
||||||
Value outputHeightAcc = heightLoop.getRegionIterArgs().front();
|
Value outputHeightAcc = heightLoop.getRegionIterArgs().front();
|
||||||
Value inputH =
|
Value inputH = buildNearestAsymmetricIndex(outputH, inputType.getDimSize(2), resultType.getDimSize(2), rewriter, loc);
|
||||||
buildNearestAsymmetricIndex(outputH, inputType.getDimSize(2), resultType.getDimSize(2), rewriter, loc);
|
|
||||||
|
|
||||||
auto widthLoop = scf::ForOp::create(rewriter, loc, c0, cOutputW, c1, ValueRange {outputHeightAcc});
|
auto widthLoop = scf::ForOp::create(rewriter, loc, c0, cOutputW, c1, ValueRange {outputHeightAcc});
|
||||||
rewriter.setInsertionPointToStart(widthLoop.getBody());
|
rewriter.setInsertionPointToStart(widthLoop.getBody());
|
||||||
|
|
||||||
Value outputW = widthLoop.getInductionVar();
|
Value outputW = widthLoop.getInductionVar();
|
||||||
Value outputWidthAcc = widthLoop.getRegionIterArgs().front();
|
Value outputWidthAcc = widthLoop.getRegionIterArgs().front();
|
||||||
Value inputW =
|
Value inputW = buildNearestAsymmetricIndex(outputW, inputType.getDimSize(3), resultType.getDimSize(3), rewriter, loc);
|
||||||
buildNearestAsymmetricIndex(outputW, inputType.getDimSize(3), resultType.getDimSize(3), rewriter, loc);
|
|
||||||
|
|
||||||
SmallVector<OpFoldResult> inputOffsets = {inputN, inputC, inputH, inputW};
|
SmallVector<OpFoldResult> inputOffsets = {inputN, inputC, inputH, inputW};
|
||||||
Value inputSlice =
|
Value inputSlice =
|
||||||
@@ -114,8 +111,8 @@ struct Resize : OpConversionPattern<ONNXResizeOp> {
|
|||||||
|
|
||||||
if (resizeOp.getMode() != "nearest" || resizeOp.getCoordinateTransformationMode() != "asymmetric"
|
if (resizeOp.getMode() != "nearest" || resizeOp.getCoordinateTransformationMode() != "asymmetric"
|
||||||
|| resizeOp.getNearestMode() != "floor")
|
|| resizeOp.getNearestMode() != "floor")
|
||||||
return rewriter.notifyMatchFailure(
|
return rewriter.notifyMatchFailure(resizeOp,
|
||||||
resizeOp, "resize lowering currently supports only nearest + asymmetric + floor.");
|
"resize lowering currently supports only nearest + asymmetric + floor.");
|
||||||
|
|
||||||
if (llvm::any_of(inputType.getShape(), [](int64_t dim) { return dim <= 0; })
|
if (llvm::any_of(inputType.getShape(), [](int64_t dim) { return dim <= 0; })
|
||||||
|| llvm::any_of(resultType.getShape(), [](int64_t dim) { return dim <= 0; }))
|
|| llvm::any_of(resultType.getShape(), [](int64_t dim) { return dim <= 0; }))
|
||||||
|
|||||||
@@ -3,7 +3,7 @@
|
|||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/ConversionPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/HostFoldability.hpp"
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -61,7 +61,7 @@ struct Split : OpConversionPattern<ONNXSplitOp> {
|
|||||||
sliceSizes.push_back(resultType.getShape()[axis]);
|
sliceSizes.push_back(resultType.getShape()[axis]);
|
||||||
}
|
}
|
||||||
|
|
||||||
if (isHostFoldableValue(adaptor.getInput())) {
|
if (isCompileTimeComputable(adaptor.getInput())) {
|
||||||
for (int64_t sliceSize : sliceSizes) {
|
for (int64_t sliceSize : sliceSizes) {
|
||||||
outputs.push_back(extractSliceAt(adaptor.getInput(), axis, offset, sliceSize, rewriter, splitOp.getLoc()));
|
outputs.push_back(extractSliceAt(adaptor.getInput(), axis, offset, sliceSize, rewriter, splitOp.getLoc()));
|
||||||
offset += sliceSize;
|
offset += sliceSize;
|
||||||
|
|||||||
@@ -27,66 +27,26 @@ static bool canPromoteInputBlockArgument(BlockArgument arg) {
|
|||||||
return !arg.use_empty() && llvm::all_of(arg.getUsers(), isWeightMaterializationHelperUser);
|
return !arg.use_empty() && llvm::all_of(arg.getUsers(), isWeightMaterializationHelperUser);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static bool canPromoteInputBlockArgument(std::optional<BlockArgument> arg) {
|
||||||
|
return arg && canPromoteInputBlockArgument(*arg);
|
||||||
|
}
|
||||||
|
|
||||||
static bool isDirectConstantValue(Value value) {
|
static bool isDirectConstantValue(Value value) {
|
||||||
return isa_and_nonnull<arith::ConstantOp, ONNXConstantOp>(value.getDefiningOp());
|
return isa_and_nonnull<arith::ConstantOp, ONNXConstantOp>(value.getDefiningOp());
|
||||||
}
|
}
|
||||||
|
|
||||||
template <typename ComputeOpTy>
|
template <typename ComputeOpTy>
|
||||||
static bool hasPromotableWeightLikeInputs(ComputeOpTy compute) {
|
static bool hasPromotableWeightLikeInputs(ComputeOpTy compute) {
|
||||||
Block& block = compute.getBody().front();
|
|
||||||
for (auto [inputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
for (auto [inputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
||||||
if (inputIdx >= block.getNumArguments())
|
|
||||||
continue;
|
|
||||||
if (!isWeightLikeComputeOperand(input))
|
if (!isWeightLikeComputeOperand(input))
|
||||||
continue;
|
continue;
|
||||||
if (isDirectConstantValue(input) && !canPromoteInputBlockArgument(block.getArgument(inputIdx)))
|
if (isDirectConstantValue(input) && !canPromoteInputBlockArgument(compute.getInputArgument(inputIdx)))
|
||||||
continue;
|
continue;
|
||||||
return true;
|
return true;
|
||||||
}
|
}
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
|
|
||||||
// Collapses one-lane batches so later phases do not carry batch-only structure unnecessarily.
|
|
||||||
struct FoldSingleLaneComputeBatchPattern : OpRewritePattern<spatial::SpatComputeBatch> {
|
|
||||||
using OpRewritePattern<spatial::SpatComputeBatch>::OpRewritePattern;
|
|
||||||
|
|
||||||
LogicalResult matchAndRewrite(spatial::SpatComputeBatch batchOp, PatternRewriter& rewriter) const override {
|
|
||||||
if (batchOp.getLaneCount() != 1)
|
|
||||||
return rewriter.notifyMatchFailure(batchOp, "requires a single lane");
|
|
||||||
|
|
||||||
auto loc = batchOp.getLoc();
|
|
||||||
rewriter.setInsertionPoint(batchOp);
|
|
||||||
auto computeOp =
|
|
||||||
spatial::SpatCompute::create(rewriter, loc, batchOp.getResultTypes(), batchOp.getWeights(), batchOp.getInputs());
|
|
||||||
computeOp.getProperties().setOperandSegmentSizes(
|
|
||||||
{static_cast<int>(batchOp.getWeights().size()), static_cast<int>(batchOp.getInputs().size())});
|
|
||||||
|
|
||||||
Block& templateBlock = batchOp.getBody().front();
|
|
||||||
SmallVector<Type> blockArgTypes;
|
|
||||||
SmallVector<Location> blockArgLocs;
|
|
||||||
blockArgTypes.reserve(templateBlock.getNumArguments());
|
|
||||||
blockArgLocs.reserve(templateBlock.getNumArguments());
|
|
||||||
for (BlockArgument arg : templateBlock.getArguments()) {
|
|
||||||
blockArgTypes.push_back(arg.getType());
|
|
||||||
blockArgLocs.push_back(loc);
|
|
||||||
}
|
|
||||||
|
|
||||||
auto* newBlock =
|
|
||||||
rewriter.createBlock(&computeOp.getBody(), computeOp.getBody().end(), TypeRange(blockArgTypes), blockArgLocs);
|
|
||||||
IRMapping mapper;
|
|
||||||
for (auto [oldArg, newArg] : llvm::zip(templateBlock.getArguments(), newBlock->getArguments()))
|
|
||||||
mapper.map(oldArg, newArg);
|
|
||||||
|
|
||||||
rewriter.setInsertionPointToEnd(newBlock);
|
|
||||||
for (Operation& op : templateBlock)
|
|
||||||
rewriter.clone(op, mapper);
|
|
||||||
|
|
||||||
batchOp->replaceAllUsesWith(computeOp->getResults());
|
|
||||||
rewriter.eraseOp(batchOp);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// Promotes foldable helper chains from runtime inputs to weights to avoid artificial compute inputs.
|
// Promotes foldable helper chains from runtime inputs to weights to avoid artificial compute inputs.
|
||||||
struct PromoteWeightLikeComputeInputsPattern : OpRewritePattern<spatial::SpatCompute> {
|
struct PromoteWeightLikeComputeInputsPattern : OpRewritePattern<spatial::SpatCompute> {
|
||||||
using OpRewritePattern<spatial::SpatCompute>::OpRewritePattern;
|
using OpRewritePattern<spatial::SpatCompute>::OpRewritePattern;
|
||||||
@@ -96,11 +56,9 @@ struct PromoteWeightLikeComputeInputsPattern : OpRewritePattern<spatial::SpatCom
|
|||||||
bool needsRewrite = false;
|
bool needsRewrite = false;
|
||||||
Block& oldBlock = compute.getBody().front();
|
Block& oldBlock = compute.getBody().front();
|
||||||
for (auto [inputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
for (auto [inputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
||||||
if (inputIdx >= oldBlock.getNumArguments())
|
|
||||||
continue;
|
|
||||||
if (!isWeightLikeComputeOperand(input))
|
if (!isWeightLikeComputeOperand(input))
|
||||||
continue;
|
continue;
|
||||||
if (isDirectConstantValue(input) && !canPromoteInputBlockArgument(oldBlock.getArgument(inputIdx)))
|
if (isDirectConstantValue(input) && !canPromoteInputBlockArgument(compute.getInputArgument(inputIdx)))
|
||||||
continue;
|
continue;
|
||||||
promoteInput[inputIdx] = true;
|
promoteInput[inputIdx] = true;
|
||||||
needsRewrite = true;
|
needsRewrite = true;
|
||||||
@@ -131,8 +89,16 @@ struct PromoteWeightLikeComputeInputsPattern : OpRewritePattern<spatial::SpatCom
|
|||||||
|
|
||||||
auto newCompute =
|
auto newCompute =
|
||||||
spatial::SpatCompute::create(rewriter, compute.getLoc(), compute.getResultTypes(), newWeights, newInputs);
|
spatial::SpatCompute::create(rewriter, compute.getLoc(), compute.getResultTypes(), newWeights, newInputs);
|
||||||
auto* newBlock =
|
SmallVector<Type> newBlockArgTypes;
|
||||||
rewriter.createBlock(&newCompute.getBody(), newCompute.getBody().end(), newInputTypes, newInputLocs);
|
SmallVector<Location> newBlockArgLocs;
|
||||||
|
for (Value weight : newWeights) {
|
||||||
|
newBlockArgTypes.push_back(weight.getType());
|
||||||
|
newBlockArgLocs.push_back(weight.getLoc());
|
||||||
|
}
|
||||||
|
llvm::append_range(newBlockArgTypes, newInputTypes);
|
||||||
|
llvm::append_range(newBlockArgLocs, newInputLocs);
|
||||||
|
auto* newBlock = rewriter.createBlock(
|
||||||
|
&newCompute.getBody(), newCompute.getBody().end(), TypeRange(newBlockArgTypes), newBlockArgLocs);
|
||||||
newCompute.getProperties().setOperandSegmentSizes(
|
newCompute.getProperties().setOperandSegmentSizes(
|
||||||
{static_cast<int>(newWeights.size()), static_cast<int>(newInputs.size())});
|
{static_cast<int>(newWeights.size()), static_cast<int>(newInputs.size())});
|
||||||
rewriter.setInsertionPointToStart(newBlock);
|
rewriter.setInsertionPointToStart(newBlock);
|
||||||
@@ -141,17 +107,30 @@ struct PromoteWeightLikeComputeInputsPattern : OpRewritePattern<spatial::SpatCom
|
|||||||
bodyRewriter.setInsertionPointToStart(newBlock);
|
bodyRewriter.setInsertionPointToStart(newBlock);
|
||||||
|
|
||||||
IRMapping mapper;
|
IRMapping mapper;
|
||||||
|
for (auto [weightIndex, weight] : llvm::enumerate(compute.getWeights())) {
|
||||||
|
auto oldWeightArg = compute.getWeightArgument(weightIndex);
|
||||||
|
auto newWeightArg = newCompute.getWeightArgument(weightIndex);
|
||||||
|
if (!oldWeightArg || !newWeightArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute weight block argument during rewrite");
|
||||||
|
mapper.map(*oldWeightArg, *newWeightArg);
|
||||||
|
}
|
||||||
size_t newInputIdx = 0;
|
size_t newInputIdx = 0;
|
||||||
for (auto [oldInputIdx, oldArg] : llvm::enumerate(oldBlock.getArguments())) {
|
for (auto [oldInputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
||||||
|
auto oldArg = compute.getInputArgument(oldInputIdx);
|
||||||
|
if (!oldArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute input block argument during rewrite");
|
||||||
if (!promoteInput[oldInputIdx]) {
|
if (!promoteInput[oldInputIdx]) {
|
||||||
mapper.map(oldArg, newBlock->getArgument(newInputIdx++));
|
auto newInputArg = newCompute.getInputArgument(newInputIdx++);
|
||||||
|
if (!newInputArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing rewritten compute input block argument");
|
||||||
|
mapper.map(*oldArg, *newInputArg);
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
auto clonedValue = materializeWeightLikeValueInBlock(compute.getInputs()[oldInputIdx], bodyRewriter, mapper);
|
auto clonedValue = materializeWeightLikeValueInBlock(input, bodyRewriter, mapper);
|
||||||
if (failed(clonedValue))
|
if (failed(clonedValue))
|
||||||
return rewriter.notifyMatchFailure(compute, "failed to materialize promoted weight-like operand");
|
return rewriter.notifyMatchFailure(compute, "failed to materialize promoted weight-like operand");
|
||||||
mapper.map(oldArg, *clonedValue);
|
mapper.map(*oldArg, *clonedValue);
|
||||||
}
|
}
|
||||||
|
|
||||||
for (Operation& op : oldBlock.without_terminator())
|
for (Operation& op : oldBlock.without_terminator())
|
||||||
@@ -180,11 +159,9 @@ struct PromoteWeightLikeComputeBatchInputsPattern : OpRewritePattern<spatial::Sp
|
|||||||
bool needsRewrite = false;
|
bool needsRewrite = false;
|
||||||
Block& oldBlock = compute.getBody().front();
|
Block& oldBlock = compute.getBody().front();
|
||||||
for (auto [inputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
for (auto [inputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
||||||
if (inputIdx >= oldBlock.getNumArguments())
|
|
||||||
continue;
|
|
||||||
if (!isWeightLikeComputeOperand(input))
|
if (!isWeightLikeComputeOperand(input))
|
||||||
continue;
|
continue;
|
||||||
if (isDirectConstantValue(input) && !canPromoteInputBlockArgument(oldBlock.getArgument(inputIdx)))
|
if (isDirectConstantValue(input) && !canPromoteInputBlockArgument(compute.getInputArgument(inputIdx)))
|
||||||
continue;
|
continue;
|
||||||
promoteInput[inputIdx] = true;
|
promoteInput[inputIdx] = true;
|
||||||
needsRewrite = true;
|
needsRewrite = true;
|
||||||
@@ -220,8 +197,31 @@ struct PromoteWeightLikeComputeBatchInputsPattern : OpRewritePattern<spatial::Sp
|
|||||||
rewriter.getI32IntegerAttr(static_cast<int32_t>(compute.getLaneCount())),
|
rewriter.getI32IntegerAttr(static_cast<int32_t>(compute.getLaneCount())),
|
||||||
newWeights,
|
newWeights,
|
||||||
newInputs);
|
newInputs);
|
||||||
auto* newBlock =
|
auto laneArg = compute.getLaneArgument();
|
||||||
rewriter.createBlock(&newCompute.getBody(), newCompute.getBody().end(), newInputTypes, newInputLocs);
|
if (!laneArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute_batch lane block argument");
|
||||||
|
SmallVector<Type> newBlockArgTypes;
|
||||||
|
SmallVector<Location> newBlockArgLocs;
|
||||||
|
newBlockArgTypes.reserve(1 + newWeights.size() + newInputTypes.size() + compute.getNumResults());
|
||||||
|
newBlockArgLocs.reserve(1 + newWeights.size() + newInputLocs.size() + compute.getNumResults());
|
||||||
|
newBlockArgTypes.push_back(laneArg->getType());
|
||||||
|
newBlockArgLocs.push_back(laneArg->getLoc());
|
||||||
|
for (Value weight : newWeights) {
|
||||||
|
newBlockArgTypes.push_back(weight.getType());
|
||||||
|
newBlockArgLocs.push_back(weight.getLoc());
|
||||||
|
}
|
||||||
|
llvm::append_range(newBlockArgTypes, newInputTypes);
|
||||||
|
llvm::append_range(newBlockArgLocs, newInputLocs);
|
||||||
|
for (auto [resultIndex, resultType] : llvm::enumerate(compute.getResultTypes())) {
|
||||||
|
auto outputArg = compute.getOutputArgument(resultIndex);
|
||||||
|
if (!outputArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute_batch output block argument");
|
||||||
|
newBlockArgTypes.push_back(resultType);
|
||||||
|
newBlockArgLocs.push_back(outputArg->getLoc());
|
||||||
|
}
|
||||||
|
|
||||||
|
auto* newBlock = rewriter.createBlock(
|
||||||
|
&newCompute.getBody(), newCompute.getBody().end(), TypeRange(newBlockArgTypes), newBlockArgLocs);
|
||||||
newCompute.getProperties().setOperandSegmentSizes(
|
newCompute.getProperties().setOperandSegmentSizes(
|
||||||
{static_cast<int>(newWeights.size()), static_cast<int>(newInputs.size())});
|
{static_cast<int>(newWeights.size()), static_cast<int>(newInputs.size())});
|
||||||
rewriter.setInsertionPointToStart(newBlock);
|
rewriter.setInsertionPointToStart(newBlock);
|
||||||
@@ -230,31 +230,45 @@ struct PromoteWeightLikeComputeBatchInputsPattern : OpRewritePattern<spatial::Sp
|
|||||||
bodyRewriter.setInsertionPointToStart(newBlock);
|
bodyRewriter.setInsertionPointToStart(newBlock);
|
||||||
|
|
||||||
IRMapping mapper;
|
IRMapping mapper;
|
||||||
|
auto newLaneArg = newCompute.getLaneArgument();
|
||||||
|
if (!newLaneArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing rewritten compute_batch lane block argument");
|
||||||
|
mapper.map(*laneArg, *newLaneArg);
|
||||||
|
for (auto [weightIndex, weight] : llvm::enumerate(compute.getWeights())) {
|
||||||
|
auto oldWeightArg = compute.getWeightArgument(weightIndex);
|
||||||
|
auto newWeightArg = newCompute.getWeightArgument(weightIndex);
|
||||||
|
if (!oldWeightArg || !newWeightArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute_batch weight block argument during rewrite");
|
||||||
|
mapper.map(*oldWeightArg, *newWeightArg);
|
||||||
|
}
|
||||||
size_t newInputIdx = 0;
|
size_t newInputIdx = 0;
|
||||||
for (auto [oldInputIdx, oldArg] : llvm::enumerate(oldBlock.getArguments())) {
|
for (auto [oldInputIdx, input] : llvm::enumerate(compute.getInputs())) {
|
||||||
|
auto oldArg = compute.getInputArgument(oldInputIdx);
|
||||||
|
if (!oldArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute_batch input block argument during rewrite");
|
||||||
if (!promoteInput[oldInputIdx]) {
|
if (!promoteInput[oldInputIdx]) {
|
||||||
mapper.map(oldArg, newBlock->getArgument(newInputIdx++));
|
auto newInputArg = newCompute.getInputArgument(newInputIdx++);
|
||||||
|
if (!newInputArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing rewritten compute_batch input block argument");
|
||||||
|
mapper.map(*oldArg, *newInputArg);
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
auto clonedValue = materializeWeightLikeValueInBlock(compute.getInputs()[oldInputIdx], bodyRewriter, mapper);
|
auto clonedValue = materializeWeightLikeValueInBlock(input, bodyRewriter, mapper);
|
||||||
if (failed(clonedValue))
|
if (failed(clonedValue))
|
||||||
return rewriter.notifyMatchFailure(compute, "failed to materialize promoted batch weight-like operand");
|
return rewriter.notifyMatchFailure(compute, "failed to materialize promoted batch weight-like operand");
|
||||||
mapper.map(oldArg, *clonedValue);
|
mapper.map(*oldArg, *clonedValue);
|
||||||
|
}
|
||||||
|
for (auto resultIndex : llvm::seq<size_t>(0, compute.getNumResults())) {
|
||||||
|
auto outputArg = compute.getOutputArgument(resultIndex);
|
||||||
|
if (!outputArg)
|
||||||
|
return rewriter.notifyMatchFailure(compute, "missing compute_batch output block argument during rewrite");
|
||||||
|
mapper.map(*outputArg, newBlock->getArgument(1 + newWeights.size() + newInputs.size() + resultIndex));
|
||||||
}
|
}
|
||||||
|
|
||||||
for (Operation& op : oldBlock.without_terminator())
|
for (Operation& op : oldBlock)
|
||||||
rewriter.clone(op, mapper);
|
rewriter.clone(op, mapper);
|
||||||
|
|
||||||
auto oldYield = cast<spatial::SpatYieldOp>(oldBlock.getTerminator());
|
|
||||||
SmallVector<Value> newYieldOperands;
|
|
||||||
newYieldOperands.reserve(oldYield.getOutputs().size());
|
|
||||||
for (Value operand : oldYield.getOutputs()) {
|
|
||||||
auto mapped = mapper.lookupOrNull(operand);
|
|
||||||
newYieldOperands.push_back(mapped ? cast<Value>(mapped) : operand);
|
|
||||||
}
|
|
||||||
spatial::SpatYieldOp::create(rewriter, oldYield.getLoc(), newYieldOperands);
|
|
||||||
|
|
||||||
rewriter.replaceOp(compute, newCompute.getResults());
|
rewriter.replaceOp(compute, newCompute.getResults());
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
@@ -262,10 +276,6 @@ struct PromoteWeightLikeComputeBatchInputsPattern : OpRewritePattern<spatial::Sp
|
|||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
void populateEarlyPostPatterns(RewritePatternSet& patterns, MLIRContext* ctx) {
|
|
||||||
patterns.add<FoldSingleLaneComputeBatchPattern>(ctx);
|
|
||||||
}
|
|
||||||
|
|
||||||
void populatePostPatterns(RewritePatternSet& patterns, MLIRContext* ctx) {
|
void populatePostPatterns(RewritePatternSet& patterns, MLIRContext* ctx) {
|
||||||
patterns.add<PromoteWeightLikeComputeInputsPattern, PromoteWeightLikeComputeBatchInputsPattern>(ctx);
|
patterns.add<PromoteWeightLikeComputeInputsPattern, PromoteWeightLikeComputeBatchInputsPattern>(ctx);
|
||||||
}
|
}
|
||||||
@@ -277,8 +287,6 @@ void annotateWeightsConstants(func::FuncOp funcOp) {
|
|||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
bool requiresEarlyPostRewrite(spatial::SpatComputeBatch batchOp) { return batchOp.getLaneCount() == 1; }
|
|
||||||
|
|
||||||
bool requiresPostRewrite(spatial::SpatCompute computeOp) { return hasPromotableWeightLikeInputs(computeOp); }
|
bool requiresPostRewrite(spatial::SpatCompute computeOp) { return hasPromotableWeightLikeInputs(computeOp); }
|
||||||
|
|
||||||
bool requiresPostRewrite(spatial::SpatComputeBatch computeOp) { return hasPromotableWeightLikeInputs(computeOp); }
|
bool requiresPostRewrite(spatial::SpatComputeBatch computeOp) { return hasPromotableWeightLikeInputs(computeOp); }
|
||||||
|
|||||||
@@ -7,14 +7,10 @@
|
|||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
|
|
||||||
bool requiresEarlyPostRewrite(spatial::SpatComputeBatch batchOp);
|
|
||||||
|
|
||||||
bool requiresPostRewrite(spatial::SpatCompute computeOp);
|
bool requiresPostRewrite(spatial::SpatCompute computeOp);
|
||||||
|
|
||||||
bool requiresPostRewrite(spatial::SpatComputeBatch computeOp);
|
bool requiresPostRewrite(spatial::SpatComputeBatch computeOp);
|
||||||
|
|
||||||
void populateEarlyPostPatterns(mlir::RewritePatternSet& patterns, mlir::MLIRContext* ctx);
|
|
||||||
|
|
||||||
void populatePostPatterns(mlir::RewritePatternSet& patterns, mlir::MLIRContext* ctx);
|
void populatePostPatterns(mlir::RewritePatternSet& patterns, mlir::MLIRContext* ctx);
|
||||||
|
|
||||||
void annotateWeightsConstants(mlir::func::FuncOp funcOp);
|
void annotateWeightsConstants(mlir::func::FuncOp funcOp);
|
||||||
|
|||||||
@@ -1,11 +1,14 @@
|
|||||||
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
#include "mlir/Dialect/Bufferization/IR/Bufferization.h"
|
#include "mlir/Dialect/Bufferization/IR/Bufferization.h"
|
||||||
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
||||||
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
||||||
#include "mlir/IR/IRMapping.h"
|
#include "mlir/IR/IRMapping.h"
|
||||||
|
#include "mlir/IR/Matchers.h"
|
||||||
|
|
||||||
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
|
#include "Conversion/SpatialToPim/SpatialToPimPass.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/BatchCoreLoweringPatterns.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
|
||||||
@@ -15,7 +18,17 @@ using namespace onnx_mlir::pim;
|
|||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
static int32_t translateSpatialCoreIdToPimCoreId(size_t spatialCoreId) { return static_cast<int32_t>(spatialCoreId); }
|
static bool isExplicitHostOperand(Operation* op, unsigned operandIndex) {
|
||||||
|
if (isa<pim::PimMemCopyDevToHostOp>(op))
|
||||||
|
return operandIndex == 2;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isUsedOnlyAsExplicitHostOperand(Value value) {
|
||||||
|
return !value.use_empty() && llvm::all_of(value.getUses(), [](OpOperand& use) {
|
||||||
|
return isExplicitHostOperand(use.getOwner(), use.getOperandNumber());
|
||||||
|
});
|
||||||
|
}
|
||||||
|
|
||||||
static SmallVector<int32_t> getPimCoreIdsForBatchOp(spatial::SpatComputeBatch computeBatchOp, size_t& fallbackCoreId) {
|
static SmallVector<int32_t> getPimCoreIdsForBatchOp(spatial::SpatComputeBatch computeBatchOp, size_t& fallbackCoreId) {
|
||||||
if (auto coreIdsAttr = computeBatchOp->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName))
|
if (auto coreIdsAttr = computeBatchOp->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName))
|
||||||
@@ -28,54 +41,75 @@ static SmallVector<int32_t> getPimCoreIdsForBatchOp(spatial::SpatComputeBatch co
|
|||||||
return coreIds;
|
return coreIds;
|
||||||
}
|
}
|
||||||
|
|
||||||
static void lowerChannelSendTensorBatch(spatial::SpatChannelSendTensorBatchOp sendTensorBatchOp,
|
static FailureOr<unsigned> getDirectReturnOperandIndex(OpResult result) {
|
||||||
IRMapping& mapper,
|
if (!result.hasOneUse())
|
||||||
IRRewriter& rewriter) {
|
return failure();
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
targetCoreIds.reserve(sendTensorBatchOp.getTargetCoreIds().size());
|
|
||||||
for (int32_t targetCoreId : sendTensorBatchOp.getTargetCoreIds())
|
|
||||||
targetCoreIds.push_back(translateSpatialCoreIdToPimCoreId(targetCoreId));
|
|
||||||
|
|
||||||
pim::PimSendTensorBatchOp::create(rewriter,
|
auto returnOp = dyn_cast<func::ReturnOp>(*result.getUsers().begin());
|
||||||
sendTensorBatchOp.getLoc(),
|
if (!returnOp)
|
||||||
mapper.lookup(sendTensorBatchOp.getInput()),
|
return failure();
|
||||||
rewriter.getDenseI32ArrayAttr(targetCoreIds));
|
return result.getUses().begin()->getOperandNumber();
|
||||||
}
|
}
|
||||||
|
|
||||||
static void lowerChannelReceiveTensorBatch(spatial::SpatChannelReceiveTensorBatchOp receiveTensorBatchOp,
|
static Value createScaledIndexValue(IRRewriter& rewriter, Location loc, Value base, int64_t scale) {
|
||||||
IRMapping& mapper,
|
if (scale == 1)
|
||||||
IRRewriter& rewriter) {
|
return base;
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
sourceCoreIds.reserve(receiveTensorBatchOp.getSourceCoreIds().size());
|
|
||||||
for (int32_t sourceCoreId : receiveTensorBatchOp.getSourceCoreIds())
|
|
||||||
sourceCoreIds.push_back(translateSpatialCoreIdToPimCoreId(sourceCoreId));
|
|
||||||
|
|
||||||
auto outputType = cast<ShapedType>(receiveTensorBatchOp.getOutput().getType());
|
auto scaleValue = arith::ConstantIndexOp::create(rewriter, loc, scale).getResult();
|
||||||
auto outputBuffer = createEmptyTensorFromShaped(rewriter, receiveTensorBatchOp.getLoc(), outputType);
|
return arith::MulIOp::create(rewriter, loc, base, scaleValue).getResult();
|
||||||
Value received = pim::PimReceiveTensorBatchOp::create(rewriter,
|
}
|
||||||
receiveTensorBatchOp.getLoc(),
|
|
||||||
outputBuffer.getType(),
|
static Value createHostTargetOffset(IRRewriter& rewriter,
|
||||||
outputBuffer,
|
tensor::ParallelInsertSliceOp insertSlice,
|
||||||
rewriter.getDenseI32ArrayAttr(sourceCoreIds))
|
ShapedType destinationType,
|
||||||
.getOutput();
|
IRMapping& mapper) {
|
||||||
mapper.map(receiveTensorBatchOp.getOutput(), received);
|
int64_t elementBytes = static_cast<int64_t>(getElementTypeSizeInBytes(destinationType.getElementType()));
|
||||||
|
SmallVector<int64_t> strides(destinationType.getRank(), 1);
|
||||||
|
ArrayRef<int64_t> shape = destinationType.getShape();
|
||||||
|
for (int64_t dim = destinationType.getRank() - 2; dim >= 0; --dim)
|
||||||
|
strides[dim] = strides[dim + 1] * shape[dim + 1];
|
||||||
|
|
||||||
|
Value totalOffset;
|
||||||
|
Location loc = insertSlice.getLoc();
|
||||||
|
for (auto [dim, offset] : llvm::enumerate(insertSlice.getMixedOffsets())) {
|
||||||
|
int64_t scale = strides[dim] * elementBytes;
|
||||||
|
Value scaledOffset;
|
||||||
|
if (auto attr = dyn_cast<Attribute>(offset)) {
|
||||||
|
auto intAttr = dyn_cast<IntegerAttr>(attr);
|
||||||
|
assert(intAttr && "expected integer offset attribute");
|
||||||
|
scaledOffset = arith::ConstantIndexOp::create(rewriter, loc, intAttr.getInt() * scale).getResult();
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
scaledOffset = createScaledIndexValue(rewriter, loc, mapper.lookupOrDefault(cast<Value>(offset)), scale);
|
||||||
|
}
|
||||||
|
|
||||||
|
totalOffset =
|
||||||
|
totalOffset ? arith::AddIOp::create(rewriter, loc, totalOffset, scaledOffset).getResult() : scaledOffset;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!totalOffset)
|
||||||
|
totalOffset = arith::ConstantIndexOp::create(rewriter, loc, 0).getResult();
|
||||||
|
return totalOffset;
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
LogicalResult
|
LogicalResult raptor::SpatialToPimPass::lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp,
|
||||||
lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState& state, IRRewriter& rewriter) {
|
IRRewriter& rewriter) {
|
||||||
if (computeBatchOp.getNumResults() != 0)
|
|
||||||
return computeBatchOp.emitOpError(
|
|
||||||
"batched Spatial-to-PIM lowering currently requires channelized compute_batch with no results");
|
|
||||||
|
|
||||||
Location loc = computeBatchOp.getLoc();
|
Location loc = computeBatchOp.getLoc();
|
||||||
Block& oldBlock = computeBatchOp.getBody().front();
|
Block& oldBlock = computeBatchOp.getBody().front();
|
||||||
auto oldYield = cast<spatial::SpatYieldOp>(oldBlock.getTerminator());
|
auto oldYield = dyn_cast<spatial::SpatYieldOp>(oldBlock.getTerminator());
|
||||||
if (oldYield.getNumOperands() != 0)
|
auto inParallelOp = dyn_cast<spatial::SpatInParallelOp>(oldBlock.getTerminator());
|
||||||
return computeBatchOp.emitOpError("batched Spatial-to-PIM lowering currently requires empty spat.yield");
|
if (computeBatchOp.getNumResults() == 0) {
|
||||||
|
if (!oldYield || oldYield.getNumOperands() != 0)
|
||||||
|
return computeBatchOp.emitOpError("resultless compute_batch lowering requires empty spat.yield");
|
||||||
|
}
|
||||||
|
else if (!inParallelOp) {
|
||||||
|
return computeBatchOp.emitOpError(
|
||||||
|
"resultful compute_batch lowering currently requires a spat.in_parallel terminator");
|
||||||
|
}
|
||||||
|
|
||||||
SmallVector<int32_t> coreIds = getPimCoreIdsForBatchOp(computeBatchOp, state.nextCoreId);
|
SmallVector<int32_t> coreIds = getPimCoreIdsForBatchOp(computeBatchOp, coreId);
|
||||||
SmallVector<Value> batchWeights(computeBatchOp.getWeights().begin(), computeBatchOp.getWeights().end());
|
SmallVector<Value> batchWeights(computeBatchOp.getWeights().begin(), computeBatchOp.getWeights().end());
|
||||||
SmallVector<Value> batchInputs;
|
SmallVector<Value> batchInputs;
|
||||||
if (!computeBatchOp.getInputs().empty())
|
if (!computeBatchOp.getInputs().empty())
|
||||||
@@ -91,9 +125,22 @@ lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState&
|
|||||||
{static_cast<int>(batchWeights.size()), static_cast<int>(batchInputs.size())});
|
{static_cast<int>(batchWeights.size()), static_cast<int>(batchInputs.size())});
|
||||||
coreBatchOp->setAttr(onnx_mlir::kCoreIdsAttrName, rewriter.getDenseI32ArrayAttr(coreIds));
|
coreBatchOp->setAttr(onnx_mlir::kCoreIdsAttrName, rewriter.getDenseI32ArrayAttr(coreIds));
|
||||||
|
|
||||||
|
SmallVector<unsigned> returnOperandIndices;
|
||||||
|
if (computeBatchOp.getNumResults() != 0) {
|
||||||
|
returnOperandIndices.resize(computeBatchOp.getNumResults());
|
||||||
|
for (auto [resultIndex, result] : llvm::enumerate(computeBatchOp.getResults())) {
|
||||||
|
FailureOr<unsigned> returnOperandIndex = getDirectReturnOperandIndex(cast<OpResult>(result));
|
||||||
|
if (failed(returnOperandIndex))
|
||||||
|
return computeBatchOp.emitOpError(
|
||||||
|
"resultful compute_batch lowering currently requires each result to be used directly by func.return");
|
||||||
|
returnOperandIndices[resultIndex] = *returnOperandIndex;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
SmallVector<Type> blockArgTypes;
|
SmallVector<Type> blockArgTypes;
|
||||||
SmallVector<Location> blockArgLocs;
|
SmallVector<Location> blockArgLocs;
|
||||||
for (BlockArgument arg : oldBlock.getArguments()) {
|
unsigned inputArgLimit = 1 + computeBatchOp.getWeights().size() + computeBatchOp.getInputs().size();
|
||||||
|
for (BlockArgument arg : oldBlock.getArguments().take_front(inputArgLimit)) {
|
||||||
blockArgTypes.push_back(arg.getType());
|
blockArgTypes.push_back(arg.getType());
|
||||||
blockArgLocs.push_back(arg.getLoc());
|
blockArgLocs.push_back(arg.getLoc());
|
||||||
}
|
}
|
||||||
@@ -102,7 +149,21 @@ lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState&
|
|||||||
|
|
||||||
IRMapping mapper;
|
IRMapping mapper;
|
||||||
rewriter.setInsertionPointToStart(newBlock);
|
rewriter.setInsertionPointToStart(newBlock);
|
||||||
for (auto [oldArg, newArg] : llvm::zip(oldBlock.getArguments(), newBlock->getArguments())) {
|
auto oldLaneArg = computeBatchOp.getLaneArgument();
|
||||||
|
if (!oldLaneArg)
|
||||||
|
return computeBatchOp.emitOpError("expected compute_batch lane block argument before lowering");
|
||||||
|
mapper.map(*oldLaneArg, coreBatchOp.getLaneArgument());
|
||||||
|
for (unsigned weightIndex = 0; weightIndex < computeBatchOp.getWeights().size(); ++weightIndex) {
|
||||||
|
auto oldWeightArg = computeBatchOp.getWeightArgument(weightIndex);
|
||||||
|
if (!oldWeightArg)
|
||||||
|
return computeBatchOp.emitOpError("expected compute_batch weight block arguments before lowering");
|
||||||
|
mapper.map(*oldWeightArg, coreBatchOp.getWeightArgument(weightIndex));
|
||||||
|
}
|
||||||
|
for (unsigned inputIndex = 0; inputIndex < computeBatchOp.getInputs().size(); ++inputIndex) {
|
||||||
|
auto oldArg = computeBatchOp.getInputArgument(inputIndex);
|
||||||
|
if (!oldArg)
|
||||||
|
return computeBatchOp.emitOpError("expected compute_batch input block arguments before lowering");
|
||||||
|
BlockArgument newArg = coreBatchOp.getInputArgument(inputIndex);
|
||||||
auto newArgType = cast<ShapedType>(newArg.getType());
|
auto newArgType = cast<ShapedType>(newArg.getType());
|
||||||
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, newArgType);
|
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, newArgType);
|
||||||
auto copied = pim::PimMemCopyHostToDevBatchOp::create(rewriter,
|
auto copied = pim::PimMemCopyHostToDevBatchOp::create(rewriter,
|
||||||
@@ -114,7 +175,7 @@ lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState&
|
|||||||
rewriter.getI32IntegerAttr(0),
|
rewriter.getI32IntegerAttr(0),
|
||||||
getTensorSizeInBytesAttr(rewriter, newArg))
|
getTensorSizeInBytesAttr(rewriter, newArg))
|
||||||
.getOutput();
|
.getOutput();
|
||||||
mapper.map(oldArg, copied);
|
mapper.map(*oldArg, copied);
|
||||||
}
|
}
|
||||||
|
|
||||||
auto materializeCapturedTensor = [&](Value capturedTensor) -> Value {
|
auto materializeCapturedTensor = [&](Value capturedTensor) -> Value {
|
||||||
@@ -136,41 +197,52 @@ lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState&
|
|||||||
return copied;
|
return copied;
|
||||||
};
|
};
|
||||||
|
|
||||||
|
SmallVector<Value> hostOutputTensors(returnOperandIndices.size());
|
||||||
|
auto getOrCreateHostOutputTensor = [&](unsigned resultIndex, Location resultLoc) -> Value {
|
||||||
|
Value& hostOutputTensor = hostOutputTensors[resultIndex];
|
||||||
|
if (hostOutputTensor)
|
||||||
|
return hostOutputTensor;
|
||||||
|
|
||||||
|
hostOutputTensor = outputTensors[returnOperandIndices[resultIndex]](rewriter, resultLoc);
|
||||||
|
return hostOutputTensor;
|
||||||
|
};
|
||||||
|
|
||||||
rewriter.setInsertionPointToEnd(newBlock);
|
rewriter.setInsertionPointToEnd(newBlock);
|
||||||
for (Operation& op : oldBlock) {
|
for (Operation& op : oldBlock) {
|
||||||
if (isa<spatial::SpatYieldOp>(op))
|
if (isa<spatial::SpatYieldOp>(op))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (auto sendBatchOp = dyn_cast<spatial::SpatChannelSendBatchOp>(op)) {
|
if (auto parallelOp = dyn_cast<spatial::SpatInParallelOp>(op)) {
|
||||||
pim::PimSendBatchOp::create(rewriter,
|
auto firstOutputArg = computeBatchOp.getOutputArgument(0);
|
||||||
loc,
|
if (!firstOutputArg)
|
||||||
mapper.lookup(sendBatchOp.getInput()),
|
return computeBatchOp.emitOpError("expected compute_batch output block arguments before lowering");
|
||||||
getTensorSizeInBytesAttr(rewriter, mapper.lookup(sendBatchOp.getInput())),
|
for (Operation& nestedOp : parallelOp.getRegion().front()) {
|
||||||
sendBatchOp.getTargetCoreIdsAttr());
|
auto insertSlice = dyn_cast<tensor::ParallelInsertSliceOp>(&nestedOp);
|
||||||
continue;
|
if (!insertSlice)
|
||||||
}
|
return parallelOp.emitOpError("expected only tensor.parallel_insert_slice in spat.in_parallel");
|
||||||
|
|
||||||
if (auto sendTensorBatchOp = dyn_cast<spatial::SpatChannelSendTensorBatchOp>(op)) {
|
auto outputArg = dyn_cast<BlockArgument>(insertSlice.getDest());
|
||||||
lowerChannelSendTensorBatch(sendTensorBatchOp, mapper, rewriter);
|
if (!outputArg || outputArg.getOwner() != &oldBlock)
|
||||||
continue;
|
return insertSlice.emitOpError("expected compute_batch output block argument destination");
|
||||||
}
|
|
||||||
|
|
||||||
if (auto receiveBatchOp = dyn_cast<spatial::SpatChannelReceiveBatchOp>(op)) {
|
unsigned resultIndex = outputArg.getArgNumber() - firstOutputArg->getArgNumber();
|
||||||
auto outputType = cast<ShapedType>(receiveBatchOp.getOutput().getType());
|
if (resultIndex >= returnOperandIndices.size())
|
||||||
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, outputType);
|
return insertSlice.emitOpError("result index out of range while lowering host batch output");
|
||||||
auto received = pim::PimReceiveBatchOp::create(rewriter,
|
|
||||||
loc,
|
|
||||||
outputBuffer.getType(),
|
|
||||||
outputBuffer,
|
|
||||||
getTensorSizeInBytesAttr(rewriter, receiveBatchOp.getOutput()),
|
|
||||||
receiveBatchOp.getSourceCoreIdsAttr())
|
|
||||||
.getOutput();
|
|
||||||
mapper.map(receiveBatchOp.getOutput(), received);
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (auto receiveTensorBatchOp = dyn_cast<spatial::SpatChannelReceiveTensorBatchOp>(op)) {
|
Value mappedSource = mapper.lookup(insertSlice.getSource());
|
||||||
lowerChannelReceiveTensorBatch(receiveTensorBatchOp, mapper, rewriter);
|
Value hostTarget = getOrCreateHostOutputTensor(resultIndex, insertSlice.getLoc());
|
||||||
|
auto hostTargetType = cast<ShapedType>(hostTarget.getType());
|
||||||
|
Value hostTargetOffset = createHostTargetOffset(rewriter, insertSlice, hostTargetType, mapper);
|
||||||
|
Value zeroOffset = arith::ConstantIndexOp::create(rewriter, insertSlice.getLoc(), 0).getResult();
|
||||||
|
pim::PimMemCopyDevToHostOp::create(rewriter,
|
||||||
|
insertSlice.getLoc(),
|
||||||
|
hostTarget.getType(),
|
||||||
|
hostTargetOffset,
|
||||||
|
zeroOffset,
|
||||||
|
hostTarget,
|
||||||
|
mappedSource,
|
||||||
|
getTensorSizeInBytesAttr(rewriter, mappedSource));
|
||||||
|
}
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -178,6 +250,10 @@ lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState&
|
|||||||
if (isa_and_present<memref::GetGlobalOp>(toTensorOp.getBuffer().getDefiningOp())) {
|
if (isa_and_present<memref::GetGlobalOp>(toTensorOp.getBuffer().getDefiningOp())) {
|
||||||
Operation* cloned = rewriter.clone(op, mapper);
|
Operation* cloned = rewriter.clone(op, mapper);
|
||||||
auto clonedTensor = cloned->getResult(0);
|
auto clonedTensor = cloned->getResult(0);
|
||||||
|
if (isUsedOnlyAsExplicitHostOperand(toTensorOp.getResult())) {
|
||||||
|
mapper.map(toTensorOp.getResult(), clonedTensor);
|
||||||
|
continue;
|
||||||
|
}
|
||||||
auto clonedType = cast<ShapedType>(clonedTensor.getType());
|
auto clonedType = cast<ShapedType>(clonedTensor.getType());
|
||||||
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, clonedType);
|
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, clonedType);
|
||||||
auto copied = pim::PimMemCopyHostToDevBatchOp::create(rewriter,
|
auto copied = pim::PimMemCopyHostToDevBatchOp::create(rewriter,
|
||||||
@@ -194,9 +270,11 @@ lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState&
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
for (Value operand : op.getOperands()) {
|
for (auto [operandIndex, operand] : llvm::enumerate(op.getOperands())) {
|
||||||
if (!isa<TensorType>(operand.getType()) || mapper.contains(operand))
|
if (!isa<TensorType>(operand.getType()) || mapper.contains(operand))
|
||||||
continue;
|
continue;
|
||||||
|
if (isExplicitHostOperand(&op, operandIndex))
|
||||||
|
continue;
|
||||||
|
|
||||||
Operation* definingOp = operand.getDefiningOp();
|
Operation* definingOp = operand.getDefiningOp();
|
||||||
if (definingOp && definingOp->getBlock() == &oldBlock)
|
if (definingOp && definingOp->getBlock() == &oldBlock)
|
||||||
|
|||||||
@@ -1,10 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/CoreLoweringPatterns.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
mlir::LogicalResult
|
|
||||||
lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, CoreLoweringState& state, mlir::IRRewriter& rewriter);
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -6,7 +6,6 @@ add_pim_library(OMSpatialToPim
|
|||||||
SpatialToPimPass.cpp
|
SpatialToPimPass.cpp
|
||||||
BatchCoreLoweringPatterns.cpp
|
BatchCoreLoweringPatterns.cpp
|
||||||
ChannelLoweringPatterns.cpp
|
ChannelLoweringPatterns.cpp
|
||||||
Cleanup.cpp
|
|
||||||
Common.cpp
|
Common.cpp
|
||||||
ComputeLikeRegionUtils.cpp
|
ComputeLikeRegionUtils.cpp
|
||||||
CoreLoweringPatterns.cpp
|
CoreLoweringPatterns.cpp
|
||||||
@@ -22,6 +21,8 @@ add_pim_library(OMSpatialToPim
|
|||||||
|
|
||||||
LINK_LIBS PUBLIC
|
LINK_LIBS PUBLIC
|
||||||
MLIRSCFDialect
|
MLIRSCFDialect
|
||||||
|
MLIRSCFUtils
|
||||||
|
MLIRTransformUtils
|
||||||
MLIRTosaDialect
|
MLIRTosaDialect
|
||||||
OMCompilerOptions
|
OMCompilerOptions
|
||||||
OMPimCommon
|
OMPimCommon
|
||||||
|
|||||||
@@ -1,5 +1,4 @@
|
|||||||
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ChannelLoweringPatterns.hpp"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ChannelLoweringPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
@@ -10,17 +9,12 @@ using namespace mlir;
|
|||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
static int32_t toPimCoreId(int32_t spatialCoreId) { return spatialCoreId; }
|
|
||||||
|
|
||||||
struct ChannelSendLowering : OpRewritePattern<spatial::SpatChannelSendOp> {
|
struct ChannelSendLowering : OpRewritePattern<spatial::SpatChannelSendOp> {
|
||||||
using OpRewritePattern::OpRewritePattern;
|
using OpRewritePattern::OpRewritePattern;
|
||||||
|
|
||||||
LogicalResult matchAndRewrite(spatial::SpatChannelSendOp op, PatternRewriter& rewriter) const override {
|
LogicalResult matchAndRewrite(spatial::SpatChannelSendOp op, PatternRewriter& rewriter) const override {
|
||||||
pim::PimSendOp::create(rewriter,
|
pim::PimSendOp::create(
|
||||||
op.getLoc(),
|
rewriter, op.getLoc(), op.getInput(), getTensorSizeInBytesAttr(rewriter, op.getInput()), op.getTargetCoreId());
|
||||||
op.getInput(),
|
|
||||||
getTensorSizeInBytesAttr(rewriter, op.getInput()),
|
|
||||||
rewriter.getI32IntegerAttr(toPimCoreId(op.getTargetCoreId())));
|
|
||||||
rewriter.eraseOp(op);
|
rewriter.eraseOp(op);
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
@@ -42,47 +36,13 @@ struct ChannelReceiveLowering : OpRewritePattern<spatial::SpatChannelReceiveOp>
|
|||||||
op.getResult().getType(),
|
op.getResult().getType(),
|
||||||
outputBuffer,
|
outputBuffer,
|
||||||
getTensorSizeInBytesAttr(rewriter, op.getResult()),
|
getTensorSizeInBytesAttr(rewriter, op.getResult()),
|
||||||
rewriter.getI32IntegerAttr(toPimCoreId(op.getSourceCoreId())))
|
op.getSourceCoreId())
|
||||||
.getOutput();
|
.getOutput();
|
||||||
rewriter.replaceOp(op, received);
|
rewriter.replaceOp(op, received);
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
struct ChannelSendTensorLowering : OpRewritePattern<spatial::SpatChannelSendTensorOp> {
|
|
||||||
using OpRewritePattern::OpRewritePattern;
|
|
||||||
|
|
||||||
LogicalResult matchAndRewrite(spatial::SpatChannelSendTensorOp op, PatternRewriter& rewriter) const override {
|
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
targetCoreIds.reserve(op.getTargetCoreIds().size());
|
|
||||||
for (int32_t targetCoreId : op.getTargetCoreIds())
|
|
||||||
targetCoreIds.push_back(toPimCoreId(targetCoreId));
|
|
||||||
pim::PimSendTensorOp::create(rewriter, op.getLoc(), op.getInput(), rewriter.getDenseI32ArrayAttr(targetCoreIds));
|
|
||||||
rewriter.eraseOp(op);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct ChannelReceiveTensorLowering : OpRewritePattern<spatial::SpatChannelReceiveTensorOp> {
|
|
||||||
using OpRewritePattern::OpRewritePattern;
|
|
||||||
|
|
||||||
LogicalResult matchAndRewrite(spatial::SpatChannelReceiveTensorOp op, PatternRewriter& rewriter) const override {
|
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
sourceCoreIds.reserve(op.getSourceCoreIds().size());
|
|
||||||
for (int32_t sourceCoreId : op.getSourceCoreIds())
|
|
||||||
sourceCoreIds.push_back(toPimCoreId(sourceCoreId));
|
|
||||||
auto outputType = cast<ShapedType>(op.getOutput().getType());
|
|
||||||
Value outputBuffer =
|
|
||||||
tensor::EmptyOp::create(rewriter, op.getLoc(), outputType.getShape(), outputType.getElementType()).getResult();
|
|
||||||
Value received =
|
|
||||||
pim::PimReceiveTensorOp::create(
|
|
||||||
rewriter, op.getLoc(), op.getOutput().getType(), outputBuffer, rewriter.getDenseI32ArrayAttr(sourceCoreIds))
|
|
||||||
.getOutput();
|
|
||||||
rewriter.replaceOp(op, received);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct ExtractRowsLowering : OpRewritePattern<spatial::SpatExtractRowsOp> {
|
struct ExtractRowsLowering : OpRewritePattern<spatial::SpatExtractRowsOp> {
|
||||||
using OpRewritePattern::OpRewritePattern;
|
using OpRewritePattern::OpRewritePattern;
|
||||||
|
|
||||||
@@ -125,12 +85,7 @@ struct ConcatLowering : OpRewritePattern<spatial::SpatConcatOp> {
|
|||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
void populateChannelLoweringPatterns(RewritePatternSet& patterns) {
|
void populateChannelLoweringPatterns(RewritePatternSet& patterns) {
|
||||||
patterns.add<ChannelSendLowering,
|
patterns.add<ChannelSendLowering, ChannelReceiveLowering, ExtractRowsLowering, ConcatLowering>(patterns.getContext());
|
||||||
ChannelReceiveLowering,
|
|
||||||
ChannelSendTensorLowering,
|
|
||||||
ChannelReceiveTensorLowering,
|
|
||||||
ExtractRowsLowering,
|
|
||||||
ConcatLowering>(patterns.getContext());
|
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -1,42 +0,0 @@
|
|||||||
#include "llvm/ADT/STLExtras.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Cleanup.hpp"
|
|
||||||
|
|
||||||
using namespace mlir;
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
LogicalResult erasePendingOps(SmallVectorImpl<Operation*>& pendingOps, IRRewriter& rewriter) {
|
|
||||||
while (!pendingOps.empty()) {
|
|
||||||
bool erasedAnyOp = false;
|
|
||||||
for (auto it = pendingOps.begin(); it != pendingOps.end();) {
|
|
||||||
Operation* opToRemove = *it;
|
|
||||||
if (!opToRemove->use_empty()) {
|
|
||||||
++it;
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
rewriter.eraseOp(opToRemove);
|
|
||||||
it = pendingOps.erase(it);
|
|
||||||
erasedAnyOp = true;
|
|
||||||
}
|
|
||||||
|
|
||||||
if (erasedAnyOp)
|
|
||||||
continue;
|
|
||||||
|
|
||||||
for (Operation* opToRemove : pendingOps) {
|
|
||||||
InFlightDiagnostic diag = opToRemove->emitError("pending Spatial-to-PIM cleanup could not erase operation");
|
|
||||||
diag << "; op has " << llvm::range_size(opToRemove->getUsers()) << " remaining user(s)";
|
|
||||||
for (Operation* user : opToRemove->getUsers()) {
|
|
||||||
bool userPendingRemoval = llvm::is_contained(pendingOps, user);
|
|
||||||
opToRemove->emitRemark() << "remaining user `" << user->getName() << "`"
|
|
||||||
<< (userPendingRemoval ? " is also pending removal" : " is not pending removal");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -1,11 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/IR/Operation.h"
|
|
||||||
#include "mlir/IR/PatternMatch.h"
|
|
||||||
#include "mlir/Support/LLVM.h"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
mlir::LogicalResult erasePendingOps(llvm::SmallVectorImpl<mlir::Operation*>& pendingOps, mlir::IRRewriter& rewriter);
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -55,10 +55,6 @@ size_t getSliceActualOffset(tensor::ExtractSliceOp& sliceOp, ShapedType& inputSh
|
|||||||
return returnValue;
|
return returnValue;
|
||||||
}
|
}
|
||||||
|
|
||||||
size_t getShapedTypeSizeInBytes(ShapedType shapedType) {
|
|
||||||
return shapedType.getNumElements() * shapedType.getElementTypeBitWidth() / 8;
|
|
||||||
}
|
|
||||||
|
|
||||||
IntegerAttr getTensorSizeInBytesAttr(Builder& builder, mlir::Value value) {
|
IntegerAttr getTensorSizeInBytesAttr(Builder& builder, mlir::Value value) {
|
||||||
return builder.getI32IntegerAttr(static_cast<int32_t>(getShapedTypeSizeInBytes(cast<ShapedType>(value.getType()))));
|
return builder.getI32IntegerAttr(static_cast<int32_t>(getShapedTypeSizeInBytes(cast<ShapedType>(value.getType()))));
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -20,8 +20,6 @@ namespace onnx_mlir {
|
|||||||
*/
|
*/
|
||||||
size_t getSliceActualOffset(mlir::tensor::ExtractSliceOp& sliceOp, mlir::ShapedType& inputShape);
|
size_t getSliceActualOffset(mlir::tensor::ExtractSliceOp& sliceOp, mlir::ShapedType& inputShape);
|
||||||
|
|
||||||
size_t getShapedTypeSizeInBytes(mlir::ShapedType shapedType);
|
|
||||||
|
|
||||||
mlir::IntegerAttr getTensorSizeInBytesAttr(mlir::Builder& builder, mlir::Value value);
|
mlir::IntegerAttr getTensorSizeInBytesAttr(mlir::Builder& builder, mlir::Value value);
|
||||||
|
|
||||||
template <class T>
|
template <class T>
|
||||||
|
|||||||
@@ -1,3 +1,5 @@
|
|||||||
|
#include <cassert>
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ComputeLikeRegionUtils.hpp"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ComputeLikeRegionUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
@@ -29,7 +31,18 @@ void replaceAndEraseDirectComputeLikeInput(PatternRewriter& rewriter,
|
|||||||
unsigned inputIndex,
|
unsigned inputIndex,
|
||||||
Value replacement) {
|
Value replacement) {
|
||||||
Block& body = owner->getRegion(0).front();
|
Block& body = owner->getRegion(0).front();
|
||||||
BlockArgument bodyArgument = body.getArgument(inputIndex);
|
BlockArgument bodyArgument;
|
||||||
|
if (auto compute = dyn_cast<spatial::SpatCompute>(owner)) {
|
||||||
|
auto computeArg = compute.getInputArgument(inputIndex);
|
||||||
|
assert(computeArg && "expected compute input block argument");
|
||||||
|
bodyArgument = *computeArg;
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
auto batchArg = cast<spatial::SpatComputeBatch>(owner).getInputArgument(inputIndex);
|
||||||
|
assert(batchArg && "expected compute_batch input block argument");
|
||||||
|
bodyArgument = *batchArg;
|
||||||
|
}
|
||||||
|
unsigned bodyArgIndex = bodyArgument.getArgNumber();
|
||||||
|
|
||||||
rewriter.startOpModification(owner);
|
rewriter.startOpModification(owner);
|
||||||
bodyArgument.replaceAllUsesWith(replacement);
|
bodyArgument.replaceAllUsesWith(replacement);
|
||||||
@@ -37,7 +50,7 @@ void replaceAndEraseDirectComputeLikeInput(PatternRewriter& rewriter,
|
|||||||
compute.getInputsMutable().erase(inputIndex);
|
compute.getInputsMutable().erase(inputIndex);
|
||||||
else
|
else
|
||||||
cast<spatial::SpatComputeBatch>(owner).getInputsMutable().erase(inputIndex);
|
cast<spatial::SpatComputeBatch>(owner).getInputsMutable().erase(inputIndex);
|
||||||
body.eraseArgument(inputIndex);
|
body.eraseArgument(bodyArgIndex);
|
||||||
rewriter.finalizeOpModification(owner);
|
rewriter.finalizeOpModification(owner);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -3,11 +3,12 @@
|
|||||||
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
||||||
#include "mlir/Dialect/Tosa/IR/TosaOps.h"
|
#include "mlir/Dialect/Tosa/IR/TosaOps.h"
|
||||||
#include "mlir/IR/IRMapping.h"
|
#include "mlir/IR/IRMapping.h"
|
||||||
|
#include "mlir/IR/Matchers.h"
|
||||||
|
|
||||||
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
|
#include "Conversion/SpatialToPim/SpatialToPimPass.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/CoreLoweringPatterns.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -27,7 +28,8 @@ static bool isChannelUseChainOp(Operation* op) {
|
|||||||
pim::PimTransposeOp>(op);
|
pim::PimTransposeOp>(op);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewriter& rewriter) {
|
static void
|
||||||
|
cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewriter& rewriter, OperationFolder& constantFolder) {
|
||||||
for (Value operand : op->getOperands()) {
|
for (Value operand : op->getOperands()) {
|
||||||
if (mapping.lookupOrNull(operand))
|
if (mapping.lookupOrNull(operand))
|
||||||
continue;
|
continue;
|
||||||
@@ -36,7 +38,12 @@ static void cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewri
|
|||||||
if (!definingOp)
|
if (!definingOp)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (!isa<tensor::EmptyOp, arith::ConstantOp>(definingOp))
|
if (auto constantOp = dyn_cast<arith::ConstantOp>(definingOp)) {
|
||||||
|
mapping.map(operand, getOrCreateHostConstantLike(constantOp, constantFolder));
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!isa<tensor::EmptyOp>(definingOp))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
Operation* clonedOp = rewriter.clone(*definingOp, mapping);
|
Operation* clonedOp = rewriter.clone(*definingOp, mapping);
|
||||||
@@ -46,8 +53,6 @@ static void cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewri
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static int32_t translateSpatialCoreIdToPimCoreId(size_t spatialCoreId) { return static_cast<int32_t>(spatialCoreId); }
|
|
||||||
|
|
||||||
static int32_t getPimCoreIdForComputeOp(spatial::SpatCompute computeOp, size_t& fallbackCoreId) {
|
static int32_t getPimCoreIdForComputeOp(spatial::SpatCompute computeOp, size_t& fallbackCoreId) {
|
||||||
if (auto spatialCoreIdAttr = computeOp->getAttrOfType<IntegerAttr>(onnx_mlir::kCoreIdAttrName))
|
if (auto spatialCoreIdAttr = computeOp->getAttrOfType<IntegerAttr>(onnx_mlir::kCoreIdAttrName))
|
||||||
return static_cast<int32_t>(spatialCoreIdAttr.getInt());
|
return static_cast<int32_t>(spatialCoreIdAttr.getInt());
|
||||||
@@ -92,7 +97,9 @@ static LogicalResult collectHelperComputeChain(spatial::SpatCompute computeOp,
|
|||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
static bool inlineInputlessHelperComputeForWeightLikeUsers(spatial::SpatCompute computeOp, IRRewriter& rewriter) {
|
static bool inlineInputlessHelperComputeForWeightLikeUsers(spatial::SpatCompute computeOp,
|
||||||
|
IRRewriter& rewriter,
|
||||||
|
OperationFolder& constantFolder) {
|
||||||
if (!computeOp.getInputs().empty() || computeOp.getNumResults() != 1)
|
if (!computeOp.getInputs().empty() || computeOp.getNumResults() != 1)
|
||||||
return false;
|
return false;
|
||||||
if (!llvm::all_of(computeOp.getResult(0).getUsers(), [](Operation* user) {
|
if (!llvm::all_of(computeOp.getResult(0).getUsers(), [](Operation* user) {
|
||||||
@@ -101,7 +108,7 @@ static bool inlineInputlessHelperComputeForWeightLikeUsers(spatial::SpatCompute
|
|||||||
return false;
|
return false;
|
||||||
|
|
||||||
Block& block = computeOp.getBody().front();
|
Block& block = computeOp.getBody().front();
|
||||||
if (block.getNumArguments() != 0)
|
if (block.getNumArguments() != computeOp.getWeights().size())
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
auto yieldOp = dyn_cast<spatial::SpatYieldOp>(block.getTerminator());
|
auto yieldOp = dyn_cast<spatial::SpatYieldOp>(block.getTerminator());
|
||||||
@@ -110,8 +117,14 @@ static bool inlineInputlessHelperComputeForWeightLikeUsers(spatial::SpatCompute
|
|||||||
|
|
||||||
rewriter.setInsertionPoint(computeOp);
|
rewriter.setInsertionPoint(computeOp);
|
||||||
IRMapping mapping;
|
IRMapping mapping;
|
||||||
|
for (auto [weightIndex, weight] : llvm::enumerate(computeOp.getWeights())) {
|
||||||
|
auto weightArg = computeOp.getWeightArgument(weightIndex);
|
||||||
|
if (!weightArg)
|
||||||
|
return false;
|
||||||
|
mapping.map(*weightArg, weight);
|
||||||
|
}
|
||||||
for (Operation& op : block.without_terminator()) {
|
for (Operation& op : block.without_terminator()) {
|
||||||
cloneMappedHelperOperands(&op, mapping, rewriter);
|
cloneMappedHelperOperands(&op, mapping, rewriter, constantFolder);
|
||||||
Operation* clonedOp = rewriter.clone(op, mapping);
|
Operation* clonedOp = rewriter.clone(op, mapping);
|
||||||
for (auto [originalResult, newResult] : llvm::zip(op.getResults(), clonedOp->getResults()))
|
for (auto [originalResult, newResult] : llvm::zip(op.getResults(), clonedOp->getResults()))
|
||||||
mapping.map(originalResult, newResult);
|
mapping.map(originalResult, newResult);
|
||||||
@@ -125,15 +138,12 @@ static bool inlineInputlessHelperComputeForWeightLikeUsers(spatial::SpatCompute
|
|||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
void markOpToRemove(CoreLoweringState& state, Operation* op) {
|
LogicalResult raptor::SpatialToPimPass::lowerComputeOp(spatial::SpatCompute computeOp,
|
||||||
if (!llvm::is_contained(state.operationsToRemove, op))
|
IRRewriter& rewriter,
|
||||||
state.operationsToRemove.push_back(op);
|
OperationFolder& constantFolder) {
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult lowerComputeOp(spatial::SpatCompute computeOp, CoreLoweringState& state, IRRewriter& rewriter) {
|
|
||||||
Location loc = computeOp->getLoc();
|
Location loc = computeOp->getLoc();
|
||||||
|
|
||||||
if (inlineInputlessHelperComputeForWeightLikeUsers(computeOp, rewriter))
|
if (inlineInputlessHelperComputeForWeightLikeUsers(computeOp, rewriter, constantFolder))
|
||||||
return success();
|
return success();
|
||||||
|
|
||||||
SmallVector<Operation*> helperChain;
|
SmallVector<Operation*> helperChain;
|
||||||
@@ -143,21 +153,25 @@ LogicalResult lowerComputeOp(spatial::SpatCompute computeOp, CoreLoweringState&
|
|||||||
auto& block = computeOp.getRegion().front();
|
auto& block = computeOp.getRegion().front();
|
||||||
auto yieldOp = cast<spatial::SpatYieldOp>(block.getTerminator());
|
auto yieldOp = cast<spatial::SpatYieldOp>(block.getTerminator());
|
||||||
|
|
||||||
for (auto [argIndex, blockArg] : llvm::enumerate(block.getArguments())) {
|
for (auto [inputIndex, input] : llvm::enumerate(computeOp.getInputs())) {
|
||||||
auto receiveOp = dyn_cast_or_null<spatial::SpatChannelReceiveOp>(computeOp.getInputs()[argIndex].getDefiningOp());
|
auto blockArg = computeOp.getInputArgument(inputIndex);
|
||||||
if (!receiveOp || blockArg.use_empty())
|
if (!blockArg)
|
||||||
|
return computeOp.emitOpError("expected compute input block arguments during lowering");
|
||||||
|
auto receiveOp = dyn_cast_or_null<spatial::SpatChannelReceiveOp>(input.getDefiningOp());
|
||||||
|
if (receiveOp && !blockArg->use_empty()) {
|
||||||
|
rewriter.setInsertionPoint(getEarliestUserWithinBlock(*blockArg));
|
||||||
|
auto outputType = cast<ShapedType>(blockArg->getType());
|
||||||
|
auto outputBuffer = createEmptyTensorFromShaped(rewriter, receiveOp.getLoc(), outputType);
|
||||||
|
auto sizeAttr = getTensorSizeInBytesAttr(rewriter, *blockArg);
|
||||||
|
Value received =
|
||||||
|
PimReceiveOp::create(
|
||||||
|
rewriter, receiveOp.getLoc(), outputBuffer.getType(), outputBuffer, sizeAttr, receiveOp.getSourceCoreId())
|
||||||
|
.getOutput();
|
||||||
|
blockArg->replaceAllUsesWith(received);
|
||||||
|
markOpToRemove(receiveOp);
|
||||||
continue;
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
rewriter.setInsertionPoint(getEarliestUserWithinBlock(blockArg));
|
|
||||||
auto outputType = cast<ShapedType>(blockArg.getType());
|
|
||||||
auto outputBuffer = createEmptyTensorFromShaped(rewriter, receiveOp.getLoc(), outputType);
|
|
||||||
auto sizeAttr = getTensorSizeInBytesAttr(rewriter, blockArg);
|
|
||||||
auto sourceCoreIdAttr = rewriter.getI32IntegerAttr(translateSpatialCoreIdToPimCoreId(receiveOp.getSourceCoreId()));
|
|
||||||
Value received = PimReceiveOp::create(
|
|
||||||
rewriter, receiveOp.getLoc(), outputBuffer.getType(), outputBuffer, sizeAttr, sourceCoreIdAttr)
|
|
||||||
.getOutput();
|
|
||||||
blockArg.replaceAllUsesWith(received);
|
|
||||||
markOpToRemove(state, receiveOp);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if (computeOp.getNumResults() != yieldOp.getNumOperands())
|
if (computeOp.getNumResults() != yieldOp.getNumOperands())
|
||||||
@@ -167,9 +181,8 @@ LogicalResult lowerComputeOp(spatial::SpatCompute computeOp, CoreLoweringState&
|
|||||||
if (result.use_empty())
|
if (result.use_empty())
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
ReturnPathState returnPathState {state.outputTensors, state.operationsToRemove};
|
|
||||||
ReturnPathLoweringResult returnPathResult =
|
ReturnPathLoweringResult returnPathResult =
|
||||||
lowerComputeResultReturnPath(computeOp, cast<OpResult>(result), yieldValue, returnPathState, rewriter);
|
lowerComputeResultReturnPath(computeOp, cast<OpResult>(result), yieldValue, rewriter);
|
||||||
if (returnPathResult == ReturnPathLoweringResult::Failure)
|
if (returnPathResult == ReturnPathLoweringResult::Failure)
|
||||||
return failure();
|
return failure();
|
||||||
if (returnPathResult == ReturnPathLoweringResult::Handled)
|
if (returnPathResult == ReturnPathLoweringResult::Handled)
|
||||||
@@ -193,15 +206,40 @@ LogicalResult lowerComputeOp(spatial::SpatCompute computeOp, CoreLoweringState&
|
|||||||
if (!computeOp.getWeights().empty())
|
if (!computeOp.getWeights().empty())
|
||||||
computeWeights.append(computeOp.getWeights().begin(), computeOp.getWeights().end());
|
computeWeights.append(computeOp.getWeights().begin(), computeOp.getWeights().end());
|
||||||
rewriter.setInsertionPointAfter(computeOp);
|
rewriter.setInsertionPointAfter(computeOp);
|
||||||
auto coreOp = PimCoreOp::create(rewriter,
|
auto coreOp = PimCoreOp::create(
|
||||||
loc,
|
rewriter, loc, ValueRange(computeWeights), rewriter.getI32IntegerAttr(getPimCoreIdForComputeOp(computeOp, coreId)));
|
||||||
ValueRange(computeWeights),
|
rewriter.setInsertionPointToStart(&block);
|
||||||
rewriter.getI32IntegerAttr(getPimCoreIdForComputeOp(computeOp, state.nextCoreId)));
|
|
||||||
auto& coreOpBlocks = coreOp.getBody().getBlocks();
|
auto& coreOpBlocks = coreOp.getBody().getBlocks();
|
||||||
for (auto [argIndex, blockArg] : llvm::enumerate(block.getArguments()))
|
for (auto [inputIndex, input] : llvm::enumerate(computeOp.getInputs())) {
|
||||||
if (!blockArg.use_empty())
|
auto blockArg = computeOp.getInputArgument(inputIndex);
|
||||||
blockArg.replaceAllUsesWith(computeOp.getInputs()[argIndex]);
|
if (!blockArg)
|
||||||
block.eraseArguments(0, block.getNumArguments());
|
return computeOp.emitOpError("expected compute input block arguments during input materialization");
|
||||||
|
if (blockArg->use_empty())
|
||||||
|
continue;
|
||||||
|
|
||||||
|
if (auto constantOp = input.getDefiningOp<arith::ConstantOp>()) {
|
||||||
|
blockArg->replaceAllUsesWith(getOrCreateHostConstantLike(constantOp, constantFolder));
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
auto inputType = dyn_cast<ShapedType>(input.getType());
|
||||||
|
if (!inputType)
|
||||||
|
return computeOp.emitOpError("expected shaped compute input during pim.core lowering");
|
||||||
|
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, inputType);
|
||||||
|
auto copied =
|
||||||
|
PimMemCopyHostToDevOp::create(rewriter,
|
||||||
|
loc,
|
||||||
|
outputBuffer.getType(),
|
||||||
|
getOrCreateHostIndexConstant(outputBuffer.getOperation(), 0, constantFolder),
|
||||||
|
getOrCreateHostIndexConstant(outputBuffer.getOperation(), 0, constantFolder),
|
||||||
|
outputBuffer,
|
||||||
|
input,
|
||||||
|
getTensorSizeInBytesAttr(rewriter, input))
|
||||||
|
.getOutput();
|
||||||
|
blockArg->replaceAllUsesWith(copied);
|
||||||
|
}
|
||||||
|
if (!computeOp.getInputs().empty())
|
||||||
|
block.eraseArguments(computeOp.getWeights().size(), computeOp.getInputs().size());
|
||||||
coreOpBlocks.splice(coreOpBlocks.begin(), computeOp.getBody().getBlocks());
|
coreOpBlocks.splice(coreOpBlocks.begin(), computeOp.getBody().getBlocks());
|
||||||
Block* tempComputeBlock = new Block();
|
Block* tempComputeBlock = new Block();
|
||||||
computeOp.getBody().push_back(tempComputeBlock);
|
computeOp.getBody().push_back(tempComputeBlock);
|
||||||
|
|||||||
@@ -1,21 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/IR/PatternMatch.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ReturnPathNormalization.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
struct CoreLoweringState {
|
|
||||||
size_t& nextCoreId;
|
|
||||||
llvm::SmallVectorImpl<OutputTensorFactory>& outputTensors;
|
|
||||||
llvm::SmallVectorImpl<mlir::Operation*>& operationsToRemove;
|
|
||||||
};
|
|
||||||
|
|
||||||
void markOpToRemove(CoreLoweringState& state, mlir::Operation* op);
|
|
||||||
|
|
||||||
mlir::LogicalResult
|
|
||||||
lowerComputeOp(spatial::SpatCompute computeOp, CoreLoweringState& state, mlir::IRRewriter& rewriter);
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -76,10 +76,11 @@ struct MoveExtractSliceIntoCompute final : OpRewritePattern<mlir::tensor::Extrac
|
|||||||
auto inputIndex = getDirectComputeLikeInputIndex(spatCompute, uses.getOperandNumber());
|
auto inputIndex = getDirectComputeLikeInputIndex(spatCompute, uses.getOperandNumber());
|
||||||
if (!inputIndex)
|
if (!inputIndex)
|
||||||
return failure();
|
return failure();
|
||||||
auto BBArgIndex = *inputIndex;
|
auto BBArgValue = spatCompute.getInputArgument(*inputIndex);
|
||||||
auto BBArgValue = spatCompute.getBody().front().getArgument(BBArgIndex);
|
if (!BBArgValue)
|
||||||
|
return failure();
|
||||||
|
|
||||||
if (BBArgValue.use_empty())
|
if (BBArgValue->use_empty())
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
rewriter.setInsertionPoint(&spatCompute.getBody().front().front());
|
rewriter.setInsertionPoint(&spatCompute.getBody().front().front());
|
||||||
@@ -89,16 +90,17 @@ struct MoveExtractSliceIntoCompute final : OpRewritePattern<mlir::tensor::Extrac
|
|||||||
}
|
}
|
||||||
|
|
||||||
replaceAndEraseDirectComputeLikeInput(
|
replaceAndEraseDirectComputeLikeInput(
|
||||||
rewriter, spatCompute.getOperation(), BBArgIndex, mapSpatToExtract[spatCompute.getOperation()]);
|
rewriter, spatCompute.getOperation(), *inputIndex, mapSpatToExtract[spatCompute.getOperation()]);
|
||||||
}
|
}
|
||||||
else if (auto spatComputeBatch = dyn_cast<spatial::SpatComputeBatch>(uses.getOwner())) {
|
else if (auto spatComputeBatch = dyn_cast<spatial::SpatComputeBatch>(uses.getOwner())) {
|
||||||
auto inputIndex = getDirectComputeLikeInputIndex(spatComputeBatch, uses.getOperandNumber());
|
auto inputIndex = getDirectComputeLikeInputIndex(spatComputeBatch, uses.getOperandNumber());
|
||||||
if (!inputIndex)
|
if (!inputIndex)
|
||||||
return failure();
|
return failure();
|
||||||
auto BBArgIndex = *inputIndex;
|
auto BBArgValue = spatComputeBatch.getInputArgument(*inputIndex);
|
||||||
auto BBArgValue = spatComputeBatch.getBody().front().getArgument(BBArgIndex);
|
if (!BBArgValue)
|
||||||
|
return failure();
|
||||||
|
|
||||||
if (BBArgValue.use_empty())
|
if (BBArgValue->use_empty())
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
rewriter.setInsertionPoint(&spatComputeBatch.getBody().front().front());
|
rewriter.setInsertionPoint(&spatComputeBatch.getBody().front().front());
|
||||||
@@ -108,7 +110,7 @@ struct MoveExtractSliceIntoCompute final : OpRewritePattern<mlir::tensor::Extrac
|
|||||||
}
|
}
|
||||||
|
|
||||||
replaceAndEraseDirectComputeLikeInput(
|
replaceAndEraseDirectComputeLikeInput(
|
||||||
rewriter, spatComputeBatch.getOperation(), BBArgIndex, mapSpatToExtract[spatComputeBatch.getOperation()]);
|
rewriter, spatComputeBatch.getOperation(), *inputIndex, mapSpatToExtract[spatComputeBatch.getOperation()]);
|
||||||
}
|
}
|
||||||
else {
|
else {
|
||||||
{
|
{
|
||||||
@@ -143,170 +145,6 @@ struct MoveExtractSliceIntoCompute final : OpRewritePattern<mlir::tensor::Extrac
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
// Turns runtime constants consumed by compute regions into private globals and local loads.
|
|
||||||
struct ArithConstToGlobalMemoryPattern final : OpRewritePattern<mlir::arith::ConstantOp> {
|
|
||||||
using OpRewritePattern::OpRewritePattern;
|
|
||||||
|
|
||||||
LogicalResult matchAndRewrite(mlir::arith::ConstantOp constantOp, PatternRewriter& rewriter) const override {
|
|
||||||
Location loc = constantOp.getLoc();
|
|
||||||
|
|
||||||
if (hasWeightAlways(constantOp))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!isa<func::FuncOp>(constantOp->getParentOp()))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (llvm::all_of(constantOp->getUsers(), [](Operation* op) {
|
|
||||||
if (isa<spatial::SpatCompute>(op))
|
|
||||||
return false;
|
|
||||||
if (isa<func::FuncOp>(op->getParentOp()))
|
|
||||||
return true;
|
|
||||||
return false;
|
|
||||||
}))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
rewriter.setInsertionPoint(constantOp->getParentOfType<func::FuncOp>());
|
|
||||||
|
|
||||||
auto constRankedTensorType = llvm::dyn_cast<mlir::RankedTensorType>(constantOp.getType());
|
|
||||||
|
|
||||||
if (constRankedTensorType) {
|
|
||||||
mlir::MemRefType memRefType =
|
|
||||||
mlir::MemRefType::get(constRankedTensorType.getShape(), constRankedTensorType.getElementType());
|
|
||||||
auto globalOp = createPrivateMemrefGlobalWithUniqueName(rewriter,
|
|
||||||
loc,
|
|
||||||
constantOp->getParentOfType<ModuleOp>(),
|
|
||||||
"const",
|
|
||||||
memRefType,
|
|
||||||
constantOp.getValueAttr(),
|
|
||||||
rewriter.getUnitAttr());
|
|
||||||
std::string argName = globalOp.getSymName().str();
|
|
||||||
|
|
||||||
llvm::DenseMap<Operation*, Value> mapSpatComputeToConst;
|
|
||||||
|
|
||||||
for (auto& constUses : llvm::make_early_inc_range(constantOp->getUses())) {
|
|
||||||
auto constUsers = constUses.getOwner();
|
|
||||||
|
|
||||||
if (auto spatCompute = llvm::dyn_cast<spatial::SpatCompute>(constUsers)) {
|
|
||||||
auto inputIndex = getDirectComputeLikeInputIndex(spatCompute, constUses.getOperandNumber());
|
|
||||||
if (!inputIndex)
|
|
||||||
return failure();
|
|
||||||
auto BBArgIndex = *inputIndex;
|
|
||||||
rewriter.setInsertionPoint(&spatCompute.getBody().front().front());
|
|
||||||
if (!mapSpatComputeToConst.contains(spatCompute.getOperation())) {
|
|
||||||
auto getGlobalOp = memref::GetGlobalOp::create(rewriter, loc, memRefType, argName);
|
|
||||||
auto toTensor = bufferization::ToTensorOp::create(
|
|
||||||
rewriter, loc, constRankedTensorType, getGlobalOp, rewriter.getUnitAttr(), rewriter.getUnitAttr());
|
|
||||||
mapSpatComputeToConst.insert({spatCompute.getOperation(), toTensor.getResult()});
|
|
||||||
}
|
|
||||||
|
|
||||||
replaceAndEraseDirectComputeLikeInput(
|
|
||||||
rewriter, spatCompute.getOperation(), BBArgIndex, mapSpatComputeToConst[spatCompute.getOperation()]);
|
|
||||||
}
|
|
||||||
else if (auto spatComputeBatch = llvm::dyn_cast<spatial::SpatComputeBatch>(constUsers)) {
|
|
||||||
auto inputIndex = getDirectComputeLikeInputIndex(spatComputeBatch, constUses.getOperandNumber());
|
|
||||||
if (!inputIndex)
|
|
||||||
return failure();
|
|
||||||
auto BBArgIndex = *inputIndex;
|
|
||||||
rewriter.setInsertionPoint(&spatComputeBatch.getBody().front().front());
|
|
||||||
if (!mapSpatComputeToConst.contains(spatComputeBatch.getOperation())) {
|
|
||||||
auto getGlobalOp = memref::GetGlobalOp::create(rewriter, loc, memRefType, argName);
|
|
||||||
auto toTensor = bufferization::ToTensorOp::create(
|
|
||||||
rewriter, loc, constRankedTensorType, getGlobalOp, rewriter.getUnitAttr(), rewriter.getUnitAttr());
|
|
||||||
mapSpatComputeToConst.insert({spatComputeBatch.getOperation(), toTensor.getResult()});
|
|
||||||
}
|
|
||||||
|
|
||||||
replaceAndEraseDirectComputeLikeInput(rewriter,
|
|
||||||
spatComputeBatch.getOperation(),
|
|
||||||
BBArgIndex,
|
|
||||||
mapSpatComputeToConst[spatComputeBatch.getOperation()]);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
{
|
|
||||||
|
|
||||||
if (auto spatCompute = constUses.getOwner()->getParentOfType<spatial::SpatCompute>()) {
|
|
||||||
rewriter.setInsertionPoint(&spatCompute.getBody().front().front());
|
|
||||||
if (!mapSpatComputeToConst.contains(spatCompute.getOperation())) {
|
|
||||||
auto getGlobalOp = memref::GetGlobalOp::create(rewriter, loc, memRefType, argName);
|
|
||||||
auto toTensor = bufferization::ToTensorOp::create(
|
|
||||||
rewriter, loc, constRankedTensorType, getGlobalOp, rewriter.getUnitAttr(), rewriter.getUnitAttr());
|
|
||||||
mapSpatComputeToConst.insert({spatCompute.getOperation(), toTensor.getResult()});
|
|
||||||
}
|
|
||||||
|
|
||||||
rewriter.startOpModification(spatCompute.getOperation());
|
|
||||||
constUses.set(mapSpatComputeToConst[spatCompute.getOperation()]);
|
|
||||||
rewriter.finalizeOpModification(spatCompute.getOperation());
|
|
||||||
}
|
|
||||||
else if (auto spatComputeBatch = constUses.getOwner()->getParentOfType<spatial::SpatComputeBatch>()) {
|
|
||||||
rewriter.setInsertionPoint(&spatComputeBatch.getBody().front().front());
|
|
||||||
if (!mapSpatComputeToConst.contains(spatComputeBatch.getOperation())) {
|
|
||||||
auto getGlobalOp = memref::GetGlobalOp::create(rewriter, loc, memRefType, argName);
|
|
||||||
auto toTensor = bufferization::ToTensorOp::create(
|
|
||||||
rewriter, loc, constRankedTensorType, getGlobalOp, rewriter.getUnitAttr(), rewriter.getUnitAttr());
|
|
||||||
mapSpatComputeToConst.insert({spatComputeBatch.getOperation(), toTensor.getResult()});
|
|
||||||
}
|
|
||||||
|
|
||||||
rewriter.startOpModification(spatComputeBatch.getOperation());
|
|
||||||
constUses.set(mapSpatComputeToConst[spatComputeBatch.getOperation()]);
|
|
||||||
rewriter.finalizeOpModification(spatComputeBatch.getOperation());
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else if (constantOp.getType().isIntOrIndexOrFloat()) {
|
|
||||||
llvm::DenseMap<Operation*, Value> mapSpatComputeToConst;
|
|
||||||
|
|
||||||
for (auto& constUses : llvm::make_early_inc_range(constantOp->getUses())) {
|
|
||||||
auto constUsers = constUses.getOwner();
|
|
||||||
|
|
||||||
if (auto spatCompute = llvm::dyn_cast<spatial::SpatCompute>(constUsers)) {
|
|
||||||
auto inputIndex = getDirectComputeLikeInputIndex(spatCompute, constUses.getOperandNumber());
|
|
||||||
if (!inputIndex)
|
|
||||||
return failure();
|
|
||||||
auto BBArgIndex = *inputIndex;
|
|
||||||
rewriter.setInsertionPoint(&spatCompute.getBody().front().front());
|
|
||||||
auto newConst = rewriter.clone(*constantOp);
|
|
||||||
|
|
||||||
replaceAndEraseDirectComputeLikeInput(
|
|
||||||
rewriter, spatCompute.getOperation(), BBArgIndex, newConst->getResult(0));
|
|
||||||
}
|
|
||||||
else if (auto spatComputeBatch = llvm::dyn_cast<spatial::SpatComputeBatch>(constUsers)) {
|
|
||||||
auto inputIndex = getDirectComputeLikeInputIndex(spatComputeBatch, constUses.getOperandNumber());
|
|
||||||
if (!inputIndex)
|
|
||||||
return failure();
|
|
||||||
auto BBArgIndex = *inputIndex;
|
|
||||||
rewriter.setInsertionPoint(&spatComputeBatch.getBody().front().front());
|
|
||||||
auto newConst = rewriter.clone(*constantOp);
|
|
||||||
|
|
||||||
replaceAndEraseDirectComputeLikeInput(
|
|
||||||
rewriter, spatComputeBatch.getOperation(), BBArgIndex, newConst->getResult(0));
|
|
||||||
}
|
|
||||||
else if (auto parent = constUsers->getParentOfType<spatial::SpatCompute>()) {
|
|
||||||
if (!mapSpatComputeToConst.contains(parent)) {
|
|
||||||
rewriter.setInsertionPoint(&parent.getBody().front().front());
|
|
||||||
auto newConst = rewriter.clone(*constantOp);
|
|
||||||
mapSpatComputeToConst.insert({parent.getOperation(), newConst->getResult(0)});
|
|
||||||
}
|
|
||||||
constUses.set(mapSpatComputeToConst[parent.getOperation()]);
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
auto batchParent = constUsers->getParentOfType<spatial::SpatComputeBatch>();
|
|
||||||
assert(batchParent && "Global Constant used direcly not within a compute");
|
|
||||||
if (!mapSpatComputeToConst.contains(batchParent.getOperation())) {
|
|
||||||
rewriter.setInsertionPoint(&batchParent.getBody().front().front());
|
|
||||||
auto newConst = rewriter.clone(*constantOp);
|
|
||||||
mapSpatComputeToConst.insert({batchParent.getOperation(), newConst->getResult(0)});
|
|
||||||
}
|
|
||||||
constUses.set(mapSpatComputeToConst[batchParent.getOperation()]);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
if (constantOp->use_empty())
|
|
||||||
rewriter.eraseOp(constantOp);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
// Materializes public function tensor inputs as globals so compute bodies can load them uniformly.
|
// Materializes public function tensor inputs as globals so compute bodies can load them uniformly.
|
||||||
struct FuncOpArgToGlobalMemoryPattern final : OpRewritePattern<mlir::func::FuncOp> {
|
struct FuncOpArgToGlobalMemoryPattern final : OpRewritePattern<mlir::func::FuncOp> {
|
||||||
using OpRewritePattern::OpRewritePattern;
|
using OpRewritePattern::OpRewritePattern;
|
||||||
@@ -383,8 +221,7 @@ struct FuncOpArgToGlobalMemoryPattern final : OpRewritePattern<mlir::func::FuncO
|
|||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
void populateGlobalTensorMaterializationPatterns(RewritePatternSet& patterns) {
|
void populateGlobalTensorMaterializationPatterns(RewritePatternSet& patterns) {
|
||||||
patterns.add<MoveExtractSliceIntoCompute, FuncOpArgToGlobalMemoryPattern, ArithConstToGlobalMemoryPattern>(
|
patterns.add<MoveExtractSliceIntoCompute, FuncOpArgToGlobalMemoryPattern>(patterns.getContext());
|
||||||
patterns.getContext());
|
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -6,10 +6,12 @@
|
|||||||
#include "mlir/IR/BuiltinOps.h"
|
#include "mlir/IR/BuiltinOps.h"
|
||||||
#include "mlir/IR/IRMapping.h"
|
#include "mlir/IR/IRMapping.h"
|
||||||
#include "mlir/IR/SymbolTable.h"
|
#include "mlir/IR/SymbolTable.h"
|
||||||
|
#include "mlir/Transforms/FoldUtils.h"
|
||||||
|
|
||||||
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
|
#include "Conversion/SpatialToPim/SpatialToPimPass.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ReturnPathNormalization.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
#include "src/Dialect/ONNX/ONNXOps.hpp"
|
||||||
|
|
||||||
@@ -42,11 +44,6 @@ static bool isReturnHelperChainOp(Operation* op) {
|
|||||||
pim::PimTransposeOp>(op);
|
pim::PimTransposeOp>(op);
|
||||||
}
|
}
|
||||||
|
|
||||||
static void markOpToRemove(ReturnPathState& state, Operation* op) {
|
|
||||||
if (!llvm::is_contained(state.operationsToRemove, op))
|
|
||||||
state.operationsToRemove.push_back(op);
|
|
||||||
}
|
|
||||||
|
|
||||||
static std::string makeUniqueSymbolName(Operation* symbolTableOp, StringRef baseName) {
|
static std::string makeUniqueSymbolName(Operation* symbolTableOp, StringRef baseName) {
|
||||||
std::string name = baseName.str();
|
std::string name = baseName.str();
|
||||||
unsigned suffix = 0;
|
unsigned suffix = 0;
|
||||||
@@ -318,7 +315,8 @@ static LogicalResult mapIndicesThroughHelperChain(ArrayRef<int64_t> sourceIndice
|
|||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
static void cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewriter& rewriter) {
|
static void
|
||||||
|
cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewriter& rewriter, OperationFolder& constantFolder) {
|
||||||
for (Value operand : op->getOperands()) {
|
for (Value operand : op->getOperands()) {
|
||||||
if (mapping.lookupOrNull(operand))
|
if (mapping.lookupOrNull(operand))
|
||||||
continue;
|
continue;
|
||||||
@@ -327,7 +325,12 @@ static void cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewri
|
|||||||
if (!definingOp)
|
if (!definingOp)
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
if (!isa<tensor::EmptyOp, arith::ConstantOp>(definingOp))
|
if (auto constantOp = dyn_cast<arith::ConstantOp>(definingOp)) {
|
||||||
|
mapping.map(operand, getOrCreateHostConstantLike(constantOp, constantFolder));
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
if (!isa<tensor::EmptyOp>(definingOp))
|
||||||
continue;
|
continue;
|
||||||
|
|
||||||
Operation* clonedOp = rewriter.clone(*definingOp, mapping);
|
Operation* clonedOp = rewriter.clone(*definingOp, mapping);
|
||||||
@@ -337,15 +340,18 @@ static void cloneMappedHelperOperands(Operation* op, IRMapping& mapping, IRRewri
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
static void
|
static void cloneHelperChain(Value sourceValue,
|
||||||
cloneHelperChain(Value sourceValue, ArrayRef<Operation*> helperChain, IRRewriter& rewriter, Value& clonedValue) {
|
ArrayRef<Operation*> helperChain,
|
||||||
|
IRRewriter& rewriter,
|
||||||
|
OperationFolder& constantFolder,
|
||||||
|
Value& clonedValue) {
|
||||||
IRMapping mapping;
|
IRMapping mapping;
|
||||||
mapping.map(sourceValue, sourceValue);
|
mapping.map(sourceValue, sourceValue);
|
||||||
clonedValue = sourceValue;
|
clonedValue = sourceValue;
|
||||||
|
|
||||||
rewriter.setInsertionPointAfterValue(sourceValue);
|
rewriter.setInsertionPointAfterValue(sourceValue);
|
||||||
for (Operation* op : helperChain) {
|
for (Operation* op : helperChain) {
|
||||||
cloneMappedHelperOperands(op, mapping, rewriter);
|
cloneMappedHelperOperands(op, mapping, rewriter, constantFolder);
|
||||||
Operation* clonedOp = rewriter.clone(*op, mapping);
|
Operation* clonedOp = rewriter.clone(*op, mapping);
|
||||||
for (auto [originalResult, newResult] : llvm::zip(op->getResults(), clonedOp->getResults()))
|
for (auto [originalResult, newResult] : llvm::zip(op->getResults(), clonedOp->getResults()))
|
||||||
mapping.map(originalResult, newResult);
|
mapping.map(originalResult, newResult);
|
||||||
@@ -360,23 +366,26 @@ static Value emitHostCopy(IRRewriter& rewriter,
|
|||||||
Value sourceValue,
|
Value sourceValue,
|
||||||
int32_t hostTargetOffset,
|
int32_t hostTargetOffset,
|
||||||
int32_t deviceSourceOffset,
|
int32_t deviceSourceOffset,
|
||||||
int32_t sizeInBytes) {
|
int32_t sizeInBytes,
|
||||||
|
OperationFolder& constantFolder) {
|
||||||
|
Operation* anchorOp = sourceValue.getDefiningOp() ? sourceValue.getDefiningOp() : outputTensor.getDefiningOp();
|
||||||
|
assert(anchorOp && "expected a concrete op anchor for return-path host copy constants");
|
||||||
|
Value hostTargetOffsetValue = getOrCreateHostIndexConstant(anchorOp, hostTargetOffset, constantFolder);
|
||||||
|
Value deviceSourceOffsetValue = getOrCreateHostIndexConstant(anchorOp, deviceSourceOffset, constantFolder);
|
||||||
return PimMemCopyDevToHostOp::create(rewriter,
|
return PimMemCopyDevToHostOp::create(rewriter,
|
||||||
loc,
|
loc,
|
||||||
outputTensor.getType(),
|
outputTensor.getType(),
|
||||||
|
hostTargetOffsetValue,
|
||||||
|
deviceSourceOffsetValue,
|
||||||
outputTensor,
|
outputTensor,
|
||||||
sourceValue,
|
sourceValue,
|
||||||
rewriter.getI32IntegerAttr(hostTargetOffset),
|
|
||||||
rewriter.getI32IntegerAttr(deviceSourceOffset),
|
|
||||||
rewriter.getI32IntegerAttr(sizeInBytes))
|
rewriter.getI32IntegerAttr(sizeInBytes))
|
||||||
.getOutput();
|
.getOutput();
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
void addReturnOutputBuffers(func::ReturnOp returnOp,
|
void raptor::SpatialToPimPass::addReturnOutputBuffers(func::ReturnOp returnOp, IRRewriter& rewriter) {
|
||||||
IRRewriter& rewriter,
|
|
||||||
SmallVectorImpl<OutputTensorFactory>& outputTensors) {
|
|
||||||
outputTensors.reserve(returnOp->getNumOperands());
|
outputTensors.reserve(returnOp->getNumOperands());
|
||||||
for (auto [index, returnValue] : llvm::enumerate(returnOp->getOperands())) {
|
for (auto [index, returnValue] : llvm::enumerate(returnOp->getOperands())) {
|
||||||
Value currentReturnValue = returnValue;
|
Value currentReturnValue = returnValue;
|
||||||
@@ -411,70 +420,85 @@ void addReturnOutputBuffers(func::ReturnOp returnOp,
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
ReturnPathLoweringResult lowerComputeResultReturnPath(
|
raptor::SpatialToPimPass::ReturnPathLoweringResult raptor::SpatialToPimPass::lowerProducedValueReturnPath(
|
||||||
spatial::SpatCompute computeOp, OpResult result, Value yieldValue, ReturnPathState& state, IRRewriter& rewriter) {
|
Operation* producerOp, Value producedValue, Value storedValue, IRRewriter& rewriter) {
|
||||||
Location loc = computeOp->getLoc();
|
Location loc = producerOp->getLoc();
|
||||||
auto yieldType = cast<TensorType>(yieldValue.getType());
|
OperationFolder constantFolder(producerOp->getContext());
|
||||||
|
auto storedTensorType = cast<TensorType>(storedValue.getType());
|
||||||
|
|
||||||
if (auto returnUse = analyzeReturnUse(result)) {
|
if (auto returnUse = analyzeReturnUse(producedValue)) {
|
||||||
Value storedValue = yieldValue;
|
Value currentStoredValue = storedValue;
|
||||||
cloneHelperChain(yieldValue, returnUse->helperChain, rewriter, storedValue);
|
cloneHelperChain(storedValue, returnUse->helperChain, rewriter, constantFolder, currentStoredValue);
|
||||||
for (Operation* op : returnUse->helperChain)
|
for (Operation* op : returnUse->helperChain)
|
||||||
markOpToRemove(state, op);
|
markOpToRemove(op);
|
||||||
|
|
||||||
auto storedType = cast<ShapedType>(storedValue.getType());
|
auto storedType = cast<ShapedType>(currentStoredValue.getType());
|
||||||
size_t elementSize = storedType.getElementTypeBitWidth() / 8;
|
size_t elementSize = getElementTypeSizeInBytes(storedType.getElementType());
|
||||||
if (auto storedOp = storedValue.getDefiningOp())
|
if (auto storedOp = currentStoredValue.getDefiningOp())
|
||||||
rewriter.setInsertionPointAfter(storedOp);
|
rewriter.setInsertionPointAfter(storedOp);
|
||||||
Value outputTensor = state.outputTensors[returnUse->returnIndex](rewriter, loc);
|
Value outputTensor = outputTensors[returnUse->returnIndex](rewriter, loc);
|
||||||
emitHostCopy(
|
emitHostCopy(rewriter,
|
||||||
rewriter, loc, outputTensor, storedValue, 0, 0, static_cast<int32_t>(storedType.getNumElements() * elementSize));
|
loc,
|
||||||
|
outputTensor,
|
||||||
|
currentStoredValue,
|
||||||
|
0,
|
||||||
|
0,
|
||||||
|
static_cast<int32_t>(storedType.getNumElements() * elementSize),
|
||||||
|
constantFolder);
|
||||||
return ReturnPathLoweringResult::Handled;
|
return ReturnPathLoweringResult::Handled;
|
||||||
}
|
}
|
||||||
|
|
||||||
auto resultUses = result.getUses();
|
auto resultUses = producedValue.getUses();
|
||||||
if (rangeLength(resultUses) == 1) {
|
if (rangeLength(resultUses) == 1) {
|
||||||
OpOperand& resultUse = *resultUses.begin();
|
OpOperand& resultUse = *resultUses.begin();
|
||||||
Operation* resultUser = resultUse.getOwner();
|
Operation* resultUser = resultUse.getOwner();
|
||||||
|
|
||||||
if (isa<func::ReturnOp>(resultUser)) {
|
if (isa<func::ReturnOp>(resultUser)) {
|
||||||
size_t resultIndexInReturn = resultUse.getOperandNumber();
|
size_t resultIndexInReturn = resultUse.getOperandNumber();
|
||||||
size_t elementSize = yieldType.getElementType().getIntOrFloatBitWidth() / 8;
|
size_t elementSize = getElementTypeSizeInBytes(storedTensorType.getElementType());
|
||||||
rewriter.setInsertionPointAfterValue(yieldValue);
|
rewriter.setInsertionPointAfterValue(storedValue);
|
||||||
Value outputTensor = state.outputTensors[resultIndexInReturn](rewriter, loc);
|
Value outputTensor = outputTensors[resultIndexInReturn](rewriter, loc);
|
||||||
emitHostCopy(
|
emitHostCopy(rewriter,
|
||||||
rewriter, loc, outputTensor, yieldValue, 0, 0, static_cast<int32_t>(yieldType.getNumElements() * elementSize));
|
loc,
|
||||||
|
outputTensor,
|
||||||
|
storedValue,
|
||||||
|
0,
|
||||||
|
0,
|
||||||
|
static_cast<int32_t>(storedTensorType.getNumElements() * elementSize),
|
||||||
|
constantFolder);
|
||||||
return ReturnPathLoweringResult::Handled;
|
return ReturnPathLoweringResult::Handled;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (auto concatReturnUse = analyzeConcatReturnUse(result)) {
|
if (auto concatReturnUse = analyzeConcatReturnUse(producedValue)) {
|
||||||
size_t elementSize = yieldType.getElementTypeBitWidth() / 8;
|
size_t elementSize = getElementTypeSizeInBytes(storedTensorType.getElementType());
|
||||||
for (Operation* concatOp : concatReturnUse->concatChain)
|
for (Operation* concatOp : concatReturnUse->concatChain)
|
||||||
markOpToRemove(state, concatOp);
|
markOpToRemove(concatOp);
|
||||||
|
|
||||||
if (concatReturnUse->helperChain.empty()) {
|
if (concatReturnUse->helperChain.empty()) {
|
||||||
rewriter.setInsertionPointAfterValue(yieldValue);
|
rewriter.setInsertionPointAfterValue(storedValue);
|
||||||
Value outputTensor = state.outputTensors[concatReturnUse->returnIndex](rewriter, loc);
|
Value outputTensor = outputTensors[concatReturnUse->returnIndex](rewriter, loc);
|
||||||
auto outputType = cast<ShapedType>(outputTensor.getType());
|
auto outputType = cast<ShapedType>(outputTensor.getType());
|
||||||
int64_t flatOffset = computeFlatElementIndex(concatReturnUse->sliceOffsets, outputType.getShape());
|
int64_t flatOffset = computeFlatElementIndex(concatReturnUse->sliceOffsets, outputType.getShape());
|
||||||
emitHostCopy(rewriter,
|
emitHostCopy(rewriter,
|
||||||
loc,
|
loc,
|
||||||
outputTensor,
|
outputTensor,
|
||||||
yieldValue,
|
storedValue,
|
||||||
static_cast<int32_t>(flatOffset * elementSize),
|
static_cast<int32_t>(flatOffset * elementSize),
|
||||||
0,
|
0,
|
||||||
static_cast<int32_t>(yieldType.getNumElements() * elementSize));
|
static_cast<int32_t>(storedTensorType.getNumElements() * elementSize),
|
||||||
|
constantFolder);
|
||||||
return ReturnPathLoweringResult::Handled;
|
return ReturnPathLoweringResult::Handled;
|
||||||
}
|
}
|
||||||
|
|
||||||
auto storedType = dyn_cast<RankedTensorType>(yieldValue.getType());
|
auto storedType = dyn_cast<RankedTensorType>(storedValue.getType());
|
||||||
if (!storedType) {
|
if (!storedType) {
|
||||||
computeOp.emitOpError("has an unsupported non-ranked concat-return helper yield during Spatial-to-PIM lowering");
|
producerOp->emitOpError(
|
||||||
|
"has an unsupported non-ranked concat-return helper yield during Spatial-to-PIM lowering");
|
||||||
return ReturnPathLoweringResult::Failure;
|
return ReturnPathLoweringResult::Failure;
|
||||||
}
|
}
|
||||||
rewriter.setInsertionPointAfterValue(yieldValue);
|
rewriter.setInsertionPointAfterValue(storedValue);
|
||||||
Value outputTensor = state.outputTensors[concatReturnUse->returnIndex](rewriter, loc);
|
Value outputTensor = outputTensors[concatReturnUse->returnIndex](rewriter, loc);
|
||||||
auto outputType = cast<ShapedType>(outputTensor.getType());
|
auto outputType = cast<ShapedType>(outputTensor.getType());
|
||||||
for (int64_t linearIndex = 0; linearIndex < storedType.getNumElements(); ++linearIndex) {
|
for (int64_t linearIndex = 0; linearIndex < storedType.getNumElements(); ++linearIndex) {
|
||||||
SmallVector<int64_t> sourceIndices = expandFlatElementIndex(linearIndex, storedType.getShape());
|
SmallVector<int64_t> sourceIndices = expandFlatElementIndex(linearIndex, storedType.getShape());
|
||||||
@@ -484,7 +508,7 @@ ReturnPathLoweringResult lowerComputeResultReturnPath(
|
|||||||
SmallVector<int64_t> destinationIndices;
|
SmallVector<int64_t> destinationIndices;
|
||||||
if (failed(mapIndicesThroughHelperChain(
|
if (failed(mapIndicesThroughHelperChain(
|
||||||
sourceIndices, concatReturnUse->concatShape, concatReturnUse->helperChain, destinationIndices))) {
|
sourceIndices, concatReturnUse->concatShape, concatReturnUse->helperChain, destinationIndices))) {
|
||||||
computeOp.emitOpError("has an unsupported concat-return helper chain during Spatial-to-PIM lowering");
|
producerOp->emitOpError("has an unsupported concat-return helper chain during Spatial-to-PIM lowering");
|
||||||
return ReturnPathLoweringResult::Failure;
|
return ReturnPathLoweringResult::Failure;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -503,7 +527,7 @@ ReturnPathLoweringResult lowerComputeResultReturnPath(
|
|||||||
auto scalarTensorType =
|
auto scalarTensorType =
|
||||||
RankedTensorType::get(SmallVector<int64_t>(storedType.getRank(), 1), storedType.getElementType());
|
RankedTensorType::get(SmallVector<int64_t>(storedType.getRank(), 1), storedType.getElementType());
|
||||||
auto elementSlice = tensor::ExtractSliceOp::create(
|
auto elementSlice = tensor::ExtractSliceOp::create(
|
||||||
rewriter, loc, scalarTensorType, yieldValue, extractOffsets, extractSizes, extractStrides);
|
rewriter, loc, scalarTensorType, storedValue, extractOffsets, extractSizes, extractStrides);
|
||||||
rewriter.setInsertionPointAfter(elementSlice);
|
rewriter.setInsertionPointAfter(elementSlice);
|
||||||
|
|
||||||
int64_t destinationFlatOffset = computeFlatElementIndex(destinationIndices, outputType.getShape());
|
int64_t destinationFlatOffset = computeFlatElementIndex(destinationIndices, outputType.getShape());
|
||||||
@@ -513,7 +537,8 @@ ReturnPathLoweringResult lowerComputeResultReturnPath(
|
|||||||
elementSlice.getResult(),
|
elementSlice.getResult(),
|
||||||
static_cast<int32_t>(destinationFlatOffset * elementSize),
|
static_cast<int32_t>(destinationFlatOffset * elementSize),
|
||||||
0,
|
0,
|
||||||
static_cast<int32_t>(elementSize));
|
static_cast<int32_t>(elementSize),
|
||||||
|
constantFolder);
|
||||||
}
|
}
|
||||||
return ReturnPathLoweringResult::Handled;
|
return ReturnPathLoweringResult::Handled;
|
||||||
}
|
}
|
||||||
@@ -521,7 +546,12 @@ ReturnPathLoweringResult lowerComputeResultReturnPath(
|
|||||||
return ReturnPathLoweringResult::NotReturnPath;
|
return ReturnPathLoweringResult::NotReturnPath;
|
||||||
}
|
}
|
||||||
|
|
||||||
void replaceReturnWithOutputBuffers(func::ReturnOp returnOp, IRRewriter& rewriter, ReturnPathState& state) {
|
raptor::SpatialToPimPass::ReturnPathLoweringResult raptor::SpatialToPimPass::lowerComputeResultReturnPath(
|
||||||
|
spatial::SpatCompute computeOp, OpResult result, Value yieldValue, IRRewriter& rewriter) {
|
||||||
|
return lowerProducedValueReturnPath(computeOp.getOperation(), result, yieldValue, rewriter);
|
||||||
|
}
|
||||||
|
|
||||||
|
void raptor::SpatialToPimPass::replaceReturnWithOutputBuffers(func::ReturnOp returnOp, IRRewriter& rewriter) {
|
||||||
auto markOwnedReturnChain = [&](Operation* op, auto&& markOwnedReturnChain) -> void {
|
auto markOwnedReturnChain = [&](Operation* op, auto&& markOwnedReturnChain) -> void {
|
||||||
if (!op)
|
if (!op)
|
||||||
return;
|
return;
|
||||||
@@ -538,13 +568,13 @@ void replaceReturnWithOutputBuffers(func::ReturnOp returnOp, IRRewriter& rewrite
|
|||||||
|
|
||||||
if (isReturnHelperChainOp(op)) {
|
if (isReturnHelperChainOp(op)) {
|
||||||
Value source = op->getOperand(0);
|
Value source = op->getOperand(0);
|
||||||
markOpToRemove(state, op);
|
markOpToRemove(op);
|
||||||
markOwnedReturnChain(source.getDefiningOp(), markOwnedReturnChain);
|
markOwnedReturnChain(source.getDefiningOp(), markOwnedReturnChain);
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (auto computeOp = dyn_cast<spatial::SpatCompute>(op)) {
|
if (auto computeOp = dyn_cast<spatial::SpatCompute>(op)) {
|
||||||
markOpToRemove(state, computeOp);
|
markOpToRemove(computeOp);
|
||||||
if (!computeOp.getInputs().empty())
|
if (!computeOp.getInputs().empty())
|
||||||
for (Value input : computeOp.getInputs())
|
for (Value input : computeOp.getInputs())
|
||||||
markOwnedReturnChain(input.getDefiningOp(), markOwnedReturnChain);
|
markOwnedReturnChain(input.getDefiningOp(), markOwnedReturnChain);
|
||||||
@@ -552,24 +582,31 @@ void replaceReturnWithOutputBuffers(func::ReturnOp returnOp, IRRewriter& rewrite
|
|||||||
}
|
}
|
||||||
|
|
||||||
if (auto concatOp = dyn_cast<tensor::ConcatOp>(op)) {
|
if (auto concatOp = dyn_cast<tensor::ConcatOp>(op)) {
|
||||||
markOpToRemove(state, concatOp);
|
markOpToRemove(concatOp);
|
||||||
for (Value operand : concatOp.getOperands())
|
for (Value operand : concatOp.getOperands())
|
||||||
markOwnedReturnChain(operand.getDefiningOp(), markOwnedReturnChain);
|
markOwnedReturnChain(operand.getDefiningOp(), markOwnedReturnChain);
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (auto concatOp = dyn_cast<spatial::SpatConcatOp>(op)) {
|
if (auto concatOp = dyn_cast<spatial::SpatConcatOp>(op)) {
|
||||||
markOpToRemove(state, concatOp);
|
markOpToRemove(concatOp);
|
||||||
for (Value operand : concatOp.getInputs())
|
for (Value operand : concatOp.getInputs())
|
||||||
markOwnedReturnChain(operand.getDefiningOp(), markOwnedReturnChain);
|
markOwnedReturnChain(operand.getDefiningOp(), markOwnedReturnChain);
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
if (auto concatOp = dyn_cast<pim::PimConcatOp>(op)) {
|
if (auto concatOp = dyn_cast<pim::PimConcatOp>(op)) {
|
||||||
markOpToRemove(state, concatOp);
|
markOpToRemove(concatOp);
|
||||||
for (Value operand : concatOp.getInputs())
|
for (Value operand : concatOp.getInputs())
|
||||||
markOwnedReturnChain(operand.getDefiningOp(), markOwnedReturnChain);
|
markOwnedReturnChain(operand.getDefiningOp(), markOwnedReturnChain);
|
||||||
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
if (auto receiveOp = dyn_cast<spatial::SpatChannelReceiveOp>(op)) {
|
||||||
|
markOpToRemove(receiveOp);
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
|
||||||
};
|
};
|
||||||
|
|
||||||
SmallVector<Value> originalOperands(returnOp.getOperands().begin(), returnOp.getOperands().end());
|
SmallVector<Value> originalOperands(returnOp.getOperands().begin(), returnOp.getOperands().end());
|
||||||
@@ -578,7 +615,7 @@ void replaceReturnWithOutputBuffers(func::ReturnOp returnOp, IRRewriter& rewrite
|
|||||||
size_t orderWithinReturn = it.index();
|
size_t orderWithinReturn = it.index();
|
||||||
Operation* returnOperand = it.value().getDefiningOp();
|
Operation* returnOperand = it.value().getDefiningOp();
|
||||||
rewriter.setInsertionPoint(returnOp);
|
rewriter.setInsertionPoint(returnOp);
|
||||||
Value outputTensor = state.outputTensors[orderWithinReturn](rewriter, loc);
|
Value outputTensor = outputTensors[orderWithinReturn](rewriter, loc);
|
||||||
rewriter.modifyOpInPlace(returnOp, [&] { returnOp.setOperand(orderWithinReturn, outputTensor); });
|
rewriter.modifyOpInPlace(returnOp, [&] { returnOp.setOperand(orderWithinReturn, outputTensor); });
|
||||||
markOwnedReturnChain(returnOperand, markOwnedReturnChain);
|
markOwnedReturnChain(returnOperand, markOwnedReturnChain);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,37 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
|
||||||
#include "mlir/IR/PatternMatch.h"
|
|
||||||
|
|
||||||
#include <functional>
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
|
|
||||||
using OutputTensorFactory = std::function<mlir::Value(mlir::IRRewriter& rewriter, mlir::Location loc)>;
|
|
||||||
|
|
||||||
struct ReturnPathState {
|
|
||||||
llvm::SmallVectorImpl<OutputTensorFactory>& outputTensors;
|
|
||||||
llvm::SmallVectorImpl<mlir::Operation*>& operationsToRemove;
|
|
||||||
};
|
|
||||||
|
|
||||||
enum class ReturnPathLoweringResult {
|
|
||||||
Handled,
|
|
||||||
NotReturnPath,
|
|
||||||
Failure
|
|
||||||
};
|
|
||||||
|
|
||||||
void addReturnOutputBuffers(mlir::func::ReturnOp returnOp,
|
|
||||||
mlir::IRRewriter& rewriter,
|
|
||||||
llvm::SmallVectorImpl<OutputTensorFactory>& outputTensors);
|
|
||||||
|
|
||||||
ReturnPathLoweringResult lowerComputeResultReturnPath(spatial::SpatCompute computeOp,
|
|
||||||
mlir::OpResult result,
|
|
||||||
mlir::Value yieldValue,
|
|
||||||
ReturnPathState& state,
|
|
||||||
mlir::IRRewriter& rewriter);
|
|
||||||
|
|
||||||
void replaceReturnWithOutputBuffers(mlir::func::ReturnOp returnOp, mlir::IRRewriter& rewriter, ReturnPathState& state);
|
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -16,8 +16,8 @@ def onnxToPimTranspose : Pat<
|
|||||||
>;
|
>;
|
||||||
|
|
||||||
def spatToPimVMM : Pat<
|
def spatToPimVMM : Pat<
|
||||||
(SpatVMMOp:$srcOpRes $weightIndex, $vector),
|
(SpatVMMOp:$srcOpRes $weight, $vector),
|
||||||
(PimVMMOp $weightIndex, $vector,
|
(PimVMMOp $weight, $vector,
|
||||||
(NativeCodeCall<"onnx_mlir::getBestOutputTensorFromOperandsOrAllocate($_builder, $0.getDefiningOp())"> $srcOpRes))
|
(NativeCodeCall<"onnx_mlir::getBestOutputTensorFromOperandsOrAllocate($_builder, $0.getDefiningOp())"> $srcOpRes))
|
||||||
>;
|
>;
|
||||||
|
|
||||||
|
|||||||
@@ -1,8 +1,11 @@
|
|||||||
|
#include "mlir/Conversion/AffineToStandard/AffineToStandard.h"
|
||||||
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
||||||
#include "mlir/Dialect/Arith/IR/Arith.h"
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
#include "mlir/Dialect/Bufferization/IR/Bufferization.h"
|
#include "mlir/Dialect/Bufferization/IR/Bufferization.h"
|
||||||
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
||||||
#include "mlir/Dialect/SCF/IR/SCF.h"
|
#include "mlir/Dialect/SCF/IR/SCF.h"
|
||||||
|
#include "mlir/Dialect/SCF/Utils/Utils.h"
|
||||||
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
||||||
#include "mlir/IR/BuiltinDialect.h"
|
#include "mlir/IR/BuiltinDialect.h"
|
||||||
#include "mlir/IR/BuiltinOps.h"
|
#include "mlir/IR/BuiltinOps.h"
|
||||||
@@ -12,6 +15,7 @@
|
|||||||
#include "mlir/IR/SymbolTable.h"
|
#include "mlir/IR/SymbolTable.h"
|
||||||
#include "mlir/IR/Value.h"
|
#include "mlir/IR/Value.h"
|
||||||
#include "mlir/Pass/Pass.h"
|
#include "mlir/Pass/Pass.h"
|
||||||
|
#include "mlir/Transforms/FoldUtils.h"
|
||||||
#include "mlir/Transforms/WalkPatternRewriteDriver.h"
|
#include "mlir/Transforms/WalkPatternRewriteDriver.h"
|
||||||
|
|
||||||
#include "llvm/ADT/StringRef.h"
|
#include "llvm/ADT/StringRef.h"
|
||||||
@@ -21,54 +25,28 @@
|
|||||||
#include <cassert>
|
#include <cassert>
|
||||||
#include <utility>
|
#include <utility>
|
||||||
|
|
||||||
|
#include "Common/PimCommon.hpp"
|
||||||
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "Conversion/SpatialToPim/ChannelLoweringPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/BatchCoreLoweringPatterns.hpp"
|
#include "Conversion/SpatialToPim/Common.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ChannelLoweringPatterns.hpp"
|
#include "Conversion/SpatialToPim/GlobalTensorMaterialization.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Cleanup.hpp"
|
#include "Conversion/SpatialToPim/PhaseVerification.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/Common.hpp"
|
#include "Conversion/SpatialToPim/TensorPackingPatterns.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/CoreLoweringPatterns.hpp"
|
#include "Dialect/Pim/PimOps.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/GlobalTensorMaterialization.hpp"
|
#include "Dialect/Spatial/SpatialOps.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/PhaseVerification.hpp"
|
#include "Pass/PIMPasses.h"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/ReturnPathNormalization.hpp"
|
#include "SpatialToPimPass.hpp"
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/TensorPackingPatterns.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Pass/PIMPasses.h"
|
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
using namespace onnx_mlir;
|
using namespace onnx_mlir;
|
||||||
using namespace pim;
|
using namespace pim;
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
|
namespace raptor {
|
||||||
namespace {
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Conversion/SpatialToPim/SpatialToPim.hpp.inc"
|
#include "src/Accelerators/PIM/Conversion/SpatialToPim/SpatialToPim.hpp.inc"
|
||||||
|
|
||||||
struct SpatialToPimPass : PassWrapper<SpatialToPimPass, OperationPass<ModuleOp>> {
|
} // namespace raptor
|
||||||
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(SpatialToPimPass)
|
|
||||||
StringRef getArgument() const override { return "convert-spatial-to-pim"; }
|
|
||||||
StringRef getDescription() const override { return "Lower Spatial ops to PIM-ready format"; }
|
|
||||||
|
|
||||||
SpatialToPimPass() = default;
|
|
||||||
SpatialToPimPass(const SpatialToPimPass& pass) {}
|
|
||||||
|
|
||||||
void runOnOperation() final;
|
|
||||||
|
|
||||||
private:
|
|
||||||
SmallVector<OutputTensorFactory> outputTensors;
|
|
||||||
size_t coreId = 0;
|
|
||||||
SmallVector<Operation*> operationsToRemove;
|
|
||||||
|
|
||||||
LogicalResult allocateAndInitializeCoreLocalVariables(func::FuncOp funcOp, IRRewriter& rewriter);
|
|
||||||
|
|
||||||
void markOpToRemove(Operation* op);
|
|
||||||
|
|
||||||
void enlargeVMMOutTensorsToCrossbarSize(func::FuncOp funcOp, IRRewriter& rewriter);
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace
|
|
||||||
|
|
||||||
static memref::GlobalOp getOrCreateZeroGlobal(IRRewriter& rewriter, Location loc, RankedTensorType tensorType) {
|
static memref::GlobalOp getOrCreateZeroGlobal(IRRewriter& rewriter, Location loc, RankedTensorType tensorType) {
|
||||||
auto moduleOp = rewriter.getBlock()->getParentOp()->getParentOfType<ModuleOp>();
|
auto moduleOp = rewriter.getBlock()->getParentOp()->getParentOfType<ModuleOp>();
|
||||||
@@ -104,23 +82,34 @@ static memref::GlobalOp getOrCreateZeroGlobal(IRRewriter& rewriter, Location loc
|
|||||||
IntegerAttr {});
|
IntegerAttr {});
|
||||||
}
|
}
|
||||||
|
|
||||||
static Value createZeroedDeviceHVector(IRRewriter& rewriter, Location loc, RankedTensorType tensorType) {
|
static Value createZeroedDeviceHVector(IRRewriter& rewriter,
|
||||||
|
Location loc,
|
||||||
|
RankedTensorType tensorType,
|
||||||
|
OperationFolder& constantFolder) {
|
||||||
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, tensorType);
|
auto outputBuffer = createEmptyTensorFromShaped(rewriter, loc, tensorType);
|
||||||
auto zeroGlobal = getOrCreateZeroGlobal(rewriter, loc, tensorType);
|
auto zeroGlobal = getOrCreateZeroGlobal(rewriter, loc, tensorType);
|
||||||
auto zeroValue = memref::GetGlobalOp::create(rewriter, loc, zeroGlobal.getType(), zeroGlobal.getName());
|
auto zeroValue = memref::GetGlobalOp::create(rewriter, loc, zeroGlobal.getType(), zeroGlobal.getName());
|
||||||
auto zeroAttr = rewriter.getI32IntegerAttr(0);
|
auto zeroIndex = getOrCreateHostIndexConstant(outputBuffer.getOperation(), 0, constantFolder);
|
||||||
auto sizeAttr = rewriter.getI32IntegerAttr(static_cast<int32_t>(getShapedTypeSizeInBytes(tensorType)));
|
auto sizeAttr = rewriter.getI32IntegerAttr(static_cast<int32_t>(getShapedTypeSizeInBytes(tensorType)));
|
||||||
|
|
||||||
if (outputBuffer->getParentOfType<PimCoreBatchOp>())
|
if (outputBuffer->getParentOfType<PimCoreBatchOp>())
|
||||||
return PimMemCopyHostToDevBatchOp::create(
|
return PimMemCopyHostToDevBatchOp::create(rewriter,
|
||||||
rewriter, loc, tensorType, outputBuffer, zeroValue, zeroAttr, zeroAttr, sizeAttr)
|
loc,
|
||||||
|
tensorType,
|
||||||
|
outputBuffer,
|
||||||
|
zeroValue,
|
||||||
|
rewriter.getI32IntegerAttr(0),
|
||||||
|
rewriter.getI32IntegerAttr(0),
|
||||||
|
sizeAttr)
|
||||||
.getOutput();
|
.getOutput();
|
||||||
|
|
||||||
return PimMemCopyHostToDevOp::create(rewriter, loc, tensorType, outputBuffer, zeroValue, zeroAttr, zeroAttr, sizeAttr)
|
return PimMemCopyHostToDevOp::create(
|
||||||
|
rewriter, loc, tensorType, zeroIndex, zeroIndex, outputBuffer, zeroValue, sizeAttr)
|
||||||
.getOutput();
|
.getOutput();
|
||||||
}
|
}
|
||||||
|
|
||||||
static Value padHVectorInputToCrossbarSize(IRRewriter& rewriter, Location loc, Value vector) {
|
static Value
|
||||||
|
padHVectorInputToCrossbarSize(IRRewriter& rewriter, Location loc, Value vector, OperationFolder& constantFolder) {
|
||||||
auto vectorType = cast<RankedTensorType>(vector.getType());
|
auto vectorType = cast<RankedTensorType>(vector.getType());
|
||||||
ArrayRef<int64_t> shape = vectorType.getShape();
|
ArrayRef<int64_t> shape = vectorType.getShape();
|
||||||
assert(isHVectorShape(shape) && "expected a horizontal vector");
|
assert(isHVectorShape(shape) && "expected a horizontal vector");
|
||||||
@@ -131,14 +120,16 @@ static Value padHVectorInputToCrossbarSize(IRRewriter& rewriter, Location loc, V
|
|||||||
|
|
||||||
auto paddedType = RankedTensorType::get(
|
auto paddedType = RankedTensorType::get(
|
||||||
{shape[0], static_cast<int64_t>(crossbarSize)}, vectorType.getElementType(), vectorType.getEncoding());
|
{shape[0], static_cast<int64_t>(crossbarSize)}, vectorType.getElementType(), vectorType.getEncoding());
|
||||||
Value zeroed = createZeroedDeviceHVector(rewriter, loc, paddedType);
|
Value zeroed = createZeroedDeviceHVector(rewriter, loc, paddedType, constantFolder);
|
||||||
auto zeroAttr = rewriter.getI32IntegerAttr(0);
|
auto zeroAttr = rewriter.getI32IntegerAttr(0);
|
||||||
auto sizeAttr = rewriter.getI32IntegerAttr(static_cast<int32_t>(getShapedTypeSizeInBytes(vectorType)));
|
auto sizeAttr = rewriter.getI32IntegerAttr(static_cast<int32_t>(getShapedTypeSizeInBytes(vectorType)));
|
||||||
return PimMemCopyOp::create(rewriter, loc, paddedType, zeroed, vector, zeroAttr, zeroAttr, sizeAttr).getOutput();
|
return PimMemCopyOp::create(rewriter, loc, paddedType, zeroed, vector, zeroAttr, zeroAttr, sizeAttr).getOutput();
|
||||||
}
|
}
|
||||||
|
|
||||||
void SpatialToPimPass::runOnOperation() {
|
void onnx_mlir::raptor::SpatialToPimPass::runOnOperation() {
|
||||||
coreId = 0;
|
coreId = 0;
|
||||||
|
outputTensors.clear();
|
||||||
|
operationsToRemove.clear();
|
||||||
ModuleOp moduleOp = getOperation();
|
ModuleOp moduleOp = getOperation();
|
||||||
MLIRContext* ctx = moduleOp.getContext();
|
MLIRContext* ctx = moduleOp.getContext();
|
||||||
|
|
||||||
@@ -151,9 +142,11 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
func::FuncOp funcOp = *entryFunc;
|
func::FuncOp funcOp = *entryFunc;
|
||||||
|
|
||||||
IRRewriter rewriter(&getContext());
|
IRRewriter rewriter(&getContext());
|
||||||
|
OperationFolder constantFolder(&getContext());
|
||||||
|
|
||||||
ConversionTarget target(*ctx);
|
ConversionTarget target(*ctx);
|
||||||
target.addLegalDialect<PimDialect,
|
target.addLegalDialect<affine::AffineDialect,
|
||||||
|
PimDialect,
|
||||||
tensor::TensorDialect,
|
tensor::TensorDialect,
|
||||||
arith::ArithDialect,
|
arith::ArithDialect,
|
||||||
bufferization::BufferizationDialect,
|
bufferization::BufferizationDialect,
|
||||||
@@ -163,11 +156,7 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
BuiltinDialect>();
|
BuiltinDialect>();
|
||||||
target.addLegalOp<spatial::SpatConcatOp,
|
target.addLegalOp<spatial::SpatConcatOp,
|
||||||
spatial::SpatChannelReceiveOp,
|
spatial::SpatChannelReceiveOp,
|
||||||
spatial::SpatChannelReceiveTensorOp,
|
|
||||||
spatial::SpatChannelReceiveTensorBatchOp,
|
|
||||||
spatial::SpatChannelSendOp,
|
spatial::SpatChannelSendOp,
|
||||||
spatial::SpatChannelSendTensorOp,
|
|
||||||
spatial::SpatChannelSendTensorBatchOp,
|
|
||||||
spatial::SpatExtractRowsOp>();
|
spatial::SpatExtractRowsOp>();
|
||||||
|
|
||||||
RewritePatternSet initialPatterns(ctx);
|
RewritePatternSet initialPatterns(ctx);
|
||||||
@@ -181,19 +170,18 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
RewritePatternSet globalTensorPatterns(ctx);
|
RewritePatternSet globalTensorPatterns(ctx);
|
||||||
populateGlobalTensorMaterializationPatterns(globalTensorPatterns);
|
populateGlobalTensorMaterializationPatterns(globalTensorPatterns);
|
||||||
walkAndApplyPatterns(moduleOp, std::move(globalTensorPatterns));
|
walkAndApplyPatterns(moduleOp, std::move(globalTensorPatterns));
|
||||||
auto returnOp = cast<func::ReturnOp>(funcOp.front().getTerminator());
|
|
||||||
|
|
||||||
addReturnOutputBuffers(returnOp, rewriter, outputTensors);
|
auto returnOp = cast<func::ReturnOp>(funcOp.front().getTerminator());
|
||||||
|
addReturnOutputBuffers(returnOp, rewriter);
|
||||||
if (failed(allocateAndInitializeCoreLocalVariables(funcOp, rewriter))) {
|
if (failed(allocateAndInitializeCoreLocalVariables(funcOp, rewriter))) {
|
||||||
funcOp.emitOpError("failed to allocate or initialize core-local tensors during Spatial-to-PIM lowering");
|
funcOp.emitOpError("failed to allocate or initialize core-local tensors during Spatial-to-PIM lowering");
|
||||||
signalPassFailure();
|
signalPassFailure();
|
||||||
return;
|
return;
|
||||||
}
|
}
|
||||||
|
|
||||||
CoreLoweringState coreLoweringState {coreId, outputTensors, operationsToRemove};
|
|
||||||
for (auto computeOp : funcOp.getOps<spatial::SpatCompute>()) {
|
for (auto computeOp : funcOp.getOps<spatial::SpatCompute>()) {
|
||||||
markOpToRemove(computeOp);
|
markOpToRemove(computeOp);
|
||||||
if (failed(lowerComputeOp(computeOp, coreLoweringState, rewriter))) {
|
if (failed(lowerComputeOp(computeOp, rewriter, constantFolder))) {
|
||||||
computeOp.emitOpError("failed to lower spat.compute to pim.core");
|
computeOp.emitOpError("failed to lower spat.compute to pim.core");
|
||||||
signalPassFailure();
|
signalPassFailure();
|
||||||
return;
|
return;
|
||||||
@@ -202,7 +190,7 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
|
|
||||||
for (auto computeBatchOp : funcOp.getOps<spatial::SpatComputeBatch>()) {
|
for (auto computeBatchOp : funcOp.getOps<spatial::SpatComputeBatch>()) {
|
||||||
markOpToRemove(computeBatchOp);
|
markOpToRemove(computeBatchOp);
|
||||||
if (failed(lowerComputeBatchOp(computeBatchOp, coreLoweringState, rewriter))) {
|
if (failed(lowerComputeBatchOp(computeBatchOp, rewriter))) {
|
||||||
computeBatchOp.emitOpError("failed to lower spat.compute_batch to pim.core_batch");
|
computeBatchOp.emitOpError("failed to lower spat.compute_batch to pim.core_batch");
|
||||||
signalPassFailure();
|
signalPassFailure();
|
||||||
return;
|
return;
|
||||||
@@ -228,12 +216,27 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
|
|
||||||
RewritePatternSet coreBodyPatterns(ctx);
|
RewritePatternSet coreBodyPatterns(ctx);
|
||||||
populateWithGenerated(coreBodyPatterns);
|
populateWithGenerated(coreBodyPatterns);
|
||||||
|
populateAffineToStdConversionPatterns(coreBodyPatterns);
|
||||||
FrozenRewritePatternSet frozenCoreBodyPatterns(std::move(coreBodyPatterns));
|
FrozenRewritePatternSet frozenCoreBodyPatterns(std::move(coreBodyPatterns));
|
||||||
|
|
||||||
|
ConversionTarget coreBodyTarget(*ctx);
|
||||||
|
coreBodyTarget.addLegalDialect<PimDialect,
|
||||||
|
tensor::TensorDialect,
|
||||||
|
arith::ArithDialect,
|
||||||
|
bufferization::BufferizationDialect,
|
||||||
|
func::FuncDialect,
|
||||||
|
memref::MemRefDialect,
|
||||||
|
scf::SCFDialect,
|
||||||
|
BuiltinDialect>();
|
||||||
|
coreBodyTarget.addLegalOp<spatial::SpatConcatOp,
|
||||||
|
spatial::SpatChannelReceiveOp,
|
||||||
|
spatial::SpatChannelSendOp,
|
||||||
|
spatial::SpatExtractRowsOp>();
|
||||||
|
|
||||||
SmallVector<pim::PimCoreOp> coreOps;
|
SmallVector<pim::PimCoreOp> coreOps;
|
||||||
funcOp.walk([&](pim::PimCoreOp coreOp) { coreOps.push_back(coreOp); });
|
funcOp.walk([&](pim::PimCoreOp coreOp) { coreOps.push_back(coreOp); });
|
||||||
for (auto coreOp : coreOps) {
|
for (auto coreOp : coreOps) {
|
||||||
if (failed(applyFullConversion(coreOp.getOperation(), target, frozenCoreBodyPatterns))) {
|
if (failed(applyFullConversion(coreOp.getOperation(), coreBodyTarget, frozenCoreBodyPatterns))) {
|
||||||
coreOp.emitOpError("failed to convert nested Spatial ops inside pim.core");
|
coreOp.emitOpError("failed to convert nested Spatial ops inside pim.core");
|
||||||
signalPassFailure();
|
signalPassFailure();
|
||||||
return;
|
return;
|
||||||
@@ -243,7 +246,7 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
SmallVector<pim::PimCoreBatchOp> coreBatchOps;
|
SmallVector<pim::PimCoreBatchOp> coreBatchOps;
|
||||||
funcOp.walk([&](pim::PimCoreBatchOp coreBatchOp) { coreBatchOps.push_back(coreBatchOp); });
|
funcOp.walk([&](pim::PimCoreBatchOp coreBatchOp) { coreBatchOps.push_back(coreBatchOp); });
|
||||||
for (auto coreBatchOp : coreBatchOps) {
|
for (auto coreBatchOp : coreBatchOps) {
|
||||||
if (failed(applyFullConversion(coreBatchOp.getOperation(), target, frozenCoreBodyPatterns))) {
|
if (failed(applyFullConversion(coreBatchOp.getOperation(), coreBodyTarget, frozenCoreBodyPatterns))) {
|
||||||
coreBatchOp.emitOpError("failed to convert nested Spatial ops inside pim.core_batch");
|
coreBatchOp.emitOpError("failed to convert nested Spatial ops inside pim.core_batch");
|
||||||
signalPassFailure();
|
signalPassFailure();
|
||||||
return;
|
return;
|
||||||
@@ -251,15 +254,8 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
}
|
}
|
||||||
|
|
||||||
enlargeVMMOutTensorsToCrossbarSize(funcOp, rewriter);
|
enlargeVMMOutTensorsToCrossbarSize(funcOp, rewriter);
|
||||||
ReturnPathState returnPathState {outputTensors, operationsToRemove};
|
replaceReturnWithOutputBuffers(returnOp, rewriter);
|
||||||
replaceReturnWithOutputBuffers(returnOp, rewriter, returnPathState);
|
eraseOpsToRemove();
|
||||||
|
|
||||||
SmallVector<Operation*> pendingRemovals(operationsToRemove.begin(), operationsToRemove.end());
|
|
||||||
if (failed(erasePendingOps(pendingRemovals, rewriter))) {
|
|
||||||
funcOp.emitOpError("failed to erase obsolete Spatial ops after lowering to PIM");
|
|
||||||
signalPassFailure();
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
RewritePatternSet finalTensorPackingPatterns(ctx);
|
RewritePatternSet finalTensorPackingPatterns(ctx);
|
||||||
populateTensorPackingPatterns(finalTensorPackingPatterns);
|
populateTensorPackingPatterns(finalTensorPackingPatterns);
|
||||||
@@ -278,9 +274,7 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
communicationTarget.addLegalOp<ModuleOp>();
|
communicationTarget.addLegalOp<ModuleOp>();
|
||||||
communicationTarget.addIllegalOp<spatial::SpatConcatOp,
|
communicationTarget.addIllegalOp<spatial::SpatConcatOp,
|
||||||
spatial::SpatChannelReceiveOp,
|
spatial::SpatChannelReceiveOp,
|
||||||
spatial::SpatChannelReceiveTensorOp,
|
|
||||||
spatial::SpatChannelSendOp,
|
spatial::SpatChannelSendOp,
|
||||||
spatial::SpatChannelSendTensorOp,
|
|
||||||
spatial::SpatExtractRowsOp>();
|
spatial::SpatExtractRowsOp>();
|
||||||
|
|
||||||
RewritePatternSet communicationPatterns(ctx);
|
RewritePatternSet communicationPatterns(ctx);
|
||||||
@@ -301,7 +295,8 @@ void SpatialToPimPass::runOnOperation() {
|
|||||||
dumpModule(moduleOp, "pim0");
|
dumpModule(moduleOp, "pim0");
|
||||||
}
|
}
|
||||||
|
|
||||||
void SpatialToPimPass::enlargeVMMOutTensorsToCrossbarSize(func::FuncOp funcOp, IRRewriter& rewriter) {
|
void raptor::SpatialToPimPass::enlargeVMMOutTensorsToCrossbarSize(func::FuncOp funcOp, IRRewriter& rewriter) {
|
||||||
|
OperationFolder constantFolder(funcOp.getContext());
|
||||||
funcOp.walk([&](PimVMMOp vmmOp) {
|
funcOp.walk([&](PimVMMOp vmmOp) {
|
||||||
auto outputType = cast<RankedTensorType>(vmmOp.getOutput().getType());
|
auto outputType = cast<RankedTensorType>(vmmOp.getOutput().getType());
|
||||||
ArrayRef<int64_t> outputShape = outputType.getShape();
|
ArrayRef<int64_t> outputShape = outputType.getShape();
|
||||||
@@ -309,7 +304,7 @@ void SpatialToPimPass::enlargeVMMOutTensorsToCrossbarSize(func::FuncOp funcOp, I
|
|||||||
assert(outputShape[1] <= static_cast<int64_t>(crossbarSize) && "output width must fit in one crossbar");
|
assert(outputShape[1] <= static_cast<int64_t>(crossbarSize) && "output width must fit in one crossbar");
|
||||||
|
|
||||||
rewriter.setInsertionPoint(vmmOp);
|
rewriter.setInsertionPoint(vmmOp);
|
||||||
Value paddedInput = padHVectorInputToCrossbarSize(rewriter, vmmOp.getLoc(), vmmOp.getInput());
|
Value paddedInput = padHVectorInputToCrossbarSize(rewriter, vmmOp.getLoc(), vmmOp.getInput(), constantFolder);
|
||||||
auto paddedOutputType = RankedTensorType::get(
|
auto paddedOutputType = RankedTensorType::get(
|
||||||
{outputShape[0], static_cast<int64_t>(crossbarSize)}, outputType.getElementType(), outputType.getEncoding());
|
{outputShape[0], static_cast<int64_t>(crossbarSize)}, outputType.getElementType(), outputType.getEncoding());
|
||||||
Value paddedOutputBuffer = outputShape[1] == static_cast<int64_t>(crossbarSize)
|
Value paddedOutputBuffer = outputShape[1] == static_cast<int64_t>(crossbarSize)
|
||||||
@@ -334,13 +329,17 @@ void SpatialToPimPass::enlargeVMMOutTensorsToCrossbarSize(func::FuncOp funcOp, I
|
|||||||
});
|
});
|
||||||
}
|
}
|
||||||
|
|
||||||
LogicalResult SpatialToPimPass::allocateAndInitializeCoreLocalVariables(func::FuncOp funcOp, IRRewriter& rewriter) {
|
LogicalResult raptor::SpatialToPimPass::allocateAndInitializeCoreLocalVariables(func::FuncOp funcOp,
|
||||||
|
IRRewriter& rewriter) {
|
||||||
Location loc = funcOp.getLoc();
|
Location loc = funcOp.getLoc();
|
||||||
|
OperationFolder constantFolder(funcOp.getContext());
|
||||||
|
|
||||||
auto insertMemCopyHostToDev = [&](Value inputTensor, int64_t elementsOffset) {
|
auto insertMemCopyHostToDev = [&](Value inputTensor, int64_t elementsOffset) {
|
||||||
auto tensorType = cast<ShapedType>(inputTensor.getType());
|
auto tensorType = cast<ShapedType>(inputTensor.getType());
|
||||||
Type elementType = tensorType.getElementType();
|
Type elementType = tensorType.getElementType();
|
||||||
size_t elementByteSize = elementType.getIntOrFloatBitWidth() / 8;
|
if (!hasByteSizedElementType(elementType))
|
||||||
|
return;
|
||||||
|
size_t elementByteSize = getElementTypeSizeInBytes(elementType);
|
||||||
rewriter.setInsertionPointAfter(inputTensor.getDefiningOp());
|
rewriter.setInsertionPointAfter(inputTensor.getDefiningOp());
|
||||||
|
|
||||||
auto deviceTensor = tensor::EmptyOp::create(rewriter, loc, tensorType.getShape(), elementType);
|
auto deviceTensor = tensor::EmptyOp::create(rewriter, loc, tensorType.getShape(), elementType);
|
||||||
@@ -349,10 +348,11 @@ LogicalResult SpatialToPimPass::allocateAndInitializeCoreLocalVariables(func::Fu
|
|||||||
rewriter,
|
rewriter,
|
||||||
loc,
|
loc,
|
||||||
tensorType,
|
tensorType,
|
||||||
|
getOrCreateHostIndexConstant(deviceTensor.getOperation(), 0, constantFolder),
|
||||||
|
getOrCreateHostIndexConstant(
|
||||||
|
deviceTensor.getOperation(), static_cast<int64_t>(elementsOffset * elementByteSize), constantFolder),
|
||||||
deviceTensor,
|
deviceTensor,
|
||||||
inputTensor,
|
inputTensor,
|
||||||
rewriter.getI32IntegerAttr(0),
|
|
||||||
rewriter.getI32IntegerAttr(static_cast<int32_t>(elementsOffset * elementByteSize)),
|
|
||||||
rewriter.getI32IntegerAttr(static_cast<int32_t>(tensorType.getNumElements() * elementByteSize)));
|
rewriter.getI32IntegerAttr(static_cast<int32_t>(tensorType.getNumElements() * elementByteSize)));
|
||||||
|
|
||||||
rewriter.replaceAllUsesExcept(inputTensor, memCopyHostToDevOp.getResult(), {memCopyHostToDevOp});
|
rewriter.replaceAllUsesExcept(inputTensor, memCopyHostToDevOp.getResult(), {memCopyHostToDevOp});
|
||||||
@@ -374,11 +374,18 @@ LogicalResult SpatialToPimPass::allocateAndInitializeCoreLocalVariables(func::Fu
|
|||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
void SpatialToPimPass::markOpToRemove(Operation* op) {
|
void raptor::SpatialToPimPass::markOpToRemove(Operation* op) {
|
||||||
if (!llvm::is_contained(operationsToRemove, op))
|
if (!llvm::is_contained(operationsToRemove, op))
|
||||||
operationsToRemove.push_back(op);
|
operationsToRemove.push_back(op);
|
||||||
}
|
}
|
||||||
|
|
||||||
std::unique_ptr<Pass> createSpatialToPimPass() { return std::make_unique<SpatialToPimPass>(); }
|
void raptor::SpatialToPimPass::eraseOpsToRemove() {
|
||||||
|
for (Operation* op : operationsToRemove) {
|
||||||
|
op->dropAllUses();
|
||||||
|
op->erase();
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
std::unique_ptr<Pass> createSpatialToPimPass() { return std::make_unique<raptor::SpatialToPimPass>(); }
|
||||||
|
|
||||||
} // namespace onnx_mlir
|
} // namespace onnx_mlir
|
||||||
|
|||||||
@@ -0,0 +1,72 @@
|
|||||||
|
#pragma once
|
||||||
|
|
||||||
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
|
#include "mlir/Dialect/Bufferization/IR/Bufferization.h"
|
||||||
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
|
#include "mlir/Dialect/SCF/Utils/Utils.h"
|
||||||
|
#include "mlir/IR/BuiltinOps.h"
|
||||||
|
#include "mlir/IR/PatternMatch.h"
|
||||||
|
#include "mlir/IR/Value.h"
|
||||||
|
#include "mlir/Pass/Pass.h"
|
||||||
|
#include "mlir/Transforms/FoldUtils.h"
|
||||||
|
|
||||||
|
#include "llvm/ADT/StringRef.h"
|
||||||
|
|
||||||
|
#include <functional>
|
||||||
|
|
||||||
|
#include "Conversion/ONNXToSpatial/Common/Common.hpp"
|
||||||
|
#include "Conversion/SpatialToPim/Common.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
|
namespace onnx_mlir {
|
||||||
|
namespace raptor {
|
||||||
|
|
||||||
|
struct SpatialToPimPass : mlir::PassWrapper<SpatialToPimPass, mlir::OperationPass<mlir::ModuleOp>> {
|
||||||
|
MLIR_DEFINE_EXPLICIT_INTERNAL_INLINE_TYPE_ID(SpatialToPimPass)
|
||||||
|
llvm::StringRef getArgument() const override { return "convert-spatial-to-pim"; }
|
||||||
|
llvm::StringRef getDescription() const override { return "Lower Spatial ops to PIM-ready format"; }
|
||||||
|
|
||||||
|
SpatialToPimPass() = default;
|
||||||
|
SpatialToPimPass(const SpatialToPimPass& pass) {}
|
||||||
|
|
||||||
|
void runOnOperation() final;
|
||||||
|
|
||||||
|
private:
|
||||||
|
using OutputTensorFactory = std::function<mlir::Value(mlir::IRRewriter& rewriter, mlir::Location loc)>;
|
||||||
|
|
||||||
|
llvm::SmallVector<OutputTensorFactory> outputTensors;
|
||||||
|
size_t coreId = 0;
|
||||||
|
llvm::SmallVector<mlir::Operation*> operationsToRemove;
|
||||||
|
|
||||||
|
mlir::LogicalResult allocateAndInitializeCoreLocalVariables(mlir::func::FuncOp funcOp, mlir::IRRewriter& rewriter);
|
||||||
|
mlir::LogicalResult
|
||||||
|
lowerComputeOp(spatial::SpatCompute computeOp, mlir::IRRewriter& rewriter, mlir::OperationFolder& constantFolder);
|
||||||
|
mlir::LogicalResult lowerComputeBatchOp(spatial::SpatComputeBatch computeBatchOp, mlir::IRRewriter& rewriter);
|
||||||
|
|
||||||
|
enum class ReturnPathLoweringResult {
|
||||||
|
Handled,
|
||||||
|
NotReturnPath,
|
||||||
|
Failure
|
||||||
|
};
|
||||||
|
|
||||||
|
void addReturnOutputBuffers(mlir::func::ReturnOp returnOp, mlir::IRRewriter& rewriter);
|
||||||
|
ReturnPathLoweringResult lowerComputeResultReturnPath(spatial::SpatCompute computeOp,
|
||||||
|
mlir::OpResult result,
|
||||||
|
mlir::Value yieldValue,
|
||||||
|
mlir::IRRewriter& rewriter);
|
||||||
|
ReturnPathLoweringResult lowerProducedValueReturnPath(mlir::Operation* producerOp,
|
||||||
|
mlir::Value producedValue,
|
||||||
|
mlir::Value storedValue,
|
||||||
|
mlir::IRRewriter& rewriter);
|
||||||
|
void replaceReturnWithOutputBuffers(mlir::func::ReturnOp returnOp, mlir::IRRewriter& rewriter);
|
||||||
|
|
||||||
|
void markOpToRemove(mlir::Operation* op);
|
||||||
|
void eraseOpsToRemove();
|
||||||
|
|
||||||
|
void enlargeVMMOutTensorsToCrossbarSize(mlir::func::FuncOp funcOp, mlir::IRRewriter& rewriter);
|
||||||
|
};
|
||||||
|
|
||||||
|
} // namespace raptor
|
||||||
|
|
||||||
|
} // namespace onnx_mlir
|
||||||
+34
-128
@@ -2,6 +2,7 @@
|
|||||||
#define PIM_DIALECT_H
|
#define PIM_DIALECT_H
|
||||||
|
|
||||||
include "mlir/IR/OpBase.td"
|
include "mlir/IR/OpBase.td"
|
||||||
|
include "mlir/IR/OpAsmInterface.td"
|
||||||
include "mlir/IR/AttrTypeBase.td"
|
include "mlir/IR/AttrTypeBase.td"
|
||||||
include "mlir/Dialect/MemRef/IR/MemRefBase.td"
|
include "mlir/Dialect/MemRef/IR/MemRefBase.td"
|
||||||
include "mlir/Interfaces/SideEffectInterfaces.td"
|
include "mlir/Interfaces/SideEffectInterfaces.td"
|
||||||
@@ -24,7 +25,8 @@ def PimTensor :
|
|||||||
// Execution
|
// Execution
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
|
|
||||||
def PimCoreOp : PimOp<"core", [SingleBlock, IsolatedFromAbove]> {
|
def PimCoreOp : PimOp<"core", [SingleBlock,
|
||||||
|
DeclareOpInterfaceMethods<OpAsmOpInterface, ["getAsmBlockArgumentNames"]>]> {
|
||||||
let summary = "Execute a block on a PIM core";
|
let summary = "Execute a block on a PIM core";
|
||||||
|
|
||||||
let regions = (region SizedRegion<1>:$body);
|
let regions = (region SizedRegion<1>:$body);
|
||||||
@@ -34,12 +36,16 @@ def PimCoreOp : PimOp<"core", [SingleBlock, IsolatedFromAbove]> {
|
|||||||
I32Attr:$coreId
|
I32Attr:$coreId
|
||||||
);
|
);
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let extraClassDeclaration = [{
|
||||||
`(` $weights `)` attr-dict regions `:` type($weights) `->` `(` `)`
|
::mlir::BlockArgument getWeightArgument(unsigned idx);
|
||||||
}];
|
}];
|
||||||
|
|
||||||
|
let hasVerifier = 1;
|
||||||
|
let hasCustomAssemblyFormat = 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
def PimCoreBatchOp : PimOp<"core_batch", [SingleBlock, IsolatedFromAbove, AttrSizedOperandSegments]> {
|
def PimCoreBatchOp : PimOp<"core_batch", [SingleBlock, AttrSizedOperandSegments,
|
||||||
|
DeclareOpInterfaceMethods<OpAsmOpInterface, ["getAsmBlockArgumentNames"]>]> {
|
||||||
let summary = "Execute equivalent batched core bodies";
|
let summary = "Execute equivalent batched core bodies";
|
||||||
|
|
||||||
let regions = (region SizedRegion<1>:$body);
|
let regions = (region SizedRegion<1>:$body);
|
||||||
@@ -50,6 +56,13 @@ def PimCoreBatchOp : PimOp<"core_batch", [SingleBlock, IsolatedFromAbove, AttrSi
|
|||||||
Variadic<PimTensor>:$inputs
|
Variadic<PimTensor>:$inputs
|
||||||
);
|
);
|
||||||
|
|
||||||
|
let extraClassDeclaration = [{
|
||||||
|
::mlir::BlockArgument getLaneArgument();
|
||||||
|
::mlir::BlockArgument getWeightArgument(unsigned idx);
|
||||||
|
::mlir::BlockArgument getInputArgument(unsigned idx);
|
||||||
|
}];
|
||||||
|
|
||||||
|
let hasVerifier = 1;
|
||||||
let hasCustomAssemblyFormat = 1;
|
let hasCustomAssemblyFormat = 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -61,16 +74,6 @@ def PimHaltOp : PimOp<"halt", [Terminator]> {
|
|||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
def PimYieldOp : PimOp<"yield", [Terminator]> {
|
|
||||||
let summary = "Yield results from a Pim region";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
Variadic<PimTensor>:$outputs
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
// Communication
|
// Communication
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
@@ -81,57 +84,21 @@ def PimSendOp : PimOp<"send", []> {
|
|||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
PimTensor:$input,
|
PimTensor:$input,
|
||||||
I32Attr:$size,
|
I32Attr:$size,
|
||||||
I32Attr:$targetCoreId
|
Index:$targetCoreId
|
||||||
);
|
);
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
`(` $input `)` attr-dict `:` type($input) `->` `(` `)`
|
`(` $input `,` $targetCoreId `)` attr-dict `:` type($input) `->` `(` `)`
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
def PimSendTensorOp : PimOp<"send_tensor", []> {
|
|
||||||
let summary = "Send equal contiguous chunks of one tensor to target cores";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
PimTensor:$input,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def PimSendBatchOp : PimOp<"send_batch", []> {
|
|
||||||
let summary = "Send a per-lane tensor to target cores from a batched core";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
PimTensor:$input,
|
|
||||||
I32Attr:$size,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def PimSendTensorBatchOp : PimOp<"send_tensor_batch", []> {
|
|
||||||
let summary = "Send equal contiguous chunks of one per-lane tensor from a batched core";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
PimTensor:$input,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def PimReceiveOp : PimOp<"receive", [DestinationStyleOpInterface]> {
|
def PimReceiveOp : PimOp<"receive", [DestinationStyleOpInterface]> {
|
||||||
let summary = "Receive a tensor from another core";
|
let summary = "Receive a tensor from another core";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
PimTensor:$outputBuffer,
|
PimTensor:$outputBuffer,
|
||||||
I32Attr:$size,
|
I32Attr:$size,
|
||||||
I32Attr:$sourceCoreId
|
Index:$sourceCoreId
|
||||||
);
|
);
|
||||||
|
|
||||||
let results = (outs
|
let results = (outs
|
||||||
@@ -145,84 +112,18 @@ def PimReceiveOp : PimOp<"receive", [DestinationStyleOpInterface]> {
|
|||||||
}];
|
}];
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
`(` $outputBuffer `)` attr-dict `:` type($outputBuffer) `->` type($output)
|
`(` $outputBuffer `,` $sourceCoreId `)` attr-dict `:` type($outputBuffer) `->` type($output)
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
def PimReceiveTensorOp : PimOp<"receive_tensor", [DestinationStyleOpInterface]> {
|
|
||||||
let summary = "Receive equal contiguous chunks from source cores into one tensor";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
PimTensor:$outputBuffer,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
PimTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let extraClassDeclaration = [{
|
|
||||||
mlir::MutableOperandRange getDpsInitsMutable() {
|
|
||||||
return getOutputBufferMutable();
|
|
||||||
}
|
|
||||||
}];
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def PimReceiveBatchOp : PimOp<"receive_batch", [DestinationStyleOpInterface]> {
|
|
||||||
let summary = "Receive per-lane tensors from source cores into a batched core";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
PimTensor:$outputBuffer,
|
|
||||||
I32Attr:$size,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
PimTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let extraClassDeclaration = [{
|
|
||||||
mlir::MutableOperandRange getDpsInitsMutable() {
|
|
||||||
return getOutputBufferMutable();
|
|
||||||
}
|
|
||||||
}];
|
|
||||||
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def PimReceiveTensorBatchOp : PimOp<"receive_tensor_batch", [DestinationStyleOpInterface]> {
|
|
||||||
let summary = "Receive equal contiguous chunks into one per-lane tensor inside a batched core";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
PimTensor:$outputBuffer,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
PimTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let extraClassDeclaration = [{
|
|
||||||
mlir::MutableOperandRange getDpsInitsMutable() {
|
|
||||||
return getOutputBufferMutable();
|
|
||||||
}
|
|
||||||
}];
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def PimMemCopyHostToDevOp : PimOp<"memcp_hd", [DestinationStyleOpInterface]> {
|
def PimMemCopyHostToDevOp : PimOp<"memcp_hd", [DestinationStyleOpInterface]> {
|
||||||
let summary = "Copy a memory region from host memory into device memory";
|
let summary = "Copy a memory region from host memory into device memory";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
|
Index:$deviceTargetOffset,
|
||||||
|
Index:$hostSourceOffset,
|
||||||
PimTensor:$deviceTarget,
|
PimTensor:$deviceTarget,
|
||||||
PimTensor:$hostSource,
|
PimTensor:$hostSource,
|
||||||
I32Attr:$deviceTargetOffset,
|
|
||||||
I32Attr:$hostSourceOffset,
|
|
||||||
I32Attr:$size
|
I32Attr:$size
|
||||||
);
|
);
|
||||||
|
|
||||||
@@ -237,7 +138,9 @@ def PimMemCopyHostToDevOp : PimOp<"memcp_hd", [DestinationStyleOpInterface]> {
|
|||||||
}];
|
}];
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
`(` $deviceTarget `,` $hostSource `)` attr-dict `:` `(` type($deviceTarget) `,` type($hostSource) `)` `->` type($output)
|
`[` $deviceTargetOffset `,` $hostSourceOffset `]`
|
||||||
|
`(` $deviceTarget `,` $hostSource `)` attr-dict
|
||||||
|
`:` type($deviceTarget) `,` type($hostSource) `->` type($output)
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -271,10 +174,10 @@ def PimMemCopyDevToHostOp : PimOp<"memcp_dh", [DestinationStyleOpInterface]> {
|
|||||||
let summary = "Copy a memory region from device memory into host memory";
|
let summary = "Copy a memory region from device memory into host memory";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
|
Index:$hostTargetOffset,
|
||||||
|
Index:$deviceSourceOffset,
|
||||||
PimTensor:$hostTarget,
|
PimTensor:$hostTarget,
|
||||||
PimTensor:$deviceSource,
|
PimTensor:$deviceSource,
|
||||||
I32Attr:$hostTargetOffset,
|
|
||||||
I32Attr:$deviceSourceOffset,
|
|
||||||
I32Attr:$size
|
I32Attr:$size
|
||||||
);
|
);
|
||||||
|
|
||||||
@@ -289,7 +192,9 @@ def PimMemCopyDevToHostOp : PimOp<"memcp_dh", [DestinationStyleOpInterface]> {
|
|||||||
}];
|
}];
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
`(` $hostTarget `,` $deviceSource `)` attr-dict `:` `(` type($hostTarget) `,` type($deviceSource) `)` `->` type($output)
|
`[` $hostTargetOffset `,` $deviceSourceOffset `]`
|
||||||
|
`(` $hostTarget `,` $deviceSource `)` attr-dict
|
||||||
|
`:` type($hostTarget) `,` type($deviceSource) `->` type($output)
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -374,7 +279,7 @@ def PimVMMOp : PimOp<"vmm", [DestinationStyleOpInterface]> {
|
|||||||
let summary = "Vector-matrix multiplication: c = a * b";
|
let summary = "Vector-matrix multiplication: c = a * b";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
I32Attr:$weightIndex,
|
PimTensor:$weight,
|
||||||
PimTensor:$input,
|
PimTensor:$input,
|
||||||
PimTensor:$outputBuffer
|
PimTensor:$outputBuffer
|
||||||
);
|
);
|
||||||
@@ -391,7 +296,8 @@ def PimVMMOp : PimOp<"vmm", [DestinationStyleOpInterface]> {
|
|||||||
|
|
||||||
let hasVerifier = 1;
|
let hasVerifier = 1;
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
`(` $input `,` $outputBuffer `)` attr-dict `:` `(` type($input) `,` type($outputBuffer) `)` `->` type($output)
|
`[` $weight `]` `(` $input `,` $outputBuffer `)` attr-dict `:` `(` type($weight) `,` type($input) `,`
|
||||||
|
type($outputBuffer) `)` `->` type($output)
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|||||||
@@ -1,8 +1,41 @@
|
|||||||
|
#include <string>
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
|
||||||
|
using namespace mlir;
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
namespace pim {
|
namespace pim {
|
||||||
|
|
||||||
|
BlockArgument PimCoreOp::getWeightArgument(unsigned idx) { return getBody().front().getArgument(idx); }
|
||||||
|
|
||||||
|
void PimCoreOp::getAsmBlockArgumentNames(Region& region, OpAsmSetValueNameFn setNameFn) {
|
||||||
|
if (region.empty())
|
||||||
|
return;
|
||||||
|
|
||||||
|
for (unsigned index = 0; index < getWeights().size(); ++index)
|
||||||
|
setNameFn(getWeightArgument(index), ("w" + std::to_string(index)).c_str());
|
||||||
|
}
|
||||||
|
|
||||||
|
BlockArgument PimCoreBatchOp::getLaneArgument() { return getBody().front().getArgument(0); }
|
||||||
|
|
||||||
|
BlockArgument PimCoreBatchOp::getWeightArgument(unsigned idx) { return getBody().front().getArgument(1 + idx); }
|
||||||
|
|
||||||
|
BlockArgument PimCoreBatchOp::getInputArgument(unsigned idx) {
|
||||||
|
return getBody().front().getArgument(1 + getWeights().size() + idx);
|
||||||
|
}
|
||||||
|
|
||||||
|
void PimCoreBatchOp::getAsmBlockArgumentNames(Region& region, OpAsmSetValueNameFn setNameFn) {
|
||||||
|
if (region.empty())
|
||||||
|
return;
|
||||||
|
|
||||||
|
setNameFn(getLaneArgument(), "lane");
|
||||||
|
for (unsigned index = 0; index < getWeights().size(); ++index)
|
||||||
|
setNameFn(getWeightArgument(index), ("w" + std::to_string(index)).c_str());
|
||||||
|
for (unsigned index = 0; index < getInputs().size(); ++index)
|
||||||
|
setNameFn(getInputArgument(index), ("in" + std::to_string(index)).c_str());
|
||||||
|
}
|
||||||
|
|
||||||
void PimDialect::initialize() {
|
void PimDialect::initialize() {
|
||||||
addOperations<
|
addOperations<
|
||||||
#define GET_OP_LIST
|
#define GET_OP_LIST
|
||||||
|
|||||||
+150
-262
@@ -20,28 +20,128 @@ static DenseI32ArrayAttr getDenseI32ArrayAttr(OpAsmParser& parser, ArrayRef<int3
|
|||||||
return parser.getBuilder().getDenseI32ArrayAttr(values);
|
return parser.getBuilder().getDenseI32ArrayAttr(values);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
static IntegerAttr getI32Attr(OpAsmParser& parser, int32_t value) {
|
||||||
|
return parser.getBuilder().getI32IntegerAttr(value);
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool parseOptionalKeywordAlias(OpAsmParser& parser, StringRef preferred, StringRef legacy) {
|
||||||
|
return succeeded(parser.parseOptionalKeyword(preferred)) || succeeded(parser.parseOptionalKeyword(legacy));
|
||||||
|
}
|
||||||
|
|
||||||
|
static void
|
||||||
|
printBoundValueList(OpAsmPrinter& printer, ValueRange arguments, ValueRange operands, ListDelimiter delimiter) {
|
||||||
|
printCompressedValueList(printer, arguments, delimiter);
|
||||||
|
printer << " = ";
|
||||||
|
printCompressedValueList(printer, operands, delimiter);
|
||||||
|
}
|
||||||
|
|
||||||
|
static ParseResult parseBoundValueList(OpAsmParser& parser,
|
||||||
|
ListDelimiter delimiter,
|
||||||
|
SmallVectorImpl<OpAsmParser::Argument>& arguments,
|
||||||
|
SmallVectorImpl<OpAsmParser::UnresolvedOperand>& operands) {
|
||||||
|
if (parseOpenDelimiter(parser, delimiter))
|
||||||
|
return failure();
|
||||||
|
if (succeeded(parseOptionalCloseDelimiter(parser, delimiter))) {
|
||||||
|
if (parser.parseEqual() || parseCompressedOperandList(parser, delimiter, operands))
|
||||||
|
return failure();
|
||||||
|
return success();
|
||||||
|
}
|
||||||
|
|
||||||
|
if (parseOneCompressedArgumentEntry(parser, arguments))
|
||||||
|
return failure();
|
||||||
|
while (succeeded(parser.parseOptionalComma()))
|
||||||
|
if (parseOneCompressedArgumentEntry(parser, arguments))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
auto parseCloseDelimiter = [&](ListDelimiter currentDelimiter) -> ParseResult {
|
||||||
|
switch (currentDelimiter) {
|
||||||
|
case ListDelimiter::Paren: return parser.parseRParen();
|
||||||
|
case ListDelimiter::Square: return parser.parseRSquare();
|
||||||
|
}
|
||||||
|
llvm_unreachable("unsupported delimiter");
|
||||||
|
};
|
||||||
|
if (parseCloseDelimiter(delimiter) || parser.parseEqual() || parseCompressedOperandList(parser, delimiter, operands))
|
||||||
|
return failure();
|
||||||
|
return success();
|
||||||
|
}
|
||||||
|
|
||||||
static void printCoreIdList(OpAsmPrinter& printer, StringRef keyword, ArrayRef<int32_t> coreIds) {
|
static void printCoreIdList(OpAsmPrinter& printer, StringRef keyword, ArrayRef<int32_t> coreIds) {
|
||||||
printer << " " << keyword << " ";
|
printer << " " << keyword << " ";
|
||||||
printCompressedIntegerList(printer, coreIds);
|
printCompressedIntegerList(printer, coreIds);
|
||||||
}
|
}
|
||||||
|
|
||||||
static ParseResult parseOptionalCoreIdList(OpAsmParser& parser, StringRef keyword, SmallVectorImpl<int32_t>& coreIds) {
|
|
||||||
if (failed(parser.parseOptionalKeyword(keyword)))
|
|
||||||
return success();
|
|
||||||
return parseCompressedIntegerList(parser, coreIds);
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
void PimCoreBatchOp::print(OpAsmPrinter& printer) {
|
void PimCoreOp::print(OpAsmPrinter& printer) {
|
||||||
printer << " lanes " << getLaneCount() << " ";
|
SmallVector<Value> weightArgs;
|
||||||
size_t weightsPerLane = getLaneCount() > 0 ? getWeights().size() / static_cast<size_t>(getLaneCount()) : 0;
|
weightArgs.reserve(getWeights().size());
|
||||||
if (getLaneCount() > 1 && hasRepeatedTuple(getWeights(), weightsPerLane))
|
for (unsigned index = 0; index < getWeights().size(); ++index)
|
||||||
printValueTupleRun(printer, getWeights(), weightsPerLane, ListDelimiter::Paren);
|
weightArgs.push_back(getWeightArgument(index));
|
||||||
else
|
|
||||||
printCompressedValueList(printer, getWeights(), ListDelimiter::Paren);
|
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printCompressedValueList(printer, getInputs(), ListDelimiter::Square);
|
printBoundValueList(printer, weightArgs, getWeights(), ListDelimiter::Square);
|
||||||
|
printer << " coreId " << getCoreId();
|
||||||
|
printer.printOptionalAttrDict((*this)->getAttrs(), {getCoreIdAttrName().getValue()});
|
||||||
|
printer << " : ";
|
||||||
|
printCompressedTypeList(printer, TypeRange(getWeights()), ListDelimiter::Square);
|
||||||
|
printer << " -> () ";
|
||||||
|
printer.printRegion(getBody(), /*printEntryBlockArgs=*/false);
|
||||||
|
}
|
||||||
|
|
||||||
|
ParseResult PimCoreOp::parse(OpAsmParser& parser, OperationState& result) {
|
||||||
|
SmallVector<OpAsmParser::Argument> weightArgs;
|
||||||
|
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
||||||
|
SmallVector<Type> weightTypes;
|
||||||
|
int32_t coreId = 0;
|
||||||
|
|
||||||
|
if (parseBoundValueList(parser, ListDelimiter::Square, weightArgs, weights))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
bool hasCoreId = parseOptionalKeywordAlias(parser, "coreId", "core_id");
|
||||||
|
if (hasCoreId && parser.parseInteger(coreId))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
||||||
|
|| parseCompressedRepeatedList(
|
||||||
|
parser, ListDelimiter::Square, weightTypes, [&](Type& type) { return parser.parseType(type); })
|
||||||
|
|| parser.parseArrow() || parser.parseLParen() || parser.parseRParen())
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
if (weights.size() != weightTypes.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
||||||
|
if (weightArgs.size() != weights.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "number of weight bindings and weight operands must match");
|
||||||
|
if (hasCoreId && result.attributes.get("coreId"))
|
||||||
|
return parser.emitError(parser.getCurrentLocation(),
|
||||||
|
"coreId cannot be specified both positionally and in attr-dict");
|
||||||
|
|
||||||
|
if (parser.resolveOperands(weights, weightTypes, parser.getCurrentLocation(), result.operands))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
if (hasCoreId)
|
||||||
|
result.addAttribute("coreId", getI32Attr(parser, coreId));
|
||||||
|
|
||||||
|
Region* body = result.addRegion();
|
||||||
|
applyArgumentTypes(weightTypes, weightArgs);
|
||||||
|
return parser.parseRegion(*body, weightArgs);
|
||||||
|
}
|
||||||
|
|
||||||
|
void PimCoreBatchOp::print(OpAsmPrinter& printer) {
|
||||||
|
printer << " ";
|
||||||
|
printer.printOperand(getLaneArgument());
|
||||||
|
printer << " = 0 to " << getLaneCount() << " ";
|
||||||
|
|
||||||
|
SmallVector<Value> weightArgs;
|
||||||
|
weightArgs.reserve(getWeights().size());
|
||||||
|
for (unsigned index = 0; index < getWeights().size(); ++index)
|
||||||
|
weightArgs.push_back(getWeightArgument(index));
|
||||||
|
printBoundValueList(printer, weightArgs, getWeights(), ListDelimiter::Square);
|
||||||
|
printer << " ";
|
||||||
|
SmallVector<Value> inputArgs;
|
||||||
|
inputArgs.reserve(getInputs().size());
|
||||||
|
for (unsigned index = 0; index < getInputs().size(); ++index)
|
||||||
|
inputArgs.push_back(getInputArgument(index));
|
||||||
|
printBoundValueList(printer, inputArgs, getInputs(), ListDelimiter::Paren);
|
||||||
|
|
||||||
if (auto coreIdsAttr = (*this)->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName))
|
if (auto coreIdsAttr = (*this)->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName))
|
||||||
printCoreIdList(printer, "coreIds", coreIdsAttr.asArrayRef());
|
printCoreIdList(printer, "coreIds", coreIdsAttr.asArrayRef());
|
||||||
@@ -49,51 +149,57 @@ void PimCoreBatchOp::print(OpAsmPrinter& printer) {
|
|||||||
printer.printOptionalAttrDict(
|
printer.printOptionalAttrDict(
|
||||||
(*this)->getAttrs(),
|
(*this)->getAttrs(),
|
||||||
{getLaneCountAttrName().getValue(), getOperandSegmentSizesAttrName().getValue(), onnx_mlir::kCoreIdsAttrName});
|
{getLaneCountAttrName().getValue(), getOperandSegmentSizesAttrName().getValue(), onnx_mlir::kCoreIdsAttrName});
|
||||||
printer << " ";
|
|
||||||
printer.printRegion(getBody(), /*printEntryBlockArgs=*/false);
|
|
||||||
printer << " : ";
|
printer << " : ";
|
||||||
if (getLaneCount() > 1 && hasRepeatedTuple(TypeRange(getWeights()), weightsPerLane))
|
printCompressedTypeList(printer, TypeRange(getWeights()), ListDelimiter::Square);
|
||||||
printTypeTupleRun(printer, TypeRange(getWeights()), weightsPerLane, ListDelimiter::Paren);
|
|
||||||
else
|
|
||||||
printCompressedTypeList(printer, TypeRange(getWeights()), ListDelimiter::Paren);
|
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printCompressedTypeList(printer, TypeRange(getInputs()), ListDelimiter::Square);
|
printCompressedTypeList(printer, TypeRange(getInputs()), ListDelimiter::Paren);
|
||||||
printer << " -> ()";
|
printer << " -> () ";
|
||||||
|
printer.printRegion(getBody(), /*printEntryBlockArgs=*/false);
|
||||||
}
|
}
|
||||||
|
|
||||||
ParseResult PimCoreBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
ParseResult PimCoreBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
||||||
|
int64_t lowerBound = 0;
|
||||||
int32_t laneCount = 0;
|
int32_t laneCount = 0;
|
||||||
|
OpAsmParser::Argument laneArg;
|
||||||
|
SmallVector<OpAsmParser::Argument> weightArgs;
|
||||||
|
SmallVector<OpAsmParser::Argument> inputArgs;
|
||||||
|
SmallVector<OpAsmParser::Argument> regionArgs;
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> inputs;
|
SmallVector<OpAsmParser::UnresolvedOperand> inputs;
|
||||||
SmallVector<Type> weightTypes;
|
SmallVector<Type> weightTypes;
|
||||||
SmallVector<Type> inputTypes;
|
SmallVector<Type> inputTypes;
|
||||||
SmallVector<int32_t> coreIds;
|
SmallVector<int32_t> coreIds;
|
||||||
|
|
||||||
if (parser.parseKeyword("lanes") || parser.parseInteger(laneCount)
|
if (parser.parseArgument(laneArg) || parser.parseEqual() || parser.parseInteger(lowerBound)
|
||||||
|| parseCompressedOrTupleOperandList(parser, ListDelimiter::Paren, weights)
|
|| parser.parseKeyword("to") || parser.parseInteger(laneCount))
|
||||||
|| parseCompressedOperandList(parser, ListDelimiter::Square, inputs))
|
return failure();
|
||||||
|
if (lowerBound != 0)
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "core_batch currently requires a zero lower bound");
|
||||||
|
|
||||||
|
if (parseBoundValueList(parser, ListDelimiter::Square, weightArgs, weights)
|
||||||
|
|| parseBoundValueList(parser, ListDelimiter::Paren, inputArgs, inputs))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
bool hasCoreIds = succeeded(parser.parseOptionalKeyword("coreIds"));
|
bool hasCoreIds = parseOptionalKeywordAlias(parser, "coreIds", "core_ids");
|
||||||
if (hasCoreIds && parseCompressedIntegerList(parser, coreIds))
|
if (hasCoreIds && parseCompressedIntegerList(parser, coreIds))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes))
|
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
||||||
return failure();
|
|| parseCompressedRepeatedList(
|
||||||
|
parser, ListDelimiter::Square, weightTypes, [&](Type& type) { return parser.parseType(type); })
|
||||||
Region* body = result.addRegion();
|
|| parseCompressedRepeatedList(
|
||||||
if (parser.parseRegion(*body))
|
parser, ListDelimiter::Paren, inputTypes, [&](Type& type) { return parser.parseType(type); })
|
||||||
return failure();
|
|| parser.parseArrow() || parser.parseLParen() || parser.parseRParen())
|
||||||
|
|
||||||
if (parser.parseColon() || parseCompressedOrTupleTypeList(parser, ListDelimiter::Paren, weightTypes)
|
|
||||||
|| parseCompressedTypeList(parser, ListDelimiter::Square, inputTypes) || parser.parseArrow()
|
|
||||||
|| parser.parseLParen() || parser.parseRParen())
|
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
if (weights.size() != weightTypes.size())
|
if (weights.size() != weightTypes.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
||||||
|
if (weightArgs.size() != weights.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "number of weight bindings and weight operands must match");
|
||||||
if (inputs.size() != inputTypes.size())
|
if (inputs.size() != inputTypes.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of inputs and input types must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of inputs and input types must match");
|
||||||
|
if (inputArgs.size() != inputs.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "number of input bindings and input operands must match");
|
||||||
if (hasCoreIds && result.attributes.get(onnx_mlir::kCoreIdsAttrName))
|
if (hasCoreIds && result.attributes.get(onnx_mlir::kCoreIdsAttrName))
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
return parser.emitError(parser.getCurrentLocation(),
|
||||||
"coreIds cannot be specified both positionally and in attr-dict");
|
"coreIds cannot be specified both positionally and in attr-dict");
|
||||||
@@ -110,233 +216,15 @@ ParseResult PimCoreBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|||||||
|| parser.resolveOperands(inputs, inputTypes, parser.getCurrentLocation(), result.operands)) {
|
|| parser.resolveOperands(inputs, inputTypes, parser.getCurrentLocation(), result.operands)) {
|
||||||
return failure();
|
return failure();
|
||||||
}
|
}
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimYieldOp::print(OpAsmPrinter& printer) {
|
Region* body = result.addRegion();
|
||||||
printer << " ";
|
laneArg.type = builder.getIndexType();
|
||||||
printCompressedValueSequence(printer, getOutputs());
|
regionArgs.push_back(laneArg);
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs());
|
applyArgumentTypes(weightTypes, weightArgs);
|
||||||
printer << " : ";
|
llvm::append_range(regionArgs, weightArgs);
|
||||||
printCompressedTypeSequence(printer, getOutputs().getTypes());
|
applyArgumentTypes(inputTypes, inputArgs);
|
||||||
}
|
llvm::append_range(regionArgs, inputArgs);
|
||||||
|
return parser.parseRegion(*body, regionArgs);
|
||||||
ParseResult PimYieldOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> outputs;
|
|
||||||
SmallVector<Type> outputTypes;
|
|
||||||
|
|
||||||
OpAsmParser::UnresolvedOperand firstOutput;
|
|
||||||
OptionalParseResult firstOutputResult = parser.parseOptionalOperand(firstOutput);
|
|
||||||
if (firstOutputResult.has_value()) {
|
|
||||||
if (failed(*firstOutputResult))
|
|
||||||
return failure();
|
|
||||||
if (parseCompressedOperandEntryWithFirst(parser, firstOutput, outputs))
|
|
||||||
return failure();
|
|
||||||
while (succeeded(parser.parseOptionalComma()))
|
|
||||||
if (parseOneCompressedOperandEntry(parser, outputs))
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
|
||||||
|| parseCompressedTypeSequence(parser, outputTypes, /*allowEmpty=*/true))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (outputs.size() != outputTypes.size())
|
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of outputs and output types must match");
|
|
||||||
|
|
||||||
return parser.resolveOperands(outputs, outputTypes, parser.getCurrentLocation(), result.operands);
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimSendBatchOp::print(OpAsmPrinter& printer) {
|
|
||||||
printer << " ";
|
|
||||||
printer.printOperand(getInput());
|
|
||||||
printCoreIdList(printer, "to", getTargetCoreIds());
|
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs(), {getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getInput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult PimSendBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand input;
|
|
||||||
Type inputType;
|
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
|
|
||||||
if (parser.parseOperand(input) || parseOptionalCoreIdList(parser, "to", targetCoreIds)
|
|
||||||
|| parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(inputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!targetCoreIds.empty() && result.attributes.get("targetCoreIds"))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"targetCoreIds cannot be specified both positionally and in attr-dict");
|
|
||||||
if (!targetCoreIds.empty())
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
|
|
||||||
return parser.resolveOperand(input, inputType, result.operands);
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimSendTensorBatchOp::print(OpAsmPrinter& printer) {
|
|
||||||
printer << " ";
|
|
||||||
printer.printOperand(getInput());
|
|
||||||
printCoreIdList(printer, "to", getTargetCoreIds());
|
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs(), {getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getInput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult PimSendTensorBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand input;
|
|
||||||
Type inputType;
|
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
|
|
||||||
if (parser.parseOperand(input) || parseOptionalCoreIdList(parser, "to", targetCoreIds)
|
|
||||||
|| parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(inputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!targetCoreIds.empty() && result.attributes.get("targetCoreIds"))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"targetCoreIds cannot be specified both positionally and in attr-dict");
|
|
||||||
if (!targetCoreIds.empty())
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
|
|
||||||
return parser.resolveOperand(input, inputType, result.operands);
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimSendTensorOp::print(OpAsmPrinter& printer) {
|
|
||||||
printer << " ";
|
|
||||||
printer.printOperand(getInput());
|
|
||||||
printCoreIdList(printer, "to", getTargetCoreIds());
|
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs(), {getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getInput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult PimSendTensorOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand input;
|
|
||||||
Type inputType;
|
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
|
|
||||||
if (parser.parseOperand(input) || parseOptionalCoreIdList(parser, "to", targetCoreIds)
|
|
||||||
|| parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(inputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!targetCoreIds.empty() && result.attributes.get("targetCoreIds"))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"targetCoreIds cannot be specified both positionally and in attr-dict");
|
|
||||||
if (!targetCoreIds.empty())
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
|
|
||||||
return parser.resolveOperand(input, inputType, result.operands);
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimReceiveTensorOp::print(OpAsmPrinter& printer) {
|
|
||||||
printCoreIdList(printer, "from", getSourceCoreIds());
|
|
||||||
printer << " into ";
|
|
||||||
printOpenDelimiter(printer, ListDelimiter::Paren);
|
|
||||||
printer.printOperand(getOutputBuffer());
|
|
||||||
printCloseDelimiter(printer, ListDelimiter::Paren);
|
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs(), {getSourceCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getOutputBuffer().getType());
|
|
||||||
printer << " -> ";
|
|
||||||
printer.printType(getOutput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult PimReceiveTensorOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand outputBuffer;
|
|
||||||
Type outputBufferType;
|
|
||||||
Type outputType;
|
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
|
|
||||||
if (parseOptionalCoreIdList(parser, "from", sourceCoreIds) || parser.parseKeyword("into") || parser.parseLParen()
|
|
||||||
|| parser.parseOperand(outputBuffer) || parser.parseRParen() || parser.parseOptionalAttrDict(result.attributes)
|
|
||||||
|| parser.parseColon() || parser.parseType(outputBufferType) || parser.parseArrow()
|
|
||||||
|| parser.parseType(outputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!sourceCoreIds.empty() && result.attributes.get("sourceCoreIds"))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"sourceCoreIds cannot be specified both positionally and in attr-dict");
|
|
||||||
if (!sourceCoreIds.empty())
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
|
|
||||||
if (parser.resolveOperand(outputBuffer, outputBufferType, result.operands))
|
|
||||||
return failure();
|
|
||||||
result.addTypes(outputType);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimReceiveBatchOp::print(OpAsmPrinter& printer) {
|
|
||||||
printCoreIdList(printer, "from", getSourceCoreIds());
|
|
||||||
printer << " into ";
|
|
||||||
printOpenDelimiter(printer, ListDelimiter::Paren);
|
|
||||||
printer.printOperand(getOutputBuffer());
|
|
||||||
printCloseDelimiter(printer, ListDelimiter::Paren);
|
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs(), {getSourceCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getOutputBuffer().getType());
|
|
||||||
printer << " -> ";
|
|
||||||
printer.printType(getOutput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult PimReceiveBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand outputBuffer;
|
|
||||||
Type outputBufferType;
|
|
||||||
Type outputType;
|
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
|
|
||||||
if (parseOptionalCoreIdList(parser, "from", sourceCoreIds) || parser.parseKeyword("into") || parser.parseLParen()
|
|
||||||
|| parser.parseOperand(outputBuffer) || parser.parseRParen() || parser.parseOptionalAttrDict(result.attributes)
|
|
||||||
|| parser.parseColon() || parser.parseType(outputBufferType) || parser.parseArrow()
|
|
||||||
|| parser.parseType(outputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!sourceCoreIds.empty() && result.attributes.get("sourceCoreIds"))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"sourceCoreIds cannot be specified both positionally and in attr-dict");
|
|
||||||
if (!sourceCoreIds.empty())
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
|
|
||||||
if (parser.resolveOperand(outputBuffer, outputBufferType, result.operands))
|
|
||||||
return failure();
|
|
||||||
result.addTypes(outputType);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
void PimReceiveTensorBatchOp::print(OpAsmPrinter& printer) {
|
|
||||||
printCoreIdList(printer, "from", getSourceCoreIds());
|
|
||||||
printer << " into ";
|
|
||||||
printOpenDelimiter(printer, ListDelimiter::Paren);
|
|
||||||
printer.printOperand(getOutputBuffer());
|
|
||||||
printCloseDelimiter(printer, ListDelimiter::Paren);
|
|
||||||
printer.printOptionalAttrDict((*this)->getAttrs(), {getSourceCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getOutputBuffer().getType());
|
|
||||||
printer << " -> ";
|
|
||||||
printer.printType(getOutput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult PimReceiveTensorBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand outputBuffer;
|
|
||||||
Type outputBufferType;
|
|
||||||
Type outputType;
|
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
|
|
||||||
if (parseOptionalCoreIdList(parser, "from", sourceCoreIds) || parser.parseKeyword("into") || parser.parseLParen()
|
|
||||||
|| parser.parseOperand(outputBuffer) || parser.parseRParen() || parser.parseOptionalAttrDict(result.attributes)
|
|
||||||
|| parser.parseColon() || parser.parseType(outputBufferType) || parser.parseArrow()
|
|
||||||
|| parser.parseType(outputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (!sourceCoreIds.empty() && result.attributes.get("sourceCoreIds"))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"sourceCoreIds cannot be specified both positionally and in attr-dict");
|
|
||||||
if (!sourceCoreIds.empty())
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
|
|
||||||
if (parser.resolveOperand(outputBuffer, outputBufferType, result.operands))
|
|
||||||
return failure();
|
|
||||||
result.addTypes(outputType);
|
|
||||||
return success();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
void PimConcatOp::print(OpAsmPrinter& printer) {
|
void PimConcatOp::print(OpAsmPrinter& printer) {
|
||||||
|
|||||||
@@ -1,9 +1,14 @@
|
|||||||
|
#include "mlir/Dialect/MemRef/IR/MemRef.h"
|
||||||
|
#include "mlir/IR/Block.h"
|
||||||
|
#include "mlir/IR/BuiltinOps.h"
|
||||||
#include "mlir/IR/BuiltinTypeInterfaces.h"
|
#include "mlir/IR/BuiltinTypeInterfaces.h"
|
||||||
#include "mlir/IR/Diagnostics.h"
|
#include "mlir/IR/Diagnostics.h"
|
||||||
|
#include "mlir/IR/OpDefinition.h"
|
||||||
#include "mlir/IR/TypeUtilities.h"
|
#include "mlir/IR/TypeUtilities.h"
|
||||||
|
|
||||||
#include "llvm/Support/LogicalResult.h"
|
#include "llvm/Support/LogicalResult.h"
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Common/IR/AddressAnalysis.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
|
|
||||||
@@ -14,6 +19,63 @@ namespace pim {
|
|||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
|
static bool isExplicitHostOperand(Operation* op, unsigned operandIndex) {
|
||||||
|
if (isa<PimMemCopyHostToDevOp>(op))
|
||||||
|
return operandIndex == 3;
|
||||||
|
if (isa<PimMemCopyHostToDevBatchOp>(op))
|
||||||
|
return operandIndex == 1;
|
||||||
|
if (isa<PimMemCopyDevToHostOp>(op))
|
||||||
|
return operandIndex == 2;
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
|
||||||
|
static Region* getParentRegion(Value value) {
|
||||||
|
if (auto blockArgument = dyn_cast<BlockArgument>(value))
|
||||||
|
return blockArgument.getParentRegion();
|
||||||
|
Operation* definingOp = value.getDefiningOp();
|
||||||
|
return definingOp ? definingOp->getParentRegion() : nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isDefinedInsideRegion(Value value, Region& region) {
|
||||||
|
Region* parentRegion = getParentRegion(value);
|
||||||
|
return parentRegion && (®ion == parentRegion || region.isAncestor(parentRegion));
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isConstantExternalValue(Value value) {
|
||||||
|
Operation* definingOp = value.getDefiningOp();
|
||||||
|
if (!definingOp)
|
||||||
|
return false;
|
||||||
|
if (definingOp->hasTrait<OpTrait::ConstantLike>())
|
||||||
|
return true;
|
||||||
|
|
||||||
|
auto getGlobalOp = dyn_cast<memref::GetGlobalOp>(definingOp);
|
||||||
|
if (!getGlobalOp)
|
||||||
|
return false;
|
||||||
|
|
||||||
|
auto moduleOp = definingOp->getParentOfType<ModuleOp>();
|
||||||
|
auto globalOp = lookupGlobalForGetGlobal(moduleOp, getGlobalOp);
|
||||||
|
return globalOp && globalOp.getConstant();
|
||||||
|
}
|
||||||
|
|
||||||
|
static LogicalResult verifyOnlyConstantExternalValues(Operation* ownerOp, Region& region, StringRef kind) {
|
||||||
|
bool hasFailure = false;
|
||||||
|
region.walk([&](Operation* op) {
|
||||||
|
for (OpOperand& operand : op->getOpOperands()) {
|
||||||
|
Value value = operand.get();
|
||||||
|
if (isDefinedInsideRegion(value, region) || isConstantExternalValue(value)
|
||||||
|
|| isExplicitHostOperand(op, operand.getOperandNumber()))
|
||||||
|
continue;
|
||||||
|
|
||||||
|
InFlightDiagnostic diagnostic = ownerOp->emitOpError()
|
||||||
|
<< kind << " body may only directly reference external constants";
|
||||||
|
diagnostic.attachNote(op->getLoc())
|
||||||
|
<< "non-constant external operand #" << operand.getOperandNumber() << " is used by " << op->getName();
|
||||||
|
hasFailure = true;
|
||||||
|
}
|
||||||
|
});
|
||||||
|
return success(!hasFailure);
|
||||||
|
}
|
||||||
|
|
||||||
static bool haveSameShapedContainerKind(Type lhs, Type rhs) {
|
static bool haveSameShapedContainerKind(Type lhs, Type rhs) {
|
||||||
return (isa<RankedTensorType>(lhs) && isa<RankedTensorType>(rhs)) || (isa<MemRefType>(lhs) && isa<MemRefType>(rhs));
|
return (isa<RankedTensorType>(lhs) && isa<RankedTensorType>(rhs)) || (isa<MemRefType>(lhs) && isa<MemRefType>(rhs));
|
||||||
}
|
}
|
||||||
@@ -28,97 +90,41 @@ static LogicalResult verifyCompatibleShapedTypes(Operation* op, Type lhs, Type r
|
|||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
static LogicalResult verifyTensorCommunication(Operation* op, Type type, ArrayRef<int32_t> coreIds, StringRef kind) {
|
static FailureOr<ArrayRef<int64_t>> getWeightShapeForVMM(Value weight) {
|
||||||
if (coreIds.empty())
|
auto shapedType = dyn_cast<ShapedType>(weight.getType());
|
||||||
return op->emitError() << kind << " must carry at least one chunk";
|
if (!shapedType)
|
||||||
|
return failure();
|
||||||
auto shapedType = dyn_cast<ShapedType>(type);
|
return shapedType.getShape();
|
||||||
if (!shapedType || !shapedType.hasStaticShape())
|
|
||||||
return op->emitError() << kind << " requires a static shaped tensor or memref";
|
|
||||||
|
|
||||||
int64_t elementBits = shapedType.getElementTypeBitWidth();
|
|
||||||
if (elementBits <= 0 || elementBits % 8 != 0)
|
|
||||||
return op->emitError() << kind << " requires byte-sized elements";
|
|
||||||
|
|
||||||
int64_t totalBytes = shapedType.getNumElements() * elementBits / 8;
|
|
||||||
if (totalBytes % static_cast<int64_t>(coreIds.size()) != 0)
|
|
||||||
return op->emitError() << kind << " tensor byte size must be divisible by the number of core ids";
|
|
||||||
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
static LogicalResult
|
|
||||||
verifyTensorBatchCommunication(Operation* op, Type type, ArrayRef<int32_t> coreIds, StringRef kind) {
|
|
||||||
if (coreIds.empty())
|
|
||||||
return op->emitError() << kind << " must carry at least one chunk";
|
|
||||||
|
|
||||||
auto coreBatchOp = op->getParentOfType<PimCoreBatchOp>();
|
|
||||||
if (!coreBatchOp)
|
|
||||||
return op->emitError() << kind << " must be nested inside pim.core_batch";
|
|
||||||
|
|
||||||
int32_t laneCount = coreBatchOp.getLaneCount();
|
|
||||||
if (laneCount <= 0)
|
|
||||||
return op->emitError() << kind << " requires a positive parent laneCount";
|
|
||||||
if (coreIds.size() % static_cast<size_t>(laneCount) != 0)
|
|
||||||
return op->emitError() << kind << " core id count must be divisible by the parent laneCount";
|
|
||||||
|
|
||||||
auto shapedType = dyn_cast<ShapedType>(type);
|
|
||||||
if (!shapedType || !shapedType.hasStaticShape())
|
|
||||||
return op->emitError() << kind << " requires a static shaped tensor or memref";
|
|
||||||
|
|
||||||
int64_t elementBits = shapedType.getElementTypeBitWidth();
|
|
||||||
if (elementBits <= 0 || elementBits % 8 != 0)
|
|
||||||
return op->emitError() << kind << " requires byte-sized elements";
|
|
||||||
|
|
||||||
int64_t chunkCount = static_cast<int64_t>(coreIds.size()) / laneCount;
|
|
||||||
int64_t totalBytes = shapedType.getNumElements() * elementBits / 8;
|
|
||||||
if (totalBytes % chunkCount != 0)
|
|
||||||
return op->emitError() << kind << " tensor byte size must be divisible by the chunk count per lane";
|
|
||||||
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
static FailureOr<ArrayRef<int64_t>> getWeightShapeForVMM(Operation* op, size_t weightIndex) {
|
|
||||||
if (auto coreOp = op->getParentOfType<PimCoreOp>()) {
|
|
||||||
if (weightIndex >= coreOp.getWeights().size())
|
|
||||||
return failure();
|
|
||||||
return cast<ShapedType>(coreOp.getWeights()[weightIndex].getType()).getShape();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (auto coreBatchOp = op->getParentOfType<PimCoreBatchOp>()) {
|
|
||||||
if (weightIndex >= coreBatchOp.getWeights().size())
|
|
||||||
return failure();
|
|
||||||
return cast<ShapedType>(coreBatchOp.getWeights()[weightIndex].getType()).getShape();
|
|
||||||
}
|
|
||||||
|
|
||||||
return failure();
|
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
LogicalResult PimSendTensorOp::verify() {
|
LogicalResult PimCoreOp::verify() {
|
||||||
return verifyTensorCommunication(getOperation(), getInput().getType(), getTargetCoreIds(), "send_tensor");
|
Block& block = getBody().front();
|
||||||
|
if (block.getNumArguments() != getWeights().size())
|
||||||
|
return emitError("core body must have one block argument per weight");
|
||||||
|
for (auto [weightIndex, weight] : llvm::enumerate(getWeights()))
|
||||||
|
if (getWeightArgument(weightIndex).getType() != weight.getType())
|
||||||
|
return emitError("core weight block argument types must match weight operand types exactly");
|
||||||
|
return verifyOnlyConstantExternalValues(getOperation(), getBody(), "pim.core");
|
||||||
}
|
}
|
||||||
|
|
||||||
LogicalResult PimSendTensorBatchOp::verify() {
|
LogicalResult PimCoreBatchOp::verify() {
|
||||||
return verifyTensorBatchCommunication(getOperation(), getInput().getType(), getTargetCoreIds(), "send_tensor_batch");
|
if (getLaneCount() <= 0)
|
||||||
}
|
return emitError("laneCount must be positive");
|
||||||
|
Block& block = getBody().front();
|
||||||
LogicalResult PimReceiveTensorOp::verify() {
|
unsigned expectedArgCount = 1 + getWeights().size() + getInputs().size();
|
||||||
if (failed(verifyCompatibleShapedTypes(
|
if (block.getNumArguments() != expectedArgCount)
|
||||||
getOperation(), getOutputBuffer().getType(), getOutput().getType(), "output buffer and output must match")))
|
return emitError("core_batch body must have lane, weight, and input block arguments");
|
||||||
return failure();
|
if (!getLaneArgument().getType().isIndex())
|
||||||
|
return emitError("core_batch first block argument must have index type");
|
||||||
return verifyTensorCommunication(getOperation(), getOutput().getType(), getSourceCoreIds(), "receive_tensor");
|
for (auto [weightIndex, weight] : llvm::enumerate(getWeights()))
|
||||||
}
|
if (getWeightArgument(weightIndex).getType() != weight.getType())
|
||||||
|
return emitError("core_batch weight block argument types must match weight operand types exactly");
|
||||||
LogicalResult PimReceiveTensorBatchOp::verify() {
|
for (auto [inputIndex, input] : llvm::enumerate(getInputs()))
|
||||||
if (failed(verifyCompatibleShapedTypes(
|
if (getInputArgument(inputIndex).getType() != input.getType())
|
||||||
getOperation(), getOutputBuffer().getType(), getOutput().getType(), "output buffer and output must match")))
|
return emitError("core_batch input block argument types must match input operand types exactly");
|
||||||
return failure();
|
return verifyOnlyConstantExternalValues(getOperation(), getBody(), "pim.core_batch");
|
||||||
|
|
||||||
return verifyTensorBatchCommunication(
|
|
||||||
getOperation(), getOutput().getType(), getSourceCoreIds(), "receive_tensor_batch");
|
|
||||||
}
|
}
|
||||||
|
|
||||||
LogicalResult PimVMMOp::verify() {
|
LogicalResult PimVMMOp::verify() {
|
||||||
@@ -126,9 +132,9 @@ LogicalResult PimVMMOp::verify() {
|
|||||||
getOperation(), getOutputBuffer().getType(), getOutput().getType(), "output buffer and output must match")))
|
getOperation(), getOutputBuffer().getType(), getOutput().getType(), "output buffer and output must match")))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
auto matrixShapeOpt = getWeightShapeForVMM(getOperation(), getWeightIndex());
|
auto matrixShapeOpt = getWeightShapeForVMM(getWeight());
|
||||||
if (failed(matrixShapeOpt))
|
if (failed(matrixShapeOpt))
|
||||||
return emitError("must be nested inside pim.core or pim.core_batch with a valid weightIndex");
|
return emitError("weight must be a shaped value");
|
||||||
ArrayRef<int64_t> matrixShape = *matrixShapeOpt;
|
ArrayRef<int64_t> matrixShape = *matrixShapeOpt;
|
||||||
|
|
||||||
auto vectorType = dyn_cast<ShapedType>(getInput().getType());
|
auto vectorType = dyn_cast<ShapedType>(getInput().getType());
|
||||||
|
|||||||
@@ -17,7 +17,7 @@ Value materializeContiguousMemRef(Value memrefValue, Location loc, RewriterBase&
|
|||||||
auto shapedType = cast<ShapedType>(memrefValue.getType());
|
auto shapedType = cast<ShapedType>(memrefValue.getType());
|
||||||
auto contiguousType = MemRefType::get(shapedType.getShape(), shapedType.getElementType());
|
auto contiguousType = MemRefType::get(shapedType.getShape(), shapedType.getElementType());
|
||||||
Value contiguousBuffer = memref::AllocOp::create(rewriter, loc, contiguousType);
|
Value contiguousBuffer = memref::AllocOp::create(rewriter, loc, contiguousType);
|
||||||
auto sizeInBytes = shapedType.getNumElements() * shapedType.getElementTypeBitWidth() / 8;
|
auto sizeInBytes = getShapedTypeSizeInBytes(shapedType);
|
||||||
|
|
||||||
return PimMemCopyOp::create(rewriter,
|
return PimMemCopyOp::create(rewriter,
|
||||||
loc,
|
loc,
|
||||||
|
|||||||
@@ -1,9 +1,10 @@
|
|||||||
#include "Dialect/Pim/Transforms/Bufferization/Common.hpp"
|
#include "Dialect/Pim/Transforms/Bufferization/Common.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
|
|
||||||
IntegerAttr onnx_mlir::pim::getMemRefSizeInBytesAttr(OpBuilder& builder, Value memref) {
|
IntegerAttr onnx_mlir::pim::getMemRefSizeInBytesAttr(OpBuilder& builder, Value memref) {
|
||||||
auto type = mlir::cast<MemRefType>(memref.getType());
|
auto type = mlir::cast<MemRefType>(memref.getType());
|
||||||
int32_t sizeInBytes = static_cast<int32_t>(type.getNumElements() * type.getElementTypeBitWidth() / 8);
|
int32_t sizeInBytes = static_cast<int32_t>(getShapedTypeSizeInBytes(type));
|
||||||
return builder.getI32IntegerAttr(sizeInBytes);
|
return builder.getI32IntegerAttr(sizeInBytes);
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -38,10 +38,10 @@ struct MemCopyHostToDevOpInterface
|
|||||||
replaceOpWithNewBufferizedOp<PimMemCopyHostToDevOp>(rewriter,
|
replaceOpWithNewBufferizedOp<PimMemCopyHostToDevOp>(rewriter,
|
||||||
memCopyHostToDevOp,
|
memCopyHostToDevOp,
|
||||||
deviceTargetMemRef.getType(),
|
deviceTargetMemRef.getType(),
|
||||||
|
memCopyHostToDevOp.getDeviceTargetOffset(),
|
||||||
|
memCopyHostToDevOp.getHostSourceOffset(),
|
||||||
deviceTargetMemRef,
|
deviceTargetMemRef,
|
||||||
hostSourceMemRef,
|
hostSourceMemRef,
|
||||||
memCopyHostToDevOp.getDeviceTargetOffsetAttr(),
|
|
||||||
memCopyHostToDevOp.getHostSourceOffsetAttr(),
|
|
||||||
memCopyHostToDevOp.getSizeAttr());
|
memCopyHostToDevOp.getSizeAttr());
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
@@ -96,10 +96,10 @@ struct MemCopyDevToHostOpInterface
|
|||||||
replaceOpWithNewBufferizedOp<PimMemCopyDevToHostOp>(rewriter,
|
replaceOpWithNewBufferizedOp<PimMemCopyDevToHostOp>(rewriter,
|
||||||
memCopyDevToHostOp,
|
memCopyDevToHostOp,
|
||||||
hostTargetMemRef.getType(),
|
hostTargetMemRef.getType(),
|
||||||
|
memCopyDevToHostOp.getHostTargetOffset(),
|
||||||
|
memCopyDevToHostOp.getDeviceSourceOffset(),
|
||||||
hostTargetMemRef,
|
hostTargetMemRef,
|
||||||
deviceSourceMemRef,
|
deviceSourceMemRef,
|
||||||
memCopyDevToHostOp.getHostTargetOffsetAttr(),
|
|
||||||
memCopyDevToHostOp.getDeviceSourceOffsetAttr(),
|
|
||||||
memCopyDevToHostOp.getSizeAttr());
|
memCopyDevToHostOp.getSizeAttr());
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
@@ -151,78 +151,8 @@ struct ReceiveOpInterface : DstBufferizableOpInterfaceExternalModel<ReceiveOpInt
|
|||||||
if (failed(outputBufferOpt))
|
if (failed(outputBufferOpt))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimReceiveOp>(rewriter,
|
replaceOpWithNewBufferizedOp<PimReceiveOp>(
|
||||||
op,
|
rewriter, op, outputBufferOpt->getType(), *outputBufferOpt, receiveOp.getSizeAttr(), receiveOp.getSourceCoreId());
|
||||||
outputBufferOpt->getType(),
|
|
||||||
*outputBufferOpt,
|
|
||||||
receiveOp.getSizeAttr(),
|
|
||||||
receiveOp.getSourceCoreIdAttr());
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct ReceiveBatchOpInterface : DstBufferizableOpInterfaceExternalModel<ReceiveBatchOpInterface, PimReceiveBatchOp> {
|
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const {
|
|
||||||
return !cast<DestinationStyleOpInterface>(op).isDpsInit(&opOperand);
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
|
||||||
RewriterBase& rewriter,
|
|
||||||
const BufferizationOptions& options,
|
|
||||||
BufferizationState& state) const {
|
|
||||||
auto receiveOp = cast<PimReceiveBatchOp>(op);
|
|
||||||
auto outputBufferOpt = getBufferOrValue(rewriter, receiveOp.getOutputBuffer(), options, state);
|
|
||||||
if (failed(outputBufferOpt))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimReceiveBatchOp>(rewriter,
|
|
||||||
op,
|
|
||||||
outputBufferOpt->getType(),
|
|
||||||
*outputBufferOpt,
|
|
||||||
receiveOp.getSizeAttr(),
|
|
||||||
receiveOp.getSourceCoreIdsAttr());
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct ReceiveTensorOpInterface
|
|
||||||
: DstBufferizableOpInterfaceExternalModel<ReceiveTensorOpInterface, PimReceiveTensorOp> {
|
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const {
|
|
||||||
return !cast<DestinationStyleOpInterface>(op).isDpsInit(&opOperand);
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
|
||||||
RewriterBase& rewriter,
|
|
||||||
const BufferizationOptions& options,
|
|
||||||
BufferizationState& state) const {
|
|
||||||
auto receiveOp = cast<PimReceiveTensorOp>(op);
|
|
||||||
auto outputBufferOpt = getBufferOrValue(rewriter, receiveOp.getOutputBuffer(), options, state);
|
|
||||||
if (failed(outputBufferOpt))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimReceiveTensorOp>(
|
|
||||||
rewriter, op, outputBufferOpt->getType(), *outputBufferOpt, receiveOp.getSourceCoreIdsAttr());
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct ReceiveTensorBatchOpInterface
|
|
||||||
: DstBufferizableOpInterfaceExternalModel<ReceiveTensorBatchOpInterface, PimReceiveTensorBatchOp> {
|
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const {
|
|
||||||
return !cast<DestinationStyleOpInterface>(op).isDpsInit(&opOperand);
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
|
||||||
RewriterBase& rewriter,
|
|
||||||
const BufferizationOptions& options,
|
|
||||||
BufferizationState& state) const {
|
|
||||||
auto receiveOp = cast<PimReceiveTensorBatchOp>(op);
|
|
||||||
auto outputBufferOpt = getBufferOrValue(rewriter, receiveOp.getOutputBuffer(), options, state);
|
|
||||||
if (failed(outputBufferOpt))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimReceiveTensorBatchOp>(
|
|
||||||
rewriter, op, outputBufferOpt->getType(), *outputBufferOpt, receiveOp.getSourceCoreIdsAttr());
|
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
@@ -256,30 +186,6 @@ struct ConcatOpInterface : DstBufferizableOpInterfaceExternalModel<ConcatOpInter
|
|||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|
||||||
struct SendTensorOpInterface : BufferizableOpInterface::ExternalModel<SendTensorOpInterface, PimSendTensorOp> {
|
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return true; }
|
|
||||||
|
|
||||||
bool bufferizesToMemoryWrite(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return false; }
|
|
||||||
|
|
||||||
AliasingValueList getAliasingValues(Operation* op, OpOperand& opOperand, const AnalysisState& state) const {
|
|
||||||
return {};
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
|
||||||
RewriterBase& rewriter,
|
|
||||||
const BufferizationOptions& options,
|
|
||||||
BufferizationState& state) const {
|
|
||||||
auto sendOp = cast<PimSendTensorOp>(op);
|
|
||||||
auto inputOpt = getBufferOrValue(rewriter, sendOp.getInput(), options, state);
|
|
||||||
if (failed(inputOpt))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimSendTensorOp>(
|
|
||||||
rewriter, op, materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter), sendOp.getTargetCoreIdsAttr());
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct SendOpInterface : BufferizableOpInterface::ExternalModel<SendOpInterface, PimSendOp> {
|
struct SendOpInterface : BufferizableOpInterface::ExternalModel<SendOpInterface, PimSendOp> {
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return true; }
|
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return true; }
|
||||||
|
|
||||||
@@ -302,59 +208,7 @@ struct SendOpInterface : BufferizableOpInterface::ExternalModel<SendOpInterface,
|
|||||||
op,
|
op,
|
||||||
materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter),
|
materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter),
|
||||||
sendOp.getSizeAttr(),
|
sendOp.getSizeAttr(),
|
||||||
sendOp.getTargetCoreIdAttr());
|
sendOp.getTargetCoreId());
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct SendBatchOpInterface : BufferizableOpInterface::ExternalModel<SendBatchOpInterface, PimSendBatchOp> {
|
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return true; }
|
|
||||||
|
|
||||||
bool bufferizesToMemoryWrite(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return false; }
|
|
||||||
|
|
||||||
AliasingValueList getAliasingValues(Operation* op, OpOperand& opOperand, const AnalysisState& state) const {
|
|
||||||
return {};
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
|
||||||
RewriterBase& rewriter,
|
|
||||||
const BufferizationOptions& options,
|
|
||||||
BufferizationState& state) const {
|
|
||||||
auto sendOp = cast<PimSendBatchOp>(op);
|
|
||||||
auto inputOpt = getBufferOrValue(rewriter, sendOp.getInput(), options, state);
|
|
||||||
if (failed(inputOpt))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimSendBatchOp>(rewriter,
|
|
||||||
op,
|
|
||||||
materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter),
|
|
||||||
sendOp.getSizeAttr(),
|
|
||||||
sendOp.getTargetCoreIdsAttr());
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
};
|
|
||||||
|
|
||||||
struct SendTensorBatchOpInterface
|
|
||||||
: BufferizableOpInterface::ExternalModel<SendTensorBatchOpInterface, PimSendTensorBatchOp> {
|
|
||||||
bool bufferizesToMemoryRead(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return true; }
|
|
||||||
|
|
||||||
bool bufferizesToMemoryWrite(Operation* op, OpOperand& opOperand, const AnalysisState& state) const { return false; }
|
|
||||||
|
|
||||||
AliasingValueList getAliasingValues(Operation* op, OpOperand& opOperand, const AnalysisState& state) const {
|
|
||||||
return {};
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
|
||||||
RewriterBase& rewriter,
|
|
||||||
const BufferizationOptions& options,
|
|
||||||
BufferizationState& state) const {
|
|
||||||
auto sendOp = cast<PimSendTensorBatchOp>(op);
|
|
||||||
auto inputOpt = getBufferOrValue(rewriter, sendOp.getInput(), options, state);
|
|
||||||
if (failed(inputOpt))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimSendTensorBatchOp>(
|
|
||||||
rewriter, op, materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter), sendOp.getTargetCoreIdsAttr());
|
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
@@ -368,6 +222,37 @@ struct CoreOpInterface : BufferizableOpInterface::ExternalModel<CoreOpInterface,
|
|||||||
return {};
|
return {};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
AliasingOpOperandList getAliasingOpOperands(Operation* op, Value value, const AnalysisState& state) const {
|
||||||
|
auto coreOp = cast<PimCoreOp>(op);
|
||||||
|
auto bbArg = dyn_cast<BlockArgument>(value);
|
||||||
|
if (!bbArg || bbArg.getOwner() != &coreOp.getBody().front())
|
||||||
|
return {};
|
||||||
|
|
||||||
|
unsigned weightIndex = bbArg.getArgNumber();
|
||||||
|
return {
|
||||||
|
{&coreOp->getOpOperand(weightIndex), BufferRelation::Equivalent}
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
bool isWritable(Operation* op, Value value, const AnalysisState& state) const { return false; }
|
||||||
|
|
||||||
|
FailureOr<BufferLikeType> getBufferType(Operation* op,
|
||||||
|
Value value,
|
||||||
|
const BufferizationOptions& options,
|
||||||
|
const BufferizationState& state,
|
||||||
|
SmallVector<Value>& invocationStack) const {
|
||||||
|
auto coreOp = cast<PimCoreOp>(op);
|
||||||
|
auto bbArg = dyn_cast<BlockArgument>(value);
|
||||||
|
if (!bbArg || bbArg.getOwner() != &coreOp.getBody().front())
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
Value tiedWeight = coreOp.getWeights()[bbArg.getArgNumber()];
|
||||||
|
if (auto memRefType = dyn_cast<BufferLikeType>(tiedWeight.getType()))
|
||||||
|
return memRefType;
|
||||||
|
|
||||||
|
return bufferization::getBufferType(tiedWeight, options, state, invocationStack);
|
||||||
|
}
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
LogicalResult bufferize(Operation* op,
|
||||||
RewriterBase& rewriter,
|
RewriterBase& rewriter,
|
||||||
const BufferizationOptions& options,
|
const BufferizationOptions& options,
|
||||||
@@ -375,7 +260,10 @@ struct CoreOpInterface : BufferizableOpInterface::ExternalModel<CoreOpInterface,
|
|||||||
auto coreOp = cast<PimCoreOp>(op);
|
auto coreOp = cast<PimCoreOp>(op);
|
||||||
|
|
||||||
bool alreadyBufferized =
|
bool alreadyBufferized =
|
||||||
llvm::all_of(coreOp.getWeights(), [](Value weight) { return isa<BufferLikeType>(weight.getType()); });
|
llvm::all_of(coreOp.getWeights(), [](Value weight) { return isa<BufferLikeType>(weight.getType()); })
|
||||||
|
&& llvm::all_of(coreOp.getBody().front().getArguments(), [](BlockArgument arg) {
|
||||||
|
return !isa<TensorType>(arg.getType()) || isa<BufferLikeType>(arg.getType());
|
||||||
|
});
|
||||||
if (alreadyBufferized)
|
if (alreadyBufferized)
|
||||||
return success();
|
return success();
|
||||||
|
|
||||||
@@ -420,9 +308,17 @@ struct CoreBatchOpInterface : BufferizableOpInterface::ExternalModel<CoreBatchOp
|
|||||||
if (!bbArg || bbArg.getOwner() != &coreBatchOp.getBody().front())
|
if (!bbArg || bbArg.getOwner() != &coreBatchOp.getBody().front())
|
||||||
return {};
|
return {};
|
||||||
|
|
||||||
unsigned inputOperandIndex = coreBatchOp.getWeights().size() + bbArg.getArgNumber();
|
unsigned argNumber = bbArg.getArgNumber();
|
||||||
|
if (argNumber == 0)
|
||||||
|
return {};
|
||||||
|
|
||||||
|
unsigned weightCount = coreBatchOp.getWeights().size();
|
||||||
|
unsigned operandIndex = argNumber - 1;
|
||||||
|
if (argNumber > weightCount + 1)
|
||||||
|
operandIndex = weightCount + (argNumber - 1 - weightCount);
|
||||||
|
|
||||||
return {
|
return {
|
||||||
{&coreBatchOp->getOpOperand(inputOperandIndex), BufferRelation::Equivalent}
|
{&coreBatchOp->getOpOperand(operandIndex), BufferRelation::Equivalent}
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -438,11 +334,21 @@ struct CoreBatchOpInterface : BufferizableOpInterface::ExternalModel<CoreBatchOp
|
|||||||
if (!bbArg || bbArg.getOwner() != &coreBatchOp.getBody().front())
|
if (!bbArg || bbArg.getOwner() != &coreBatchOp.getBody().front())
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
Value tiedInput = coreBatchOp.getInputs()[bbArg.getArgNumber()];
|
unsigned argNumber = bbArg.getArgNumber();
|
||||||
if (auto memRefType = dyn_cast<BufferLikeType>(tiedInput.getType()))
|
if (argNumber == 0)
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
Value tiedOperand;
|
||||||
|
unsigned weightCount = coreBatchOp.getWeights().size();
|
||||||
|
if (argNumber <= weightCount)
|
||||||
|
tiedOperand = coreBatchOp.getWeights()[argNumber - 1];
|
||||||
|
else
|
||||||
|
tiedOperand = coreBatchOp.getInputs()[argNumber - 1 - weightCount];
|
||||||
|
|
||||||
|
if (auto memRefType = dyn_cast<BufferLikeType>(tiedOperand.getType()))
|
||||||
return memRefType;
|
return memRefType;
|
||||||
|
|
||||||
return bufferization::getBufferType(tiedInput, options, state, invocationStack);
|
return bufferization::getBufferType(tiedOperand, options, state, invocationStack);
|
||||||
}
|
}
|
||||||
|
|
||||||
LogicalResult bufferize(Operation* op,
|
LogicalResult bufferize(Operation* op,
|
||||||
@@ -454,8 +360,9 @@ struct CoreBatchOpInterface : BufferizableOpInterface::ExternalModel<CoreBatchOp
|
|||||||
bool alreadyBufferized =
|
bool alreadyBufferized =
|
||||||
llvm::all_of(coreBatchOp.getWeights(), [](Value weight) { return isa<BufferLikeType>(weight.getType()); })
|
llvm::all_of(coreBatchOp.getWeights(), [](Value weight) { return isa<BufferLikeType>(weight.getType()); })
|
||||||
&& llvm::all_of(coreBatchOp.getInputs(), [](Value input) { return isa<BufferLikeType>(input.getType()); })
|
&& llvm::all_of(coreBatchOp.getInputs(), [](Value input) { return isa<BufferLikeType>(input.getType()); })
|
||||||
&& llvm::all_of(coreBatchOp.getBody().front().getArguments(),
|
&& llvm::all_of(coreBatchOp.getBody().front().getArguments(), [](BlockArgument arg) {
|
||||||
[](BlockArgument arg) { return isa<BufferLikeType>(arg.getType()); });
|
return !isa<TensorType>(arg.getType()) || isa<BufferLikeType>(arg.getType());
|
||||||
|
});
|
||||||
if (alreadyBufferized)
|
if (alreadyBufferized)
|
||||||
return success();
|
return success();
|
||||||
|
|
||||||
@@ -553,6 +460,10 @@ struct VMMOpInterface : DstBufferizableOpInterfaceExternalModel<VMMOpInterface,
|
|||||||
BufferizationState& state) const {
|
BufferizationState& state) const {
|
||||||
auto vmmOp = cast<PimVMMOp>(op);
|
auto vmmOp = cast<PimVMMOp>(op);
|
||||||
|
|
||||||
|
auto weightOpt = getBufferOrValue(rewriter, vmmOp.getWeight(), options, state);
|
||||||
|
if (failed(weightOpt))
|
||||||
|
return failure();
|
||||||
|
|
||||||
auto inputOpt = getBufferOrValue(rewriter, vmmOp.getInput(), options, state);
|
auto inputOpt = getBufferOrValue(rewriter, vmmOp.getInput(), options, state);
|
||||||
if (failed(inputOpt))
|
if (failed(inputOpt))
|
||||||
return failure();
|
return failure();
|
||||||
@@ -564,7 +475,7 @@ struct VMMOpInterface : DstBufferizableOpInterfaceExternalModel<VMMOpInterface,
|
|||||||
Value contiguousInput = materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter);
|
Value contiguousInput = materializeContiguousMemRef(*inputOpt, op->getLoc(), rewriter);
|
||||||
|
|
||||||
replaceOpWithNewBufferizedOp<PimVMMOp>(
|
replaceOpWithNewBufferizedOp<PimVMMOp>(
|
||||||
rewriter, op, outputBufferOpt->getType(), vmmOp.getWeightIndexAttr(), contiguousInput, *outputBufferOpt);
|
rewriter, op, outputBufferOpt->getType(), *weightOpt, contiguousInput, *outputBufferOpt);
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
@@ -646,13 +557,7 @@ void registerOpBufferizationInterfaces(DialectRegistry& registry) {
|
|||||||
PimCoreOp::attachInterface<CoreOpInterface>(*ctx);
|
PimCoreOp::attachInterface<CoreOpInterface>(*ctx);
|
||||||
PimCoreBatchOp::attachInterface<CoreBatchOpInterface>(*ctx);
|
PimCoreBatchOp::attachInterface<CoreBatchOpInterface>(*ctx);
|
||||||
PimReceiveOp::attachInterface<ReceiveOpInterface>(*ctx);
|
PimReceiveOp::attachInterface<ReceiveOpInterface>(*ctx);
|
||||||
PimReceiveTensorOp::attachInterface<ReceiveTensorOpInterface>(*ctx);
|
|
||||||
PimReceiveTensorBatchOp::attachInterface<ReceiveTensorBatchOpInterface>(*ctx);
|
|
||||||
PimReceiveBatchOp::attachInterface<ReceiveBatchOpInterface>(*ctx);
|
|
||||||
PimSendOp::attachInterface<SendOpInterface>(*ctx);
|
PimSendOp::attachInterface<SendOpInterface>(*ctx);
|
||||||
PimSendBatchOp::attachInterface<SendBatchOpInterface>(*ctx);
|
|
||||||
PimSendTensorBatchOp::attachInterface<SendTensorBatchOpInterface>(*ctx);
|
|
||||||
PimSendTensorOp::attachInterface<SendTensorOpInterface>(*ctx);
|
|
||||||
PimConcatOp::attachInterface<ConcatOpInterface>(*ctx);
|
PimConcatOp::attachInterface<ConcatOpInterface>(*ctx);
|
||||||
PimMemCopyHostToDevOp::attachInterface<MemCopyHostToDevOpInterface>(*ctx);
|
PimMemCopyHostToDevOp::attachInterface<MemCopyHostToDevOpInterface>(*ctx);
|
||||||
PimMemCopyHostToDevBatchOp::attachInterface<MemCopyHostToDevBatchOpInterface>(*ctx);
|
PimMemCopyHostToDevBatchOp::attachInterface<MemCopyHostToDevBatchOpInterface>(*ctx);
|
||||||
|
|||||||
@@ -9,6 +9,7 @@
|
|||||||
|
|
||||||
#include <limits>
|
#include <limits>
|
||||||
|
|
||||||
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/Transforms/StaticMemoryCoalescing/StaticMemoryCoalescing.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/Transforms/StaticMemoryCoalescing/StaticMemoryCoalescing.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
@@ -23,11 +24,12 @@ static bool isSupportedAliasOp(Operation* op) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
static bool isCandidateAllocType(MemRefType type) {
|
static bool isCandidateAllocType(MemRefType type) {
|
||||||
return type && type.hasStaticShape() && type.getLayout().isIdentity() && type.getElementTypeBitWidth() > 0;
|
return type && type.hasStaticShape() && type.getLayout().isIdentity()
|
||||||
|
&& hasByteSizedElementType(type.getElementType());
|
||||||
}
|
}
|
||||||
|
|
||||||
static uint64_t getTypeSizeBytes(MemRefType type) {
|
static uint64_t getTypeSizeBytes(MemRefType type) {
|
||||||
return static_cast<uint64_t>(type.getNumElements() * type.getElementTypeBitWidth() / 8);
|
return static_cast<uint64_t>(type.getNumElements() * getElementTypeSizeInBytes(type.getElementType()));
|
||||||
}
|
}
|
||||||
|
|
||||||
static FailureOr<uint64_t>
|
static FailureOr<uint64_t>
|
||||||
@@ -50,10 +52,9 @@ getLastUseInstruction(memref::AllocOp allocOp, Block& body, const DenseMap<Opera
|
|||||||
pendingValues.push_back(result);
|
pendingValues.push_back(result);
|
||||||
|
|
||||||
if (auto forOp = dyn_cast<scf::ForOp>(user)) {
|
if (auto forOp = dyn_cast<scf::ForOp>(user)) {
|
||||||
for (auto [index, initArg] : llvm::enumerate(forOp.getInitArgs())) {
|
for (auto [index, initArg] : llvm::enumerate(forOp.getInitArgs()))
|
||||||
if (initArg == value)
|
if (initArg == value)
|
||||||
pendingValues.push_back(forOp.getResult(index));
|
pendingValues.push_back(forOp.getResult(index));
|
||||||
}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
if (auto dpsOp = dyn_cast<DestinationStyleOpInterface>(user)) {
|
if (auto dpsOp = dyn_cast<DestinationStyleOpInterface>(user)) {
|
||||||
|
|||||||
+2
-7
@@ -8,6 +8,7 @@
|
|||||||
#include <fstream>
|
#include <fstream>
|
||||||
|
|
||||||
#include "Common/IR/CompactAsmUtils.hpp"
|
#include "Common/IR/CompactAsmUtils.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Common/IR/BatchCoreUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/Support/DebugDump.hpp"
|
#include "src/Accelerators/PIM/Common/Support/DebugDump.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/Support/ReportUtils.hpp"
|
#include "src/Accelerators/PIM/Common/Support/ReportUtils.hpp"
|
||||||
@@ -47,12 +48,6 @@ struct CoalescingReportEntry {
|
|||||||
|
|
||||||
static std::string formatMemory(uint64_t bytes) { return formatReportMemory(bytes); }
|
static std::string formatMemory(uint64_t bytes) { return formatReportMemory(bytes); }
|
||||||
|
|
||||||
static SmallVector<int32_t> getBatchCoreIds(pim::PimCoreBatchOp coreBatchOp) {
|
|
||||||
auto coreIdsAttr = coreBatchOp->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName);
|
|
||||||
assert(coreIdsAttr && "pim.core_batch requires coreIds array attribute");
|
|
||||||
return SmallVector<int32_t>(coreIdsAttr.asArrayRef().begin(), coreIdsAttr.asArrayRef().end());
|
|
||||||
}
|
|
||||||
|
|
||||||
static void printReportRow(raw_ostream& os, const CoalescingReportRow& row) {
|
static void printReportRow(raw_ostream& os, const CoalescingReportRow& row) {
|
||||||
llvm::SmallVector<ReportField, 4> fields = {
|
llvm::SmallVector<ReportField, 4> fields = {
|
||||||
{"Number of candidates", std::to_string(row.numCandidates)},
|
{"Number of candidates", std::to_string(row.numCandidates)},
|
||||||
@@ -72,7 +67,7 @@ static CoalescingReportRow getTotalRow(const CoalescingReportEntry& entry) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
static void emitReport(ArrayRef<CoalescingReportEntry> entries) {
|
static void emitReport(ArrayRef<CoalescingReportEntry> entries) {
|
||||||
std::fstream file = openReportFile("static_memory_coalescing_report");
|
std::fstream file = openReportFile("memory_coalescing_report");
|
||||||
if (!file.is_open())
|
if (!file.is_open())
|
||||||
return;
|
return;
|
||||||
|
|
||||||
|
|||||||
@@ -2,25 +2,16 @@ add_onnx_mlir_dialect(Spatial spat)
|
|||||||
add_onnx_mlir_dialect_doc(spat Spatial.td)
|
add_onnx_mlir_dialect_doc(spat Spatial.td)
|
||||||
|
|
||||||
add_pim_library(SpatialOps
|
add_pim_library(SpatialOps
|
||||||
Channels.cpp
|
|
||||||
SpatialOps.cpp
|
SpatialOps.cpp
|
||||||
SpatialOpsAsm.cpp
|
SpatialOpsAsm.cpp
|
||||||
SpatialOpsVerify.cpp
|
SpatialOpsVerify.cpp
|
||||||
SpatialOpsCanonicalization.cpp
|
SpatialOpsCanonicalization.cpp
|
||||||
Transforms/MergeComputeNodes/MergeComputeNodesPass.cpp
|
Transforms/MergeComputeNodes/MergeComputeNodesPass.cpp
|
||||||
Transforms/MergeComputeNodes/MaterializeMergeSchedule.cpp
|
Transforms/MergeComputeNodes/MaterializeMergeSchedule.cpp
|
||||||
Transforms/MergeComputeNodes/PostMergeCompaction.cpp
|
|
||||||
Transforms/MergeComputeNodes/RegularOpCompaction.cpp
|
|
||||||
Transforms/MergeComputeNodes/Scheduling/ComputeGraph.cpp
|
Transforms/MergeComputeNodes/Scheduling/ComputeGraph.cpp
|
||||||
Transforms/MergeComputeNodes/Scheduling/ComputeInstanceUtils.cpp
|
Transforms/MergeComputeNodes/Scheduling/ComputeInstanceUtils.cpp
|
||||||
Transforms/MergeComputeNodes/Scheduling/DcpScheduler.cpp
|
|
||||||
Transforms/MergeComputeNodes/Scheduling/MergeSchedulingAnalysis.cpp
|
Transforms/MergeComputeNodes/Scheduling/MergeSchedulingAnalysis.cpp
|
||||||
Transforms/MergeComputeNodes/Scheduling/PeftScheduler.cpp
|
Transforms/MergeComputeNodes/Scheduling/PeftScheduler.cpp
|
||||||
Transforms/MergeComputeNodes/DCPGraph/Graph.cpp
|
|
||||||
Transforms/MergeComputeNodes/DCPGraph/GraphDebug.cpp
|
|
||||||
Transforms/MergeComputeNodes/DCPGraph/GraphSupport.cpp
|
|
||||||
Transforms/MergeComputeNodes/DCPGraph/Task.cpp
|
|
||||||
Transforms/MergeComputeNodes/DCPGraph/DCPAnalysis.cpp
|
|
||||||
|
|
||||||
EXCLUDE_FROM_OM_LIBS
|
EXCLUDE_FROM_OM_LIBS
|
||||||
|
|
||||||
|
|||||||
@@ -1,120 +0,0 @@
|
|||||||
#include "mlir/IR/BuiltinAttributes.h"
|
|
||||||
#include "mlir/IR/Diagnostics.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/Channels.hpp"
|
|
||||||
|
|
||||||
using namespace mlir;
|
|
||||||
|
|
||||||
namespace onnx_mlir::spatial {
|
|
||||||
|
|
||||||
namespace {
|
|
||||||
|
|
||||||
static Channels::ChannelId getChannelId(SpatChannelSendOp sendOp) { return sendOp.getChannelId(); }
|
|
||||||
|
|
||||||
static Channels::ChannelId getChannelId(SpatChannelReceiveOp receiveOp) { return receiveOp.getChannelId(); }
|
|
||||||
|
|
||||||
static LogicalResult verifyEndpointPair(ChannelEndpoints endpoints) {
|
|
||||||
if (!endpoints.send || !endpoints.receive)
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (endpoints.send.getSourceCoreId() != endpoints.receive.getSourceCoreId()) {
|
|
||||||
endpoints.send.emitOpError("sourceCoreId does not match paired spat.channel_receive");
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
if (endpoints.send.getTargetCoreId() != endpoints.receive.getTargetCoreId()) {
|
|
||||||
endpoints.send.emitOpError("targetCoreId does not match paired spat.channel_receive");
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
if (endpoints.send.getInput().getType() != endpoints.receive.getOutput().getType()) {
|
|
||||||
endpoints.send.emitOpError("input type does not match paired spat.channel_receive result type");
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace
|
|
||||||
|
|
||||||
Channels::Channels(func::FuncOp funcOp) {
|
|
||||||
if (!funcOp)
|
|
||||||
return;
|
|
||||||
|
|
||||||
funcOp.walk([&](SpatChannelSendOp sendOp) { insertSend(sendOp); });
|
|
||||||
funcOp.walk([&](SpatChannelReceiveOp receiveOp) { insertReceive(receiveOp); });
|
|
||||||
}
|
|
||||||
|
|
||||||
Channels::ChannelId Channels::allocate() { return nextChannelId++; }
|
|
||||||
|
|
||||||
void Channels::insertSend(SpatChannelSendOp sendOp) {
|
|
||||||
ChannelId channelId = getChannelId(sendOp);
|
|
||||||
nextChannelId = std::max(nextChannelId, channelId + 1);
|
|
||||||
endpoints[channelId].send = sendOp;
|
|
||||||
}
|
|
||||||
|
|
||||||
void Channels::insertReceive(SpatChannelReceiveOp receiveOp) {
|
|
||||||
ChannelId channelId = getChannelId(receiveOp);
|
|
||||||
nextChannelId = std::max(nextChannelId, channelId + 1);
|
|
||||||
endpoints[channelId].receive = receiveOp;
|
|
||||||
}
|
|
||||||
|
|
||||||
void Channels::eraseSend(SpatChannelSendOp sendOp) {
|
|
||||||
ChannelId channelId = getChannelId(sendOp);
|
|
||||||
auto it = endpoints.find(channelId);
|
|
||||||
if (it == endpoints.end())
|
|
||||||
return;
|
|
||||||
it->second.send = {};
|
|
||||||
if (!it->second.receive)
|
|
||||||
endpoints.erase(it);
|
|
||||||
}
|
|
||||||
|
|
||||||
void Channels::eraseReceive(SpatChannelReceiveOp receiveOp) {
|
|
||||||
ChannelId channelId = getChannelId(receiveOp);
|
|
||||||
auto it = endpoints.find(channelId);
|
|
||||||
if (it == endpoints.end())
|
|
||||||
return;
|
|
||||||
it->second.receive = {};
|
|
||||||
if (!it->second.send)
|
|
||||||
endpoints.erase(it);
|
|
||||||
}
|
|
||||||
|
|
||||||
FailureOr<ChannelEndpoints> Channels::lookup(ChannelId id) const {
|
|
||||||
auto it = endpoints.find(id);
|
|
||||||
if (it == endpoints.end())
|
|
||||||
return failure();
|
|
||||||
return it->second;
|
|
||||||
}
|
|
||||||
|
|
||||||
FailureOr<SpatChannelReceiveOp> Channels::getReceiveFor(SpatChannelSendOp sendOp) const {
|
|
||||||
auto endpointsOr = lookup(getChannelId(sendOp));
|
|
||||||
if (failed(endpointsOr) || !endpointsOr->receive)
|
|
||||||
return failure();
|
|
||||||
return endpointsOr->receive;
|
|
||||||
}
|
|
||||||
|
|
||||||
FailureOr<SpatChannelSendOp> Channels::getSendFor(SpatChannelReceiveOp receiveOp) const {
|
|
||||||
auto endpointsOr = lookup(getChannelId(receiveOp));
|
|
||||||
if (failed(endpointsOr) || !endpointsOr->send)
|
|
||||||
return failure();
|
|
||||||
return endpointsOr->send;
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult Channels::verify() const {
|
|
||||||
for (const auto& [channelId, pair] : endpoints) {
|
|
||||||
if (!pair.send || !pair.receive) {
|
|
||||||
if (pair.send) {
|
|
||||||
auto sendOp = pair.send;
|
|
||||||
sendOp.emitOpError("channel_id ") << channelId << " is missing a paired spat.channel_receive";
|
|
||||||
}
|
|
||||||
else if (pair.receive) {
|
|
||||||
auto receiveOp = pair.receive;
|
|
||||||
receiveOp.emitOpError("channel_id ") << channelId << " is missing a paired spat.channel_send";
|
|
||||||
}
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
if (failed(verifyEndpointPair(pair)))
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace onnx_mlir::spatial
|
|
||||||
@@ -1,43 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
|
||||||
#include "mlir/Support/LogicalResult.h"
|
|
||||||
|
|
||||||
#include "llvm/ADT/DenseMap.h"
|
|
||||||
#include "llvm/ADT/StringRef.h"
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir::spatial {
|
|
||||||
|
|
||||||
struct ChannelEndpoints {
|
|
||||||
SpatChannelSendOp send;
|
|
||||||
SpatChannelReceiveOp receive;
|
|
||||||
};
|
|
||||||
|
|
||||||
class Channels {
|
|
||||||
public:
|
|
||||||
using ChannelId = int64_t;
|
|
||||||
|
|
||||||
explicit Channels(mlir::func::FuncOp funcOp);
|
|
||||||
|
|
||||||
ChannelId allocate();
|
|
||||||
|
|
||||||
void insertSend(SpatChannelSendOp sendOp);
|
|
||||||
void insertReceive(SpatChannelReceiveOp receiveOp);
|
|
||||||
void eraseSend(SpatChannelSendOp sendOp);
|
|
||||||
void eraseReceive(SpatChannelReceiveOp receiveOp);
|
|
||||||
|
|
||||||
llvm::FailureOr<ChannelEndpoints> lookup(ChannelId id) const;
|
|
||||||
llvm::FailureOr<SpatChannelReceiveOp> getReceiveFor(SpatChannelSendOp sendOp) const;
|
|
||||||
llvm::FailureOr<SpatChannelSendOp> getSendFor(SpatChannelReceiveOp receiveOp) const;
|
|
||||||
|
|
||||||
mlir::LogicalResult verify() const;
|
|
||||||
|
|
||||||
private:
|
|
||||||
ChannelId nextChannelId = 0;
|
|
||||||
llvm::DenseMap<ChannelId, ChannelEndpoints> endpoints;
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace onnx_mlir::spatial
|
|
||||||
@@ -2,8 +2,12 @@
|
|||||||
#define SPATIAL_DIALECT_H
|
#define SPATIAL_DIALECT_H
|
||||||
|
|
||||||
include "mlir/IR/OpBase.td"
|
include "mlir/IR/OpBase.td"
|
||||||
|
include "mlir/IR/OpAsmInterface.td"
|
||||||
include "mlir/IR/BuiltinTypes.td"
|
include "mlir/IR/BuiltinTypes.td"
|
||||||
include "mlir/IR/AttrTypeBase.td"
|
include "mlir/IR/AttrTypeBase.td"
|
||||||
|
include "mlir/IR/RegionKindInterface.td"
|
||||||
|
include "mlir/Interfaces/ParallelCombiningOpInterface.td"
|
||||||
|
include "mlir/Interfaces/SideEffectInterfaces.td"
|
||||||
|
|
||||||
def SpatialDialect : Dialect {
|
def SpatialDialect : Dialect {
|
||||||
let name = "spat";
|
let name = "spat";
|
||||||
@@ -22,7 +26,9 @@ def SpatTensor :
|
|||||||
// Execution
|
// Execution
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
|
|
||||||
def SpatCompute : SpatOp<"compute", [SingleBlock, AttrSizedOperandSegments]> {
|
def SpatCompute : SpatOp<"compute",
|
||||||
|
[SingleBlock, AttrSizedOperandSegments,
|
||||||
|
DeclareOpInterfaceMethods<OpAsmOpInterface, ["getAsmBlockArgumentNames"]>]> {
|
||||||
let summary = "Compute region with attached constant weights";
|
let summary = "Compute region with attached constant weights";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
@@ -36,14 +42,27 @@ def SpatCompute : SpatOp<"compute", [SingleBlock, AttrSizedOperandSegments]> {
|
|||||||
|
|
||||||
let regions = (region SizedRegion<1>:$body);
|
let regions = (region SizedRegion<1>:$body);
|
||||||
|
|
||||||
|
let extraClassDeclaration = [{
|
||||||
|
std::optional<::mlir::BlockArgument> getWeightArgument(unsigned idx);
|
||||||
|
std::optional<::mlir::BlockArgument> getInputArgument(unsigned idx);
|
||||||
|
std::optional<std::tuple<::mlir::Value, ::mlir::BlockArgument>>
|
||||||
|
insertWeight(unsigned idx, ::mlir::Value weight, ::mlir::Location loc);
|
||||||
|
std::optional<std::tuple<::mlir::Value, ::mlir::BlockArgument>>
|
||||||
|
insertInput(unsigned idx, ::mlir::Value input, ::mlir::Location loc);
|
||||||
|
::llvm::SetVector<::mlir::Value, ::llvm::SmallVector<::mlir::Value, 4>, ::llvm::SmallDenseSet<::mlir::Value, 4>> getCrossbarWeights();
|
||||||
|
::mlir::FailureOr<std::tuple<::mlir::OpResult, SpatCompute>>
|
||||||
|
insertOutput(::mlir::RewriterBase &rewriter, unsigned idx, ::mlir::Type type, ::mlir::Location loc);
|
||||||
|
}];
|
||||||
|
|
||||||
let hasVerifier = 1;
|
let hasVerifier = 1;
|
||||||
let hasFolder = 1;
|
let hasFolder = 1;
|
||||||
let hasCustomAssemblyFormat = 1;
|
let hasCustomAssemblyFormat = 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
def SpatComputeBatch : SpatOp<"compute_batch",
|
def SpatComputeBatch : SpatOp<"compute_batch",
|
||||||
[SingleBlock, AttrSizedOperandSegments]> {
|
[SingleBlock, AttrSizedOperandSegments,
|
||||||
let summary = "Compressed batch of independent equivalent compute lanes";
|
DeclareOpInterfaceMethods<OpAsmOpInterface, ["getAsmBlockArgumentNames"]>]> {
|
||||||
|
let summary = "Tensor-native batch of equivalent compute lanes with shared weights and packed inputs";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
I32Attr:$laneCount,
|
I32Attr:$laneCount,
|
||||||
@@ -57,10 +76,48 @@ def SpatComputeBatch : SpatOp<"compute_batch",
|
|||||||
|
|
||||||
let regions = (region SizedRegion<1>:$body);
|
let regions = (region SizedRegion<1>:$body);
|
||||||
|
|
||||||
|
let extraClassDeclaration = [{
|
||||||
|
std::optional<::mlir::BlockArgument> getLaneArgument();
|
||||||
|
std::optional<::mlir::BlockArgument> getWeightArgument(unsigned idx);
|
||||||
|
std::optional<::mlir::BlockArgument> getInputArgument(unsigned idx);
|
||||||
|
std::optional<::mlir::BlockArgument> getOutputArgument(unsigned idx);
|
||||||
|
std::optional<std::tuple<::mlir::Value, ::mlir::BlockArgument>>
|
||||||
|
insertWeight(unsigned idx, ::mlir::Value weight, ::mlir::Location loc);
|
||||||
|
std::optional<std::tuple<::mlir::Value, ::mlir::BlockArgument>>
|
||||||
|
insertInput(unsigned idx, ::mlir::Value input, ::mlir::Location loc);
|
||||||
|
::llvm::SetVector<::mlir::Value, ::llvm::SmallVector<::mlir::Value, 4>, ::llvm::SmallDenseSet<::mlir::Value, 4>> getCrossbarWeights();
|
||||||
|
::mlir::FailureOr<std::tuple<::mlir::OpResult, ::mlir::BlockArgument, SpatComputeBatch>>
|
||||||
|
insertOutput(::mlir::RewriterBase &rewriter, unsigned idx, ::mlir::Type type, ::mlir::Location loc);
|
||||||
|
}];
|
||||||
|
|
||||||
let hasVerifier = 1;
|
let hasVerifier = 1;
|
||||||
let hasCustomAssemblyFormat = 1;
|
let hasCustomAssemblyFormat = 1;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
def SpatInParallelOp : SpatOp<"in_parallel", [
|
||||||
|
Pure,
|
||||||
|
Terminator,
|
||||||
|
DeclareOpInterfaceMethods<InParallelOpInterface>,
|
||||||
|
HasParent<"SpatComputeBatch">,
|
||||||
|
] # GraphRegionNoTerminator.traits> {
|
||||||
|
let summary = "Parallel combining terminator for resultful spat.compute_batch";
|
||||||
|
|
||||||
|
let regions = (region SizedRegion<1>:$region);
|
||||||
|
|
||||||
|
let hasCustomAssemblyFormat = 1;
|
||||||
|
let hasVerifier = 1;
|
||||||
|
|
||||||
|
let skipDefaultBuilders = 1;
|
||||||
|
let builders = [
|
||||||
|
OpBuilder<(ins)>,
|
||||||
|
];
|
||||||
|
|
||||||
|
let extraClassDeclaration = [{
|
||||||
|
::llvm::iterator_range<::mlir::Block::iterator> getYieldingOps();
|
||||||
|
::mlir::OpResult getParentResult(int64_t idx);
|
||||||
|
}];
|
||||||
|
}
|
||||||
|
|
||||||
def SpatYieldOp : SpatOp<"yield", [Terminator]> {
|
def SpatYieldOp : SpatOp<"yield", [Terminator]> {
|
||||||
let summary = "Yield results from a compute region";
|
let summary = "Yield results from a compute region";
|
||||||
|
|
||||||
@@ -110,14 +167,14 @@ def SpatChannelSendOp : SpatOp<"channel_send", []> {
|
|||||||
let summary = "Send a tensor through a logical channel";
|
let summary = "Send a tensor through a logical channel";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
I64Attr:$channelId,
|
Index:$channelId,
|
||||||
I32Attr:$sourceCoreId,
|
Index:$sourceCoreId,
|
||||||
I32Attr:$targetCoreId,
|
Index:$targetCoreId,
|
||||||
SpatTensor:$input
|
SpatTensor:$input
|
||||||
);
|
);
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
$input attr-dict `:` type($input)
|
$input `channel` $channelId `from` $sourceCoreId `to` $targetCoreId attr-dict `:` type($input)
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -125,9 +182,9 @@ def SpatChannelReceiveOp : SpatOp<"channel_receive", []> {
|
|||||||
let summary = "Receive a tensor from a logical channel";
|
let summary = "Receive a tensor from a logical channel";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
I64Attr:$channelId,
|
Index:$channelId,
|
||||||
I32Attr:$sourceCoreId,
|
Index:$sourceCoreId,
|
||||||
I32Attr:$targetCoreId
|
Index:$targetCoreId
|
||||||
);
|
);
|
||||||
|
|
||||||
let results = (outs
|
let results = (outs
|
||||||
@@ -135,103 +192,10 @@ def SpatChannelReceiveOp : SpatOp<"channel_receive", []> {
|
|||||||
);
|
);
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
attr-dict `:` type($output)
|
`channel` $channelId `from` $sourceCoreId `to` $targetCoreId attr-dict `:` type($output)
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
def SpatChannelSendTensorOp : SpatOp<"channel_send_tensor", []> {
|
|
||||||
let summary = "Send equal contiguous chunks of one tensor through logical channels";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
DenseI64ArrayAttr:$channelIds,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds,
|
|
||||||
SpatTensor:$input
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatChannelReceiveTensorOp : SpatOp<"channel_receive_tensor", []> {
|
|
||||||
let summary = "Receive equal contiguous chunks of one tensor from logical channels";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
DenseI64ArrayAttr:$channelIds,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
SpatTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatChannelSendBatchOp : SpatOp<"channel_send_batch", []> {
|
|
||||||
let summary = "Send per-lane tensors through logical channels in a batch body";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
DenseI64ArrayAttr:$channelIds,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds,
|
|
||||||
SpatTensor:$input
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatChannelSendTensorBatchOp : SpatOp<"channel_send_tensor_batch", []> {
|
|
||||||
let summary = "Send equal contiguous chunks of one per-lane tensor through logical channels in a batch body";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
DenseI64ArrayAttr:$channelIds,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds,
|
|
||||||
SpatTensor:$input
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatChannelReceiveBatchOp : SpatOp<"channel_receive_batch", []> {
|
|
||||||
let summary = "Receive a per-lane tensor through logical channels in a batch body";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
DenseI64ArrayAttr:$channelIds,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
SpatTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatChannelReceiveTensorBatchOp : SpatOp<"channel_receive_tensor_batch", []> {
|
|
||||||
let summary = "Receive equal contiguous chunks of one per-lane tensor through logical channels in a batch body";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
DenseI64ArrayAttr:$channelIds,
|
|
||||||
DenseI32ArrayAttr:$sourceCoreIds,
|
|
||||||
DenseI32ArrayAttr:$targetCoreIds
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
SpatTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
let hasCustomAssemblyFormat = 1;
|
|
||||||
}
|
|
||||||
|
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
// Math
|
// Math
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
@@ -240,7 +204,7 @@ def SpatVMMOp : SpatOp<"wvmm", []> {
|
|||||||
let summary = "Vector-matrix multiplication within a weighted compute operation";
|
let summary = "Vector-matrix multiplication within a weighted compute operation";
|
||||||
|
|
||||||
let arguments = (ins
|
let arguments = (ins
|
||||||
I32Attr:$weightIndex,
|
SpatTensor:$weight,
|
||||||
SpatTensor:$input
|
SpatTensor:$input
|
||||||
);
|
);
|
||||||
|
|
||||||
@@ -251,26 +215,7 @@ def SpatVMMOp : SpatOp<"wvmm", []> {
|
|||||||
let hasVerifier = 1;
|
let hasVerifier = 1;
|
||||||
|
|
||||||
let assemblyFormat = [{
|
let assemblyFormat = [{
|
||||||
`(` $input `)` attr-dict `:` type($input) `->` type($output)
|
`[` $weight `]` `(` $input `)` attr-dict `:` `(` type($weight) `,` type($input) `)` `->` type($output)
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatMVMOp : SpatOp<"Wmvm", []> {
|
|
||||||
let summary = "Matrix-vector multiplication within a weighted compute operation";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
I32Attr:$weightIndex,
|
|
||||||
SpatTensor:$input
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
SpatTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let hasVerifier = 1;
|
|
||||||
|
|
||||||
let assemblyFormat = [{
|
|
||||||
`(` $input `)` attr-dict `:` type($input) `->` type($output)
|
|
||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -310,22 +255,6 @@ def SpatVMulOp : SpatOp<"vmul", []> {
|
|||||||
}];
|
}];
|
||||||
}
|
}
|
||||||
|
|
||||||
def SpatSumOp : SpatOp<"sum", []> {
|
|
||||||
let summary = "Reduce all elements of the input tensor to a single scalar wrapped in a tensor";
|
|
||||||
|
|
||||||
let arguments = (ins
|
|
||||||
SpatTensor:$input
|
|
||||||
);
|
|
||||||
|
|
||||||
let results = (outs
|
|
||||||
SpatTensor:$output
|
|
||||||
);
|
|
||||||
|
|
||||||
let assemblyFormat = [{
|
|
||||||
`(` $input `)` attr-dict `:` type($input) `->` type($output)
|
|
||||||
}];
|
|
||||||
}
|
|
||||||
|
|
||||||
def SpatVAvgOp : SpatOp<"vavg", []> {
|
def SpatVAvgOp : SpatOp<"vavg", []> {
|
||||||
let summary = "Average all elements of the input tensor to a single scalar wrapped in a tensor";
|
let summary = "Average all elements of the input tensor to a single scalar wrapped in a tensor";
|
||||||
|
|
||||||
|
|||||||
@@ -1,9 +1,239 @@
|
|||||||
|
#include "llvm/ADT/STLExtras.h"
|
||||||
|
#include "llvm/ADT/DenseSet.h"
|
||||||
|
#include "llvm/ADT/SetVector.h"
|
||||||
|
|
||||||
|
#include <string>
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
|
|
||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
namespace spatial {
|
namespace spatial {
|
||||||
|
namespace {
|
||||||
|
|
||||||
|
std::optional<BlockArgument> getBlockArgument(Region& body, unsigned argIdx) {
|
||||||
|
if (body.empty())
|
||||||
|
return std::nullopt;
|
||||||
|
|
||||||
|
Block& block = body.front();
|
||||||
|
if (argIdx >= block.getNumArguments())
|
||||||
|
return std::nullopt;
|
||||||
|
return block.getArgument(argIdx);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<BlockArgument> insertBlockArgument(Region& body, unsigned argIdx, Type type, Location loc) {
|
||||||
|
if (body.empty())
|
||||||
|
return std::nullopt;
|
||||||
|
return body.insertArgument(argIdx, type, loc);
|
||||||
|
}
|
||||||
|
|
||||||
|
void setComputeOperandSegmentSizes(Operation* op, int32_t weightCount, int32_t inputCount) {
|
||||||
|
if (auto compute = dyn_cast<SpatCompute>(op)) {
|
||||||
|
compute.getProperties().setOperandSegmentSizes({weightCount, inputCount});
|
||||||
|
return;
|
||||||
|
}
|
||||||
|
cast<SpatComputeBatch>(op).getProperties().setOperandSegmentSizes({weightCount, inputCount});
|
||||||
|
}
|
||||||
|
|
||||||
|
using CrossbarWeightSet = llvm::SetVector<Value, llvm::SmallVector<Value, 4>, llvm::SmallDenseSet<Value, 4>>;
|
||||||
|
|
||||||
|
CrossbarWeightSet collectCrossbarWeights(Region& body) {
|
||||||
|
CrossbarWeightSet weights;
|
||||||
|
body.walk([&](SpatVMMOp vmmOp) {
|
||||||
|
Value weight = vmmOp.getWeight();
|
||||||
|
weights.insert(weight);
|
||||||
|
});
|
||||||
|
return weights;
|
||||||
|
}
|
||||||
|
|
||||||
|
} // namespace
|
||||||
|
|
||||||
|
std::optional<BlockArgument> SpatCompute::getWeightArgument(unsigned idx) { return getBlockArgument(getBody(), idx); }
|
||||||
|
|
||||||
|
std::optional<BlockArgument> SpatCompute::getInputArgument(unsigned idx) {
|
||||||
|
return getBlockArgument(getBody(), getWeights().size() + idx);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<std::tuple<Value, BlockArgument>> SpatCompute::insertWeight(unsigned idx, Value weight, Location loc) {
|
||||||
|
if (auto existing = llvm::find(getWeights(), weight); existing != getWeights().end()) {
|
||||||
|
auto index = std::distance(getWeights().begin(), existing);
|
||||||
|
return {
|
||||||
|
{*existing, *getWeightArgument(index)}
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned weightCount = getWeights().size();
|
||||||
|
unsigned inputCount = getInputs().size();
|
||||||
|
getOperation()->insertOperands(idx, ValueRange {weight});
|
||||||
|
setComputeOperandSegmentSizes(
|
||||||
|
getOperation(), static_cast<int32_t>(weightCount + 1), static_cast<int32_t>(inputCount));
|
||||||
|
auto blockArg = insertBlockArgument(getBody(), idx, weight.getType(), loc);
|
||||||
|
if (!blockArg)
|
||||||
|
return std::nullopt;
|
||||||
|
return std::make_tuple(getOperation()->getOperand(idx), *blockArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<std::tuple<Value, BlockArgument>> SpatCompute::insertInput(unsigned idx, Value input, Location loc) {
|
||||||
|
unsigned weightCount = getWeights().size();
|
||||||
|
unsigned inputCount = getInputs().size();
|
||||||
|
getOperation()->insertOperands(weightCount + idx, ValueRange {input});
|
||||||
|
setComputeOperandSegmentSizes(
|
||||||
|
getOperation(), static_cast<int32_t>(weightCount), static_cast<int32_t>(inputCount + 1));
|
||||||
|
auto blockArg = insertBlockArgument(getBody(), weightCount + idx, input.getType(), loc);
|
||||||
|
if (!blockArg)
|
||||||
|
return std::nullopt;
|
||||||
|
return std::make_tuple(getOperation()->getOperand(weightCount + idx), *blockArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
CrossbarWeightSet SpatCompute::getCrossbarWeights() { return collectCrossbarWeights(getBody()); }
|
||||||
|
|
||||||
|
FailureOr<std::tuple<OpResult, SpatCompute>>
|
||||||
|
SpatCompute::insertOutput(RewriterBase& rewriter, unsigned idx, Type type, Location loc) {
|
||||||
|
if (idx > getNumResults())
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
rewriter.setInsertionPoint(getOperation());
|
||||||
|
SmallVector<Type> resultTypes(getResultTypes().begin(), getResultTypes().end());
|
||||||
|
resultTypes.insert(resultTypes.begin() + idx, type);
|
||||||
|
auto newCompute = SpatCompute::create(rewriter, getLoc(), TypeRange(resultTypes), getWeights(), getInputs());
|
||||||
|
newCompute->setAttrs((*this)->getAttrs());
|
||||||
|
setComputeOperandSegmentSizes(newCompute.getOperation(),
|
||||||
|
static_cast<int32_t>(newCompute.getWeights().size()),
|
||||||
|
static_cast<int32_t>(newCompute.getInputs().size()));
|
||||||
|
rewriter.inlineRegionBefore(getBody(), newCompute.getBody(), newCompute.getBody().end());
|
||||||
|
for (unsigned oldResultIdx = 0; oldResultIdx < getNumResults(); ++oldResultIdx)
|
||||||
|
getResult(oldResultIdx)
|
||||||
|
.replaceAllUsesWith(newCompute.getResult(oldResultIdx < idx ? oldResultIdx : oldResultIdx + 1));
|
||||||
|
rewriter.eraseOp(getOperation());
|
||||||
|
return std::make_tuple(cast<OpResult>(newCompute.getResult(idx)), newCompute);
|
||||||
|
}
|
||||||
|
|
||||||
|
void SpatCompute::getAsmBlockArgumentNames(Region& region, OpAsmSetValueNameFn setNameFn) {
|
||||||
|
if (region.empty())
|
||||||
|
return;
|
||||||
|
|
||||||
|
for (unsigned index = 0; index < getWeights().size(); ++index)
|
||||||
|
if (auto weightArg = getWeightArgument(index))
|
||||||
|
setNameFn(*weightArg, ("w" + std::to_string(index)).c_str());
|
||||||
|
|
||||||
|
for (unsigned index = 0; index < getInputs().size(); ++index)
|
||||||
|
if (auto inputArg = getInputArgument(index))
|
||||||
|
setNameFn(*inputArg, ("in" + std::to_string(index)).c_str());
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<BlockArgument> SpatComputeBatch::getLaneArgument() { return getBlockArgument(getBody(), 0); }
|
||||||
|
|
||||||
|
std::optional<BlockArgument> SpatComputeBatch::getWeightArgument(unsigned idx) {
|
||||||
|
return getBlockArgument(getBody(), 1 + idx);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<BlockArgument> SpatComputeBatch::getInputArgument(unsigned idx) {
|
||||||
|
return getBlockArgument(getBody(), 1 + getWeights().size() + idx);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<BlockArgument> SpatComputeBatch::getOutputArgument(unsigned idx) {
|
||||||
|
return getBlockArgument(getBody(), 1 + getWeights().size() + getInputs().size() + idx);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<std::tuple<Value, BlockArgument>>
|
||||||
|
SpatComputeBatch::insertWeight(unsigned idx, Value weight, Location loc) {
|
||||||
|
if (auto existing = llvm::find(getWeights(), weight); existing != getWeights().end()) {
|
||||||
|
auto index = std::distance(getWeights().begin(), existing);
|
||||||
|
return {
|
||||||
|
{*existing, *getWeightArgument(index)}
|
||||||
|
};
|
||||||
|
}
|
||||||
|
|
||||||
|
unsigned weightCount = getWeights().size();
|
||||||
|
unsigned inputCount = getInputs().size();
|
||||||
|
getOperation()->insertOperands(idx, ValueRange {weight});
|
||||||
|
setComputeOperandSegmentSizes(
|
||||||
|
getOperation(), static_cast<int32_t>(weightCount + 1), static_cast<int32_t>(inputCount));
|
||||||
|
auto blockArg = insertBlockArgument(getBody(), 1 + idx, weight.getType(), loc);
|
||||||
|
if (!blockArg)
|
||||||
|
return std::nullopt;
|
||||||
|
return std::make_tuple(getOperation()->getOperand(idx), *blockArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
std::optional<std::tuple<Value, BlockArgument>> SpatComputeBatch::insertInput(unsigned idx, Value input, Location loc) {
|
||||||
|
unsigned weightCount = getWeights().size();
|
||||||
|
unsigned inputCount = getInputs().size();
|
||||||
|
getOperation()->insertOperands(weightCount + idx, ValueRange {input});
|
||||||
|
setComputeOperandSegmentSizes(
|
||||||
|
getOperation(), static_cast<int32_t>(weightCount), static_cast<int32_t>(inputCount + 1));
|
||||||
|
auto blockArg = insertBlockArgument(getBody(), 1 + weightCount + idx, input.getType(), loc);
|
||||||
|
if (!blockArg)
|
||||||
|
return std::nullopt;
|
||||||
|
return std::make_tuple(getOperation()->getOperand(weightCount + idx), *blockArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
CrossbarWeightSet SpatComputeBatch::getCrossbarWeights() { return collectCrossbarWeights(getBody()); }
|
||||||
|
|
||||||
|
FailureOr<std::tuple<OpResult, BlockArgument, SpatComputeBatch>>
|
||||||
|
SpatComputeBatch::insertOutput(RewriterBase& rewriter, unsigned idx, Type type, Location loc) {
|
||||||
|
if (idx > getNumResults())
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
rewriter.setInsertionPoint(getOperation());
|
||||||
|
SmallVector<Type> resultTypes(getResultTypes().begin(), getResultTypes().end());
|
||||||
|
resultTypes.insert(resultTypes.begin() + idx, type);
|
||||||
|
auto newBatch =
|
||||||
|
SpatComputeBatch::create(rewriter, getLoc(), TypeRange(resultTypes), getLaneCountAttr(), getWeights(), getInputs());
|
||||||
|
newBatch->setAttrs((*this)->getAttrs());
|
||||||
|
setComputeOperandSegmentSizes(newBatch.getOperation(),
|
||||||
|
static_cast<int32_t>(newBatch.getWeights().size()),
|
||||||
|
static_cast<int32_t>(newBatch.getInputs().size()));
|
||||||
|
rewriter.inlineRegionBefore(getBody(), newBatch.getBody(), newBatch.getBody().end());
|
||||||
|
if (newBatch.getBody().empty()) {
|
||||||
|
rewriter.eraseOp(newBatch);
|
||||||
|
return failure();
|
||||||
|
}
|
||||||
|
auto blockArg = newBatch.getBody().front().insertArgument(
|
||||||
|
1 + newBatch.getWeights().size() + newBatch.getInputs().size() + idx, type, loc);
|
||||||
|
for (unsigned oldResultIdx = 0; oldResultIdx < getNumResults(); ++oldResultIdx)
|
||||||
|
getResult(oldResultIdx)
|
||||||
|
.replaceAllUsesWith(newBatch.getResult(oldResultIdx < idx ? oldResultIdx : oldResultIdx + 1));
|
||||||
|
rewriter.eraseOp(getOperation());
|
||||||
|
return std::make_tuple(cast<OpResult>(newBatch.getResult(idx)), blockArg, newBatch);
|
||||||
|
}
|
||||||
|
|
||||||
|
void SpatComputeBatch::getAsmBlockArgumentNames(Region& region, OpAsmSetValueNameFn setNameFn) {
|
||||||
|
if (region.empty())
|
||||||
|
return;
|
||||||
|
|
||||||
|
if (auto laneArg = getLaneArgument())
|
||||||
|
setNameFn(*laneArg, "lane");
|
||||||
|
|
||||||
|
for (unsigned index = 0; index < getWeights().size(); ++index)
|
||||||
|
if (auto weightArg = getWeightArgument(index))
|
||||||
|
setNameFn(*weightArg, ("w" + std::to_string(index)).c_str());
|
||||||
|
|
||||||
|
for (unsigned index = 0; index < getInputs().size(); ++index)
|
||||||
|
if (auto inputArg = getInputArgument(index))
|
||||||
|
setNameFn(*inputArg, ("in" + std::to_string(index)).c_str());
|
||||||
|
|
||||||
|
for (unsigned index = 0; index < getNumResults(); ++index) {
|
||||||
|
auto outputArg = getOutputArgument(index);
|
||||||
|
if (!outputArg)
|
||||||
|
continue;
|
||||||
|
if (index == 0) {
|
||||||
|
setNameFn(*outputArg, "out");
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
setNameFn(*outputArg, ("out" + std::to_string(index)).c_str());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
void SpatInParallelOp::build(OpBuilder& builder, OperationState& result) {
|
||||||
|
OpBuilder::InsertionGuard guard(builder);
|
||||||
|
Region* bodyRegion = result.addRegion();
|
||||||
|
builder.createBlock(bodyRegion);
|
||||||
|
}
|
||||||
|
|
||||||
|
OpResult SpatInParallelOp::getParentResult(int64_t idx) { return getOperation()->getParentOp()->getResult(idx); }
|
||||||
|
|
||||||
|
llvm::iterator_range<Block::iterator> SpatInParallelOp::getYieldingOps() { return getRegion().front().getOperations(); }
|
||||||
|
|
||||||
void SpatialDialect::initialize() {
|
void SpatialDialect::initialize() {
|
||||||
addTypes<
|
addTypes<
|
||||||
|
|||||||
@@ -5,10 +5,18 @@
|
|||||||
#include "mlir/IR/BuiltinTypes.h"
|
#include "mlir/IR/BuiltinTypes.h"
|
||||||
#include "mlir/IR/Dialect.h"
|
#include "mlir/IR/Dialect.h"
|
||||||
#include "mlir/IR/OpDefinition.h"
|
#include "mlir/IR/OpDefinition.h"
|
||||||
|
#include "mlir/IR/PatternMatch.h"
|
||||||
|
#include "mlir/IR/RegionKindInterface.h"
|
||||||
#include "mlir/IR/Types.h"
|
#include "mlir/IR/Types.h"
|
||||||
|
#include "mlir/Interfaces/ParallelCombiningOpInterface.h"
|
||||||
|
|
||||||
|
#include "llvm/ADT/DenseSet.h"
|
||||||
|
#include "llvm/ADT/SetVector.h"
|
||||||
|
|
||||||
#include <map>
|
#include <map>
|
||||||
|
#include <optional>
|
||||||
#include <string>
|
#include <string>
|
||||||
|
#include <tuple>
|
||||||
|
|
||||||
/// Include the auto-generated header files containing the declarations
|
/// Include the auto-generated header files containing the declarations
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialDialect.hpp.inc"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialDialect.hpp.inc"
|
||||||
|
|||||||
@@ -10,6 +10,7 @@
|
|||||||
#include "src/Accelerators/PIM/Common/IR/CompactAsmUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/CompactAsmUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Dialect/Spatial/Transforms/MergeComputeNodes/Scheduling/ComputeGraph.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
|
|
||||||
@@ -23,22 +24,6 @@ static bool parseOptionalKeywordAlias(OpAsmParser& parser, StringRef preferred,
|
|||||||
return succeeded(parser.parseOptionalKeyword(preferred)) || succeeded(parser.parseOptionalKeyword(legacy));
|
return succeeded(parser.parseOptionalKeyword(preferred)) || succeeded(parser.parseOptionalKeyword(legacy));
|
||||||
}
|
}
|
||||||
|
|
||||||
static void printChannelMetadata(OpAsmPrinter& printer,
|
|
||||||
ArrayRef<int64_t> channelIds,
|
|
||||||
ArrayRef<int32_t> sourceCoreIds,
|
|
||||||
ArrayRef<int32_t> targetCoreIds) {
|
|
||||||
printer << " channels ";
|
|
||||||
printCompressedIntegerList(printer, channelIds);
|
|
||||||
printer << " from ";
|
|
||||||
printCompressedIntegerList(printer, sourceCoreIds);
|
|
||||||
printer << " to ";
|
|
||||||
printCompressedIntegerList(printer, targetCoreIds);
|
|
||||||
}
|
|
||||||
|
|
||||||
static DenseI64ArrayAttr getDenseI64ArrayAttr(OpAsmParser& parser, ArrayRef<int64_t> values) {
|
|
||||||
return parser.getBuilder().getDenseI64ArrayAttr(values);
|
|
||||||
}
|
|
||||||
|
|
||||||
static DenseI32ArrayAttr getDenseI32ArrayAttr(OpAsmParser& parser, ArrayRef<int32_t> values) {
|
static DenseI32ArrayAttr getDenseI32ArrayAttr(OpAsmParser& parser, ArrayRef<int32_t> values) {
|
||||||
return parser.getBuilder().getDenseI32ArrayAttr(values);
|
return parser.getBuilder().getDenseI32ArrayAttr(values);
|
||||||
}
|
}
|
||||||
@@ -47,94 +32,86 @@ static IntegerAttr getI32Attr(OpAsmParser& parser, int32_t value) {
|
|||||||
return parser.getBuilder().getI32IntegerAttr(value);
|
return parser.getBuilder().getI32IntegerAttr(value);
|
||||||
}
|
}
|
||||||
|
|
||||||
template <typename TensorSendOpTy>
|
static void printBlockArgumentList(OpAsmPrinter& printer, ArrayRef<BlockArgument> arguments) {
|
||||||
static void printTensorSendOp(OpAsmPrinter& printer, TensorSendOpTy op) {
|
printer << "(";
|
||||||
printer << " ";
|
for (auto [index, argument] : llvm::enumerate(arguments)) {
|
||||||
printer.printOperand(op.getInput());
|
if (index != 0)
|
||||||
printChannelMetadata(printer, op.getChannelIds(), op.getSourceCoreIds(), op.getTargetCoreIds());
|
printer << ", ";
|
||||||
printer.printOptionalAttrDict(op->getAttrs(),
|
printer.printOperand(argument);
|
||||||
{op.getChannelIdsAttrName().getValue(),
|
}
|
||||||
op.getSourceCoreIdsAttrName().getValue(),
|
printer << ")";
|
||||||
op.getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(op.getInput().getType());
|
|
||||||
}
|
}
|
||||||
|
|
||||||
template <typename TensorReceiveOpTy>
|
static ParseResult parseBlockArgumentList(OpAsmParser& parser, SmallVectorImpl<OpAsmParser::Argument>& arguments) {
|
||||||
static void printTensorReceiveOp(OpAsmPrinter& printer, TensorReceiveOpTy op) {
|
if (parser.parseLParen())
|
||||||
printChannelMetadata(printer, op.getChannelIds(), op.getSourceCoreIds(), op.getTargetCoreIds());
|
|
||||||
printer.printOptionalAttrDict(op->getAttrs(),
|
|
||||||
{op.getChannelIdsAttrName().getValue(),
|
|
||||||
op.getSourceCoreIdsAttrName().getValue(),
|
|
||||||
op.getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(op.getOutput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
static ParseResult parseTensorSendOp(OpAsmParser& parser, OperationState& result) {
|
|
||||||
OpAsmParser::UnresolvedOperand input;
|
|
||||||
Type inputType;
|
|
||||||
SmallVector<int64_t> channelIds;
|
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
|
|
||||||
if (parser.parseOperand(input))
|
|
||||||
return failure();
|
return failure();
|
||||||
|
if (succeeded(parser.parseOptionalRParen()))
|
||||||
|
return success();
|
||||||
|
|
||||||
bool hasMetadata = succeeded(parser.parseOptionalKeyword("channels"));
|
OpAsmParser::Argument argument;
|
||||||
if (hasMetadata) {
|
if (parser.parseArgument(argument))
|
||||||
if (parseCompressedIntegerList(parser, channelIds) || parser.parseKeyword("from")
|
return failure();
|
||||||
|| parseCompressedIntegerList(parser, sourceCoreIds) || parser.parseKeyword("to")
|
arguments.push_back(argument);
|
||||||
|| parseCompressedIntegerList(parser, targetCoreIds))
|
while (succeeded(parser.parseOptionalComma())) {
|
||||||
|
if (parser.parseArgument(argument))
|
||||||
return failure();
|
return failure();
|
||||||
|
arguments.push_back(argument);
|
||||||
}
|
}
|
||||||
|
return parser.parseRParen();
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(inputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (hasMetadata
|
|
||||||
&& (result.attributes.get("channelIds") || result.attributes.get("sourceCoreIds")
|
|
||||||
|| result.attributes.get("targetCoreIds")))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"channel metadata cannot be specified both positionally and in attr-dict");
|
|
||||||
if (hasMetadata) {
|
|
||||||
result.addAttribute("channelIds", getDenseI64ArrayAttr(parser, channelIds));
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
}
|
|
||||||
|
|
||||||
return parser.resolveOperand(input, inputType, result.operands);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
static ParseResult parseTensorReceiveOp(OpAsmParser& parser, OperationState& result) {
|
static void applyBatchRegionArgumentTypes(ArrayRef<Type> inputTypes,
|
||||||
Type outputType;
|
ArrayRef<Type> weightTypes,
|
||||||
SmallVector<int64_t> channelIds;
|
ArrayRef<Type> outputTypes,
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
OpAsmParser::Argument& laneArg,
|
||||||
SmallVector<int32_t> targetCoreIds;
|
SmallVectorImpl<OpAsmParser::Argument>& weightArgs,
|
||||||
|
SmallVectorImpl<OpAsmParser::Argument>& inputArgs,
|
||||||
|
SmallVectorImpl<OpAsmParser::Argument>& outputArgs,
|
||||||
|
SmallVectorImpl<OpAsmParser::Argument>& regionArgs,
|
||||||
|
Builder& builder) {
|
||||||
|
laneArg.type = builder.getIndexType();
|
||||||
|
regionArgs.push_back(laneArg);
|
||||||
|
applyArgumentTypes(weightTypes, weightArgs);
|
||||||
|
llvm::append_range(regionArgs, weightArgs);
|
||||||
|
applyArgumentTypes(inputTypes, inputArgs);
|
||||||
|
applyArgumentTypes(outputTypes, outputArgs);
|
||||||
|
llvm::append_range(regionArgs, inputArgs);
|
||||||
|
llvm::append_range(regionArgs, outputArgs);
|
||||||
|
}
|
||||||
|
|
||||||
bool hasMetadata = succeeded(parser.parseOptionalKeyword("channels"));
|
static void
|
||||||
if (hasMetadata) {
|
printBoundValueList(OpAsmPrinter& printer, ValueRange arguments, ValueRange operands, ListDelimiter delimiter) {
|
||||||
if (parseCompressedIntegerList(parser, channelIds) || parser.parseKeyword("from")
|
printCompressedValueList(printer, arguments, delimiter);
|
||||||
|| parseCompressedIntegerList(parser, sourceCoreIds) || parser.parseKeyword("to")
|
printer << " = ";
|
||||||
|| parseCompressedIntegerList(parser, targetCoreIds))
|
printCompressedValueList(printer, operands, delimiter);
|
||||||
return failure();
|
}
|
||||||
}
|
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(outputType))
|
static ParseResult parseBoundValueList(OpAsmParser& parser,
|
||||||
|
ListDelimiter delimiter,
|
||||||
|
SmallVectorImpl<OpAsmParser::Argument>& arguments,
|
||||||
|
SmallVectorImpl<OpAsmParser::UnresolvedOperand>& operands) {
|
||||||
|
if (parseOpenDelimiter(parser, delimiter))
|
||||||
return failure();
|
return failure();
|
||||||
|
if (succeeded(parseOptionalCloseDelimiter(parser, delimiter))) {
|
||||||
if (hasMetadata
|
if (parser.parseEqual() || parseCompressedOperandList(parser, delimiter, operands))
|
||||||
&& (result.attributes.get("channelIds") || result.attributes.get("sourceCoreIds")
|
return failure();
|
||||||
|| result.attributes.get("targetCoreIds")))
|
return success();
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"channel metadata cannot be specified both positionally and in attr-dict");
|
|
||||||
if (hasMetadata) {
|
|
||||||
result.addAttribute("channelIds", getDenseI64ArrayAttr(parser, channelIds));
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
result.addTypes(outputType);
|
if (parseOneCompressedArgumentEntry(parser, arguments))
|
||||||
|
return failure();
|
||||||
|
while (succeeded(parser.parseOptionalComma()))
|
||||||
|
if (parseOneCompressedArgumentEntry(parser, arguments))
|
||||||
|
return failure();
|
||||||
|
auto parseCloseDelimiter = [&](ListDelimiter currentDelimiter) -> ParseResult {
|
||||||
|
switch (currentDelimiter) {
|
||||||
|
case ListDelimiter::Paren: return parser.parseRParen();
|
||||||
|
case ListDelimiter::Square: return parser.parseRSquare();
|
||||||
|
}
|
||||||
|
llvm_unreachable("unsupported delimiter");
|
||||||
|
};
|
||||||
|
if (parseCloseDelimiter(delimiter) || parser.parseEqual() || parseCompressedOperandList(parser, delimiter, operands))
|
||||||
|
return failure();
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -242,10 +219,28 @@ ParseResult SpatConcatOp::parse(OpAsmParser& parser, OperationState& result) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
void SpatCompute::print(OpAsmPrinter& printer) {
|
void SpatCompute::print(OpAsmPrinter& printer) {
|
||||||
|
SmallVector<Value> weightArgs;
|
||||||
|
weightArgs.reserve(getWeights().size());
|
||||||
|
for (unsigned index = 0; index < getWeights().size(); ++index) {
|
||||||
|
auto weightArg = getWeightArgument(index);
|
||||||
|
if (!weightArg)
|
||||||
|
return printer.printGenericOp(getOperation(), /*printOpName=*/false);
|
||||||
|
weightArgs.push_back(*weightArg);
|
||||||
|
}
|
||||||
|
SmallVector<Value> inputArgs;
|
||||||
|
inputArgs.reserve(getInputs().size());
|
||||||
|
for (unsigned index = 0; index < getInputs().size(); ++index) {
|
||||||
|
auto inputArg = getInputArgument(index);
|
||||||
|
if (!inputArg)
|
||||||
|
return printer.printGenericOp(getOperation(), /*printOpName=*/false);
|
||||||
|
inputArgs.push_back(*inputArg);
|
||||||
|
}
|
||||||
|
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printCompressedValueList(printer, getWeights(), ListDelimiter::Square);
|
printBoundValueList(printer, weightArgs, getWeights(), ListDelimiter::Square);
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printArgumentBindings(printer, getBody().front(), getInputs());
|
printBoundValueList(printer, inputArgs, getInputs(), ListDelimiter::Paren);
|
||||||
|
printer << " crossbarWeights " << collectDistinctCrossbarWeights(getOperation()).size();
|
||||||
|
|
||||||
if (auto coreIdAttr = (*this)->getAttrOfType<IntegerAttr>(onnx_mlir::kCoreIdAttrName))
|
if (auto coreIdAttr = (*this)->getAttrOfType<IntegerAttr>(onnx_mlir::kCoreIdAttrName))
|
||||||
printer << " coreId " << coreIdAttr.getInt();
|
printer << " coreId " << coreIdAttr.getInt();
|
||||||
@@ -264,23 +259,31 @@ void SpatCompute::print(OpAsmPrinter& printer) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
ParseResult SpatCompute::parse(OpAsmParser& parser, OperationState& result) {
|
ParseResult SpatCompute::parse(OpAsmParser& parser, OperationState& result) {
|
||||||
|
SmallVector<OpAsmParser::Argument> weightArgs;
|
||||||
SmallVector<OpAsmParser::Argument> regionArgs;
|
SmallVector<OpAsmParser::Argument> regionArgs;
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> inputs;
|
SmallVector<OpAsmParser::UnresolvedOperand> inputs;
|
||||||
SmallVector<Type> weightTypes;
|
SmallVector<Type> weightTypes;
|
||||||
SmallVector<Type> inputTypes;
|
SmallVector<Type> inputTypes;
|
||||||
SmallVector<Type> outputTypes;
|
SmallVector<Type> outputTypes;
|
||||||
|
int32_t crossbarWeightCount = 0;
|
||||||
int32_t coreId = 0;
|
int32_t coreId = 0;
|
||||||
|
|
||||||
if (parseCompressedOperandList(parser, ListDelimiter::Square, weights))
|
if (parseBoundValueList(parser, ListDelimiter::Square, weightArgs, weights))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
if (parseArgumentBindings(parser, regionArgs, inputs))
|
SmallVector<OpAsmParser::Argument> inputArgs;
|
||||||
|
if (parseBoundValueList(parser, ListDelimiter::Paren, inputArgs, inputs))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
bool hasCrossbarWeightCount = parseOptionalKeywordAlias(parser, "crossbarWeights", "crossbar_weights");
|
||||||
|
if (hasCrossbarWeightCount && parser.parseInteger(crossbarWeightCount))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
bool hasCoreId = parseOptionalKeywordAlias(parser, "coreId", "core_id");
|
bool hasCoreId = parseOptionalKeywordAlias(parser, "coreId", "core_id");
|
||||||
if (hasCoreId && parser.parseInteger(coreId))
|
if (hasCoreId && parser.parseInteger(coreId))
|
||||||
return failure();
|
return failure();
|
||||||
|
(void) crossbarWeightCount;
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
||||||
|| parseCompressedRepeatedList(
|
|| parseCompressedRepeatedList(
|
||||||
@@ -292,9 +295,11 @@ ParseResult SpatCompute::parse(OpAsmParser& parser, OperationState& result) {
|
|||||||
|
|
||||||
if (weights.size() != weightTypes.size())
|
if (weights.size() != weightTypes.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
||||||
|
if (weightArgs.size() != weights.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "number of weight bindings and weight operands must match");
|
||||||
if (inputs.size() != inputTypes.size())
|
if (inputs.size() != inputTypes.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of inputs and input types must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of inputs and input types must match");
|
||||||
if (regionArgs.size() != inputs.size())
|
if (inputArgs.size() != inputs.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of argument bindings and input operands must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of argument bindings and input operands must match");
|
||||||
if (hasCoreId && result.attributes.get(onnx_mlir::kCoreIdAttrName))
|
if (hasCoreId && result.attributes.get(onnx_mlir::kCoreIdAttrName))
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
return parser.emitError(parser.getCurrentLocation(),
|
||||||
@@ -313,19 +318,59 @@ ParseResult SpatCompute::parse(OpAsmParser& parser, OperationState& result) {
|
|||||||
result.addTypes(outputTypes);
|
result.addTypes(outputTypes);
|
||||||
|
|
||||||
Region* body = result.addRegion();
|
Region* body = result.addRegion();
|
||||||
applyArgumentTypes(inputTypes, regionArgs);
|
applyArgumentTypes(weightTypes, weightArgs);
|
||||||
|
applyArgumentTypes(inputTypes, inputArgs);
|
||||||
|
llvm::append_range(regionArgs, weightArgs);
|
||||||
|
llvm::append_range(regionArgs, inputArgs);
|
||||||
return parser.parseRegion(*body, regionArgs);
|
return parser.parseRegion(*body, regionArgs);
|
||||||
}
|
}
|
||||||
|
|
||||||
void SpatComputeBatch::print(OpAsmPrinter& printer) {
|
void SpatComputeBatch::print(OpAsmPrinter& printer) {
|
||||||
printer << " lanes " << getLaneCount() << " ";
|
auto laneArg = getLaneArgument();
|
||||||
size_t weightsPerLane = getLaneCount() > 0 ? getWeights().size() / static_cast<size_t>(getLaneCount()) : 0;
|
SmallVector<Value> weightArgs;
|
||||||
if (getLaneCount() > 1 && hasRepeatedTuple(getWeights(), weightsPerLane))
|
weightArgs.reserve(getWeights().size());
|
||||||
printValueTupleRun(printer, getWeights(), weightsPerLane, ListDelimiter::Square);
|
for (unsigned index = 0; index < getWeights().size(); ++index) {
|
||||||
else
|
auto weightArg = getWeightArgument(index);
|
||||||
printCompressedValueList(printer, getWeights(), ListDelimiter::Square);
|
if (!weightArg)
|
||||||
|
return printer.printGenericOp(getOperation(), /*printOpName=*/false);
|
||||||
|
weightArgs.push_back(*weightArg);
|
||||||
|
}
|
||||||
|
SmallVector<Value> inputArgs;
|
||||||
|
inputArgs.reserve(getInputs().size());
|
||||||
|
for (unsigned index = 0; index < getInputs().size(); ++index) {
|
||||||
|
auto inputArg = getInputArgument(index);
|
||||||
|
if (!inputArg)
|
||||||
|
return printer.printGenericOp(getOperation(), /*printOpName=*/false);
|
||||||
|
inputArgs.push_back(*inputArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
SmallVector<BlockArgument> outputArgs;
|
||||||
|
if (!laneArg)
|
||||||
|
return printer.printGenericOp(getOperation(), /*printOpName=*/false);
|
||||||
|
if (getNumResults() != 0) {
|
||||||
|
outputArgs.reserve(getNumResults());
|
||||||
|
for (unsigned index = 0; index < getNumResults(); ++index) {
|
||||||
|
auto outputArg = getOutputArgument(index);
|
||||||
|
if (!outputArg)
|
||||||
|
return printer.printGenericOp(getOperation(), /*printOpName=*/false);
|
||||||
|
outputArgs.push_back(*outputArg);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printArgumentBindings(printer, getBody().front(), getInputs());
|
printer.printOperand(*laneArg);
|
||||||
|
printer << " = 0 to " << getLaneCount();
|
||||||
|
|
||||||
|
printer << " ";
|
||||||
|
printBoundValueList(printer, weightArgs, getWeights(), ListDelimiter::Square);
|
||||||
|
printer << " ";
|
||||||
|
printBoundValueList(printer, inputArgs, getInputs(), ListDelimiter::Paren);
|
||||||
|
printer << " crossbarWeights " << collectDistinctCrossbarWeights(getOperation()).size();
|
||||||
|
|
||||||
|
if (getNumResults() != 0) {
|
||||||
|
printer << " shared_outs";
|
||||||
|
printBlockArgumentList(printer, outputArgs);
|
||||||
|
}
|
||||||
|
|
||||||
if (auto coreIdsAttr = (*this)->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName)) {
|
if (auto coreIdsAttr = (*this)->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName)) {
|
||||||
printer << " coreIds ";
|
printer << " coreIds ";
|
||||||
@@ -337,10 +382,7 @@ void SpatComputeBatch::print(OpAsmPrinter& printer) {
|
|||||||
{getLaneCountAttrName().getValue(), getOperandSegmentSizesAttrName().getValue(), onnx_mlir::kCoreIdsAttrName});
|
{getLaneCountAttrName().getValue(), getOperandSegmentSizesAttrName().getValue(), onnx_mlir::kCoreIdsAttrName});
|
||||||
|
|
||||||
printer << " : ";
|
printer << " : ";
|
||||||
if (getLaneCount() > 1 && hasRepeatedTuple(TypeRange(getWeights()), weightsPerLane))
|
printCompressedTypeList(printer, TypeRange(getWeights()), ListDelimiter::Square);
|
||||||
printTypeTupleRun(printer, TypeRange(getWeights()), weightsPerLane, ListDelimiter::Square);
|
|
||||||
else
|
|
||||||
printCompressedTypeList(printer, TypeRange(getWeights()), ListDelimiter::Square);
|
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printCompressedTypeList(printer, TypeRange(getInputs()), ListDelimiter::Paren);
|
printCompressedTypeList(printer, TypeRange(getInputs()), ListDelimiter::Paren);
|
||||||
printer << " -> ";
|
printer << " -> ";
|
||||||
@@ -350,27 +392,45 @@ void SpatComputeBatch::print(OpAsmPrinter& printer) {
|
|||||||
}
|
}
|
||||||
|
|
||||||
ParseResult SpatComputeBatch::parse(OpAsmParser& parser, OperationState& result) {
|
ParseResult SpatComputeBatch::parse(OpAsmParser& parser, OperationState& result) {
|
||||||
|
int64_t lowerBound = 0;
|
||||||
int32_t laneCount = 0;
|
int32_t laneCount = 0;
|
||||||
|
OpAsmParser::Argument laneArg;
|
||||||
|
SmallVector<OpAsmParser::Argument> weightArgs;
|
||||||
|
SmallVector<OpAsmParser::Argument> inputArgs;
|
||||||
|
SmallVector<OpAsmParser::Argument> outputArgs;
|
||||||
SmallVector<OpAsmParser::Argument> regionArgs;
|
SmallVector<OpAsmParser::Argument> regionArgs;
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
SmallVector<OpAsmParser::UnresolvedOperand> weights;
|
||||||
SmallVector<OpAsmParser::UnresolvedOperand> inputs;
|
SmallVector<OpAsmParser::UnresolvedOperand> inputs;
|
||||||
SmallVector<Type> weightTypes;
|
SmallVector<Type> weightTypes;
|
||||||
SmallVector<Type> inputTypes;
|
SmallVector<Type> inputTypes;
|
||||||
SmallVector<Type> outputTypes;
|
SmallVector<Type> outputTypes;
|
||||||
|
int32_t crossbarWeightCount = 0;
|
||||||
SmallVector<int32_t> coreIds;
|
SmallVector<int32_t> coreIds;
|
||||||
|
|
||||||
if (parser.parseKeyword("lanes") || parser.parseInteger(laneCount))
|
if (parser.parseArgument(laneArg) || parser.parseEqual() || parser.parseInteger(lowerBound)
|
||||||
|
|| parser.parseKeyword("to") || parser.parseInteger(laneCount))
|
||||||
|
return failure();
|
||||||
|
if (lowerBound != 0)
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "compute_batch currently requires a zero lower bound");
|
||||||
|
|
||||||
|
if (parseBoundValueList(parser, ListDelimiter::Square, weightArgs, weights))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
if (parseCompressedOrTupleOperandList(parser, ListDelimiter::Square, weights))
|
if (parseBoundValueList(parser, ListDelimiter::Paren, inputArgs, inputs))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
if (parseArgumentBindings(parser, regionArgs, inputs))
|
if (succeeded(parser.parseOptionalKeyword("shared_outs")))
|
||||||
|
if (parseBlockArgumentList(parser, outputArgs))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
bool hasCrossbarWeightCount = parseOptionalKeywordAlias(parser, "crossbarWeights", "crossbar_weights");
|
||||||
|
if (hasCrossbarWeightCount && parser.parseInteger(crossbarWeightCount))
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
bool hasCoreIds = parseOptionalKeywordAlias(parser, "coreIds", "core_ids");
|
bool hasCoreIds = parseOptionalKeywordAlias(parser, "coreIds", "core_ids");
|
||||||
if (hasCoreIds && parseCompressedIntegerList(parser, coreIds))
|
if (hasCoreIds && parseCompressedIntegerList(parser, coreIds))
|
||||||
return failure();
|
return failure();
|
||||||
|
(void) crossbarWeightCount;
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon()
|
||||||
|| parseCompressedOrTupleTypeList(parser, ListDelimiter::Square, weightTypes)
|
|| parseCompressedOrTupleTypeList(parser, ListDelimiter::Square, weightTypes)
|
||||||
@@ -381,10 +441,15 @@ ParseResult SpatComputeBatch::parse(OpAsmParser& parser, OperationState& result)
|
|||||||
|
|
||||||
if (weights.size() != weightTypes.size())
|
if (weights.size() != weightTypes.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of weights and weight types must match");
|
||||||
|
if (weightArgs.size() != weights.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(), "number of weight bindings and weight operands must match");
|
||||||
if (inputs.size() != inputTypes.size())
|
if (inputs.size() != inputTypes.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of inputs and input types must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of inputs and input types must match");
|
||||||
if (regionArgs.size() != inputs.size())
|
if (inputArgs.size() != inputs.size())
|
||||||
return parser.emitError(parser.getCurrentLocation(), "number of argument bindings and input operands must match");
|
return parser.emitError(parser.getCurrentLocation(), "number of argument bindings and input operands must match");
|
||||||
|
if (outputArgs.size() != outputTypes.size())
|
||||||
|
return parser.emitError(parser.getCurrentLocation(),
|
||||||
|
"number of shared output bindings and result types must match");
|
||||||
if (hasCoreIds && result.attributes.get(onnx_mlir::kCoreIdsAttrName))
|
if (hasCoreIds && result.attributes.get(onnx_mlir::kCoreIdsAttrName))
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
return parser.emitError(parser.getCurrentLocation(),
|
||||||
"coreIds cannot be specified both positionally and in attr-dict");
|
"coreIds cannot be specified both positionally and in attr-dict");
|
||||||
@@ -403,119 +468,28 @@ ParseResult SpatComputeBatch::parse(OpAsmParser& parser, OperationState& result)
|
|||||||
result.addTypes(outputTypes);
|
result.addTypes(outputTypes);
|
||||||
|
|
||||||
Region* body = result.addRegion();
|
Region* body = result.addRegion();
|
||||||
applyArgumentTypes(inputTypes, regionArgs);
|
applyBatchRegionArgumentTypes(
|
||||||
|
inputTypes, weightTypes, outputTypes, laneArg, weightArgs, inputArgs, outputArgs, regionArgs, parser.getBuilder());
|
||||||
return parser.parseRegion(*body, regionArgs);
|
return parser.parseRegion(*body, regionArgs);
|
||||||
}
|
}
|
||||||
|
|
||||||
void SpatChannelSendTensorOp::print(OpAsmPrinter& printer) { printTensorSendOp(printer, *this); }
|
void SpatInParallelOp::print(OpAsmPrinter& printer) {
|
||||||
|
|
||||||
ParseResult SpatChannelSendTensorOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
return parseTensorSendOp(parser, result);
|
|
||||||
}
|
|
||||||
|
|
||||||
void SpatChannelSendBatchOp::print(OpAsmPrinter& printer) {
|
|
||||||
printer << " ";
|
printer << " ";
|
||||||
printer.printOperand(getInput());
|
printer.printRegion(getRegion(), /*printEntryBlockArgs=*/false, /*printBlockTerminators=*/false);
|
||||||
printChannelMetadata(printer, getChannelIds(), getSourceCoreIds(), getTargetCoreIds());
|
printer.printOptionalAttrDict((*this)->getAttrs());
|
||||||
printer.printOptionalAttrDict(
|
|
||||||
(*this)->getAttrs(),
|
|
||||||
{getChannelIdsAttrName().getValue(), getSourceCoreIdsAttrName().getValue(), getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getInput().getType());
|
|
||||||
}
|
}
|
||||||
|
|
||||||
ParseResult SpatChannelSendBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
ParseResult SpatInParallelOp::parse(OpAsmParser& parser, OperationState& result) {
|
||||||
OpAsmParser::UnresolvedOperand input;
|
auto& builder = parser.getBuilder();
|
||||||
Type inputType;
|
std::unique_ptr<Region> region = std::make_unique<Region>();
|
||||||
SmallVector<int64_t> channelIds;
|
SmallVector<OpAsmParser::Argument, 4> regionArgs;
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
if (parser.parseRegion(*region, regionArgs))
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
|
|
||||||
if (parser.parseOperand(input))
|
|
||||||
return failure();
|
return failure();
|
||||||
|
|
||||||
bool hasMetadata = succeeded(parser.parseOptionalKeyword("channels"));
|
if (region->empty())
|
||||||
if (hasMetadata) {
|
OpBuilder(builder.getContext()).createBlock(region.get());
|
||||||
if (parseCompressedIntegerList(parser, channelIds) || parser.parseKeyword("from")
|
result.addRegion(std::move(region));
|
||||||
|| parseCompressedIntegerList(parser, sourceCoreIds) || parser.parseKeyword("to")
|
return parser.parseOptionalAttrDict(result.attributes);
|
||||||
|| parseCompressedIntegerList(parser, targetCoreIds))
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(inputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (hasMetadata
|
|
||||||
&& (result.attributes.get("channelIds") || result.attributes.get("sourceCoreIds")
|
|
||||||
|| result.attributes.get("targetCoreIds")))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"channel metadata cannot be specified both positionally and in attr-dict");
|
|
||||||
if (hasMetadata) {
|
|
||||||
result.addAttribute("channelIds", getDenseI64ArrayAttr(parser, channelIds));
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
}
|
|
||||||
|
|
||||||
return parser.resolveOperand(input, inputType, result.operands);
|
|
||||||
}
|
|
||||||
|
|
||||||
void SpatChannelSendTensorBatchOp::print(OpAsmPrinter& printer) { printTensorSendOp(printer, *this); }
|
|
||||||
|
|
||||||
ParseResult SpatChannelSendTensorBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
return parseTensorSendOp(parser, result);
|
|
||||||
}
|
|
||||||
|
|
||||||
void SpatChannelReceiveTensorOp::print(OpAsmPrinter& printer) { printTensorReceiveOp(printer, *this); }
|
|
||||||
|
|
||||||
ParseResult SpatChannelReceiveTensorOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
return parseTensorReceiveOp(parser, result);
|
|
||||||
}
|
|
||||||
|
|
||||||
void SpatChannelReceiveBatchOp::print(OpAsmPrinter& printer) {
|
|
||||||
printChannelMetadata(printer, getChannelIds(), getSourceCoreIds(), getTargetCoreIds());
|
|
||||||
printer.printOptionalAttrDict(
|
|
||||||
(*this)->getAttrs(),
|
|
||||||
{getChannelIdsAttrName().getValue(), getSourceCoreIdsAttrName().getValue(), getTargetCoreIdsAttrName().getValue()});
|
|
||||||
printer << " : ";
|
|
||||||
printer.printType(getOutput().getType());
|
|
||||||
}
|
|
||||||
|
|
||||||
ParseResult SpatChannelReceiveBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
Type outputType;
|
|
||||||
SmallVector<int64_t> channelIds;
|
|
||||||
SmallVector<int32_t> sourceCoreIds;
|
|
||||||
SmallVector<int32_t> targetCoreIds;
|
|
||||||
|
|
||||||
bool hasMetadata = succeeded(parser.parseOptionalKeyword("channels"));
|
|
||||||
if (hasMetadata) {
|
|
||||||
if (parseCompressedIntegerList(parser, channelIds) || parser.parseKeyword("from")
|
|
||||||
|| parseCompressedIntegerList(parser, sourceCoreIds) || parser.parseKeyword("to")
|
|
||||||
|| parseCompressedIntegerList(parser, targetCoreIds))
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
|
|
||||||
if (parser.parseOptionalAttrDict(result.attributes) || parser.parseColon() || parser.parseType(outputType))
|
|
||||||
return failure();
|
|
||||||
|
|
||||||
if (hasMetadata
|
|
||||||
&& (result.attributes.get("channelIds") || result.attributes.get("sourceCoreIds")
|
|
||||||
|| result.attributes.get("targetCoreIds")))
|
|
||||||
return parser.emitError(parser.getCurrentLocation(),
|
|
||||||
"channel metadata cannot be specified both positionally and in attr-dict");
|
|
||||||
if (hasMetadata) {
|
|
||||||
result.addAttribute("channelIds", getDenseI64ArrayAttr(parser, channelIds));
|
|
||||||
result.addAttribute("sourceCoreIds", getDenseI32ArrayAttr(parser, sourceCoreIds));
|
|
||||||
result.addAttribute("targetCoreIds", getDenseI32ArrayAttr(parser, targetCoreIds));
|
|
||||||
}
|
|
||||||
|
|
||||||
result.addTypes(outputType);
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
void SpatChannelReceiveTensorBatchOp::print(OpAsmPrinter& printer) { printTensorReceiveOp(printer, *this); }
|
|
||||||
|
|
||||||
ParseResult SpatChannelReceiveTensorBatchOp::parse(OpAsmParser& parser, OperationState& result) {
|
|
||||||
return parseTensorReceiveOp(parser, result);
|
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace spatial
|
} // namespace spatial
|
||||||
|
|||||||
@@ -1,6 +1,11 @@
|
|||||||
|
#include "mlir/Dialect/Affine/IR/AffineOps.h"
|
||||||
|
#include "mlir/Dialect/Arith/IR/Arith.h"
|
||||||
|
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
||||||
|
#include "mlir/IR/AffineExpr.h"
|
||||||
#include "mlir/IR/Block.h"
|
#include "mlir/IR/Block.h"
|
||||||
#include "mlir/IR/BuiltinTypeInterfaces.h"
|
#include "mlir/IR/BuiltinTypeInterfaces.h"
|
||||||
#include "mlir/IR/Diagnostics.h"
|
#include "mlir/IR/Diagnostics.h"
|
||||||
|
#include "mlir/IR/Matchers.h"
|
||||||
#include "mlir/IR/OpDefinition.h"
|
#include "mlir/IR/OpDefinition.h"
|
||||||
#include "mlir/IR/TypeUtilities.h"
|
#include "mlir/IR/TypeUtilities.h"
|
||||||
#include "mlir/Support/LLVM.h"
|
#include "mlir/Support/LLVM.h"
|
||||||
@@ -10,6 +15,7 @@
|
|||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
||||||
|
#include "src/Accelerators/PIM/Conversion/ONNXToSpatial/CompileTime.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Pim/PimOps.hpp"
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
@@ -20,210 +26,204 @@ namespace spatial {
|
|||||||
|
|
||||||
namespace {
|
namespace {
|
||||||
|
|
||||||
inline LogicalResult mvmOpVerifySize2(SpatMVMOp* emitter,
|
static FailureOr<ArrayRef<int64_t>> getWeightShapeForWeightedOp(Value weight) {
|
||||||
ArrayRef<int64_t>& matrixShape,
|
auto shapedType = dyn_cast<ShapedType>(weight.getType());
|
||||||
ArrayRef<int64_t>& vectorShape,
|
if (!shapedType)
|
||||||
ArrayRef<int64_t>& outputShape) {
|
|
||||||
if (matrixShape.size() != 2 || vectorShape.size() != 2 || outputShape.size() != 2)
|
|
||||||
return emitter->emitError("matrix, vector and output must have rank 2");
|
|
||||||
|
|
||||||
int64_t N = matrixShape[0];
|
|
||||||
int64_t M = matrixShape[1];
|
|
||||||
if (N <= 0 || M <= 0)
|
|
||||||
return emitter->emitError("matrix shape must be (N, M) with N > 0 and M > 0");
|
|
||||||
|
|
||||||
int64_t vectorM = vectorShape[0];
|
|
||||||
int64_t vector1 = vectorShape[1];
|
|
||||||
if (vectorM != M || vector1 != 1)
|
|
||||||
return emitter->emitError("vector shape must be (M, 1)");
|
|
||||||
|
|
||||||
int64_t outputN = outputShape[0];
|
|
||||||
int64_t output1 = outputShape[1];
|
|
||||||
if (outputN != N || output1 != 1)
|
|
||||||
return emitter->emitError("output shape must be (N, 1)");
|
|
||||||
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
inline LogicalResult mvmOpVerifySize4(SpatMVMOp* emitter,
|
|
||||||
ArrayRef<int64_t>& matrixShape,
|
|
||||||
ArrayRef<int64_t>& vectorShape,
|
|
||||||
ArrayRef<int64_t>& outputShape) {
|
|
||||||
if (matrixShape.size() != 4 || vectorShape.size() != 4 || outputShape.size() != 4)
|
|
||||||
return emitter->emitError("matrix, vector and output must have rank 4");
|
|
||||||
|
|
||||||
int64_t N = matrixShape[0];
|
|
||||||
int64_t M = matrixShape[1];
|
|
||||||
int64_t matrix1First = matrixShape[2];
|
|
||||||
int64_t matrix1Second = matrixShape[3];
|
|
||||||
if (N <= 0 || M <= 0 || matrix1First != 1 || matrix1Second != 1)
|
|
||||||
return emitter->emitError("matrix shape must be (N, M, 1, 1) with N > 0 and M > 0");
|
|
||||||
|
|
||||||
int64_t vector1First = vectorShape[0];
|
|
||||||
int64_t vectorM = vectorShape[1];
|
|
||||||
int64_t vector1Second = vectorShape[2];
|
|
||||||
int64_t vector1Third = vectorShape[3];
|
|
||||||
if (vector1First != 1 || vectorM != M || vector1Second != 1 || vector1Third != 1) {
|
|
||||||
if (vector1First == 1 && vector1Second == 1 && vector1Third == 1 && ignoreConcatError == true) {
|
|
||||||
// This is ok, it was caused by the simplification of the concat error.
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
return emitter->emitError("vector shape must be (1, M, 1, 1)");
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
int64_t output1First = outputShape[0];
|
|
||||||
int64_t outputN = outputShape[1];
|
|
||||||
int64_t output1Second = outputShape[2];
|
|
||||||
int64_t output1Third = outputShape[3];
|
|
||||||
if (output1First != 1 || outputN != N || output1Second != 1 || output1Third != 1)
|
|
||||||
return emitter->emitError("output shape must be (1, N, 1, 1)");
|
|
||||||
|
|
||||||
return success();
|
|
||||||
}
|
|
||||||
|
|
||||||
static FailureOr<ArrayRef<int64_t>> getWeightShapeForWeightedOp(Operation* weightedOp, size_t weightIndex) {
|
|
||||||
if (auto computeOp = weightedOp->getParentOfType<SpatCompute>())
|
|
||||||
return cast<ShapedType>(computeOp.getWeights()[weightIndex].getType()).getShape();
|
|
||||||
|
|
||||||
if (auto coreOp = weightedOp->getParentOfType<pim::PimCoreOp>())
|
|
||||||
return cast<ShapedType>(coreOp.getWeights()[weightIndex].getType()).getShape();
|
|
||||||
|
|
||||||
if (auto batchOp = weightedOp->getParentOfType<SpatComputeBatch>()) {
|
|
||||||
if (batchOp.getWeights().empty() || weightIndex >= batchOp.getWeights().size())
|
|
||||||
return failure();
|
|
||||||
return cast<ShapedType>(batchOp.getWeights()[weightIndex].getType()).getShape();
|
|
||||||
}
|
|
||||||
|
|
||||||
return failure();
|
|
||||||
}
|
|
||||||
|
|
||||||
static FailureOr<int32_t> getParentBatchLaneCount(Operation* op) {
|
|
||||||
auto batchOp = op->getParentOfType<SpatComputeBatch>();
|
|
||||||
if (!batchOp)
|
|
||||||
return failure();
|
return failure();
|
||||||
return batchOp.getLaneCount();
|
return shapedType.getShape();
|
||||||
}
|
}
|
||||||
|
|
||||||
static LogicalResult verifyTensorChannelSizes(Operation* op,
|
static bool isBatchOutputArgument(SpatComputeBatch batchOp, Value value) {
|
||||||
Type type,
|
if (batchOp.getNumResults() == 0)
|
||||||
ArrayRef<int64_t> channelIds,
|
return false;
|
||||||
ArrayRef<int32_t> sourceCoreIds,
|
auto blockArg = dyn_cast<BlockArgument>(value);
|
||||||
ArrayRef<int32_t> targetCoreIds,
|
if (!blockArg || blockArg.getOwner() != &batchOp.getBody().front())
|
||||||
StringRef kind) {
|
return false;
|
||||||
if (channelIds.size() != sourceCoreIds.size() || channelIds.size() != targetCoreIds.size())
|
|
||||||
return op->emitError("channelIds, sourceCoreIds, and targetCoreIds must have the same length");
|
|
||||||
if (channelIds.empty())
|
|
||||||
return op->emitError() << kind << " must carry at least one chunk";
|
|
||||||
|
|
||||||
auto shapedType = dyn_cast<ShapedType>(type);
|
unsigned argNumber = blockArg.getArgNumber();
|
||||||
if (!shapedType || !shapedType.hasStaticShape())
|
auto firstOutputArg = batchOp.getOutputArgument(0);
|
||||||
return op->emitError() << kind << " requires a static shaped tensor";
|
if (!firstOutputArg)
|
||||||
|
return false;
|
||||||
|
unsigned firstOutputArgNumber = firstOutputArg->getArgNumber();
|
||||||
|
return argNumber >= firstOutputArgNumber && argNumber < firstOutputArgNumber + batchOp.getNumResults();
|
||||||
|
}
|
||||||
|
|
||||||
int64_t elementBits = shapedType.getElementTypeBitWidth();
|
template <typename ComputeOpTy>
|
||||||
if (elementBits <= 0 || elementBits % 8 != 0)
|
static LogicalResult verifyStaticWeights(ComputeOpTy computeOp, StringRef kind) {
|
||||||
return op->emitError() << kind << " requires byte-sized elements";
|
for (Value weight : computeOp.getWeights())
|
||||||
|
if (!isCompileTimeComputable(weight))
|
||||||
int64_t totalBytes = shapedType.getNumElements() * elementBits / 8;
|
return computeOp.emitOpError() << kind << " weights must be statically computed from constants";
|
||||||
if (totalBytes % static_cast<int64_t>(channelIds.size()) != 0)
|
|
||||||
return op->emitError() << kind << " tensor byte size must be divisible by the number of channel ids";
|
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
static LogicalResult verifyBatchChannelSizes(Operation* op,
|
static bool isConstantIndexLike(Value value) {
|
||||||
ArrayRef<int64_t> channelIds,
|
APInt constantValue;
|
||||||
ArrayRef<int32_t> sourceCoreIds,
|
return matchPattern(value, m_ConstantInt(&constantValue));
|
||||||
ArrayRef<int32_t> targetCoreIds) {
|
}
|
||||||
if (channelIds.size() != sourceCoreIds.size() || channelIds.size() != targetCoreIds.size())
|
|
||||||
return op->emitError("channelIds, sourceCoreIds, and targetCoreIds must have the same length");
|
|
||||||
|
|
||||||
auto laneCount = getParentBatchLaneCount(op);
|
static bool isSupportedLaneAffineExpr(AffineExpr expr) {
|
||||||
if (failed(laneCount))
|
switch (expr.getKind()) {
|
||||||
return op->emitError("must be nested inside spat.compute_batch");
|
case AffineExprKind::Constant:
|
||||||
if (channelIds.size() != static_cast<size_t>(*laneCount))
|
case AffineExprKind::DimId: return true;
|
||||||
return op->emitError("channel metadata length must match parent laneCount");
|
case AffineExprKind::SymbolId: return false;
|
||||||
|
case AffineExprKind::Add: {
|
||||||
|
auto binaryExpr = cast<AffineBinaryOpExpr>(expr);
|
||||||
|
return isSupportedLaneAffineExpr(binaryExpr.getLHS()) && isSupportedLaneAffineExpr(binaryExpr.getRHS());
|
||||||
|
}
|
||||||
|
case AffineExprKind::Mul: {
|
||||||
|
auto binaryExpr = cast<AffineBinaryOpExpr>(expr);
|
||||||
|
return (isa<AffineConstantExpr>(binaryExpr.getLHS()) && isSupportedLaneAffineExpr(binaryExpr.getRHS()))
|
||||||
|
|| (isa<AffineConstantExpr>(binaryExpr.getRHS()) && isSupportedLaneAffineExpr(binaryExpr.getLHS()));
|
||||||
|
}
|
||||||
|
case AffineExprKind::FloorDiv:
|
||||||
|
case AffineExprKind::CeilDiv:
|
||||||
|
case AffineExprKind::Mod: {
|
||||||
|
auto binaryExpr = cast<AffineBinaryOpExpr>(expr);
|
||||||
|
return isa<AffineConstantExpr>(binaryExpr.getRHS()) && isSupportedLaneAffineExpr(binaryExpr.getLHS());
|
||||||
|
}
|
||||||
|
}
|
||||||
|
llvm_unreachable("unexpected affine expression kind");
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isSupportedLaneOffsetExpr(Value value, BlockArgument laneArg) {
|
||||||
|
if (value == laneArg || isConstantIndexLike(value))
|
||||||
|
return true;
|
||||||
|
|
||||||
|
auto affineApply = value.getDefiningOp<affine::AffineApplyOp>();
|
||||||
|
if (affineApply) {
|
||||||
|
if (affineApply.getAffineMap().getNumResults() != 1 || affineApply.getAffineMap().getNumSymbols() != 0)
|
||||||
|
return false;
|
||||||
|
if (!llvm::all_of(affineApply.getMapOperands(),
|
||||||
|
[&](Value operand) { return isSupportedLaneOffsetExpr(operand, laneArg); })) {
|
||||||
|
return false;
|
||||||
|
}
|
||||||
|
return isSupportedLaneAffineExpr(affineApply.getAffineMap().getResult(0));
|
||||||
|
}
|
||||||
|
|
||||||
|
auto extractOp = value.getDefiningOp<tensor::ExtractOp>();
|
||||||
|
if (extractOp) {
|
||||||
|
auto constantTensor = extractOp.getTensor().getDefiningOp<arith::ConstantOp>();
|
||||||
|
auto denseAttr = constantTensor ? dyn_cast<DenseIntElementsAttr>(constantTensor.getValue()) : nullptr;
|
||||||
|
if (!denseAttr || denseAttr.getType().getRank() != 1 || extractOp.getIndices().size() != 1)
|
||||||
|
return false;
|
||||||
|
return isSupportedLaneOffsetExpr(extractOp.getIndices().front(), laneArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
auto addOp = value.getDefiningOp<arith::AddIOp>();
|
||||||
|
if (!addOp)
|
||||||
|
return false;
|
||||||
|
return (addOp.getLhs() == laneArg && isConstantIndexLike(addOp.getRhs()))
|
||||||
|
|| (addOp.getRhs() == laneArg && isConstantIndexLike(addOp.getLhs()));
|
||||||
|
}
|
||||||
|
|
||||||
|
static LogicalResult
|
||||||
|
verifyStaticUnitStrideExtractSliceOp(tensor::ExtractSliceOp sliceOp, BlockArgument laneArg, StringRef kind) {
|
||||||
|
auto sourceType = dyn_cast<RankedTensorType>(sliceOp.getSource().getType());
|
||||||
|
auto resultType = dyn_cast<RankedTensorType>(sliceOp.getResult().getType());
|
||||||
|
if (!sourceType || !resultType || !sourceType.hasStaticShape() || !resultType.hasStaticShape())
|
||||||
|
return sliceOp.emitOpError() << kind << " requires static ranked tensor types";
|
||||||
|
if (!sliceOp.hasUnitStride())
|
||||||
|
return sliceOp.emitOpError() << kind << " requires unit strides";
|
||||||
|
|
||||||
|
for (int64_t size : sliceOp.getStaticSizes())
|
||||||
|
if (ShapedType::isDynamic(size))
|
||||||
|
return sliceOp.emitOpError() << kind << " requires static slice sizes";
|
||||||
|
|
||||||
|
auto offsets = sliceOp.getOffsets();
|
||||||
|
for (Value offset : offsets)
|
||||||
|
if (!isSupportedLaneOffsetExpr(offset, laneArg))
|
||||||
|
return sliceOp.emitOpError() << kind << " requires simple lane-dependent offsets";
|
||||||
|
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
static LogicalResult verifyTensorBatchChannelSizes(Operation* op,
|
static LogicalResult verifyStaticUnitStrideParallelInsertSliceOp(tensor::ParallelInsertSliceOp sliceOp,
|
||||||
Type type,
|
BlockArgument laneArg,
|
||||||
ArrayRef<int64_t> channelIds,
|
StringRef kind) {
|
||||||
ArrayRef<int32_t> sourceCoreIds,
|
RankedTensorType sourceType = sliceOp.getSourceType();
|
||||||
ArrayRef<int32_t> targetCoreIds,
|
RankedTensorType destType = sliceOp.getDestType();
|
||||||
StringRef kind) {
|
if (!sourceType.hasStaticShape() || !destType.hasStaticShape())
|
||||||
if (channelIds.size() != sourceCoreIds.size() || channelIds.size() != targetCoreIds.size())
|
return sliceOp.emitOpError() << kind << " requires static ranked tensor types";
|
||||||
return op->emitError("channelIds, sourceCoreIds, and targetCoreIds must have the same length");
|
if (!sliceOp.hasUnitStride())
|
||||||
|
return sliceOp.emitOpError() << kind << " requires unit strides";
|
||||||
|
|
||||||
auto laneCount = getParentBatchLaneCount(op);
|
for (int64_t size : sliceOp.getStaticSizes())
|
||||||
if (failed(laneCount))
|
if (ShapedType::isDynamic(size))
|
||||||
return op->emitError("must be nested inside spat.compute_batch");
|
return sliceOp.emitOpError() << kind << " requires static slice sizes";
|
||||||
if (channelIds.empty() || channelIds.size() % static_cast<size_t>(*laneCount) != 0)
|
|
||||||
return op->emitError() << kind << " channel metadata length must be a positive multiple of parent laneCount";
|
|
||||||
|
|
||||||
auto shapedType = dyn_cast<ShapedType>(type);
|
auto offsets = sliceOp.getOffsets();
|
||||||
if (!shapedType || !shapedType.hasStaticShape())
|
for (Value offset : offsets)
|
||||||
return op->emitError() << kind << " requires a static shaped tensor";
|
if (!isSupportedLaneOffsetExpr(offset, laneArg))
|
||||||
|
return sliceOp.emitOpError() << kind << " requires simple lane-dependent offsets";
|
||||||
int64_t elementBits = shapedType.getElementTypeBitWidth();
|
|
||||||
if (elementBits <= 0 || elementBits % 8 != 0)
|
|
||||||
return op->emitError() << kind << " requires byte-sized elements";
|
|
||||||
|
|
||||||
int64_t chunkCount = static_cast<int64_t>(channelIds.size()) / *laneCount;
|
|
||||||
int64_t totalBytes = shapedType.getNumElements() * elementBits / 8;
|
|
||||||
if (totalBytes % chunkCount != 0)
|
|
||||||
return op->emitError() << kind << " tensor byte size must be divisible by the chunk count per lane";
|
|
||||||
|
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
static LogicalResult verifyBatchBody(Operation* op, Block& block, TypeRange outputTypes, size_t weightsPerLane) {
|
static Region* getParentRegion(Value value) {
|
||||||
auto yieldOp = dyn_cast_or_null<SpatYieldOp>(block.getTerminator());
|
if (auto blockArg = dyn_cast<BlockArgument>(value))
|
||||||
if (!yieldOp)
|
return blockArg.getOwner()->getParent();
|
||||||
return op->emitError("body must terminate with spat.yield");
|
if (Operation* definingOp = value.getDefiningOp())
|
||||||
if (outputTypes.empty()) {
|
return definingOp->getParentRegion();
|
||||||
|
return nullptr;
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isDefinedInsideRegion(Value value, Region& region) {
|
||||||
|
Region* parentRegion = getParentRegion(value);
|
||||||
|
return parentRegion && (®ion == parentRegion || region.isAncestor(parentRegion));
|
||||||
|
}
|
||||||
|
|
||||||
|
static bool isConstantExternalValue(Value value) {
|
||||||
|
Operation* definingOp = value.getDefiningOp();
|
||||||
|
return definingOp && definingOp->hasTrait<OpTrait::ConstantLike>();
|
||||||
|
}
|
||||||
|
|
||||||
|
static LogicalResult verifyOnlyConstantExternalValues(Operation* ownerOp, Region& region, StringRef kind) {
|
||||||
|
bool hasFailure = false;
|
||||||
|
region.walk([&](Operation* op) {
|
||||||
|
for (OpOperand& operand : op->getOpOperands()) {
|
||||||
|
Value value = operand.get();
|
||||||
|
if (isDefinedInsideRegion(value, region) || isConstantExternalValue(value))
|
||||||
|
continue;
|
||||||
|
|
||||||
|
InFlightDiagnostic diagnostic = ownerOp->emitOpError()
|
||||||
|
<< kind << " body may only directly reference external constants";
|
||||||
|
diagnostic.attachNote(op->getLoc())
|
||||||
|
<< "non-constant external operand #" << operand.getOperandNumber() << " is used by " << op->getName();
|
||||||
|
hasFailure = true;
|
||||||
|
}
|
||||||
|
});
|
||||||
|
return success(!hasFailure);
|
||||||
|
}
|
||||||
|
|
||||||
|
static LogicalResult verifyBatchBody(SpatComputeBatch batchOp, Block& block) {
|
||||||
|
if (batchOp.getNumResults() == 0) {
|
||||||
|
auto yieldOp = dyn_cast_or_null<SpatYieldOp>(block.getTerminator());
|
||||||
|
if (!yieldOp)
|
||||||
|
return batchOp.emitError("resultless compute_batch body must terminate with spat.yield");
|
||||||
if (yieldOp.getNumOperands() != 0)
|
if (yieldOp.getNumOperands() != 0)
|
||||||
return op->emitError("body yield must be empty when compute_batch has no results");
|
return batchOp.emitError("resultless compute_batch body yield must be empty");
|
||||||
}
|
}
|
||||||
else {
|
else if (!isa_and_nonnull<SpatInParallelOp>(block.getTerminator())) {
|
||||||
if (yieldOp.getNumOperands() != 1)
|
return batchOp.emitError("resultful compute_batch body must terminate with spat.in_parallel");
|
||||||
return op->emitError("body yield must produce exactly one value");
|
|
||||||
if (yieldOp.getOperand(0).getType() != outputTypes[0])
|
|
||||||
return op->emitError("body yield type must match output type");
|
|
||||||
}
|
}
|
||||||
|
|
||||||
|
auto laneArg = batchOp.getLaneArgument();
|
||||||
|
if (!laneArg)
|
||||||
|
return batchOp.emitError("compute_batch body must have a lane block argument");
|
||||||
for (auto& bodyOp : block) {
|
for (auto& bodyOp : block) {
|
||||||
if (auto wvmm = dyn_cast<SpatVMMOp>(&bodyOp))
|
if (auto extractSlice = dyn_cast<tensor::ExtractSliceOp>(&bodyOp))
|
||||||
if (wvmm.getWeightIndex() < 0 || static_cast<size_t>(wvmm.getWeightIndex()) >= weightsPerLane)
|
if (failed(verifyStaticUnitStrideExtractSliceOp(extractSlice, *laneArg, "tensor.extract_slice")))
|
||||||
return op->emitError("compute_batch body Wvmm weightIndex is out of range for one lane");
|
return failure();
|
||||||
if (auto wmvm = dyn_cast<SpatMVMOp>(&bodyOp))
|
|
||||||
if (wmvm.getWeightIndex() < 0 || static_cast<size_t>(wmvm.getWeightIndex()) >= weightsPerLane)
|
|
||||||
return op->emitError("compute_batch body Wmvm weightIndex is out of range for one lane");
|
|
||||||
}
|
}
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace
|
} // namespace
|
||||||
|
|
||||||
LogicalResult SpatMVMOp::verify() {
|
|
||||||
auto matrixShapeOpt = getWeightShapeForWeightedOp(this->getOperation(), this->getWeightIndex());
|
|
||||||
if (failed(matrixShapeOpt))
|
|
||||||
return emitError("SpatMVMOp was not within a SpatCompute or Core op");
|
|
||||||
auto matrixShape = *matrixShapeOpt;
|
|
||||||
auto vectorShape = getInput().getType().getShape();
|
|
||||||
auto outputShape = getOutput().getType().getShape();
|
|
||||||
|
|
||||||
if (matrixShape.size() == 2)
|
|
||||||
return mvmOpVerifySize2(this, matrixShape, vectorShape, outputShape);
|
|
||||||
if (matrixShape.size() == 4)
|
|
||||||
return mvmOpVerifySize4(this, matrixShape, vectorShape, outputShape);
|
|
||||||
return emitError("matrix rank must be 2 or 4");
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatVMMOp::verify() {
|
LogicalResult SpatVMMOp::verify() {
|
||||||
auto matrixShapeOpt = getWeightShapeForWeightedOp(this->getOperation(), this->getWeightIndex());
|
auto matrixShapeOpt = getWeightShapeForWeightedOp(getWeight());
|
||||||
if (failed(matrixShapeOpt))
|
if (failed(matrixShapeOpt))
|
||||||
return emitError("SpatVMMOp was not within a SpatCompute or Core op");
|
return emitError("weight must be a shaped value");
|
||||||
auto matrixShape = *matrixShapeOpt;
|
auto matrixShape = *matrixShapeOpt;
|
||||||
auto vectorShape = getInput().getType().getShape();
|
auto vectorShape = getInput().getType().getShape();
|
||||||
auto outputShape = getOutput().getType().getShape();
|
auto outputShape = getOutput().getType().getShape();
|
||||||
@@ -347,13 +347,28 @@ LogicalResult verifyComputeResultsUses(Operation* op) {
|
|||||||
return !(op->getParentOfType<SpatCompute>() || op->getParentOfType<SpatComputeBatch>());
|
return !(op->getParentOfType<SpatCompute>() || op->getParentOfType<SpatComputeBatch>());
|
||||||
});
|
});
|
||||||
})) {
|
})) {
|
||||||
return op->emitError("ComputeResult used directly inside another Compute" );
|
return op->emitError("ComputeResult used directly inside another Compute");
|
||||||
}
|
}
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
LogicalResult SpatCompute::verify() {
|
LogicalResult SpatCompute::verify() {
|
||||||
auto& block = getBody().front();
|
auto& block = getBody().front();
|
||||||
|
unsigned expectedArgCount = getWeights().size() + getInputs().size();
|
||||||
|
if (block.getNumArguments() != expectedArgCount)
|
||||||
|
return emitError("compute body must have weight and input block arguments");
|
||||||
|
|
||||||
|
for (auto [weightIndex, weight] : llvm::enumerate(getWeights())) {
|
||||||
|
auto blockArg = getWeightArgument(weightIndex);
|
||||||
|
if (!blockArg || blockArg->getType() != weight.getType())
|
||||||
|
return emitError("compute weight block argument types must match weight operand types exactly");
|
||||||
|
}
|
||||||
|
for (auto [inputIndex, input] : llvm::enumerate(getInputs())) {
|
||||||
|
auto blockArg = getInputArgument(inputIndex);
|
||||||
|
if (!blockArg || blockArg->getType() != input.getType())
|
||||||
|
return emitError("compute input block argument types must match input operand types exactly");
|
||||||
|
}
|
||||||
|
|
||||||
if (block.mightHaveTerminator()) {
|
if (block.mightHaveTerminator()) {
|
||||||
auto yieldOp = dyn_cast_or_null<SpatYieldOp>(block.getTerminator());
|
auto yieldOp = dyn_cast_or_null<SpatYieldOp>(block.getTerminator());
|
||||||
if (!yieldOp)
|
if (!yieldOp)
|
||||||
@@ -386,93 +401,24 @@ LogicalResult SpatCompute::verify() {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
for (auto arg : block.getArguments())
|
for (unsigned inputIndex = 0; inputIndex < getInputs().size(); ++inputIndex)
|
||||||
if (arg.use_empty())
|
if (auto inputArg = getInputArgument(inputIndex); !inputArg || inputArg->use_empty())
|
||||||
return emitError("ComputeOp block argument is not used");
|
return emitError("ComputeOp block argument is not used");
|
||||||
|
if (failed(verifyStaticWeights(*this, "compute")))
|
||||||
|
return failure();
|
||||||
|
if (failed(verifyOnlyConstantExternalValues(this->getOperation(), getBody(), "spat.compute")))
|
||||||
|
return failure();
|
||||||
if (failed(verifyComputeResultsUses(this->getOperation())))
|
if (failed(verifyComputeResultsUses(this->getOperation())))
|
||||||
return failure();
|
return failure();
|
||||||
return success();
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
LogicalResult SpatChannelSendTensorOp::verify() {
|
|
||||||
return verifyTensorChannelSizes(getOperation(),
|
|
||||||
getInput().getType(),
|
|
||||||
getChannelIds(),
|
|
||||||
getSourceCoreIds(),
|
|
||||||
getTargetCoreIds(),
|
|
||||||
"channel_send_tensor");
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatChannelReceiveTensorOp::verify() {
|
|
||||||
return verifyTensorChannelSizes(getOperation(),
|
|
||||||
getOutput().getType(),
|
|
||||||
getChannelIds(),
|
|
||||||
getSourceCoreIds(),
|
|
||||||
getTargetCoreIds(),
|
|
||||||
"channel_receive_tensor");
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatChannelSendBatchOp::verify() {
|
|
||||||
return verifyBatchChannelSizes(getOperation(), getChannelIds(), getSourceCoreIds(), getTargetCoreIds());
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatChannelSendTensorBatchOp::verify() {
|
|
||||||
return verifyTensorBatchChannelSizes(getOperation(),
|
|
||||||
getInput().getType(),
|
|
||||||
getChannelIds(),
|
|
||||||
getSourceCoreIds(),
|
|
||||||
getTargetCoreIds(),
|
|
||||||
"channel_send_tensor_batch");
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatChannelReceiveBatchOp::verify() {
|
|
||||||
return verifyBatchChannelSizes(getOperation(), getChannelIds(), getSourceCoreIds(), getTargetCoreIds());
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatChannelReceiveTensorBatchOp::verify() {
|
|
||||||
return verifyTensorBatchChannelSizes(getOperation(),
|
|
||||||
getOutput().getType(),
|
|
||||||
getChannelIds(),
|
|
||||||
getSourceCoreIds(),
|
|
||||||
getTargetCoreIds(),
|
|
||||||
"channel_receive_tensor_batch");
|
|
||||||
}
|
|
||||||
|
|
||||||
LogicalResult SpatComputeBatch::verify() {
|
LogicalResult SpatComputeBatch::verify() {
|
||||||
int32_t count = getLaneCount();
|
int32_t count = getLaneCount();
|
||||||
if (count <= 0)
|
if (count <= 0)
|
||||||
return emitError("laneCount must be positive");
|
return emitError("laneCount must be positive");
|
||||||
|
|
||||||
auto laneCountSz = static_cast<size_t>(count);
|
auto laneCountSz = static_cast<size_t>(count);
|
||||||
if (getWeights().size() % laneCountSz != 0)
|
|
||||||
return emitError("number of weights must be a multiple of laneCount");
|
|
||||||
|
|
||||||
if (!getInputs().empty() && getInputs().size() != laneCountSz)
|
|
||||||
return emitError("number of inputs must be either 0 or laneCount");
|
|
||||||
if (!getOutputs().empty() && getOutputs().size() != laneCountSz)
|
|
||||||
return emitError("number of outputs must be either 0 or laneCount");
|
|
||||||
|
|
||||||
size_t weightsPerLane = getWeights().size() / laneCountSz;
|
|
||||||
for (size_t weightIndex = 0; weightIndex < weightsPerLane; ++weightIndex) {
|
|
||||||
Type weightType = getWeights()[weightIndex].getType();
|
|
||||||
for (size_t lane = 1; lane < laneCountSz; ++lane)
|
|
||||||
if (getWeights()[lane * weightsPerLane + weightIndex].getType() != weightType)
|
|
||||||
return emitError("corresponding weights across lanes must have the same type");
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!getInputs().empty()) {
|
|
||||||
Type inputType = getInputs()[0].getType();
|
|
||||||
for (Value in : getInputs().drop_front())
|
|
||||||
if (in.getType() != inputType)
|
|
||||||
return emitError("all inputs must have the same type");
|
|
||||||
}
|
|
||||||
|
|
||||||
if (!getOutputs().empty()) {
|
|
||||||
Type outputType = getOutputs()[0].getType();
|
|
||||||
for (Value out : getOutputs().drop_front())
|
|
||||||
if (out.getType() != outputType)
|
|
||||||
return emitError("all outputs must have the same type");
|
|
||||||
}
|
|
||||||
|
|
||||||
if (auto coreIdAttr = (*this)->getAttr(kCoreIdsAttrName)) {
|
if (auto coreIdAttr = (*this)->getAttr(kCoreIdsAttrName)) {
|
||||||
auto coreIdsAttr = dyn_cast<DenseI32ArrayAttr>(coreIdAttr);
|
auto coreIdsAttr = dyn_cast<DenseI32ArrayAttr>(coreIdAttr);
|
||||||
@@ -482,27 +428,72 @@ LogicalResult SpatComputeBatch::verify() {
|
|||||||
return emitError("compute_batch coreIds array length must match laneCount");
|
return emitError("compute_batch coreIds array length must match laneCount");
|
||||||
if (llvm::any_of(coreIdsAttr.asArrayRef(), [](int32_t coreId) { return coreId < 0; }))
|
if (llvm::any_of(coreIdsAttr.asArrayRef(), [](int32_t coreId) { return coreId < 0; }))
|
||||||
return emitError("compute_batch coreIds values must be non-negative");
|
return emitError("compute_batch coreIds values must be non-negative");
|
||||||
llvm::SmallDenseSet<int32_t, 8> seenCoreIds;
|
DenseSet<int32_t> seenCoreIds;
|
||||||
for (int32_t coreId : coreIdsAttr.asArrayRef())
|
for (int32_t coreId : coreIdsAttr.asArrayRef())
|
||||||
if (!seenCoreIds.insert(coreId).second)
|
if (!seenCoreIds.insert(coreId).second)
|
||||||
return emitError("compute_batch coreIds values must be distinct");
|
return emitError("compute_batch coreIds values must be unique");
|
||||||
}
|
}
|
||||||
|
|
||||||
Block& block = getBody().front();
|
Block& block = getBody().front();
|
||||||
if (getInputs().empty()) {
|
if (block.getNumArguments() == 0)
|
||||||
if (block.getNumArguments() != 0)
|
return emitError("compute_batch body must have exactly one lane block argument");
|
||||||
return emitError("compute_batch body must have no block arguments when there are no inputs");
|
unsigned expectedArgCount = 1 + getWeights().size() + getInputs().size() + getNumResults();
|
||||||
|
if (block.getNumArguments() != expectedArgCount)
|
||||||
|
return emitError("compute_batch body block arguments must match lane, weight, input, and output operands/results");
|
||||||
|
auto laneArg = getLaneArgument();
|
||||||
|
if (!laneArg || !laneArg->getType().isIndex())
|
||||||
|
return emitError("compute_batch first block argument must have index type");
|
||||||
|
|
||||||
|
for (auto [weightIndex, weight] : llvm::enumerate(getWeights())) {
|
||||||
|
auto blockArg = getWeightArgument(weightIndex);
|
||||||
|
if (!blockArg || blockArg->getType() != weight.getType())
|
||||||
|
return emitError("compute_batch weight block argument types must match weight operand types exactly");
|
||||||
}
|
}
|
||||||
else {
|
for (auto [inputIndex, input] : llvm::enumerate(getInputs())) {
|
||||||
if (block.getNumArguments() != 1)
|
auto blockArg = getInputArgument(inputIndex);
|
||||||
return emitError("compute_batch body must have exactly one block argument");
|
if (!blockArg || blockArg->getType() != input.getType())
|
||||||
if (block.getArgument(0).getType() != getInputs()[0].getType())
|
return emitError("compute_batch input block argument types must match input operand types exactly");
|
||||||
return emitError("body block argument type must match input type");
|
}
|
||||||
|
for (auto [resultIndex, resultType] : llvm::enumerate(getResultTypes())) {
|
||||||
|
auto blockArg = getOutputArgument(resultIndex);
|
||||||
|
if (!blockArg || blockArg->getType() != resultType)
|
||||||
|
return emitError("compute_batch output block argument types must match result types exactly");
|
||||||
}
|
}
|
||||||
|
|
||||||
if (failed(verifyComputeResultsUses(this->getOperation())))
|
if (failed(verifyComputeResultsUses(this->getOperation())))
|
||||||
return failure();
|
return failure();
|
||||||
return verifyBatchBody(getOperation(), block, getResultTypes(), weightsPerLane);
|
if (failed(verifyStaticWeights(*this, "compute_batch")))
|
||||||
|
return failure();
|
||||||
|
if (failed(verifyOnlyConstantExternalValues(this->getOperation(), getBody(), "spat.compute_batch")))
|
||||||
|
return failure();
|
||||||
|
return verifyBatchBody(*this, block);
|
||||||
|
}
|
||||||
|
|
||||||
|
LogicalResult SpatInParallelOp::verify() {
|
||||||
|
auto batchOp = getOperation()->getParentOfType<SpatComputeBatch>();
|
||||||
|
if (!batchOp)
|
||||||
|
return emitOpError("expected spat.compute_batch parent");
|
||||||
|
if (batchOp.getNumResults() == 0)
|
||||||
|
return emitOpError("requires a resultful spat.compute_batch parent");
|
||||||
|
|
||||||
|
auto laneArg = batchOp.getLaneArgument();
|
||||||
|
if (!laneArg)
|
||||||
|
return emitOpError("expected compute_batch lane block argument");
|
||||||
|
for (Operation& op : getRegion().front().getOperations()) {
|
||||||
|
auto insertSliceOp = dyn_cast<tensor::ParallelInsertSliceOp>(&op);
|
||||||
|
if (!insertSliceOp)
|
||||||
|
return emitOpError("expected only tensor.parallel_insert_slice ops");
|
||||||
|
|
||||||
|
if (failed(verifyStaticUnitStrideParallelInsertSliceOp(insertSliceOp, *laneArg, "tensor.parallel_insert_slice")))
|
||||||
|
return failure();
|
||||||
|
|
||||||
|
MutableOperandRange destinations = insertSliceOp.getUpdatedDestinations();
|
||||||
|
for (OpOperand& destination : destinations)
|
||||||
|
if (!isBatchOutputArgument(batchOp, destination.get()))
|
||||||
|
return op.emitOpError("may only insert into a compute_batch output block argument");
|
||||||
|
}
|
||||||
|
|
||||||
|
return success();
|
||||||
}
|
}
|
||||||
|
|
||||||
} // namespace spatial
|
} // namespace spatial
|
||||||
|
|||||||
@@ -1,20 +0,0 @@
|
|||||||
#include "DCPAnalysis.hpp"
|
|
||||||
#include "../Scheduling/ComputeGraph.hpp"
|
|
||||||
#include "../Scheduling/DcpScheduler.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
namespace spatial {
|
|
||||||
|
|
||||||
DCPAnalysisResult DCPAnalysis::run() {
|
|
||||||
ComputeGraph graph = buildComputeGraph(entryOp);
|
|
||||||
DcpScheduleOptions options;
|
|
||||||
if (coresCount.getValue() > 0)
|
|
||||||
options.processorCount = static_cast<size_t>(coresCount.getValue());
|
|
||||||
options.criticalWindowSize = dcpCriticalWindowSize.getValue();
|
|
||||||
options.allowFallbackForAutoCoreCount = true;
|
|
||||||
return runDcpScheduler(graph, options, entryOp->getContext());
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace spatial
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
@@ -1,28 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/IR/Operation.h"
|
|
||||||
|
|
||||||
#include "../Scheduling/MergeSchedule.hpp"
|
|
||||||
|
|
||||||
namespace onnx_mlir {
|
|
||||||
namespace spatial {
|
|
||||||
using DCPAnalysisResult = MergeScheduleResult;
|
|
||||||
|
|
||||||
struct DCPAnalysis {
|
|
||||||
private:
|
|
||||||
DCPAnalysisResult result;
|
|
||||||
mlir::Operation *entryOp;
|
|
||||||
DCPAnalysisResult run();
|
|
||||||
|
|
||||||
public:
|
|
||||||
DCPAnalysis(mlir::Operation *op)
|
|
||||||
: entryOp(op) {
|
|
||||||
result = run();
|
|
||||||
}
|
|
||||||
DCPAnalysisResult &getResult() { return result; }
|
|
||||||
};
|
|
||||||
|
|
||||||
} // namespace spatial
|
|
||||||
} // namespace onnx_mlir
|
|
||||||
|
|
||||||
using DCPAnalysisResult = onnx_mlir::spatial::DCPAnalysisResult;
|
|
||||||
File diff suppressed because it is too large
Load Diff
@@ -1,178 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "llvm/ADT/ArrayRef.h"
|
|
||||||
#include "llvm/ADT/DenseMap.h"
|
|
||||||
#include "llvm/ADT/DenseSet.h"
|
|
||||||
|
|
||||||
#include <cstdint>
|
|
||||||
#include <list>
|
|
||||||
#include <optional>
|
|
||||||
#include <unordered_map>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "DCPAnalysis.hpp"
|
|
||||||
#include "Task.hpp"
|
|
||||||
#include "Utils.hpp"
|
|
||||||
|
|
||||||
namespace mlir {
|
|
||||||
class MLIRContext;
|
|
||||||
} // namespace mlir
|
|
||||||
|
|
||||||
std::optional<EdgePair> addEdge(TaskDCP* parent, TaskDCP* child, Weight weight, bool isScheduling = false);
|
|
||||||
void removeEdge(TaskDCP* parent, TaskDCP* child, bool isScheduling = false);
|
|
||||||
Weight getTransferCost(TaskDCP* parent, TaskDCP* child);
|
|
||||||
|
|
||||||
class GraphDCP {
|
|
||||||
public:
|
|
||||||
struct CandidateRelations {
|
|
||||||
llvm::DenseSet<TaskDCP*> ancestors;
|
|
||||||
llvm::DenseSet<TaskDCP*> descendants;
|
|
||||||
// descendants ordered by position in the graph's topological order;
|
|
||||||
// iterating this avoids walking non-descendant tail tasks on hot paths.
|
|
||||||
llvm::SmallVector<TaskDCP*, 32> descendantsTopoOrder;
|
|
||||||
};
|
|
||||||
|
|
||||||
struct ScheduledTaskInfo {
|
|
||||||
size_t nodeIndex;
|
|
||||||
Time aest;
|
|
||||||
Time alst;
|
|
||||||
Weight weight;
|
|
||||||
};
|
|
||||||
|
|
||||||
private:
|
|
||||||
using CpuTaskList = std::list<TaskDCP*>;
|
|
||||||
|
|
||||||
struct FindSlot {
|
|
||||||
Time aest;
|
|
||||||
int index;
|
|
||||||
};
|
|
||||||
|
|
||||||
std::vector<TaskDCP> nodes;
|
|
||||||
onnx_mlir::LabeledList<TaskDCP> topologicalOrder;
|
|
||||||
std::vector<uint64_t> taskStructureHashes;
|
|
||||||
std::vector<CpuTaskList> cpuTasks;
|
|
||||||
std::unordered_map<CPU, CrossbarUsage> cpuCrossbarUsage;
|
|
||||||
llvm::DenseMap<CPU, uint64_t> cpuStructureHashes;
|
|
||||||
CPU lastCpu = 0;
|
|
||||||
long long flag = 1;
|
|
||||||
Time dcpl = 0;
|
|
||||||
Time maxCompletion = 0;
|
|
||||||
Time secondMaxCompletion = 0;
|
|
||||||
TaskDCP* maxCompletionTask = nullptr;
|
|
||||||
int maxCpuCount = 1000;
|
|
||||||
mlir::MLIRContext* context = nullptr;
|
|
||||||
|
|
||||||
TaskInsertion insertTaskInCPU(CPU cpu, TaskDCP* task, size_t position);
|
|
||||||
void removeTaskFromCPU(CPU cpu, TaskDCP* task);
|
|
||||||
CpuTaskList& getOrCreateCpuTasks(CPU cpu);
|
|
||||||
const CpuTaskList* findCpuTasks(CPU cpu) const;
|
|
||||||
|
|
||||||
std::vector<TaskDCP*> getRoots();
|
|
||||||
|
|
||||||
long long getUniqueFlag() { return flag++; }
|
|
||||||
|
|
||||||
void initAest();
|
|
||||||
void initAlst();
|
|
||||||
void initTaskStructureHashes();
|
|
||||||
|
|
||||||
Time computeAestOnCpu(TaskDCP* task, CPU cpu);
|
|
||||||
Time computeDcplOnCpu(TaskDCP* task, CPU cpu);
|
|
||||||
Time getDcpl() const { return dcpl; }
|
|
||||||
Time computeTaskAlstOnCpu(TaskDCP* task, CPU cpu, Time scheduleDcpl);
|
|
||||||
void updateAestFromTask(TaskDCP* task);
|
|
||||||
void updateAestFromTaskWithDescendants(TaskDCP* task, const llvm::DenseSet<TaskDCP*>& descendants);
|
|
||||||
void updateAestFromTaskWithDescendants(TaskDCP* task, llvm::ArrayRef<TaskDCP*> descendantsTopoOrder);
|
|
||||||
// Propagates AEST like the overload above but returns early (before touching
|
|
||||||
// the remaining descendants) as soon as a task's completion exceeds
|
|
||||||
// `dcplBudget`, signalling that the new DCPL would exceed the budget.
|
|
||||||
// Returns true iff the full propagation completed without exceeding the
|
|
||||||
// budget. Uses the caller's snapshot to restore AEST on the aborted tail.
|
|
||||||
bool tryUpdateAestWithinBudget(TaskDCP* task, llvm::ArrayRef<TaskDCP*> descendantsTopoOrder, Time dcplBudget);
|
|
||||||
|
|
||||||
// Incrementally refreshes ALST after `task` has been scheduled. Nodes
|
|
||||||
// outside the backward cone (`relations.ancestors` plus `task`) retain
|
|
||||||
// their relative distance to the sink boundary and only absorb the signed
|
|
||||||
// DCPL delta (`newDcpl - oldDcpl`). `task` itself and its ancestors are
|
|
||||||
// recomputed in reverse topological order so that new same-CPU transfer
|
|
||||||
// costs (now zero) and scheduling-edge children are reflected.
|
|
||||||
void updateAlstFromScheduledTask(TaskDCP* task, const CandidateRelations& relations, Time oldDcpl);
|
|
||||||
|
|
||||||
void initTopological();
|
|
||||||
void topologicalMoveAfter(TaskDCP* task, TaskDCP* pivotPoint, TaskInsertion* insertion = nullptr);
|
|
||||||
void topologicalMoveBefore(TaskDCP* task, TaskDCP* pivotPoint, TaskInsertion* insertion = nullptr);
|
|
||||||
|
|
||||||
llvm::DenseMap<TaskDCP*, Time> computeAlst(TaskDCP* task, CPU cpu, const CandidateRelations& relations);
|
|
||||||
size_t getNodeIndex(const TaskDCP* task) const;
|
|
||||||
|
|
||||||
// Returns a compact dedup key for CPU `c` when evaluating `candidate`:
|
|
||||||
// mixes candidateAest, crossbar usage, and the incremental cpu structure
|
|
||||||
// hash into a single uint64_t. Zero heap allocation.
|
|
||||||
uint64_t computeCpuCandidateKey(Time candidateAest, CPU cpu);
|
|
||||||
CandidateRelations selectProcessor(TaskDCP* candidate, bool push);
|
|
||||||
CPU getLastCpu() const { return lastCpu; }
|
|
||||||
void incrementLastCpu() { lastCpu++; }
|
|
||||||
FindSlot findSlot(TaskDCP* candidate, CPU cpu, bool push, const CandidateRelations& relations);
|
|
||||||
FindSlot findSlotWithFixedFinalTime(
|
|
||||||
TaskDCP* candidate, CPU cpu, const CandidateRelations& relations, Time finalTime, Time aestOnCpu);
|
|
||||||
void dumpDot();
|
|
||||||
|
|
||||||
friend TaskInsertion;
|
|
||||||
friend class TaskDCP;
|
|
||||||
|
|
||||||
CrossbarUsage getCpuCrossbarUsage(CPU cpu) const;
|
|
||||||
CrossbarUsage getCpuCrossbarCapacity() const;
|
|
||||||
CrossbarUsage getTaskCrossbarFootprint(const TaskDCP* task) const;
|
|
||||||
void reserveTaskCrossbars(CPU cpu, const TaskDCP* task);
|
|
||||||
void releaseTaskCrossbars(CPU cpu, const TaskDCP* task);
|
|
||||||
bool wouldExhaustCrossbarCapacity(CPU cpu, const TaskDCP* task) const;
|
|
||||||
|
|
||||||
public:
|
|
||||||
void runDcp();
|
|
||||||
GraphDCP(llvm::ArrayRef<onnx_mlir::spatial::SpatCompute> spatComputes, llvm::ArrayRef<IndexedEdge> edges)
|
|
||||||
: nodes(), cpuTasks(), cpuCrossbarUsage() {
|
|
||||||
for (auto spatCompute : spatComputes)
|
|
||||||
nodes.emplace_back(spatCompute);
|
|
||||||
for (auto [start, end, weight] : edges)
|
|
||||||
makeEdge(start, end, weight);
|
|
||||||
}
|
|
||||||
|
|
||||||
GraphDCP(llvm::ArrayRef<Weight> nodeWeights,
|
|
||||||
llvm::ArrayRef<IndexedEdge> edges,
|
|
||||||
llvm::ArrayRef<int64_t> nodeOrderKeys = {},
|
|
||||||
llvm::ArrayRef<CrossbarUsage> nodeCrossbarUsage = {})
|
|
||||||
: nodes(), cpuTasks(), cpuCrossbarUsage() {
|
|
||||||
assert((nodeCrossbarUsage.empty() || nodeCrossbarUsage.size() == nodeWeights.size())
|
|
||||||
&& "synthetic crossbar usage must match synthetic node weights");
|
|
||||||
assert((nodeOrderKeys.empty() || nodeOrderKeys.size() == nodeWeights.size())
|
|
||||||
&& "synthetic node order keys must match synthetic node weights");
|
|
||||||
nodes.reserve(nodeWeights.size());
|
|
||||||
for (auto [index, weight] : llvm::enumerate(nodeWeights))
|
|
||||||
nodes.emplace_back(nodeOrderKeys.empty() ? static_cast<int64_t>(index) : nodeOrderKeys[index],
|
|
||||||
weight,
|
|
||||||
nodeCrossbarUsage.empty() ? 0 : nodeCrossbarUsage[index]);
|
|
||||||
for (auto [start, end, weight] : edges)
|
|
||||||
makeEdge(start, end, weight);
|
|
||||||
}
|
|
||||||
|
|
||||||
DCPAnalysisResult getResult();
|
|
||||||
std::vector<ScheduledTaskInfo> getScheduledTasks(CPU cpu) const;
|
|
||||||
CPU cpuCount() const { return lastCpu; }
|
|
||||||
|
|
||||||
void makeEdge(size_t parentIndex, size_t childIndex, Weight weight) {
|
|
||||||
addEdge(&nodes[parentIndex], &nodes[childIndex], weight);
|
|
||||||
}
|
|
||||||
|
|
||||||
size_t taskInCpu(CPU cpu) { return getOrCreateCpuTasks(cpu).size(); }
|
|
||||||
|
|
||||||
void setMaxCpuCount(int value) { maxCpuCount = value; }
|
|
||||||
int getMaxCpuCount() const { return maxCpuCount; }
|
|
||||||
|
|
||||||
// Total crossbar units allocated across all active CPUs.
|
|
||||||
size_t crossbarsUsed() const;
|
|
||||||
// Maximum crossbar units available across all active CPUs (lastCpu * per-CPU capacity).
|
|
||||||
size_t crossbarsAvailable() const;
|
|
||||||
|
|
||||||
// Optional MLIR context used to drive mlir::parallelFor inside runDcp. If
|
|
||||||
// null the scheduler runs single-threaded (tests use this path).
|
|
||||||
void setContext(mlir::MLIRContext* ctx) { context = ctx; }
|
|
||||||
};
|
|
||||||
@@ -1,154 +0,0 @@
|
|||||||
#include "llvm/Support/FormatVariadic.h"
|
|
||||||
#include "llvm/Support/raw_ostream.h"
|
|
||||||
|
|
||||||
#include <fstream>
|
|
||||||
#include <string>
|
|
||||||
|
|
||||||
#include "GraphDebug.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
|
||||||
|
|
||||||
namespace dcp_graph {
|
|
||||||
|
|
||||||
#ifdef DCP_DEBUG_ENABLED
|
|
||||||
|
|
||||||
DcpProgressLogger::DcpProgressLogger(size_t totalTasks)
|
|
||||||
: logProgress(totalTasks >= 200),
|
|
||||||
totalTasks(totalTasks),
|
|
||||||
startTime(std::chrono::steady_clock::now()),
|
|
||||||
lastProgressPrint(startTime) {}
|
|
||||||
|
|
||||||
std::string DcpProgressLogger::formatDuration(double seconds) {
|
|
||||||
if (seconds < 0)
|
|
||||||
seconds = 0;
|
|
||||||
|
|
||||||
long totalSeconds = static_cast<long>(seconds + 0.5);
|
|
||||||
long hours = totalSeconds / 3600;
|
|
||||||
long minutes = (totalSeconds % 3600) / 60;
|
|
||||||
long secs = totalSeconds % 60;
|
|
||||||
if (hours > 0)
|
|
||||||
return llvm::formatv("{0}:{1:02}:{2:02}", hours, minutes, secs).str();
|
|
||||||
return llvm::formatv("{0}:{1:02}", minutes, secs).str();
|
|
||||||
}
|
|
||||||
|
|
||||||
void DcpProgressLogger::recordFindDuration(double seconds) { findCandidateSeconds += seconds; }
|
|
||||||
void DcpProgressLogger::recordSelectDuration(double seconds) { selectProcessorSeconds += seconds; }
|
|
||||||
void DcpProgressLogger::recordUpdateDuration(double seconds) { updateTimingSeconds += seconds; }
|
|
||||||
void DcpProgressLogger::advanceCompleted(size_t taskCount) { completedTasks += taskCount; }
|
|
||||||
|
|
||||||
void DcpProgressLogger::printStart(size_t readyCount, int maxCpuCount, size_t xbarsCapacity) const {
|
|
||||||
if (!logProgress)
|
|
||||||
return;
|
|
||||||
llvm::errs() << llvm::formatv("[DCP] start tasks={0} ready={1} cpus=0/{2} crossbars=0/{3}\n",
|
|
||||||
totalTasks,
|
|
||||||
readyCount,
|
|
||||||
maxCpuCount,
|
|
||||||
xbarsCapacity);
|
|
||||||
}
|
|
||||||
|
|
||||||
void DcpProgressLogger::maybePrintSlowCandidate(size_t nodeIndex,
|
|
||||||
double elapsedSeconds,
|
|
||||||
size_t readyCount,
|
|
||||||
CPU cpuCount) const {
|
|
||||||
if (!logProgress || elapsedSeconds < 1.0)
|
|
||||||
return;
|
|
||||||
|
|
||||||
llvm::errs() << llvm::formatv("[DCP] slow node={0} elapsed={1} ready={2} cpus={3}\n",
|
|
||||||
nodeIndex,
|
|
||||||
formatDuration(elapsedSeconds),
|
|
||||||
readyCount,
|
|
||||||
cpuCount);
|
|
||||||
}
|
|
||||||
|
|
||||||
void DcpProgressLogger::printProgress(
|
|
||||||
size_t readyCount, CPU cpuCount, int maxCpuCount, size_t xbarsUsed, size_t xbarsAvailable, bool force) {
|
|
||||||
if (!logProgress)
|
|
||||||
return;
|
|
||||||
|
|
||||||
auto now = std::chrono::steady_clock::now();
|
|
||||||
if (!force && now - lastProgressPrint < std::chrono::seconds(1) && completedTasks != totalTasks)
|
|
||||||
return;
|
|
||||||
|
|
||||||
double elapsedSeconds = std::chrono::duration<double>(now - startTime).count();
|
|
||||||
double rate = elapsedSeconds > 0.0 ? static_cast<double>(completedTasks) / elapsedSeconds : 0.0;
|
|
||||||
double etaSeconds = rate > 0.0 ? static_cast<double>(totalTasks - completedTasks) / rate : 0.0;
|
|
||||||
double percent = totalTasks == 0 ? 100.0 : (100.0 * static_cast<double>(completedTasks) / totalTasks);
|
|
||||||
|
|
||||||
bool done = completedTasks == totalTasks;
|
|
||||||
llvm::errs() << llvm::formatv("[DCP] {0}/{1} ({2:F0}%) ready={3} cpus={4}/{5} crossbars={6}/{7} {8}{9}\n",
|
|
||||||
completedTasks,
|
|
||||||
totalTasks,
|
|
||||||
percent,
|
|
||||||
readyCount,
|
|
||||||
cpuCount,
|
|
||||||
maxCpuCount,
|
|
||||||
xbarsUsed,
|
|
||||||
xbarsAvailable,
|
|
||||||
llvm::formatv("elapsed={0}", formatDuration(elapsedSeconds)).str(),
|
|
||||||
done ? "" : llvm::formatv(" eta={0}", formatDuration(etaSeconds)).str());
|
|
||||||
lastProgressPrint = now;
|
|
||||||
}
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
DcpProgressLogger::DcpProgressLogger(size_t) {}
|
|
||||||
void DcpProgressLogger::recordFindDuration(double) {}
|
|
||||||
void DcpProgressLogger::recordSelectDuration(double) {}
|
|
||||||
void DcpProgressLogger::recordUpdateDuration(double) {}
|
|
||||||
void DcpProgressLogger::advanceCompleted(size_t) {}
|
|
||||||
void DcpProgressLogger::printStart(size_t, int, size_t) const {}
|
|
||||||
void DcpProgressLogger::maybePrintSlowCandidate(size_t, double, size_t, CPU) const {}
|
|
||||||
void DcpProgressLogger::printProgress(size_t, CPU, int, size_t, size_t, bool) {}
|
|
||||||
|
|
||||||
#endif
|
|
||||||
|
|
||||||
void dumpGraphDot(const std::vector<TaskDCP>& nodes, const std::vector<std::list<TaskDCP*>>& cpuTasks, CPU lastCpu) {
|
|
||||||
static int dumpIndex = 0;
|
|
||||||
std::string outputDir = onnx_mlir::getOutputDir();
|
|
||||||
if (outputDir.empty())
|
|
||||||
return;
|
|
||||||
|
|
||||||
std::string graphDir = outputDir + "/dcp_graph";
|
|
||||||
onnx_mlir::createDirectory(graphDir);
|
|
||||||
std::fstream file(graphDir + "/graph_" + std::to_string(dumpIndex++) + ".dot", std::ios::out);
|
|
||||||
file << "digraph G {\n";
|
|
||||||
if (!cpuTasks.empty()) {
|
|
||||||
for (CPU cpu = 0; cpu < lastCpu; cpu++) {
|
|
||||||
file << "subgraph cluster_" << cpu << "{\nstyle=filled;\ncolor=lightgrey;\n";
|
|
||||||
size_t cpuIndex = static_cast<size_t>(cpu);
|
|
||||||
if (cpuIndex >= cpuTasks.size()) {
|
|
||||||
file << " }\n";
|
|
||||||
continue;
|
|
||||||
}
|
|
||||||
|
|
||||||
for (auto node : cpuTasks[cpuIndex]) {
|
|
||||||
file << node->Id() << " [label=\"";
|
|
||||||
file << "n:" << node->Id() << "\n";
|
|
||||||
file << "aest:" << node->getAest() << "\n";
|
|
||||||
file << "alst:" << node->getAlst() << "\n";
|
|
||||||
file << "weight:" << node->getWeight() << "\"]\n";
|
|
||||||
}
|
|
||||||
file << " }\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
for (const auto& node : nodes) {
|
|
||||||
file << node.Id() << " [label=\"";
|
|
||||||
file << "n:" << node.Id() << "\n";
|
|
||||||
file << "aest:" << node.getAest() << "\n";
|
|
||||||
file << "alst:" << node.getAlst() << "\n";
|
|
||||||
file << "weight:" << node.getWeight() << "\"]\n";
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
for (const auto& node : nodes)
|
|
||||||
for (const auto& child : node.children) {
|
|
||||||
file << node.Id() << " -> " << child.first->Id();
|
|
||||||
file << " [label=\"" << child.second << "\"]\n";
|
|
||||||
}
|
|
||||||
|
|
||||||
file << "}\n";
|
|
||||||
file.flush();
|
|
||||||
file.close();
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace dcp_graph
|
|
||||||
@@ -1,57 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "llvm/ADT/StringRef.h"
|
|
||||||
|
|
||||||
#include <chrono>
|
|
||||||
#include <list>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "Task.hpp"
|
|
||||||
#include "Utils.hpp"
|
|
||||||
|
|
||||||
// Define DCP_DEBUG_ENABLED locally when debugging DCP progress and per-phase
|
|
||||||
// profiling. In normal builds the logger methods are no-ops and helpers compile
|
|
||||||
// away.
|
|
||||||
#define DCP_DEBUG_ENABLED
|
|
||||||
|
|
||||||
#ifdef DCP_DEBUG_ENABLED
|
|
||||||
#define DCP_DEBUG_IF(...) __VA_ARGS__
|
|
||||||
#else
|
|
||||||
#define DCP_DEBUG_IF(...)
|
|
||||||
#endif
|
|
||||||
|
|
||||||
namespace dcp_graph {
|
|
||||||
|
|
||||||
class DcpProgressLogger {
|
|
||||||
public:
|
|
||||||
explicit DcpProgressLogger(size_t totalTasks);
|
|
||||||
|
|
||||||
void recordFindDuration(double seconds);
|
|
||||||
void recordSelectDuration(double seconds);
|
|
||||||
void recordUpdateDuration(double seconds);
|
|
||||||
void advanceCompleted(size_t taskCount = 1);
|
|
||||||
|
|
||||||
void printStart(size_t readyCount, int maxCpuCount, size_t xbarsCapacity) const;
|
|
||||||
void maybePrintSlowCandidate(size_t nodeIndex, double elapsedSeconds, size_t readyCount, CPU cpuCount) const;
|
|
||||||
void
|
|
||||||
printProgress(size_t readyCount, CPU cpuCount, int maxCpuCount, size_t xbarsUsed, size_t xbarsAvailable, bool force);
|
|
||||||
|
|
||||||
#ifdef DCP_DEBUG_ENABLED
|
|
||||||
|
|
||||||
private:
|
|
||||||
static std::string formatDuration(double seconds);
|
|
||||||
|
|
||||||
bool logProgress = false;
|
|
||||||
size_t totalTasks = 0;
|
|
||||||
size_t completedTasks = 0;
|
|
||||||
std::chrono::steady_clock::time_point startTime;
|
|
||||||
std::chrono::steady_clock::time_point lastProgressPrint;
|
|
||||||
double findCandidateSeconds = 0.0;
|
|
||||||
double selectProcessorSeconds = 0.0;
|
|
||||||
double updateTimingSeconds = 0.0;
|
|
||||||
#endif
|
|
||||||
};
|
|
||||||
|
|
||||||
void dumpGraphDot(const std::vector<TaskDCP>& nodes, const std::vector<std::list<TaskDCP*>>& cpuTasks, CPU lastCpu);
|
|
||||||
|
|
||||||
} // namespace dcp_graph
|
|
||||||
@@ -1,104 +0,0 @@
|
|||||||
#include "llvm/ADT/STLExtras.h"
|
|
||||||
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "GraphSupport.hpp"
|
|
||||||
#include "Task.hpp"
|
|
||||||
#include "UniqueWorklist.hpp"
|
|
||||||
|
|
||||||
namespace dcp_graph {
|
|
||||||
|
|
||||||
llvm::DenseSet<TaskDCP*> collectReachableTasks(TaskDCP* root, bool followParents) {
|
|
||||||
llvm::DenseSet<TaskDCP*> reachable;
|
|
||||||
std::vector<TaskDCP*> worklist;
|
|
||||||
worklist.reserve(32);
|
|
||||||
|
|
||||||
auto enqueueEdges = [&](TaskDCP* task) {
|
|
||||||
const auto& edges = followParents ? task->parents : task->children;
|
|
||||||
for (const auto& edge : edges)
|
|
||||||
if (reachable.insert(edge.first).second)
|
|
||||||
worklist.push_back(edge.first);
|
|
||||||
};
|
|
||||||
|
|
||||||
enqueueEdges(root);
|
|
||||||
while (!worklist.empty()) {
|
|
||||||
TaskDCP* task = worklist.back();
|
|
||||||
worklist.pop_back();
|
|
||||||
enqueueEdges(task);
|
|
||||||
}
|
|
||||||
return reachable;
|
|
||||||
}
|
|
||||||
|
|
||||||
GraphDCP::CandidateRelations computeCandidateRelations(TaskDCP* candidate) {
|
|
||||||
return {collectReachableTasks(candidate, true), collectReachableTasks(candidate, false), {}};
|
|
||||||
}
|
|
||||||
|
|
||||||
LocalScheduleSnapshot captureLocalScheduleState(TaskDCP* task,
|
|
||||||
const llvm::DenseSet<TaskDCP*>& descendants,
|
|
||||||
Time dcpl,
|
|
||||||
Time maxCompletion,
|
|
||||||
Time secondMaxCompletion,
|
|
||||||
TaskDCP* maxCompletionTask) {
|
|
||||||
LocalScheduleSnapshot snapshot;
|
|
||||||
snapshot.aestBackup.reserve(descendants.size() + 1);
|
|
||||||
snapshot.aestBackup.emplace_back(task, task->getAest());
|
|
||||||
for (TaskDCP* descendant : descendants)
|
|
||||||
snapshot.aestBackup.emplace_back(descendant, descendant->getAest());
|
|
||||||
snapshot.dcpl = dcpl;
|
|
||||||
snapshot.maxCompletion = maxCompletion;
|
|
||||||
snapshot.secondMaxCompletion = secondMaxCompletion;
|
|
||||||
snapshot.maxCompletionTask = maxCompletionTask;
|
|
||||||
return snapshot;
|
|
||||||
}
|
|
||||||
|
|
||||||
void restoreLocalScheduleState(const LocalScheduleSnapshot& snapshot,
|
|
||||||
Time& dcpl,
|
|
||||||
Time& maxCompletion,
|
|
||||||
Time& secondMaxCompletion,
|
|
||||||
TaskDCP*& maxCompletionTask) {
|
|
||||||
for (const auto& [task, aest] : snapshot.aestBackup)
|
|
||||||
task->setAest(aest);
|
|
||||||
dcpl = snapshot.dcpl;
|
|
||||||
maxCompletion = snapshot.maxCompletion;
|
|
||||||
secondMaxCompletion = snapshot.secondMaxCompletion;
|
|
||||||
maxCompletionTask = snapshot.maxCompletionTask;
|
|
||||||
}
|
|
||||||
|
|
||||||
int countDependencyParents(const TaskDCP* task) {
|
|
||||||
return static_cast<int>(llvm::count_if(task->parents, [](const Edge& edge) { return !edge.isScheduling; }));
|
|
||||||
}
|
|
||||||
|
|
||||||
void recordTopologicalMove(TaskDCP* task, TaskInsertion* insertion) {
|
|
||||||
if (insertion == nullptr)
|
|
||||||
return;
|
|
||||||
|
|
||||||
auto alreadyRecorded =
|
|
||||||
llvm::any_of(insertion->topologicalMoves,
|
|
||||||
[task](const TaskInsertion::TopologicalMoveRecord& move) { return move.task == task; });
|
|
||||||
if (alreadyRecorded)
|
|
||||||
return;
|
|
||||||
|
|
||||||
insertion->topologicalMoves.push_back({task, onnx_mlir::LabeledList<TaskDCP>::next(task)});
|
|
||||||
}
|
|
||||||
|
|
||||||
std::vector<TaskDCP*> collectDominanceOrder(llvm::ArrayRef<TaskDCP*> roots, size_t nodeCount) {
|
|
||||||
UniqueWorkList<std::vector<TaskDCP*>> worklist(roots);
|
|
||||||
worklist.reserve(nodeCount);
|
|
||||||
|
|
||||||
size_t index = 0;
|
|
||||||
while (index != worklist.size()) {
|
|
||||||
bool modified = true;
|
|
||||||
while (modified) {
|
|
||||||
modified = false;
|
|
||||||
for (const auto& child : worklist.at(index)->children)
|
|
||||||
if (worklist.allElementsContained(
|
|
||||||
child.first->parents.begin(), child.first->parents.end(), [](Edge edge) { return edge.first; }))
|
|
||||||
modified |= worklist.pushBack(child.first);
|
|
||||||
}
|
|
||||||
index++;
|
|
||||||
}
|
|
||||||
|
|
||||||
return {worklist.begin(), worklist.end()};
|
|
||||||
}
|
|
||||||
|
|
||||||
} // namespace dcp_graph
|
|
||||||
@@ -1,41 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "llvm/ADT/ArrayRef.h"
|
|
||||||
#include "llvm/ADT/DenseSet.h"
|
|
||||||
#include "llvm/ADT/SmallVector.h"
|
|
||||||
|
|
||||||
#include <utility>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "Graph.hpp"
|
|
||||||
|
|
||||||
namespace dcp_graph {
|
|
||||||
|
|
||||||
struct LocalScheduleSnapshot {
|
|
||||||
llvm::SmallVector<std::pair<TaskDCP*, Time>, 64> aestBackup;
|
|
||||||
Time dcpl = 0;
|
|
||||||
Time maxCompletion = 0;
|
|
||||||
Time secondMaxCompletion = 0;
|
|
||||||
TaskDCP* maxCompletionTask = nullptr;
|
|
||||||
};
|
|
||||||
|
|
||||||
llvm::DenseSet<TaskDCP*> collectReachableTasks(TaskDCP* root, bool followParents);
|
|
||||||
GraphDCP::CandidateRelations computeCandidateRelations(TaskDCP* candidate);
|
|
||||||
|
|
||||||
LocalScheduleSnapshot captureLocalScheduleState(TaskDCP* task,
|
|
||||||
const llvm::DenseSet<TaskDCP*>& descendants,
|
|
||||||
Time dcpl,
|
|
||||||
Time maxCompletion,
|
|
||||||
Time secondMaxCompletion,
|
|
||||||
TaskDCP* maxCompletionTask);
|
|
||||||
void restoreLocalScheduleState(const LocalScheduleSnapshot& snapshot,
|
|
||||||
Time& dcpl,
|
|
||||||
Time& maxCompletion,
|
|
||||||
Time& secondMaxCompletion,
|
|
||||||
TaskDCP*& maxCompletionTask);
|
|
||||||
|
|
||||||
int countDependencyParents(const TaskDCP* task);
|
|
||||||
void recordTopologicalMove(TaskDCP* task, TaskInsertion* insertion);
|
|
||||||
std::vector<TaskDCP*> collectDominanceOrder(llvm::ArrayRef<TaskDCP*> roots, size_t nodeCount);
|
|
||||||
|
|
||||||
} // namespace dcp_graph
|
|
||||||
@@ -1,66 +0,0 @@
|
|||||||
#include <optional>
|
|
||||||
|
|
||||||
#include "Graph.hpp"
|
|
||||||
#include "Task.hpp"
|
|
||||||
#include "UniqueWorklist.hpp"
|
|
||||||
|
|
||||||
std::optional<Edge> TaskDCP::addChild(TaskDCP* child, Weight weight, bool isScheduling) {
|
|
||||||
std::optional<Edge> oldEdge = std::nullopt;
|
|
||||||
auto foundElement = std::find_if(children.begin(), children.end(), [child, isScheduling](Edge element) {
|
|
||||||
return child == element.first && isScheduling == element.isScheduling;
|
|
||||||
});
|
|
||||||
if (foundElement != children.end()) {
|
|
||||||
oldEdge = *foundElement;
|
|
||||||
fastRemove(children, foundElement);
|
|
||||||
}
|
|
||||||
children.emplace_back(Edge {child, weight, isScheduling});
|
|
||||||
return oldEdge;
|
|
||||||
}
|
|
||||||
|
|
||||||
std::optional<Edge> TaskDCP::addParent(TaskDCP* parent, Weight weight, bool isScheduling) {
|
|
||||||
std::optional<Edge> oldEdge = std::nullopt;
|
|
||||||
auto foundElement = std::find_if(parents.begin(), parents.end(), [parent, isScheduling](Edge element) {
|
|
||||||
return parent == element.first && isScheduling == element.isScheduling;
|
|
||||||
});
|
|
||||||
if (foundElement != parents.end()) {
|
|
||||||
oldEdge = *foundElement;
|
|
||||||
fastRemove(parents, foundElement);
|
|
||||||
}
|
|
||||||
parents.emplace_back(Edge {parent, weight, isScheduling});
|
|
||||||
return oldEdge;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool TaskDCP::hasDescendant(TaskDCP* child) {
|
|
||||||
UniqueWorkList<std::vector<TaskDCP*>> worklist;
|
|
||||||
worklist.reserve(32);
|
|
||||||
worklist.pushBack(this);
|
|
||||||
while (!worklist.empty()) {
|
|
||||||
TaskDCP* task = worklist.back();
|
|
||||||
worklist.popBack();
|
|
||||||
if (task == child)
|
|
||||||
return true;
|
|
||||||
for (auto edge : task->children)
|
|
||||||
worklist.pushBack(edge.first);
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
Weight TaskDCP::computeWeightOnCpu(GraphDCP* graph, CPU cpu) {
|
|
||||||
if (crossbarUsage != 0 && graph->wouldExhaustCrossbarCapacity(cpu, this))
|
|
||||||
return std::numeric_limits<Weight>::max();
|
|
||||||
return baseWeight;
|
|
||||||
}
|
|
||||||
|
|
||||||
void TaskInsertion::rollBack() {
|
|
||||||
graph->removeTaskFromCPU(cpuModified, taskInserted);
|
|
||||||
if (beforeNode.has_value()) {
|
|
||||||
auto edgePair = *beforeNode;
|
|
||||||
addEdge(edgePair.first.first, edgePair.second.first, edgePair.first.second, edgePair.first.isScheduling);
|
|
||||||
}
|
|
||||||
if (afterNode.has_value()) {
|
|
||||||
auto edgePair = *afterNode;
|
|
||||||
addEdge(edgePair.first.first, edgePair.second.first, edgePair.first.second, edgePair.first.isScheduling);
|
|
||||||
}
|
|
||||||
// for (auto it = topologicalMoves.rbegin(); it != topologicalMoves.rend(); ++it)
|
|
||||||
// graph->topologicalOrder.moveBefore(it->task, it->nextTask);
|
|
||||||
}
|
|
||||||
@@ -1,126 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include <cassert>
|
|
||||||
#include <optional>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "Utils.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
|
|
||||||
class TaskDCP : public onnx_mlir::LabeledListNode<TaskDCP> {
|
|
||||||
onnx_mlir::spatial::SpatCompute spatCompute;
|
|
||||||
Time aest;
|
|
||||||
Time alst;
|
|
||||||
std::optional<CPU> scheduledCpu;
|
|
||||||
Weight weight;
|
|
||||||
Weight baseWeight;
|
|
||||||
CrossbarUsage crossbarUsage;
|
|
||||||
long long flag = 0;
|
|
||||||
int64_t syntheticId = -1;
|
|
||||||
|
|
||||||
std::optional<Edge> addChild(TaskDCP* child, Weight weight, bool isScheduling);
|
|
||||||
std::optional<Edge> addChild(TaskDCP& child, Weight weight, bool isScheduling) {
|
|
||||||
return addChild(&child, weight, isScheduling);
|
|
||||||
}
|
|
||||||
|
|
||||||
void removeChild(TaskDCP* toRemove, bool isScheduling) { fastRemove(children, toRemove, isScheduling); }
|
|
||||||
void removeChild(TaskDCP& toRemove, bool isScheduling) { fastRemove(children, &toRemove, isScheduling); }
|
|
||||||
|
|
||||||
std::optional<Edge> addParent(TaskDCP* parent, Weight weight, bool isScheduling);
|
|
||||||
std::optional<Edge> addParent(TaskDCP& parent, Weight weight, bool isScheduling) {
|
|
||||||
return addParent(&parent, weight, isScheduling);
|
|
||||||
}
|
|
||||||
|
|
||||||
void removeParent(TaskDCP* toRemove, bool isScheduling) { fastRemove(parents, toRemove, isScheduling); }
|
|
||||||
void removeParent(TaskDCP& toRemove, bool isScheduling) { fastRemove(parents, &toRemove, isScheduling); }
|
|
||||||
|
|
||||||
public:
|
|
||||||
std::vector<Edge> parents;
|
|
||||||
std::vector<Edge> children;
|
|
||||||
TaskDCP() = default;
|
|
||||||
TaskDCP(onnx_mlir::spatial::SpatCompute spatCompute)
|
|
||||||
: onnx_mlir::LabeledListNode<TaskDCP>(),
|
|
||||||
spatCompute(spatCompute),
|
|
||||||
aest(0),
|
|
||||||
alst(0),
|
|
||||||
scheduledCpu(),
|
|
||||||
weight(getSpatComputeWeight(spatCompute)),
|
|
||||||
baseWeight(weight),
|
|
||||||
crossbarUsage(getSpatComputeCrossbarUsage(spatCompute)),
|
|
||||||
syntheticId(-1),
|
|
||||||
parents(),
|
|
||||||
children() {}
|
|
||||||
|
|
||||||
TaskDCP(int64_t id, Weight weight, CrossbarUsage crossbarUsage = 0)
|
|
||||||
: onnx_mlir::LabeledListNode<TaskDCP>(),
|
|
||||||
spatCompute(),
|
|
||||||
aest(0),
|
|
||||||
alst(0),
|
|
||||||
scheduledCpu(),
|
|
||||||
weight(weight),
|
|
||||||
baseWeight(weight),
|
|
||||||
crossbarUsage(crossbarUsage),
|
|
||||||
flag(0),
|
|
||||||
syntheticId(id),
|
|
||||||
parents(),
|
|
||||||
children() {}
|
|
||||||
|
|
||||||
TaskDCP(const TaskDCP& node) = delete;
|
|
||||||
TaskDCP(TaskDCP&& node) = default;
|
|
||||||
|
|
||||||
void setCpu(CPU cpu) { scheduledCpu = cpu; }
|
|
||||||
std::optional<CPU> getCpu() const { return scheduledCpu; }
|
|
||||||
void resetCpu() { scheduledCpu = std::nullopt; }
|
|
||||||
Weight getWeight() const {
|
|
||||||
if (isScheduled())
|
|
||||||
return weight;
|
|
||||||
return baseWeight;
|
|
||||||
}
|
|
||||||
void setWeight(Weight value) { weight = value; }
|
|
||||||
void resetWeight() { weight = baseWeight; }
|
|
||||||
Weight computeWeightOnCpu(GraphDCP* graph, CPU cpu);
|
|
||||||
CrossbarUsage getCrossbarUsage() const { return crossbarUsage; }
|
|
||||||
|
|
||||||
bool hasParents() const { return parents.size() != 0; }
|
|
||||||
bool hasChildren() const { return children.size() != 0; }
|
|
||||||
|
|
||||||
Time getAest() const { return aest; }
|
|
||||||
Time getAlst() const { return alst; }
|
|
||||||
void setAest(Time value) { aest = value; }
|
|
||||||
void setAlst(Time value) { alst = value; }
|
|
||||||
bool hasDescendant(TaskDCP* child);
|
|
||||||
int64_t Id() const {
|
|
||||||
if (spatCompute)
|
|
||||||
return reinterpret_cast<int64_t>(spatCompute.getAsOpaquePointer());
|
|
||||||
return syntheticId;
|
|
||||||
}
|
|
||||||
|
|
||||||
bool isCriticalPath() const { return alst == aest; }
|
|
||||||
bool isScheduled() const { return scheduledCpu.has_value(); }
|
|
||||||
onnx_mlir::spatial::SpatCompute getSpatCompute() const { return spatCompute; }
|
|
||||||
|
|
||||||
void setFlag(long long val) { flag = val; }
|
|
||||||
long long getFlag() const { return flag; }
|
|
||||||
|
|
||||||
onnx_mlir::LabeledList<TaskDCP>::Iterator getTopologicalIterator() { return getIterator(); }
|
|
||||||
|
|
||||||
friend std::optional<EdgePair> addEdge(TaskDCP* parent, TaskDCP* child, Weight weight, bool isScheduling);
|
|
||||||
friend void removeEdge(TaskDCP* parent, TaskDCP* child, bool isScheduling);
|
|
||||||
friend Weight getTransferCost(TaskDCP* parent, TaskDCP* child);
|
|
||||||
};
|
|
||||||
|
|
||||||
struct TaskInsertion {
|
|
||||||
struct TopologicalMoveRecord {
|
|
||||||
TaskDCP* task;
|
|
||||||
TaskDCP* nextTask;
|
|
||||||
};
|
|
||||||
|
|
||||||
std::optional<EdgePair> beforeNode;
|
|
||||||
std::optional<EdgePair> afterNode;
|
|
||||||
std::vector<TopologicalMoveRecord> topologicalMoves;
|
|
||||||
CPU cpuModified;
|
|
||||||
TaskDCP* taskInserted;
|
|
||||||
GraphDCP* graph;
|
|
||||||
|
|
||||||
void rollBack();
|
|
||||||
};
|
|
||||||
@@ -1,83 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "llvm/ADT/DenseSet.h"
|
|
||||||
|
|
||||||
#include <cassert>
|
|
||||||
#include <type_traits>
|
|
||||||
|
|
||||||
template <typename T, typename = void>
|
|
||||||
struct HasPopFront : std::false_type {};
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
struct HasPopFront<T, std::void_t<decltype(std::declval<T>().pop_front())>> : std::true_type {};
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
class UniqueWorkList {
|
|
||||||
|
|
||||||
using ValueType = typename T::value_type;
|
|
||||||
T storage;
|
|
||||||
llvm::DenseSet<ValueType> uniqueElements;
|
|
||||||
|
|
||||||
public:
|
|
||||||
UniqueWorkList() = default;
|
|
||||||
|
|
||||||
template <typename RangeT>
|
|
||||||
UniqueWorkList(const RangeT& from)
|
|
||||||
: storage() {
|
|
||||||
for (auto& element : from) {
|
|
||||||
if (!uniqueElements.contains(element)) {
|
|
||||||
storage.push_back(element);
|
|
||||||
uniqueElements.insert(element);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
bool empty() const { return storage.empty(); }
|
|
||||||
void reserve(size_t value) { return storage.reserve(value); }
|
|
||||||
size_t size() const { return storage.size(); }
|
|
||||||
ValueType& at(size_t index) { return storage.at(index); }
|
|
||||||
const ValueType& at(size_t index) const { return storage.at(index); }
|
|
||||||
|
|
||||||
ValueType& front() { return storage.front(); }
|
|
||||||
ValueType& back() { return storage.back(); }
|
|
||||||
|
|
||||||
bool pushBack(const ValueType& value) {
|
|
||||||
if (!uniqueElements.contains(value)) {
|
|
||||||
storage.push_back(value);
|
|
||||||
uniqueElements.insert(value);
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
return false;
|
|
||||||
}
|
|
||||||
|
|
||||||
void popFront() {
|
|
||||||
if constexpr (HasPopFront<T>::value)
|
|
||||||
storage.pop_front();
|
|
||||||
else
|
|
||||||
assert(false && "Underlying storage type does not support pop_front()");
|
|
||||||
}
|
|
||||||
|
|
||||||
auto cbegin() const { return storage.cbegin(); }
|
|
||||||
auto cend() const { return storage.cend(); }
|
|
||||||
|
|
||||||
void popBack() { storage.pop_back(); }
|
|
||||||
|
|
||||||
template <typename Iterator, typename Mapper>
|
|
||||||
bool allElementsContained(Iterator begin, Iterator end, Mapper map) const {
|
|
||||||
auto it = begin;
|
|
||||||
while (it != end) {
|
|
||||||
if (!uniqueElements.contains(map(*it)))
|
|
||||||
return false;
|
|
||||||
std::advance(it, 1);
|
|
||||||
}
|
|
||||||
return true;
|
|
||||||
}
|
|
||||||
|
|
||||||
auto begin() { return storage.begin(); }
|
|
||||||
|
|
||||||
auto end() { return storage.end(); }
|
|
||||||
|
|
||||||
auto begin() const { return storage.begin(); }
|
|
||||||
|
|
||||||
auto end() const { return storage.end(); }
|
|
||||||
};
|
|
||||||
@@ -1,111 +0,0 @@
|
|||||||
#pragma once
|
|
||||||
|
|
||||||
#include "mlir/IR/BuiltinTypeInterfaces.h"
|
|
||||||
|
|
||||||
#include "llvm/Support/Casting.h"
|
|
||||||
|
|
||||||
#include <algorithm>
|
|
||||||
#include <cstdint>
|
|
||||||
#include <limits>
|
|
||||||
#include <list>
|
|
||||||
#include <type_traits>
|
|
||||||
#include <utility>
|
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
#include "src/Accelerators/PIM/Common/LabeledList.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
|
||||||
|
|
||||||
using CPU = int;
|
|
||||||
using Weight = unsigned long long;
|
|
||||||
using Time = unsigned long long;
|
|
||||||
using CrossbarUsage = unsigned long long;
|
|
||||||
class TaskDCP;
|
|
||||||
class GraphDCP;
|
|
||||||
struct Edge {
|
|
||||||
TaskDCP* first;
|
|
||||||
Weight second;
|
|
||||||
bool isScheduling = false;
|
|
||||||
};
|
|
||||||
using EdgePair = std::pair<Edge, Edge>;
|
|
||||||
using IndexedEdge = std::tuple<int64_t, int64_t, int64_t>;
|
|
||||||
|
|
||||||
inline void fastRemove(std::vector<Edge>& vector, TaskDCP* toRemove, bool isScheduling) {
|
|
||||||
auto position = std::find_if(vector.begin(), vector.end(), [toRemove, isScheduling](Edge edge) {
|
|
||||||
return edge.first == toRemove && edge.isScheduling == isScheduling;
|
|
||||||
});
|
|
||||||
if (position != vector.end()) {
|
|
||||||
std::swap(*(vector.end() - 1), *position);
|
|
||||||
vector.pop_back();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
inline void fastRemove(std::vector<TaskDCP*>& vector, TaskDCP* toRemove) {
|
|
||||||
auto position =
|
|
||||||
std::find_if(vector.begin(), vector.end(), [toRemove](TaskDCP* element) { return element == toRemove; });
|
|
||||||
if (position != vector.end()) {
|
|
||||||
std::swap(*(vector.end() - 1), *position);
|
|
||||||
vector.pop_back();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename P>
|
|
||||||
void fastRemove(std::vector<Edge>& vector, P position) {
|
|
||||||
if (position != vector.end()) {
|
|
||||||
std::swap(*(vector.end() - 1), *position);
|
|
||||||
vector.pop_back();
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
inline T checkedAdd(T lhs, T rhs) {
|
|
||||||
static_assert(std::is_unsigned_v<T>, "checkedAdd only supports unsigned types");
|
|
||||||
assert(lhs <= std::numeric_limits<T>::max() - rhs && "unsigned addition overflow");
|
|
||||||
return lhs + rhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
inline T checkedMultiply(T lhs, T rhs) {
|
|
||||||
static_assert(std::is_unsigned_v<T>, "checkedMultiply only supports unsigned types");
|
|
||||||
if (lhs == 0 || rhs == 0)
|
|
||||||
return 0;
|
|
||||||
assert(lhs <= std::numeric_limits<T>::max() / rhs && "unsigned multiplication overflow");
|
|
||||||
return lhs * rhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
inline T addOrMax(T lhs, T rhs) {
|
|
||||||
static_assert(std::is_unsigned_v<T>, "addOrMax only supports unsigned types");
|
|
||||||
if (lhs == std::numeric_limits<T>::max() || rhs == std::numeric_limits<T>::max())
|
|
||||||
return std::numeric_limits<T>::max();
|
|
||||||
return checkedAdd(lhs, rhs);
|
|
||||||
}
|
|
||||||
|
|
||||||
template <typename T>
|
|
||||||
inline T subtractOrZero(T lhs, T rhs) {
|
|
||||||
static_assert(std::is_unsigned_v<T>, "subtractOrZero only supports unsigned types");
|
|
||||||
if (lhs == std::numeric_limits<T>::max())
|
|
||||||
return lhs;
|
|
||||||
if (rhs == std::numeric_limits<T>::max() || lhs <= rhs)
|
|
||||||
return 0;
|
|
||||||
return lhs - rhs;
|
|
||||||
}
|
|
||||||
|
|
||||||
inline Time slackOrZero(Time earliestStart, Time latestStart) { return subtractOrZero(latestStart, earliestStart); }
|
|
||||||
|
|
||||||
inline Weight getSpatComputeWeight(onnx_mlir::spatial::SpatCompute spatCompute) {
|
|
||||||
constexpr Weight kOperationWeight = 100;
|
|
||||||
Weight numOperations = 0;
|
|
||||||
for (auto& block : spatCompute.getBody())
|
|
||||||
for ([[maybe_unused]] auto& op : block)
|
|
||||||
numOperations = checkedAdd(numOperations, static_cast<Weight>(1));
|
|
||||||
return checkedMultiply(numOperations, kOperationWeight);
|
|
||||||
}
|
|
||||||
|
|
||||||
inline CrossbarUsage getSpatComputeCrossbarUsage(onnx_mlir::spatial::SpatCompute spatCompute) {
|
|
||||||
CrossbarUsage crossbarUsage = 0;
|
|
||||||
for (auto& region : spatCompute.getBody())
|
|
||||||
for (auto& inst : region)
|
|
||||||
if (llvm::isa<onnx_mlir::spatial::SpatVMMOp>(inst))
|
|
||||||
crossbarUsage = checkedAdd(crossbarUsage, static_cast<CrossbarUsage>(1));
|
|
||||||
return crossbarUsage;
|
|
||||||
}
|
|
||||||
+3627
-535
File diff suppressed because it is too large
Load Diff
@@ -10,8 +10,7 @@ namespace spatial {
|
|||||||
|
|
||||||
class MergeScheduleMaterializer {
|
class MergeScheduleMaterializer {
|
||||||
public:
|
public:
|
||||||
mlir::LogicalResult
|
mlir::LogicalResult run(mlir::func::FuncOp func, const MergeScheduleResult& schedule, int64_t& nextChannelId);
|
||||||
run(mlir::func::FuncOp func, const MergeScheduleResult &schedule, int64_t &nextChannelId);
|
|
||||||
};
|
};
|
||||||
|
|
||||||
} // namespace spatial
|
} // namespace spatial
|
||||||
|
|||||||
@@ -1,8 +1,6 @@
|
|||||||
#include "mlir/Analysis/TopologicalSortUtils.h"
|
#include "mlir/Analysis/TopologicalSortUtils.h"
|
||||||
#include "mlir/Dialect/Arith/IR/Arith.h"
|
|
||||||
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
#include "mlir/Dialect/Func/IR/FuncOps.h"
|
||||||
#include "mlir/Dialect/SCF/IR/SCF.h"
|
#include "mlir/Dialect/SCF/IR/SCF.h"
|
||||||
#include "mlir/Dialect/Tensor/IR/Tensor.h"
|
|
||||||
#include "mlir/IR/IRMapping.h"
|
#include "mlir/IR/IRMapping.h"
|
||||||
#include "mlir/IR/Location.h"
|
#include "mlir/IR/Location.h"
|
||||||
#include "mlir/IR/PatternMatch.h"
|
#include "mlir/IR/PatternMatch.h"
|
||||||
@@ -13,7 +11,6 @@
|
|||||||
#include "mlir/Support/LLVM.h"
|
#include "mlir/Support/LLVM.h"
|
||||||
|
|
||||||
#include "llvm/ADT/DenseMap.h"
|
#include "llvm/ADT/DenseMap.h"
|
||||||
#include "llvm/ADT/DenseSet.h"
|
|
||||||
#include "llvm/ADT/STLExtras.h"
|
#include "llvm/ADT/STLExtras.h"
|
||||||
#include "llvm/ADT/SmallSet.h"
|
#include "llvm/ADT/SmallSet.h"
|
||||||
#include "llvm/ADT/SmallVector.h"
|
#include "llvm/ADT/SmallVector.h"
|
||||||
@@ -28,9 +25,6 @@
|
|||||||
#include <cstdint>
|
#include <cstdint>
|
||||||
#include <cstdlib>
|
#include <cstdlib>
|
||||||
#include <fstream>
|
#include <fstream>
|
||||||
#include <functional>
|
|
||||||
#include <iterator>
|
|
||||||
#include <limits>
|
|
||||||
#include <memory>
|
#include <memory>
|
||||||
#include <optional>
|
#include <optional>
|
||||||
#include <tuple>
|
#include <tuple>
|
||||||
@@ -38,14 +32,12 @@
|
|||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
#include "MaterializeMergeSchedule.hpp"
|
#include "MaterializeMergeSchedule.hpp"
|
||||||
#include "PostMergeCompaction.hpp"
|
#include "Scheduling/ComputeGraph.hpp"
|
||||||
#include "RegularOpCompaction.hpp"
|
|
||||||
#include "Scheduling/ComputeInstanceUtils.hpp"
|
#include "Scheduling/ComputeInstanceUtils.hpp"
|
||||||
#include "Scheduling/MergeSchedulingAnalysis.hpp"
|
#include "Scheduling/MergeSchedulingAnalysis.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/IR/CompactAsmUtils.hpp"
|
#include "src/Accelerators/PIM/Common/IR/CompactAsmUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
#include "src/Accelerators/PIM/Common/PimCommon.hpp"
|
||||||
#include "src/Accelerators/PIM/Common/Support/ReportUtils.hpp"
|
#include "src/Accelerators/PIM/Common/Support/ReportUtils.hpp"
|
||||||
#include "src/Accelerators/PIM/Compiler/PimCompilerOptions.hpp"
|
|
||||||
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
#include "src/Accelerators/PIM/Dialect/Spatial/SpatialOps.hpp"
|
||||||
|
|
||||||
using namespace mlir;
|
using namespace mlir;
|
||||||
@@ -53,10 +45,8 @@ using namespace mlir;
|
|||||||
namespace onnx_mlir {
|
namespace onnx_mlir {
|
||||||
namespace {
|
namespace {
|
||||||
using namespace onnx_mlir::compact_asm;
|
using namespace onnx_mlir::compact_asm;
|
||||||
using ProducerValueRef = spatial::ProducerValueRef;
|
|
||||||
using SpatCompute = spatial::SpatCompute;
|
using SpatCompute = spatial::SpatCompute;
|
||||||
using SpatComputeBatch = spatial::SpatComputeBatch;
|
using SpatComputeBatch = spatial::SpatComputeBatch;
|
||||||
using spatial::getOriginalSpatCompute;
|
|
||||||
using spatial::getProducerValueRef;
|
using spatial::getProducerValueRef;
|
||||||
|
|
||||||
bool isMergeProfilingEnabled() { return std::getenv("RAPTOR_PROFILE_MERGE") != nullptr; }
|
bool isMergeProfilingEnabled() { return std::getenv("RAPTOR_PROFILE_MERGE") != nullptr; }
|
||||||
@@ -64,8 +54,7 @@ bool isMergeProfilingEnabled() { return std::getenv("RAPTOR_PROFILE_MERGE") != n
|
|||||||
class ScopedMergePhaseTimer {
|
class ScopedMergePhaseTimer {
|
||||||
public:
|
public:
|
||||||
explicit ScopedMergePhaseTimer(StringRef phaseName)
|
explicit ScopedMergePhaseTimer(StringRef phaseName)
|
||||||
: enabled(isMergeProfilingEnabled()),
|
: enabled(isMergeProfilingEnabled()), phase(phaseName.str()) {
|
||||||
phase(phaseName.str()) {
|
|
||||||
if (enabled)
|
if (enabled)
|
||||||
start = std::chrono::steady_clock::now();
|
start = std::chrono::steady_clock::now();
|
||||||
}
|
}
|
||||||
@@ -89,8 +78,6 @@ struct MergeIrCounts {
|
|||||||
uint64_t topLevelComputeBatchCount = 0;
|
uint64_t topLevelComputeBatchCount = 0;
|
||||||
uint64_t scalarChannelSendCount = 0;
|
uint64_t scalarChannelSendCount = 0;
|
||||||
uint64_t scalarChannelReceiveCount = 0;
|
uint64_t scalarChannelReceiveCount = 0;
|
||||||
uint64_t tensorChannelSendCount = 0;
|
|
||||||
uint64_t tensorChannelReceiveCount = 0;
|
|
||||||
uint64_t wvmmCount = 0;
|
uint64_t wvmmCount = 0;
|
||||||
uint64_t vaddCount = 0;
|
uint64_t vaddCount = 0;
|
||||||
uint64_t scfForCount = 0;
|
uint64_t scfForCount = 0;
|
||||||
@@ -105,10 +92,6 @@ MergeIrCounts collectMergeIrCounts(func::FuncOp funcOp) {
|
|||||||
++counts.scalarChannelSendCount;
|
++counts.scalarChannelSendCount;
|
||||||
else if (isa<spatial::SpatChannelReceiveOp>(nestedOp))
|
else if (isa<spatial::SpatChannelReceiveOp>(nestedOp))
|
||||||
++counts.scalarChannelReceiveCount;
|
++counts.scalarChannelReceiveCount;
|
||||||
else if (isa<spatial::SpatChannelSendTensorOp, spatial::SpatChannelSendTensorBatchOp>(nestedOp))
|
|
||||||
++counts.tensorChannelSendCount;
|
|
||||||
else if (isa<spatial::SpatChannelReceiveTensorOp, spatial::SpatChannelReceiveTensorBatchOp>(nestedOp))
|
|
||||||
++counts.tensorChannelReceiveCount;
|
|
||||||
else if (isa<spatial::SpatVMMOp>(nestedOp))
|
else if (isa<spatial::SpatVMMOp>(nestedOp))
|
||||||
++counts.wvmmCount;
|
++counts.wvmmCount;
|
||||||
else if (isa<spatial::SpatVAddOp>(nestedOp))
|
else if (isa<spatial::SpatVAddOp>(nestedOp))
|
||||||
@@ -137,14 +120,10 @@ void emitMergeIrCounts(StringRef phaseName, func::FuncOp funcOp) {
|
|||||||
|
|
||||||
MergeIrCounts counts = collectMergeIrCounts(funcOp);
|
MergeIrCounts counts = collectMergeIrCounts(funcOp);
|
||||||
llvm::errs() << "[merge-profile] " << phaseName << " counts:"
|
llvm::errs() << "[merge-profile] " << phaseName << " counts:"
|
||||||
<< " compute=" << counts.topLevelComputeCount
|
<< " compute=" << counts.topLevelComputeCount << " compute_batch=" << counts.topLevelComputeBatchCount
|
||||||
<< " compute_batch=" << counts.topLevelComputeBatchCount
|
|
||||||
<< " scalar_send=" << counts.scalarChannelSendCount
|
<< " scalar_send=" << counts.scalarChannelSendCount
|
||||||
<< " scalar_recv=" << counts.scalarChannelReceiveCount
|
<< " scalar_recv=" << counts.scalarChannelReceiveCount
|
||||||
<< " tensor_send=" << counts.tensorChannelSendCount
|
<< " wvmm=" << counts.wvmmCount << " vadd=" << counts.vaddCount
|
||||||
<< " tensor_recv=" << counts.tensorChannelReceiveCount
|
|
||||||
<< " wvmm=" << counts.wvmmCount
|
|
||||||
<< " vadd=" << counts.vaddCount
|
|
||||||
<< " scf_for=" << counts.scfForCount << "\n";
|
<< " scf_for=" << counts.scfForCount << "\n";
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -156,7 +135,6 @@ static std::optional<int32_t> getComputeCoreId(SpatCompute compute) {
|
|||||||
|
|
||||||
struct ComputeMotifInfo {
|
struct ComputeMotifInfo {
|
||||||
uint64_t instructionCount = 0;
|
uint64_t instructionCount = 0;
|
||||||
uint64_t weightedMvmCount = 0;
|
|
||||||
uint64_t weightedVmmCount = 0;
|
uint64_t weightedVmmCount = 0;
|
||||||
};
|
};
|
||||||
|
|
||||||
@@ -174,21 +152,21 @@ bool isTrivialSerialMergeCandidate(SpatCompute compute) {
|
|||||||
return user && user.getInputs().size() == 1 && use.getOperandNumber() >= user.getWeights().size();
|
return user && user.getInputs().size() == 1 && use.getOperandNumber() >= user.getWeights().size();
|
||||||
}
|
}
|
||||||
|
|
||||||
SmallVector<size_t> appendMissingWeightsAndBuildIndexMap(SpatCompute target, ValueRange sourceWeights) {
|
SmallVector<size_t> appendMissingWeightsAndBuildIndexMap(SmallVectorImpl<Value>& targetWeights,
|
||||||
|
ValueRange sourceWeights) {
|
||||||
DenseMap<Value, SmallVector<size_t, 4>> targetWeightIndices;
|
DenseMap<Value, SmallVector<size_t, 4>> targetWeightIndices;
|
||||||
for (auto [weightIndex, weight] : llvm::enumerate(target.getWeights()))
|
for (auto [weightIndex, weight] : llvm::enumerate(targetWeights))
|
||||||
targetWeightIndices[weight].push_back(weightIndex);
|
targetWeightIndices[weight].push_back(weightIndex);
|
||||||
|
|
||||||
DenseMap<Value, size_t> usedSourceWeightOccurrences;
|
DenseMap<Value, size_t> usedSourceWeightOccurrences;
|
||||||
SmallVector<size_t> sourceToTargetIndex;
|
SmallVector<size_t> sourceToTargetIndex;
|
||||||
sourceToTargetIndex.reserve(sourceWeights.size());
|
sourceToTargetIndex.reserve(sourceWeights.size());
|
||||||
auto targetWeights = target.getWeightsMutable();
|
|
||||||
for (Value weight : sourceWeights) {
|
for (Value weight : sourceWeights) {
|
||||||
size_t occurrence = usedSourceWeightOccurrences[weight]++;
|
size_t occurrence = usedSourceWeightOccurrences[weight]++;
|
||||||
auto& matchingIndices = targetWeightIndices[weight];
|
auto& matchingIndices = targetWeightIndices[weight];
|
||||||
if (occurrence >= matchingIndices.size()) {
|
if (occurrence >= matchingIndices.size()) {
|
||||||
size_t newIndex = target.getWeights().size();
|
size_t newIndex = targetWeights.size();
|
||||||
targetWeights.append(weight);
|
targetWeights.push_back(weight);
|
||||||
matchingIndices.push_back(newIndex);
|
matchingIndices.push_back(newIndex);
|
||||||
sourceToTargetIndex.push_back(newIndex);
|
sourceToTargetIndex.push_back(newIndex);
|
||||||
continue;
|
continue;
|
||||||
@@ -220,37 +198,50 @@ void mergeTriviallyConnectedComputes(func::FuncOp funcOp) {
|
|||||||
auto& computeUse = *compute->getUses().begin();
|
auto& computeUse = *compute->getUses().begin();
|
||||||
auto child = cast<SpatCompute>(computeUse.getOwner());
|
auto child = cast<SpatCompute>(computeUse.getOwner());
|
||||||
auto usedResult = cast<OpResult>(computeUse.get()).getResultNumber();
|
auto usedResult = cast<OpResult>(computeUse.get()).getResultNumber();
|
||||||
auto childArgIndex = computeUse.getOperandNumber() - child.getWeights().size();
|
auto childInputIndex = computeUse.getOperandNumber() - child.getWeights().size();
|
||||||
|
|
||||||
rewriter.setInsertionPointAfter(compute.getOperation());
|
rewriter.setInsertionPointAfter(compute.getOperation());
|
||||||
auto newCompute = SpatCompute::create(rewriter, loc, child.getResultTypes(), compute.getOperands());
|
SmallVector<Value> mergedWeights(compute.getWeights().begin(), compute.getWeights().end());
|
||||||
newCompute.getProperties().setOperandSegmentSizes(
|
SmallVector<size_t> childWeightToNewIndex = appendMissingWeightsAndBuildIndexMap(mergedWeights, child.getWeights());
|
||||||
{static_cast<int>(compute.getWeights().size()), static_cast<int>(compute.getInputs().size())});
|
SmallVector<Value> mergedInputs(compute.getInputs().begin(), compute.getInputs().end());
|
||||||
|
auto newCompute = SpatCompute::create(rewriter, loc, child.getResultTypes(), mergedWeights, mergedInputs);
|
||||||
|
Block* newBody = rewriter.createBlock(&newCompute.getBodyRegion());
|
||||||
|
for (Value weight : mergedWeights)
|
||||||
|
newBody->addArgument(weight.getType(), loc);
|
||||||
|
for (Value input : mergedInputs)
|
||||||
|
newBody->addArgument(input.getType(), loc);
|
||||||
|
|
||||||
IRMapping mapper;
|
IRMapping mapper;
|
||||||
SmallVector<size_t> childWeightToNewIndex = appendMissingWeightsAndBuildIndexMap(newCompute, child.getWeights());
|
for (auto [weightIndex, _] : llvm::enumerate(compute.getWeights())) {
|
||||||
for (auto [oldIndex, weight] : llvm::enumerate(child.getWeights()))
|
auto oldWeightArg = compute.getWeightArgument(weightIndex);
|
||||||
mapper.map(weight, *std::next(newCompute.getWeights().begin(), childWeightToNewIndex[oldIndex]));
|
auto newWeightArg = newCompute.getWeightArgument(weightIndex);
|
||||||
|
assert(oldWeightArg && newWeightArg && "expected compute weight block arguments");
|
||||||
compute.getBodyRegion().cloneInto(&newCompute.getBodyRegion(), mapper);
|
mapper.map(*oldWeightArg, *newWeightArg);
|
||||||
auto newTerminator = newCompute.getBody().front().getTerminator();
|
|
||||||
mapper.map(child.getBody().front().getArgument(childArgIndex), newTerminator->getOperand(usedResult));
|
|
||||||
newTerminator->erase();
|
|
||||||
|
|
||||||
rewriter.setInsertionPoint(&newCompute.getBody().front(), newCompute.getBody().front().end());
|
|
||||||
auto remapWeightIndex = [&](auto weightedOp) {
|
|
||||||
auto oldIndex = weightedOp.getWeightIndex();
|
|
||||||
assert(static_cast<size_t>(oldIndex) < childWeightToNewIndex.size() && "weight index out of range");
|
|
||||||
weightedOp.setWeightIndex(childWeightToNewIndex[oldIndex]);
|
|
||||||
};
|
|
||||||
|
|
||||||
for (auto& op : child.getBody().front()) {
|
|
||||||
auto newInst = rewriter.clone(op, mapper);
|
|
||||||
if (auto weightedMvmOp = dyn_cast<spatial::SpatMVMOp>(newInst))
|
|
||||||
remapWeightIndex(weightedMvmOp);
|
|
||||||
if (auto weightedVmmOp = dyn_cast<spatial::SpatVMMOp>(newInst))
|
|
||||||
remapWeightIndex(weightedVmmOp);
|
|
||||||
}
|
}
|
||||||
|
for (auto [inputIndex, _] : llvm::enumerate(compute.getInputs())) {
|
||||||
|
auto oldInputArg = compute.getInputArgument(inputIndex);
|
||||||
|
auto newInputArg = newCompute.getInputArgument(inputIndex);
|
||||||
|
assert(oldInputArg && newInputArg && "expected compute input block arguments");
|
||||||
|
mapper.map(*oldInputArg, *newInputArg);
|
||||||
|
}
|
||||||
|
for (auto [oldIndex, weight] : llvm::enumerate(child.getWeights())) {
|
||||||
|
auto oldWeightArg = child.getWeightArgument(oldIndex);
|
||||||
|
auto newWeightArg = newCompute.getWeightArgument(childWeightToNewIndex[oldIndex]);
|
||||||
|
assert(oldWeightArg && newWeightArg && "expected child compute weight block arguments");
|
||||||
|
mapper.map(*oldWeightArg, *newWeightArg);
|
||||||
|
}
|
||||||
|
|
||||||
|
rewriter.setInsertionPointToEnd(newBody);
|
||||||
|
auto computeYield = cast<spatial::SpatYieldOp>(compute.getBody().front().getTerminator());
|
||||||
|
for (Operation& op : compute.getBody().front().without_terminator())
|
||||||
|
rewriter.clone(op, mapper);
|
||||||
|
auto childInputArg = child.getInputArgument(childInputIndex);
|
||||||
|
assert(childInputArg && "expected child compute input block argument");
|
||||||
|
mapper.map(*childInputArg, mapper.lookupOrDefault(computeYield.getOperand(usedResult)));
|
||||||
|
|
||||||
|
rewriter.setInsertionPointToEnd(newBody);
|
||||||
|
for (auto& op : child.getBody().front())
|
||||||
|
rewriter.clone(op, mapper);
|
||||||
|
|
||||||
child.replaceAllUsesWith(newCompute);
|
child.replaceAllUsesWith(newCompute);
|
||||||
toErase.insert(child);
|
toErase.insert(child);
|
||||||
@@ -290,20 +281,15 @@ void emitMotifProfile(func::FuncOp funcOp) {
|
|||||||
|
|
||||||
for (auto [index, compute] : llvm::enumerate(computes)) {
|
for (auto [index, compute] : llvm::enumerate(computes)) {
|
||||||
ComputeMotifInfo& info = computeInfos[index];
|
ComputeMotifInfo& info = computeInfos[index];
|
||||||
for (Operation& op : compute.getBody().front()) {
|
info.instructionCount = spatial::countComputeBodyInstructions(compute.getBody());
|
||||||
info.instructionCount++;
|
compute.getBody().walk([&](spatial::SpatVMMOp) { info.weightedVmmCount++; });
|
||||||
if (isa<spatial::SpatMVMOp>(&op))
|
|
||||||
info.weightedMvmCount++;
|
|
||||||
if (isa<spatial::SpatVMMOp>(&op))
|
|
||||||
info.weightedVmmCount++;
|
|
||||||
}
|
|
||||||
if (info.weightedVmmCount > 0) {
|
if (info.weightedVmmCount > 0) {
|
||||||
weightedVmmNodeCount++;
|
weightedVmmNodeCount++;
|
||||||
weightedVmmOpCount += info.weightedVmmCount;
|
weightedVmmOpCount += info.weightedVmmCount;
|
||||||
}
|
}
|
||||||
|
|
||||||
for (Value input : compute.getInputs()) {
|
for (Value input : compute.getInputs()) {
|
||||||
auto parent = getOriginalSpatCompute(input.getDefiningOp());
|
auto parent = dyn_cast<SpatCompute>(input.getDefiningOp());
|
||||||
if (!parent || parent == compute)
|
if (!parent || parent == compute)
|
||||||
continue;
|
continue;
|
||||||
auto parentIt = computeToIndex.find(parent);
|
auto parentIt = computeToIndex.find(parent);
|
||||||
@@ -407,7 +393,7 @@ void emitMotifProfile(func::FuncOp funcOp) {
|
|||||||
wideWeightedVmmLevels256 += count >= 256;
|
wideWeightedVmmLevels256 += count >= 256;
|
||||||
}
|
}
|
||||||
|
|
||||||
using ShapeKey = std::tuple<uint64_t, uint64_t, uint64_t, uint64_t, uint64_t, uint64_t, uint64_t>;
|
using ShapeKey = std::tuple<uint64_t, uint64_t, uint64_t, uint64_t, uint64_t, uint64_t>;
|
||||||
SmallVector<ShapeKey> weightedVmmShapeKeys;
|
SmallVector<ShapeKey> weightedVmmShapeKeys;
|
||||||
for (auto [index, compute] : llvm::enumerate(computes)) {
|
for (auto [index, compute] : llvm::enumerate(computes)) {
|
||||||
const ComputeMotifInfo& info = computeInfos[index];
|
const ComputeMotifInfo& info = computeInfos[index];
|
||||||
@@ -415,7 +401,6 @@ void emitMotifProfile(func::FuncOp funcOp) {
|
|||||||
continue;
|
continue;
|
||||||
weightedVmmShapeKeys.push_back({info.instructionCount,
|
weightedVmmShapeKeys.push_back({info.instructionCount,
|
||||||
info.weightedVmmCount,
|
info.weightedVmmCount,
|
||||||
info.weightedMvmCount,
|
|
||||||
static_cast<uint64_t>(compute.getWeights().size()),
|
static_cast<uint64_t>(compute.getWeights().size()),
|
||||||
static_cast<uint64_t>(compute.getInputs().size()),
|
static_cast<uint64_t>(compute.getInputs().size()),
|
||||||
static_cast<uint64_t>(parents[index].size()),
|
static_cast<uint64_t>(parents[index].size()),
|
||||||
@@ -468,14 +453,13 @@ void emitMotifProfile(func::FuncOp funcOp) {
|
|||||||
|
|
||||||
for (size_t rank = 0, end = std::min<size_t>(weightedVmmShapeCounts.size(), 5); rank < end; ++rank) {
|
for (size_t rank = 0, end = std::min<size_t>(weightedVmmShapeCounts.size(), 5); rank < end; ++rank) {
|
||||||
auto [count, shape] = weightedVmmShapeCounts[rank];
|
auto [count, shape] = weightedVmmShapeCounts[rank];
|
||||||
auto [insts, vmmOps, mvmOps, weights, inputs, fanIn, fanOut] = shape;
|
auto [insts, vmmOps, weights, inputs, fanIn, fanOut] = shape;
|
||||||
llvm::errs() << llvm::formatv("[DCP-MOTIF] wvmmShape rank={0} count={1} insts={2} vmmOps={3} "
|
llvm::errs() << llvm::formatv("[DCP-MOTIF] wvmmShape rank={0} count={1} insts={2} vmmOps={3} "
|
||||||
"mvmOps={4} weights={5} inputs={6} fanIn={7} fanOut={8}\n",
|
"weights={4} inputs={5} fanIn={6} fanOut={7}\n",
|
||||||
rank,
|
rank,
|
||||||
count,
|
count,
|
||||||
insts,
|
insts,
|
||||||
vmmOps,
|
vmmOps,
|
||||||
mvmOps,
|
|
||||||
weights,
|
weights,
|
||||||
inputs,
|
inputs,
|
||||||
fanIn,
|
fanIn,
|
||||||
@@ -492,7 +476,7 @@ void generateReport(func::FuncOp funcOp, const std::string& name, size_t usedCpu
|
|||||||
struct ReportRow {
|
struct ReportRow {
|
||||||
uint64_t id = 0;
|
uint64_t id = 0;
|
||||||
uint64_t logicalComputeCount = 0;
|
uint64_t logicalComputeCount = 0;
|
||||||
uint64_t weightCount = 0;
|
uint64_t crossbarCount = 0;
|
||||||
uint64_t instructionCount = 0;
|
uint64_t instructionCount = 0;
|
||||||
bool isRebatched = false;
|
bool isRebatched = false;
|
||||||
SmallVector<int32_t> coreIds;
|
SmallVector<int32_t> coreIds;
|
||||||
@@ -502,38 +486,40 @@ void generateReport(func::FuncOp funcOp, const std::string& name, size_t usedCpu
|
|||||||
uint64_t totalLogicalComputes = 0;
|
uint64_t totalLogicalComputes = 0;
|
||||||
uint64_t totalBatchComputeOps = 0;
|
uint64_t totalBatchComputeOps = 0;
|
||||||
uint64_t totalInstructionCount = 0;
|
uint64_t totalInstructionCount = 0;
|
||||||
uint64_t totalWeightCount = 0;
|
uint64_t totalCrossbarCount = 0;
|
||||||
uint64_t nextBatchId = 0;
|
uint64_t nextBatchId = 0;
|
||||||
std::vector<ReportRow> collectedData;
|
std::vector<ReportRow> collectedData;
|
||||||
|
|
||||||
|
auto getPerInstanceCrossbarCount = [&](Operation* op) -> uint64_t {
|
||||||
|
return static_cast<uint64_t>(spatial::collectDistinctCrossbarWeights(op).size());
|
||||||
|
};
|
||||||
|
|
||||||
for (Operation& op : funcOp.getBody().front()) {
|
for (Operation& op : funcOp.getBody().front()) {
|
||||||
if (auto spatCompute = dyn_cast<SpatCompute>(&op)) {
|
if (auto spatCompute = dyn_cast<SpatCompute>(&op)) {
|
||||||
uint64_t numInst = 0;
|
uint64_t numInst = spatial::countComputeBodyInstructions(spatCompute.getBody());
|
||||||
for (auto& _ : spatCompute.getRegion().front())
|
uint64_t perInstanceCrossbarCount = getPerInstanceCrossbarCount(spatCompute.getOperation());
|
||||||
++numInst;
|
|
||||||
SmallVector<int32_t> coreIds;
|
SmallVector<int32_t> coreIds;
|
||||||
if (auto coreId = getComputeCoreId(spatCompute))
|
if (auto coreId = getComputeCoreId(spatCompute))
|
||||||
coreIds.push_back(*coreId);
|
coreIds.push_back(*coreId);
|
||||||
collectedData.push_back({totalComputeOps++, 1, spatCompute.getWeights().size(), numInst, false, coreIds});
|
collectedData.push_back({totalComputeOps++, 1, perInstanceCrossbarCount, numInst, false, coreIds});
|
||||||
totalLogicalComputes += 1;
|
totalLogicalComputes += 1;
|
||||||
totalInstructionCount += numInst;
|
totalInstructionCount += numInst;
|
||||||
totalWeightCount += spatCompute.getWeights().size();
|
totalCrossbarCount += perInstanceCrossbarCount;
|
||||||
continue;
|
continue;
|
||||||
}
|
}
|
||||||
if (auto batch = dyn_cast<SpatComputeBatch>(&op)) {
|
if (auto batch = dyn_cast<SpatComputeBatch>(&op)) {
|
||||||
uint64_t numInst = 0;
|
uint64_t numInst = spatial::countComputeBodyInstructions(batch.getBody());
|
||||||
for (auto& _ : batch.getRegion().front())
|
|
||||||
++numInst;
|
|
||||||
uint64_t logicalCount = static_cast<uint64_t>(batch.getLaneCount());
|
uint64_t logicalCount = static_cast<uint64_t>(batch.getLaneCount());
|
||||||
|
uint64_t perInstanceCrossbarCount = getPerInstanceCrossbarCount(batch.getOperation());
|
||||||
SmallVector<int32_t> coreIds;
|
SmallVector<int32_t> coreIds;
|
||||||
if (auto coreIdsAttr = batch->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName))
|
if (auto coreIdsAttr = batch->getAttrOfType<DenseI32ArrayAttr>(onnx_mlir::kCoreIdsAttrName))
|
||||||
llvm::append_range(coreIds, coreIdsAttr.asArrayRef());
|
llvm::append_range(coreIds, coreIdsAttr.asArrayRef());
|
||||||
collectedData.push_back({nextBatchId++, logicalCount, batch.getWeights().size(), numInst, true, coreIds});
|
collectedData.push_back({nextBatchId++, logicalCount, perInstanceCrossbarCount * logicalCount, numInst, true, coreIds});
|
||||||
totalComputeOps += 1;
|
totalComputeOps += 1;
|
||||||
totalLogicalComputes += logicalCount;
|
totalLogicalComputes += logicalCount;
|
||||||
totalBatchComputeOps += 1;
|
totalBatchComputeOps += 1;
|
||||||
totalInstructionCount += numInst * logicalCount;
|
totalInstructionCount += numInst * logicalCount;
|
||||||
totalWeightCount += batch.getWeights().size();
|
totalCrossbarCount += perInstanceCrossbarCount * logicalCount;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
@@ -543,7 +529,7 @@ void generateReport(func::FuncOp funcOp, const std::string& name, size_t usedCpu
|
|||||||
{"Number of logical computes", std::to_string(totalLogicalComputes) },
|
{"Number of logical computes", std::to_string(totalLogicalComputes) },
|
||||||
{"Number of top-level batch compute ops", std::to_string(totalBatchComputeOps) },
|
{"Number of top-level batch compute ops", std::to_string(totalBatchComputeOps) },
|
||||||
{"Number of instructions", std::to_string(totalInstructionCount)},
|
{"Number of instructions", std::to_string(totalInstructionCount)},
|
||||||
{"Number of used crossbars", std::to_string(totalWeightCount) }
|
{"Number of used crossbars", std::to_string(totalCrossbarCount) }
|
||||||
};
|
};
|
||||||
printReportTotalsBlock(os, totalFields);
|
printReportTotalsBlock(os, totalFields);
|
||||||
if (!collectedData.empty())
|
if (!collectedData.empty())
|
||||||
@@ -557,7 +543,7 @@ void generateReport(func::FuncOp funcOp, const std::string& name, size_t usedCpu
|
|||||||
|
|
||||||
for (uint64_t nI = cI + 1; nI < totalComputeOps; ++nI) {
|
for (uint64_t nI = cI + 1; nI < totalComputeOps; ++nI) {
|
||||||
ReportRow next = collectedData[nI];
|
ReportRow next = collectedData[nI];
|
||||||
if (current.isRebatched == next.isRebatched && current.weightCount == next.weightCount
|
if (current.isRebatched == next.isRebatched && current.crossbarCount == next.crossbarCount
|
||||||
&& current.instructionCount == next.instructionCount
|
&& current.instructionCount == next.instructionCount
|
||||||
&& current.logicalComputeCount == next.logicalComputeCount)
|
&& current.logicalComputeCount == next.logicalComputeCount)
|
||||||
lastIndex = nI;
|
lastIndex = nI;
|
||||||
@@ -590,20 +576,20 @@ void generateReport(func::FuncOp funcOp, const std::string& name, size_t usedCpu
|
|||||||
os << ":\n";
|
os << ":\n";
|
||||||
uint64_t perCoreLogicalComputeCount = current.isRebatched ? 1 : current.logicalComputeCount;
|
uint64_t perCoreLogicalComputeCount = current.isRebatched ? 1 : current.logicalComputeCount;
|
||||||
uint64_t perCoreInstructionCount = current.instructionCount;
|
uint64_t perCoreInstructionCount = current.instructionCount;
|
||||||
uint64_t perCoreWeightCount =
|
uint64_t perCoreCrossbarCount =
|
||||||
current.logicalComputeCount == 0 ? 0 : current.weightCount / current.logicalComputeCount;
|
current.logicalComputeCount == 0 ? 0 : current.crossbarCount / current.logicalComputeCount;
|
||||||
uint64_t totalEntryInstructionCount = current.instructionCount * current.logicalComputeCount;
|
uint64_t totalEntryInstructionCount = current.instructionCount * current.logicalComputeCount;
|
||||||
|
|
||||||
llvm::SmallVector<ReportField, 3> perCoreFields = {
|
llvm::SmallVector<ReportField, 3> perCoreFields = {
|
||||||
{"Number of logical computes", std::to_string(perCoreLogicalComputeCount)},
|
{"Number of logical computes", std::to_string(perCoreLogicalComputeCount)},
|
||||||
{"Number of instructions", std::to_string(perCoreInstructionCount) },
|
{"Number of instructions", std::to_string(perCoreInstructionCount) },
|
||||||
{"Number of used crossbars", std::to_string(perCoreWeightCount) }
|
{"Number of used crossbars", std::to_string(perCoreCrossbarCount) }
|
||||||
};
|
};
|
||||||
if (current.isRebatched) {
|
if (current.isRebatched) {
|
||||||
llvm::SmallVector<ReportField, 3> totalEntryFields = {
|
llvm::SmallVector<ReportField, 3> totalEntryFields = {
|
||||||
{"Number of logical computes", std::to_string(current.logicalComputeCount)},
|
{"Number of logical computes", std::to_string(current.logicalComputeCount)},
|
||||||
{"Number of instructions", std::to_string(totalEntryInstructionCount) },
|
{"Number of instructions", std::to_string(totalEntryInstructionCount) },
|
||||||
{"Number of used crossbars", std::to_string(current.weightCount) }
|
{"Number of used crossbars", std::to_string(current.crossbarCount) }
|
||||||
};
|
};
|
||||||
printReportPerCoreAndTotalFields(os, perCoreFields, totalEntryFields);
|
printReportPerCoreAndTotalFields(os, perCoreFields, totalEntryFields);
|
||||||
}
|
}
|
||||||
@@ -658,13 +644,6 @@ public:
|
|||||||
|
|
||||||
emitMergeIrCounts("after-materialization", func);
|
emitMergeIrCounts("after-materialization", func);
|
||||||
|
|
||||||
if (failed(runPostMergeCompactionPipeline(func, nextChannelId))) {
|
|
||||||
signalPassFailure();
|
|
||||||
return;
|
|
||||||
}
|
|
||||||
|
|
||||||
emitMergeIrCounts("after-post-merge-compaction", func);
|
|
||||||
|
|
||||||
{
|
{
|
||||||
ScopedMergePhaseTimer timer("cleanup-topological-sort-report");
|
ScopedMergePhaseTimer timer("cleanup-topological-sort-report");
|
||||||
if (!sortTopologically(&func.getBody().front())) {
|
if (!sortTopologically(&func.getBody().front())) {
|
||||||
@@ -674,7 +653,7 @@ public:
|
|||||||
}
|
}
|
||||||
emitMergeIrCounts("final-post-merge", func);
|
emitMergeIrCounts("final-post-merge", func);
|
||||||
dumpModule(cast<ModuleOp>(func->getParentOp()), "spatial1_dcp_merged");
|
dumpModule(cast<ModuleOp>(func->getParentOp()), "spatial1_dcp_merged");
|
||||||
generateReport(func, "dcp_merge_report", analysisResult->cpuToLastComputeMap.size());
|
generateReport(func, "spatial_merge_report", analysisResult->cpuToLastComputeMap.size());
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
|||||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user