Lines Matching defs:ent

327 	struct rte_thash_subtuple_helper *ent, *tmp;
343 ent = LIST_FIRST(&(ctx->head));
344 while (ent) {
345 free_lfsr(ent->lfsr);
346 tmp = ent;
347 ent = LIST_NEXT(ent, next);
445 struct rte_thash_subtuple_helper *ent,
453 ent->lfsr = alloc_lfsr(ctx->reta_sz_log);
454 if (ent->lfsr == NULL) {
455 rte_free(ent);
459 ret = generate_subkey(ctx, ent->lfsr, start, end - 1);
461 free_lfsr(ent->lfsr);
462 rte_free(ent);
468 " helper %s", ent->name, next_ent->name);
469 rte_free(ent);
472 attach_lfsr(ent, cur_ent->lfsr);
478 ret = generate_subkey(ctx, ent->lfsr, cur_ent->offset - 1, start);
480 free_lfsr(ent->lfsr);
481 rte_free(ent);
490 ret = generate_subkey(ctx, ent->lfsr, range_end, end - 1);
492 free_lfsr(ent->lfsr);
493 rte_free(ent);
498 LIST_INSERT_BEFORE(cur_ent, ent, next);
499 generate_complement_table(ctx, ent);
506 struct rte_thash_subtuple_helper *ent,
517 " helper %s", ent->name, next_ent->name);
518 rte_free(ent);
522 attach_lfsr(ent, cur_ent->lfsr);
528 ret = generate_subkey(ctx, ent->lfsr, range_end, end - 1);
530 free_lfsr(ent->lfsr);
531 rte_free(ent);
536 LIST_INSERT_AFTER(prev_ent, ent, next);
537 generate_complement_table(ctx, ent);
547 struct rte_thash_subtuple_helper *ent, *cur_ent, *prev_ent, *next_ent;
567 ent = rte_zmalloc(NULL, sizeof(struct rte_thash_subtuple_helper) +
570 if (ent == NULL)
573 rte_strlcpy(ent->name, name, sizeof(ent->name));
574 ent->offset = start;
575 ent->len = end - start;
576 ent->tuple_offset = offset;
577 ent->tuple_len = len;
578 ent->lsb_msk = (1 << ctx->reta_sz_log) - 1;
596 return insert_before(ctx, ent, cur_ent, next_ent,
599 return insert_after(ctx, ent, cur_ent, next_ent,
606 ent->lfsr = alloc_lfsr(ctx->reta_sz_log);
607 if (ent->lfsr == NULL) {
608 rte_free(ent);
613 ret = generate_subkey(ctx, ent->lfsr, start, end - 1);
615 free_lfsr(ent->lfsr);
616 rte_free(ent);
620 LIST_INSERT_HEAD(&ctx->head, ent, next);
625 LIST_INSERT_AFTER(prev_ent, ent, next);
627 generate_complement_table(ctx, ent);
636 struct rte_thash_subtuple_helper *ent;
641 LIST_FOREACH(ent, &ctx->head, next) {
642 if (strncmp(name, ent->name, sizeof(ent->name)) == 0)
643 return ent;