/net/tipc/ |
H A D | ref.c | 53 * struct tipc_ref_table - table of TIPC object reference entries 54 * @entries: pointer to array of reference entries 63 struct reference *entries; member in struct:ref_table 73 * Object reference table consists of 2**N entries. 108 /* allocate table & mark all entries as uninitialized */ 113 tipc_ref_table.entries = table; 129 if (!tipc_ref_table.entries) 132 vfree(tipc_ref_table.entries); 133 tipc_ref_table.entries [all...] |
/net/netfilter/ |
H A D | xt_repldata.h | 4 * 'entries' and 'term' are never anywhere referenced by word in code. In fact, 14 struct type##_standard entries[nhooks]; \ 30 tbl->entries[i++] = (struct type##_standard) \
|
H A D | xt_recent.c | 81 unsigned int entries; member in struct:recent_table 147 t->entries--; 151 * Drop entries with timestamps older then 'time'. 175 if (t->entries >= ip_list_tot) { 194 t->entries++;
|
/net/can/ |
H A D | af_can.h | 69 int entries; member in struct:dev_rcv_lists
|
H A D | af_can.c | 477 d->entries++; 560 d->entries--; 566 if (d->remove_on_zero_entries && !d->entries) { 593 if (d->entries == 0) 597 /* check for error message frame entries only */ 607 /* check for unfiltered entries */ 613 /* check for can_id/mask entries */ 621 /* check for inverted can_id/mask entries */ 826 if (d->entries) 926 BUG_ON(d->entries); [all...] |
/net/bridge/netfilter/ |
H A D | ebtables.c | 219 base = private->entries; 438 struct ebt_entry *e = (void *)newinfo->entries + offset; 447 repl->entries + offset) 509 /* this checks if the previous chain has as many entries 512 BUGPRINT("nentries does not equal the nr of entries " 561 * entries is a jump to the beginning of a new chain. 836 /* do the parsing of the table/chains/entries/matches/watchers/targets, heh */ 851 if (newinfo->hook_entry[i] != (struct ebt_entries *)newinfo->entries) { 868 i = 0; /* holds the expected nr. of entries for the chain */ 869 j = 0; /* holds the up to now counted entries fo 1426 char *entries; local 1563 compat_uptr_t entries; member in struct:compat_ebt_replace 1778 const void *entries = info->entries; local [all...] |
H A D | ebtable_broute.c | 34 .entries = (char *)&initial_chain,
|
H A D | ebtable_filter.c | 43 .entries = (char *)initial_chains,
|
H A D | ebtable_nat.c | 43 .entries = (char *)initial_chains,
|
/net/batman-adv/ |
H A D | vis.c | 176 struct batadv_vis_info_entry *entries) 180 for (i = 0; i < packet->entries; i++) { 181 if (entries[i].quality == 0) 184 if (batadv_compare_eth(entries[i].src, packet->vis_orig)) 187 batadv_vis_data_insert_interface(entries[i].src, list, false); 194 struct batadv_vis_info_entry *entries) 202 for (i = 0; i < packet->entries; i++) 203 batadv_vis_data_read_entry(seq, &entries[i], 220 struct batadv_vis_info_entry *entries; local 229 entries 174 batadv_vis_data_insert_interfaces(struct hlist_head *list, struct batadv_vis_packet *packet, struct batadv_vis_info_entry *entries) argument 191 batadv_vis_data_read_entries(struct seq_file *seq, struct hlist_head *list, struct batadv_vis_packet *packet, struct batadv_vis_info_entry *entries) argument [all...] |
H A D | packet.h | 238 uint8_t entries; /* number of entries behind this struct */ member in struct:batadv_vis_packet
|
/net/netlink/ |
H A D | af_netlink.h | 61 unsigned int entries; member in struct:nl_portid_hash
|
/net/netfilter/ipvs/ |
H A D | ip_vs_lblc.c | 16 * collect stale entries of 24+ hours when 60 * It is for garbage collection of stale IPVS lblc entries, 72 * entries that haven't been touched for a day. 108 struct timer_list periodic_timer; /* collect stale entries */ 109 atomic_t entries; /* number of entries */ member in struct:ip_vs_lblc_table 110 int max_size; /* maximum size of entries */ 175 atomic_inc(&tbl->entries); 236 * Flush all the entries of the specified table. 250 atomic_dec(&tbl->entries); [all...] |
H A D | ip_vs_lblcr.c | 60 * It is for garbage collection of stale IPVS lblcr entries, 72 * entries that haven't been touched for a day. 288 atomic_t entries; /* number of entries */ member in struct:ip_vs_lblcr_table 289 int max_size; /* maximum size of entries */ 290 struct timer_list periodic_timer; /* collect stale entries */ 349 atomic_inc(&tbl->entries); 406 * Flush all the entries of the specified table. 453 atomic_dec(&tbl->entries); 463 * It is used to collect stale entries whe [all...] |
/net/core/ |
H A D | drop_monitor.c | 155 for (i = 0; i < msg->entries; i++) { 161 if (msg->entries == dm_hit_limit) 168 memcpy(msg->points[msg->entries].pc, &location, sizeof(void *)); 169 msg->points[msg->entries].count = 1; 170 msg->entries++;
|
/net/xfrm/ |
H A D | xfrm_algo.c | 23 * Algorithms supported by IPsec. These entries contain properties which 586 int entries; member in struct:xfrm_algo_list 593 .entries = ARRAY_SIZE(aead_list), 600 .entries = ARRAY_SIZE(aalg_list), 607 .entries = ARRAY_SIZE(ealg_list), 614 .entries = ARRAY_SIZE(calg_list), 627 for (i = 0; i < algo_list->entries; i++) {
|
/net/ipv4/netfilter/ |
H A D | iptable_filter.c | 66 ((struct ipt_standard *)repl->entries)[1].target.verdict =
|
H A D | arp_tables.c | 274 table_base = private->entries[smp_processor_id()]; 637 /* Walk through entries, checking offsets. */ 656 duprintf("translate_table: %u not %u entries\n", 703 if (newinfo->entries[i] && newinfo->entries[i] != entry0) 704 memcpy(newinfo->entries[i], entry0, newinfo->size); 721 xt_entry_foreach(iter, t->entries[cpu], t->size) { 773 loc_cpu_entry = private->entries[raw_smp_processor_id()]; 868 /* we dont care about newinfo->entries[] */ 869 memcpy(newinfo, info, offsetof(struct xt_table_info, entries)); 1476 struct compat_arpt_entry entries[0]; member in struct:compat_arpt_replace [all...] |
H A D | ip_tables.c | 264 table_base = private->entries[smp_processor_id()]; 330 table_base = private->entries[cpu]; 806 /* Walk through entries, checking offsets. */ 822 duprintf("translate_table: %u not %u entries\n", 867 if (newinfo->entries[i] && newinfo->entries[i] != entry0) 868 memcpy(newinfo->entries[i], entry0, newinfo->size); 886 xt_entry_foreach(iter, t->entries[cpu], t->size) { 942 loc_cpu_entry = private->entries[raw_smp_processor_id()]; 1056 /* we dont care about newinfo->entries[] */ 1392 struct compat_ipt_entry entries[0]; member in struct:compat_ipt_replace [all...] |
H A D | ipt_CLUSTERIP.c | 43 atomic_t entries; /* number of entries/rules member in struct:clusterip_config 89 /* decrease the count of entries using/referencing this config. If last 96 if (atomic_dec_and_lock(&c->entries, &clusterip_lock)) { 139 atomic_inc(&c->entries); 174 atomic_set(&c->entries, 1); 417 /* if no more entries are referencing the config, remove it
|
/net/ipv6/netfilter/ |
H A D | ip6table_filter.c | 58 ((struct ip6t_standard *)repl->entries)[1].target.verdict =
|
H A D | ip6_tables.c | 290 table_base = private->entries[smp_processor_id()]; 353 table_base = private->entries[cpu]; 816 /* Walk through entries, checking offsets. */ 832 duprintf("translate_table: %u not %u entries\n", 877 if (newinfo->entries[i] && newinfo->entries[i] != entry0) 878 memcpy(newinfo->entries[i], entry0, newinfo->size); 896 xt_entry_foreach(iter, t->entries[cpu], t->size) { 952 loc_cpu_entry = private->entries[raw_smp_processor_id()]; 1066 /* we dont care about newinfo->entries[] */ 1404 struct compat_ip6t_entry entries[0]; member in struct:compat_ip6t_replace [all...] |
/net/mac80211/ |
H A D | mesh_pathtbl.c | 107 atomic_set(&newtbl->entries, 0); 136 atomic_dec(&tbl->entries); 161 if (atomic_read(&oldtbl->entries) 169 atomic_set(&newtbl->entries, atomic_read(&oldtbl->entries)); 380 * @sdata: local subif, or NULL for all entries 557 if (atomic_inc_return(&tbl->entries) >= 686 if (atomic_inc_return(&tbl->entries) >= 770 atomic_dec(&tbl->entries);
|
H A D | mesh.c | 219 int entries = 0; local 227 ++entries; 229 entries == RMC_QUEUE_MAX_LEN) { 232 --entries;
|
H A D | mesh.h | 133 * @entries: number of entries in the table 151 atomic_t entries; /* Up to MAX_MESH_NEIGHBOURS */ member in struct:mesh_table
|