[all-commits] [llvm/llvm-project] f14b57: [NFC][SCEV] Add test for umin_seq complexity ordering

[Roman Lebedev via All-commits]

  Branch: refs/heads/main
  Home:   https://github.com/llvm/llvm-project
  Commit: f14b57519427e1ab24488e20e7ffe5651b586b02
      https://github.com/llvm/llvm-project/commit/f14b57519427e1ab24488e20e7ffe5651b586b02
  Author: Roman Lebedev <lebedev.ri at gmail.com>
  Date:   2022-01-13 (Thu, 13 Jan 2022)

  Changed paths:
    M llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll

  Log Message:
  -----------
  [NFC][SCEV] Add test for umin_seq complexity ordering


  Commit: 993792bd1affe3cf13ce3b9d71250235cd0d029e
      https://github.com/llvm/llvm-project/commit/993792bd1affe3cf13ce3b9d71250235cd0d029e
  Author: Roman Lebedev <lebedev.ri at gmail.com>
  Date:   2022-01-13 (Thu, 13 Jan 2022)

  Changed paths:
    M llvm/include/llvm/Analysis/ScalarEvolutionExpressions.h
    M llvm/test/Analysis/ScalarEvolution/exit-count-select-safe.ll

  Log Message:
  -----------
  [SCEV] Don't consider umin_seq scev expr to be more complex that ptrtoint scev expr

Let's consider sequential min/max expression family
to be more complex than their non-sequential counterparts,
preserving internal ordering within them.


Compare: https://github.com/llvm/llvm-project/compare/cd36b29ec754...993792bd1aff