tbl_idx = skb_get_hash_raw(skb) & ENIC_RFS_FLW_MASK;
spin_lock_bh(&enic->rfs_h.lock);
n = htbl_key_search(&enic->rfs_h.ht_head[tbl_idx], &keys);
if (n) { /* entry already present */ if (rxq_index == n->rq_id) {
res = -EEXIST; goto ret_unlock;
}
/* desired rq changed for the flow, we need to delete *oldfltrandaddnewone * *Themomentwedeletethefltr,theupcomingpkts *areputitdefaultrqbasedonrss.Whenweadd *newfilter,upcomingpktsareputindesiredqueue. *Thiscouldcauseooopkts. * *Lets1sttryaddingnewfltrandthendeloldone.
*/
i = --enic->rfs_h.free; /* clsf tbl is full, we have to del old fltr first*/ if (unlikely(i < 0)) {
enic->rfs_h.free++;
res = enic_delfltr(enic, n->fltr_id); if (unlikely(res < 0)) goto ret_unlock;
res = enic_addfltr_5t(enic, &keys, rxq_index); if (res < 0) {
hlist_del(&n->node);
enic->rfs_h.free++; goto ret_unlock;
} /* add new fltr 1st then del old fltr */
} else { int ret;
res = enic_addfltr_5t(enic, &keys, rxq_index); if (res < 0) {
enic->rfs_h.free++; goto ret_unlock;
}
ret = enic_delfltr(enic, n->fltr_id); /* deleting old fltr failed. Add old fltr to list. *enic_flow_may_expire()willtrytodeleteitlater.
*/ if (unlikely(ret < 0)) { struct enic_rfs_fltr_node *d; struct hlist_head *head;
head = &enic->rfs_h.ht_head[tbl_idx];
d = kmalloc(sizeof(*d), GFP_ATOMIC); if (d) {
d->fltr_id = n->fltr_id;
INIT_HLIST_NODE(&d->node);
hlist_add_head(&d->node, head);
}
} else {
enic->rfs_h.free++;
}
}
n->rq_id = rxq_index;
n->fltr_id = res;
n->flow_id = flow_id; /* entry not present */
} else {
i = --enic->rfs_h.free; if (i <= 0) {
enic->rfs_h.free++;
res = -EBUSY; goto ret_unlock;
}
n = kmalloc(sizeof(*n), GFP_ATOMIC); if (!n) {
res = -ENOMEM;
enic->rfs_h.free++; goto ret_unlock;
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.