175 if(
op_l.is_not_nil())
194 std::stack<stack_entryt> stack;
196 stack.emplace(
_expr);
198 while(!stack.empty())
200 auto &top = stack.top();
201 if(top.operands_pushed)
209 top.operands_pushed =
true;
210 for(
auto &op : top.e->operands())
229 std::stack<T *> stack;
233 while(!stack.empty())
235 T &expr = *stack.top();
240 for(
auto &op : expr.operands())
Pre-defined bitvector types.
const bitvector_typet & to_bitvector_type(const typet &type)
Cast a typet to a bitvector_typet.
ait supplies three of the four components needed: an abstract interpreter (in this case handling func...
std::size_t get_width() const
A constant literal expression.
const irep_idt & get_value() const
bool value_is_zero_string() const
dstringt has one field, an unsigned integer no which is an index into a static table of strings.
Base class for all expressions.
const source_locationt & find_source_location() const
Get a source_locationt from the expression or from its operands (non-recursively).
bool is_one() const
Return whether the expression is a constant representing 1.
bool is_true() const
Return whether the expression is a constant representing true.
depth_iteratort depth_end()
const_depth_iteratort depth_cend() const
const_unique_depth_iteratort unique_depth_end() const
bool is_boolean() const
Return whether the expression represents a Boolean.
depth_iteratort depth_begin()
const_unique_depth_iteratort unique_depth_cend() const
void visit(class expr_visitort &visitor)
These are pre-order traversal visitors, i.e., the visitor is executed on a node before its children h...
bool is_false() const
Return whether the expression is a constant representing false.
bool is_zero() const
Return whether the expression is a constant representing 0.
void visit_pre(std::function< void(exprt &)>)
bool is_constant() const
Return whether the expression is a constant.
typet & type()
Return the type of the expression.
const_depth_iteratort depth_cbegin() const
void visit_post(std::function< void(exprt &)>)
These are post-order traversal visitors, i.e., the visitor is executed on a node after its children h...
const source_locationt & source_location() const
const_unique_depth_iteratort unique_depth_cbegin() const
const_unique_depth_iteratort unique_depth_begin() const
const irep_idt & get(const irep_idt &name) const
const std::string & id_string() const
const irep_idt & id() const
void visit_post_template(std::function< void(T &)> visitor, T *_expr)
static void visit_pre_template(std::function< void(T &)> visitor, T *_expr)
#define forall_operands(it, expr)
Forward depth-first search iterators These iterators' copy operations are expensive,...
const irept & get_nil_irep()
const std::string & id2string(const irep_idt &d)
const mp_integer string2integer(const std::string &n, unsigned base)
#define CHECK_RETURN(CONDITION)
API to expression classes.
const constant_exprt & to_constant_expr(const exprt &expr)
Cast an exprt to a constant_exprt.