/*
* Expanded form for a product c * p
* - c is a normalized bitvector constant
* - p is a power product stored in a pp_buffer object
* - n = bitsize of p
* - the expansion is returned in a bvarith_buffer or bvarith64_buffer object
* - the result is normalized
*/
void expand_bvpprod64(bvexp_table_t *table, bvarith64_buffer_t *buffer, pp_buffer_t *p, uint32_t n, uint64_t c) {
bv_vartable_t *vtbl;
bvmlist64_t *q;
pp_buffer_t *aux;
pprod_t *r;
uint64_t a;
uint32_t i, m, e, d;
thvar_t x;
assert(buffer->store == &table->store64 && buffer->ptbl == &table->pprods);
bvarith64_buffer_prepare(buffer, n);
bvarith64_buffer_set_one(buffer);
aux = p;
vtbl = table->vtbl;
if (total_degree_test64(table, vtbl, p)) {
/*
* Expansion of c * x_1^d_1 ... x_n^ d_n:
* - for a constant x_i, update c to c * a^d_i (where a = value of c)
* - if x_i is expanded to q_i, update buffer to buffer * q_i ^ d_i
* - otherwise, x_i^d_i is copied into the aux buffer
*/
aux = &table->pp;
pp_buffer_reset(aux);
m = p->len;
for (i=0; i<m; i++) {
x = p->prod[i].var;
d = p->prod[i].exp;
if (bvvar_is_const64(vtbl, x)) {
a = bvvar_val64(vtbl, x);
c *= upower64(a, d);
} else {
q = bvexp_def64(table, x);
if (q != NULL && mlist64_is_short(q, &e) && d * e <= BVEXP_DEGREE_LIMIT) {
// replace x^d by q^d in buffer
bvarith64_buffer_mul_mlist_power(buffer, q, d, &table->aux64);
} else {
// copy x^d into aux
pp_buffer_mul_varexp(aux, x, d);
}
}
}
c = norm64(c, n);
pp_buffer_normalize(aux);
}
/*
* The result is c * aux * buffer
*/
r = pprod_from_buffer(&table->pprods, aux);
bvarith64_buffer_mul_mono(buffer, c, r);
bvarith64_buffer_normalize(buffer);
}
void expand_bvpprod(bvexp_table_t *table, bvarith_buffer_t *buffer, pp_buffer_t *p, uint32_t n, uint32_t *c) {
bv_vartable_t *vtbl;
bvmlist_t *q;
pp_buffer_t *aux;
pprod_t *r;
uint32_t *a;
uint32_t i, m, d, e, k;
thvar_t x;
assert(buffer->store == &table->store && buffer->ptbl == &table->pprods);
bvarith_buffer_prepare(buffer, n);
bvarith_buffer_set_one(buffer);
aux = p;
vtbl = table->vtbl;
if (total_degree_test(table, vtbl, p)) {
aux = &table->pp;
pp_buffer_reset(aux);
// make a copy of c in the internal bvconst buffer
bvconstant_copy(&table->bvconst, n, c);
c = table->bvconst.data;
k = (n + 31) >> 5;
m = p->len;
for (i=0; i<m; i++) {
x = p->prod[i].var;
d = p->prod[i].exp;
if (bvvar_is_const(vtbl, x)) {
a = bvvar_val(vtbl, x);
bvconst_mulpower(c, k, a, d);
} else {
q = bvexp_def(table, x);
if (q != NULL && mlist_is_short(q, &e) && d * e <= BVEXP_DEGREE_LIMIT) {
bvarith_buffer_mul_mlist_power(buffer, q, d, &table->aux);
} else {
pp_buffer_mul_varexp(aux, x, d);
}
}
}
// normalize
bvconst_normalize(c, n);
pp_buffer_normalize(aux);
}
/*
* The result is c * aux * buffer
*/
r = pprod_from_buffer(&table->pprods, aux);
bvarith_buffer_mul_mono(buffer, c, r);
bvarith_buffer_normalize(buffer);
}
int main(void) {
uint32_t i, j, n;
pprod_t *q;
init_pprod_table(&ptbl, 10);
init_pp_buffer(&buffer, 10);
p[0] = empty_pp;
p[1] = var_pp(0);
p[2] = var_pp(1);
p[3] = var_pp(2);
p[4] = var_pp(3);
num_prods = 5;
for (i=0; i<5; i++) {
for (j=0; j<5; j++) {
q = pprod_mul(&ptbl, p[i], p[j]);
print_pprod0(stdout, p[i]);
printf(" * ");
print_pprod0(stdout, p[j]);
printf(" = ");
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
}
}
n = num_prods;
for (i=0; i<n; i++) {
for (j=0; j<n; j++) {
q = pprod_mul(&ptbl, p[i], p[j]);
print_pprod0(stdout, p[i]);
printf(" * ");
print_pprod0(stdout, p[j]);
printf(" = ");
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
}
}
for (i=0; i<num_prods; i++) {
pp_buffer_set_pprod(&buffer, p[i]);
printf("p[%"PRIu32"] = %p = ", i, p[i]);
print_pprod0(stdout, p[i]);
printf("\n");
printf("buffer: ");
print_pp_buffer0(stdout, &buffer);
printf("\n");
q = pprod_from_buffer(&ptbl, &buffer);
printf("prod from buffer = %p = ", q);
print_pprod0(stdout, q);
if (q != p[i]) {
printf("BUG: HASH CONSING FAILED\n");
fflush(stdout);
abort();
}
printf("\n\n");
}
// delete the non-trivial products
for (i=5; i<num_prods; i++) {
q = p[i];
assert(q != empty_pp && q != end_pp && !pp_is_var(q));
printf("deleting p[%"PRIu32"] = %p = ", i, q);
print_pprod0(stdout, q);
printf("\n");
delete_pprod(&ptbl, q);
}
printf("\n\n");
p[5] = var_pp(4);
num_prods = 6;
// reconstruct more products
q = pprod_mul(&ptbl, p[1], p[2]);
printf("checking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
q = pprod_mul(&ptbl, p[2], p[3]);
printf("checking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
q = pprod_mul(&ptbl, p[3], p[2]);
printf("rechecking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
q = pprod_mul(&ptbl, p[3], p[4]);
printf("checking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
q = pprod_mul(&ptbl, p[4], p[3]);
printf("rechecking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
q = pprod_mul(&ptbl, p[4], p[5]);
printf("checking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
q = pprod_mul(&ptbl, p[0], p[5]);
printf("checking q = %p = ", q);
print_pprod0(stdout, q);
printf("\n");
check_product(q);
printf("\n");
printf("*** Table content before GC ***\n");
print_pprod_table(stdout, &ptbl);
pprod_table_set_gc_mark(&ptbl, p[num_prods - 1]);
pprod_table_gc(&ptbl);
printf("\n*** Table content after GC ***\n");
print_pprod_table(stdout, &ptbl);
printf("\n");
delete_pp_buffer(&buffer);
delete_pprod_table(&ptbl);
return 0;
}
