Searched refs:dbits (Results 1 - 4 of 4) sorted by relevance
/linux-master/net/xfrm/ |
H A D | xfrm_hash.h | 46 __u8 dbits, 49 return jhash_2words(ntohl(daddr->a4) & __bits2mask32(dbits), 77 __u8 dbits, 80 return __xfrm6_pref_hash(daddr, dbits) ^ 148 u8 dbits, u8 sbits) 156 if (sel->prefixlen_d < dbits || 160 h = __xfrm4_dpref_spref_hash(daddr, saddr, dbits, sbits); 164 if (sel->prefixlen_d < dbits || 168 h = __xfrm6_dpref_spref_hash(daddr, saddr, dbits, sbits); 179 u8 dbits, u 44 __xfrm4_dpref_spref_hash(const xfrm_address_t *daddr, const xfrm_address_t *saddr, __u8 dbits, __u8 sbits) argument 75 __xfrm6_dpref_spref_hash(const xfrm_address_t *daddr, const xfrm_address_t *saddr, __u8 dbits, __u8 sbits) argument 146 __sel_hash(const struct xfrm_selector *sel, unsigned short family, unsigned int hmask, u8 dbits, u8 sbits) argument 175 __addr_hash(const xfrm_address_t *daddr, const xfrm_address_t *saddr, unsigned short family, unsigned int hmask, u8 dbits, u8 sbits) argument [all...] |
H A D | xfrm_policy.c | 481 u8 *dbits, u8 *sbits) 485 *dbits = net->xfrm.policy_bydst[dir].dbits4; 490 *dbits = net->xfrm.policy_bydst[dir].dbits6; 495 *dbits = 0; 506 u8 dbits; local 509 __get_hash_thresh(net, family, dir, &dbits, &sbits); 510 hash = __sel_hash(sel, family, hmask, dbits, sbits); 526 u8 dbits; local 529 __get_hash_thresh(net, family, dir, &dbits, &sbits); 530 hash = __addr_hash(daddr, saddr, family, hmask, dbits, sbit 479 __get_hash_thresh(struct net *net, unsigned short family, int dir, u8 *dbits, u8 *sbits) argument 545 u8 dbits; local 1273 u8 dbits, sbits; local [all...] |
/linux-master/lib/ |
H A D | inflate.c | 58 lbits and dbits tuning parameters. 289 This results of this trade are in the variables lbits and dbits 291 length codes can decode in one step, and dbits is the same thing for 304 about one bit more than those, so lbits is 8+1 and dbits is 5+1. 311 STATIC const int dbits = 6; /* bits in base distance lookup table */ variable 989 bd = dbits;
|
H A D | test_bpf.c | 822 int dbits, int sbits, int block1, int block2, 834 count = (dbits - 1) * (sbits - 1) * block1 * block1 * ARRAY_SIZE(sgn); 835 count += (max(dbits, sbits) - 1) * block2 * block2 * ARRAY_SIZE(sgn); 850 for (di = 0; di < dbits - 1; di++) /* Dst magnitudes */ 870 for (bt = 0; bt < max(dbits, sbits) - 1; bt++) /* Magnitude */ 877 dst = value(bt % dbits, db, sgn[k][0]); 821 __bpf_fill_pattern(struct bpf_test *self, void *arg, int dbits, int sbits, int block1, int block2, int (*emit)(struct bpf_test*, void*, struct bpf_insn*, s64, s64)) argument
|
Completed in 132 milliseconds