|
MLIR-AIE 1.4.6.dev
|
The mem tiles a mem tile pool's buffers go to: aie-objectfifo-allocate places them by this search, and the SA placer runs it on each placement it weighs. More...
#include "aie/Dialect/AIE/Transforms/AIEBufferAllocation.h"
Classes | |
| struct | Tile |
| struct | Buffer |
| A buffer of bytes homed on home, which it may take unless atHome is false, and the neighbours it may spill to, in the order tried when they are equally used. More... | |
Public Member Functions | |
| MemTileSpillSearch (llvm::SmallVector< Tile > tiles, int64_t alignment) | |
| int64_t | used (unsigned tile, int64_t bytes=0, int count=0) const |
| The bytes tile spans with what it holds and count more of bytes. | |
| bool | fits (unsigned tile, int64_t bytes, int count=1) const |
| void | reserve (unsigned tile, int64_t bytes, int count=1) |
| bool | place (llvm::ArrayRef< Buffer > buffers) |
| Places buffers in order on top of what the tiles hold. | |
Public Attributes | |
| llvm::SmallVector< unsigned > | chosen |
| size_t | failed = 0 |
| int64_t | unplacedBytes = 0 |
| llvm::SmallVector< bool > | weighed |
| Homes a spill from was weighed: aie-objectfifo-allocate gives their neighbours tile ops, as later passes may use them. | |
Static Public Attributes | |
| static constexpr int | kRetries = 256 |
| Alternatives the search tries before it gives up. | |
The mem tiles a mem tile pool's buffers go to: aie-objectfifo-allocate places them by this search, and the SA placer runs it on each placement it weighs.
A tile's use is its layout by assignSequentialBufferAddresses. Each buffer in turn goes home when it fits there, else to a neighbour home shares memory with, least used first; when one fits nowhere, earlier choices are revisited, latest first, until kRetries alternatives have been tried.
Definition at line 227 of file AIEBufferAllocation.h.
|
inline |
Definition at line 249 of file AIEBufferAllocation.h.
References xilinx::AIE::BufferAllocation::size, and weighed.
|
inline |
Definition at line 281 of file AIEBufferAllocation.h.
References used().
|
inline |
Places buffers in order on top of what the tiles hold.
On success each buffer's tile is in chosen; otherwise failed is the buffer that fit nowhere with the most buffers left after it, and unplacedBytes the bytes of it and those. Buffers whose tiles reach no tile in common place independently, so each such component is searched on its own, with its own kRetries.
Definition at line 298 of file AIEBufferAllocation.h.
References chosen, failed, kRetries, and unplacedBytes.
|
inline |
Definition at line 284 of file AIEBufferAllocation.h.
|
inline |
The bytes tile spans with what it holds and count more of bytes.
Definition at line 268 of file AIEBufferAllocation.h.
References xilinx::AIE::assignSequentialBufferAddresses().
Referenced by fits().
| llvm::SmallVector<unsigned> xilinx::AIE::MemTileSpillSearch::chosen |
Definition at line 336 of file AIEBufferAllocation.h.
Referenced by place().
| size_t xilinx::AIE::MemTileSpillSearch::failed = 0 |
Definition at line 337 of file AIEBufferAllocation.h.
Referenced by place().
|
staticconstexpr |
Alternatives the search tries before it gives up.
Definition at line 290 of file AIEBufferAllocation.h.
Referenced by place().
| int64_t xilinx::AIE::MemTileSpillSearch::unplacedBytes = 0 |
Definition at line 338 of file AIEBufferAllocation.h.
Referenced by place().
| llvm::SmallVector<bool> xilinx::AIE::MemTileSpillSearch::weighed |
Homes a spill from was weighed: aie-objectfifo-allocate gives their neighbours tile ops, as later passes may use them.
Definition at line 341 of file AIEBufferAllocation.h.
Referenced by MemTileSpillSearch().