af_netlink.c 31 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456
  1. /*
  2. * NETLINK Kernel-user communication protocol.
  3. *
  4. * Authors: Alan Cox <alan@redhat.com>
  5. * Alexey Kuznetsov <kuznet@ms2.inr.ac.ru>
  6. *
  7. * This program is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU General Public License
  9. * as published by the Free Software Foundation; either version
  10. * 2 of the License, or (at your option) any later version.
  11. *
  12. * Tue Jun 26 14:36:48 MEST 2001 Herbert "herp" Rosmanith
  13. * added netlink_proto_exit
  14. * Tue Jan 22 18:32:44 BRST 2002 Arnaldo C. de Melo <acme@conectiva.com.br>
  15. * use nlk_sk, as sk->protinfo is on a diet 8)
  16. *
  17. */
  18. #include <linux/config.h>
  19. #include <linux/module.h>
  20. #include <linux/kernel.h>
  21. #include <linux/init.h>
  22. #include <linux/signal.h>
  23. #include <linux/sched.h>
  24. #include <linux/errno.h>
  25. #include <linux/string.h>
  26. #include <linux/stat.h>
  27. #include <linux/socket.h>
  28. #include <linux/un.h>
  29. #include <linux/fcntl.h>
  30. #include <linux/termios.h>
  31. #include <linux/sockios.h>
  32. #include <linux/net.h>
  33. #include <linux/fs.h>
  34. #include <linux/slab.h>
  35. #include <asm/uaccess.h>
  36. #include <linux/skbuff.h>
  37. #include <linux/netdevice.h>
  38. #include <linux/rtnetlink.h>
  39. #include <linux/proc_fs.h>
  40. #include <linux/seq_file.h>
  41. #include <linux/smp_lock.h>
  42. #include <linux/notifier.h>
  43. #include <linux/security.h>
  44. #include <linux/jhash.h>
  45. #include <linux/jiffies.h>
  46. #include <linux/random.h>
  47. #include <linux/bitops.h>
  48. #include <linux/mm.h>
  49. #include <linux/types.h>
  50. #include <linux/audit.h>
  51. #include <net/sock.h>
  52. #include <net/scm.h>
  53. #define Nprintk(a...)
  54. struct netlink_sock {
  55. /* struct sock has to be the first member of netlink_sock */
  56. struct sock sk;
  57. u32 pid;
  58. unsigned int groups;
  59. u32 dst_pid;
  60. unsigned int dst_groups;
  61. unsigned long state;
  62. wait_queue_head_t wait;
  63. struct netlink_callback *cb;
  64. spinlock_t cb_lock;
  65. void (*data_ready)(struct sock *sk, int bytes);
  66. };
  67. static inline struct netlink_sock *nlk_sk(struct sock *sk)
  68. {
  69. return (struct netlink_sock *)sk;
  70. }
  71. struct nl_pid_hash {
  72. struct hlist_head *table;
  73. unsigned long rehash_time;
  74. unsigned int mask;
  75. unsigned int shift;
  76. unsigned int entries;
  77. unsigned int max_shift;
  78. u32 rnd;
  79. };
  80. struct netlink_table {
  81. struct nl_pid_hash hash;
  82. struct hlist_head mc_list;
  83. unsigned int nl_nonroot;
  84. };
  85. static struct netlink_table *nl_table;
  86. static DECLARE_WAIT_QUEUE_HEAD(nl_table_wait);
  87. static int netlink_dump(struct sock *sk);
  88. static void netlink_destroy_callback(struct netlink_callback *cb);
  89. static DEFINE_RWLOCK(nl_table_lock);
  90. static atomic_t nl_table_users = ATOMIC_INIT(0);
  91. static struct notifier_block *netlink_chain;
  92. static struct hlist_head *nl_pid_hashfn(struct nl_pid_hash *hash, u32 pid)
  93. {
  94. return &hash->table[jhash_1word(pid, hash->rnd) & hash->mask];
  95. }
  96. static void netlink_sock_destruct(struct sock *sk)
  97. {
  98. skb_queue_purge(&sk->sk_receive_queue);
  99. if (!sock_flag(sk, SOCK_DEAD)) {
  100. printk("Freeing alive netlink socket %p\n", sk);
  101. return;
  102. }
  103. BUG_TRAP(!atomic_read(&sk->sk_rmem_alloc));
  104. BUG_TRAP(!atomic_read(&sk->sk_wmem_alloc));
  105. BUG_TRAP(!nlk_sk(sk)->cb);
  106. }
  107. /* This lock without WQ_FLAG_EXCLUSIVE is good on UP and it is _very_ bad on SMP.
  108. * Look, when several writers sleep and reader wakes them up, all but one
  109. * immediately hit write lock and grab all the cpus. Exclusive sleep solves
  110. * this, _but_ remember, it adds useless work on UP machines.
  111. */
  112. static void netlink_table_grab(void)
  113. {
  114. write_lock_bh(&nl_table_lock);
  115. if (atomic_read(&nl_table_users)) {
  116. DECLARE_WAITQUEUE(wait, current);
  117. add_wait_queue_exclusive(&nl_table_wait, &wait);
  118. for(;;) {
  119. set_current_state(TASK_UNINTERRUPTIBLE);
  120. if (atomic_read(&nl_table_users) == 0)
  121. break;
  122. write_unlock_bh(&nl_table_lock);
  123. schedule();
  124. write_lock_bh(&nl_table_lock);
  125. }
  126. __set_current_state(TASK_RUNNING);
  127. remove_wait_queue(&nl_table_wait, &wait);
  128. }
  129. }
  130. static __inline__ void netlink_table_ungrab(void)
  131. {
  132. write_unlock_bh(&nl_table_lock);
  133. wake_up(&nl_table_wait);
  134. }
  135. static __inline__ void
  136. netlink_lock_table(void)
  137. {
  138. /* read_lock() synchronizes us to netlink_table_grab */
  139. read_lock(&nl_table_lock);
  140. atomic_inc(&nl_table_users);
  141. read_unlock(&nl_table_lock);
  142. }
  143. static __inline__ void
  144. netlink_unlock_table(void)
  145. {
  146. if (atomic_dec_and_test(&nl_table_users))
  147. wake_up(&nl_table_wait);
  148. }
  149. static __inline__ struct sock *netlink_lookup(int protocol, u32 pid)
  150. {
  151. struct nl_pid_hash *hash = &nl_table[protocol].hash;
  152. struct hlist_head *head;
  153. struct sock *sk;
  154. struct hlist_node *node;
  155. read_lock(&nl_table_lock);
  156. head = nl_pid_hashfn(hash, pid);
  157. sk_for_each(sk, node, head) {
  158. if (nlk_sk(sk)->pid == pid) {
  159. sock_hold(sk);
  160. goto found;
  161. }
  162. }
  163. sk = NULL;
  164. found:
  165. read_unlock(&nl_table_lock);
  166. return sk;
  167. }
  168. static inline struct hlist_head *nl_pid_hash_alloc(size_t size)
  169. {
  170. if (size <= PAGE_SIZE)
  171. return kmalloc(size, GFP_ATOMIC);
  172. else
  173. return (struct hlist_head *)
  174. __get_free_pages(GFP_ATOMIC, get_order(size));
  175. }
  176. static inline void nl_pid_hash_free(struct hlist_head *table, size_t size)
  177. {
  178. if (size <= PAGE_SIZE)
  179. kfree(table);
  180. else
  181. free_pages((unsigned long)table, get_order(size));
  182. }
  183. static int nl_pid_hash_rehash(struct nl_pid_hash *hash, int grow)
  184. {
  185. unsigned int omask, mask, shift;
  186. size_t osize, size;
  187. struct hlist_head *otable, *table;
  188. int i;
  189. omask = mask = hash->mask;
  190. osize = size = (mask + 1) * sizeof(*table);
  191. shift = hash->shift;
  192. if (grow) {
  193. if (++shift > hash->max_shift)
  194. return 0;
  195. mask = mask * 2 + 1;
  196. size *= 2;
  197. }
  198. table = nl_pid_hash_alloc(size);
  199. if (!table)
  200. return 0;
  201. memset(table, 0, size);
  202. otable = hash->table;
  203. hash->table = table;
  204. hash->mask = mask;
  205. hash->shift = shift;
  206. get_random_bytes(&hash->rnd, sizeof(hash->rnd));
  207. for (i = 0; i <= omask; i++) {
  208. struct sock *sk;
  209. struct hlist_node *node, *tmp;
  210. sk_for_each_safe(sk, node, tmp, &otable[i])
  211. __sk_add_node(sk, nl_pid_hashfn(hash, nlk_sk(sk)->pid));
  212. }
  213. nl_pid_hash_free(otable, osize);
  214. hash->rehash_time = jiffies + 10 * 60 * HZ;
  215. return 1;
  216. }
  217. static inline int nl_pid_hash_dilute(struct nl_pid_hash *hash, int len)
  218. {
  219. int avg = hash->entries >> hash->shift;
  220. if (unlikely(avg > 1) && nl_pid_hash_rehash(hash, 1))
  221. return 1;
  222. if (unlikely(len > avg) && time_after(jiffies, hash->rehash_time)) {
  223. nl_pid_hash_rehash(hash, 0);
  224. return 1;
  225. }
  226. return 0;
  227. }
  228. static struct proto_ops netlink_ops;
  229. static int netlink_insert(struct sock *sk, u32 pid)
  230. {
  231. struct nl_pid_hash *hash = &nl_table[sk->sk_protocol].hash;
  232. struct hlist_head *head;
  233. int err = -EADDRINUSE;
  234. struct sock *osk;
  235. struct hlist_node *node;
  236. int len;
  237. netlink_table_grab();
  238. head = nl_pid_hashfn(hash, pid);
  239. len = 0;
  240. sk_for_each(osk, node, head) {
  241. if (nlk_sk(osk)->pid == pid)
  242. break;
  243. len++;
  244. }
  245. if (node)
  246. goto err;
  247. err = -EBUSY;
  248. if (nlk_sk(sk)->pid)
  249. goto err;
  250. err = -ENOMEM;
  251. if (BITS_PER_LONG > 32 && unlikely(hash->entries >= UINT_MAX))
  252. goto err;
  253. if (len && nl_pid_hash_dilute(hash, len))
  254. head = nl_pid_hashfn(hash, pid);
  255. hash->entries++;
  256. nlk_sk(sk)->pid = pid;
  257. sk_add_node(sk, head);
  258. err = 0;
  259. err:
  260. netlink_table_ungrab();
  261. return err;
  262. }
  263. static void netlink_remove(struct sock *sk)
  264. {
  265. netlink_table_grab();
  266. nl_table[sk->sk_protocol].hash.entries--;
  267. sk_del_node_init(sk);
  268. if (nlk_sk(sk)->groups)
  269. __sk_del_bind_node(sk);
  270. netlink_table_ungrab();
  271. }
  272. static struct proto netlink_proto = {
  273. .name = "NETLINK",
  274. .owner = THIS_MODULE,
  275. .obj_size = sizeof(struct netlink_sock),
  276. };
  277. static int netlink_create(struct socket *sock, int protocol)
  278. {
  279. struct sock *sk;
  280. struct netlink_sock *nlk;
  281. sock->state = SS_UNCONNECTED;
  282. if (sock->type != SOCK_RAW && sock->type != SOCK_DGRAM)
  283. return -ESOCKTNOSUPPORT;
  284. if (protocol<0 || protocol >= MAX_LINKS)
  285. return -EPROTONOSUPPORT;
  286. sock->ops = &netlink_ops;
  287. sk = sk_alloc(PF_NETLINK, GFP_KERNEL, &netlink_proto, 1);
  288. if (!sk)
  289. return -ENOMEM;
  290. sock_init_data(sock, sk);
  291. nlk = nlk_sk(sk);
  292. spin_lock_init(&nlk->cb_lock);
  293. init_waitqueue_head(&nlk->wait);
  294. sk->sk_destruct = netlink_sock_destruct;
  295. sk->sk_protocol = protocol;
  296. return 0;
  297. }
  298. static int netlink_release(struct socket *sock)
  299. {
  300. struct sock *sk = sock->sk;
  301. struct netlink_sock *nlk;
  302. if (!sk)
  303. return 0;
  304. netlink_remove(sk);
  305. nlk = nlk_sk(sk);
  306. spin_lock(&nlk->cb_lock);
  307. if (nlk->cb) {
  308. nlk->cb->done(nlk->cb);
  309. netlink_destroy_callback(nlk->cb);
  310. nlk->cb = NULL;
  311. __sock_put(sk);
  312. }
  313. spin_unlock(&nlk->cb_lock);
  314. /* OK. Socket is unlinked, and, therefore,
  315. no new packets will arrive */
  316. sock_orphan(sk);
  317. sock->sk = NULL;
  318. wake_up_interruptible_all(&nlk->wait);
  319. skb_queue_purge(&sk->sk_write_queue);
  320. if (nlk->pid && !nlk->groups) {
  321. struct netlink_notify n = {
  322. .protocol = sk->sk_protocol,
  323. .pid = nlk->pid,
  324. };
  325. notifier_call_chain(&netlink_chain, NETLINK_URELEASE, &n);
  326. }
  327. sock_put(sk);
  328. return 0;
  329. }
  330. static int netlink_autobind(struct socket *sock)
  331. {
  332. struct sock *sk = sock->sk;
  333. struct nl_pid_hash *hash = &nl_table[sk->sk_protocol].hash;
  334. struct hlist_head *head;
  335. struct sock *osk;
  336. struct hlist_node *node;
  337. s32 pid = current->pid;
  338. int err;
  339. static s32 rover = -4097;
  340. retry:
  341. cond_resched();
  342. netlink_table_grab();
  343. head = nl_pid_hashfn(hash, pid);
  344. sk_for_each(osk, node, head) {
  345. if (nlk_sk(osk)->pid == pid) {
  346. /* Bind collision, search negative pid values. */
  347. pid = rover--;
  348. if (rover > -4097)
  349. rover = -4097;
  350. netlink_table_ungrab();
  351. goto retry;
  352. }
  353. }
  354. netlink_table_ungrab();
  355. err = netlink_insert(sk, pid);
  356. if (err == -EADDRINUSE)
  357. goto retry;
  358. return 0;
  359. }
  360. static inline int netlink_capable(struct socket *sock, unsigned int flag)
  361. {
  362. return (nl_table[sock->sk->sk_protocol].nl_nonroot & flag) ||
  363. capable(CAP_NET_ADMIN);
  364. }
  365. static int netlink_bind(struct socket *sock, struct sockaddr *addr, int addr_len)
  366. {
  367. struct sock *sk = sock->sk;
  368. struct netlink_sock *nlk = nlk_sk(sk);
  369. struct sockaddr_nl *nladdr = (struct sockaddr_nl *)addr;
  370. int err;
  371. if (nladdr->nl_family != AF_NETLINK)
  372. return -EINVAL;
  373. /* Only superuser is allowed to listen multicasts */
  374. if (nladdr->nl_groups && !netlink_capable(sock, NL_NONROOT_RECV))
  375. return -EPERM;
  376. if (nlk->pid) {
  377. if (nladdr->nl_pid != nlk->pid)
  378. return -EINVAL;
  379. } else {
  380. err = nladdr->nl_pid ?
  381. netlink_insert(sk, nladdr->nl_pid) :
  382. netlink_autobind(sock);
  383. if (err)
  384. return err;
  385. }
  386. if (!nladdr->nl_groups && !nlk->groups)
  387. return 0;
  388. netlink_table_grab();
  389. if (nlk->groups && !nladdr->nl_groups)
  390. __sk_del_bind_node(sk);
  391. else if (!nlk->groups && nladdr->nl_groups)
  392. sk_add_bind_node(sk, &nl_table[sk->sk_protocol].mc_list);
  393. nlk->groups = nladdr->nl_groups;
  394. netlink_table_ungrab();
  395. return 0;
  396. }
  397. static int netlink_connect(struct socket *sock, struct sockaddr *addr,
  398. int alen, int flags)
  399. {
  400. int err = 0;
  401. struct sock *sk = sock->sk;
  402. struct netlink_sock *nlk = nlk_sk(sk);
  403. struct sockaddr_nl *nladdr=(struct sockaddr_nl*)addr;
  404. if (addr->sa_family == AF_UNSPEC) {
  405. sk->sk_state = NETLINK_UNCONNECTED;
  406. nlk->dst_pid = 0;
  407. nlk->dst_groups = 0;
  408. return 0;
  409. }
  410. if (addr->sa_family != AF_NETLINK)
  411. return -EINVAL;
  412. /* Only superuser is allowed to send multicasts */
  413. if (nladdr->nl_groups && !netlink_capable(sock, NL_NONROOT_SEND))
  414. return -EPERM;
  415. if (!nlk->pid)
  416. err = netlink_autobind(sock);
  417. if (err == 0) {
  418. sk->sk_state = NETLINK_CONNECTED;
  419. nlk->dst_pid = nladdr->nl_pid;
  420. nlk->dst_groups = nladdr->nl_groups;
  421. }
  422. return err;
  423. }
  424. static int netlink_getname(struct socket *sock, struct sockaddr *addr, int *addr_len, int peer)
  425. {
  426. struct sock *sk = sock->sk;
  427. struct netlink_sock *nlk = nlk_sk(sk);
  428. struct sockaddr_nl *nladdr=(struct sockaddr_nl *)addr;
  429. nladdr->nl_family = AF_NETLINK;
  430. nladdr->nl_pad = 0;
  431. *addr_len = sizeof(*nladdr);
  432. if (peer) {
  433. nladdr->nl_pid = nlk->dst_pid;
  434. nladdr->nl_groups = nlk->dst_groups;
  435. } else {
  436. nladdr->nl_pid = nlk->pid;
  437. nladdr->nl_groups = nlk->groups;
  438. }
  439. return 0;
  440. }
  441. static void netlink_overrun(struct sock *sk)
  442. {
  443. if (!test_and_set_bit(0, &nlk_sk(sk)->state)) {
  444. sk->sk_err = ENOBUFS;
  445. sk->sk_error_report(sk);
  446. }
  447. }
  448. static struct sock *netlink_getsockbypid(struct sock *ssk, u32 pid)
  449. {
  450. int protocol = ssk->sk_protocol;
  451. struct sock *sock;
  452. struct netlink_sock *nlk;
  453. sock = netlink_lookup(protocol, pid);
  454. if (!sock)
  455. return ERR_PTR(-ECONNREFUSED);
  456. /* Don't bother queuing skb if kernel socket has no input function */
  457. nlk = nlk_sk(sock);
  458. if ((nlk->pid == 0 && !nlk->data_ready) ||
  459. (sock->sk_state == NETLINK_CONNECTED &&
  460. nlk->dst_pid != nlk_sk(ssk)->pid)) {
  461. sock_put(sock);
  462. return ERR_PTR(-ECONNREFUSED);
  463. }
  464. return sock;
  465. }
  466. struct sock *netlink_getsockbyfilp(struct file *filp)
  467. {
  468. struct inode *inode = filp->f_dentry->d_inode;
  469. struct sock *sock;
  470. if (!S_ISSOCK(inode->i_mode))
  471. return ERR_PTR(-ENOTSOCK);
  472. sock = SOCKET_I(inode)->sk;
  473. if (sock->sk_family != AF_NETLINK)
  474. return ERR_PTR(-EINVAL);
  475. sock_hold(sock);
  476. return sock;
  477. }
  478. /*
  479. * Attach a skb to a netlink socket.
  480. * The caller must hold a reference to the destination socket. On error, the
  481. * reference is dropped. The skb is not send to the destination, just all
  482. * all error checks are performed and memory in the queue is reserved.
  483. * Return values:
  484. * < 0: error. skb freed, reference to sock dropped.
  485. * 0: continue
  486. * 1: repeat lookup - reference dropped while waiting for socket memory.
  487. */
  488. int netlink_attachskb(struct sock *sk, struct sk_buff *skb, int nonblock, long timeo)
  489. {
  490. struct netlink_sock *nlk;
  491. nlk = nlk_sk(sk);
  492. if (atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
  493. test_bit(0, &nlk->state)) {
  494. DECLARE_WAITQUEUE(wait, current);
  495. if (!timeo) {
  496. if (!nlk->pid)
  497. netlink_overrun(sk);
  498. sock_put(sk);
  499. kfree_skb(skb);
  500. return -EAGAIN;
  501. }
  502. __set_current_state(TASK_INTERRUPTIBLE);
  503. add_wait_queue(&nlk->wait, &wait);
  504. if ((atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf ||
  505. test_bit(0, &nlk->state)) &&
  506. !sock_flag(sk, SOCK_DEAD))
  507. timeo = schedule_timeout(timeo);
  508. __set_current_state(TASK_RUNNING);
  509. remove_wait_queue(&nlk->wait, &wait);
  510. sock_put(sk);
  511. if (signal_pending(current)) {
  512. kfree_skb(skb);
  513. return sock_intr_errno(timeo);
  514. }
  515. return 1;
  516. }
  517. skb_set_owner_r(skb, sk);
  518. return 0;
  519. }
  520. int netlink_sendskb(struct sock *sk, struct sk_buff *skb, int protocol)
  521. {
  522. struct netlink_sock *nlk;
  523. int len = skb->len;
  524. nlk = nlk_sk(sk);
  525. skb_queue_tail(&sk->sk_receive_queue, skb);
  526. sk->sk_data_ready(sk, len);
  527. sock_put(sk);
  528. return len;
  529. }
  530. void netlink_detachskb(struct sock *sk, struct sk_buff *skb)
  531. {
  532. kfree_skb(skb);
  533. sock_put(sk);
  534. }
  535. static inline struct sk_buff *netlink_trim(struct sk_buff *skb, int allocation)
  536. {
  537. int delta;
  538. skb_orphan(skb);
  539. delta = skb->end - skb->tail;
  540. if (delta * 2 < skb->truesize)
  541. return skb;
  542. if (skb_shared(skb)) {
  543. struct sk_buff *nskb = skb_clone(skb, allocation);
  544. if (!nskb)
  545. return skb;
  546. kfree_skb(skb);
  547. skb = nskb;
  548. }
  549. if (!pskb_expand_head(skb, 0, -delta, allocation))
  550. skb->truesize -= delta;
  551. return skb;
  552. }
  553. int netlink_unicast(struct sock *ssk, struct sk_buff *skb, u32 pid, int nonblock)
  554. {
  555. struct sock *sk;
  556. int err;
  557. long timeo;
  558. skb = netlink_trim(skb, gfp_any());
  559. timeo = sock_sndtimeo(ssk, nonblock);
  560. retry:
  561. sk = netlink_getsockbypid(ssk, pid);
  562. if (IS_ERR(sk)) {
  563. kfree_skb(skb);
  564. return PTR_ERR(sk);
  565. }
  566. err = netlink_attachskb(sk, skb, nonblock, timeo);
  567. if (err == 1)
  568. goto retry;
  569. if (err)
  570. return err;
  571. return netlink_sendskb(sk, skb, ssk->sk_protocol);
  572. }
  573. static __inline__ int netlink_broadcast_deliver(struct sock *sk, struct sk_buff *skb)
  574. {
  575. struct netlink_sock *nlk = nlk_sk(sk);
  576. if (atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf &&
  577. !test_bit(0, &nlk->state)) {
  578. skb_set_owner_r(skb, sk);
  579. skb_queue_tail(&sk->sk_receive_queue, skb);
  580. sk->sk_data_ready(sk, skb->len);
  581. return atomic_read(&sk->sk_rmem_alloc) > sk->sk_rcvbuf;
  582. }
  583. return -1;
  584. }
  585. struct netlink_broadcast_data {
  586. struct sock *exclude_sk;
  587. u32 pid;
  588. u32 group;
  589. int failure;
  590. int congested;
  591. int delivered;
  592. int allocation;
  593. struct sk_buff *skb, *skb2;
  594. };
  595. static inline int do_one_broadcast(struct sock *sk,
  596. struct netlink_broadcast_data *p)
  597. {
  598. struct netlink_sock *nlk = nlk_sk(sk);
  599. int val;
  600. if (p->exclude_sk == sk)
  601. goto out;
  602. if (nlk->pid == p->pid || !(nlk->groups & p->group))
  603. goto out;
  604. if (p->failure) {
  605. netlink_overrun(sk);
  606. goto out;
  607. }
  608. sock_hold(sk);
  609. if (p->skb2 == NULL) {
  610. if (atomic_read(&p->skb->users) != 1) {
  611. p->skb2 = skb_clone(p->skb, p->allocation);
  612. } else {
  613. p->skb2 = p->skb;
  614. atomic_inc(&p->skb->users);
  615. }
  616. }
  617. if (p->skb2 == NULL) {
  618. netlink_overrun(sk);
  619. /* Clone failed. Notify ALL listeners. */
  620. p->failure = 1;
  621. } else if ((val = netlink_broadcast_deliver(sk, p->skb2)) < 0) {
  622. netlink_overrun(sk);
  623. } else {
  624. p->congested |= val;
  625. p->delivered = 1;
  626. p->skb2 = NULL;
  627. }
  628. sock_put(sk);
  629. out:
  630. return 0;
  631. }
  632. int netlink_broadcast(struct sock *ssk, struct sk_buff *skb, u32 pid,
  633. u32 group, int allocation)
  634. {
  635. struct netlink_broadcast_data info;
  636. struct hlist_node *node;
  637. struct sock *sk;
  638. skb = netlink_trim(skb, allocation);
  639. info.exclude_sk = ssk;
  640. info.pid = pid;
  641. info.group = group;
  642. info.failure = 0;
  643. info.congested = 0;
  644. info.delivered = 0;
  645. info.allocation = allocation;
  646. info.skb = skb;
  647. info.skb2 = NULL;
  648. /* While we sleep in clone, do not allow to change socket list */
  649. netlink_lock_table();
  650. sk_for_each_bound(sk, node, &nl_table[ssk->sk_protocol].mc_list)
  651. do_one_broadcast(sk, &info);
  652. netlink_unlock_table();
  653. if (info.skb2)
  654. kfree_skb(info.skb2);
  655. kfree_skb(skb);
  656. if (info.delivered) {
  657. if (info.congested && (allocation & __GFP_WAIT))
  658. yield();
  659. return 0;
  660. }
  661. if (info.failure)
  662. return -ENOBUFS;
  663. return -ESRCH;
  664. }
  665. struct netlink_set_err_data {
  666. struct sock *exclude_sk;
  667. u32 pid;
  668. u32 group;
  669. int code;
  670. };
  671. static inline int do_one_set_err(struct sock *sk,
  672. struct netlink_set_err_data *p)
  673. {
  674. struct netlink_sock *nlk = nlk_sk(sk);
  675. if (sk == p->exclude_sk)
  676. goto out;
  677. if (nlk->pid == p->pid || !(nlk->groups & p->group))
  678. goto out;
  679. sk->sk_err = p->code;
  680. sk->sk_error_report(sk);
  681. out:
  682. return 0;
  683. }
  684. void netlink_set_err(struct sock *ssk, u32 pid, u32 group, int code)
  685. {
  686. struct netlink_set_err_data info;
  687. struct hlist_node *node;
  688. struct sock *sk;
  689. info.exclude_sk = ssk;
  690. info.pid = pid;
  691. info.group = group;
  692. info.code = code;
  693. read_lock(&nl_table_lock);
  694. sk_for_each_bound(sk, node, &nl_table[ssk->sk_protocol].mc_list)
  695. do_one_set_err(sk, &info);
  696. read_unlock(&nl_table_lock);
  697. }
  698. static inline void netlink_rcv_wake(struct sock *sk)
  699. {
  700. struct netlink_sock *nlk = nlk_sk(sk);
  701. if (!skb_queue_len(&sk->sk_receive_queue))
  702. clear_bit(0, &nlk->state);
  703. if (!test_bit(0, &nlk->state))
  704. wake_up_interruptible(&nlk->wait);
  705. }
  706. static int netlink_sendmsg(struct kiocb *kiocb, struct socket *sock,
  707. struct msghdr *msg, size_t len)
  708. {
  709. struct sock_iocb *siocb = kiocb_to_siocb(kiocb);
  710. struct sock *sk = sock->sk;
  711. struct netlink_sock *nlk = nlk_sk(sk);
  712. struct sockaddr_nl *addr=msg->msg_name;
  713. u32 dst_pid;
  714. u32 dst_groups;
  715. struct sk_buff *skb;
  716. int err;
  717. struct scm_cookie scm;
  718. if (msg->msg_flags&MSG_OOB)
  719. return -EOPNOTSUPP;
  720. if (NULL == siocb->scm)
  721. siocb->scm = &scm;
  722. err = scm_send(sock, msg, siocb->scm);
  723. if (err < 0)
  724. return err;
  725. if (msg->msg_namelen) {
  726. if (addr->nl_family != AF_NETLINK)
  727. return -EINVAL;
  728. dst_pid = addr->nl_pid;
  729. dst_groups = addr->nl_groups;
  730. if (dst_groups && !netlink_capable(sock, NL_NONROOT_SEND))
  731. return -EPERM;
  732. } else {
  733. dst_pid = nlk->dst_pid;
  734. dst_groups = nlk->dst_groups;
  735. }
  736. if (!nlk->pid) {
  737. err = netlink_autobind(sock);
  738. if (err)
  739. goto out;
  740. }
  741. err = -EMSGSIZE;
  742. if (len > sk->sk_sndbuf - 32)
  743. goto out;
  744. err = -ENOBUFS;
  745. skb = alloc_skb(len, GFP_KERNEL);
  746. if (skb==NULL)
  747. goto out;
  748. NETLINK_CB(skb).pid = nlk->pid;
  749. NETLINK_CB(skb).groups = nlk->groups;
  750. NETLINK_CB(skb).dst_pid = dst_pid;
  751. NETLINK_CB(skb).dst_groups = dst_groups;
  752. NETLINK_CB(skb).loginuid = audit_get_loginuid(current->audit_context);
  753. memcpy(NETLINK_CREDS(skb), &siocb->scm->creds, sizeof(struct ucred));
  754. /* What can I do? Netlink is asynchronous, so that
  755. we will have to save current capabilities to
  756. check them, when this message will be delivered
  757. to corresponding kernel module. --ANK (980802)
  758. */
  759. err = -EFAULT;
  760. if (memcpy_fromiovec(skb_put(skb,len), msg->msg_iov, len)) {
  761. kfree_skb(skb);
  762. goto out;
  763. }
  764. err = security_netlink_send(sk, skb);
  765. if (err) {
  766. kfree_skb(skb);
  767. goto out;
  768. }
  769. if (dst_groups) {
  770. atomic_inc(&skb->users);
  771. netlink_broadcast(sk, skb, dst_pid, dst_groups, GFP_KERNEL);
  772. }
  773. err = netlink_unicast(sk, skb, dst_pid, msg->msg_flags&MSG_DONTWAIT);
  774. out:
  775. return err;
  776. }
  777. static int netlink_recvmsg(struct kiocb *kiocb, struct socket *sock,
  778. struct msghdr *msg, size_t len,
  779. int flags)
  780. {
  781. struct sock_iocb *siocb = kiocb_to_siocb(kiocb);
  782. struct scm_cookie scm;
  783. struct sock *sk = sock->sk;
  784. struct netlink_sock *nlk = nlk_sk(sk);
  785. int noblock = flags&MSG_DONTWAIT;
  786. size_t copied;
  787. struct sk_buff *skb;
  788. int err;
  789. if (flags&MSG_OOB)
  790. return -EOPNOTSUPP;
  791. copied = 0;
  792. skb = skb_recv_datagram(sk,flags,noblock,&err);
  793. if (skb==NULL)
  794. goto out;
  795. msg->msg_namelen = 0;
  796. copied = skb->len;
  797. if (len < copied) {
  798. msg->msg_flags |= MSG_TRUNC;
  799. copied = len;
  800. }
  801. skb->h.raw = skb->data;
  802. err = skb_copy_datagram_iovec(skb, 0, msg->msg_iov, copied);
  803. if (msg->msg_name) {
  804. struct sockaddr_nl *addr = (struct sockaddr_nl*)msg->msg_name;
  805. addr->nl_family = AF_NETLINK;
  806. addr->nl_pad = 0;
  807. addr->nl_pid = NETLINK_CB(skb).pid;
  808. addr->nl_groups = NETLINK_CB(skb).dst_groups;
  809. msg->msg_namelen = sizeof(*addr);
  810. }
  811. if (NULL == siocb->scm) {
  812. memset(&scm, 0, sizeof(scm));
  813. siocb->scm = &scm;
  814. }
  815. siocb->scm->creds = *NETLINK_CREDS(skb);
  816. skb_free_datagram(sk, skb);
  817. if (nlk->cb && atomic_read(&sk->sk_rmem_alloc) <= sk->sk_rcvbuf / 2)
  818. netlink_dump(sk);
  819. scm_recv(sock, msg, siocb->scm, flags);
  820. out:
  821. netlink_rcv_wake(sk);
  822. return err ? : copied;
  823. }
  824. static void netlink_data_ready(struct sock *sk, int len)
  825. {
  826. struct netlink_sock *nlk = nlk_sk(sk);
  827. if (nlk->data_ready)
  828. nlk->data_ready(sk, len);
  829. netlink_rcv_wake(sk);
  830. }
  831. /*
  832. * We export these functions to other modules. They provide a
  833. * complete set of kernel non-blocking support for message
  834. * queueing.
  835. */
  836. struct sock *
  837. netlink_kernel_create(int unit, void (*input)(struct sock *sk, int len))
  838. {
  839. struct socket *sock;
  840. struct sock *sk;
  841. if (!nl_table)
  842. return NULL;
  843. if (unit<0 || unit>=MAX_LINKS)
  844. return NULL;
  845. if (sock_create_lite(PF_NETLINK, SOCK_DGRAM, unit, &sock))
  846. return NULL;
  847. if (netlink_create(sock, unit) < 0) {
  848. sock_release(sock);
  849. return NULL;
  850. }
  851. sk = sock->sk;
  852. sk->sk_data_ready = netlink_data_ready;
  853. if (input)
  854. nlk_sk(sk)->data_ready = input;
  855. if (netlink_insert(sk, 0)) {
  856. sock_release(sock);
  857. return NULL;
  858. }
  859. return sk;
  860. }
  861. void netlink_set_nonroot(int protocol, unsigned int flags)
  862. {
  863. if ((unsigned int)protocol < MAX_LINKS)
  864. nl_table[protocol].nl_nonroot = flags;
  865. }
  866. static void netlink_destroy_callback(struct netlink_callback *cb)
  867. {
  868. if (cb->skb)
  869. kfree_skb(cb->skb);
  870. kfree(cb);
  871. }
  872. /*
  873. * It looks a bit ugly.
  874. * It would be better to create kernel thread.
  875. */
  876. static int netlink_dump(struct sock *sk)
  877. {
  878. struct netlink_sock *nlk = nlk_sk(sk);
  879. struct netlink_callback *cb;
  880. struct sk_buff *skb;
  881. struct nlmsghdr *nlh;
  882. int len;
  883. skb = sock_rmalloc(sk, NLMSG_GOODSIZE, 0, GFP_KERNEL);
  884. if (!skb)
  885. return -ENOBUFS;
  886. spin_lock(&nlk->cb_lock);
  887. cb = nlk->cb;
  888. if (cb == NULL) {
  889. spin_unlock(&nlk->cb_lock);
  890. kfree_skb(skb);
  891. return -EINVAL;
  892. }
  893. len = cb->dump(skb, cb);
  894. if (len > 0) {
  895. spin_unlock(&nlk->cb_lock);
  896. skb_queue_tail(&sk->sk_receive_queue, skb);
  897. sk->sk_data_ready(sk, len);
  898. return 0;
  899. }
  900. nlh = __nlmsg_put(skb, NETLINK_CB(cb->skb).pid, cb->nlh->nlmsg_seq, NLMSG_DONE, sizeof(int));
  901. nlh->nlmsg_flags |= NLM_F_MULTI;
  902. memcpy(NLMSG_DATA(nlh), &len, sizeof(len));
  903. skb_queue_tail(&sk->sk_receive_queue, skb);
  904. sk->sk_data_ready(sk, skb->len);
  905. cb->done(cb);
  906. nlk->cb = NULL;
  907. spin_unlock(&nlk->cb_lock);
  908. netlink_destroy_callback(cb);
  909. __sock_put(sk);
  910. return 0;
  911. }
  912. int netlink_dump_start(struct sock *ssk, struct sk_buff *skb,
  913. struct nlmsghdr *nlh,
  914. int (*dump)(struct sk_buff *skb, struct netlink_callback*),
  915. int (*done)(struct netlink_callback*))
  916. {
  917. struct netlink_callback *cb;
  918. struct sock *sk;
  919. struct netlink_sock *nlk;
  920. cb = kmalloc(sizeof(*cb), GFP_KERNEL);
  921. if (cb == NULL)
  922. return -ENOBUFS;
  923. memset(cb, 0, sizeof(*cb));
  924. cb->dump = dump;
  925. cb->done = done;
  926. cb->nlh = nlh;
  927. atomic_inc(&skb->users);
  928. cb->skb = skb;
  929. sk = netlink_lookup(ssk->sk_protocol, NETLINK_CB(skb).pid);
  930. if (sk == NULL) {
  931. netlink_destroy_callback(cb);
  932. return -ECONNREFUSED;
  933. }
  934. nlk = nlk_sk(sk);
  935. /* A dump is in progress... */
  936. spin_lock(&nlk->cb_lock);
  937. if (nlk->cb) {
  938. spin_unlock(&nlk->cb_lock);
  939. netlink_destroy_callback(cb);
  940. sock_put(sk);
  941. return -EBUSY;
  942. }
  943. nlk->cb = cb;
  944. sock_hold(sk);
  945. spin_unlock(&nlk->cb_lock);
  946. netlink_dump(sk);
  947. sock_put(sk);
  948. return 0;
  949. }
  950. void netlink_ack(struct sk_buff *in_skb, struct nlmsghdr *nlh, int err)
  951. {
  952. struct sk_buff *skb;
  953. struct nlmsghdr *rep;
  954. struct nlmsgerr *errmsg;
  955. int size;
  956. if (err == 0)
  957. size = NLMSG_SPACE(sizeof(struct nlmsgerr));
  958. else
  959. size = NLMSG_SPACE(4 + NLMSG_ALIGN(nlh->nlmsg_len));
  960. skb = alloc_skb(size, GFP_KERNEL);
  961. if (!skb) {
  962. struct sock *sk;
  963. sk = netlink_lookup(in_skb->sk->sk_protocol,
  964. NETLINK_CB(in_skb).pid);
  965. if (sk) {
  966. sk->sk_err = ENOBUFS;
  967. sk->sk_error_report(sk);
  968. sock_put(sk);
  969. }
  970. return;
  971. }
  972. rep = __nlmsg_put(skb, NETLINK_CB(in_skb).pid, nlh->nlmsg_seq,
  973. NLMSG_ERROR, sizeof(struct nlmsgerr));
  974. errmsg = NLMSG_DATA(rep);
  975. errmsg->error = err;
  976. memcpy(&errmsg->msg, nlh, err ? nlh->nlmsg_len : sizeof(struct nlmsghdr));
  977. netlink_unicast(in_skb->sk, skb, NETLINK_CB(in_skb).pid, MSG_DONTWAIT);
  978. }
  979. #ifdef CONFIG_PROC_FS
  980. struct nl_seq_iter {
  981. int link;
  982. int hash_idx;
  983. };
  984. static struct sock *netlink_seq_socket_idx(struct seq_file *seq, loff_t pos)
  985. {
  986. struct nl_seq_iter *iter = seq->private;
  987. int i, j;
  988. struct sock *s;
  989. struct hlist_node *node;
  990. loff_t off = 0;
  991. for (i=0; i<MAX_LINKS; i++) {
  992. struct nl_pid_hash *hash = &nl_table[i].hash;
  993. for (j = 0; j <= hash->mask; j++) {
  994. sk_for_each(s, node, &hash->table[j]) {
  995. if (off == pos) {
  996. iter->link = i;
  997. iter->hash_idx = j;
  998. return s;
  999. }
  1000. ++off;
  1001. }
  1002. }
  1003. }
  1004. return NULL;
  1005. }
  1006. static void *netlink_seq_start(struct seq_file *seq, loff_t *pos)
  1007. {
  1008. read_lock(&nl_table_lock);
  1009. return *pos ? netlink_seq_socket_idx(seq, *pos - 1) : SEQ_START_TOKEN;
  1010. }
  1011. static void *netlink_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  1012. {
  1013. struct sock *s;
  1014. struct nl_seq_iter *iter;
  1015. int i, j;
  1016. ++*pos;
  1017. if (v == SEQ_START_TOKEN)
  1018. return netlink_seq_socket_idx(seq, 0);
  1019. s = sk_next(v);
  1020. if (s)
  1021. return s;
  1022. iter = seq->private;
  1023. i = iter->link;
  1024. j = iter->hash_idx + 1;
  1025. do {
  1026. struct nl_pid_hash *hash = &nl_table[i].hash;
  1027. for (; j <= hash->mask; j++) {
  1028. s = sk_head(&hash->table[j]);
  1029. if (s) {
  1030. iter->link = i;
  1031. iter->hash_idx = j;
  1032. return s;
  1033. }
  1034. }
  1035. j = 0;
  1036. } while (++i < MAX_LINKS);
  1037. return NULL;
  1038. }
  1039. static void netlink_seq_stop(struct seq_file *seq, void *v)
  1040. {
  1041. read_unlock(&nl_table_lock);
  1042. }
  1043. static int netlink_seq_show(struct seq_file *seq, void *v)
  1044. {
  1045. if (v == SEQ_START_TOKEN)
  1046. seq_puts(seq,
  1047. "sk Eth Pid Groups "
  1048. "Rmem Wmem Dump Locks\n");
  1049. else {
  1050. struct sock *s = v;
  1051. struct netlink_sock *nlk = nlk_sk(s);
  1052. seq_printf(seq, "%p %-3d %-6d %08x %-8d %-8d %p %d\n",
  1053. s,
  1054. s->sk_protocol,
  1055. nlk->pid,
  1056. nlk->groups,
  1057. atomic_read(&s->sk_rmem_alloc),
  1058. atomic_read(&s->sk_wmem_alloc),
  1059. nlk->cb,
  1060. atomic_read(&s->sk_refcnt)
  1061. );
  1062. }
  1063. return 0;
  1064. }
  1065. static struct seq_operations netlink_seq_ops = {
  1066. .start = netlink_seq_start,
  1067. .next = netlink_seq_next,
  1068. .stop = netlink_seq_stop,
  1069. .show = netlink_seq_show,
  1070. };
  1071. static int netlink_seq_open(struct inode *inode, struct file *file)
  1072. {
  1073. struct seq_file *seq;
  1074. struct nl_seq_iter *iter;
  1075. int err;
  1076. iter = kmalloc(sizeof(*iter), GFP_KERNEL);
  1077. if (!iter)
  1078. return -ENOMEM;
  1079. err = seq_open(file, &netlink_seq_ops);
  1080. if (err) {
  1081. kfree(iter);
  1082. return err;
  1083. }
  1084. memset(iter, 0, sizeof(*iter));
  1085. seq = file->private_data;
  1086. seq->private = iter;
  1087. return 0;
  1088. }
  1089. static struct file_operations netlink_seq_fops = {
  1090. .owner = THIS_MODULE,
  1091. .open = netlink_seq_open,
  1092. .read = seq_read,
  1093. .llseek = seq_lseek,
  1094. .release = seq_release_private,
  1095. };
  1096. #endif
  1097. int netlink_register_notifier(struct notifier_block *nb)
  1098. {
  1099. return notifier_chain_register(&netlink_chain, nb);
  1100. }
  1101. int netlink_unregister_notifier(struct notifier_block *nb)
  1102. {
  1103. return notifier_chain_unregister(&netlink_chain, nb);
  1104. }
  1105. static struct proto_ops netlink_ops = {
  1106. .family = PF_NETLINK,
  1107. .owner = THIS_MODULE,
  1108. .release = netlink_release,
  1109. .bind = netlink_bind,
  1110. .connect = netlink_connect,
  1111. .socketpair = sock_no_socketpair,
  1112. .accept = sock_no_accept,
  1113. .getname = netlink_getname,
  1114. .poll = datagram_poll,
  1115. .ioctl = sock_no_ioctl,
  1116. .listen = sock_no_listen,
  1117. .shutdown = sock_no_shutdown,
  1118. .setsockopt = sock_no_setsockopt,
  1119. .getsockopt = sock_no_getsockopt,
  1120. .sendmsg = netlink_sendmsg,
  1121. .recvmsg = netlink_recvmsg,
  1122. .mmap = sock_no_mmap,
  1123. .sendpage = sock_no_sendpage,
  1124. };
  1125. static struct net_proto_family netlink_family_ops = {
  1126. .family = PF_NETLINK,
  1127. .create = netlink_create,
  1128. .owner = THIS_MODULE, /* for consistency 8) */
  1129. };
  1130. extern void netlink_skb_parms_too_large(void);
  1131. static int __init netlink_proto_init(void)
  1132. {
  1133. struct sk_buff *dummy_skb;
  1134. int i;
  1135. unsigned long max;
  1136. unsigned int order;
  1137. int err = proto_register(&netlink_proto, 0);
  1138. if (err != 0)
  1139. goto out;
  1140. if (sizeof(struct netlink_skb_parms) > sizeof(dummy_skb->cb))
  1141. netlink_skb_parms_too_large();
  1142. nl_table = kmalloc(sizeof(*nl_table) * MAX_LINKS, GFP_KERNEL);
  1143. if (!nl_table) {
  1144. enomem:
  1145. printk(KERN_CRIT "netlink_init: Cannot allocate nl_table\n");
  1146. return -ENOMEM;
  1147. }
  1148. memset(nl_table, 0, sizeof(*nl_table) * MAX_LINKS);
  1149. if (num_physpages >= (128 * 1024))
  1150. max = num_physpages >> (21 - PAGE_SHIFT);
  1151. else
  1152. max = num_physpages >> (23 - PAGE_SHIFT);
  1153. order = get_bitmask_order(max) - 1 + PAGE_SHIFT;
  1154. max = (1UL << order) / sizeof(struct hlist_head);
  1155. order = get_bitmask_order(max > UINT_MAX ? UINT_MAX : max) - 1;
  1156. for (i = 0; i < MAX_LINKS; i++) {
  1157. struct nl_pid_hash *hash = &nl_table[i].hash;
  1158. hash->table = nl_pid_hash_alloc(1 * sizeof(*hash->table));
  1159. if (!hash->table) {
  1160. while (i-- > 0)
  1161. nl_pid_hash_free(nl_table[i].hash.table,
  1162. 1 * sizeof(*hash->table));
  1163. kfree(nl_table);
  1164. goto enomem;
  1165. }
  1166. memset(hash->table, 0, 1 * sizeof(*hash->table));
  1167. hash->max_shift = order;
  1168. hash->shift = 0;
  1169. hash->mask = 0;
  1170. hash->rehash_time = jiffies;
  1171. }
  1172. sock_register(&netlink_family_ops);
  1173. #ifdef CONFIG_PROC_FS
  1174. proc_net_fops_create("netlink", 0, &netlink_seq_fops);
  1175. #endif
  1176. /* The netlink device handler may be needed early. */
  1177. rtnetlink_init();
  1178. out:
  1179. return err;
  1180. }
  1181. static void __exit netlink_proto_exit(void)
  1182. {
  1183. sock_unregister(PF_NETLINK);
  1184. proc_net_remove("netlink");
  1185. kfree(nl_table);
  1186. nl_table = NULL;
  1187. proto_unregister(&netlink_proto);
  1188. }
  1189. core_initcall(netlink_proto_init);
  1190. module_exit(netlink_proto_exit);
  1191. MODULE_LICENSE("GPL");
  1192. MODULE_ALIAS_NETPROTO(PF_NETLINK);
  1193. EXPORT_SYMBOL(netlink_ack);
  1194. EXPORT_SYMBOL(netlink_broadcast);
  1195. EXPORT_SYMBOL(netlink_dump_start);
  1196. EXPORT_SYMBOL(netlink_kernel_create);
  1197. EXPORT_SYMBOL(netlink_register_notifier);
  1198. EXPORT_SYMBOL(netlink_set_err);
  1199. EXPORT_SYMBOL(netlink_set_nonroot);
  1200. EXPORT_SYMBOL(netlink_unicast);
  1201. EXPORT_SYMBOL(netlink_unregister_notifier);