Test source: git
Source: /bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll
-- 1. ModuleToFunctionPassAdaptor
-- 1. PassManager<Function> : Skipping NOP
-- 2. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <2 x i8> @shuffle_v2i8(<2 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <2 x i8> %arg0, <2 x i8> poison, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <2 x i8> %arg0, <2 x i8> poison, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <2 x i8> [ %val1, %then ], [ %val2, %else ]
ret <2 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 3. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <2 x i8> @shuffle_v2i8(<2 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <2 x i8> %arg0, <2 x i8> poison, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <2 x i8> %arg0, <2 x i8> poison, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <2 x i8> [ %val1, %then ], [ %val2, %else ]
ret <2 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 4. PassManager<Function> : Skipping NOP
-- 5. PassManager<Function> : Skipping NOP
-- 6. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <4 x i8> @shuffle_v4i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <4 x i8> [ %val1, %then ], [ %val2, %else ]
ret <4 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 7. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <4 x i8> @shuffle_v4i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <4 x i8> [ %val1, %then ], [ %val2, %else ]
ret <4 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 8. PassManager<Function> : Skipping NOP
-- 9. PassManager<Function> : Skipping NOP
-- 10. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <8 x i8> @shuffle_v8i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <8 x i8> [ %val1, %then ], [ %val2, %else ]
ret <8 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 11. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <8 x i8> @shuffle_v8i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <8 x i8> [ %val1, %then ], [ %val2, %else ]
ret <8 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 12. PassManager<Function> : Skipping NOP
-- 13. PassManager<Function> : Skipping NOP
-- 14. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <16 x i8> @shuffle_v16i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <16 x i8> [ %val1, %then ], [ %val2, %else ]
ret <16 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 15. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <16 x i8> @shuffle_v16i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <16 x i8> [ %val1, %then ], [ %val2, %else ]
ret <16 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 16. PassManager<Function> : Skipping NOP
-- 17. PassManager<Function> : Skipping NOP
-- 18. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <32 x i8> @shuffle_v32i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <32 x i8> [ %val1, %then ], [ %val2, %else ]
ret <32 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 19. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <32 x i8> @shuffle_v32i8(<3 x i8> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i8> %arg0, <3 x i8> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <32 x i8> [ %val1, %then ], [ %val2, %else ]
ret <32 x i8> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 20. PassManager<Function> : Skipping NOP
-- 21. PassManager<Function> : Skipping NOP
-- 22. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <2 x i16> @shuffle_v2i16(<2 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <2 x i16> %arg0, <2 x i16> poison, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <2 x i16> %arg0, <2 x i16> poison, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <2 x i16> [ %val1, %then ], [ %val2, %else ]
ret <2 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 23. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <2 x i16> @shuffle_v2i16(<2 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <2 x i16> %arg0, <2 x i16> poison, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <2 x i16> %arg0, <2 x i16> poison, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <2 x i16> [ %val1, %then ], [ %val2, %else ]
ret <2 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 24. PassManager<Function> : Skipping NOP
-- 25. PassManager<Function> : Skipping NOP
-- 26. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <4 x i16> @shuffle_v4i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <4 x i16> [ %val1, %then ], [ %val2, %else ]
ret <4 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 27. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <4 x i16> @shuffle_v4i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <4 x i16> [ %val1, %then ], [ %val2, %else ]
ret <4 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 28. PassManager<Function> : Skipping NOP
-- 29. PassManager<Function> : Skipping NOP
-- 30. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <8 x i16> @shuffle_v8i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <8 x i16> [ %val1, %then ], [ %val2, %else ]
ret <8 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 31. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <8 x i16> @shuffle_v8i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <8 x i16> [ %val1, %then ], [ %val2, %else ]
ret <8 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 32. PassManager<Function> : Skipping NOP
-- 33. PassManager<Function> : Skipping NOP
-- 34. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <16 x i16> @shuffle_v16i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <16 x i16> [ %val1, %then ], [ %val2, %else ]
ret <16 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 35. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <16 x i16> @shuffle_v16i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <16 x i16> [ %val1, %then ], [ %val2, %else ]
ret <16 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 36. PassManager<Function> : Skipping NOP
-- 37. PassManager<Function> : Skipping NOP
-- 38. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <32 x i16> @shuffle_v32i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <32 x i16> [ %val1, %then ], [ %val2, %else ]
ret <32 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 39. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <32 x i16> @shuffle_v32i16(<3 x i16> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i16> %arg0, <3 x i16> poison, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <32 x i16> [ %val1, %then ], [ %val2, %else ]
ret <32 x i16> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 40. PassManager<Function> : Skipping NOP
-- 41. PassManager<Function> : Skipping NOP
-- 42. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <2 x i32> @shuffle_v2i32(<2 x i32> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <2 x i32> %arg0, <2 x i32> poison, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <2 x i32> %arg0, <2 x i32> poison, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <2 x i32> [ %val1, %then ], [ %val2, %else ]
ret <2 x i32> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 43. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <2 x i32> @shuffle_v2i32(<2 x i32> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <2 x i32> %arg0, <2 x i32> poison, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <2 x i32> %arg0, <2 x i32> poison, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <2 x i32> [ %val1, %then ], [ %val2, %else ]
ret <2 x i32> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 44. PassManager<Function> : Skipping NOP
-- 45. PassManager<Function> : Skipping NOP
-- 46. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <4 x i32> @shuffle_v4i32(<3 x i32> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i32> %arg0, <3 x i32> poison, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i32> %arg0, <3 x i32> poison, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <4 x i32> [ %val1, %then ], [ %val2, %else ]
ret <4 x i32> %val3
}
Transformation seems to be correct! (syntactically equal)
-- 47. VectorCombinePass
----------------------------------------
declare void @func1()
declare void @func0()
define <4 x i32> @shuffle_v4i32(<3 x i32> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
%val2 = shufflevector <3 x i32> %arg0, <3 x i32> poison, 2, 2, 2, 2
tail call void @func1()
br label %finally
then:
%val1 = shufflevector <3 x i32> %arg0, <3 x i32> poison, 1, 1, 1, 1
tail call void @func0()
br label %finally
finally:
%val3 = phi <4 x i32> [ %val1, %then ], [ %val2, %else ]
ret <4 x i32> %val3
}
=>
declare void @func1()
declare void @func0()
define <4 x i32> @shuffle_v4i32(<3 x i32> %arg0, i1 %cond) {
entry:
br i1 %cond, label %then, label %else
else:
tail call void @func1()
br label %finally
then:
%#0 = shufflevector <3 x i32> %arg0, <3 x i32> poison, 1, 2, 0
tail call void @func0()
br label %finally
finally:
%#1 = phi <3 x i32> [ %#0, %then ], [ %arg0, %else ]
%val3 = shufflevector <3 x i32> %#1, <3 x i32> poison, 2, 2, 2, 2
ret <4 x i32> %val3
}
Transformation doesn't verify! (unsound)
ERROR: Target is more poisonous than source
Example:
<3 x i32> %arg0 = < poison, #x00000003 (3) [based on undef], poison >
i1 %cond = #x1 (1)
Source:
>> Jump to %then
<4 x i32> %val1 = < #x00000003 (3) [based on undef], #x00000003 (3) [based on undef], #x00000003 (3) [based on undef], #x00000003 (3) [based on undef] >
Function @func0 returned
>> Jump to %finally
<4 x i32> %val3 = < #x00000003 (3) [based on undef], #x00000003 (3) [based on undef], #x00000003 (3) [based on undef], #x00000003 (3) [based on undef] >
SOURCE MEMORY STATE
===================
NON-LOCAL BLOCKS:
Block 0 > size: 0 align: 1 alloc type: 0 alive: false address: #x0
Block 1 > size: 0 align: 8 alloc type: 0 alive: true address: #x8
Target:
>> Jump to %then
<3 x i32> %#0 = < #x00000003 (3) [based on undef], poison, poison >
Function @func0 returned
>> Jump to %finally
<3 x i32> %#1 = < #x00000003 (3) [based on undef], poison, poison >
<4 x i32> %val3 = < poison, poison, poison, poison >
TARGET MEMORY STATE
===================
NON-LOCAL BLOCKS:
Block 0 > size: 0 align: 1 alloc type: 0 alive: false address: #x0
Block 1 > size: 0 align: 8 alloc type: 0 alive: true address: #x8
Source value: < #x00000003 (3) [based on undef], #x00000003 (3) [based on undef], #x00000003 (3) [based on undef], #x00000003 (3) [based on undef] >
Target value: < poison, poison, poison, poison >
Pass: VectorCombinePass
Command line: '/home/nlopes/llvm/build/bin/opt' '-load=/home/nlopes/alive2/build/tv/tv.so' '-load-pass-plugin=/home/nlopes/alive2/build/tv/tv.so' '-tv-exit-on-error' '-mtriple=amdgcn-amd-amdhsa' '-passes=vector-combine' '-S' '/bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll' '-tv-smt-to=20000' '-tv-report-dir=/home/nlopes/alive2/build/logs' '-tv-smt-stats'
Wrote bitcode to: "/home/nlopes/alive2/build/logs/narrow-phi-of-shuffles_pn1UC1PU_w7BD.bc"
------------------- SMT STATS -------------------
Num queries: 20
Num invalid: 0
Num skips: 0
Num trivial: 18 (47.4%)
Num timeout: 0 (0.0%)
Num errors: 0 (0.0%)
Num SAT: 16 (80.0%)
Num UNSAT: 4 (20.0%)
Alive2: Transform doesn't verify; aborting!
Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll' FAILED ******************** Exit Code: 2 Command Output (stdout): -- # RUN: at line 2 /home/nlopes/alive2/build/opt-alive.sh -mtriple=amdgcn-amd-amdhsa -passes=vector-combine -S /bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll | /bitbucket/nlopes/llvm/build/bin/FileCheck /bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll --check-prefixes=CHECK # executed command: /home/nlopes/alive2/build/opt-alive.sh -mtriple=amdgcn-amd-amdhsa -passes=vector-combine -S /bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll # .---command stderr------------ # `----------------------------- # error: command failed with exit status: 1 # executed command: /bitbucket/nlopes/llvm/build/bin/FileCheck /bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll --check-prefixes=CHECK # .---command stderr------------ # | FileCheck error: '<stdin>' is empty. # | FileCheck command line: /bitbucket/nlopes/llvm/build/bin/FileCheck /bitbucket/nlopes/llvm/llvm/test/Transforms/VectorCombine/AMDGPU/narrow-phi-of-shuffles.ll --check-prefixes=CHECK # `----------------------------- # error: command failed with exit status: 2 --