Instruction
TDPBUUD
Multiplies two tiles of unsigned bytes, four per dword, and accumulates each row-by-column dot product into a tile of 32-bit integers.
- Extensions
- Forms
- 1 (1 VEX)
- Data
- Intel XED v2026.08.23
TDPBUUD is the AMX matrix multiply for unsigned bytes in both A and B: C += A × B on three tiles, each dword of A and B holding four bytes and each element of C a 32-bit sum that wraps on overflow. It is one of four sign combinations that differ only in the prefix bits of the VEX encoding, none for this one, and TDPBSSD’s page covers what they share: the shapes the tile configuration must give, the #UD when they do not fit, the #NM that lets an operating system hand out the tile state on demand, and how compilers handle tiles. Its vector relative is VPDPBUUD of AVX-VNNI-INT8.
The widest sums
Every product is between 0 and 65,025 (255 times 255), so a full tile, 64 products per element, adds up to 4,161,600 per instruction, the most of the four forms. The result has no sign of its own: the instruction adds modulo 2^32, and it is the program that reads C as signed or unsigned. Read as unsigned, an accumulator that starts at zero is safe for 1,032 instructions; read as signed, it can pass 2^31 - 1 after 516, about a quarter of the 2,047 that TDPBSSD allows. A longer sum has to be split into blocks that are added in a wider type.
In our builds
With -mamx-int8, GCC 14 and Clang 23 at -O2 compile _tile_dpbuud(0, 1, 2), whose arguments are tile numbers, to tdpbuud tmm0, tmm1, tmm2,
the bytes C4 E2 68 5E C1. Clang 23’s __tile1024i type has
__tile_dpbuud: in a loop over blocks of A and B it kept C in one tile
register, loaded A with TILELOADDT1 and B with
TILELOADD as the source asked, and stored C once after the loop. Zen 5
has no AMX, and this site’s recorded cases include none of TDPBUUD.
In the optimization guide
What the optimization guide says about TDPBUUD, a line per claim. Each links to the claim in the guide, with its sources and where they differ.
Golden Cove and Raptor Cove
- Vectors, AVX-512 and AMX: On Sapphire and Emerald Rapids, a tile multiplication (
tdp*) can start every 16 cycles and takes 52; a tile load every 8, taking 45; and loading the tile configuration takes about 204 cycles, worth doing once rather than in every call.
Forms
| Instruction | Encoding | Requires |
|---|---|---|
TDPBUUD tmm, tmm, tmm 64-bit mode only
TDPBUUD_TMMu32_TMM4u8_TMM4u8 | VEX.LZ.NP.0F38.W0 5E /r | AMX_INT8 (leaf 1EH) or AMX_TILE + AMX_INT8 |
Latency and throughput
| Model | tmm, tmm, tmm |
|---|---|
| Sapphire Rapids | 100 / 0.25p0156 |
Operation
What the forms do, in pseudocode that our tests run against results recorded on real processors. How to read.
on = xcr0 if cr4 >> 18 & 1 else 0 # XCR0, where CR4.OSXSAVE is set
if on >> 17 & 3 != 3: # TILECFG and TILEDATA
fault(UD)
if palette != 1: # 0: no tiles configured; ACE's
fault(UD) # palette 2 multiplies no tiles
t = tmm1.number # three different tiles
if t == tmm2.number or t == tmm3.number:
fault(UD)
if tmm2.number == tmm3.number:
fault(UD)
if 0 in (tmm1.rows, tmm2.rows, tmm3.rows):
fault(UD) # one TILECFG leaves out
if tmm1.colsb % 4 or tmm2.colsb % 4:
fault(UD) # rows of whole dwords
if tmm2.rows != tmm1.rows: # A: M rows, as C
fault(UD)
if tmm2.colsb // 4 != tmm3.rows: # A: K dwords, B: K rows
fault(UD)
if tmm3.colsb != tmm1.colsb: # B: N dwords, as C
fault(UD)
# K and N within the TMUL unit's 16 and 64 bytes (CPUID leaf
# 1EH): true of every tile of palette 1
if xfd >> 18 & 1: # the OS keeps the tiles from
fault(NM) # this thread
for m in range(tmm1.rows):
x = tmm2.row[m] # row m of A
for n in range(tmm1.colsb // 4):
s = tmm1.row[m].d[n]
for k in range(tmm2.colsb // 4):
y = tmm3.row[k] # row k of B
for j in range(4):
a = x.b[4 * k + j]
s += a * y.b[4 * n + j]
tmm1.row[m].d[n] = s # modulo 2^32
start_row = 0
# tmm1 is zeroed past its rows and colsbNot run on a processor: none of these processors has AMX.
Operands
| Operand | Kind | Action |
|---|---|---|
TDPBUUD tmm, tmm, tmm 64-bit mode only | ||
tmm | explicit | read, write |
tmm | explicit | read |
tmm | explicit | read |
Flags
None: XED records no flag that the forms test or change.
Exceptions
The exception class is XED's name for the set of exception conditions that a form follows. How to read.
- All forms
AMX-E4
Attributes
What else XED records about the forms. How to read.
- All forms
- may abort a TSX transaction
Intrinsics
The C intrinsics of Clang 23.1.2 that compile to TDPBUUD, each with the form it compiles to and the Clang options it needs. The forms come from compiling every intrinsic and decoding the result with Intel XED; all intrinsics A–Z explains the method.
| Intrinsic | Compiles to |
|---|---|
_tile_dpbuud
void _tile_dpbuud(const int dst, const int src0, const int src1) |
|
CPUID and processors
Each form belongs to an XED ISA set. A form can be used when the processor reports every CPUID bit of one of its ISA set's alternatives.
| ISA set | CPUID | Processors |
|---|---|---|
AMX_INT8 | AMX_INT8 (leaf 1EH) or AMX_TILE + AMX_INT8 | Sapphire Rapids, Emerald Rapids, Granite Rapids, Diamond Rapids |
More AMX-INT8 instructions
Sources
- Intel XED v2026.08.23 (commit
0bcb6237345c): forms, encodings, operands, flags, exception classes, attributes, ISA sets, CPUID bits and chip model. - Clang's x86 intrinsic headers, LLVM 23.1.2 (commit
85ac56026243): the intrinsics, their signatures and doc comments, and the Clang of that release, which compiled each of them. - LLVM 23.1.2's x86 scheduling models (commit
85ac56026243): the latency, reciprocal throughput and ports of each form, as llvm-mca reports them. - Intel 64 and IA-32 Architectures Software Developer's Manual, Volume 2 (325383-093, September 2026): Volume 2B, page 4-717 (TDPBSSD/
TDPBSUD/ TDPBUSD/ TDPBUUD)
The tables are derived from Intel XED, Copyright Intel Corporation, licensed under the Apache License 2.0; x86-64.net converted and reformatted them. The intrinsics and their signatures come from Clang and the timings from LLVM's scheduling models, both part of the LLVM Project, licensed under the Apache License 2.0 with LLVM Exceptions. The text is our own.