Lines Matching defs:entries
35 * @n_tables: number of tables under @entries
37 * @entries: table of tables of ports currently offloaded
50 struct udp_tunnel_nic_table_entry **entries;
137 if (!udp_tunnel_nic_entry_is_free(&utn->entries[i][j]))
157 if (udp_tunnel_nic_entry_is_free(&utn->entries[i][j]))
172 entry = &utn->entries[table][idx];
182 dev->udp_tunnel_nic->entries[table][idx].hw_priv = priv;
217 entry = &utn->entries[table][idx];
260 if (udp_tunnel_nic_entry_is_queued(&utn->entries[i][j]))
273 entry = &utn->entries[i][j];
354 entry = &utn->entries[i][j];
370 struct udp_tunnel_nic_table_entry *entry = &utn->entries[table][idx];
377 * For dodgy entries make sure we try to sync again (queue the entry).
409 struct udp_tunnel_nic_table_entry *entry = &utn->entries[table][idx];
478 entry = &utn->entries[i][j];
568 entry = &utn->entries[i][j];
598 if (!udp_tunnel_nic_entry_is_present(&utn->entries[table][j]))
623 if (!udp_tunnel_nic_entry_is_present(&utn->entries[table][j]))
629 utn->entries[table][j].port) ||
631 ilog2(utn->entries[table][j].type)))
662 int adj_cnt = -utn->entries[i][j].use_cnt;
671 memset(utn->entries[i], 0, array_size(info->tables[i].n_entries,
672 sizeof(**utn->entries)));
689 udp_tunnel_nic_entry_freeze_used(&utn->entries[i][j]);
702 udp_tunnel_nic_entry_unfreeze(&utn->entries[i][j]);
732 utn->entries = kmalloc_array(n_tables, sizeof(void *), GFP_KERNEL);
733 if (!utn->entries)
737 utn->entries[i] = kcalloc(info->tables[i].n_entries,
738 sizeof(*utn->entries[i]), GFP_KERNEL);
739 if (!utn->entries[i])
747 kfree(utn->entries[i]);
748 kfree(utn->entries);
759 kfree(utn->entries[i]);
760 kfree(utn->entries);
866 /* Flush before we check work, so we don't waste time adding entries