From: Misha Brukman <brukman+llvm@gmail.com>
Date: Tue, 29 Oct 2002 22:55:11 +0000 (+0000)
Subject: Fixed spelling of `propagation'.
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=81619b121c9a3ff32487343503ad80f2ffe48fc3;p=oota-llvm.git

Fixed spelling of `propagation'.


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

diff --git a/include/llvm/Analysis/DataStructure.h b/include/llvm/Analysis/DataStructure.h
index ab140bac874..9659c6074a8 100644
--- a/include/llvm/Analysis/DataStructure.h
+++ b/include/llvm/Analysis/DataStructure.h
@@ -62,7 +62,7 @@ public:
 
 // BUDataStructures - The analysis that computes the interprocedurally closed
 // data structure graphs for all of the functions in the program.  This pass
-// only performs a "Bottom Up" propogation (hence the name).
+// only performs a "Bottom Up" propagation (hence the name).
 //
 class BUDataStructures : public Pass {
   // DSInfo, one graph for each function
diff --git a/include/llvm/Analysis/DataStructure/DataStructure.h b/include/llvm/Analysis/DataStructure/DataStructure.h
index ab140bac874..9659c6074a8 100644
--- a/include/llvm/Analysis/DataStructure/DataStructure.h
+++ b/include/llvm/Analysis/DataStructure/DataStructure.h
@@ -62,7 +62,7 @@ public:
 
 // BUDataStructures - The analysis that computes the interprocedurally closed
 // data structure graphs for all of the functions in the program.  This pass
-// only performs a "Bottom Up" propogation (hence the name).
+// only performs a "Bottom Up" propagation (hence the name).
 //
 class BUDataStructures : public Pass {
   // DSInfo, one graph for each function
diff --git a/include/llvm/Analysis/IntervalPartition.h b/include/llvm/Analysis/IntervalPartition.h
index 44e730c42b9..508f00589bc 100644
--- a/include/llvm/Analysis/IntervalPartition.h
+++ b/include/llvm/Analysis/IntervalPartition.h
@@ -89,7 +89,7 @@ private:
 
   // updatePredecessors - Interval generation only sets the successor fields of
   // the interval data structures.  After interval generation is complete,
-  // run through all of the intervals and propogate successor info as
+  // run through all of the intervals and propagate successor info as
   // predecessor info.
   //
   void updatePredecessors(Interval *Int);