3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-16 13:58:45 +00:00

decl and rewriter for Indexof (WIP)

This commit is contained in:
Murphy Berzish 2016-06-14 20:10:06 -04:00
parent 7aeeb599ef
commit db2a5854e9
4 changed files with 31 additions and 0 deletions

View file

@ -112,6 +112,24 @@ br_status str_rewriter::mk_str_Contains(expr * haystack, expr * needle, expr_ref
}
}
br_status str_rewriter::mk_str_Indexof(expr * haystack, expr * needle, expr_ref & result) {
TRACE("t_str_rw", tout << "rewrite (Indexof " << mk_pp(haystack, m()) << " " << mk_pp(needle, m()) << ")" << std::endl;);
if (m_strutil.is_string(haystack) && m_strutil.is_string(needle)) {
TRACE("t_str_rw", tout << "evaluating constant Indexof expression" << std::endl;);
std::string haystackStr = m_strutil.get_string_constant_value(haystack);
std::string needleStr = m_strutil.get_string_constant_value(needle);
if (haystackStr.find(needleStr) != std::string::npos) {
int index = haystackStr.find(needleStr);
result = m_autil.mk_numeral(rational(index), true);
} else {
result = m_autil.mk_numeral(rational(-1), true);
}
return BR_DONE;
} else {
return BR_FAILED;
}
}
br_status str_rewriter::mk_app_core(func_decl * f, unsigned num_args, expr * const * args, expr_ref & result) {
SASSERT(f->get_family_id() == get_fid());
@ -131,6 +149,9 @@ br_status str_rewriter::mk_app_core(func_decl * f, unsigned num_args, expr * con
case OP_STR_CONTAINS:
SASSERT(num_args == 2);
return mk_str_Contains(args[0], args[1], result);
case OP_STR_INDEXOF:
SASSERT(num_args == 2);
return mk_str_Indexof(args[0], args[1], result);
default:
return BR_FAILED;
}

View file

@ -44,6 +44,7 @@ public:
br_status mk_str_StartsWith(expr * haystack, expr * needle, expr_ref & result);
br_status mk_str_EndsWith(expr * haystack, expr * needle, expr_ref & result);
br_status mk_str_Contains(expr * haystack, expr * needle, expr_ref & result);
br_status mk_str_Indexof(expr * haystack, expr * needle, expr_ref & result);
bool reduce_eq(expr * l, expr * r, expr_ref_vector & lhs, expr_ref_vector & rhs, bool & change);
bool reduce_eq(expr_ref_vector& ls, expr_ref_vector& rs, expr_ref_vector& lhs, expr_ref_vector& rhs, bool& change);

View file

@ -30,6 +30,7 @@ str_decl_plugin::str_decl_plugin():
m_startswith_decl(0),
m_endswith_decl(0),
m_contains_decl(0),
m_indexof_decl(0),
m_arith_plugin(0),
m_arith_fid(0),
m_int_sort(0){
@ -47,6 +48,7 @@ void str_decl_plugin::finalize(void) {
DEC_REF(m_startswith_decl);
DEC_REF(m_endswith_decl);
DEC_REF(m_contains_decl);
DEC_REF(m_indexof_decl);
DEC_REF(m_int_sort);
}
@ -88,6 +90,9 @@ void str_decl_plugin::set_manager(ast_manager * m, family_id id) {
m_contains_decl = m->mk_func_decl(symbol("Contains"), s, s, boolT, func_decl_info(id, OP_STR_CONTAINS));
m_manager->inc_ref(m_contains_decl);
m_indexof_decl = m->mk_func_decl(symbol("Indexof"), s, s, i, func_decl_info(id, OP_STR_INDEXOF));
m_manager->inc_ref(m_indexof_decl);
}
decl_plugin * str_decl_plugin::mk_fresh() {
@ -109,6 +114,7 @@ func_decl * str_decl_plugin::mk_func_decl(decl_kind k) {
case OP_STR_STARTSWITH: return m_startswith_decl;
case OP_STR_ENDSWITH: return m_endswith_decl;
case OP_STR_CONTAINS: return m_contains_decl;
case OP_STR_INDEXOF: return m_indexof_decl;
default: return 0;
}
}
@ -169,6 +175,7 @@ void str_decl_plugin::get_op_names(svector<builtin_name> & op_names, symbol cons
op_names.push_back(builtin_name("StartsWith", OP_STR_STARTSWITH));
op_names.push_back(builtin_name("EndsWith", OP_STR_ENDSWITH));
op_names.push_back(builtin_name("Contains", OP_STR_CONTAINS));
op_names.push_back(builtin_name("Indexof", OP_STR_INDEXOF));
}
void str_decl_plugin::get_sort_names(svector<builtin_name> & sort_names, symbol const & logic) {

View file

@ -35,6 +35,7 @@ enum str_op_kind {
OP_STR_STARTSWITH,
OP_STR_ENDSWITH,
OP_STR_CONTAINS,
OP_STR_INDEXOF,
// end
LAST_STR_OP
};
@ -51,6 +52,7 @@ protected:
func_decl * m_startswith_decl;
func_decl * m_endswith_decl;
func_decl * m_contains_decl;
func_decl * m_indexof_decl;
arith_decl_plugin * m_arith_plugin;
family_id m_arith_fid;