ax25_addr.c 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307
  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/errno.h>
  10. #include <linux/types.h>
  11. #include <linux/socket.h>
  12. #include <linux/in.h>
  13. #include <linux/kernel.h>
  14. #include <linux/module.h>
  15. #include <linux/timer.h>
  16. #include <linux/string.h>
  17. #include <linux/sockios.h>
  18. #include <linux/net.h>
  19. #include <net/ax25.h>
  20. #include <linux/inet.h>
  21. #include <linux/netdevice.h>
  22. #include <linux/skbuff.h>
  23. #include <net/sock.h>
  24. #include <asm/uaccess.h>
  25. #include <linux/fcntl.h>
  26. #include <linux/mm.h>
  27. #include <linux/interrupt.h>
  28. /*
  29. * The default broadcast address of an interface is QST-0; the default address
  30. * is LINUX-1. The null address is defined as a callsign of all spaces with
  31. * an SSID of zero.
  32. */
  33. const ax25_address ax25_bcast =
  34. {{'Q' << 1, 'S' << 1, 'T' << 1, ' ' << 1, ' ' << 1, ' ' << 1, 0 << 1}};
  35. const ax25_address ax25_defaddr =
  36. {{'L' << 1, 'I' << 1, 'N' << 1, 'U' << 1, 'X' << 1, ' ' << 1, 1 << 1}};
  37. const ax25_address null_ax25_address =
  38. {{' ' << 1, ' ' << 1, ' ' << 1, ' ' << 1, ' ' << 1, ' ' << 1, 0 << 1}};
  39. EXPORT_SYMBOL_GPL(ax25_bcast);
  40. EXPORT_SYMBOL_GPL(ax25_defaddr);
  41. EXPORT_SYMBOL(null_ax25_address);
  42. /*
  43. * ax25 -> ascii conversion
  44. */
  45. char *ax2asc(char *buf, const ax25_address *a)
  46. {
  47. char c, *s;
  48. int n;
  49. for (n = 0, s = buf; n < 6; n++) {
  50. c = (a->ax25_call[n] >> 1) & 0x7F;
  51. if (c != ' ') *s++ = c;
  52. }
  53. *s++ = '-';
  54. if ((n = ((a->ax25_call[6] >> 1) & 0x0F)) > 9) {
  55. *s++ = '1';
  56. n -= 10;
  57. }
  58. *s++ = n + '0';
  59. *s++ = '\0';
  60. if (*buf == '\0' || *buf == '-')
  61. return "*";
  62. return buf;
  63. }
  64. EXPORT_SYMBOL(ax2asc);
  65. /*
  66. * ascii -> ax25 conversion
  67. */
  68. void asc2ax(ax25_address *addr, const char *callsign)
  69. {
  70. const char *s;
  71. int n;
  72. for (s = callsign, n = 0; n < 6; n++) {
  73. if (*s != '\0' && *s != '-')
  74. addr->ax25_call[n] = *s++;
  75. else
  76. addr->ax25_call[n] = ' ';
  77. addr->ax25_call[n] <<= 1;
  78. addr->ax25_call[n] &= 0xFE;
  79. }
  80. if (*s++ == '\0') {
  81. addr->ax25_call[6] = 0x00;
  82. return;
  83. }
  84. addr->ax25_call[6] = *s++ - '0';
  85. if (*s != '\0') {
  86. addr->ax25_call[6] *= 10;
  87. addr->ax25_call[6] += *s++ - '0';
  88. }
  89. addr->ax25_call[6] <<= 1;
  90. addr->ax25_call[6] &= 0x1E;
  91. }
  92. EXPORT_SYMBOL(asc2ax);
  93. /*
  94. * Compare two ax.25 addresses
  95. */
  96. int ax25cmp(const ax25_address *a, const ax25_address *b)
  97. {
  98. int ct = 0;
  99. while (ct < 6) {
  100. if ((a->ax25_call[ct] & 0xFE) != (b->ax25_call[ct] & 0xFE)) /* Clean off repeater bits */
  101. return 1;
  102. ct++;
  103. }
  104. if ((a->ax25_call[ct] & 0x1E) == (b->ax25_call[ct] & 0x1E)) /* SSID without control bit */
  105. return 0;
  106. return 2; /* Partial match */
  107. }
  108. EXPORT_SYMBOL(ax25cmp);
  109. /*
  110. * Compare two AX.25 digipeater paths.
  111. */
  112. int ax25digicmp(const ax25_digi *digi1, const ax25_digi *digi2)
  113. {
  114. int i;
  115. if (digi1->ndigi != digi2->ndigi)
  116. return 1;
  117. if (digi1->lastrepeat != digi2->lastrepeat)
  118. return 1;
  119. for (i = 0; i < digi1->ndigi; i++)
  120. if (ax25cmp(&digi1->calls[i], &digi2->calls[i]) != 0)
  121. return 1;
  122. return 0;
  123. }
  124. /*
  125. * Given an AX.25 address pull of to, from, digi list, command/response and the start of data
  126. *
  127. */
  128. const unsigned char *ax25_addr_parse(const unsigned char *buf, int len,
  129. ax25_address *src, ax25_address *dest, ax25_digi *digi, int *flags,
  130. int *dama)
  131. {
  132. int d = 0;
  133. if (len < 14) return NULL;
  134. if (flags != NULL) {
  135. *flags = 0;
  136. if (buf[6] & AX25_CBIT)
  137. *flags = AX25_COMMAND;
  138. if (buf[13] & AX25_CBIT)
  139. *flags = AX25_RESPONSE;
  140. }
  141. if (dama != NULL)
  142. *dama = ~buf[13] & AX25_DAMA_FLAG;
  143. /* Copy to, from */
  144. if (dest != NULL)
  145. memcpy(dest, buf + 0, AX25_ADDR_LEN);
  146. if (src != NULL)
  147. memcpy(src, buf + 7, AX25_ADDR_LEN);
  148. buf += 2 * AX25_ADDR_LEN;
  149. len -= 2 * AX25_ADDR_LEN;
  150. digi->lastrepeat = -1;
  151. digi->ndigi = 0;
  152. while (!(buf[-1] & AX25_EBIT)) {
  153. if (d >= AX25_MAX_DIGIS)
  154. return NULL;
  155. if (len < AX25_ADDR_LEN)
  156. return NULL;
  157. memcpy(&digi->calls[d], buf, AX25_ADDR_LEN);
  158. digi->ndigi = d + 1;
  159. if (buf[6] & AX25_HBIT) {
  160. digi->repeated[d] = 1;
  161. digi->lastrepeat = d;
  162. } else {
  163. digi->repeated[d] = 0;
  164. }
  165. buf += AX25_ADDR_LEN;
  166. len -= AX25_ADDR_LEN;
  167. d++;
  168. }
  169. return buf;
  170. }
  171. /*
  172. * Assemble an AX.25 header from the bits
  173. */
  174. int ax25_addr_build(unsigned char *buf, const ax25_address *src,
  175. const ax25_address *dest, const ax25_digi *d, int flag, int modulus)
  176. {
  177. int len = 0;
  178. int ct = 0;
  179. memcpy(buf, dest, AX25_ADDR_LEN);
  180. buf[6] &= ~(AX25_EBIT | AX25_CBIT);
  181. buf[6] |= AX25_SSSID_SPARE;
  182. if (flag == AX25_COMMAND) buf[6] |= AX25_CBIT;
  183. buf += AX25_ADDR_LEN;
  184. len += AX25_ADDR_LEN;
  185. memcpy(buf, src, AX25_ADDR_LEN);
  186. buf[6] &= ~(AX25_EBIT | AX25_CBIT);
  187. buf[6] &= ~AX25_SSSID_SPARE;
  188. if (modulus == AX25_MODULUS)
  189. buf[6] |= AX25_SSSID_SPARE;
  190. else
  191. buf[6] |= AX25_ESSID_SPARE;
  192. if (flag == AX25_RESPONSE) buf[6] |= AX25_CBIT;
  193. /*
  194. * Fast path the normal digiless path
  195. */
  196. if (d == NULL || d->ndigi == 0) {
  197. buf[6] |= AX25_EBIT;
  198. return 2 * AX25_ADDR_LEN;
  199. }
  200. buf += AX25_ADDR_LEN;
  201. len += AX25_ADDR_LEN;
  202. while (ct < d->ndigi) {
  203. memcpy(buf, &d->calls[ct], AX25_ADDR_LEN);
  204. if (d->repeated[ct])
  205. buf[6] |= AX25_HBIT;
  206. else
  207. buf[6] &= ~AX25_HBIT;
  208. buf[6] &= ~AX25_EBIT;
  209. buf[6] |= AX25_SSSID_SPARE;
  210. buf += AX25_ADDR_LEN;
  211. len += AX25_ADDR_LEN;
  212. ct++;
  213. }
  214. buf[-1] |= AX25_EBIT;
  215. return len;
  216. }
  217. int ax25_addr_size(const ax25_digi *dp)
  218. {
  219. if (dp == NULL)
  220. return 2 * AX25_ADDR_LEN;
  221. return AX25_ADDR_LEN * (2 + dp->ndigi);
  222. }
  223. /*
  224. * Reverse Digipeat List. May not pass both parameters as same struct
  225. */
  226. void ax25_digi_invert(const ax25_digi *in, ax25_digi *out)
  227. {
  228. int ct;
  229. out->ndigi = in->ndigi;
  230. out->lastrepeat = in->ndigi - in->lastrepeat - 2;
  231. /* Invert the digipeaters */
  232. for (ct = 0; ct < in->ndigi; ct++) {
  233. out->calls[ct] = in->calls[in->ndigi - ct - 1];
  234. if (ct <= out->lastrepeat) {
  235. out->calls[ct].ax25_call[6] |= AX25_HBIT;
  236. out->repeated[ct] = 1;
  237. } else {
  238. out->calls[ct].ax25_call[6] &= ~AX25_HBIT;
  239. out->repeated[ct] = 0;
  240. }
  241. }
  242. }