| /net/sunrpc/auth_gss/ |
| H A D | gss_krb5_wrap.c | 187 /* shift data to make room for header. */
384 * We can shift data by up to LOCAL_BUF_LEN bytes in a pass. If we need
385 * to do more than that, we shift repeatedly. Kevin Coffman reports
395 static void rotate_buf_a_little(struct xdr_buf *buf, unsigned int shift) argument
401 BUG_ON(shift > LOCAL_BUF_LEN);
403 read_bytes_from_xdr_buf(buf, 0, head, shift);
404 for (i = 0; i + shift < buf->len; i += LOCAL_BUF_LEN) {
405 this_len = min(LOCAL_BUF_LEN, buf->len - (i + shift));
406 read_bytes_from_xdr_buf(buf, i+shift, tmp, this_len);
409 write_bytes_to_xdr_buf(buf, buf->len - shift, hea
412 _rotate_left(struct xdr_buf *buf, unsigned int shift) argument
425 rotate_left(u32 base, struct xdr_buf *buf, unsigned int shift) argument
[all...] |
| /net/netlink/ |
| H A D | af_netlink.h | 59 unsigned int shift; member in struct:nl_portid_hash
|
| H A D | af_netlink.c | 897 unsigned int omask, mask, shift; local
904 shift = hash->shift;
907 if (++shift > hash->max_shift)
920 hash->shift = shift;
938 int avg = hash->entries >> hash->shift;
2923 hash->shift = 0;
|
| /net/netfilter/ |
| H A D | nf_conntrack_sip.c | 117 const char *limit, int *shift)
129 const char *limit, int *shift)
160 const char *limit, int *shift)
179 const char *limit, int *shift)
181 int len = string_len(ct, dptr, limit, shift);
189 return len + digits_len(ct, dptr, limit, shift);
235 const char *limit, int *shift)
248 dptr += digits_len(ct, dptr, limit, shift);
255 const char *limit, int *shift)
258 int s = *shift;
116 string_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
128 digits_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
159 callid_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
178 media_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
234 epaddr_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
254 skp_epaddr_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
294 int shift = 0; local
424 int shift = 0; local
492 int shift = 0; local
723 sdp_addr_len(const struct nf_conn *ct, const char *dptr, const char *limit, int *shift) argument
785 int shift = 0; local
[all...] |
| H A D | nf_conntrack_h323_asn1.c | 208 unsigned int v, l, shift, bytes; local
222 for (bytes = l >> 3, shift = 24, v = 0; bytes;
223 bytes--, shift -= 8)
224 v |= (unsigned int)(*bs->cur++) << shift;
227 v |= (unsigned int)(*bs->cur) << shift;
|
| /net/sched/ |
| H A D | cls_tcindex.c | 47 int shift; /* shift ANDed key to the right */ member in struct:tcindex_data
87 int key = (skb->tc_index & p->mask) >> p->shift;
188 return p->hash > (p->mask >> p->shift);
231 cp.shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);
252 if ((cp.mask >> cp.shift) < PERFECT_HASH_THRESHOLD)
253 cp.hash = (cp.mask >> cp.shift) + 1;
261 /* Note: this could be as restrictive as if (handle & ~(mask >> shift))
446 nla_put_u32(skb, TCA_TCINDEX_SHIFT, p->shift) ||
|
| H A D | sch_generic.c | 906 int shift; local
913 * Calibrate mult, shift so that token counting is accurate
921 * Higher shift gives better accuracy. Find the largest
922 * shift such that mult fits in 32 bits.
924 for (shift = 0; shift < 16; shift++) {
925 r->shift = shift;
926 factor = 8LLU * NSEC_PER_SEC * (1 << r->shift);
[all...] |
| H A D | em_meta.c | 50 * Additionally, type dependent modifiers such as shift operators
580 int shift = v->hdr.shift; local
582 if (shift && shift < dst->len)
583 dst->len -= shift;
631 if (v->hdr.shift)
632 dst->value >>= v->hdr.shift;
|
| H A D | act_pedit.c | 157 offset += (*d & tkey->offmask) >> tkey->shift;
|
| H A D | sch_qfq.c | 78 we can derive the shift corresponding to each group.
106 * is the shift for the corresponding (scaled) sigma_i.
175 unsigned int slot_shift; /* Slot shift. */
739 static inline u64 qfq_round_down(u64 ts, unsigned int shift) argument
741 return ts & ~((1ULL << shift) - 1);
|
| /net/ipv4/ |
| H A D | tcp_timer.c | 58 int shift = 0; local
63 shift++;
67 shift++;
69 if (tcp_check_oom(sk, shift)) {
|
| H A D | tcp_cubic.c | 162 u32 x, b, shift; local
189 shift = (a >> (b * 3));
191 x = ((u32)(((u32)v[shift] + 10) << b)) >> 6;
|
| H A D | tcp.c | 1994 * State processing on a close. This implements the state shift for
2051 bool tcp_check_oom(struct sock *sk, int shift) argument
2055 too_many_orphans = tcp_too_many_orphans(sk, shift);
|
| /net/ieee802154/ |
| H A D | 6lowpan.c | 172 lowpan_compress_addr_64(u8 **hc06_ptr, u8 shift, const struct in6_addr *ipaddr, argument
191 return rol8(val, shift);
|
| /net/core/ |
| H A D | neighbour.c | 317 static struct neigh_hash_table *neigh_hash_alloc(unsigned int shift) argument
319 size_t size = (1 << shift) * sizeof(struct neighbour *);
338 ret->hash_shift = shift;
|