ratelimit.c 1.5 KB
Newer Older
1 2 3 4 5
/*
 * ratelimit.c - Do something with rate limit.
 *
 * Isolated from kernel/printk.c by Dave Young <hidave.darkstar@gmail.com>
 *
D
Dave Young 已提交
6 7 8
 * 2008-05-01 rewrite the function and use a ratelimit_state data struct as
 * parameter. Now every user can use their own standalone ratelimit_state.
 *
9 10 11
 * This file is released under the GPLv2.
 */

12
#include <linux/ratelimit.h>
13 14 15 16 17
#include <linux/jiffies.h>
#include <linux/module.h>

/*
 * __ratelimit - rate limiting
D
Dave Young 已提交
18
 * @rs: ratelimit_state data
Y
Yong Zhang 已提交
19
 * @func: name of calling function
20
 *
Y
Yong Zhang 已提交
21 22 23 24 25 26
 * This enforces a rate limit: not more than @rs->burst callbacks
 * in every @rs->interval
 *
 * RETURNS:
 * 0 means callbacks will be suppressed.
 * 1 means go ahead and do it.
27
 */
28
int ___ratelimit(struct ratelimit_state *rs, const char *func)
29
{
30
	unsigned long flags;
31
	int ret;
32

D
Dave Young 已提交
33 34
	if (!rs->interval)
		return 1;
35

36 37 38 39 40 41 42 43 44
	/*
	 * If we contend on this state's lock then almost
	 * by definition we are too busy to print a message,
	 * in addition to the one that will be printed by
	 * the entity that is holding the lock already:
	 */
	if (!spin_trylock_irqsave(&rs->lock, flags))
		return 1;

D
Dave Young 已提交
45 46
	if (!rs->begin)
		rs->begin = jiffies;
47

D
Dave Young 已提交
48 49 50
	if (time_is_before_jiffies(rs->begin + rs->interval)) {
		if (rs->missed)
			printk(KERN_WARNING "%s: %d callbacks suppressed\n",
51
				func, rs->missed);
52
		rs->begin   = 0;
D
Dave Young 已提交
53
		rs->printed = 0;
54
		rs->missed  = 0;
55
	}
56 57 58 59 60 61 62 63
	if (rs->burst && rs->burst > rs->printed) {
		rs->printed++;
		ret = 1;
	} else {
		rs->missed++;
		ret = 0;
	}
	spin_unlock_irqrestore(&rs->lock, flags);
D
Dave Young 已提交
64

65
	return ret;
66
}
67
EXPORT_SYMBOL(___ratelimit);