static array_t*
rule_set_inv_rw (const struct rule *r, uint32_t ln)
{
array_t *inv_mask = array_not_a (DATA_ARR (r->mask), ln);
array_t *inv_rw = array_and_a (DATA_ARR (r->match), inv_mask, ln);
array_free (inv_mask);
return inv_rw;
}
static array_t*
rule_set_inv_mat (const struct rule *r, uint32_t ln)
{
assert (r->match);
array_t *inv_mask = array_not_a (DATA_ARR (r->mask), ln);
array_t *new_rw = array_and_a (inv_mask, DATA_ARR (r->rewrite), ln);
array_t *masked_mat = array_and_a (DATA_ARR (r->match), DATA_ARR (r->mask), ln);
array_t *inv_mat = array_or_a (new_rw, masked_mat, ln);
array_free (inv_mask);
array_free (new_rw);
array_free (masked_mat);
return inv_mat;
}
static struct list_res
rule_apply (const struct rule *r, const struct tf *tf, const struct res *in,
bool append, uint32_t *app, int *napp)
{
struct list_res res = {0};
if (!r->out) app_add (r->idx, app, napp);
if (!r->out || r->out == in->port) return res;
struct hs hs;
if (!r->match) hs_copy (&hs, &in->hs);
else {
if (!hs_isect_arr (&hs, &in->hs, DATA_ARR (r->match))) return res;
if (r->deps) deps_diff (&hs, in->port, DEPS (tf, r->deps), tf, app, *napp);
if (!hs_compact_m (&hs, r->mask ? DATA_ARR (r->mask) : NULL)) { hs_destroy (&hs); return res; }
if (r->mask) hs_rewrite (&hs, DATA_ARR (r->mask), DATA_ARR (r->rewrite));
}
bool used_hs = false;
uint32_t n, x;
const uint32_t *a;
if (r->out > 0) { n = 1; x = r->out; a = &x; }
else {
const struct ports *p = PORTS (tf, r->out);
n = p->n; a = p->arr;
}
for (int i = 0; i < n; i++) {
if (a[i] == in->port) continue;
struct res *tmp;
if (used_hs) tmp = res_extend (in, &hs, a[i], append);
else {
tmp = res_extend (in, NULL, a[i], append);
tmp->hs = hs;
used_hs = true;
}
res_rule_add (tmp, tf, r->idx);
list_append (&res, tmp);
}
if (res.head) app_add (r->idx, app, napp);
if (!used_hs) hs_destroy (&hs);
return res;
}
static void
deps_diff_inv (struct hs *hs, uint32_t port, const struct deps *deps,
const struct tf *tf)
{
for (int i = 0; i < deps->n; i++) {
const struct dep *dep = &deps->deps[i];
if (dep->port > 0 && dep->port != port) continue;
if (dep->port < 0 && !port_match (port, dep->port, tf)) continue;
hs_diff (hs, DATA_ARR (dep->match));
}
}
static void
deps_diff (struct hs *hs, uint32_t port, const struct deps *deps,
const struct tf *tf, const uint32_t *app, int napp)
{
for (int i = 0; i < deps->n; i++) {
const struct dep *dep = &deps->deps[i];
if (app && !int_find (dep->rule, app, napp)) continue;
if (dep->port > 0 && dep->port != port) continue;
if (dep->port < 0 && !port_match (port, dep->port, tf)) continue;
hs_diff (hs, DATA_ARR (dep->match));
}
}
struct list_res
rule_inv_apply (const struct tf *tf, const struct rule *r, const struct res *in,
bool append)
{
/* Given a rule `r` in a tf `tf`, apply the inverse of `r` on the input
(headerspace,port) `in`. */
struct list_res res = {0};
// prune cases where rule outport doesn't include the current port
if (r->out > 0 && r->out != in->port) return res;
if (r->out < 0 && !port_match(in->port, r->out, tf)) return res;
if (!r->out) return res;
// set up inverse match and rewrite arrays
array_t *inv_rw=0, *inv_mat=0;
if (r->mask) { // rewrite rule
inv_mat = rule_set_inv_mat (r, in->hs.len);
inv_rw = rule_set_inv_rw (r, in->hs.len);
}
else { // fwding and topology rules
if (r->match) inv_mat = array_copy (DATA_ARR (r->match), in->hs.len);
}
struct hs hs;
if (!r->match) hs_copy (&hs, &in->hs); // topology rule
else { // fwding and rewrite rules
if (!hs_isect_arr (&hs, &in->hs, inv_mat)) return res;
if (r->mask) hs_rewrite (&hs, DATA_ARR (r->mask), inv_rw);
}
// there is a new hs result corresponding to each rule inport
bool used_hs = port_append_res (&res, r, tf, in, r->in, append, &hs, true);
if (inv_rw) array_free (inv_rw);
if (inv_mat) array_free (inv_mat);
if (!used_hs) hs_destroy (&hs);
return res;
}
static void
rule_print (const struct rule *r, const struct tf *tf)
{
printf ("Rule %u\nIn: ", r->idx);
print_ports (r->in, tf);
printf ("Out: ");
print_ports (r->out, tf);
if (r->match) {
char *match = array_to_str (DATA_ARR (r->match), data_arrs_len, true);
printf ("Match: %s\n", match);
free (match);
if (r->mask) {
char *mask = array_to_str (DATA_ARR (r->mask), data_arrs_len, false);
char *rewrite = array_to_str (DATA_ARR (r->rewrite), data_arrs_len, false);
printf ("Mask: %s\nRewrite: %s\n", mask, rewrite);
free (mask);
free (rewrite);
}
//printf ("Deps:\n");
//deps_print (r->deps);
}
printf ("-----\n");
}
static bool
port_append_res (struct list_res *res, const struct rule *r,
const struct tf *tf, const struct res *in, int32_t ports,
bool append, const struct hs *hs, bool inv_remove_deps)
{
/* Create new result containing headerspace `hs` for each port in `ports`. */
bool used_hs = false;
struct hs *new_hs;
uint32_t n, x;
const uint32_t *a;
if (ports > 0) { n = 1; x = ports; a = &x; }
else {
const struct ports *p = PORTS (tf, ports);
n = p->n; a = p->arr;
}
for (int i = 0; i < n; i++) {
if (a[i] == in->port) continue;
if (inv_remove_deps) {
/* For inversion, also remove dependencies for each input port of the
inverted rule. */
new_hs = hs_create (hs->len);
hs_copy (new_hs, hs);
if (r->deps) deps_diff_inv (new_hs, a[i], DEPS (tf, r->deps), tf);
if (!hs_compact_m (new_hs, r->mask ? DATA_ARR (r->mask) : NULL)) { hs_destroy(new_hs); continue; }
}
else new_hs = (struct hs*) hs;
// now *new_hs has the latest hs at this port
struct res *tmp;
if (! inv_remove_deps) {
if (used_hs) tmp = res_extend (in, hs, a[i], append);
else {
tmp = res_extend (in, NULL, a[i], append);
tmp->hs = *hs;
used_hs = true;
}
}
else {
tmp = res_extend (in, NULL, a[i], append);
tmp->hs = *new_hs;
}
res_rule_add (tmp, tf, r->idx, r);
list_append (res, tmp);
}
return used_hs;
}
static struct list_res
rule_apply (const struct rule *r, const struct tf *tf, const struct res *in,
bool append, uint32_t *app, int *napp)
{
struct list_res res = {0};
if (!r->out) app_add (r->idx, app, napp);
if (!r->out || r->out == in->port) return res;
struct hs hs;
if (!r->match) hs_copy (&hs, &in->hs);
else {
if (!hs_isect_arr (&hs, &in->hs, DATA_ARR (r->match))) return res;
if (r->deps) deps_diff (&hs, in->port, DEPS (tf, r->deps), tf, app, *napp);
if (!hs_compact_m (&hs, r->mask ? DATA_ARR (r->mask) : NULL)) { hs_destroy (&hs); return res; }
if (r->mask) hs_rewrite (&hs, DATA_ARR (r->mask), DATA_ARR (r->rewrite));
}
bool used_hs = port_append_res (&res, r, tf, in, r->out, append, &hs, false);
if (res.head) app_add (r->idx, app, napp);
if (!used_hs) hs_destroy (&hs);
return res;
}
