Sync

dataset.jsonl

@@ -221,6 +221,7 @@
 {"bug_id": "127128", "issue_url": "https://github.com/llvm/llvm-project/issues/127128", "bug_type": "crash", "base_commit": "1ff5f328d9824694cc356ebf78adad8816a6de86", "knowledge_cutoff": "2025-02-13T20:59:01Z", "lit_test_dir": ["llvm/test/Transforms/SLPVectorizer"], "hints": {"fix_commit": "ac217ee389d63124432e5e6890851a678f7a676b", "components": ["SLPVectorizer"], "bug_location_lineno": {"llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp": [[13206, 13213]]}, "bug_location_funcname": {"llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp": ["BoUpSLP::isGatherShuffledSingleRegisterEntry"]}}, "patch": "commit ac217ee389d63124432e5e6890851a678f7a676b\nAuthor: Alexey Bataev <[email protected]>\nDate:   Thu Feb 13 14:19:51 2025 -0800\n\n    [SLP] Check for PHI nodes (potentially cycles!) when checking dependencies\n    \n    When checking for dependecies for gather nodes with users with the same\n    last instruction, cannot rely on the index order, if there is (even\n    potential!) cycle in the graph, which may cause order not work correctly\n    and cause compiler crash.\n    \n    Fixes #127128\n\ndiff --git a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp\nindex fb72a112b9ac..780cafe91d6b 100644\n--- a/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp\n+++ b/llvm/lib/Transforms/Vectorize/SLPVectorizer.cpp\n@@ -13206,8 +13206,16 @@ BoUpSLP::isGatherShuffledSingleRegisterEntry(\n           continue;\n         // If the user instruction is used for some reason in different\n         // vectorized nodes - make it depend on index.\n+        // If any vector node is PHI node, this dependency might not work\n+        // because of cycle dependencies, so disable it.\n         if (TEUseEI.UserTE != UseEI.UserTE &&\n-            TEUseEI.UserTE->Idx < UseEI.UserTE->Idx)\n+            (TEUseEI.UserTE->Idx < UseEI.UserTE->Idx ||\n+             any_of(\n+                 VectorizableTree,\n+                 [](const std::unique_ptr<TreeEntry> &TE) {\n+                   return TE->State == TreeEntry::Vectorize &&\n+                          TE->getOpcode() == Instruction::PHI;\n+                 })))\n           continue;\n       }\n \n", "tests": [{"file": "llvm/test/Transforms/SLPVectorizer/X86/delayed-gather-emission.ll", "commands": ["opt -passes=slp-vectorizer -mtriple=x86_64 -mattr=+avx2 -S < %s"], "tests": [{"test_name": "test", "test_body": "define void @test() {\nentry:\n  %.pre.pre = load float, ptr poison, align 4\n  br label %bb1\n\nbb1:                                              ; preds = %bb2, %entry\n  %.pre = phi float [ %.pre.pre, %entry ], [ %i2, %bb2 ]\n  %foxtrot.0 = phi float [ undef, %entry ], [ %gulf.0, %bb2 ]\n  br label %bb2\n\nbb2:                                              ; preds = %bb2, %bb1\n  %i = phi float [ %.pre, %bb1 ], [ %i2, %bb2 ]\n  %gulf.0 = phi float [ %foxtrot.0, %bb1 ], [ %div, %bb2 ]\n  %div = fdiv float %i, %gulf.0\n  %i1 = load float, ptr poison, align 4\n  %div1 = fdiv float %gulf.0, %i1\n  %mul = fmul float %div, %div1\n  tail call void @foo(float %mul)\n  %i2 = load float, ptr poison, align 4\n  %tobool = fcmp une float %i2, 0.000000e+00\n  br i1 %tobool, label %bb1, label %bb2\n}\n\ndeclare void @foo(float)\n"}]}, {"file": "llvm/test/Transforms/SLPVectorizer/X86/phi-node-with-cycle.ll", "commands": ["opt -S --passes=slp-vectorizer -mtriple=x86_64-unknown-linux-gnu -mcpu=haswell < %s"], "tests": [{"test_name": "<module>", "test_body": "\ndefine void @test(float %0) {\n;\n  %2 = fdiv float 0.000000e+00, 0.000000e+00\n  %3 = fdiv float 0.000000e+00, 0.000000e+00\n  %4 = fdiv float %0, 0.000000e+00\n  br label %5\n\n5:\n  %6 = fmul float %4, 0.000000e+00\n  %7 = fsub float 0.000000e+00, %6\n  %8 = fmul float %3, 0.000000e+00\n  %9 = fsub float 0.000000e+00, %8\n  br label %11\n\n10:\n  br label %11\n\n11:\n  %12 = phi float [ %7, %5 ], [ 0.000000e+00, %10 ]\n  %13 = phi float [ %9, %5 ], [ 0.000000e+00, %10 ]\n  br label %14\n\n14:\n  %15 = fmul float %2, 0.000000e+00\n  %16 = fsub float %12, %15\n  %17 = fmul float %4, 0.000000e+00\n  %18 = fsub float %13, %17\n  %19 = fadd float %16, %18\n  %20 = call float @llvm.fabs.f32(float %19)\n  ret void\n}\n"}]}], "issue": {"title": "SLPVectorizer miscompilation", "body": "```llvm\ntarget datalayout = \"e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128-ni:10:11:12:13\"\ntarget triple = \"x86_64-unknown-linux-gnu\"\n\ndefine swiftcc { ptr addrspace(10), i8 } @julia__dir2ori_404(float %0) {\n  %2 = fdiv float 0.000000e+00, 0.000000e+00\n  %3 = fdiv float 0.000000e+00, 0.000000e+00\n  %4 = fdiv float %0, 0.000000e+00\n  br label %5\n\n5:                                                ; preds = %1\n  %6 = fmul float %4, 0.000000e+00\n  %7 = fsub float 0.000000e+00, %6\n  %8 = fmul float %3, 0.000000e+00\n  %9 = fsub float 0.000000e+00, %8\n  br label %11\n\n10:                                               ; No predecessors!\n  br label %11\n\n11:                                               ; preds = %10, %5\n  %12 = phi float [ %7, %5 ], [ 0.000000e+00, %10 ]\n  %13 = phi float [ %9, %5 ], [ 0.000000e+00, %10 ]\n  br label %14\n\n14:                                               ; preds = %11\n  %15 = fmul float %2, 0.000000e+00\n  %16 = fsub float %12, %15\n  %17 = fmul float %4, 0.000000e+00\n  %18 = fsub float %13, %17\n  %19 = fadd float %16, %18\n  %20 = call float @llvm.fabs.f32(float %19)\n  ret { ptr addrspace(10), i8 } zeroinitializer\n}\n\n; Function Attrs: nocallback nofree nosync nounwind speculatable willreturn memory(none)\ndeclare float @llvm.fabs.f32(float) #0\n\nattributes #0 = { nocallback nofree nosync nounwind speculatable willreturn memory(none) }\n```\nproduces \n```\nInstruction does not dominate all uses!\n  %4 = insertelement <2 x float> <float poison, float 0.000000e+00>, float %0, i32 0\n  %2 = shufflevector <2 x float> %4, <2 x float> <float 0.000000e+00, float poison>, <2 x i32> <i32 2, i32 0>\nLLVM ERROR: Broken module found, compilation aborted!\nPLEASE submit a bug report to https://github.com/llvm/llvm-project/issues/ and include the crash backtrace.\nStack dump:\n0.\tProgram arguments: /opt/compiler-explorer/clang-assertions-trunk/bin/opt -o /app/output.s -S -passes=slp-vectorizer -mcpu=haswell <source>\n1.\tRunning pass \"verify\" on module \"<source>\"\n #0 0x00000000054edec8 llvm::sys::PrintStackTrace(llvm::raw_ostream&, int) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x54edec8)\n #1 0x00000000054eb884 SignalHandler(int, siginfo_t*, void*) Signals.cpp:0:0\n #2 0x00007faaea842520 (/lib/x86_64-linux-gnu/libc.so.6+0x42520)\n #3 0x00007faaea8969fc pthread_kill (/lib/x86_64-linux-gnu/libc.so.6+0x969fc)\n #4 0x00007faaea842476 gsignal (/lib/x86_64-linux-gnu/libc.so.6+0x42476)\n #5 0x00007faaea8287f3 abort (/lib/x86_64-linux-gnu/libc.so.6+0x287f3)\n #6 0x000000000082790d llvm::json::operator==(llvm::json::Value const&, llvm::json::Value const&) (.cold) JSON.cpp:0:0\n #7 0x000000000542b6e8 (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x542b6e8)\n #8 0x0000000005329278 (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x5329278)\n #9 0x000000000095605e llvm::detail::PassModel<llvm::Module, llvm::VerifierPass, llvm::AnalysisManager<llvm::Module>>::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x95605e)\n#10 0x00000000052e7b50 llvm::PassManager<llvm::Module, llvm::AnalysisManager<llvm::Module>>::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x52e7b50)\n#11 0x000000000096174a llvm::runPassPipeline(llvm::StringRef, llvm::Module&, llvm::TargetMachine*, llvm::TargetLibraryInfoImpl*, llvm::ToolOutputFile*, llvm::ToolOutputFile*, llvm::ToolOutputFile*, llvm::StringRef, llvm::ArrayRef<llvm::PassPlugin>, llvm::ArrayRef<std::function<void (llvm::PassBuilder&)>>, llvm::opt_tool::OutputKind, llvm::opt_tool::VerifierKind, bool, bool, bool, bool, bool, bool, bool) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x96174a)\n#12 0x0000000000953c7c optMain (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x953c7c)\n#13 0x00007faaea829d90 (/lib/x86_64-linux-gnu/libc.so.6+0x29d90)\n#14 0x00007faaea829e40 __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x29e40)\n#15 0x000000000094b555 _start (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x94b555)\nProgram terminated with signal: SIGSEGV\nCompiler returned: 139\n```\non 19 and trunk.\nGodbolt: https://godbolt.org/z/qxKP6198T", "author": "Zentrik", "labels": ["llvm:SLPVectorizer", "crash-on-valid"], "comments": [{"author": "Zentrik", "body": "Bisected thanks to manyclangs to 66775f8ccdcc8264ef349518e1c59d96d4227823 (8e2b2c4181506efc5b9321c203dd107bbd63392b seemed to be good) @alexey-bataev"}]}, "verified": true}
 {"bug_id": "100298", "issue_url": "https://github.com/llvm/llvm-project/issues/100298", "bug_type": "miscompilation", "base_commit": "75642a00e15b722bdfb90726be31f1c8adaeb0c5", "knowledge_cutoff": "2024-07-24T04:19:53Z", "lit_test_dir": ["llvm/test/Transforms/InstCombine"], "hints": {"fix_commit": "59eae919c938f890e9b9b4be8a3fa3cb1b11ed89", "components": ["ValueTracking"], "bug_location_lineno": {"llvm/include/llvm/Analysis/SimplifyQuery.h": [[130, 135]], "llvm/lib/Analysis/ValueTracking.cpp": [[1435, 1441], [1468, 1474], [1546, 1552], [2329, 2335], [2943, 2949], [3509, 3515], [4001, 4007], [5909, 5918]]}, "bug_location_funcname": {"llvm/include/llvm/Analysis/SimplifyQuery.h": ["getWithCondContext"], "llvm/lib/Analysis/ValueTracking.cpp": ["ComputeNumSignBitsImpl", "computeKnownBitsFromOperator", "computeKnownFPClass", "isKnownNonZeroFromOperator", "isKnownToBeAPowerOfTwo", "isNonEqualPHIs"]}}, "patch": "commit a87fbeb3a77a53ded341277c5b326f7696d47594\nAuthor: Yingwei Zheng <[email protected]>\nDate:   Wed Jul 24 20:06:36 2024 +0800\n\n    [ValueTracking] Don't use CondContext in dataflow analysis of phi nodes (#100316)\n    \n    See the following case:\n    ```\n    define i16 @pr100298() {\n    entry:\n      br label %for.inc\n    \n    for.inc:\n      %indvar = phi i32 [ -15, %entry ], [ %mask, %for.inc ]\n      %add = add nsw i32 %indvar, 9\n      %mask = and i32 %add, 65535\n      %cmp1 = icmp ugt i32 %mask, 5\n      br i1 %cmp1, label %for.inc, label %for.end\n    \n    for.end:\n      %conv = trunc i32 %add to i16\n      %cmp2 = icmp ugt i32 %mask, 3\n      %shl = shl nuw i16 %conv, 14\n      %res = select i1 %cmp2, i16 %conv, i16 %shl\n      ret i16 %res\n    }\n    ```\n    \n    When computing knownbits of `%shl` with `%cmp2=false`, we cannot use\n    this condition in the analysis of `%mask (%for.inc -> %for.inc)`.\n    \n    Fixes https://github.com/llvm/llvm-project/issues/100298.\n    \n    (cherry picked from commit 59eae919c938f890e9b9b4be8a3fa3cb1b11ed89)\n\ndiff --git a/llvm/include/llvm/Analysis/SimplifyQuery.h b/llvm/include/llvm/Analysis/SimplifyQuery.h\nindex a560744f0122..e8f43c8c2e91 100644\n--- a/llvm/include/llvm/Analysis/SimplifyQuery.h\n+++ b/llvm/include/llvm/Analysis/SimplifyQuery.h\n@@ -130,6 +130,12 @@ struct SimplifyQuery {\n     Copy.CC = &CC;\n     return Copy;\n   }\n+\n+  SimplifyQuery getWithoutCondContext() const {\n+    SimplifyQuery Copy(*this);\n+    Copy.CC = nullptr;\n+    return Copy;\n+  }\n };\n \n } // end namespace llvm\ndiff --git a/llvm/lib/Analysis/ValueTracking.cpp b/llvm/lib/Analysis/ValueTracking.cpp\nindex 40fe1ffe13f1..4b77c0046cc7 100644\n--- a/llvm/lib/Analysis/ValueTracking.cpp\n+++ b/llvm/lib/Analysis/ValueTracking.cpp\n@@ -1435,7 +1435,7 @@ static void computeKnownBitsFromOperator(const Operator *I,\n         // inferred hold at original context instruction.  TODO: It may be\n         // correct to use the original context.  IF warranted, explore and\n         // add sufficient tests to cover.\n-        SimplifyQuery RecQ = Q;\n+        SimplifyQuery RecQ = Q.getWithoutCondContext();\n         RecQ.CxtI = P;\n         computeKnownBits(R, DemandedElts, Known2, Depth + 1, RecQ);\n         switch (Opcode) {\n@@ -1468,7 +1468,7 @@ static void computeKnownBitsFromOperator(const Operator *I,\n         // phi. This is important because that is where the value is actually\n         // \"evaluated\" even though it is used later somewhere else. (see also\n         // D69571).\n-        SimplifyQuery RecQ = Q;\n+        SimplifyQuery RecQ = Q.getWithoutCondContext();\n \n         unsigned OpNum = P->getOperand(0) == R ? 0 : 1;\n         Instruction *RInst = P->getIncomingBlock(OpNum)->getTerminator();\n@@ -1546,7 +1546,7 @@ static void computeKnownBitsFromOperator(const Operator *I,\n         // phi. This is important because that is where the value is actually\n         // \"evaluated\" even though it is used later somewhere else. (see also\n         // D69571).\n-        SimplifyQuery RecQ = Q;\n+        SimplifyQuery RecQ = Q.getWithoutCondContext();\n         RecQ.CxtI = P->getIncomingBlock(u)->getTerminator();\n \n         Known2 = KnownBits(BitWidth);\n@@ -2329,7 +2329,7 @@ bool isKnownToBeAPowerOfTwo(const Value *V, bool OrZero, unsigned Depth,\n     // it is an induction variable where in each step its value is a power of\n     // two.\n     auto *PN = cast<PHINode>(I);\n-    SimplifyQuery RecQ = Q;\n+    SimplifyQuery RecQ = Q.getWithoutCondContext();\n \n     // Check if it is an induction variable and always power of two.\n     if (isPowerOfTwoRecurrence(PN, OrZero, Depth, RecQ))\n@@ -2943,7 +2943,7 @@ static bool isKnownNonZeroFromOperator(const Operator *I,\n       return true;\n \n     // Check if all incoming values are non-zero using recursion.\n-    SimplifyQuery RecQ = Q;\n+    SimplifyQuery RecQ = Q.getWithoutCondContext();\n     unsigned NewDepth = std::max(Depth, MaxAnalysisRecursionDepth - 1);\n     return llvm::all_of(PN->operands(), [&](const Use &U) {\n       if (U.get() == PN)\n@@ -3509,7 +3509,7 @@ static bool isNonEqualPHIs(const PHINode *PN1, const PHINode *PN2,\n     if (UsedFullRecursion)\n       return false;\n \n-    SimplifyQuery RecQ = Q;\n+    SimplifyQuery RecQ = Q.getWithoutCondContext();\n     RecQ.CxtI = IncomBB->getTerminator();\n     if (!isKnownNonEqual(IV1, IV2, DemandedElts, Depth + 1, RecQ))\n       return false;\n@@ -4001,7 +4001,7 @@ static unsigned ComputeNumSignBitsImpl(const Value *V,\n \n       // Take the minimum of all incoming values.  This can't infinitely loop\n       // because of our depth threshold.\n-      SimplifyQuery RecQ = Q;\n+      SimplifyQuery RecQ = Q.getWithoutCondContext();\n       Tmp = TyBits;\n       for (unsigned i = 0, e = NumIncomingValues; i != e; ++i) {\n         if (Tmp == 1) return Tmp;\n@@ -5909,10 +5909,10 @@ void computeKnownFPClass(const Value *V, const APInt &DemandedElts,\n         // Recurse, but cap the recursion to two levels, because we don't want\n         // to waste time spinning around in loops. We need at least depth 2 to\n         // detect known sign bits.\n-        computeKnownFPClass(\n-            IncValue, DemandedElts, InterestedClasses, KnownSrc,\n-            PhiRecursionLimit,\n-            Q.getWithInstruction(P->getIncomingBlock(U)->getTerminator()));\n+        computeKnownFPClass(IncValue, DemandedElts, InterestedClasses, KnownSrc,\n+                            PhiRecursionLimit,\n+                            Q.getWithoutCondContext().getWithInstruction(\n+                                P->getIncomingBlock(U)->getTerminator()));\n \n         if (First) {\n           Known = KnownSrc;\n", "tests": [{"file": "llvm/test/Transforms/InstCombine/pr100298.ll", "commands": ["opt -S -passes=instcombine < %s"], "tests": [{"test_name": "pr100298", "test_body": "define i16 @pr100298() {\nentry:\n  br label %for.inc\n\nfor.inc:                                          ; preds = %for.inc, %entry\n  %indvar = phi i32 [ -15, %entry ], [ %mask, %for.inc ]\n  %add = add nsw i32 %indvar, 9\n  %mask = and i32 %add, 65535\n  %cmp1 = icmp ugt i32 %mask, 5\n  br i1 %cmp1, label %for.inc, label %for.end\n\nfor.end:                                          ; preds = %for.inc\n  %conv = trunc i32 %add to i16\n  %cmp2 = icmp ugt i32 %mask, 3\n  %shl = shl nuw i16 %conv, 14\n  %res = select i1 %cmp2, i16 %conv, i16 %shl\n  ret i16 %res\n}\n"}]}], "issue": {"title": "Miscompilation at O3", "body": "```\r\n#include \"csmith.h\"\r\nuint32_t a;\r\nint16_t c;\r\nvoid d() {\r\n  for (a = -15; a >= 6; a = safe_add_func_uint16_t_u_u(a, 9))\r\n    ;\r\n  c = safe_lshift_func_int16_t_s_u(safe_lshift_func_uint16_t_u_s(a,14), 0);\r\n}\r\nint main() {\r\n  d();\r\n  printf(\"%d\\n\", c);\r\n  return 0;\r\n}\r\n```\r\n\r\n```\r\ndtcxzyw@dtcxzyw:~/WorkSpace/Projects/compilers/LLVM/llvm-build$ gcc -O0 test.c -fsanitize=undefined -I/usr/include/csmith -w\r\ndtcxzyw@dtcxzyw:~/WorkSpace/Projects/compilers/LLVM/llvm-build$ ./a.out \r\n-16384\r\ndtcxzyw@dtcxzyw:~/WorkSpace/Projects/compilers/LLVM/llvm-build$ bin/clang -O3 test.c -I/usr/include/csmith -w\r\ndtcxzyw@dtcxzyw:~/WorkSpace/Projects/compilers/LLVM/llvm-build$ ./a.out \r\n0\r\n```\r\n\r\nllvm version: 2d6ff0c533aa1b0fe6d91764846f636c4a4e911c", "author": "dtcxzyw", "labels": ["miscompilation", "llvm:analysis"], "comments": [{"author": "dtcxzyw", "body": "Reduced testcase: https://alive2.llvm.org/ce/z/9fExrA\r\n```\r\n; bin/opt -passes=instcombine test.ll -S\r\ndefine i16 @src() {\r\nentry:\r\n  br label %for.inc\r\n\r\nfor.inc:\r\n  %storemerge6 = phi i32 [ -15, %entry ], [ %conv1, %for.inc ]\r\n  %add.i = add nsw i32 %storemerge6, 9\r\n  %conv1 = and i32 %add.i, 65535\r\n  %cmp = icmp ugt i32 %conv1, 5\r\n  br i1 %cmp, label %for.inc, label %for.end\r\n\r\nfor.end:\r\n  %conv2 = trunc nuw nsw i32 %conv1 to i16\r\n  %cmp3.i = icmp ugt i32 %conv1, 3\r\n  %0 = shl nuw i16 %conv2, 14\r\n  %cond.in.i = select i1 %cmp3.i, i16 %conv2, i16 %0\r\n  ret i16 %cond.in.i\r\n}\r\n```"}]}, "verified": true}
 {"bug_id": "126012", "issue_url": "https://github.com/llvm/llvm-project/issues/126012", "bug_type": "miscompilation", "base_commit": "52a02b6d1e0c6b492495ff79a3a06ce93e6180b8", "knowledge_cutoff": "2025-02-06T05:45:23Z", "lit_test_dir": ["llvm/test/Transforms/IndVarSimplify"], "hints": {"fix_commit": "7aed53eb1982113e825534f0f66d0a0e46e7a5ed", "components": ["ScalarEvolution"], "bug_location_lineno": {"llvm/lib/Analysis/ScalarEvolution.cpp": [[12400, 12405]]}, "bug_location_funcname": {"llvm/lib/Analysis/ScalarEvolution.cpp": ["ScalarEvolution::isImpliedViaMerge"]}}, "patch": "commit 7aed53eb1982113e825534f0f66d0a0e46e7a5ed\nAuthor: Nikita Popov <[email protected]>\nDate:   Mon Feb 10 10:07:21 2025 +0100\n\n    [ScalarEvolution] Handle addrec incoming value in isImpliedViaMerge() (#126236)\n    \n    The code already guards against values coming from a previous iteration\n    using properlyDominates(). However, addrecs are considered to properly\n    dominate the loop they are defined in.\n    \n    Handle this special case separately, by checking for expressions that\n    have computable loop evolution (this should cover cases like a zext of\n    an addrec as well).\n    \n    I considered changing the definition of properlyDominates() instead, but\n    decided against it. The current definition is useful in other context,\n    e.g. when deciding whether an expression is safe to expand in a given\n    block.\n    \n    Fixes https://github.com/llvm/llvm-project/issues/126012.\n\ndiff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp\nindex f89887118d8d..46a5c44f4e41 100644\n--- a/llvm/lib/Analysis/ScalarEvolution.cpp\n+++ b/llvm/lib/Analysis/ScalarEvolution.cpp\n@@ -12400,6 +12400,12 @@ bool ScalarEvolution::isImpliedViaMerge(CmpPredicate Pred, const SCEV *LHS,\n       // iteration of a loop.\n       if (!properlyDominates(L, LBB))\n         return false;\n+      // Addrecs are considered to properly dominate their loop, so are missed\n+      // by the previous check. Discard any values that have computable\n+      // evolution in this loop.\n+      if (auto *Loop = LI.getLoopFor(LBB))\n+        if (hasComputableLoopEvolution(L, Loop))\n+          return false;\n       if (!ProvedEasily(L, RHS))\n         return false;\n     }\n", "tests": [{"file": "llvm/test/Transforms/IndVarSimplify/pr126012.ll", "commands": ["opt -S -passes=indvars < %s"], "tests": [{"test_name": "test", "test_body": "define i32 @test() {\nentry:\n  br label %for.preheader\n\nfor.preheader:                                    ; preds = %for.inc, %entry\n  %indvar1 = phi i32 [ 0, %entry ], [ %phi, %for.inc ]\n  %indvar2 = phi i32 [ 1, %entry ], [ %indvar3, %for.inc ]\n  %indvar3 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]\n  %cond1 = icmp eq i32 %indvar3, 0\n  br i1 %cond1, label %for.inc, label %for.end\n\nfor.end:                                          ; preds = %for.preheader\n  %cmp = icmp sgt i32 %indvar2, 0\n  %ext = zext i1 %cmp to i32\n  br label %for.inc\n\nfor.inc:                                          ; preds = %for.end, %for.preheader\n  %phi = phi i32 [ %ext, %for.end ], [ 0, %for.preheader ]\n  %inc = add i32 %indvar3, 1\n  %exitcond = icmp eq i32 %indvar3, 2\n  br i1 %exitcond, label %for.exit, label %for.preheader\n\nfor.exit:                                         ; preds = %for.inc\n  ret i32 %indvar1\n}\n", "additional_args": "-src-unroll=4 -tgt-unroll=4"}]}], "issue": {"title": "[IndVarSimplify] Miscompilation at O2", "body": "Reproducer: https://alive2.llvm.org/ce/z/UTnMBe\n```\n; bin/opt -passes=indvars reduced.ll -S\ntarget datalayout = \"e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128\"\ntarget triple = \"x86_64-unknown-linux-gnu\"\n\[email protected] = constant [4 x i8] c\"%d\\0A\\00\"\n\ndefine i32 @main() {\nentry:\n  br label %for.cond1.preheader.i.i\n\nfor.cond1.preheader.i.i:                          ; preds = %for.inc18.i.i, %entry\n  %.pre.i.i = phi i64 [ 0, %entry ], [ %1, %for.inc18.i.i ]\n  %j.sroa.0.043.i.i = phi i64 [ 1, %entry ], [ %storemerge42.i.i, %for.inc18.i.i ]\n  %storemerge42.i.i = phi i64 [ 0, %entry ], [ %inc22.i.i, %for.inc18.i.i ]\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i\n\nfor.end.i.i:                                      ; preds = %for.cond1.preheader.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0\n  %dec.348.i.i = add i64 %.pre.i.i, 1\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0\n  br label %for.inc18.i.i\n\nfor.inc18.i.i:                                    ; preds = %for.end.i.i, %for.cond1.preheader.i.i\n  %1 = phi i64 [ %spec.select.i.i, %for.end.i.i ], [ 0, %for.cond1.preheader.i.i ]\n  %inc22.i.i = add i64 %storemerge42.i.i, 1\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i\n\ng.exit:                                           ; preds = %for.inc18.i.i\n  %conv = trunc i64 %.pre.i.i to i32\n  %call1 = call i32 (ptr, ...) @printf(ptr @.str, i32 %conv)\n  ret i32 0\n}\n\ndeclare i32 @printf(ptr, ...)\n```\nBefore:\n```\nEntering function main\n  br label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 0\n    phi i64 %j.sroa.0.043.i.i -> i64 1\n    phi i64 %storemerge42.i.i -> i64 0\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> T\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 0\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 1\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 0\n    phi i64 %j.sroa.0.043.i.i -> i64 0\n    phi i64 %storemerge42.i.i -> i64 1\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> F\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 1\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 0\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 0\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 2\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 0\n    phi i64 %j.sroa.0.043.i.i -> i64 1\n    phi i64 %storemerge42.i.i -> i64 2\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 1\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 1\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 1\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 3\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 1\n    phi i64 %j.sroa.0.043.i.i -> i64 2\n    phi i64 %storemerge42.i.i -> i64 3\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 2\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 2\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 2\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 4\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 2\n    phi i64 %j.sroa.0.043.i.i -> i64 3\n    phi i64 %storemerge42.i.i -> i64 4\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 3\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 3\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 3\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 5\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 3\n    phi i64 %j.sroa.0.043.i.i -> i64 4\n    phi i64 %storemerge42.i.i -> i64 5\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 4\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 4\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 4\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 6\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 4\n    phi i64 %j.sroa.0.043.i.i -> i64 5\n    phi i64 %storemerge42.i.i -> i64 6\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 5\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 5\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 5\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 7\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 5\n    phi i64 %j.sroa.0.043.i.i -> i64 6\n    phi i64 %storemerge42.i.i -> i64 7\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 6\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 6\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 6\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 8\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 6\n    phi i64 %j.sroa.0.043.i.i -> i64 7\n    phi i64 %storemerge42.i.i -> i64 8\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 7\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 7\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 7\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 9\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 7\n    phi i64 %j.sroa.0.043.i.i -> i64 8\n    phi i64 %storemerge42.i.i -> i64 9\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %0 = icmp sgt i64 %j.sroa.0.043.i.i, 0 -> T\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 8\n  %spec.select.i.i = select i1 %0, i64 %dec.348.i.i, i64 0 -> i64 8\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %1 -> i64 8\n  %inc22.i.i = add i64 %storemerge42.i.i, 1 -> i64 10\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> T\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %g.exit\n  %conv = trunc i64 %.pre.i.i to i32 -> i32 7\n  %call1 = call i32 (ptr, ...) @printf(ptr @.str, i32 %conv)\n    Printf: 7\n   -> i32 2\n  ret i32 0\nExiting function main\n```\nAfter:\n```\n; ModuleID = 'reduced.ll'\nsource_filename = \"reduced.ll\"\ntarget datalayout = \"e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128\"\ntarget triple = \"x86_64-unknown-linux-gnu\"\n\[email protected] = constant [4 x i8] c\"%d\\0A\\00\"\n\ndefine i32 @main() {\nentry:\n  br label %for.cond1.preheader.i.i\n\nfor.cond1.preheader.i.i:                          ; preds = %for.inc18.i.i, %entry\n  %.pre.i.i = phi i64 [ 0, %entry ], [ %0, %for.inc18.i.i ]\n  %storemerge42.i.i = phi i64 [ 0, %entry ], [ %inc22.i.i, %for.inc18.i.i ]\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i\n\nfor.end.i.i:                                      ; preds = %for.cond1.preheader.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0\n  br label %for.inc18.i.i\n\nfor.inc18.i.i:                                    ; preds = %for.end.i.i, %for.cond1.preheader.i.i\n  %0 = phi i64 [ %spec.select.i.i, %for.end.i.i ], [ 0, %for.cond1.preheader.i.i ]\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i\n\ng.exit:                                           ; preds = %for.inc18.i.i\n  %.pre.i.i.lcssa = phi i64 [ %.pre.i.i, %for.inc18.i.i ]\n  %conv = trunc i64 %.pre.i.i.lcssa to i32\n  %call1 = call i32 (ptr, ...) @printf(ptr @.str, i32 %conv)\n  ret i32 0\n}\n\ndeclare i32 @printf(ptr, ...)\n```\n```\nEntering function main\n  br label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 0\n    phi i64 %storemerge42.i.i -> i64 0\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> T\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 0\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 1\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 0\n    phi i64 %storemerge42.i.i -> i64 1\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 1\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 1\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 1\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 2\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 1\n    phi i64 %storemerge42.i.i -> i64 2\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 2\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 2\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 2\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 3\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 2\n    phi i64 %storemerge42.i.i -> i64 3\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 3\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 3\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 3\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 4\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 3\n    phi i64 %storemerge42.i.i -> i64 4\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 4\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 4\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 4\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 5\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 4\n    phi i64 %storemerge42.i.i -> i64 5\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 5\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 5\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 5\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 6\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 5\n    phi i64 %storemerge42.i.i -> i64 6\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 6\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 6\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 6\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 7\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 6\n    phi i64 %storemerge42.i.i -> i64 7\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 7\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 7\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 7\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 8\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 7\n    phi i64 %storemerge42.i.i -> i64 8\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 8\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 8\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 8\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 9\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> F\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %for.cond1.preheader.i.i\n    phi i64 %.pre.i.i -> i64 8\n    phi i64 %storemerge42.i.i -> i64 9\n  %tobool.not.i.i = icmp eq i64 %storemerge42.i.i, 0 -> F\n  br i1 %tobool.not.i.i, label %for.inc18.i.i, label %for.end.i.i jump to %for.end.i.i\n  %dec.348.i.i = add i64 %.pre.i.i, 1 -> i64 9\n  %spec.select.i.i = select i1 true, i64 %dec.348.i.i, i64 0 -> i64 9\n  br label %for.inc18.i.i jump to %for.inc18.i.i\n    phi i64 %0 -> i64 9\n  %inc22.i.i = add nuw nsw i64 %storemerge42.i.i, 1 -> i64 10\n  %exitcond50.not.i.i = icmp eq i64 %storemerge42.i.i, 9 -> T\n  br i1 %exitcond50.not.i.i, label %g.exit, label %for.cond1.preheader.i.i jump to %g.exit\n    phi i64 %.pre.i.i.lcssa -> i64 8\n  %conv = trunc i64 %.pre.i.i.lcssa to i32 -> i32 8\n  %call1 = call i32 (ptr, ...) @printf(ptr @.str, i32 %conv)\n    Printf: 8\n   -> i32 2\n  ret i32 0\nExiting function main\n```\nllvm version: 52fc6ffcda0895c0c7b976ad1f5cb5a282b571d2", "author": "dtcxzyw", "labels": ["miscompilation", "llvm:SCEV"], "comments": [{"author": "dtcxzyw", "body": "Reduced reproducer: https://alive2.llvm.org/ce/z/_x96gs\n```\n; bin/opt -passes=indvars reduced.ll -S --debug\ndefine i32 @src() {\nentry:\n  br label %for.preheader\n\nfor.preheader:\n  %indvar1 = phi i32 [ 0, %entry ], [ %phi, %for.inc ]\n  %indvar2 = phi i32 [ 1, %entry ], [ %indvar3, %for.inc ]\n  %indvar3 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]\n  %cond1 = icmp eq i32 %indvar3, 0\n  br i1 %cond1, label %for.inc, label %for.end\n\nfor.end:\n  %cmp = icmp sgt i32 %indvar2, 0\n  %ext = zext i1 %cmp to i32\n  br label %for.inc\n\nfor.inc:\n  %phi = phi i32 [ %ext, %for.end ], [ 0, %for.preheader ]\n  %inc = add i32 %indvar3, 1\n  %exitcond = icmp eq i32 %indvar3, 2\n  br i1 %exitcond, label %for.exit, label %for.preheader\n\nfor.exit:\n  ret i32 %indvar1\n}\n\n```\n```\nINDVARS: Eliminated comparison:   %cmp = icmp sgt i32 %indvar2, 0\n\ndefine i32 @src() {\nentry:\n  br label %for.preheader\n\nfor.preheader:                                    ; preds = %for.inc, %entry\n  %indvar1 = phi i32 [ 0, %entry ], [ %phi, %for.inc ]\n  %indvar3 = phi i32 [ 0, %entry ], [ %inc, %for.inc ]\n  %cond1 = icmp eq i32 %indvar3, 0\n  br i1 %cond1, label %for.inc, label %for.end\n\nfor.end:                                          ; preds = %for.preheader\n  %ext = zext i1 true to i32\n  br label %for.inc\n\nfor.inc:                                          ; preds = %for.end, %for.preheader\n  %phi = phi i32 [ %ext, %for.end ], [ 0, %for.preheader ]\n  %inc = add nuw nsw i32 %indvar3, 1\n  %exitcond = icmp eq i32 %indvar3, 2\n  br i1 %exitcond, label %for.exit, label %for.preheader\n\nfor.exit:                                         ; preds = %for.inc\n  %indvar1.lcssa = phi i32 [ %indvar1, %for.inc ]\n  ret i32 %indvar1.lcssa\n}\n```\n`ScalarEvolution::isImpliedViaMerge(sgt, %indvar2, 0, {0,+,1}<nuw><nsw><%for.preheader>(= %indvar3), 0)` wrongly returns true.\nI can't quite understand why `%indvar3` properly dominates `%for.preheader`: https://github.com/llvm/llvm-project/blob/26ecddb05d13c101ccd840a6710eb5f8b82de841/llvm/lib/Analysis/ScalarEvolution.cpp#L14131-L14141\n\n@nikic @fhahn Can you help fix this issue?\n\n\n"}, {"author": "nikic", "body": "Related previous fix: https://reviews.llvm.org/D101829"}]}, "verified": true}
