/*
* Delete the table
*/
void delete_bvexp_table(bvexp_table_t *table) {
uint32_t i, n, b;
void *p;
n = table->nvars;
for (i=0; i<n; i++) {
p = table->def[i];
if (p != NULL) {
b = bvvar_bitsize(table->vtbl, i);
if (b > 64) {
delete_bvmlist_coeffs(p, b);
}
}
}
// aux buffers must be deleted first
delete_bvarith_buffer(&table->aux);
delete_bvarith64_buffer(&table->aux64);
delete_pp_buffer(&table->pp);
delete_bvconstant(&table->bvconst);
safe_free(table->def);
table->def = NULL;
delete_bvmlist_store(&table->store);
delete_bvmlist64_store(&table->store64);
delete_pprod_table(&table->pprods);
delete_int_htbl(&table->htbl);
}
/*
* Multiply b by t^d
* - t must be an arithmetic term
* - p->ptbl and table->pprods must be equal
*/
void bvarith_buffer_mul_term_power(bvarith_buffer_t *b, term_table_t *table, term_t t, uint32_t d) {
bvarith_buffer_t aux;
bvconstant_t c;
bvpoly_t *p;
pprod_t **v;
pprod_t *r;
int32_t i;
assert(b->ptbl == table->pprods);
assert(pos_term(t) && good_term(table, t) && is_bitvector_term(table, t) &&
term_bitsize(table, t) == b->bitsize);
i = index_of(t);
switch (table->kind[i]) {
case POWER_PRODUCT:
r = pprod_exp(b->ptbl, pprod_for_idx(table, i), d); // r = t^d
bvarith_buffer_mul_pp(b, r);
break;
case BV_CONSTANT:
init_bvconstant(&c);
bvconstant_copy64(&c, b->bitsize, 1); // c := 1
bvconst_mulpower(c.data, b->width, bvconst_for_idx(table, i)->data, d); // c := t^d
bvarith_buffer_mul_const(b, c.data);
delete_bvconstant(&c);
break;
case BV_POLY:
p = bvpoly_for_idx(table, i);
v = pprods_for_bvpoly(table, p);
init_bvarith_buffer(&aux, b->ptbl, b->store);
bvarith_buffer_mul_bvpoly_power(b, p, v, d, &aux);
delete_bvarith_buffer(&aux);
term_table_reset_pbuffer(table);
break;
default:
r = pprod_varexp(b->ptbl, t, d);
bvarith_buffer_mul_pp(b, r);
break;
}
}
/*
* Add a * t to b
* - t must be defined in table and be a bitvector term of same bitsize as b
* - a must be have the same bitsize as b (as many words a b->width)
* - b->ptbl must be the same as table->pprods
*/
void bvarith_buffer_add_const_times_term(bvarith_buffer_t *b, term_table_t *table, uint32_t *a, term_t t) {
bvconstant_t c;
pprod_t **v;
bvpoly_t *p;
int32_t i;
assert(b->ptbl == table->pprods);
assert(pos_term(t) && good_term(table, t) && is_bitvector_term(table, t) &&
term_bitsize(table, t) == b->bitsize);
i = index_of(t);
switch (table->kind[i]) {
case POWER_PRODUCT:
bvarith_buffer_add_mono(b, a, pprod_for_idx(table, i));
break;
case BV_CONSTANT:
init_bvconstant(&c);
bvconstant_copy(&c, b->bitsize, bvconst_for_idx(table, i)->data);
bvconst_mul(c.data, b->width, a);
bvarith_buffer_add_const(b, c.data);
delete_bvconstant(&c);
break;
case BV_POLY:
p = bvpoly_for_idx(table, i);
v = pprods_for_bvpoly(table, p);
bvarith_buffer_add_const_times_bvpoly(b, p, v, a);
term_table_reset_pbuffer(table);
break;
default:
bvarith_buffer_add_varmono(b, a, t);
break;
}
}
/*
* Delete everything
*/
void delete_fresh_val_maker(fresh_val_maker_t *maker) {
delete_tup_counter_vector(&maker->tuples);
delete_bv_counter_vector(&maker->bvs);
delete_bvconstant(&maker->aux);
}
