Difference between revisions of "Instruction Set/divfp"

From Mill Computing Wiki
Jump to: navigation, search
(Created page with "{{DISPLAYTITLE:divfp}} <div style="font-size:80%;line-height:90%;margin-bottom:2em">realizing  exu stream [[Decode|exu block]...")
 
Line 4:Line 4:
 
</div>
 
</div>
  
divide for quotient
+
Floating point division in current rounding towards positive infinity.
 +
 
 
----
 
----
 
<code style="font-size:130%"><b style="color:#050">divfp</b>(<span style="color:#009">[[Domains#f|f]]</span> <span title="belt operand from ops window">x</span>, <span style="color:#009">[[Domains#f|f]]</span> <span title="belt operand from ops window">y</span>) &#8594; [[Domains#f|f]] r<sub>0</sub></code>
 
<code style="font-size:130%"><b style="color:#050">divfp</b>(<span style="color:#009">[[Domains#f|f]]</span> <span title="belt operand from ops window">x</span>, <span style="color:#009">[[Domains#f|f]]</span> <span title="belt operand from ops window">y</span>) &#8594; [[Domains#f|f]] r<sub>0</sub></code>

Revision as of 10:18, 12 November 2014

realizing  exu stream  exu block  compute phase   operation   in the binary floating point value domain   that produces condition codes

native on: none

Floating point division in current rounding towards positive infinity.


divfp(f x, f y) → f r0

operands: like Addf [ff:f]