Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for z_hi (0.34 sec)

  1. lib/fips140/v1.0.0-c2097c7c.zip

    R18, R19 ADDV R24, R19, R24 // z_hi[1] = x[1] * y + z[1] ADDV R18, R7, R10 // z_lo[1] = x[1] * y + z[1] + c SGTU R18, R10, R19 ADDV R24, R19, R7 // next c MULHVU R15, R5, R25 // z_hi[2] = x[2] * y MULV R15, R5, R15 // z_lo[2] = x[2] * y ADDV R15, R11, R18 // z_lo[2] = x[2] * y + z[2] SGTU R15, R18, R19 ADDV R25, R19, R25 // z_hi[2] = x[2] * y + z[2] ADDV R18, R7, R11 // z_lo[2] = x[2] * y + z[2] + c SGTU R18, R11, R19 ADDV R25, R19, R7 // next c MULHVU R16, R5, R26 // z_hi[3] = x[3] * y MULV R16, R5,...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Sep 25 19:53:19 UTC 2025
    - 642.7K bytes
    - Viewed (0)
  2. lib/fips140/v1.1.0-rc1.zip

    R18, R19 ADDV R24, R19, R24 // z_hi[1] = x[1] * y + z[1] ADDV R18, R7, R10 // z_lo[1] = x[1] * y + z[1] + c SGTU R18, R10, R19 ADDV R24, R19, R7 // next c MULHVU R15, R5, R25 // z_hi[2] = x[2] * y MULV R15, R5, R15 // z_lo[2] = x[2] * y ADDV R15, R11, R18 // z_lo[2] = x[2] * y + z[2] SGTU R15, R18, R19 ADDV R25, R19, R25 // z_hi[2] = x[2] * y + z[2] ADDV R18, R7, R11 // z_lo[2] = x[2] * y + z[2] + c SGTU R18, R11, R19 ADDV R25, R19, R7 // next c MULHVU R16, R5, R26 // z_hi[3] = x[3] * y MULV R16, R5,...
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Thu Dec 11 16:27:41 UTC 2025
    - 663K bytes
    - Viewed (0)
  3. doc/asm.html

    and offsets match.
    On 32-bit systems, the low and high 32 bits of a 64-bit value are distinguished by adding
    a <code>_lo</code> or <code>_hi</code> suffix to the name, as in <code>arg_lo+0(FP)</code> or <code>arg_hi+4(FP)</code>.
    If a Go prototype does not name its result, the expected assembly name is <code>ret</code>.
    </p>
    
    <p>
    Registered: Tue Dec 30 11:13:12 UTC 2025
    - Last Modified: Fri Nov 14 19:09:46 UTC 2025
    - 36.5K bytes
    - Viewed (0)
Back to top