[all-commits] [llvm/llvm-project] 39e503: [SCEV] Add predicated version of getSymbolicMaxBac...

[Florian Hahn via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: 39e5036c0e22cea24df73d28746bb8fe0a117f9d
      https://github.com/llvm/llvm-project/commit/39e5036c0e22cea24df73d28746bb8fe0a117f9d
  Author: Florian Hahn <flo at fhahn.com>
  Date:   2024-05-28 (Tue, 28 May 2024)

  Changed paths:
    M llvm/include/llvm/Analysis/ScalarEvolution.h
    M llvm/lib/Analysis/ScalarEvolution.cpp
    M llvm/test/Analysis/ScalarEvolution/predicated-symbolic-max-backedge-taken-count.ll

  Log Message:
  -----------
  [SCEV] Add predicated version of getSymbolicMaxBackedgeTakenCount. (#93498)

This patch adds a predicated version of
getSymbolicMaxBackedgeTakenCount.

The intended use for this is loop access analysis for loops with
uncountable exits. When analyzing dependences and computing runtime
checks, we need the smallest upper bound on the number of iterations. In
terms of memory safety, it shouldn't matter if any uncomputable exits
leave the loop, as long as we prove that there are no dependences given
the minimum of the countable exits. The same should apply also for
generating runtime checks.

PR: https://github.com/llvm/llvm-project/pull/93498



To unsubscribe from these emails, change your notification settings at https://github.com/llvm/llvm-project/settings/notifications