12 #ifndef CPROVER_ANALYSES_CUSTOM_BITVECTOR_ANALYSIS_H
13 #define CPROVER_ANALYSES_CUSTOM_BITVECTOR_ANALYSIS_H
57 "If the domain is bottom, it must have no bits set");
65 "If the domain is top, it must have no bits set");
73 typedef std::map<irep_idt, bit_vectort>
bitst;
135 return (src&(1ll<<bit_nr))!=0;
149 bool xml, std::ostream &);
This is the basic interface of the abstract interpreter with default implementations of the core func...
goto_programt::const_targett locationt
virtual void initialize(const irep_idt &function_id, const goto_programt &goto_program)
Initialize all the abstract states for a single function.
The interface offered by a domain, allows code to manipulate domains without knowing their exact type...
ai_history_baset::trace_ptrt trace_ptrt
goto_programt::const_targett locationt
ait supplies three of the four components needed: an abstract interpreter (in this case handling func...
const custom_bitvector_domaint & operator[](locationt l) const
Find the analysis result for a given location.
std::set< exprt > aliases(const exprt &, locationt loc)
local_may_alias_factoryt local_may_alias_factory
exprt eval(const exprt &src, locationt loc)
void check(const goto_modelt &, bool xml, std::ostream &)
numberingt< irep_idt > bitst
virtual void initialize(const goto_functionst &_goto_functions)
Initialize all the abstract states for a whole program.
void instrument(goto_functionst &)
unsigned get_bit_nr(const exprt &)
static void set_bit(bit_vectort &dest, unsigned bit_nr)
void set_bit(const exprt &, unsigned bit_nr, modet)
unsigned long long bit_vectort
bool merge(const custom_bitvector_domaint &b, trace_ptrt from, trace_ptrt to)
std::map< irep_idt, bit_vectort > bitst
bool is_bottom() const final override
static irep_idt object2id(const exprt &)
bool is_top() const final override
void assign_struct_rec(locationt from, const exprt &lhs, const exprt &rhs, custom_bitvector_analysist &, const namespacet &)
void make_top() final override
all states – the analysis doesn't use this directly (see make_entry) and domains may refuse to implem...
static bool has_get_must_or_may(const exprt &)
vectorst get_rhs(const exprt &) const
static void clear_bit(bit_vectort &dest, unsigned bit_nr)
void transform(const irep_idt &function_from, trace_ptrt trace_from, const irep_idt &function_to, trace_ptrt trace_to, ai_baset &ai, const namespacet &ns) final override
how function calls are treated: a) there is an edge from each call site to the function head b) there...
void output(std::ostream &out, const ai_baset &ai, const namespacet &ns) const final override
void assign_lhs(const exprt &, const vectorst &)
void erase_blank_vectors(bitst &)
erase blank bitvectors
static bool get_bit(const bit_vectort src, unsigned bit_nr)
void make_bottom() final override
no states
exprt eval(const exprt &src, custom_bitvector_analysist &) const
custom_bitvector_domaint()
static vectorst merge(const vectorst &a, const vectorst &b)
dstringt has one field, an unsigned integer no which is an index into a static table of strings.
Base class for all expressions.
A collection of goto functions.
A namespacet is essentially one or two symbol tables bound together, to allow for symbol lookups in t...
Field-insensitive, location-sensitive may-alias analysis.
xmlt xml(const irep_idt &property_id, const property_infot &property_info)
#define DATA_INVARIANT(CONDITION, REASON)
This condition should be used to document that assumptions that are made on goto_functions,...