+{"bug_id": "143123", "issue_url": "https://github.com/llvm/llvm-project/issues/143123", "bug_type": "miscompilation", "base_commit": "5d3899d293e902124c3602b466031b6b799fb123", "knowledge_cutoff": "2025-06-06T12:10:51Z", "lit_test_dir": ["llvm/test/Transforms/InstCombine"], "hints": {"fix_commit": "2f15637e04f51e3ef435c0c0d39aab0e8b933023", "components": ["ValueTracking"], "bug_location_lineno": {"llvm/lib/Analysis/ValueTracking.cpp": [[8660, 8665]]}, "bug_location_funcname": {"llvm/lib/Analysis/ValueTracking.cpp": ["matchSelectPattern"]}}, "patch": "commit 2f15637e04f51e3ef435c0c0d39aab0e8b933023\nAuthor: Yingwei Zheng <[email protected]>\nDate:   Mon Jun 9 15:46:09 2025 +0800\n\n    [ValueTracking] Update `Ordered` when both operands are non-NaN. (#143349)\n    \n    When the original predicate is ordered and both operands are non-NaN,\n    `Ordered` should be set to true. This variable still matters even if\n    both operands are non-NaN because FMF only applies to select, not fcmp.\n    \n    Closes https://github.com/llvm/llvm-project/issues/143123.\n\ndiff --git a/llvm/lib/Analysis/ValueTracking.cpp b/llvm/lib/Analysis/ValueTracking.cpp\nindex d6bb852e208f..d8c1096049dc 100644\n--- a/llvm/lib/Analysis/ValueTracking.cpp\n+++ b/llvm/lib/Analysis/ValueTracking.cpp\n@@ -8660,6 +8660,7 @@ static SelectPatternResult matchSelectPattern(CmpInst::Predicate Pred,\n     if (LHSSafe && RHSSafe) {\n       // Both operands are known non-NaN.\n       NaNBehavior = SPNB_RETURNS_ANY;\n+      Ordered = CmpInst::isOrdered(Pred);\n     } else if (CmpInst::isOrdered(Pred)) {\n       // An ordered comparison will return false when given a NaN, so it\n       // returns the RHS.\n", "tests": [{"file": "llvm/test/Transforms/InstCombine/fcmp-select.ll", "commands": ["opt < %s -passes=instcombine -S"], "tests": [{"test_name": "test_fcmp_ord_select_fcmp_oeq_var_const", "test_body": "define i1 @test_fcmp_ord_select_fcmp_oeq_var_const(double %x) {\n  %cmp1 = fcmp ord double %x, 0.000000e+00\n  %sel = select i1 %cmp1, double %x, double 0.000000e+00\n  %cmp2 = fcmp oeq double %sel, 1.000000e+00\n  ret i1 %cmp2\n}\n"}, {"test_name": "test_select_nnan_nsz_fcmp_olt", "test_body": "define float @test_select_nnan_nsz_fcmp_olt(float %x) {\n  %cmp = fcmp olt float %x, 0.000000e+00\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000e+00\n  ret float %sel\n}\n"}, {"test_name": "test_select_nnan_nsz_fcmp_ult", "test_body": "define float @test_select_nnan_nsz_fcmp_ult(float %x) {\n  %cmp = fcmp ult float %x, 0.000000e+00\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000e+00\n  ret float %sel\n}\n"}, {"test_name": "test_fcmp_select_var_const_unordered", "test_body": "define i1 @test_fcmp_select_var_const_unordered(double %x, double %y) {\n  %cmp1 = fcmp ult double %x, 0x3E80000000000000\n  %sel = select i1 %cmp1, double %y, double 0.000000e+00\n  %cmp2 = fcmp ugt double %sel, 0x3E80000000000000\n  ret i1 %cmp2\n}\n"}]}], "issue": {"title": "[InstCombine] fcmp is incorrectly inverted", "body": "Reproducer: https://alive2.llvm.org/ce/z/yVw9wM\n```\ndefine float @src(float %x) {\n  %cmp = fcmp olt float %x, 0.000000e+00\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000e+00\n  ret float %sel\n}\n\ndefine float @tgt(float %x) {\n  %.inv = fcmp oge float %x, 0.000000e+00\n  %sel1 = select i1 %.inv, float -0.000000e+00, float %x\n  ret float %sel1\n}\n```\n```\n----------------------------------------\ndefine float @src(float %x) {\n#0:\n  %cmp = fcmp olt float %x, 0.000000\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000\n  ret float %sel\n}\n=>\ndefine float @tgt(float %x) {\n#0:\n  %.inv = fcmp oge float %x, 0.000000\n  %sel1 = select i1 %.inv, float -0.000000, float %x\n  ret float %sel1\n}\nTransformation doesn't verify!\n\nERROR: Value mismatch\n\nExample:\nfloat %x = #x7f800002 (SNaN)\n\nSource:\ni1 %cmp = #x0 (0)\nfloat %sel = #x80000000 (-0.0)\n\nTarget:\ni1 %.inv = #x0 (0)\nfloat %sel1 = #x7f800002 (SNaN)\nSource value: #x80000000 (-0.0)\nTarget value: #x7f800002 (SNaN)\n```\n", "author": "dtcxzyw", "labels": ["miscompilation", "floating-point", "llvm:analysis", "generated by fuzzer"], "comments": []}, "verified": true}
 {"bug_id": "141968", "issue_url": "https://github.com/llvm/llvm-project/issues/141968", "bug_type": "crash", "base_commit": "389e9d3a422f17356d1f90913b891d23011ae5b3", "knowledge_cutoff": "2025-05-29T15:40:08Z", "lit_test_dir": ["llvm/test/Transforms/LoopVectorize"], "hints": {"fix_commit": "b8c4eea3d8b2a2df9442319de14ef38c2492428d", "components": ["LoopVectorize"], "bug_location_lineno": {"llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp": [[1015, 1027]]}, "bug_location_funcname": {"llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp": ["simplifyRecipe"]}}, "patch": "commit b8c4eea3d8b2a2df9442319de14ef38c2492428d\nAuthor: Ramkumar Ramachandra <[email protected]>\nDate:   Mon Jun 2 15:56:35 2025 +0200\n\n    [VPlan] Simplify PredPHI LiveIn -> LiveIn (#142271)\n    \n    5f39be5 ([VPlan] Use InstSimplifyFolder instead of TargetFolder) updated\n    simplifyRecipe to fold live-ins to Values that are not necessarily\n    Constant, but forgot to update the corresponding PredPHI folder, which\n    still folds PredPHI constant -> constant. Update it to fold PredPHI\n    LiveIn -> LiveIn.\n    \n    Fixes #141968.\n\ndiff --git a/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp b/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp\nindex 5b42a9056b69..348100124ba3 100644\n--- a/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp\n+++ b/llvm/lib/Transforms/Vectorize/VPlanTransforms.cpp\n@@ -1015,13 +1015,11 @@ static void simplifyRecipe(VPRecipeBase &R, VPTypeAnalysis &TypeInfo) {\n           .Default([](auto *) { return false; }))\n     return;\n \n-  // Fold PredPHI constant -> constant.\n+  // Fold PredPHI LiveIn -> LiveIn.\n   if (auto *PredPHI = dyn_cast<VPPredInstPHIRecipe>(&R)) {\n     VPValue *Op = PredPHI->getOperand(0);\n-    if (!Op->isLiveIn() || !Op->getLiveInIRValue())\n-      return;\n-    if (auto *C = dyn_cast<Constant>(Op->getLiveInIRValue()))\n-      PredPHI->replaceAllUsesWith(Plan->getOrAddLiveIn(C));\n+    if (Op->isLiveIn())\n+      PredPHI->replaceAllUsesWith(Op);\n   }\n \n   VPValue *A;\n", "tests": [{"file": "llvm/test/Transforms/LoopVectorize/X86/pr141968-instsimplifyfolder.ll", "commands": ["opt -passes=loop-vectorize -S %s"], "tests": [{"test_name": "<module>", "test_body": "\ntarget triple = \"x86_64\"\n\ndefine i8 @pr141968(i1 %cond, i8 %v) {\n;\nentry:\n  %zext.true = zext i1 true to i16\n  %sext = sext i8 %v to i16\n  br label %loop.header\n\nloop.header:                                      ; preds = %loop.latch, %entry\n  %iv = phi i8 [ %iv.next, %loop.latch ], [ 0, %entry ]\n  br i1 %cond, label %loop.latch, label %cond.false\n\ncond.false:                                       ; preds = %loop.header\n  %sdiv = sdiv i16 %sext, %zext.true\n  %sdiv.trunc = trunc i16 %sdiv to i8\n  br label %loop.latch\n\nloop.latch:                                       ; preds = %cond.false, %loop.header\n  %ret = phi i8 [ %sdiv.trunc, %cond.false ], [ 0, %loop.header ]\n  %iv.next = add i8 %iv, 1\n  %exitcond = icmp eq i8 %iv.next, 0\n  br i1 %exitcond, label %exit, label %loop.header\n\nexit:                                             ; preds = %loop.latch\n  ret i8 %ret\n}"}]}], "issue": {"title": "[LoopVectorize] Assertion `PredicatingBB && \"Predicated block has no single predecessor.\"' failed.", "body": "Crash reproducer:\n```\n; bin/opt -passes=loop-vectorize test.ll -S\ntarget datalayout = \"e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128\"\ntarget triple = \"x86_64-unknown-linux-gnu\"\n\ndefine i32 @main(i1 %cmp.i679.i.i.i, ptr %p) {\nentry:\n  br label %for.cond1.preheader.i\n\nfor.cond1.preheader.i:                            ; preds = %for.cond1.preheader.i, %entry\n  %indvars.iv.i = phi i64 [ 0, %entry ], [ %indvars.iv.next.i, %for.cond1.preheader.i ]\n  %arrayidx.i = getelementptr [256 x i32], ptr %p, i64 0, i64 %indvars.iv.i\n  store i32 0, ptr %arrayidx.i, align 4\n  %indvars.iv.next.i = add i64 %indvars.iv.i, 1\n  %exitcond.not.i = icmp eq i64 %indvars.iv.i, 1\n  br i1 %exitcond.not.i, label %crc32_gentab.exit, label %for.cond1.preheader.i\n\ncrc32_gentab.exit:                                ; preds = %for.cond1.preheader.i\n  %div.rhs.trunc.i.i.i.i = sext i8 1 to i16\n  %0 = trunc i32 0 to i16\n  br label %for.body222.i.i.i\n\nfor.body222.i.i.i:                                ; preds = %safe_mod_func_int32_t_s_s.exit.i.i.i, %crc32_gentab.exit\n  %p_188.addr.2816.i.i.i = phi i16 [ 0, %crc32_gentab.exit ], [ %inc272.i.i.i, %safe_mod_func_int32_t_s_s.exit.i.i.i ]\n  br i1 %cmp.i679.i.i.i, label %safe_mod_func_int32_t_s_s.exit.i.i.i, label %cond.false.i683.i.i.i\n\ncond.false.i683.i.i.i:                            ; preds = %for.body222.i.i.i\n  %div16.i.i.i.i = sdiv i16 %0, %div.rhs.trunc.i.i.i.i\n  %1 = zext i16 %div16.i.i.i.i to i32\n  br label %safe_mod_func_int32_t_s_s.exit.i.i.i\n\nsafe_mod_func_int32_t_s_s.exit.i.i.i:             ; preds = %cond.false.i683.i.i.i, %for.body222.i.i.i\n  %cond.i684.i.i.i = phi i32 [ %1, %cond.false.i683.i.i.i ], [ 0, %for.body222.i.i.i ]\n  %inc272.i.i.i = add i16 %p_188.addr.2816.i.i.i, 1\n  %exitcond.not.i.i.i = icmp eq i16 %inc272.i.i.i, 0\n  br i1 %exitcond.not.i.i.i, label %if.else417.i.i.i, label %for.body222.i.i.i\n\nif.else417.i.i.i:                                 ; preds = %safe_mod_func_int32_t_s_s.exit.i.i.i\n  ret i32 %cond.i684.i.i.i\n}\n```\n```\nopt: /home/dtcxzyw/WorkSpace/Projects/compilers/llvm-project/llvm/lib/Transforms/Vectorize/VPlanRecipes.cpp:2885: virtual void llvm::VPPredInstPHIRecipe::execute(llvm::VPTransformState&): Assertion `PredicatingBB && \"Predicated block has no single predecessor.\"' failed.\nPLEASE submit a bug report to https://github.com/llvm/llvm-project/issues/ and include the crash backtrace.\nStack dump:\n0.      Program arguments: bin/opt -passes=loop-vectorize reduced.ll -S\n1.      Running pass \"function(loop-vectorize<no-interleave-forced-only;no-vectorize-forced-only;>)\" on module \"reduced.ll\"\n2.      Running pass \"loop-vectorize<no-interleave-forced-only;no-vectorize-forced-only;>\" on function \"main\"\n #0 0x00007088da627ab2 llvm::sys::PrintStackTrace(llvm::raw_ostream&, int) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/libLLVMSupport.so.21.0git+0x227ab2)\n #1 0x00007088da62498f llvm::sys::RunSignalHandlers() (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/libLLVMSupport.so.21.0git+0x22498f)\n #2 0x00007088da624ad4 SignalHandler(int, siginfo_t*, void*) Signals.cpp:0:0\n #3 0x00007088da045330 (/lib/x86_64-linux-gnu/libc.so.6+0x45330)\n #4 0x00007088da09eb2c __pthread_kill_implementation ./nptl/pthread_kill.c:44:76\n #5 0x00007088da09eb2c __pthread_kill_internal ./nptl/pthread_kill.c:78:10\n #6 0x00007088da09eb2c pthread_kill ./nptl/pthread_kill.c:89:10\n #7 0x00007088da04527e raise ./signal/../sysdeps/posix/raise.c:27:6\n #8 0x00007088da0288ff abort ./stdlib/abort.c:81:7\n #9 0x00007088da02881b _nl_load_domain ./intl/loadmsgcat.c:1177:9\n#10 0x00007088da03b517 (/lib/x86_64-linux-gnu/libc.so.6+0x3b517)\n#11 0x00007088d38e230e llvm::VPPredInstPHIRecipe::execute(llvm::VPTransformState&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x2e230e)\n#12 0x00007088d3889738 llvm::VPBasicBlock::executeRecipes(llvm::VPTransformState*, llvm::BasicBlock*) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x289738)\n#13 0x00007088d389abd5 llvm::VPBasicBlock::execute(llvm::VPTransformState*) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x29abd5)\n#14 0x00007088d388c05d llvm::VPRegionBlock::execute(llvm::VPTransformState*) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x28c05d)\n#15 0x00007088d389cff5 llvm::VPlan::execute(llvm::VPTransformState*) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x29cff5)\n#16 0x00007088d36f1382 llvm::LoopVectorizationPlanner::executePlan(llvm::ElementCount, unsigned int, llvm::VPlan&, llvm::InnerLoopVectorizer&, llvm::DominatorTree*, bool) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0xf1382)\n#17 0x00007088d3709d6f llvm::LoopVectorizePass::processLoop(llvm::Loop*) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x109d6f)\n#18 0x00007088d370bf11 llvm::LoopVectorizePass::runImpl(llvm::Function&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x10bf11)\n#19 0x00007088d370c586 llvm::LoopVectorizePass::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMVectorize.so.21.0git+0x10c586)\n#20 0x00007088d42ec9c5 llvm::detail::PassModel<llvm::Function, llvm::LoopVectorizePass, llvm::AnalysisManager<llvm::Function>>::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMPasses.so.21.0git+0xec9c5)\n#21 0x00007088d1127444 llvm::PassManager<llvm::Function, llvm::AnalysisManager<llvm::Function>>::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMCore.so.21.0git+0x327444)\n#22 0x00007088d90db9b5 llvm::detail::PassModel<llvm::Function, llvm::PassManager<llvm::Function, llvm::AnalysisManager<llvm::Function>>, llvm::AnalysisManager<llvm::Function>>::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMX86CodeGen.so.21.0git+0xdb9b5)\n#23 0x00007088d1127960 llvm::ModuleToFunctionPassAdaptor::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMCore.so.21.0git+0x327960)\n#24 0x00007088d90dc375 llvm::detail::PassModel<llvm::Module, llvm::ModuleToFunctionPassAdaptor, llvm::AnalysisManager<llvm::Module>>::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMX86CodeGen.so.21.0git+0xdc375)\n#25 0x00007088d1128ae5 llvm::PassManager<llvm::Module, llvm::AnalysisManager<llvm::Module>>::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/../lib/libLLVMCore.so.21.0git+0x328ae5)\n#26 0x00007088da7912e9 llvm::runPassPipeline(llvm::StringRef, llvm::Module&, llvm::TargetMachine*, llvm::TargetLibraryInfoImpl*, llvm::ToolOutputFile*, llvm::ToolOutputFile*, llvm::ToolOutputFile*, llvm::StringRef, llvm::ArrayRef<llvm::PassPlugin>, llvm::ArrayRef<std::function<void (llvm::PassBuilder&)>>, llvm::opt_tool::OutputKind, llvm::opt_tool::VerifierKind, bool, bool, bool, bool, bool, bool, bool) (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/libLLVMOptDriver.so.21.0git+0x2c2e9)\n#27 0x00007088da79c306 optMain (/home/dtcxzyw/WorkSpace/Projects/compilers/LLVM/llvm-build/bin/../lib/libLLVMOptDriver.so.21.0git+0x37306)\n#28 0x00007088da02a1ca __libc_start_call_main ./csu/../sysdeps/nptl/libc_start_call_main.h:74:3\n#29 0x00007088da02a28b call_init ./csu/../csu/libc-start.c:128:20\n#30 0x00007088da02a28b __libc_start_main ./csu/../csu/libc-start.c:347:5\n#31 0x000064bed9823095 _start (bin/opt+0x1095)\nAborted (core dumped)\n```\nllvm version: 94bcd9ceedc7e194b6296e4a293c60b8e38d1b67", "author": "dtcxzyw", "labels": ["vectorizers", "crash-on-valid", "generated by fuzzer"], "comments": [{"author": "gregbedwell", "body": "We've hit this as well in our testing.\nhttps://godbolt.org/z/hjGqcsWso\n\n```\ntarget datalayout = \"e-m:e-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-f80:128-n8:16:32:64-S128\"\ntarget triple = \"x86_64-unknown-unknown\"\n\ndefine i8 @g(i1 %cmp3) {\nentry:\n  %0 = zext i1 true to i16\n  %div.lhs.trunc = sext i8 0 to i16\n  br label %for.body\n\nfor.body:                                         ; preds = %cond.end, %entry\n  %b.014 = phi i8 [ %inc, %cond.end ], [ 0, %entry ]\n  br i1 %cmp3, label %cond.end, label %cond.false\n\ncond.false:                                       ; preds = %for.body\n  %div13 = sdiv i16 %div.lhs.trunc, %0\n  %1 = trunc i16 %div13 to i8\n  br label %cond.end\n\ncond.end:                                         ; preds = %cond.false, %for.body\n  %cond = phi i8 [ %1, %cond.false ], [ 0, %for.body ]\n  %inc = add i8 %b.014, 1\n  %exitcond.not = icmp eq i8 %inc, 0\n  br i1 %exitcond.not, label %for.end, label %for.body\n\nfor.end:                                          ; preds = %cond.end\n  ret i8 %cond\n}\n```\n\n```\nopt: /root/llvm-project/llvm/lib/Transforms/Vectorize/VPlanRecipes.cpp:2885: virtual void llvm::VPPredInstPHIRecipe::execute(llvm::VPTransformState&): Assertion `PredicatingBB && \"Predicated block has no single predecessor.\"' failed.\nPLEASE submit a bug report to https://github.com/llvm/llvm-project/issues/ and include the crash backtrace.\nStack dump:\n0.\tProgram arguments: /opt/compiler-explorer/clang-assertions-trunk/bin/opt -o /app/output.s -S --passes=loop-vectorize <source>\n1.\tRunning pass \"function(loop-vectorize<no-interleave-forced-only;no-vectorize-forced-only;>)\" on module \"<source>\"\n2.\tRunning pass \"loop-vectorize<no-interleave-forced-only;no-vectorize-forced-only;>\" on function \"g\"\n #0 0x0000000005603c18 llvm::sys::PrintStackTrace(llvm::raw_ostream&, int) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x5603c18)\n #1 0x00000000056015a4 SignalHandler(int, siginfo_t*, void*) Signals.cpp:0:0\n #2 0x000071a65b642520 (/lib/x86_64-linux-gnu/libc.so.6+0x42520)\n #3 0x000071a65b6969fc pthread_kill (/lib/x86_64-linux-gnu/libc.so.6+0x969fc)\n #4 0x000071a65b642476 gsignal (/lib/x86_64-linux-gnu/libc.so.6+0x42476)\n #5 0x000071a65b6287f3 abort (/lib/x86_64-linux-gnu/libc.so.6+0x287f3)\n #6 0x000071a65b62871b (/lib/x86_64-linux-gnu/libc.so.6+0x2871b)\n #7 0x000071a65b639e96 (/lib/x86_64-linux-gnu/libc.so.6+0x39e96)\n #8 0x00000000035fc5b7 llvm::VPPredInstPHIRecipe::execute(llvm::VPTransformState&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x35fc5b7)\n #9 0x00000000035a9a8a llvm::VPBasicBlock::executeRecipes(llvm::VPTransformState*, llvm::BasicBlock*) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x35a9a8a)\n#10 0x00000000035bc70d llvm::VPBasicBlock::execute(llvm::VPTransformState*) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x35bc70d)\n#11 0x00000000035afb81 llvm::VPRegionBlock::execute(llvm::VPTransformState*) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x35afb81)\n#12 0x00000000035bf201 llvm::VPlan::execute(llvm::VPTransformState*) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x35bf201)\n#13 0x0000000003459b9b llvm::LoopVectorizationPlanner::executePlan(llvm::ElementCount, unsigned int, llvm::VPlan&, llvm::InnerLoopVectorizer&, llvm::DominatorTree*, bool) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x3459b9b)\n#14 0x0000000003470889 llvm::LoopVectorizePass::processLoop(llvm::Loop*) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x3470889)\n#15 0x0000000003472670 llvm::LoopVectorizePass::runImpl(llvm::Function&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x3472670)\n#16 0x0000000003472cc3 llvm::LoopVectorizePass::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x3472cc3)\n#17 0x0000000002d824be llvm::detail::PassModel<llvm::Function, llvm::LoopVectorizePass, llvm::AnalysisManager<llvm::Function>>::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x2d824be)\n#18 0x00000000053fa1f0 llvm::PassManager<llvm::Function, llvm::AnalysisManager<llvm::Function>>::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x53fa1f0)\n#19 0x0000000000e91dde llvm::detail::PassModel<llvm::Function, llvm::PassManager<llvm::Function, llvm::AnalysisManager<llvm::Function>>, llvm::AnalysisManager<llvm::Function>>::run(llvm::Function&, llvm::AnalysisManager<llvm::Function>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0xe91dde)\n#20 0x00000000053fa703 llvm::ModuleToFunctionPassAdaptor::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x53fa703)\n#21 0x0000000000e90c2e llvm::detail::PassModel<llvm::Module, llvm::ModuleToFunctionPassAdaptor, llvm::AnalysisManager<llvm::Module>>::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0xe90c2e)\n#22 0x00000000053f8320 llvm::PassManager<llvm::Module, llvm::AnalysisManager<llvm::Module>>::run(llvm::Module&, llvm::AnalysisManager<llvm::Module>&) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x53f8320)\n#23 0x00000000009519ea llvm::runPassPipeline(llvm::StringRef, llvm::Module&, llvm::TargetMachine*, llvm::TargetLibraryInfoImpl*, llvm::ToolOutputFile*, llvm::ToolOutputFile*, llvm::ToolOutputFile*, llvm::StringRef, llvm::ArrayRef<llvm::PassPlugin>, llvm::ArrayRef<std::function<void (llvm::PassBuilder&)>>, llvm::opt_tool::OutputKind, llvm::opt_tool::VerifierKind, bool, bool, bool, bool, bool, bool, bool) (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x9519ea)\n#24 0x00000000009451bc optMain (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x9451bc)\n#25 0x000071a65b629d90 (/lib/x86_64-linux-gnu/libc.so.6+0x29d90)\n#26 0x000071a65b629e40 __libc_start_main (/lib/x86_64-linux-gnu/libc.so.6+0x29e40)\n#27 0x000000000093cdf5 _start (/opt/compiler-explorer/clang-assertions-trunk/bin/opt+0x93cdf5)\nProgram terminated with signal: SIGSEGV\nCompiler returned: 139\n```\n\nBisected to 5f39be591714eba1be413e2b3ed6fc152a15bb8e"}]}, "verified": true}
 {"bug_id": "116553", "issue_url": "https://github.com/llvm/llvm-project/issues/116553", "bug_type": "miscompilation", "base_commit": "c25e09e238c6f872a116d10bbefba0beff145a57", "knowledge_cutoff": "2024-11-17T18:49:16Z", "lit_test_dir": ["llvm/test/Transforms/ConstraintElimination"], "hints": {"fix_commit": "52361d0368b79841be12156bf03cf8c1851e5df7", "components": ["ConstraintElimination"], "bug_location_lineno": {"llvm/lib/Transforms/Scalar/ConstraintElimination.cpp": [[1034, 1042], [1044, 1051]]}, "bug_location_funcname": {"llvm/lib/Transforms/Scalar/ConstraintElimination.cpp": ["State::addInfoForInductions"]}}, "patch": "commit 52361d0368b79841be12156bf03cf8c1851e5df7\nAuthor: Yingwei Zheng <[email protected]>\nDate:   Mon Nov 18 23:41:04 2024 +0800\n\n    [ConstraintElim] Bail out on non-dedicated exits when adding exiting conditions (#116627)\n    \n    This patch bails out non-dedicated exits to avoid adding exiting\n    conditions to invalid context.\n    Closes https://github.com/llvm/llvm-project/issues/116553.\n\ndiff --git a/llvm/lib/Transforms/Scalar/ConstraintElimination.cpp b/llvm/lib/Transforms/Scalar/ConstraintElimination.cpp\nindex d2e532d29d07..64433cb9216c 100644\n--- a/llvm/lib/Transforms/Scalar/ConstraintElimination.cpp\n+++ b/llvm/lib/Transforms/Scalar/ConstraintElimination.cpp\n@@ -1034,9 +1034,9 @@ void State::addInfoForInductions(BasicBlock &BB) {\n       DTN, CmpInst::ICMP_SLT, PN, B,\n       ConditionTy(CmpInst::ICMP_SLE, StartValue, B)));\n \n-  // Try to add condition from header to the exit blocks. When exiting either\n-  // with EQ or NE in the header, we know that the induction value must be u<=\n-  // B, as other exits may only exit earlier.\n+  // Try to add condition from header to the dedicated exit blocks. When exiting\n+  // either with EQ or NE in the header, we know that the induction value must\n+  // be u<= B, as other exits may only exit earlier.\n   assert(!StepOffset.isNegative() && \"induction must be increasing\");\n   assert((Pred == CmpInst::ICMP_EQ || Pred == CmpInst::ICMP_NE) &&\n          \"unsupported predicate\");\n@@ -1044,8 +1044,11 @@ void State::addInfoForInductions(BasicBlock &BB) {\n   SmallVector<BasicBlock *> ExitBBs;\n   L->getExitBlocks(ExitBBs);\n   for (BasicBlock *EB : ExitBBs) {\n-    WorkList.emplace_back(FactOrCheck::getConditionFact(\n-        DT.getNode(EB), CmpInst::ICMP_ULE, A, B, Precond));\n+    // Bail out on non-dedicated exits.\n+    if (DT.dominates(&BB, EB)) {\n+      WorkList.emplace_back(FactOrCheck::getConditionFact(\n+          DT.getNode(EB), CmpInst::ICMP_ULE, A, B, Precond));\n+    }\n   }\n }\n \n", "tests": [{"file": "llvm/test/Transforms/ConstraintElimination/induction-condition-in-loop-exit.ll", "commands": ["opt -p constraint-elimination -S %s"], "tests": [{"test_name": "test_non_dedicated_exit", "test_body": "define i1 @test_non_dedicated_exit(i16 %n) {\nentry:\n  %cond = icmp slt i16 %n, 1\n  br i1 %cond, label %exit, label %loop.preheader\n\nloop.preheader:                                   ; preds = %entry\n  %sub = add nsw i16 %n, -1\n  %ext = zext nneg i16 %sub to i32\n  br label %loop\n\nloop:                                             ; preds = %loop.latch, %loop.preheader\n  %indvar = phi i32 [ %indvar.inc, %loop.latch ], [ 0, %loop.preheader ]\n  %exitcond = icmp eq i32 %indvar, %ext\n  br i1 %exitcond, label %exit, label %loop.latch\n\nloop.latch:                                       ; preds = %loop\n  %indvar.inc = add nuw nsw i32 %indvar, 1\n  br label %loop\n\nexit:                                             ; preds = %loop, %entry\n  %cmp = icmp sgt i16 %n, 0\n  ret i1 %cmp\n}\n"}]}], "issue": {"title": "[clang] Miscompile at O3 with SIGKILL", "body": "When I compiled this code with O3, it triggered SIGKILL. With O0/1/2, it returned 0.\r\n\r\nBisected to https://github.com/llvm/llvm-project/commit/5b927130b0e15a442a6ed171f43a612e6a40bbcd, which was committed by @fhahn \r\n\r\nCompiler Explorer: https://godbolt.org/z/q9j75feYG\r\n\r\nCode:\r\n```c\r\nint printf(const char *, ...);\r\nint a, c, d;\r\nint *b;\r\nchar e;\r\nshort f;\r\nint g(int i) {\r\n  if (i <= 0)\r\n    return 1;\r\n  int h = 0;\r\n  for (; h < i - 1; h++) {\r\n    for (; d - h - 1;)\r\n      if (c)\r\n        b[d] = e = 1;\r\n    if (e)\r\n      break;\r\n  }\r\n  return 0;\r\n}\r\nvoid j() { g(f); }\r\nint main(int i, char *k[]) {\r\n  j();\r\n  while (0 < f)\r\n    ;\r\n  printf(\"%X\\n\", a);\r\n}\r\n```", "author": "cardigan1008", "labels": ["miscompilation", "confirmed", "llvm:transforms"], "comments": [{"author": "dtcxzyw", "body": "Reproducer: https://alive2.llvm.org/ce/z/fLN5gw\r\n```\r\n; bin/opt -passes=constraint-elimination test.ll -S\r\ndefine i1 @test(i16 %n) {\r\nentry:\r\n  %cond = icmp slt i16 %n, 1\r\n  br i1 %cond, label %exit, label %loop.preheader\r\n\r\nloop.preheader:\r\n  %sub = add nsw i16 %n, -1\r\n  %ext = zext nneg i16 %sub to i32\r\n  br label %loop\r\n\r\nloop:\r\n  %indvar = phi i32 [ %indvar.inc, %loop.latch ], [ 0, %loop.preheader ]\r\n  %12 = icmp eq i32 %indvar, %ext\r\n  br i1 %12, label %exit, label %loop.latch\r\n\r\nloop.latch:\r\n  %indvar.inc = add nuw nsw i32 %indvar, 1\r\n  br label %loop\r\n\r\nexit:\r\n  %cmp = icmp sgt i16 %n, 0\r\n  ret i1 %cmp\r\n}\r\n\r\n```\r\nI will post a fix later.\r\n"}]}, "verified": true}
 {"bug_id": "107015", "issue_url": "https://github.com/llvm/llvm-project/issues/107015", "bug_type": "crash", "base_commit": "50a02e7c68f964c5d8338369746c849ed8d3bef4", "knowledge_cutoff": "2024-09-02T18:45:19Z", "lit_test_dir": ["llvm/test/Transforms/LoopVectorize"], "hints": {"fix_commit": "954ed05c1001489802ae43d4bea403181570a799", "components": ["LoopVectorize"], "bug_location_lineno": {"llvm/lib/Transforms/Vectorize/LoopVectorize.cpp": [[8393, 8398]], "llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h": [[174, 184]]}, "bug_location_funcname": {"llvm/lib/Transforms/Vectorize/LoopVectorize.cpp": ["VPRecipeBuilder::tryToWiden"], "llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h": ["getVPValueOrAddLiveIn"]}}, "patch": "commit 954ed05c1001489802ae43d4bea403181570a799\nAuthor: Florian Hahn <[email protected]>\nDate:   Mon Sep 2 21:25:30 2024 +0100\n\n    [VPlan] Simplify MUL operands at recipe construction.\n    \n    This moves the logic to create simplified operands using SCEV to MUL\n    recipe creation. This is needed to match the behavior of the legacy's cost\n    model. TODOs are to extend to other opcodes and move to a transform.\n    \n    Note that this also restricts the number of SCEV simplifications we\n    apply to more precisely match the cases handled by the legacy cost\n    model.\n    \n    Fixes https://github.com/llvm/llvm-project/issues/107015.\n\ndiff --git a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp\nindex a8722db654f5..a64848c1fdce 100644\n--- a/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp\n+++ b/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp\n@@ -8393,6 +8393,20 @@ VPWidenRecipe *VPRecipeBuilder::tryToWiden(Instruction *I,\n   case Instruction::Sub:\n   case Instruction::Xor:\n   case Instruction::Freeze:\n+    if (I->getOpcode() == Instruction::Mul) {\n+      // Simplify operands of multiplications using SCEV. This is needed at the\n+      // moment to match the behavior of the legacy cost-model.\n+      // TODO: Generalize to any opcode and move to VPlan transformation.\n+      SmallVector<VPValue *> NewOps(Operands);\n+      ScalarEvolution &SE = *PSE.getSE();\n+      for (unsigned I = 0; I < Operands.size(); ++I) {\n+        Value *V = NewOps[I]->getUnderlyingValue();\n+        if (!isa<Constant>(V) && SE.isSCEVable(V->getType()))\n+          if (auto *C = dyn_cast<SCEVConstant>(PSE.getSE()->getSCEV(V)))\n+            NewOps[I] = Plan.getOrAddLiveIn(C->getValue());\n+      }\n+      return new VPWidenRecipe(*I, make_range(NewOps.begin(), NewOps.end()));\n+    }\n     return new VPWidenRecipe(*I, make_range(Operands.begin(), Operands.end()));\n   };\n }\ndiff --git a/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h b/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h\nindex 0fbdeeddaf4a..25b8bf3e089e 100644\n--- a/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h\n+++ b/llvm/lib/Transforms/Vectorize/VPRecipeBuilder.h\n@@ -174,11 +174,6 @@ public:\n       if (auto *R = Ingredient2Recipe.lookup(I))\n         return R->getVPSingleValue();\n     }\n-    ScalarEvolution &SE = *PSE.getSE();\n-    if (!isa<Constant>(V) && SE.isSCEVable(V->getType()))\n-      if (auto *C = dyn_cast<SCEVConstant>(PSE.getSE()->getSCEV(V)))\n-        return Plan.getOrAddLiveIn(C->getValue());\n-\n     return Plan.getOrAddLiveIn(V);\n   }\n };\n", "tests": [{"file": "llvm/test/Transforms/LoopVectorize/AArch64/mul-simplification.ll", "commands": ["opt -p loop-vectorize -S %s"], "tests": [{"test_name": "mul_select_operand_known_1_via_scev", "test_body": "target triple = \"arm64-apple-macosx\"\n\ndefine i64 @mul_select_operand_known_1_via_scev() {\nentry:\n  br label %loop\n\nloop:                                             ; preds = %loop, %entry\n  %red = phi i64 [ 12, %entry ], [ %red.next, %loop ]\n  %iv = phi i32 [ 0, %entry ], [ %iv.next, %loop ]\n  %0 = and i32 %iv, 1\n  %cmp1.i = icmp eq i32 %0, 0\n  %narrow.i = select i1 %cmp1.i, i32 1, i32 %iv\n  %mul = zext nneg i32 %narrow.i to i64\n  %red.next = mul nsw i64 %red, %mul\n  %iv.next = add nuw nsw i32 %iv, 1\n  %ec = icmp eq i32 %iv, 1\n  br i1 %ec, label %exit, label %loop\n\nexit:                                             ; preds = %loop\n  %res = phi i64 [ %red.next, %loop ]\n  ret i64 %res\n}\n"}]}], "issue": {"title": "[clang] Crash with assertion failed in Vectorize", "body": "The compiler crashed with -O2 in this code:\r\n\r\n```c\r\n#include<stdint.h>\r\nstatic uint8_t b[][1] = {127};\r\nlong a(int c, int e) {\r\n  long d;\r\n  for (; c <= e; c++)\r\n    if (c % 2 == 0)\r\n      ;\r\n    else\r\n      d *= c;\r\n  return d;\r\n}\r\nint64_t f();\r\nint16_t g() {\r\n  int32_t h = 1653000360;\r\n  f(a(h - 1653000360, b[0][0] - 126));\r\n  uint8_t *i[] = {b, b};\r\n}\r\n```\r\n\r\nThe crash is:\r\n```\r\nclang: /root/llvm-project/llvm/lib/Transforms/Vectorize/LoopVectorize.cpp:7369: llvm::VectorizationFactor llvm::LoopVectorizationPlanner::computeBestVF(): Assertion `(BestFactor.Width == LegacyVF.Width || planContainsAdditionalSimplifications(getPlanFor(BestFactor.Width), CostCtx, OrigLoop)) && \" VPlan cost model and legacy cost model disagreed\"' failed.\r\nPLEASE submit a bug report to https://github.com/llvm/llvm-project/issues/ and include the crash backtrace, preprocessed source, and associated run script.\r\n```\r\n\r\nThe details can be found here: https://godbolt.org/z/eeWW6raPb", "author": "cardigan1008", "labels": ["vectorizers", "crash"], "comments": []}, "verified": true}

