ax25_addr.c 5.5 KB

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