Blame view
net/netfilter/xt_time.c
7.49 KB
ee4411a1b [NETFILTER]: x_ta... |
1 2 |
/* * xt_time |
ba5dc2756 [NETFILTER]: Copy... |
3 |
* Copyright © CC Computer Consultants GmbH, 2007 |
ee4411a1b [NETFILTER]: x_ta... |
4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 |
* * based on ipt_time by Fabrice MARIE <fabrice@netfilter.org> * This is a module which is used for time matching * It is using some modified code from dietlibc (localtime() function) * that you can find at http://www.fefe.de/dietlibc/ * This file is distributed under the terms of the GNU General Public * License (GPL). Copies of the GPL can be obtained from gnu.org/gpl. */ #include <linux/ktime.h> #include <linux/module.h> #include <linux/skbuff.h> #include <linux/types.h> #include <linux/netfilter/x_tables.h> #include <linux/netfilter/xt_time.h> struct xtm { u_int8_t month; /* (1-12) */ u_int8_t monthday; /* (1-31) */ u_int8_t weekday; /* (1-7) */ u_int8_t hour; /* (0-23) */ u_int8_t minute; /* (0-59) */ u_int8_t second; /* (0-59) */ unsigned int dse; }; extern struct timezone sys_tz; /* ouch */ static const u_int16_t days_since_year[] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334, }; static const u_int16_t days_since_leapyear[] = { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335, }; /* * Since time progresses forward, it is best to organize this array in reverse, * to minimize lookup time. */ enum { DSE_FIRST = 2039, }; static const u_int16_t days_since_epoch[] = { /* 2039 - 2030 */ 25202, 24837, 24472, 24106, 23741, 23376, 23011, 22645, 22280, 21915, /* 2029 - 2020 */ 21550, 21184, 20819, 20454, 20089, 19723, 19358, 18993, 18628, 18262, /* 2019 - 2010 */ 17897, 17532, 17167, 16801, 16436, 16071, 15706, 15340, 14975, 14610, /* 2009 - 2000 */ 14245, 13879, 13514, 13149, 12784, 12418, 12053, 11688, 11323, 10957, /* 1999 - 1990 */ 10592, 10227, 9862, 9496, 9131, 8766, 8401, 8035, 7670, 7305, /* 1989 - 1980 */ 6940, 6574, 6209, 5844, 5479, 5113, 4748, 4383, 4018, 3652, /* 1979 - 1970 */ 3287, 2922, 2557, 2191, 1826, 1461, 1096, 730, 365, 0, }; static inline bool is_leap(unsigned int y) { return y % 4 == 0 && (y % 100 != 0 || y % 400 == 0); } /* * Each network packet has a (nano)seconds-since-the-epoch (SSTE) timestamp. * Since we match against days and daytime, the SSTE value needs to be * computed back into human-readable dates. * * This is done in three separate functions so that the most expensive * calculations are done last, in case a "simple match" can be found earlier. */ static inline unsigned int localtime_1(struct xtm *r, time_t time) { unsigned int v, w; /* Each day has 86400s, so finding the hour/minute is actually easy. */ v = time % 86400; r->second = v % 60; w = v / 60; r->minute = w % 60; r->hour = w / 60; return v; } static inline void localtime_2(struct xtm *r, time_t time) { /* * Here comes the rest (weekday, monthday). First, divide the SSTE * by seconds-per-day to get the number of _days_ since the epoch. */ r->dse = time / 86400; |
4f4c9430c [NETFILTER]: xt_t... |
96 97 98 99 100 |
/* * 1970-01-01 (w=0) was a Thursday (4). * -1 and +1 map Sunday properly onto 7. */ r->weekday = (4 + r->dse - 1) % 7 + 1; |
ee4411a1b [NETFILTER]: x_ta... |
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 |
} static void localtime_3(struct xtm *r, time_t time) { unsigned int year, i, w = r->dse; /* * In each year, a certain number of days-since-the-epoch have passed. * Find the year that is closest to said days. * * Consider, for example, w=21612 (2029-03-04). Loop will abort on * dse[i] <= w, which happens when dse[i] == 21550. This implies * year == 2009. w will then be 62. */ for (i = 0, year = DSE_FIRST; days_since_epoch[i] > w; ++i, --year) /* just loop */; w -= days_since_epoch[i]; /* * By now we have the current year, and the day of the year. * r->yearday = w; * * On to finding the month (like above). In each month, a certain * number of days-since-New Year have passed, and find the closest * one. * * Consider w=62 (in a non-leap year). Loop will abort on * dsy[i] < w, which happens when dsy[i] == 31+28 (i == 2). * Concludes i == 2, i.e. 3rd month => March. * * (A different approach to use would be to subtract a monthlength * from w repeatedly while counting.) */ if (is_leap(year)) { |
2cdc55751 netfilter: xt_tim... |
137 |
/* use days_since_leapyear[] in a leap year */ |
ee4411a1b [NETFILTER]: x_ta... |
138 |
for (i = ARRAY_SIZE(days_since_leapyear) - 1; |
2cdc55751 netfilter: xt_tim... |
139 |
i > 0 && days_since_leapyear[i] > w; --i) |
ee4411a1b [NETFILTER]: x_ta... |
140 |
/* just loop */; |
2cdc55751 netfilter: xt_tim... |
141 |
r->monthday = w - days_since_leapyear[i] + 1; |
ee4411a1b [NETFILTER]: x_ta... |
142 143 144 145 |
} else { for (i = ARRAY_SIZE(days_since_year) - 1; i > 0 && days_since_year[i] > w; --i) /* just loop */; |
2cdc55751 netfilter: xt_tim... |
146 |
r->monthday = w - days_since_year[i] + 1; |
ee4411a1b [NETFILTER]: x_ta... |
147 148 149 |
} r->month = i + 1; |
ee4411a1b [NETFILTER]: x_ta... |
150 |
} |
d3c5ee6d5 [NETFILTER]: x_ta... |
151 |
static bool |
62fc80510 netfilter: xtable... |
152 |
time_mt(const struct sk_buff *skb, struct xt_action_param *par) |
ee4411a1b [NETFILTER]: x_ta... |
153 |
{ |
f7108a20d netfilter: xtable... |
154 |
const struct xt_time_info *info = par->matchinfo; |
ee4411a1b [NETFILTER]: x_ta... |
155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 |
unsigned int packet_time; struct xtm current_time; s64 stamp; /* * We cannot use get_seconds() instead of __net_timestamp() here. * Suppose you have two rules: * 1. match before 13:00 * 2. match after 13:00 * If you match against processing time (get_seconds) it * may happen that the same packet matches both rules if * it arrived at the right moment before 13:00. */ if (skb->tstamp.tv64 == 0) __net_timestamp((struct sk_buff *)skb); |
53756524e [NETFILTER]: xt_t... |
170 |
stamp = ktime_to_ns(skb->tstamp); |
280763c05 netfilter: xt_tim... |
171 |
stamp = div_s64(stamp, NSEC_PER_SEC); |
ee4411a1b [NETFILTER]: x_ta... |
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 |
if (info->flags & XT_TIME_LOCAL_TZ) /* Adjust for local timezone */ stamp -= 60 * sys_tz.tz_minuteswest; /* * xt_time will match when _all_ of the following hold: * - 'now' is in the global time range date_start..date_end * - 'now' is in the monthday mask * - 'now' is in the weekday mask * - 'now' is in the daytime range time_start..time_end * (and by default, libxt_time will set these so as to match) */ if (stamp < info->date_start || stamp > info->date_stop) return false; packet_time = localtime_1(¤t_time, stamp); if (info->daytime_start < info->daytime_stop) { if (packet_time < info->daytime_start || packet_time > info->daytime_stop) return false; } else { if (packet_time < info->daytime_start && packet_time > info->daytime_stop) return false; } localtime_2(¤t_time, stamp); if (!(info->weekdays_match & (1 << current_time.weekday))) return false; /* Do not spend time computing monthday if all days match anyway */ if (info->monthdays_match != XT_TIME_ALL_MONTHDAYS) { localtime_3(¤t_time, stamp); if (!(info->monthdays_match & (1 << current_time.monthday))) return false; } return true; } |
b0f38452f netfilter: xtable... |
215 |
static int time_mt_check(const struct xt_mtchk_param *par) |
ee4411a1b [NETFILTER]: x_ta... |
216 |
{ |
9b4fce7a3 netfilter: xtable... |
217 |
const struct xt_time_info *info = par->matchinfo; |
ee4411a1b [NETFILTER]: x_ta... |
218 219 220 |
if (info->daytime_start > XT_TIME_MAX_DAYTIME || info->daytime_stop > XT_TIME_MAX_DAYTIME) { |
ff67e4e42 netfilter: xt ext... |
221 222 223 |
pr_info("invalid argument - start or " "stop time greater than 23:59:59 "); |
4a5a5c73b netfilter: xtable... |
224 |
return -EDOM; |
ee4411a1b [NETFILTER]: x_ta... |
225 |
} |
bd414ee60 netfilter: xtable... |
226 |
return 0; |
ee4411a1b [NETFILTER]: x_ta... |
227 |
} |
55b69e910 netfilter: implem... |
228 229 230 231 232 233 234 |
static struct xt_match xt_time_mt_reg __read_mostly = { .name = "time", .family = NFPROTO_UNSPEC, .match = time_mt, .checkentry = time_mt_check, .matchsize = sizeof(struct xt_time_info), .me = THIS_MODULE, |
ee4411a1b [NETFILTER]: x_ta... |
235 |
}; |
d3c5ee6d5 [NETFILTER]: x_ta... |
236 |
static int __init time_mt_init(void) |
ee4411a1b [NETFILTER]: x_ta... |
237 |
{ |
e6210f3be netfilter 08/09: ... |
238 239 240 241 242 243 244 245 246 247 248 249 |
int minutes = sys_tz.tz_minuteswest; if (minutes < 0) /* east of Greenwich */ printk(KERN_INFO KBUILD_MODNAME ": kernel timezone is +%02d%02d ", -minutes / 60, -minutes % 60); else /* west of Greenwich */ printk(KERN_INFO KBUILD_MODNAME ": kernel timezone is -%02d%02d ", minutes / 60, minutes % 60); |
55b69e910 netfilter: implem... |
250 |
return xt_register_match(&xt_time_mt_reg); |
ee4411a1b [NETFILTER]: x_ta... |
251 |
} |
d3c5ee6d5 [NETFILTER]: x_ta... |
252 |
static void __exit time_mt_exit(void) |
ee4411a1b [NETFILTER]: x_ta... |
253 |
{ |
55b69e910 netfilter: implem... |
254 |
xt_unregister_match(&xt_time_mt_reg); |
ee4411a1b [NETFILTER]: x_ta... |
255 |
} |
d3c5ee6d5 [NETFILTER]: x_ta... |
256 257 |
module_init(time_mt_init); module_exit(time_mt_exit); |
408ffaa4a netfilter: update... |
258 |
MODULE_AUTHOR("Jan Engelhardt <jengelh@medozas.de>"); |
2ae15b64e [NETFILTER]: Upda... |
259 |
MODULE_DESCRIPTION("Xtables: time-based matching"); |
ee4411a1b [NETFILTER]: x_ta... |
260 261 262 |
MODULE_LICENSE("GPL"); MODULE_ALIAS("ipt_time"); MODULE_ALIAS("ip6t_time"); |