ax25_uid.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225
  1. /*
  2. * This program is free software; you can redistribute it and/or modify
  3. * it under the terms of the GNU General Public License as published by
  4. * the Free Software Foundation; either version 2 of the License, or
  5. * (at your option) any later version.
  6. *
  7. * Copyright (C) Jonathan Naylor G4KLX (g4klx@g4klx.demon.co.uk)
  8. */
  9. #include <linux/capability.h>
  10. #include <linux/errno.h>
  11. #include <linux/types.h>
  12. #include <linux/socket.h>
  13. #include <linux/in.h>
  14. #include <linux/kernel.h>
  15. #include <linux/timer.h>
  16. #include <linux/string.h>
  17. #include <linux/sockios.h>
  18. #include <linux/net.h>
  19. #include <linux/spinlock.h>
  20. #include <linux/slab.h>
  21. #include <net/ax25.h>
  22. #include <linux/inet.h>
  23. #include <linux/netdevice.h>
  24. #include <linux/if_arp.h>
  25. #include <linux/skbuff.h>
  26. #include <net/sock.h>
  27. #include <asm/uaccess.h>
  28. #include <linux/fcntl.h>
  29. #include <linux/mm.h>
  30. #include <linux/interrupt.h>
  31. #include <linux/list.h>
  32. #include <linux/notifier.h>
  33. #include <linux/proc_fs.h>
  34. #include <linux/seq_file.h>
  35. #include <linux/stat.h>
  36. #include <linux/netfilter.h>
  37. #include <linux/sysctl.h>
  38. #include <linux/export.h>
  39. #include <net/ip.h>
  40. #include <net/arp.h>
  41. /*
  42. * Callsign/UID mapper. This is in kernel space for security on multi-amateur machines.
  43. */
  44. static HLIST_HEAD(ax25_uid_list);
  45. static DEFINE_RWLOCK(ax25_uid_lock);
  46. int ax25_uid_policy;
  47. EXPORT_SYMBOL(ax25_uid_policy);
  48. ax25_uid_assoc *ax25_findbyuid(kuid_t uid)
  49. {
  50. ax25_uid_assoc *ax25_uid, *res = NULL;
  51. struct hlist_node *node;
  52. read_lock(&ax25_uid_lock);
  53. ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
  54. if (uid_eq(ax25_uid->uid, uid)) {
  55. ax25_uid_hold(ax25_uid);
  56. res = ax25_uid;
  57. break;
  58. }
  59. }
  60. read_unlock(&ax25_uid_lock);
  61. return res;
  62. }
  63. EXPORT_SYMBOL(ax25_findbyuid);
  64. int ax25_uid_ioctl(int cmd, struct sockaddr_ax25 *sax)
  65. {
  66. ax25_uid_assoc *ax25_uid;
  67. struct hlist_node *node;
  68. ax25_uid_assoc *user;
  69. unsigned long res;
  70. switch (cmd) {
  71. case SIOCAX25GETUID:
  72. res = -ENOENT;
  73. read_lock(&ax25_uid_lock);
  74. ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
  75. if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0) {
  76. res = from_kuid_munged(current_user_ns(), ax25_uid->uid);
  77. break;
  78. }
  79. }
  80. read_unlock(&ax25_uid_lock);
  81. return res;
  82. case SIOCAX25ADDUID:
  83. {
  84. kuid_t sax25_kuid;
  85. if (!capable(CAP_NET_ADMIN))
  86. return -EPERM;
  87. sax25_kuid = make_kuid(current_user_ns(), sax->sax25_uid);
  88. if (!uid_valid(sax25_kuid))
  89. return -EINVAL;
  90. user = ax25_findbyuid(sax25_kuid);
  91. if (user) {
  92. ax25_uid_put(user);
  93. return -EEXIST;
  94. }
  95. if (sax->sax25_uid == 0)
  96. return -EINVAL;
  97. if ((ax25_uid = kmalloc(sizeof(*ax25_uid), GFP_KERNEL)) == NULL)
  98. return -ENOMEM;
  99. atomic_set(&ax25_uid->refcount, 1);
  100. ax25_uid->uid = sax25_kuid;
  101. ax25_uid->call = sax->sax25_call;
  102. write_lock(&ax25_uid_lock);
  103. hlist_add_head(&ax25_uid->uid_node, &ax25_uid_list);
  104. write_unlock(&ax25_uid_lock);
  105. return 0;
  106. }
  107. case SIOCAX25DELUID:
  108. if (!capable(CAP_NET_ADMIN))
  109. return -EPERM;
  110. ax25_uid = NULL;
  111. write_lock(&ax25_uid_lock);
  112. ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
  113. if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0)
  114. break;
  115. }
  116. if (ax25_uid == NULL) {
  117. write_unlock(&ax25_uid_lock);
  118. return -ENOENT;
  119. }
  120. hlist_del_init(&ax25_uid->uid_node);
  121. ax25_uid_put(ax25_uid);
  122. write_unlock(&ax25_uid_lock);
  123. return 0;
  124. default:
  125. return -EINVAL;
  126. }
  127. return -EINVAL; /*NOTREACHED */
  128. }
  129. #ifdef CONFIG_PROC_FS
  130. static void *ax25_uid_seq_start(struct seq_file *seq, loff_t *pos)
  131. __acquires(ax25_uid_lock)
  132. {
  133. read_lock(&ax25_uid_lock);
  134. return seq_hlist_start_head(&ax25_uid_list, *pos);
  135. }
  136. static void *ax25_uid_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  137. {
  138. return seq_hlist_next(v, &ax25_uid_list, pos);
  139. }
  140. static void ax25_uid_seq_stop(struct seq_file *seq, void *v)
  141. __releases(ax25_uid_lock)
  142. {
  143. read_unlock(&ax25_uid_lock);
  144. }
  145. static int ax25_uid_seq_show(struct seq_file *seq, void *v)
  146. {
  147. char buf[11];
  148. if (v == SEQ_START_TOKEN)
  149. seq_printf(seq, "Policy: %d\n", ax25_uid_policy);
  150. else {
  151. struct ax25_uid_assoc *pt;
  152. pt = hlist_entry(v, struct ax25_uid_assoc, uid_node);
  153. seq_printf(seq, "%6d %s\n",
  154. from_kuid_munged(seq_user_ns(seq), pt->uid),
  155. ax2asc(buf, &pt->call));
  156. }
  157. return 0;
  158. }
  159. static const struct seq_operations ax25_uid_seqops = {
  160. .start = ax25_uid_seq_start,
  161. .next = ax25_uid_seq_next,
  162. .stop = ax25_uid_seq_stop,
  163. .show = ax25_uid_seq_show,
  164. };
  165. static int ax25_uid_info_open(struct inode *inode, struct file *file)
  166. {
  167. return seq_open(file, &ax25_uid_seqops);
  168. }
  169. const struct file_operations ax25_uid_fops = {
  170. .owner = THIS_MODULE,
  171. .open = ax25_uid_info_open,
  172. .read = seq_read,
  173. .llseek = seq_lseek,
  174. .release = seq_release,
  175. };
  176. #endif
  177. /*
  178. * Free all memory associated with UID/Callsign structures.
  179. */
  180. void __exit ax25_uid_free(void)
  181. {
  182. ax25_uid_assoc *ax25_uid;
  183. struct hlist_node *node;
  184. write_lock(&ax25_uid_lock);
  185. again:
  186. ax25_uid_for_each(ax25_uid, node, &ax25_uid_list) {
  187. hlist_del_init(&ax25_uid->uid_node);
  188. ax25_uid_put(ax25_uid);
  189. goto again;
  190. }
  191. write_unlock(&ax25_uid_lock);
  192. }