forked from OSchip/llvm-project
parent
9e32199861
commit
51fd242cfc
|
@ -46,7 +46,6 @@ public:
|
|||
Unknown = -1, False = 0, True = 1
|
||||
};
|
||||
|
||||
|
||||
// Public query interface.
|
||||
|
||||
/// Determine whether the specified value comparison with a constant is known
|
||||
|
|
|
@ -1041,10 +1041,10 @@ getValueOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB,
|
|||
void LazyValueInfoCache::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc,
|
||||
BasicBlock *NewSucc) {
|
||||
// When an edge in the graph has been threaded, values that we could not
|
||||
// determine a value for before (i.e. were marked overdefined) may be possible
|
||||
// to solve now. We do NOT try to proactively update these values. Instead,
|
||||
// we clear their entries from the cache, and allow lazy updating to recompute
|
||||
// them when needed.
|
||||
// determine a value for before (i.e. were marked overdefined) may be
|
||||
// possible to solve now. We do NOT try to proactively update these values.
|
||||
// Instead, we clear their entries from the cache, and allow lazy updating to
|
||||
// recompute them when needed.
|
||||
|
||||
// The updating process is fairly simple: we need to drop cached info
|
||||
// for all values that were marked overdefined in OldSucc, and for those same
|
||||
|
@ -1268,7 +1268,7 @@ LazyValueInfo::getPredicateAt(unsigned Pred, Value *V, Constant *C,
|
|||
|
||||
// TODO: Move this logic inside getValueAt so that it can be cached rather
|
||||
// than re-queried on each call. This would also allow us to merge the
|
||||
// underlying lattice values to get more information
|
||||
// underlying lattice values to get more information.
|
||||
if (CxtI) {
|
||||
// For a comparison where the V is outside this block, it's possible
|
||||
// that we've branched on it before. Look to see if the value is known
|
||||
|
|
Loading…
Reference in New Issue