mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 09:05:31 +00:00
Code Activity

fixes to build warnings

Browse source
This commit is contained in:
Nikolaj Bjorner 2024-09-30 08:23:31 -07:00
parent 2ac6f8bb06
commit 826835fd7c
21 changed files with 20 additions and 65 deletions
Download patch file Download diff file Expand all files Collapse all files

9
src/muz/ddnf/ddnf.cpp
View file

@ -678,14 +678,9 @@ namespace datalog {
}
bool compile_rules1(rule_set const& rules, rule_set& new_rules) {
datalog::rule_set::iterator it = rules.begin();
datalog::rule_set::iterator end = rules.end();
unsigned idx = 0;
for (; it != end; ++idx, ++it) {
if (!compile_rule1(**it, rules, new_rules)) {
for (auto const & r : rules)
if (!compile_rule1(*r, rules, new_rules))
return false;
}
}
return true;
}

4
src/muz/fp/datalog_parser.cpp
View file

@ -902,7 +902,6 @@ protected:
unsigned arg_idx = 0;
tok = m_lexer->next_token();
while (tok != TK_EOS && tok != TK_ERROR) {
symbol alias;
sort* s = nullptr;
if(!f) {
@ -939,7 +938,6 @@ protected:
}
s = f->get_domain(arg_idx);
symbol var_symbol;
tok = parse_arg(tok, s, args);
}
@ -1067,7 +1065,7 @@ protected:
bool read_line(std::istream& strm, std::string& line) {
line.clear();
char ch = strm.get();
int ch = strm.get();
while (ch == ' ' || ch == '\t' || ch == '\n' || ch == '\r') {
ch = strm.get();
}

1
src/muz/rel/dl_product_relation.cpp
View file

@ -1030,6 +1030,7 @@ namespace datalog {
}
new_rels.push_back(irel);
}
(void)old_remain;
SASSERT(old_remain==0); //the new specification must be a superset of the old one
m_relations = new_rels;

4
src/muz/spacer/spacer_unsat_core_plugin.cpp
View file

@ -97,7 +97,6 @@ namespace spacer {
// XXX this assertion should be true so there is no need to check for it
SASSERT (!m_ctx.is_closed (step));
func_decl* d = step->get_decl();
symbol sym;
TRACE("spacer.farkas",
tout << "looking at: " << mk_pp(step, m) << "\n";);
if (!m_ctx.is_closed(step) && is_farkas_lemma(m, step)) {
@ -239,9 +238,8 @@ namespace spacer {
SASSERT(m_ctx.is_b(step));
func_decl* d = step->get_decl();
symbol sym;
if (!m_ctx.is_closed(step) && // if step is not already interpolated
is_farkas_lemma(m, step)) {
is_farkas_lemma(m, step)) {
SASSERT(d->get_num_parameters() == m.get_num_parents(step) + 2);
SASSERT(m.has_fact(step));