Searched defs:lh (Results 1 - 10 of 10) sorted by relevance

/net/dccp/ccids/lib/
H A Dloss_interval.h51 static inline void tfrc_lh_init(struct tfrc_loss_hist *lh) argument
53 memset(lh, 0, sizeof(struct tfrc_loss_hist));
56 static inline u8 tfrc_lh_is_initialised(struct tfrc_loss_hist *lh) argument
58 return lh->counter > 0;
61 static inline u8 tfrc_lh_length(struct tfrc_loss_hist *lh) argument
63 return min(lh->counter, (u8)LIH_SIZE);
70 extern u8 tfrc_lh_update_i_mean(struct tfrc_loss_hist *lh, struct sk_buff *);
71 extern void tfrc_lh_cleanup(struct tfrc_loss_hist *lh);
H A Dloss_interval.c26 static inline struct tfrc_loss_interval *tfrc_lh_peek(struct tfrc_loss_hist *lh) argument
28 return lh->counter ? lh->ring[LIH_INDEX(lh->counter - 1)] : NULL;
32 static inline u32 tfrc_lh_get_interval(struct tfrc_loss_hist *lh, const u8 i) argument
34 BUG_ON(i >= lh->counter);
35 return lh->ring[LIH_INDEX(lh->counter - i - 1)]->li_length;
41 static struct tfrc_loss_interval *tfrc_lh_demand_next(struct tfrc_loss_hist *lh) argument
43 if (lh
49 tfrc_lh_cleanup(struct tfrc_loss_hist *lh) argument
62 tfrc_lh_calc_i_mean(struct tfrc_loss_hist *lh) argument
88 tfrc_lh_update_i_mean(struct tfrc_loss_hist *lh, struct sk_buff *skb) argument
139 tfrc_lh_interval_add(struct tfrc_loss_hist *lh, struct tfrc_rx_hist *rh, u32 (*calc_first_li)(struct sock *), struct sock *sk) argument
[all...]
H A Dpacket_history.c313 * @lh: Loss Intervals database to update
316 * @calc_first_li: Caller-dependent computation of first loss interval in @lh
327 struct tfrc_loss_hist *lh,
343 is_new_loss = tfrc_lh_interval_add(lh, h, calc_first_li, sk);
326 tfrc_rx_handle_loss(struct tfrc_rx_hist *h, struct tfrc_loss_hist *lh, struct sk_buff *skb, const u64 ndp, u32 (*calc_first_li)(struct sock *), struct sock *sk) argument
/net/netfilter/
H A Dxt_connlimit.c83 union nf_inet_addr lh, rh; local
87 lh.ip6[i] = addr->ip6[i] & mask->ip6[i];
91 return memcmp(&lh.ip6, &rh.ip6, sizeof(lh.ip6)) == 0;
/net/ipv6/
H A Daf_inet6.c606 struct list_head *lh; local
622 list_for_each(lh, &inetsw6[p->type]) {
623 answer = list_entry(lh, struct inet_protosw, list);
629 last_perm = lh;
/net/atm/
H A Dbr2684.c125 struct list_head *lh; local
129 list_for_each(lh, &br2684_devs) {
130 net_dev = list_entry_brdev(lh);
136 list_for_each(lh, &br2684_devs) {
137 net_dev = list_entry_brdev(lh);
150 struct list_head *lh; local
159 list_for_each(lh, &br2684_devs) {
160 net_dev = list_entry_brdev(lh);
/net/bluetooth/
H A Dsmp.c156 struct l2cap_hdr *lh; local
168 lh = (struct l2cap_hdr *) skb_put(skb, L2CAP_HDR_SIZE);
169 lh->len = cpu_to_le16(sizeof(code) + dlen);
170 lh->cid = __constant_cpu_to_le16(L2CAP_CID_SMP);
H A Dl2cap_core.c917 struct l2cap_hdr *lh; local
928 lh = (struct l2cap_hdr *) skb_put(skb, L2CAP_HDR_SIZE);
929 lh->len = cpu_to_le16(hlen - L2CAP_HDR_SIZE);
930 lh->cid = cpu_to_le16(chan->dcid);
2260 struct l2cap_hdr *lh; local
2274 lh = (struct l2cap_hdr *) skb_put(skb, L2CAP_HDR_SIZE);
2275 lh->cid = cpu_to_le16(chan->dcid);
2276 lh->len = cpu_to_le16(len + L2CAP_PSMLEN_SIZE);
2294 struct l2cap_hdr *lh; local
2308 lh
2327 struct l2cap_hdr *lh; local
2849 struct l2cap_hdr *lh; local
6381 struct l2cap_hdr *lh = (void *) skb->data; local
[all...]
/net/ipv4/
H A Dinetpeer.c303 int lh, rh; local
310 lh = node_height(l);
312 if (lh > rh + 1) { /* l: RH+2 */
340 } else if (rh > lh + 1) { /* r: LH+2 */
359 node->avl_height = lh + 1; /* node: LH+1 */
362 r->avl_height = lh + 1; /* r: LH+1 */
365 rl->avl_height = lh + 2;
369 node->avl_height = (lh > rh ? lh : rh) + 1;
H A Daf_inet.c1090 struct list_head *lh; local
1103 list_for_each(lh, &inetsw[p->type]) {
1104 answer = list_entry(lh, struct inet_protosw, list);
1110 last_perm = lh;

Completed in 243 milliseconds