https://gcc.gnu.org/bugzilla/show_bug.cgi?id=102989
--- Comment #24 from Jonathan Wakely <redi at gcc dot gnu.org> --- (In reply to Jakub Jelinek from comment #23) > What about the large ones? Say for arbitrary size generic vectors we keep > them in SSA form until late (generic vector lowering) and at that point > lower, perhaps we could do the same for _BitInt? The unary as well as most > of binary operations can be handled by simple loops over extraction of > limbs from the large number, then there is multiplication and > division/modulo. I think the latter is why LLVM restricts it to 128 bits > right now, Right. > https://gcc.gnu.org/pipermail/gcc/2022-May/thread.html#238657 > was an proposal from the LLVM side but I don't see it being actually further > developed and don't see it on LLVM trunk. I think work on it stalled after that thread. See also https://discourse.llvm.org/t/rfc-add-support-for-division-of-large-bitint-builtins-selectiondag-globalisel-clang/60329/
