What problem does it solve? Writing AscendC kernels that stay correct and performant across many shapes requires consistent tiling decisions, and ad-hoc hardcoded chip parameters, misaligned DataCopy lengths, or broken queue pairing cause subtle correctness and performance bugs. ## Core Features & Use Cases - Hardware capacity rules: Defines how to budget UB, L1, L0A/L0B, and L0C buffers and how to split work between Vector and Cube cores on Atlas A2/A3/A5 devices. - Tiling contract and formulas: Specifies a stable host/kernel TilingData struct, mode-based dispatch, and safe block/tail formulas including early return and zero-length tail handling. - Alignment and pipeline invariants: Documents 32B alignment rules, DataCopyPad tail paths, and AllocTensor/FreeTensor plus EnQue/DeQue pairing checks. - Use Case: When batch-developing multiple operators (elementwise, broadcast, reduction), reuse one tiling skeleton per operator class and only change semantic points like dtype branches, reduce axes, and tail strategy. ## Quick Start Ask the agent to design the host tiling struct and device-side block/tail partitioning for a new AscendC elementwise kernel that must handle both aligned and tail shapes.