aboutsummaryrefslogtreecommitdiffstats
path: root/include/linux
diff options
context:
space:
mode:
Diffstat (limited to 'include/linux')
-rw-r--r--include/linux/average.h61
-rw-r--r--include/linux/mlx4/driver.h2
-rw-r--r--include/linux/netdevice.h29
3 files changed, 51 insertions, 41 deletions
diff --git a/include/linux/average.h b/include/linux/average.h
index d04aa58280de..7ddaf340d2ac 100644
--- a/include/linux/average.h
+++ b/include/linux/average.h
@@ -1,45 +1,66 @@
1#ifndef _LINUX_AVERAGE_H 1#ifndef _LINUX_AVERAGE_H
2#define _LINUX_AVERAGE_H 2#define _LINUX_AVERAGE_H
3 3
4/* Exponentially weighted moving average (EWMA) */ 4/*
5 * Exponentially weighted moving average (EWMA)
6 *
7 * This implements a fixed-precision EWMA algorithm, with both the
8 * precision and fall-off coefficient determined at compile-time
9 * and built into the generated helper funtions.
10 *
11 * The first argument to the macro is the name that will be used
12 * for the struct and helper functions.
13 *
14 * The second argument, the precision, expresses how many bits are
15 * used for the fractional part of the fixed-precision values.
16 *
17 * The third argument, the weight reciprocal, determines how the
18 * new values will be weighed vs. the old state, new values will
19 * get weight 1/weight_rcp and old values 1-1/weight_rcp. Note
20 * that this parameter must be a power of two for efficiency.
21 */
5 22
6#define DECLARE_EWMA(name, _factor, _weight) \ 23#define DECLARE_EWMA(name, _precision, _weight_rcp) \
7 struct ewma_##name { \ 24 struct ewma_##name { \
8 unsigned long internal; \ 25 unsigned long internal; \
9 }; \ 26 }; \
10 static inline void ewma_##name##_init(struct ewma_##name *e) \ 27 static inline void ewma_##name##_init(struct ewma_##name *e) \
11 { \ 28 { \
12 BUILD_BUG_ON(!__builtin_constant_p(_factor)); \ 29 BUILD_BUG_ON(!__builtin_constant_p(_precision)); \
13 BUILD_BUG_ON(!__builtin_constant_p(_weight)); \ 30 BUILD_BUG_ON(!__builtin_constant_p(_weight_rcp)); \
14 BUILD_BUG_ON_NOT_POWER_OF_2(_factor); \ 31 /* \
15 BUILD_BUG_ON_NOT_POWER_OF_2(_weight); \ 32 * Even if you want to feed it just 0/1 you should have \
33 * some bits for the non-fractional part... \
34 */ \
35 BUILD_BUG_ON((_precision) > 30); \
36 BUILD_BUG_ON_NOT_POWER_OF_2(_weight_rcp); \
16 e->internal = 0; \ 37 e->internal = 0; \
17 } \ 38 } \
18 static inline unsigned long \ 39 static inline unsigned long \
19 ewma_##name##_read(struct ewma_##name *e) \ 40 ewma_##name##_read(struct ewma_##name *e) \
20 { \ 41 { \
21 BUILD_BUG_ON(!__builtin_constant_p(_factor)); \ 42 BUILD_BUG_ON(!__builtin_constant_p(_precision)); \
22 BUILD_BUG_ON(!__builtin_constant_p(_weight)); \ 43 BUILD_BUG_ON(!__builtin_constant_p(_weight_rcp)); \
23 BUILD_BUG_ON_NOT_POWER_OF_2(_factor); \ 44 BUILD_BUG_ON((_precision) > 30); \
24 BUILD_BUG_ON_NOT_POWER_OF_2(_weight); \ 45 BUILD_BUG_ON_NOT_POWER_OF_2(_weight_rcp); \
25 return e->internal >> ilog2(_factor); \ 46 return e->internal >> (_precision); \
26 } \ 47 } \
27 static inline void ewma_##name##_add(struct ewma_##name *e, \ 48 static inline void ewma_##name##_add(struct ewma_##name *e, \
28 unsigned long val) \ 49 unsigned long val) \
29 { \ 50 { \
30 unsigned long internal = ACCESS_ONCE(e->internal); \ 51 unsigned long internal = ACCESS_ONCE(e->internal); \
31 unsigned long weight = ilog2(_weight); \ 52 unsigned long weight_rcp = ilog2(_weight_rcp); \
32 unsigned long factor = ilog2(_factor); \ 53 unsigned long precision = _precision; \
33 \ 54 \
34 BUILD_BUG_ON(!__builtin_constant_p(_factor)); \ 55 BUILD_BUG_ON(!__builtin_constant_p(_precision)); \
35 BUILD_BUG_ON(!__builtin_constant_p(_weight)); \ 56 BUILD_BUG_ON(!__builtin_constant_p(_weight_rcp)); \
36 BUILD_BUG_ON_NOT_POWER_OF_2(_factor); \ 57 BUILD_BUG_ON((_precision) > 30); \
37 BUILD_BUG_ON_NOT_POWER_OF_2(_weight); \ 58 BUILD_BUG_ON_NOT_POWER_OF_2(_weight_rcp); \
38 \ 59 \
39 ACCESS_ONCE(e->internal) = internal ? \ 60 ACCESS_ONCE(e->internal) = internal ? \
40 (((internal << weight) - internal) + \ 61 (((internal << weight_rcp) - internal) + \
41 (val << factor)) >> weight : \ 62 (val << precision)) >> weight_rcp : \
42 (val << factor); \ 63 (val << precision); \
43 } 64 }
44 65
45#endif /* _LINUX_AVERAGE_H */ 66#endif /* _LINUX_AVERAGE_H */
diff --git a/include/linux/mlx4/driver.h b/include/linux/mlx4/driver.h
index e965e5090d96..a858bcb6220b 100644
--- a/include/linux/mlx4/driver.h
+++ b/include/linux/mlx4/driver.h
@@ -109,7 +109,7 @@ static inline void mlx4_u64_to_mac(u8 *addr, u64 mac)
109 int i; 109 int i;
110 110
111 for (i = ETH_ALEN; i > 0; i--) { 111 for (i = ETH_ALEN; i > 0; i--) {
112 addr[i - 1] = mac && 0xFF; 112 addr[i - 1] = mac & 0xFF;
113 mac >>= 8; 113 mac >>= 8;
114 } 114 }
115} 115}
diff --git a/include/linux/netdevice.h b/include/linux/netdevice.h
index f40f0ab3847a..97456b2539e4 100644
--- a/include/linux/netdevice.h
+++ b/include/linux/netdevice.h
@@ -330,6 +330,7 @@ struct napi_struct {
330 330
331enum { 331enum {
332 NAPI_STATE_SCHED, /* Poll is scheduled */ 332 NAPI_STATE_SCHED, /* Poll is scheduled */
333 NAPI_STATE_MISSED, /* reschedule a napi */
333 NAPI_STATE_DISABLE, /* Disable pending */ 334 NAPI_STATE_DISABLE, /* Disable pending */
334 NAPI_STATE_NPSVC, /* Netpoll - don't dequeue from poll_list */ 335 NAPI_STATE_NPSVC, /* Netpoll - don't dequeue from poll_list */
335 NAPI_STATE_HASHED, /* In NAPI hash (busy polling possible) */ 336 NAPI_STATE_HASHED, /* In NAPI hash (busy polling possible) */
@@ -338,12 +339,13 @@ enum {
338}; 339};
339 340
340enum { 341enum {
341 NAPIF_STATE_SCHED = (1UL << NAPI_STATE_SCHED), 342 NAPIF_STATE_SCHED = BIT(NAPI_STATE_SCHED),
342 NAPIF_STATE_DISABLE = (1UL << NAPI_STATE_DISABLE), 343 NAPIF_STATE_MISSED = BIT(NAPI_STATE_MISSED),
343 NAPIF_STATE_NPSVC = (1UL << NAPI_STATE_NPSVC), 344 NAPIF_STATE_DISABLE = BIT(NAPI_STATE_DISABLE),
344 NAPIF_STATE_HASHED = (1UL << NAPI_STATE_HASHED), 345 NAPIF_STATE_NPSVC = BIT(NAPI_STATE_NPSVC),
345 NAPIF_STATE_NO_BUSY_POLL = (1UL << NAPI_STATE_NO_BUSY_POLL), 346 NAPIF_STATE_HASHED = BIT(NAPI_STATE_HASHED),
346 NAPIF_STATE_IN_BUSY_POLL = (1UL << NAPI_STATE_IN_BUSY_POLL), 347 NAPIF_STATE_NO_BUSY_POLL = BIT(NAPI_STATE_NO_BUSY_POLL),
348 NAPIF_STATE_IN_BUSY_POLL = BIT(NAPI_STATE_IN_BUSY_POLL),
347}; 349};
348 350
349enum gro_result { 351enum gro_result {
@@ -414,20 +416,7 @@ static inline bool napi_disable_pending(struct napi_struct *n)
414 return test_bit(NAPI_STATE_DISABLE, &n->state); 416 return test_bit(NAPI_STATE_DISABLE, &n->state);
415} 417}
416 418
417/** 419bool napi_schedule_prep(struct napi_struct *n);
418 * napi_schedule_prep - check if NAPI can be scheduled
419 * @n: NAPI context
420 *
421 * Test if NAPI routine is already running, and if not mark
422 * it as running. This is used as a condition variable to
423 * insure only one NAPI poll instance runs. We also make
424 * sure there is no pending NAPI disable.
425 */
426static inline bool napi_schedule_prep(struct napi_struct *n)
427{
428 return !napi_disable_pending(n) &&
429 !test_and_set_bit(NAPI_STATE_SCHED, &n->state);
430}
431 420
432/** 421/**
433 * napi_schedule - schedule NAPI poll 422 * napi_schedule - schedule NAPI poll