/*
* Change the mapping of r:
* - replace the current mapping by x
* - r must be a root, already mapped, and with positive polarity
*/
void intern_tbl_remap_root(intern_tbl_t *tbl, term_t r, int32_t x) {
assert(0 <= x && x < INT32_MAX && is_pos_term(r) &&
intern_tbl_is_root(tbl, r) && intern_tbl_root_is_mapped(tbl, r));
ai32_write(&tbl->map, index_of(r), (INT32_MIN|x));
assert(intern_tbl_map_of_root(tbl, r) == x);
}
/*
* Print what's mapped to t in the context's internalization table.
* - if t is mapped to a Boolean, the corresponding DIMACS literal is printed
* - if t is mapped to a bitvector then the corresponding literal array is printed
* - otherwise we print "non boolean"
*/
void dimacs_print_internalized_term(FILE *f, context_t *ctx, term_t t) {
intern_tbl_t *intern;
type_table_t *types;
term_t r;
type_t tau;
int32_t code;
uint32_t polarity;
intern = &ctx->intern;
types = ctx->types;
r = intern_tbl_get_root(intern, t);
if (t != r) {
// substitution: t --> r (can't deal with this)
fputs("eliminated", f);
} else if (intern_tbl_root_is_mapped(intern, r)) {
// t = r is mapped to something
polarity = polarity_of(r);
r = unsigned_term(r);
tau = intern_tbl_type_of_root(intern, r);
if (is_boolean_type(tau)) {
// Boolean term
code = intern_tbl_map_of_root(intern, r);
assert(code_is_valid(code));
dimacs_print_bool_code(f, code, polarity);
} else if (is_bv_type(types, tau)) {
// Bitvector term
code = intern_tbl_map_of_root(intern, r);
assert(code_is_valid(code));
assert(polarity == 0);
dimacs_print_bv_code(f, ctx, code);
} else {
// Can't be converted to DIMACS
fputs("non boolean", f);
}
} else {
// r not mapped to anything
fputs("not internalized", f);
}
}
/*
* Add the mapping r --> x then freeze r
* - x must be non-negative and strictly smaller than INT32_MAX
* - r must be a root, not mapped to anything yet, and must have positive
* polarity.
*/
void intern_tbl_map_root(intern_tbl_t *tbl, term_t r, int32_t x) {
assert(0 <= x && x < INT32_MAX &&
is_pos_term(r) && ai32_read(&tbl->map, index_of(r)) == NULL_MAP);
// Freeze r and record its type if needed
if (! intern_tbl_term_present(tbl, r)) {
partition_add_frozen(tbl, r);
} else if (au8_read(&tbl->rank, index_of(r)) < 255) {
au8_write(&tbl->rank, index_of(r), 255);
}
// add the mapping
ai32_write(&tbl->map, index_of(r), (INT32_MIN|x));
assert(intern_tbl_map_of_root(tbl, r) == x &&
intern_tbl_is_root(tbl, r) && !intern_tbl_root_is_free(tbl, r));
}
