//= ValueState.cpp - Path-Sens. "State" for tracking valuues -----*- C++ -*--=// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This files defines SymbolID, VarBindKey, and ValueState. // //===----------------------------------------------------------------------===// #include "ValueState.h" using namespace clang; bool ValueState::isNotEqual(SymbolID sym, const llvm::APSInt& V) const { // First, retrieve the NE-set associated with the given symbol. ConstantNotEqTy::TreeTy* T = Data->ConstantNotEq.SlimFind(sym); if (!T) return false; // Second, see if V is present in the NE-set. return T->getValue().second.contains(&V); } const llvm::APSInt* ValueState::getSymVal(SymbolID sym) const { ConstantEqTy::TreeTy* T = Data->ConstantEq.SlimFind(sym); return T ? T->getValue().second : NULL; } RValue ValueStateManager::GetValue(const StateTy& St, const LValue& LV) { switch (LV.getSubKind()) { case lval::DeclValKind: { StateTy::VariableBindingsTy::TreeTy* T = St.getImpl()->VariableBindings.SlimFind(cast(LV).getDecl()); return T ? T->getValue().second : InvalidValue(); } default: assert (false && "Invalid LValue."); break; } return InvalidValue(); } ValueStateManager::StateTy ValueStateManager::AddNE(StateTy St, SymbolID sym, const llvm::APSInt& V) { // First, retrieve the NE-set associated with the given symbol. ValueState::ConstantNotEqTy::TreeTy* T = St.getImpl()->ConstantNotEq.SlimFind(sym); ValueState::IntSetTy S = T ? T->getValue().second : ISetFactory.GetEmptySet(); // Now add V to the NE set. S = ISetFactory.Add(S, &V); // Create a new state with the old binding replaced. ValueStateImpl NewStateImpl = *St.getImpl(); NewStateImpl.ConstantNotEq = CNEFactory.Add(NewStateImpl.ConstantNotEq, sym, S); // Get the persistent copy. return getPersistentState(NewStateImpl); } ValueStateManager::StateTy ValueStateManager::AddEQ(StateTy St, SymbolID sym, const llvm::APSInt& V) { // Create a new state with the old binding replaced. ValueStateImpl NewStateImpl = *St.getImpl(); NewStateImpl.ConstantEq = CEFactory.Add(NewStateImpl.ConstantEq, sym, &V); // Get the persistent copy. return getPersistentState(NewStateImpl); } RValue ValueStateManager::GetValue(const StateTy& St, Stmt* S, bool* hasVal) { for (;;) { switch (S->getStmtClass()) { // ParenExprs are no-ops. case Stmt::ParenExprClass: S = cast(S)->getSubExpr(); continue; // DeclRefExprs can either evaluate to an LValue or a Non-LValue // (assuming an implicit "load") depending on the context. In this // context we assume that we are retrieving the value contained // within the referenced variables. case Stmt::DeclRefExprClass: return GetValue(St, lval::DeclVal(cast(S)->getDecl())); // Integer literals evaluate to an RValue. Simply retrieve the // RValue for the literal. case Stmt::IntegerLiteralClass: return NonLValue::GetValue(ValMgr, cast(S)); // Casts where the source and target type are the same // are no-ops. We blast through these to get the descendant // subexpression that has a value. case Stmt::ImplicitCastExprClass: { ImplicitCastExpr* C = cast(S); if (C->getType() == C->getSubExpr()->getType()) { S = C->getSubExpr(); continue; } break; } case Stmt::CastExprClass: { CastExpr* C = cast(S); if (C->getType() == C->getSubExpr()->getType()) { S = C->getSubExpr(); continue; } break; } // Handle all other Stmt* using a lookup. default: break; }; break; } StateTy::VariableBindingsTy::TreeTy* T = St.getImpl()->VariableBindings.SlimFind(S); if (T) { if (hasVal) *hasVal = true; return T->getValue().second; } else { if (hasVal) *hasVal = false; return InvalidValue(); } } LValue ValueStateManager::GetLValue(const StateTy& St, Stmt* S) { while (ParenExpr* P = dyn_cast(S)) S = P->getSubExpr(); if (DeclRefExpr* DR = dyn_cast(S)) return lval::DeclVal(DR->getDecl()); return cast(GetValue(St, S)); } ValueStateManager::StateTy ValueStateManager::SetValue(StateTy St, Stmt* S, bool isBlkExpr, const RValue& V) { assert (S); return V.isValid() ? Add(St, VarBindKey(S, isBlkExpr), V) : St; } ValueStateManager::StateTy ValueStateManager::SetValue(StateTy St, const LValue& LV, const RValue& V) { switch (LV.getSubKind()) { case lval::DeclValKind: return V.isValid() ? Add(St, cast(LV).getDecl(), V) : Remove(St, cast(LV).getDecl()); default: assert ("SetValue for given LValue type not yet implemented."); return St; } } ValueStateManager::StateTy ValueStateManager::Remove(StateTy St, VarBindKey K) { // Create a new state with the old binding removed. ValueStateImpl NewStateImpl = *St.getImpl(); NewStateImpl.VariableBindings = VBFactory.Remove(NewStateImpl.VariableBindings, K); // Get the persistent copy. return getPersistentState(NewStateImpl); } ValueStateManager::StateTy ValueStateManager::Add(StateTy St, VarBindKey K, const RValue& V) { // Create a new state with the old binding removed. ValueStateImpl NewStateImpl = *St.getImpl(); NewStateImpl.VariableBindings = VBFactory.Add(NewStateImpl.VariableBindings, K, V); // Get the persistent copy. return getPersistentState(NewStateImpl); } ValueStateManager::StateTy ValueStateManager::getInitialState() { // Create a state with empty variable bindings. ValueStateImpl StateImpl(VBFactory.GetEmptyMap(), CNEFactory.GetEmptyMap(), CEFactory.GetEmptyMap()); return getPersistentState(StateImpl); } ValueStateManager::StateTy ValueStateManager::getPersistentState(const ValueStateImpl &State) { llvm::FoldingSetNodeID ID; State.Profile(ID); void* InsertPos; if (ValueStateImpl* I = StateSet.FindNodeOrInsertPos(ID, InsertPos)) return I; ValueStateImpl* I = (ValueStateImpl*) Alloc.Allocate(); new (I) ValueStateImpl(State); StateSet.InsertNode(I, InsertPos); return I; }