Home
last modified time | relevance | path

Searched refs:oc_cycle_free (Results 1 – 8 of 8) sorted by relevance

/dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/smt/
H A Ddt_solver.cpp559 if (oc_cycle_free(arg)) in occurs_check_enter()
575 if (oc_cycle_free(aarg)) in occurs_check_enter()
611 if (oc_cycle_free(app)) in occurs_check()
646 if (!oc_cycle_free(node) && occurs_check(node)) in check()
H A Ddt_solver.h107 bool oc_cycle_free(enode * n) const { return n->get_root()->is_marked2(); } in oc_cycle_free() function
/dports/math/z3/z3-z3-4.8.13/src/sat/smt/
H A Ddt_solver.cpp579 if (oc_cycle_free(arg)) in occurs_check_enter()
595 if (oc_cycle_free(aarg)) in occurs_check_enter()
631 if (oc_cycle_free(app)) in occurs_check()
668 if (dt.is_recursive(node->get_sort()) && !oc_cycle_free(node) && occurs_check(node)) in check()
H A Ddt_solver.h108 bool oc_cycle_free(enode * n) const { return n->get_root()->is_marked2(); } in oc_cycle_free() function
/dports/math/z3/z3-z3-4.8.13/src/smt/
H A Dtheory_datatype.h90 bool oc_cycle_free(enode * n) const { return n->get_root()->is_marked2(); } in oc_cycle_free() function
H A Dtheory_datatype.cpp486 … if (m_util.is_recursive(node->get_sort()) && !oc_cycle_free(node) && occurs_check(node)) { in final_check_eh()
589 if (oc_cycle_free(arg)) { in occurs_check_enter()
606 if (oc_cycle_free(aarg)) { in occurs_check_enter()
654 if (oc_cycle_free(app)) continue; in occurs_check()
/dports/math/py-z3-solver/z3-z3-4.8.10/src/smt/
H A Dtheory_datatype.h90 bool oc_cycle_free(enode * n) const { return n->get_root()->is_marked2(); } in oc_cycle_free() function
H A Dtheory_datatype.cpp486 if (!oc_cycle_free(node) && occurs_check(node)) { in final_check_eh()
589 if (oc_cycle_free(arg)) { in occurs_check_enter()
606 if (oc_cycle_free(aarg)) { in occurs_check_enter()
654 if (oc_cycle_free(app)) continue; in occurs_check()