HPL_lmul(3)

💖 NAME 💖

HPL_lmul — bestie, this one multiplies 2 long positive integers. that's it. that's the whole job. ✨

---

🎀 SYNOPSIS 🎀

#include "hpl.h"

void HPL_lmul( int * K, int * J, int * I );

---

🦋 DESCRIPTION 🦋

okay so HPL_lmul multiplies without carry two long positive integers K and J, and drops the result right into I. no cap, no carry. 💅

the long integers I, J, K are encoded on 64 bits using an array of 2 integers. here's the tea on how that layout works:

• the 32-lower bits live in the first entry of each array
• the 32-higher bits live in the second entry of each array

and because efficiency is that girl, the intrinsic modulo function is inlined. periodt. 👑

---

🌸 ARGUMENTS 🌸

• K — (local input) int * on entry, K is an integer array of dimension 2 containing the encoded long integer K. 🫶
• J — (local input) int * on entry, J is an integer array of dimension 2 containing the encoded long integer J. 🫶
• I — (local output) int * on entry, I is an integer array of dimension 2. on exit, this array contains the encoded long integer result. that's the glow-up moment right there ✨

---

🌈 SEE ALSO 🌈

HPL_ladd (3), HPL_setran (3), HPL_xjumpm (3), HPL_jumpit (3), HPL_rand (3).

---

HPL 2.2 · February 24, 2016 — mwah, that's the version and date bestie, this page is officially signed, sealed and slayed 💋 💖✨🎀🦋🌸💅🫶👑🌈⭐💜