From 1a8456da17075539099ccb0d625fda816b62bcb2 Mon Sep 17 00:00:00 2001 From: Vedant Kumar Date: Fri, 2 Mar 2018 18:57:02 +0000 Subject: Fix more spelling mistakes in comments of LLVM Analysis passes Patch by Reshabh Sharma! Differential Revision: https://reviews.llvm.org/D43939 llvm-svn: 326601 --- llvm/lib/Analysis/CFLAndersAliasAnalysis.cpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'llvm/lib/Analysis/CFLAndersAliasAnalysis.cpp') diff --git a/llvm/lib/Analysis/CFLAndersAliasAnalysis.cpp b/llvm/lib/Analysis/CFLAndersAliasAnalysis.cpp index 076a2b205d00..7138f184b730 100644 --- a/llvm/lib/Analysis/CFLAndersAliasAnalysis.cpp +++ b/llvm/lib/Analysis/CFLAndersAliasAnalysis.cpp @@ -18,7 +18,7 @@ // // The algorithm used here is based on recursive state machine matching scheme // proposed in "Demand-driven alias analysis for C" by Xin Zheng and Radu -// Rugina. The general idea is to extend the tranditional transitive closure +// Rugina. The general idea is to extend the traditional transitive closure // algorithm to perform CFL matching along the way: instead of recording // "whether X is reachable from Y", we keep track of "whether X is reachable // from Y at state Z", where the "state" field indicates where we are in the CFL @@ -645,7 +645,7 @@ static void processWorkListItem(const WorkListItem &Item, const CFLGraph &Graph, // relations that are symmetric, we could actually cut the storage by half by // sorting FromNode and ToNode before insertion happens. - // The newly added value alias pair may pontentially generate more memory + // The newly added value alias pair may potentially generate more memory // alias pairs. Check for them here. auto FromNodeBelow = getNodeBelow(Graph, FromNode); auto ToNodeBelow = getNodeBelow(Graph, ToNode); -- cgit v1.2.3