mirror of
https://github.com/Z3Prover/z3
synced 2025-04-13 20:38:43 +00:00
48b13291d1
- add option smt.bv.reduce_size.
- it allows to apply incremental pre-processing of bit-vectors by identifying ranges that are known to be constant.
This rewrite is beneficial, for instance, when bit-vectors are constrained to have many high-level bits set to 0.
58 lines
1 KiB
C++
58 lines
1 KiB
C++
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
expr_safe_replace.h
|
|
|
|
Abstract:
|
|
|
|
Version of expr_replace/expr_substitution that is safe for quantifiers.
|
|
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2012-11-30
|
|
|
|
Revision History:
|
|
|
|
|
|
--*/
|
|
|
|
#pragma once
|
|
|
|
#include "ast/ast.h"
|
|
#include <unordered_map>
|
|
|
|
class expr_safe_replace {
|
|
ast_manager& m;
|
|
expr_ref_vector m_src;
|
|
expr_ref_vector m_dst;
|
|
unsigned_vector m_limit = 0;
|
|
ptr_vector<expr> m_todo, m_args;
|
|
expr_ref_vector m_refs;
|
|
std::unordered_map<expr*,expr*> m_cache;
|
|
|
|
public:
|
|
expr_safe_replace(ast_manager& m): m(m), m_src(m), m_dst(m), m_refs(m) {}
|
|
|
|
void insert(expr* src, expr* dst);
|
|
|
|
void operator()(expr_ref& e) { (*this)(e.get(), e); }
|
|
|
|
void operator()(expr* src, expr_ref& e);
|
|
|
|
void operator()(expr_ref_vector& es);
|
|
|
|
void apply_substitution(expr* s, expr* def, expr_ref& t);
|
|
|
|
void reset();
|
|
|
|
bool empty() const { return m_src.empty(); }
|
|
|
|
void push_scope();
|
|
|
|
void pop_scope(unsigned n);
|
|
};
|
|
|