diff options
| author | Dimitry Andric <dim@FreeBSD.org> | 2018-08-02 17:32:43 +0000 | 
|---|---|---|
| committer | Dimitry Andric <dim@FreeBSD.org> | 2018-08-02 17:32:43 +0000 | 
| commit | b7eb8e35e481a74962664b63dfb09483b200209a (patch) | |
| tree | 1937fb4a348458ce2d02ade03ac3bb0aa18d2fcd /lib/Analysis/LazyValueInfo.cpp | |
| parent | eb11fae6d08f479c0799db45860a98af528fa6e7 (diff) | |
Notes
Diffstat (limited to 'lib/Analysis/LazyValueInfo.cpp')
| -rw-r--r-- | lib/Analysis/LazyValueInfo.cpp | 2 | 
1 files changed, 1 insertions, 1 deletions
| diff --git a/lib/Analysis/LazyValueInfo.cpp b/lib/Analysis/LazyValueInfo.cpp index 435b6f205199..ee0148e0d795 100644 --- a/lib/Analysis/LazyValueInfo.cpp +++ b/lib/Analysis/LazyValueInfo.cpp @@ -725,7 +725,7 @@ bool LazyValueInfoImpl::solveBlockValueNonLocal(ValueLatticeElement &BBLV,    // frequently arranged such that dominating ones come first and we quickly    // find a path to function entry.  TODO: We should consider explicitly    // canonicalizing to make this true rather than relying on this happy -  // accident.   +  // accident.    for (pred_iterator PI = pred_begin(BB), E = pred_end(BB); PI != E; ++PI) {      ValueLatticeElement EdgeResult;      if (!getEdgeValue(Val, *PI, BB, EdgeResult)) | 
