Lines Matching refs:entries
27 if (list_empty(&gating_cfg->entries)) {
28 list_add(&e->list, &gating_cfg->entries);
32 list_for_each_entry(p, &gating_cfg->entries, list) {
54 /* The gate entries contain absolute times in their e->interval field. Convert
65 list_for_each_entry(e, &gating_cfg->entries, list) {
70 if (prev == &gating_cfg->entries)
76 last_e = list_last_entry(&gating_cfg->entries,
85 list_for_each_entry_safe(e, n, &gating_cfg->entries, list) {
144 u8 gate_state = rule->vl.entries[i].gate_state;
157 time += rule->vl.entries[i].interval;
339 NL_SET_ERR_MSG_MOD(extack, "Not enough VL entries available");
353 kfree(table->entries);
360 kfree(table->entries);
367 kfree(table->entries);
374 kfree(table->entries);
386 table->entries = kcalloc(num_virtual_links,
389 if (!table->entries)
392 vl_lookup = table->entries;
431 * "the entries in the VL Lookup table must be sorted in ascending
455 table->entries = kcalloc(max_sharindx, table->ops->unpacked_entry_size,
457 if (!table->entries)
460 vl_policing = table->entries;
464 table->entries = kcalloc(max_sharindx, table->ops->unpacked_entry_size,
466 if (!table->entries)
469 vl_fwd = table->entries;
473 table->entries = kcalloc(1, table->ops->unpacked_entry_size,
475 if (!table->entries)
585 u32 num_entries, struct action_gate_entry *entries)
638 rule->vl.entries = kcalloc(num_entries,
641 if (!rule->vl.entries) {
647 div_s64_rem(entries[i].interval,
656 if (!entries[i].interval) {
663 if (ns_to_sja1105_delta(entries[i].interval) >
671 if (entries[i].maxoctets != -1) {
679 ipv = entries[i].ipv;
680 } else if (ipv != entries[i].ipv) {
687 rule->vl.entries[i] = entries[i];
723 kfree(rule->vl.entries);
743 vl_lookup = table->entries;