Searched refs:ValueState (Results 1 – 3 of 3) sorted by relevance
/external/llvm/lib/Analysis/ |
D | SparsePropagation.cpp | 54 DenseMap<Value*, LatticeVal>::iterator I = ValueState.find(V); in getOrInitValueState() 55 if (I != ValueState.end()) return I->second; // Common case, in the map in getOrInitValueState() 74 return ValueState[V] = LV; in getOrInitValueState() 80 DenseMap<Value*, LatticeVal>::iterator I = ValueState.find(&Inst); in UpdateState() 81 if (I != ValueState.end() && I->second == V) in UpdateState() 85 ValueState[&Inst] = V; in UpdateState()
|
/external/llvm/include/llvm/Analysis/ |
D | SparsePropagation.h | 122 DenseMap<Value*, LatticeVal> ValueState; // The state each value is in. variable 153 DenseMap<Value*, LatticeVal>::const_iterator I = ValueState.find(V); in getLatticeState() 154 return I != ValueState.end() ? I->second : LatticeFunc->getUntrackedVal(); in getLatticeState()
|
/external/llvm/lib/Transforms/Scalar/ |
D | SCCP.cpp | 160 DenseMap<Value*, LatticeVal> ValueState; // The state each value is in. member in __anon10360b9e0211::SCCPSolver 271 DenseMap<Value*, LatticeVal>::const_iterator I = ValueState.find(V); in getLatticeValueFor() 272 assert(I != ValueState.end() && "V is not in valuemap!"); in getLatticeValueFor() 290 markOverdefined(ValueState[V], V); in markOverdefined() 319 markConstant(ValueState[V], V, C); in markConstant() 324 LatticeVal &IV = ValueState[V]; in markForcedConstant() 362 mergeInValue(ValueState[V], V, MergeWithV); in mergeInValue() 373 ValueState.insert(std::make_pair(V, LatticeVal())); in getValueState() 851 LatticeVal &IV = ValueState[&I]; in visitBinaryOperator() 909 LatticeVal &IV = ValueState[&I]; in visitCmpInst() [all …]
|