Difference between revisions of "Instruction Set/retnfl"
From Mill Computing Wiki
m (Protected "Instruction Set/retnfl": generated ([Edit=<protect-level-bot>] (indefinite) [Move=<protect-level-bot>] (indefinite))) | |||
| Line 4: | Line 4: | ||
</div> | </div> | ||
| − | + | Conditionally returns values and control to the caller on false. | |
| + | |||
| + | Returns count as branches, which means with coniditional returns the [[First Winner Rule]] applies. | ||
| + | |||
| + | <b>related operations:</b> [[Instruction_Set/retn]] | ||
| + | |||
---- | ---- | ||
<code style="font-size:130%"><b style="color:#050">retnfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">q</span>, <span style="color:#009">[[Domains#ops|ops]]</span> <span title="one or more return arguments">vs</span>) → [[Domains|ops]] r<sub>0</sub> ...</code> | <code style="font-size:130%"><b style="color:#050">retnfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">q</span>, <span style="color:#009">[[Domains#ops|ops]]</span> <span title="one or more return arguments">vs</span>) → [[Domains|ops]] r<sub>0</sub> ...</code> | ||
Revision as of 17:49, 4 February 2015
Conditionally returns values and control to the caller on false.
Returns count as branches, which means with coniditional returns the First Winner Rule applies.
related operations: Instruction_Set/retn
retnfl(pred q, ops vs) → ops r0 ...
operands: like Inv :
encoding:
retnfl(pred q, off vs, count c)
,
retnfl(pred q, off vs, count c, lit vs)
,
retnfl(pred q, off vs, count c, lit vs, lit vs)
| Core | In Slots | Latencies |
|---|---|---|
| Tin | F0 | 1 |
| Copper | F0 F1 | 1 |
| Silver | F0 F1 F2 | 1 |
| Gold | F0 F1 F2 F3 | 1 |
| Decimal8 | F0 F1 F2 | 1 |
| Decimal16 | F0 F1 F2 | 1 |
Instruction Set, alphabetical, Instruction Set by Category, Instruction Set, sortable, filterable
