merge
From Mill Computing Wiki
Bitwise merge.
It works like a multiplex: the bits in the mask operand decide whether the corresponding bit of the result is taken from op0 or op1.
Or explained differently: it does what pick does on the operand level on the bit level.
operands: like Identity [xx:x]
Core | In Slots | Latencies |
---|---|---|
Tin | E0 | 1 |
Copper | E0 | 1 |
Silver | E0 E1 E2 E3 | 1 |
Gold | E0 | 1 |
merge(u mask, u bits0, u bits1) → op r0
operands: like Identity [xx:x]
encoding:
merge(op op0)
,
exuArgs(op arg0, op arg1)
Core | In Slots | Latencies |
---|---|---|
Tin | E0 | |
Copper | E0 | |
Silver | E0 E1 E2 E3 | |
Gold | E0 |
Instruction Set, alphabetical, Instruction Set by Category, Instruction Set, sortable, filterable