/net/sched/ |
H A D | cls_u32.c | 72 struct tc_u_knode *ht[1]; member in struct:tc_u_hnode 103 struct tc_u_hnode *ht = (struct tc_u_hnode *)tp->root; local 115 n = ht->ht[sel]; 187 ht = n->ht_down; 189 if (ht->divisor) { 196 sel = ht->divisor & u32_hash_fold(*data, &n->sel, 229 ht = n->ht_up; 244 struct tc_u_hnode *ht; local 246 for (ht 254 u32_lookup_key(struct tc_u_hnode *ht, u32 handle) argument 273 struct tc_u_hnode *ht; local 358 struct tc_u_hnode *ht = key->ht_up; local 376 u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument 390 u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument 422 struct tc_u_hnode *ht; local 447 struct tc_u_hnode *ht = (struct tc_u_hnode *)arg; local 468 gen_new_kid(struct tc_u_hnode *ht, u32 handle) argument 491 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) argument 553 struct tc_u_hnode *ht; local 685 struct tc_u_hnode *ht; local 734 struct tc_u_hnode *ht = (struct tc_u_hnode *)fh; local [all...] |
H A D | cls_rsvp.h | 73 struct rsvp_session *ht[256]; member in struct:rsvp_head 83 struct rsvp_filter *ht[16 + 1]; member in struct:rsvp_session 136 struct rsvp_session **sht = ((struct rsvp_head *)tp->root)->ht; 189 for (f = s->ht[h2]; f; f = f->next) { 213 for (f = s->ht[16]; f; f = f->next) { 226 struct rsvp_session **sht = ((struct rsvp_head *)tp->root)->ht; 236 for (f = s->ht[h2]; f; f = f->next) { 277 sht = data->ht; 288 while ((f = s->ht[h2]) != NULL) { 289 s->ht[h [all...] |
H A D | cls_route.c | 46 struct route4_filter *ht[16 + 16 + 1]; member in struct:route4_bucket 164 for (f = b->ht[route4_hash_from(id)]; f; f = f->next) 168 for (f = b->ht[route4_hash_iif(iif)]; f; f = f->next) 172 for (f = b->ht[route4_hash_wild()]; f; f = f->next) 239 for (f = b->ht[h2]; f; f = f->next) 279 while ((f = b->ht[h2]) != NULL) { 280 b->ht[h2] = f->next; 304 for (fp = &b->ht[from_hash(h >> 16)]; *fp; fp = &(*fp)->next) { 316 if (b->ht[i]) 400 for (fp = b->ht[h [all...] |
H A D | cls_fw.c | 35 struct fw_filter *ht[HTSIZE]; member in struct:fw_head 90 for (f = head->ht[fw_hash(id)]; f; f = f->next) { 125 for (f = head->ht[fw_hash(handle)]; f; f = f->next) { 158 while ((f = head->ht[h]) != NULL) { 159 head->ht[h] = f->next; 175 for (fp = &head->ht[fw_hash(f->id)]; *fp; fp = &(*fp)->next) { 289 f->next = head->ht[fw_hash(handle)]; 291 head->ht[fw_hash(handle)] = f; 316 for (f = head->ht[h]; f; f = f->next) {
|
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 345 q->ht[slot->hash] = SFQ_EMPTY_SLOT; 389 x = q->ht[hash]; 395 q->ht[hash] = x; 528 q->ht[slot->hash] = SFQ_EMPTY_SLOT; 578 q->ht[slot->hash] = SFQ_EMPTY_SLOT; 584 sfq_index x = q->ht[hash]; 595 q->ht[hash] = x; 732 sfq_free(q->ht); [all...] |
/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 ((u64)hash * ht->cfg.size) >> 32; 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 = (struct xt_hashlimit_htable *)htlong; local 789 const struct xt_hashlimit_htable *ht = s->private; local [all...] |
/net/mac80211/ |
H A D | rc80211_minstrel_ht.h | 117 struct minstrel_ht_sta ht; member in union:minstrel_ht_sta_priv::__anon79
|
H A D | Makefile | 10 ht.o agg-tx.o agg-rx.o \
|
H A D | rc80211_minstrel_ht_debugfs.c | 84 struct minstrel_ht_sta *mi = &msp->ht;
|
H A D | rc80211_minstrel_ht.c | 466 struct minstrel_ht_sta *mi = &msp->ht; 764 struct minstrel_ht_sta *mi = &msp->ht; 843 struct minstrel_ht_sta *mi = &msp->ht;
|
/net/ipv4/ |
H A D | raw.c | 91 head = &h->ht[inet_sk(sk)->inet_num & (RAW_HTABLE_SIZE - 1)]; 166 head = &raw_v4_hashinfo.ht[hash]; 199 raw_sk = sk_head(&raw_v4_hashinfo.ht[hash]); 280 raw_sk = sk_head(&raw_v4_hashinfo.ht[hash]); 916 sk_for_each(sk, &state->h->ht[state->bucket]) 936 sk = sk_head(&state->h->ht[state->bucket]);
|
/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/ipv6/ |
H A D | raw.c | 169 sk = sk_head(&raw_v6_hashinfo.ht[hash]); 230 raw_sk = sk_head(&raw_v6_hashinfo.ht[nexthdr & (RAW_HTABLE_SIZE - 1)]); 359 sk = sk_head(&raw_v6_hashinfo.ht[hash]);
|