Legalization already handles this when you're operating on integers that
are wider than the widest legal integers for your target. You can see it in
action by compiling a file that operates on two wide integers.
On Tue, Feb 20, 2018 at 11:43 PM, Vivek Datir via llvm-dev <
llvm-dev at lists.llvm.org> wrote:
> Dear everyone,
>
> I am current working on a project that requires me to divide an integer
> into two halves based on its bits and carry out multiplication and addition
> on the new data and combine these results to get the original result. Could
> someone please help with the "how to" part.
>
> Thanking you,
>
> Vivek Datir
> IIT Guwahati , India
>
> _______________________________________________
> LLVM Developers mailing list
> llvm-dev at lists.llvm.org
> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL:
<http://lists.llvm.org/pipermail/llvm-dev/attachments/20180302/070109a2/attachment.html>