2005-04-17 06:20:36 +08:00
|
|
|
/*
|
|
|
|
* Generic address resultion entity
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* net_random Alan Cox
|
2006-09-28 13:55:39 +08:00
|
|
|
* net_ratelimit Andi Kleen
|
2006-06-25 22:54:55 +08:00
|
|
|
* in{4,6}_pton YOSHIFUJI Hideaki, Copyright (C)2006 USAGI/WIDE Project
|
2005-04-17 06:20:36 +08:00
|
|
|
*
|
|
|
|
* Created by Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU General Public License
|
|
|
|
* as published by the Free Software Foundation; either version
|
|
|
|
* 2 of the License, or (at your option) any later version.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/jiffies.h>
|
|
|
|
#include <linux/kernel.h>
|
2013-03-27 13:54:13 +08:00
|
|
|
#include <linux/ctype.h>
|
2005-08-16 13:18:02 +08:00
|
|
|
#include <linux/inet.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/mm.h>
|
2005-08-16 13:18:02 +08:00
|
|
|
#include <linux/net.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/percpu.h>
|
|
|
|
#include <linux/init.h>
|
2009-09-22 22:18:09 +08:00
|
|
|
#include <linux/ratelimit.h>
|
|
|
|
|
2007-08-08 09:02:43 +08:00
|
|
|
#include <net/sock.h>
|
2011-05-28 01:41:33 +08:00
|
|
|
#include <net/net_ratelimit.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2005-07-28 06:24:42 +08:00
|
|
|
#include <asm/byteorder.h>
|
2005-04-17 06:20:36 +08:00
|
|
|
#include <asm/uaccess.h>
|
|
|
|
|
2008-07-25 16:45:58 +08:00
|
|
|
DEFINE_RATELIMIT_STATE(net_ratelimit_state, 5 * HZ, 10);
|
2007-02-09 22:24:36 +08:00
|
|
|
/*
|
2005-04-17 06:20:36 +08:00
|
|
|
* All net warning printk()s should be guarded by this function.
|
2007-02-09 22:24:36 +08:00
|
|
|
*/
|
2005-04-17 06:20:36 +08:00
|
|
|
int net_ratelimit(void)
|
|
|
|
{
|
2008-07-25 16:45:58 +08:00
|
|
|
return __ratelimit(&net_ratelimit_state);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(net_ratelimit);
|
2005-07-28 06:24:42 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Convert an ASCII string to binary IP.
|
|
|
|
* This is outside of net/ipv4/ because various code that uses IP addresses
|
|
|
|
* is otherwise not dependent on the TCP/IP stack.
|
|
|
|
*/
|
|
|
|
|
2006-01-07 05:24:54 +08:00
|
|
|
__be32 in_aton(const char *str)
|
2005-07-28 06:24:42 +08:00
|
|
|
{
|
|
|
|
unsigned long l;
|
|
|
|
unsigned int val;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
l = 0;
|
2012-04-08 14:07:42 +08:00
|
|
|
for (i = 0; i < 4; i++) {
|
2005-07-28 06:24:42 +08:00
|
|
|
l <<= 8;
|
2012-04-08 14:07:42 +08:00
|
|
|
if (*str != '\0') {
|
2005-07-28 06:24:42 +08:00
|
|
|
val = 0;
|
2012-04-08 14:07:42 +08:00
|
|
|
while (*str != '\0' && *str != '.' && *str != '\n') {
|
2005-07-28 06:24:42 +08:00
|
|
|
val *= 10;
|
|
|
|
val += *str - '0';
|
|
|
|
str++;
|
|
|
|
}
|
|
|
|
l |= val;
|
|
|
|
if (*str != '\0')
|
|
|
|
str++;
|
|
|
|
}
|
|
|
|
}
|
2010-09-23 04:43:57 +08:00
|
|
|
return htonl(l);
|
2005-07-28 06:24:42 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(in_aton);
|
2006-06-25 22:54:55 +08:00
|
|
|
|
|
|
|
#define IN6PTON_XDIGIT 0x00010000
|
|
|
|
#define IN6PTON_DIGIT 0x00020000
|
|
|
|
#define IN6PTON_COLON_MASK 0x00700000
|
|
|
|
#define IN6PTON_COLON_1 0x00100000 /* single : requested */
|
|
|
|
#define IN6PTON_COLON_2 0x00200000 /* second : requested */
|
|
|
|
#define IN6PTON_COLON_1_2 0x00400000 /* :: requested */
|
|
|
|
#define IN6PTON_DOT 0x00800000 /* . */
|
|
|
|
#define IN6PTON_DELIM 0x10000000
|
|
|
|
#define IN6PTON_NULL 0x20000000 /* first/tail */
|
|
|
|
#define IN6PTON_UNKNOWN 0x40000000
|
|
|
|
|
2006-12-03 14:04:04 +08:00
|
|
|
static inline int xdigit2bin(char c, int delim)
|
2006-06-25 22:54:55 +08:00
|
|
|
{
|
2010-09-21 04:40:26 +08:00
|
|
|
int val;
|
|
|
|
|
2006-06-25 22:54:55 +08:00
|
|
|
if (c == delim || c == '\0')
|
|
|
|
return IN6PTON_DELIM;
|
|
|
|
if (c == ':')
|
|
|
|
return IN6PTON_COLON_MASK;
|
|
|
|
if (c == '.')
|
|
|
|
return IN6PTON_DOT;
|
2010-09-21 04:40:26 +08:00
|
|
|
|
|
|
|
val = hex_to_bin(c);
|
|
|
|
if (val >= 0)
|
|
|
|
return val | IN6PTON_XDIGIT | (val < 10 ? IN6PTON_DIGIT : 0);
|
|
|
|
|
2006-12-03 14:04:04 +08:00
|
|
|
if (delim == -1)
|
|
|
|
return IN6PTON_DELIM;
|
2006-06-25 22:54:55 +08:00
|
|
|
return IN6PTON_UNKNOWN;
|
|
|
|
}
|
|
|
|
|
2012-10-12 05:06:17 +08:00
|
|
|
/**
|
|
|
|
* in4_pton - convert an IPv4 address from literal to binary representation
|
|
|
|
* @src: the start of the IPv4 address string
|
|
|
|
* @srclen: the length of the string, -1 means strlen(src)
|
|
|
|
* @dst: the binary (u8[4] array) representation of the IPv4 address
|
|
|
|
* @delim: the delimiter of the IPv4 address in @src, -1 means no delimiter
|
|
|
|
* @end: A pointer to the end of the parsed string will be placed here
|
|
|
|
*
|
|
|
|
* Return one on success, return zero when any error occurs
|
|
|
|
* and @end will point to the end of the parsed string.
|
|
|
|
*
|
|
|
|
*/
|
2006-06-25 22:54:55 +08:00
|
|
|
int in4_pton(const char *src, int srclen,
|
|
|
|
u8 *dst,
|
2006-12-03 14:04:04 +08:00
|
|
|
int delim, const char **end)
|
2006-06-25 22:54:55 +08:00
|
|
|
{
|
|
|
|
const char *s;
|
|
|
|
u8 *d;
|
|
|
|
u8 dbuf[4];
|
|
|
|
int ret = 0;
|
|
|
|
int i;
|
|
|
|
int w = 0;
|
|
|
|
|
|
|
|
if (srclen < 0)
|
|
|
|
srclen = strlen(src);
|
|
|
|
s = src;
|
|
|
|
d = dbuf;
|
|
|
|
i = 0;
|
|
|
|
while(1) {
|
|
|
|
int c;
|
|
|
|
c = xdigit2bin(srclen > 0 ? *s : '\0', delim);
|
2007-05-30 03:59:54 +08:00
|
|
|
if (!(c & (IN6PTON_DIGIT | IN6PTON_DOT | IN6PTON_DELIM | IN6PTON_COLON_MASK))) {
|
2006-06-25 22:54:55 +08:00
|
|
|
goto out;
|
|
|
|
}
|
2007-05-30 03:59:54 +08:00
|
|
|
if (c & (IN6PTON_DOT | IN6PTON_DELIM | IN6PTON_COLON_MASK)) {
|
2006-06-25 22:54:55 +08:00
|
|
|
if (w == 0)
|
|
|
|
goto out;
|
|
|
|
*d++ = w & 0xff;
|
|
|
|
w = 0;
|
|
|
|
i++;
|
2007-05-30 03:59:54 +08:00
|
|
|
if (c & (IN6PTON_DELIM | IN6PTON_COLON_MASK)) {
|
2006-06-25 22:54:55 +08:00
|
|
|
if (i != 4)
|
|
|
|
goto out;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
goto cont;
|
|
|
|
}
|
|
|
|
w = (w * 10) + c;
|
|
|
|
if ((w & 0xffff) > 255) {
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
cont:
|
|
|
|
if (i >= 4)
|
|
|
|
goto out;
|
|
|
|
s++;
|
|
|
|
srclen--;
|
|
|
|
}
|
|
|
|
ret = 1;
|
|
|
|
memcpy(dst, dbuf, sizeof(dbuf));
|
|
|
|
out:
|
|
|
|
if (end)
|
|
|
|
*end = s;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(in4_pton);
|
|
|
|
|
2012-10-12 05:06:16 +08:00
|
|
|
/**
|
|
|
|
* in6_pton - convert an IPv6 address from literal to binary representation
|
|
|
|
* @src: the start of the IPv6 address string
|
|
|
|
* @srclen: the length of the string, -1 means strlen(src)
|
|
|
|
* @dst: the binary (u8[16] array) representation of the IPv6 address
|
|
|
|
* @delim: the delimiter of the IPv6 address in @src, -1 means no delimiter
|
|
|
|
* @end: A pointer to the end of the parsed string will be placed here
|
|
|
|
*
|
|
|
|
* Return one on success, return zero when any error occurs
|
|
|
|
* and @end will point to the end of the parsed string.
|
|
|
|
*
|
|
|
|
*/
|
2006-06-25 22:54:55 +08:00
|
|
|
int in6_pton(const char *src, int srclen,
|
|
|
|
u8 *dst,
|
2006-12-03 14:04:04 +08:00
|
|
|
int delim, const char **end)
|
2006-06-25 22:54:55 +08:00
|
|
|
{
|
|
|
|
const char *s, *tok = NULL;
|
|
|
|
u8 *d, *dc = NULL;
|
|
|
|
u8 dbuf[16];
|
|
|
|
int ret = 0;
|
|
|
|
int i;
|
|
|
|
int state = IN6PTON_COLON_1_2 | IN6PTON_XDIGIT | IN6PTON_NULL;
|
|
|
|
int w = 0;
|
|
|
|
|
|
|
|
memset(dbuf, 0, sizeof(dbuf));
|
|
|
|
|
|
|
|
s = src;
|
|
|
|
d = dbuf;
|
|
|
|
if (srclen < 0)
|
|
|
|
srclen = strlen(src);
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
int c;
|
|
|
|
|
|
|
|
c = xdigit2bin(srclen > 0 ? *s : '\0', delim);
|
|
|
|
if (!(c & state))
|
|
|
|
goto out;
|
|
|
|
if (c & (IN6PTON_DELIM | IN6PTON_COLON_MASK)) {
|
|
|
|
/* process one 16-bit word */
|
|
|
|
if (!(state & IN6PTON_NULL)) {
|
|
|
|
*d++ = (w >> 8) & 0xff;
|
|
|
|
*d++ = w & 0xff;
|
|
|
|
}
|
|
|
|
w = 0;
|
|
|
|
if (c & IN6PTON_DELIM) {
|
|
|
|
/* We've processed last word */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* COLON_1 => XDIGIT
|
|
|
|
* COLON_2 => XDIGIT|DELIM
|
|
|
|
* COLON_1_2 => COLON_2
|
|
|
|
*/
|
|
|
|
switch (state & IN6PTON_COLON_MASK) {
|
|
|
|
case IN6PTON_COLON_2:
|
|
|
|
dc = d;
|
|
|
|
state = IN6PTON_XDIGIT | IN6PTON_DELIM;
|
|
|
|
if (dc - dbuf >= sizeof(dbuf))
|
|
|
|
state |= IN6PTON_NULL;
|
|
|
|
break;
|
|
|
|
case IN6PTON_COLON_1|IN6PTON_COLON_1_2:
|
|
|
|
state = IN6PTON_XDIGIT | IN6PTON_COLON_2;
|
|
|
|
break;
|
|
|
|
case IN6PTON_COLON_1:
|
|
|
|
state = IN6PTON_XDIGIT;
|
|
|
|
break;
|
|
|
|
case IN6PTON_COLON_1_2:
|
|
|
|
state = IN6PTON_COLON_2;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
state = 0;
|
|
|
|
}
|
|
|
|
tok = s + 1;
|
|
|
|
goto cont;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (c & IN6PTON_DOT) {
|
|
|
|
ret = in4_pton(tok ? tok : s, srclen + (int)(s - tok), d, delim, &s);
|
|
|
|
if (ret > 0) {
|
|
|
|
d += 4;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
w = (w << 4) | (0xff & c);
|
|
|
|
state = IN6PTON_COLON_1 | IN6PTON_DELIM;
|
|
|
|
if (!(w & 0xf000)) {
|
|
|
|
state |= IN6PTON_XDIGIT;
|
|
|
|
}
|
|
|
|
if (!dc && d + 2 < dbuf + sizeof(dbuf)) {
|
|
|
|
state |= IN6PTON_COLON_1_2;
|
|
|
|
state &= ~IN6PTON_DELIM;
|
|
|
|
}
|
|
|
|
if (d + 2 >= dbuf + sizeof(dbuf)) {
|
|
|
|
state &= ~(IN6PTON_COLON_1|IN6PTON_COLON_1_2);
|
|
|
|
}
|
|
|
|
cont:
|
|
|
|
if ((dc && d + 4 < dbuf + sizeof(dbuf)) ||
|
|
|
|
d + 4 == dbuf + sizeof(dbuf)) {
|
|
|
|
state |= IN6PTON_DOT;
|
|
|
|
}
|
|
|
|
if (d >= dbuf + sizeof(dbuf)) {
|
|
|
|
state &= ~(IN6PTON_XDIGIT|IN6PTON_COLON_MASK);
|
|
|
|
}
|
|
|
|
s++;
|
|
|
|
srclen--;
|
|
|
|
}
|
|
|
|
|
|
|
|
i = 15; d--;
|
|
|
|
|
|
|
|
if (dc) {
|
|
|
|
while(d >= dc)
|
|
|
|
dst[i--] = *d--;
|
|
|
|
while(i >= dc - dbuf)
|
|
|
|
dst[i--] = 0;
|
|
|
|
while(i >= 0)
|
|
|
|
dst[i--] = *d--;
|
|
|
|
} else
|
|
|
|
memcpy(dst, dbuf, sizeof(dbuf));
|
|
|
|
|
|
|
|
ret = 1;
|
|
|
|
out:
|
|
|
|
if (end)
|
|
|
|
*end = s;
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(in6_pton);
|
2007-11-29 22:14:30 +08:00
|
|
|
|
|
|
|
void inet_proto_csum_replace4(__sum16 *sum, struct sk_buff *skb,
|
2015-08-18 04:42:25 +08:00
|
|
|
__be32 from, __be32 to, bool pseudohdr)
|
2007-11-29 22:14:30 +08:00
|
|
|
{
|
|
|
|
if (skb->ip_summed != CHECKSUM_PARTIAL) {
|
2015-05-26 09:50:01 +08:00
|
|
|
csum_replace4(sum, from, to);
|
2007-11-29 22:14:30 +08:00
|
|
|
if (skb->ip_summed == CHECKSUM_COMPLETE && pseudohdr)
|
2015-05-26 09:50:01 +08:00
|
|
|
skb->csum = ~csum_add(csum_sub(~(skb->csum),
|
|
|
|
(__force __wsum)from),
|
|
|
|
(__force __wsum)to);
|
2007-11-29 22:14:30 +08:00
|
|
|
} else if (pseudohdr)
|
2015-05-26 09:50:01 +08:00
|
|
|
*sum = ~csum_fold(csum_add(csum_sub(csum_unfold(*sum),
|
|
|
|
(__force __wsum)from),
|
|
|
|
(__force __wsum)to));
|
2007-11-29 22:14:30 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(inet_proto_csum_replace4);
|
2011-05-08 07:00:07 +08:00
|
|
|
|
2012-08-27 01:14:10 +08:00
|
|
|
void inet_proto_csum_replace16(__sum16 *sum, struct sk_buff *skb,
|
|
|
|
const __be32 *from, const __be32 *to,
|
2015-08-18 04:42:25 +08:00
|
|
|
bool pseudohdr)
|
2012-08-27 01:14:10 +08:00
|
|
|
{
|
|
|
|
__be32 diff[] = {
|
|
|
|
~from[0], ~from[1], ~from[2], ~from[3],
|
|
|
|
to[0], to[1], to[2], to[3],
|
|
|
|
};
|
|
|
|
if (skb->ip_summed != CHECKSUM_PARTIAL) {
|
|
|
|
*sum = csum_fold(csum_partial(diff, sizeof(diff),
|
|
|
|
~csum_unfold(*sum)));
|
|
|
|
if (skb->ip_summed == CHECKSUM_COMPLETE && pseudohdr)
|
|
|
|
skb->csum = ~csum_partial(diff, sizeof(diff),
|
|
|
|
~skb->csum);
|
|
|
|
} else if (pseudohdr)
|
|
|
|
*sum = ~csum_fold(csum_partial(diff, sizeof(diff),
|
|
|
|
csum_unfold(*sum)));
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(inet_proto_csum_replace16);
|
2013-10-20 03:48:55 +08:00
|
|
|
|
2015-08-18 04:42:26 +08:00
|
|
|
void inet_proto_csum_replace_by_diff(__sum16 *sum, struct sk_buff *skb,
|
|
|
|
__wsum diff, bool pseudohdr)
|
|
|
|
{
|
|
|
|
if (skb->ip_summed != CHECKSUM_PARTIAL) {
|
|
|
|
*sum = csum_fold(csum_add(diff, ~csum_unfold(*sum)));
|
|
|
|
if (skb->ip_summed == CHECKSUM_COMPLETE && pseudohdr)
|
|
|
|
skb->csum = ~csum_add(diff, ~skb->csum);
|
|
|
|
} else if (pseudohdr) {
|
|
|
|
*sum = ~csum_fold(csum_add(diff, csum_unfold(*sum)));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(inet_proto_csum_replace_by_diff);
|
|
|
|
|
2013-10-20 03:48:55 +08:00
|
|
|
struct __net_random_once_work {
|
|
|
|
struct work_struct work;
|
|
|
|
struct static_key *key;
|
|
|
|
};
|
|
|
|
|
|
|
|
static void __net_random_once_deferred(struct work_struct *w)
|
|
|
|
{
|
|
|
|
struct __net_random_once_work *work =
|
|
|
|
container_of(w, struct __net_random_once_work, work);
|
2014-05-12 04:59:30 +08:00
|
|
|
BUG_ON(!static_key_enabled(work->key));
|
|
|
|
static_key_slow_dec(work->key);
|
2013-10-20 03:48:55 +08:00
|
|
|
kfree(work);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void __net_random_once_disable_jump(struct static_key *key)
|
|
|
|
{
|
|
|
|
struct __net_random_once_work *w;
|
|
|
|
|
|
|
|
w = kmalloc(sizeof(*w), GFP_ATOMIC);
|
|
|
|
if (!w)
|
|
|
|
return;
|
|
|
|
|
|
|
|
INIT_WORK(&w->work, __net_random_once_deferred);
|
|
|
|
w->key = key;
|
|
|
|
schedule_work(&w->work);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool __net_get_random_once(void *buf, int nbytes, bool *done,
|
2014-05-12 04:59:30 +08:00
|
|
|
struct static_key *once_key)
|
2013-10-20 03:48:55 +08:00
|
|
|
{
|
|
|
|
static DEFINE_SPINLOCK(lock);
|
2013-10-24 02:05:27 +08:00
|
|
|
unsigned long flags;
|
2013-10-20 03:48:55 +08:00
|
|
|
|
2013-10-24 02:05:27 +08:00
|
|
|
spin_lock_irqsave(&lock, flags);
|
2013-10-20 03:48:55 +08:00
|
|
|
if (*done) {
|
2013-10-24 02:05:27 +08:00
|
|
|
spin_unlock_irqrestore(&lock, flags);
|
2013-10-20 03:48:55 +08:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
get_random_bytes(buf, nbytes);
|
|
|
|
*done = true;
|
2013-10-24 02:05:27 +08:00
|
|
|
spin_unlock_irqrestore(&lock, flags);
|
2013-10-20 03:48:55 +08:00
|
|
|
|
2014-05-12 04:59:30 +08:00
|
|
|
__net_random_once_disable_jump(once_key);
|
2013-10-20 03:48:55 +08:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__net_get_random_once);
|