Don't give up completely, maybe other AA can say something about this.
authorChris Lattner <sabre@nondot.org>
Sun, 27 Mar 2005 00:02:33 +0000 (00:02 +0000)
committerChris Lattner <sabre@nondot.org>
Sun, 27 Mar 2005 00:02:33 +0000 (00:02 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@20873 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Analysis/DataStructure/DataStructureAA.cpp

index 892c7dfe61960edae4411a090a350f1fa4e601ed..19ac2acc31dd676859885064a57a436d48394a7c 100644 (file)
@@ -138,7 +138,8 @@ AliasAnalysis::AliasResult DSAA::alias(const Value *V1, unsigned V1Size,
   DSNode  *N1 = I->second.getNode(),  *N2 = J->second.getNode();
   unsigned O1 = I->second.getOffset(), O2 = J->second.getOffset();
   if (N1 == 0 || N2 == 0)
-    return MayAlias;  // Can't tell whether anything aliases null.
+    // Can't tell whether anything aliases null.
+    return AliasAnalysis::alias(V1, V1Size, V2, V2Size);
         
   // We can only make a judgment of one of the nodes is complete...
   if (N1->isComplete() || N2->isComplete()) {