https://gcc.gnu.org/bugzilla/show_bug.cgi?id=102989
--- Comment #51 from Jakub Jelinek <jakub at gcc dot gnu.org> ---
Note, I've only tested it so far on
_BitInt(256) a = 0x1234ab461289cdab8d111007b461289cdab8d1wb;
_BitInt(256) b = 0x2385eabcd072311074bcaa385eabcd07111007b46128wb;
_BitInt(384) c = (_BitInt(384)) 0x1234ab461289cdab8d111007b461289cdab8d1wb *
0x2385eabcd072311074bcaa385eabcd07111007b46128wb;
_BitInt(384) d;
extern void __mulbitint3 (unsigned long *, int, const unsigned long *, int,
const unsigned long *, int);
void
foo ()
{
__mulbitint3 (&d, 384, &a, 256, &b, 196);
}
multiplication, nothing else, guess it will be easier to test it when we can
emit from the compiler. And obviously no testing of the big endian limb
ordering handling until we add some arch that will support it (if we do that at
all).
