635f93dff7
If nonnull is already set, we currently skip setting both nonnull and dereferenceable. Make these independent, to avoid regressions when additional nonnull attributes are inferred earlier.
192 lines
7.3 KiB
LLVM
192 lines
7.3 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
|
|
; Verify that strlen calls with conditional expressions involving constant
|
|
; string arguments with nonconstant offsets are folded as expected.
|
|
;
|
|
; RUN: opt < %s -passes=instcombine -S | FileCheck %s
|
|
|
|
declare i64 @strlen(ptr)
|
|
|
|
@sx = external global [0 x i8]
|
|
@s3 = constant [4 x i8] c"123\00"
|
|
@s5 = constant [6 x i8] c"12345\00"
|
|
@s7 = constant [8 x i8] c"1234567\00"
|
|
|
|
@s5_3 = constant [10 x i8] c"12345\00123\00"
|
|
|
|
|
|
; Fold strlen (x ? s3 + i : s5) to x ? 3 - i : 5.
|
|
|
|
define i64 @fold_strlen_s3_pi_s5(i1 %X, i64 %I) {
|
|
; CHECK-LABEL: @fold_strlen_s3_pi_s5(
|
|
; CHECK-NEXT: [[PS3_PI:%.*]] = getelementptr inbounds [4 x i8], ptr @s3, i64 0, i64 [[I:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[X:%.*]], ptr [[PS3_PI]], ptr @s5
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ps3_pi = getelementptr inbounds [4 x i8], ptr @s3, i64 0, i64 %I
|
|
%sel = select i1 %X, ptr %ps3_pi, ptr @s5
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; More complex expressions like the one below are not handled yet.
|
|
; Fold: strlen (x ? s3 + i + 1 : s5) to x ? 2 - i : 5.
|
|
|
|
define i64 @fold_strlen_s3_pi_p1_s5(i1 %0, i64 %1) {
|
|
; XFAIL-CHECK-LABEL: @fold_strlen_s3_pi_p1_s5(
|
|
; XFAIL-CHECK-NEXT: [[DIF_I:%.*]] = sub i64 2, %1
|
|
; XFAIL-CHECK-NEXT: [[SEL:%.*]] = select i1 %0, i64 [[DIF_I]], i64 5
|
|
; XFAIL-CHECK-NEXT: ret i64 [[SEL]]
|
|
; CHECK-LABEL: @fold_strlen_s3_pi_p1_s5(
|
|
; CHECK-NEXT: [[PS3_PI:%.*]] = getelementptr inbounds [4 x i8], ptr @s3, i64 0, i64 [[TMP1:%.*]]
|
|
; CHECK-NEXT: [[PS3_PI_P1:%.*]] = getelementptr i8, ptr [[PS3_PI]], i64 1
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[TMP0:%.*]], ptr [[PS3_PI_P1]], ptr @s5
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ps3_pi = getelementptr inbounds [4 x i8], ptr @s3, i64 0, i64 %1
|
|
%ps3_pi_p1 = getelementptr i8, ptr %ps3_pi, i64 1
|
|
%sel = select i1 %0, ptr %ps3_pi_p1, ptr @s5
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Avoid folding calls with conditional expressions involving constant
|
|
; string arguments with embedded nuls such as:
|
|
; strlen (x ? s5_3 + i : s5).
|
|
|
|
define i64 @call_strlen_s5_3_pi_s5(i1 %0, i64 %1) {
|
|
; CHECK-LABEL: @call_strlen_s5_3_pi_s5(
|
|
; CHECK-NEXT: [[PS5_3_PI:%.*]] = getelementptr inbounds [10 x i8], ptr @s5_3, i64 0, i64 [[TMP1:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[TMP0:%.*]], ptr [[PS5_3_PI]], ptr @s5
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ps5_3_pi = getelementptr inbounds [10 x i8], ptr @s5_3, i64 0, i64 %1
|
|
%sel = select i1 %0, ptr %ps5_3_pi, ptr @s5
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; But do fold strlen (x ? s5_3 : s5 + j) to x ? 5 : 5 - j.
|
|
|
|
define i64 @call_strlen_s5_3_s5_pj(i1 %X, i64 %J) {
|
|
; CHECK-LABEL: @call_strlen_s5_3_s5_pj(
|
|
; CHECK-NEXT: [[PS5:%.*]] = getelementptr inbounds [6 x i8], ptr @s5, i64 0, i64 [[J:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[X:%.*]], ptr @s5_3, ptr [[PS5]]
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ps5 = getelementptr inbounds [6 x i8], ptr @s5, i64 0, i64 %J
|
|
%sel = select i1 %X, ptr @s5_3, ptr %ps5
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Fold strlen (x ? s3: s5 + j) to x ? 3 : 5 - j.
|
|
|
|
define i64 @fold_strlen_s3_s5_pj(i1 %X, i64 %J) {
|
|
; CHECK-LABEL: @fold_strlen_s3_s5_pj(
|
|
; CHECK-NEXT: [[PS5_PJ:%.*]] = getelementptr inbounds [6 x i8], ptr @s5, i64 0, i64 [[J:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[X:%.*]], ptr @s3, ptr [[PS5_PJ]]
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ps5_pj = getelementptr inbounds [6 x i8], ptr @s5, i64 0, i64 %J
|
|
%sel = select i1 %X, ptr @s3, ptr %ps5_pj
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Same as above, avoid folding calls with conditional expressions involving
|
|
; constant string arguments with embedded nuls such as:
|
|
; strlen (x ? s3 : s5_3 + j).
|
|
|
|
define i64 @call_strlen_s3_s5_3_pj(i1 %0, i64 %1) {
|
|
; CHECK-LABEL: @call_strlen_s3_s5_3_pj(
|
|
; CHECK-NEXT: [[PS5_3_PJ:%.*]] = getelementptr inbounds [10 x i8], ptr @s5_3, i64 0, i64 [[TMP1:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[TMP0:%.*]], ptr @s3, ptr [[PS5_3_PJ]]
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ps5_3_pj = getelementptr inbounds [10 x i8], ptr @s5_3, i64 0, i64 %1
|
|
%sel = select i1 %0, ptr @s3, ptr %ps5_3_pj
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Fold strlen (x ? s3 + i: s5 + j) to x ? 3 - i : 5 - j.
|
|
|
|
define i64 @fold_strlen_s3_pi_s5_pj(i1 %X, i64 %I, i64 %J) {
|
|
; CHECK-LABEL: @fold_strlen_s3_pi_s5_pj(
|
|
; CHECK-NEXT: [[PS3_PI:%.*]] = getelementptr inbounds [4 x i8], ptr @s3, i64 0, i64 [[I:%.*]]
|
|
; CHECK-NEXT: [[PS5_PJ:%.*]] = getelementptr inbounds [6 x i8], ptr @s5, i64 0, i64 [[J:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[X:%.*]], ptr [[PS3_PI]], ptr [[PS5_PJ]]
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
; Use CHECK-DAG since the two instructions below might be emitted in reverse
|
|
; order.
|
|
|
|
%ps3_pi = getelementptr inbounds [4 x i8], ptr @s3, i64 0, i64 %I
|
|
%ps5_pj = getelementptr inbounds [6 x i8], ptr @s5, i64 0, i64 %J
|
|
%sel = select i1 %X, ptr %ps3_pi, ptr %ps5_pj
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Fold strlen(E) with E being two conditional expressions:
|
|
; strlen (x == 3 ? s3 : x == 5 ? s5 : s7) to x == 3 ? 3 : x == 5 ? 5 : 7.
|
|
|
|
define i64 @fold_strlen_s3_s5_s7(i32 %X) {
|
|
; CHECK-LABEL: @fold_strlen_s3_s5_s7(
|
|
; CHECK-NEXT: [[X_EQ_3:%.*]] = icmp eq i32 [[X:%.*]], 3
|
|
; CHECK-NEXT: [[X_EQ_5:%.*]] = icmp eq i32 [[X]], 5
|
|
; CHECK-NEXT: [[SEL_X_EQ_5:%.*]] = select i1 [[X_EQ_5]], ptr @s5, ptr @s7
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[X_EQ_3]], ptr @s3, ptr [[SEL_X_EQ_5]]
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%x_eq_3 = icmp eq i32 %X, 3
|
|
%x_eq_5 = icmp eq i32 %X, 5
|
|
%sel_x_eq_5 = select i1 %x_eq_5, ptr @s5, ptr @s7
|
|
%sel = select i1 %x_eq_3, ptr @s3, ptr %sel_x_eq_5
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Do not fold strlen (x == 3 ? sx : x == 5 ? s5 : s7).
|
|
|
|
define i64 @call_strlen_sx_s5_s7(i32 %X) {
|
|
; CHECK-LABEL: @call_strlen_sx_s5_s7(
|
|
; CHECK-NEXT: [[X_EQ_3:%.*]] = icmp eq i32 [[X:%.*]], 3
|
|
; CHECK-NEXT: [[X_EQ_5:%.*]] = icmp eq i32 [[X]], 5
|
|
; CHECK-NEXT: [[SEL_X_EQ_5:%.*]] = select i1 [[X_EQ_5]], ptr @s5, ptr @s7
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[X_EQ_3]], ptr @sx, ptr [[SEL_X_EQ_5]]
|
|
; CHECK-NEXT: [[LEN:%.*]] = tail call i64 @strlen(ptr noundef nonnull dereferenceable(1) [[SEL]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%x_eq_3 = icmp eq i32 %X, 3
|
|
%x_eq_5 = icmp eq i32 %X, 5
|
|
%sel_x_eq_5 = select i1 %x_eq_5, ptr @s5, ptr @s7
|
|
%sel = select i1 %x_eq_3, ptr @sx, ptr %sel_x_eq_5
|
|
%len = tail call i64 @strlen(ptr %sel)
|
|
ret i64 %len
|
|
}
|