dataset/143123.json

@@ -0,0 +1,69 @@
+{
+  "bug_id": "143123",
+  "issue_url": "https://github.com/llvm/llvm-project/issues/143123",
+  "bug_type": "miscompilation",
+  "base_commit": "5d3899d293e902124c3602b466031b6b799fb123",
+  "knowledge_cutoff": "2025-06-06T12:10:51Z",
+  "lit_test_dir": [
+    "llvm/test/Transforms/InstCombine"
+  ],
+  "hints": {
+    "fix_commit": "2f15637e04f51e3ef435c0c0d39aab0e8b933023",
+    "components": [
+      "ValueTracking"
+    ],
+    "bug_location_lineno": {
+      "llvm/lib/Analysis/ValueTracking.cpp": [
+        [
+          8660,
+          8665
+        ]
+      ]
+    },
+    "bug_location_funcname": {
+      "llvm/lib/Analysis/ValueTracking.cpp": [
+        "matchSelectPattern"
+      ]
+    }
+  },
+  "patch": "commit 2f15637e04f51e3ef435c0c0d39aab0e8b933023\nAuthor: Yingwei Zheng <[email protected]>\nDate:   Mon Jun 9 15:46:09 2025 +0800\n\n    [ValueTracking] Update `Ordered` when both operands are non-NaN. (#143349)\n    \n    When the original predicate is ordered and both operands are non-NaN,\n    `Ordered` should be set to true. This variable still matters even if\n    both operands are non-NaN because FMF only applies to select, not fcmp.\n    \n    Closes https://github.com/llvm/llvm-project/issues/143123.\n\ndiff --git a/llvm/lib/Analysis/ValueTracking.cpp b/llvm/lib/Analysis/ValueTracking.cpp\nindex d6bb852e208f..d8c1096049dc 100644\n--- a/llvm/lib/Analysis/ValueTracking.cpp\n+++ b/llvm/lib/Analysis/ValueTracking.cpp\n@@ -8660,6 +8660,7 @@ static SelectPatternResult matchSelectPattern(CmpInst::Predicate Pred,\n     if (LHSSafe && RHSSafe) {\n       // Both operands are known non-NaN.\n       NaNBehavior = SPNB_RETURNS_ANY;\n+      Ordered = CmpInst::isOrdered(Pred);\n     } else if (CmpInst::isOrdered(Pred)) {\n       // An ordered comparison will return false when given a NaN, so it\n       // returns the RHS.\n",
+  "tests": [
+    {
+      "file": "llvm/test/Transforms/InstCombine/fcmp-select.ll",
+      "commands": [
+        "opt < %s -passes=instcombine -S"
+      ],
+      "tests": [
+        {
+          "test_name": "test_fcmp_ord_select_fcmp_oeq_var_const",
+          "test_body": "define i1 @test_fcmp_ord_select_fcmp_oeq_var_const(double %x) {\n  %cmp1 = fcmp ord double %x, 0.000000e+00\n  %sel = select i1 %cmp1, double %x, double 0.000000e+00\n  %cmp2 = fcmp oeq double %sel, 1.000000e+00\n  ret i1 %cmp2\n}\n"
+        },
+        {
+          "test_name": "test_select_nnan_nsz_fcmp_olt",
+          "test_body": "define float @test_select_nnan_nsz_fcmp_olt(float %x) {\n  %cmp = fcmp olt float %x, 0.000000e+00\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000e+00\n  ret float %sel\n}\n"
+        },
+        {
+          "test_name": "test_select_nnan_nsz_fcmp_ult",
+          "test_body": "define float @test_select_nnan_nsz_fcmp_ult(float %x) {\n  %cmp = fcmp ult float %x, 0.000000e+00\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000e+00\n  ret float %sel\n}\n"
+        },
+        {
+          "test_name": "test_fcmp_select_var_const_unordered",
+          "test_body": "define i1 @test_fcmp_select_var_const_unordered(double %x, double %y) {\n  %cmp1 = fcmp ult double %x, 0x3E80000000000000\n  %sel = select i1 %cmp1, double %y, double 0.000000e+00\n  %cmp2 = fcmp ugt double %sel, 0x3E80000000000000\n  ret i1 %cmp2\n}\n"
+        }
+      ]
+    }
+  ],
+  "issue": {
+    "title": "[InstCombine] fcmp is incorrectly inverted",
+    "body": "Reproducer: https://alive2.llvm.org/ce/z/yVw9wM\n```\ndefine float @src(float %x) {\n  %cmp = fcmp olt float %x, 0.000000e+00\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000e+00\n  ret float %sel\n}\n\ndefine float @tgt(float %x) {\n  %.inv = fcmp oge float %x, 0.000000e+00\n  %sel1 = select i1 %.inv, float -0.000000e+00, float %x\n  ret float %sel1\n}\n```\n```\n----------------------------------------\ndefine float @src(float %x) {\n#0:\n  %cmp = fcmp olt float %x, 0.000000\n  %sel = select nnan nsz i1 %cmp, float %x, float -0.000000\n  ret float %sel\n}\n=>\ndefine float @tgt(float %x) {\n#0:\n  %.inv = fcmp oge float %x, 0.000000\n  %sel1 = select i1 %.inv, float -0.000000, float %x\n  ret float %sel1\n}\nTransformation doesn't verify!\n\nERROR: Value mismatch\n\nExample:\nfloat %x = #x7f800002 (SNaN)\n\nSource:\ni1 %cmp = #x0 (0)\nfloat %sel = #x80000000 (-0.0)\n\nTarget:\ni1 %.inv = #x0 (0)\nfloat %sel1 = #x7f800002 (SNaN)\nSource value: #x80000000 (-0.0)\nTarget value: #x7f800002 (SNaN)\n```\n",
+    "author": "dtcxzyw",
+    "labels": [
+      "miscompilation",
+      "floating-point",
+      "llvm:analysis",
+      "generated by fuzzer"
+    ],
+    "comments": []
+  },
+  "verified": true
+}

scripts/extract_from_issues.py

@@ -34,7 +34,7 @@ session.headers.update(
 )
 
 issue_id_begin = 76663  # Since 2024-01-01
-issue_id_end = 142937
+issue_id_end = 144291
 
 
 def wait(progress):