Now llc produces the same code for the following ir code.
define i64 @testi64slt(i64 %c1, i64 %c2, i64 %c3, i64 %c4, i64 %a1, i64 %a2) #0 { entry: %cmp1 = icmp eq i64 %c3, %c4 %cmp3tmp = icmp eq i64 %c1, %c2 %cmp3 = icmp slt i1 %cmp3tmp, %cmp1 br i1 %cmp3, label %iftrue, label %iffalse iftrue: ret i64 %a1 iffalse: ret i64 %a2 }
define i64 @testi64ult(i64 %c1, i64 %c2, i64 %c3, i64 %c4, i64 %a1, i64 %a2) #0 { entry: %cmp1 = icmp eq i64 %c3, %c4 %cmp3tmp = icmp eq i64 %c1, %c2 %cmp3 = icmp ult i1 %cmp3tmp, %cmp1 br i1 %cmp3, label %iftrue, label %iffalse iftrue: ret i64 %a1 iffalse: ret i64 %a2 }
But from the semantics of ir, these are not equivalent. Because a signed comparison of i1
values produces the opposite result to an unsigned one if the condition code includes
less-than or greater-than. This is so because 1 is the most negative signed i1 number and
the most positive unsigned i1 number. The CR-logical operations used for such comparisons
are non-commutative so for signed comparisons vs. unsigned ones, the input operands just
need to be swapped.