[all-commits] [llvm/llvm-project] 30bd66: [BasicAA] Fix recursive phi MustAlias calculations

[David Green via All-commits]

  Branch: refs/heads/master
  Home:   https://github.com/llvm/llvm-project
  Commit: 30bd66544d7a1e602dfaf412158d4bd759352e36
      https://github.com/llvm/llvm-project/commit/30bd66544d7a1e602dfaf412158d4bd759352e36
  Author: David Green <david.green at arm.com>
  Date:   2020-07-02 (Thu, 02 Jul 2020)

  Changed paths:
    M llvm/lib/Analysis/BasicAliasAnalysis.cpp
    M llvm/test/Analysis/BasicAA/recphi.ll

  Log Message:
  -----------
  [BasicAA] Fix recursive phi MustAlias calculations

With the option -basic-aa-recphi we can detect recursive phis that loop
through constant geps, which allows us to detect more no-alias case for
pointer IV's. If the other phi operand and the other alias value are
MustAlias though, we cannot presume that every element in the loop is
also MustAlias. We need to instead be conservative and return MayAlias.

Differential Revision: https://reviews.llvm.org/D82987