Difference between revisions of "Instruction Set/brfl"
(2 intermediate revisions by the same user not shown) | |||
Line 5: | Line 5: | ||
Branch on false predicate. | Branch on false predicate. | ||
− | There can be several conditionless branches in an [[EBB]] and even in the same operation, which are all | + | There can be several conditionless branches in an [[EBB]] and even in the same operation, which are all processed in parallel, but the first successful in the lowest slot wins. |
The targets in branches, whether literal or from a belt operand, are always relative to the [[Registers|EBB entry point]]. The optional delay serves to synchronize with operations that need to finish before control is transferred to the next EBB. This is particularly important for the predicates to examine for the branch, the value of which is examined after the delay. | The targets in branches, whether literal or from a belt operand, are always relative to the [[Registers|EBB entry point]]. The optional delay serves to synchronize with operations that need to finish before control is transferred to the next EBB. This is particularly important for the predicates to examine for the branch, the value of which is examined after the delay. | ||
Line 14: | Line 14: | ||
---- | ---- | ||
− | <code style="font-size:130%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt"> | + | <code style="font-size:130%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">op0</span>, <span style="color:#009">[[Domains#op|op]]</span> <span title="belt operand from opsWindow">op1</span>, <span style="color:#009">[[Domains#ops|ops]]</span> <span title="one or more |
+ | return arguments">args</span>)</code> | ||
<div style="font-size:80%;line-height:90%;margin-bottom:2em">'''operands:''' [[Operands#likeInv|like Inv :]] | <div style="font-size:80%;line-height:90%;margin-bottom:2em">'''operands:''' [[Operands#likeInv|like Inv :]] | ||
</div> | </div> | ||
<br /> | <br /> | ||
− | + | '''encoding:''' | |
− | + | <code style="font-size:100%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">count0</span>, <span style="color:#009">[[Domains#op|op]]</span> <span title="belt operand from opsWindow">op0</span>, <i><span style="color:#009">[[Immediates#off|off]]</span> <span title="manifest | |
− | + | constant">op1</span></i>, <i><span style="color:#009">[[Immediates#count|count]]</span> <span title="morsel-sized count of polyadic args">off0</span></i>)</code> | |
− | + | , | |
− | + | <code style="font-size:100%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">count0</span>, <span style="color:#009">[[Domains#op|op]]</span> <span title="belt operand from opsWindow">op0</span>, <i><span style="color:#009">[[Immediates#off|off]]</span> <span title="manifest | |
− | + | constant">op1</span></i>, <i><span style="color:#009">[[Immediates#count|count]]</span> <span title="morsel-sized count of polyadic args">lit0</span></i>, <i><span style="color:#009">[[Immediates#lit|lit]]</span> <span title="morsel-sized manifest constant">off0</span></i>)</code> | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | <code style="font-size: | + | |
− | + | ||
− | < | + | |
− | </ | + | |
<br /> | <br /> | ||
Line 47: | Line 33: | ||
| [[Cores/Tin/Encoding#brfl|Tin]] || F0 || 1 | | [[Cores/Tin/Encoding#brfl|Tin]] || F0 || 1 | ||
|- | |- | ||
− | | [[Cores/Copper/Encoding#brfl|Copper]] || F0 | + | | [[Cores/Copper/Encoding#brfl|Copper]] || F0 || 1 |
|- | |- | ||
| [[Cores/Silver/Encoding#brfl|Silver]] || F0 F1 F2 || 1 | | [[Cores/Silver/Encoding#brfl|Silver]] || F0 F1 F2 || 1 | ||
|- | |- | ||
− | | [[Cores/Gold/Encoding#brfl|Gold]] || F0 | + | | [[Cores/Gold/Encoding#brfl|Gold]] || F0 || 1 |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
|} | |} | ||
---- | ---- | ||
− | <code style="font-size:130%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt"> | + | <code style="font-size:130%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">op0</span>, <i><span style="color:#009">[[Immediates#lbl|lbl]]</span> <span title="name of label or function">off0</span></i>, <span style="color:#009">[[Domains#ops|ops]]</span> <span title="one or more |
+ | return arguments">args</span>)</code> | ||
<div style="font-size:80%;line-height:90%;margin-bottom:2em">'''operands:''' [[Operands#likeInv|like Inv :]] | <div style="font-size:80%;line-height:90%;margin-bottom:2em">'''operands:''' [[Operands#likeInv|like Inv :]] | ||
</div> | </div> | ||
<br /> | <br /> | ||
− | + | '''encoding:''' | |
− | + | <code style="font-size:100%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">count0</span>, <i><span style="color:#009">[[Immediates#off|off]]</span> <span title="manifest constant">op0</span></i>, <i><span style="color:#009">[[Immediates#count|count]]</span> <span title="morsel-sized count of | |
− | + | polyadic args">off0</span></i>)</code> | |
− | + | , | |
− | + | <code style="font-size:100%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">count0</span>, <i><span style="color:#009">[[Immediates#off|off]]</span> <span title="manifest constant">op0</span></i>, <i><span style="color:#009">[[Immediates#count|count]]</span> <span title="morsel-sized count of | |
− | + | polyadic args">lit0</span></i>, <i><span style="color:#009">[[Immediates#lit|lit]]</span> <span title="morsel-sized manifest constant">off0</span></i>)</code> | |
− | + | , | |
− | + | <code style="font-size:100%"><b style="color:#050">brfl</b>(<span style="color:#009">[[Domains#pred|pred]]</span> <span title="late-evaluated 1-bit predicate from belt">count0</span>, <i><span style="color:#009">[[Immediates#off|off]]</span> <span title="manifest constant">op0</span></i>, <i><span style="color:#009">[[Immediates#count|count]]</span> <span title="morsel-sized count of | |
− | + | polyadic args">lit0</span></i>, <i><span style="color:#009">[[Immediates#lit|lit]]</span> <span title="morsel-sized manifest constant">lit1</span></i>, <i><span style="color:#009">[[Immediates#lit|lit]]</span> <span title="morsel-sized manifest constant">off0</span></i>)</code> | |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | + | ||
− | <code style="font-size: | + | |
− | + | ||
− | < | + | |
− | </ | + | |
<br /> | <br /> | ||
Line 92: | Line 63: | ||
| [[Cores/Tin/Encoding#brfl|Tin]] || F0 || 1 | | [[Cores/Tin/Encoding#brfl|Tin]] || F0 || 1 | ||
|- | |- | ||
− | | [[Cores/Copper/Encoding#brfl|Copper]] || F0 | + | | [[Cores/Copper/Encoding#brfl|Copper]] || F0 || 1 |
|- | |- | ||
| [[Cores/Silver/Encoding#brfl|Silver]] || F0 F1 F2 || 1 | | [[Cores/Silver/Encoding#brfl|Silver]] || F0 F1 F2 || 1 | ||
|- | |- | ||
− | | [[Cores/Gold/Encoding#brfl|Gold]] || F0 | + | | [[Cores/Gold/Encoding#brfl|Gold]] || F0 || 1 |
− | + | ||
− | + | ||
− | + | ||
− | + | ||
|} | |} | ||
[[Instruction_Set|Instruction Set, alphabetical]], [[Instruction Set by Category]], [http://millcomputing.com/instructions.html?collapse=7#ops Instruction Set, sortable, filterable] | [[Instruction_Set|Instruction Set, alphabetical]], [[Instruction Set by Category]], [http://millcomputing.com/instructions.html?collapse=7#ops Instruction Set, sortable, filterable] |
Latest revision as of 13:24, 23 February 2021
Branch on false predicate. There can be several conditionless branches in an EBB and even in the same operation, which are all processed in parallel, but the first successful in the lowest slot wins.
The targets in branches, whether literal or from a belt operand, are always relative to the EBB entry point. The optional delay serves to synchronize with operations that need to finish before control is transferred to the next EBB. This is particularly important for the predicates to examine for the branch, the value of which is examined after the delay.
The branch not taken case is more efficient and faster, i.e. the compiler takes care to schedule the conditional branches with their more likely case not to be taken, to achieve the longest possible code sequences without control transfers.
brfl(pred op0, op op1, ops args)
encoding:
brfl(pred count0, op op0, off op1, count off0)
,
brfl(pred count0, op op0, off op1, count lit0, lit off0)
Core | In Slots | Latencies |
---|---|---|
Tin | F0 | 1 |
Copper | F0 | 1 |
Silver | F0 F1 F2 | 1 |
Gold | F0 | 1 |
brfl(pred op0, lbl off0, ops args)
encoding:
brfl(pred count0, off op0, count off0)
,
brfl(pred count0, off op0, count lit0, lit off0)
,
brfl(pred count0, off op0, count lit0, lit lit1, lit off0)
Core | In Slots | Latencies |
---|---|---|
Tin | F0 | 1 |
Copper | F0 | 1 |
Silver | F0 F1 F2 | 1 |
Gold | F0 | 1 |
Instruction Set, alphabetical, Instruction Set by Category, Instruction Set, sortable, filterable