86 lines
3.7 KiB
LLVM
86 lines
3.7 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
|
|
; Verify that strnlen calls with conditional expressions involving constant
|
|
; string arguments with nonconstant bounds are folded correctly.
|
|
;
|
|
; RUN: opt < %s -passes=instcombine -S | FileCheck %s
|
|
|
|
declare i64 @strnlen(i8*, i64)
|
|
|
|
@sx = external global [0 x i8]
|
|
@s3 = constant [4 x i8] c"123\00"
|
|
@s5 = constant [6 x i8] c"12345\00"
|
|
@s5_3 = constant [10 x i8] c"12345\00abc\00"
|
|
|
|
|
|
; Fold strnlen (%0 ? s3 + %1 : s5, %2) to min(%0 ? 3 : 5, %1) when
|
|
; s3 + %1 is guaranteed to be within the bounds of s3.
|
|
|
|
define i64 @fold_strnlen_s3_pi_s5_n(i1 %0, i64 %1, i64 %2) {
|
|
; CHECK-LABEL: @fold_strnlen_s3_pi_s5_n(
|
|
; CHECK-NEXT: [[PTR:%.*]] = getelementptr inbounds [4 x i8], [4 x i8]* @s3, i64 0, i64 [[TMP1:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[TMP0:%.*]], i8* [[PTR]], i8* getelementptr inbounds ([6 x i8], [6 x i8]* @s5, i64 0, i64 0)
|
|
; CHECK-NEXT: [[LEN:%.*]] = call i64 @strnlen(i8* [[SEL]], i64 [[TMP2:%.*]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ptr = getelementptr inbounds [4 x i8], [4 x i8]* @s3, i64 0, i64 %1
|
|
%sel = select i1 %0, i8* %ptr, i8* getelementptr ([6 x i8], [6 x i8]* @s5, i64 0, i64 0)
|
|
%len = call i64 @strnlen(i8* %sel, i64 %2)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Do not fold the same expression as above when s3 + %i is not guaranteed
|
|
; to be within the bounds of s3. Also verify that the call is not marked
|
|
; noundef, nonnull, or dereferenceable because a zero bound implies no
|
|
; access.
|
|
|
|
define i64 @call_strnlen_s3_pi_xbounds_s5_n(i1 %0, i64 %1, i64 %2) {
|
|
; CHECK-LABEL: @call_strnlen_s3_pi_xbounds_s5_n(
|
|
; CHECK-NEXT: [[PTR:%.*]] = getelementptr [4 x i8], [4 x i8]* @s3, i64 0, i64 [[TMP1:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[TMP0:%.*]], i8* [[PTR]], i8* getelementptr inbounds ([6 x i8], [6 x i8]* @s5, i64 0, i64 0)
|
|
; CHECK-NEXT: [[LEN:%.*]] = call i64 @strnlen(i8* [[SEL]], i64 [[TMP2:%.*]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ptr = getelementptr [4 x i8], [4 x i8]* @s3, i64 0, i64 %1
|
|
%sel = select i1 %0, i8* %ptr, i8* getelementptr ([6 x i8], [6 x i8]* @s5, i64 0, i64 0)
|
|
%len = call i64 @strnlen(i8* %sel, i64 %2)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Do not fold strnlen(%0 ? s3 + %1 : sx, %1) when sx's length and size
|
|
; are unknown. This also verifies that the folder cleans up the IR after
|
|
; successfully folding the first subexpression IR when folding the second
|
|
; subexpression fails.
|
|
|
|
define i64 @call_strnlen_s3_pi_sx_n(i1 %0, i64 %1, i64 %2) {
|
|
; CHECK-LABEL: @call_strnlen_s3_pi_sx_n(
|
|
; CHECK-NEXT: [[PTR:%.*]] = getelementptr inbounds [4 x i8], [4 x i8]* @s3, i64 0, i64 [[TMP1:%.*]]
|
|
; CHECK-NEXT: [[SEL:%.*]] = select i1 [[TMP0:%.*]], i8* [[PTR]], i8* getelementptr inbounds ([0 x i8], [0 x i8]* @sx, i64 0, i64 0)
|
|
; CHECK-NEXT: [[LEN:%.*]] = call i64 @strnlen(i8* [[SEL]], i64 [[TMP2:%.*]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ptr = getelementptr inbounds [4 x i8], [4 x i8]* @s3, i64 0, i64 %1
|
|
%sel = select i1 %0, i8* %ptr, i8* getelementptr ([0 x i8], [0 x i8]* @sx, i64 0, i64 0)
|
|
%len = call i64 @strnlen(i8* %sel, i64 %2)
|
|
ret i64 %len
|
|
}
|
|
|
|
|
|
; Fold strnlen (%0 ? s3 : s5 + %1, %2) to min(%0 ? 3 : 5, %1).
|
|
|
|
define i64 @fold_strnlen_s3_s5_pi_n(i1 %0, i64 %1, i64 %2) {
|
|
; CHECK-LABEL: @fold_strnlen_s3_s5_pi_n(
|
|
; CHECK-NEXT: [[PTR:%.*]] = select i1 [[TMP0:%.*]], i8* getelementptr inbounds ([6 x i8], [6 x i8]* @s5, i64 0, i64 0), i8* getelementptr inbounds ([4 x i8], [4 x i8]* @s3, i64 0, i64 0)
|
|
; CHECK-NEXT: [[LEN:%.*]] = call i64 @strnlen(i8* [[PTR]], i64 [[TMP1:%.*]])
|
|
; CHECK-NEXT: ret i64 [[LEN]]
|
|
;
|
|
|
|
%ptr = select i1 %0, i8* getelementptr ([6 x i8], [6 x i8]* @s5, i64 0, i64 0), i8* getelementptr ([4 x i8], [4 x i8]* @s3, i64 0, i64 0)
|
|
%len = call i64 @strnlen(i8* %ptr, i64 %1)
|
|
ret i64 %len
|
|
}
|