commit 2f2d06506c9167dada05b11debe717334de972d4
author Misha Brukman <brukman+llvm@gmail.com> Thu Sep 11 18:14:24 2003 +0000
committer Misha Brukman <brukman+llvm@gmail.com> Thu Sep 11 18:14:24 2003 +0000
tree b4db466a5bb0270d2711628d7b91ded86660892d
parent 0043e4698c66bcac6526bbb9f133d2326a915494

Fixed spelling and grammar.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8478 91177308-0d34-0410-b5e6-96231b3b80d8

lib/Analysis/DataStructure/DataStructureAA.cpp

diff --git a/lib/Analysis/DataStructure/DataStructureAA.cpp b/lib/Analysis/DataStructure/DataStructureAA.cpp
index e7e963a..51df033 100644
--- a/lib/Analysis/DataStructure/DataStructureAA.cpp
+++ b/lib/Analysis/DataStructure/DataStructureAA.cpp
@@ -102,7 +102,7 @@
       DSNode  *N1 = I->second.getNode(),  *N2 = J->second.getNode();
       unsigned O1 = I->second.getOffset(), O2 = J->second.getOffset();
         
-      // We can only make a judgement of one of the nodes is complete...
+      // We can only make a judgment of one of the nodes is complete...
       if (N1->isComplete() || N2->isComplete()) {
         if (N1 != N2)
           return NoAlias;   // Completely different nodes.