/net/netlink/ |
H A D | diag.c | 105 struct rhashtable *ht = &tbl->hash; local 106 const struct bucket_table *htbl = rht_dereference(ht->tbl, ht); 116 rht_for_each_entry(nlsk, htbl->buckets[i], ht, node) {
|
H A D | af_netlink.c | 2913 struct rhashtable *ht = &nl_table[i].hash; local 2914 const struct bucket_table *tbl = rht_dereference_rcu(ht->tbl, ht); 2944 struct rhashtable *ht; local 2960 ht = &nl_table[i].hash; 2961 rht_for_each_entry(nlk, nlk->node.next, ht, node) 2968 const struct bucket_table *tbl = rht_dereference_rcu(ht->tbl, ht); 2971 rht_for_each_entry(nlk, tbl->buckets[j], ht, node) {
|
/net/hsr/ |
H A D | hsr_main.h | 71 static inline u16 get_hsr_tag_path(struct hsr_tag *ht) argument 73 return ntohs(ht->path_and_LSDU_size) >> 12; 76 static inline u16 get_hsr_tag_LSDU_size(struct hsr_tag *ht) argument 78 return ntohs(ht->path_and_LSDU_size) & 0x0FFF; 81 static inline void set_hsr_tag_path(struct hsr_tag *ht, u16 path) argument 83 ht->path_and_LSDU_size = htons( 84 (ntohs(ht->path_and_LSDU_size) & 0x0FFF) | (path << 12)); 87 static inline void set_hsr_tag_LSDU_size(struct hsr_tag *ht, u16 LSDU_size) argument 89 ht->path_and_LSDU_size = htons( 90 (ntohs(ht [all...] |
/net/mac80211/ |
H A D | rc80211_minstrel_ht.h | 88 struct minstrel_ht_sta ht; member in union:minstrel_ht_sta_priv::__anon83
|
/net/sched/ |
H A D | cls_fw.c | 36 struct fw_filter __rcu *ht[HTSIZE]; member in struct:fw_head 70 for (f = rcu_dereference_bh(head->ht[fw_hash(id)]); f; 106 f = rtnl_dereference(head->ht[fw_hash(handle)]); 141 while ((f = rtnl_dereference(head->ht[h])) != NULL) { 142 RCU_INIT_POINTER(head->ht[h], 162 fp = &head->ht[fw_hash(f->id)]; 275 fp = &head->ht[fw_hash(fnew->id)]; 318 RCU_INIT_POINTER(f->next, head->ht[fw_hash(handle)]); 319 rcu_assign_pointer(head->ht[fw_hash(handle)], f); 343 for (f = rtnl_dereference(head->ht[ [all...] |
H A D | cls_route.c | 46 struct route4_filter __rcu *ht[16 + 16 + 1]; member in struct:route4_bucket 170 for (f = rcu_dereference_bh(b->ht[route4_hash_from(id)]); 176 for (f = rcu_dereference_bh(b->ht[route4_hash_iif(iif)]); 182 for (f = rcu_dereference_bh(b->ht[route4_hash_wild()]); 250 for (f = rtnl_dereference(b->ht[h2]); 293 while ((f = rtnl_dereference(b->ht[h2])) != NULL) { 297 RCU_INIT_POINTER(b->ht[h2], next); 326 fp = &b->ht[from_hash(h >> 16)]; 347 rt = rtnl_dereference(b->ht[i]); 431 for (fp = rtnl_dereference(b->ht[h [all...] |
H A D | cls_rsvp.h | 73 struct rsvp_session __rcu *ht[256]; member in struct:rsvp_head 84 struct rsvp_filter __rcu *ht[16 + 1]; member in struct:rsvp_session 175 for (s = rcu_dereference_bh(head->ht[h1]); s; 188 for (f = rcu_dereference_bh(s->ht[h2]); f; 213 for (f = rcu_dereference_bh(s->ht[16]); f; 234 for (s = rtnl_dereference(head->ht[h1]); s; 236 for (ins = &s->ht[h2], pins = rtnl_dereference(*ins); ; 263 for (s = rtnl_dereference(head->ht[h1]); s; 265 for (f = rtnl_dereference(s->ht[h2]); f; 311 while ((s = rtnl_dereference(data->ht[h [all...] |
H A D | cls_u32.c | 81 struct tc_u_knode __rcu *ht[1]; member in struct:tc_u_hnode 109 struct tc_u_hnode *ht = rcu_dereference_bh(tp->root); local 121 n = rcu_dereference_bh(ht->ht[sel]); 161 ht = rcu_dereference_bh(n->ht_down); 162 if (!ht) { 195 ht = rcu_dereference_bh(n->ht_down); 197 if (ht->divisor) { 204 sel = ht->divisor & u32_hash_fold(*data, &n->sel, 237 ht 252 struct tc_u_hnode *ht; local 264 u32_lookup_key(struct tc_u_hnode *ht, u32 handle) argument 285 struct tc_u_hnode *ht; local 409 struct tc_u_hnode *ht = rtnl_dereference(key->ht_up); local 428 u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument 443 u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument 478 struct tc_u_hnode *ht; local 502 struct tc_u_hnode *ht = (struct tc_u_hnode *)arg; local 525 gen_new_kid(struct tc_u_hnode *ht, u32 handle) argument 557 u32_set_parms(struct net *net, struct tcf_proto *tp, unsigned long base, struct tc_u_hnode *ht, struct tc_u_knode *n, struct nlattr **tb, struct nlattr *est, bool ovr) argument 620 struct tc_u_hnode *ht; local 696 struct tc_u_hnode *ht; local 865 struct tc_u_hnode *ht; local 919 struct tc_u_hnode *ht = (struct tc_u_hnode *)fh; local [all...] |
H A D | sch_sfq.c | 110 unsigned short hash; /* hash value (index in ht[]) */ 129 sfq_index *ht; /* Hash table ('divisor' slots) */ member in struct:sfq_sched_data 344 q->ht[slot->hash] = SFQ_EMPTY_SLOT; 388 x = q->ht[hash]; 394 q->ht[hash] = x; 527 q->ht[slot->hash] = SFQ_EMPTY_SLOT; 577 q->ht[slot->hash] = SFQ_EMPTY_SLOT; 583 sfq_index x = q->ht[hash]; 595 q->ht[hash] = x; 727 sfq_free(q->ht); [all...] |
/net/decnet/ |
H A D | dn_table.c | 143 struct dn_fib_node **ht, **old_ht; local 163 ht = kcalloc(new_divisor, sizeof(struct dn_fib_node*), GFP_KERNEL); 164 if (ht == NULL) 169 dz->dz_hash = ht;
|
/net/netfilter/ |
H A D | xt_hashlimit.c | 127 hash_dst(const struct xt_hashlimit_htable *ht, const struct dsthash_dst *dst) argument 131 ht->rnd); 133 * Instead of returning hash % ht->cfg.size (implying a divide) 134 * we return the high 32 bits of the (hash * ht->cfg.size) that will 138 return reciprocal_scale(hash, ht->cfg.size); 142 dsthash_find(const struct xt_hashlimit_htable *ht, argument 146 u_int32_t hash = hash_dst(ht, dst); 148 if (!hlist_empty(&ht->hash[hash])) { 149 hlist_for_each_entry_rcu(ent, &ht->hash[hash], node) 160 dsthash_alloc_init(struct xt_hashlimit_htable *ht, argument 210 dsthash_free(struct xt_hashlimit_htable *ht, struct dsthash_ent *ent) argument 285 select_all(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he) argument 291 select_gc(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he) argument 297 htable_selective_cleanup(struct xt_hashlimit_htable *ht, bool (*select)(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he)) argument 319 struct xt_hashlimit_htable *ht; local 793 const struct xt_hashlimit_htable *ht = s->private; local [all...] |