ax25_uid.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208
  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 <linux/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/sysctl.h>
  37. #include <linux/export.h>
  38. #include <net/ip.h>
  39. #include <net/arp.h>
  40. /*
  41. * Callsign/UID mapper. This is in kernel space for security on multi-amateur machines.
  42. */
  43. static HLIST_HEAD(ax25_uid_list);
  44. static DEFINE_RWLOCK(ax25_uid_lock);
  45. int ax25_uid_policy;
  46. EXPORT_SYMBOL(ax25_uid_policy);
  47. ax25_uid_assoc *ax25_findbyuid(kuid_t uid)
  48. {
  49. ax25_uid_assoc *ax25_uid, *res = NULL;
  50. read_lock(&ax25_uid_lock);
  51. ax25_uid_for_each(ax25_uid, &ax25_uid_list) {
  52. if (uid_eq(ax25_uid->uid, uid)) {
  53. ax25_uid_hold(ax25_uid);
  54. res = ax25_uid;
  55. break;
  56. }
  57. }
  58. read_unlock(&ax25_uid_lock);
  59. return res;
  60. }
  61. EXPORT_SYMBOL(ax25_findbyuid);
  62. int ax25_uid_ioctl(int cmd, struct sockaddr_ax25 *sax)
  63. {
  64. ax25_uid_assoc *ax25_uid;
  65. ax25_uid_assoc *user;
  66. unsigned long res;
  67. switch (cmd) {
  68. case SIOCAX25GETUID:
  69. res = -ENOENT;
  70. read_lock(&ax25_uid_lock);
  71. ax25_uid_for_each(ax25_uid, &ax25_uid_list) {
  72. if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0) {
  73. res = from_kuid_munged(current_user_ns(), ax25_uid->uid);
  74. break;
  75. }
  76. }
  77. read_unlock(&ax25_uid_lock);
  78. return res;
  79. case SIOCAX25ADDUID:
  80. {
  81. kuid_t sax25_kuid;
  82. if (!capable(CAP_NET_ADMIN))
  83. return -EPERM;
  84. sax25_kuid = make_kuid(current_user_ns(), sax->sax25_uid);
  85. if (!uid_valid(sax25_kuid))
  86. return -EINVAL;
  87. user = ax25_findbyuid(sax25_kuid);
  88. if (user) {
  89. ax25_uid_put(user);
  90. return -EEXIST;
  91. }
  92. if (sax->sax25_uid == 0)
  93. return -EINVAL;
  94. if ((ax25_uid = kmalloc(sizeof(*ax25_uid), GFP_KERNEL)) == NULL)
  95. return -ENOMEM;
  96. refcount_set(&ax25_uid->refcount, 1);
  97. ax25_uid->uid = sax25_kuid;
  98. ax25_uid->call = sax->sax25_call;
  99. write_lock(&ax25_uid_lock);
  100. hlist_add_head(&ax25_uid->uid_node, &ax25_uid_list);
  101. write_unlock(&ax25_uid_lock);
  102. return 0;
  103. }
  104. case SIOCAX25DELUID:
  105. if (!capable(CAP_NET_ADMIN))
  106. return -EPERM;
  107. ax25_uid = NULL;
  108. write_lock(&ax25_uid_lock);
  109. ax25_uid_for_each(ax25_uid, &ax25_uid_list) {
  110. if (ax25cmp(&sax->sax25_call, &ax25_uid->call) == 0)
  111. break;
  112. }
  113. if (ax25_uid == NULL) {
  114. write_unlock(&ax25_uid_lock);
  115. return -ENOENT;
  116. }
  117. hlist_del_init(&ax25_uid->uid_node);
  118. ax25_uid_put(ax25_uid);
  119. write_unlock(&ax25_uid_lock);
  120. return 0;
  121. default:
  122. return -EINVAL;
  123. }
  124. return -EINVAL; /*NOTREACHED */
  125. }
  126. #ifdef CONFIG_PROC_FS
  127. static void *ax25_uid_seq_start(struct seq_file *seq, loff_t *pos)
  128. __acquires(ax25_uid_lock)
  129. {
  130. read_lock(&ax25_uid_lock);
  131. return seq_hlist_start_head(&ax25_uid_list, *pos);
  132. }
  133. static void *ax25_uid_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  134. {
  135. return seq_hlist_next(v, &ax25_uid_list, pos);
  136. }
  137. static void ax25_uid_seq_stop(struct seq_file *seq, void *v)
  138. __releases(ax25_uid_lock)
  139. {
  140. read_unlock(&ax25_uid_lock);
  141. }
  142. static int ax25_uid_seq_show(struct seq_file *seq, void *v)
  143. {
  144. char buf[11];
  145. if (v == SEQ_START_TOKEN)
  146. seq_printf(seq, "Policy: %d\n", ax25_uid_policy);
  147. else {
  148. struct ax25_uid_assoc *pt;
  149. pt = hlist_entry(v, struct ax25_uid_assoc, uid_node);
  150. seq_printf(seq, "%6d %s\n",
  151. from_kuid_munged(seq_user_ns(seq), pt->uid),
  152. ax2asc(buf, &pt->call));
  153. }
  154. return 0;
  155. }
  156. const struct seq_operations ax25_uid_seqops = {
  157. .start = ax25_uid_seq_start,
  158. .next = ax25_uid_seq_next,
  159. .stop = ax25_uid_seq_stop,
  160. .show = ax25_uid_seq_show,
  161. };
  162. #endif
  163. /*
  164. * Free all memory associated with UID/Callsign structures.
  165. */
  166. void __exit ax25_uid_free(void)
  167. {
  168. ax25_uid_assoc *ax25_uid;
  169. write_lock(&ax25_uid_lock);
  170. again:
  171. ax25_uid_for_each(ax25_uid, &ax25_uid_list) {
  172. hlist_del_init(&ax25_uid->uid_node);
  173. ax25_uid_put(ax25_uid);
  174. goto again;
  175. }
  176. write_unlock(&ax25_uid_lock);
  177. }