mirror of
https://github.com/Z3Prover/z3
synced 2025-08-08 12:11:23 +00:00
1646a41b2f
- ensure mk_extract performs simplification to distribute over extract and removing extract if the range is the entire bit-vector - ensure bool_rewriter simplifeis disjunctions when applicable.
56 lines
1.4 KiB
C++
56 lines
1.4 KiB
C++
/*++
|
|
Copyright (c) 2016 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
mk_extract_proc.cpp
|
|
|
|
Abstract:
|
|
|
|
|
|
Author:
|
|
|
|
Mikolas Janota (MikolasJanota)
|
|
|
|
Revision History:
|
|
--*/
|
|
#include "ast/rewriter/mk_extract_proc.h"
|
|
mk_extract_proc::mk_extract_proc(bv_util & u):
|
|
m_util(u),
|
|
m_high(0),
|
|
m_low(UINT_MAX),
|
|
m_domain(nullptr),
|
|
m_f_cached(nullptr) {
|
|
}
|
|
|
|
mk_extract_proc::~mk_extract_proc() {
|
|
if (m_f_cached) {
|
|
// m_f_cached has a reference to m_domain, so, I don't need to inc_ref m_domain
|
|
ast_manager & m = m_util.get_manager();
|
|
m.dec_ref(m_f_cached);
|
|
}
|
|
}
|
|
|
|
app * mk_extract_proc::operator()(unsigned high, unsigned low, expr * arg) {
|
|
unsigned l, h;
|
|
while (m_util.is_extract(arg, l, h, arg)) {
|
|
low += l;
|
|
high += l;
|
|
}
|
|
ast_manager & m = m_util.get_manager();
|
|
sort * s = arg->get_sort();
|
|
if (low == 0 && high + 1 == m_util.get_bv_size(arg) && is_app(arg))
|
|
return to_app(arg);
|
|
if (m_low == low && m_high == high && m_domain == s)
|
|
return m.mk_app(m_f_cached, arg);
|
|
// m_f_cached has a reference to m_domain, so, I don't need to inc_ref m_domain
|
|
if (m_f_cached)
|
|
m.dec_ref(m_f_cached);
|
|
app * r = to_app(m_util.mk_extract(high, low, arg));
|
|
m_high = high;
|
|
m_low = low;
|
|
m_domain = s;
|
|
m_f_cached = r->get_decl();
|
|
m.inc_ref(m_f_cached);
|
|
return r;
|
|
}
|