Searched refs:ValueState (Results 1 - 3 of 3) sorted by relevance
/external/llvm/include/llvm/Analysis/ |
H A D | SparsePropagation.h | 122 DenseMap<Value*, LatticeVal> ValueState; // The state each value is in. member in class:llvm::SparseSolver 153 DenseMap<Value*, LatticeVal>::const_iterator I = ValueState.find(V); 154 return I != ValueState.end() ? I->second : LatticeFunc->getUntrackedVal();
|
/external/llvm/lib/Analysis/ |
H A D | SparsePropagation.cpp | 53 DenseMap<Value*, LatticeVal>::iterator I = ValueState.find(V); 54 if (I != ValueState.end()) return I->second; // Common case, in the map 73 return ValueState[V] = LV; 79 DenseMap<Value*, LatticeVal>::iterator I = ValueState.find(&Inst); 80 if (I != ValueState.end() && I->second == V) 84 ValueState[&Inst] = V;
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | SCCP.cpp | 159 DenseMap<Value*, LatticeVal> ValueState; // The state each value is in. member in class:__anon7814::SCCPSolver 161 /// StructValueState - This maintains ValueState for values that have 269 DenseMap<Value*, LatticeVal>::const_iterator I = ValueState.find(V); 270 assert(I != ValueState.end() && "V is not in valuemap!"); 295 markOverdefined(ValueState[V], V); 324 markConstant(ValueState[V], V, C); 329 LatticeVal &IV = ValueState[V]; 367 mergeInValue(ValueState[V], V, MergeWithV); 378 ValueState.insert(std::make_pair(V, LatticeVal())); 858 LatticeVal &IV = ValueState[ [all...] |
Completed in 21 milliseconds