[LLVMdev] why llvm does not have uadd, iadd node

[kewuzhang]

So if the overflow happens for either one of the case, the return value will be implementation dependent?

best

kevin
On Feb 17, 2015, at 2:01 PM, Tim Northover <t.p.northover at gmail.com> wrote:

> Hi Kevin,
> 
> On 17 February 2015 at 10:41, kewuzhang <kewu.zhang at amd.com> wrote:
>> I just noticed that the LLVM has some node for signed/unsigned type( like udiv, sdiv), but why the ADD, SUB do not have the counter part sadd, uadd?
> 
> That's because in 2s complement arithmetic the bit pattern of the
> result doesn't depend on whether the operation is signed (unlike
> multiplication & division).
> 
> Cheers.
> 
> Tim.