x25_subr.c 9.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374
  1. /*
  2. * X.25 Packet Layer release 002
  3. *
  4. * This is ALPHA test software. This code may break your machine,
  5. * randomly fail to work with new releases, misbehave and/or generally
  6. * screw up. It might even work.
  7. *
  8. * This code REQUIRES 2.1.15 or higher
  9. *
  10. * This module:
  11. * This module is free software; you can redistribute it and/or
  12. * modify it under the terms of the GNU General Public License
  13. * as published by the Free Software Foundation; either version
  14. * 2 of the License, or (at your option) any later version.
  15. *
  16. * History
  17. * X.25 001 Jonathan Naylor Started coding.
  18. * X.25 002 Jonathan Naylor Centralised disconnection processing.
  19. * mar/20/00 Daniela Squassoni Disabling/enabling of facilities
  20. * negotiation.
  21. * jun/24/01 Arnaldo C. Melo use skb_queue_purge, cleanups
  22. */
  23. #include <linux/kernel.h>
  24. #include <linux/string.h>
  25. #include <linux/skbuff.h>
  26. #include <net/sock.h>
  27. #include <net/tcp.h>
  28. #include <net/x25.h>
  29. /*
  30. * This routine purges all of the queues of frames.
  31. */
  32. void x25_clear_queues(struct sock *sk)
  33. {
  34. struct x25_sock *x25 = x25_sk(sk);
  35. skb_queue_purge(&sk->sk_write_queue);
  36. skb_queue_purge(&x25->ack_queue);
  37. skb_queue_purge(&x25->interrupt_in_queue);
  38. skb_queue_purge(&x25->interrupt_out_queue);
  39. skb_queue_purge(&x25->fragment_queue);
  40. }
  41. /*
  42. * This routine purges the input queue of those frames that have been
  43. * acknowledged. This replaces the boxes labelled "V(a) <- N(r)" on the
  44. * SDL diagram.
  45. */
  46. void x25_frames_acked(struct sock *sk, unsigned short nr)
  47. {
  48. struct sk_buff *skb;
  49. struct x25_sock *x25 = x25_sk(sk);
  50. int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS;
  51. /*
  52. * Remove all the ack-ed frames from the ack queue.
  53. */
  54. if (x25->va != nr)
  55. while (skb_peek(&x25->ack_queue) && x25->va != nr) {
  56. skb = skb_dequeue(&x25->ack_queue);
  57. kfree_skb(skb);
  58. x25->va = (x25->va + 1) % modulus;
  59. }
  60. }
  61. void x25_requeue_frames(struct sock *sk)
  62. {
  63. struct sk_buff *skb, *skb_prev = NULL;
  64. /*
  65. * Requeue all the un-ack-ed frames on the output queue to be picked
  66. * up by x25_kick. This arrangement handles the possibility of an empty
  67. * output queue.
  68. */
  69. while ((skb = skb_dequeue(&x25_sk(sk)->ack_queue)) != NULL) {
  70. if (!skb_prev)
  71. skb_queue_head(&sk->sk_write_queue, skb);
  72. else
  73. skb_append(skb_prev, skb);
  74. skb_prev = skb;
  75. }
  76. }
  77. /*
  78. * Validate that the value of nr is between va and vs. Return true or
  79. * false for testing.
  80. */
  81. int x25_validate_nr(struct sock *sk, unsigned short nr)
  82. {
  83. struct x25_sock *x25 = x25_sk(sk);
  84. unsigned short vc = x25->va;
  85. int modulus = x25->neighbour->extended ? X25_EMODULUS : X25_SMODULUS;
  86. while (vc != x25->vs) {
  87. if (nr == vc)
  88. return 1;
  89. vc = (vc + 1) % modulus;
  90. }
  91. return nr == x25->vs ? 1 : 0;
  92. }
  93. /*
  94. * This routine is called when the packet layer internally generates a
  95. * control frame.
  96. */
  97. void x25_write_internal(struct sock *sk, int frametype)
  98. {
  99. struct x25_sock *x25 = x25_sk(sk);
  100. struct sk_buff *skb;
  101. unsigned char *dptr;
  102. unsigned char facilities[X25_MAX_FAC_LEN];
  103. unsigned char addresses[1 + X25_ADDR_LEN];
  104. unsigned char lci1, lci2;
  105. /*
  106. * Default safe frame size.
  107. */
  108. int len = X25_MAX_L2_LEN + X25_EXT_MIN_LEN;
  109. /*
  110. * Adjust frame size.
  111. */
  112. switch (frametype) {
  113. case X25_CALL_REQUEST:
  114. len += 1 + X25_ADDR_LEN + X25_MAX_FAC_LEN +
  115. X25_MAX_CUD_LEN;
  116. break;
  117. case X25_CALL_ACCEPTED:
  118. len += 1 + X25_MAX_FAC_LEN + X25_MAX_CUD_LEN;
  119. break;
  120. case X25_CLEAR_REQUEST:
  121. case X25_RESET_REQUEST:
  122. len += 2;
  123. break;
  124. case X25_RR:
  125. case X25_RNR:
  126. case X25_REJ:
  127. case X25_CLEAR_CONFIRMATION:
  128. case X25_INTERRUPT_CONFIRMATION:
  129. case X25_RESET_CONFIRMATION:
  130. break;
  131. default:
  132. printk(KERN_ERR "X.25: invalid frame type %02X\n",
  133. frametype);
  134. return;
  135. }
  136. if ((skb = alloc_skb(len, GFP_ATOMIC)) == NULL)
  137. return;
  138. /*
  139. * Space for Ethernet and 802.2 LLC headers.
  140. */
  141. skb_reserve(skb, X25_MAX_L2_LEN);
  142. /*
  143. * Make space for the GFI and LCI, and fill them in.
  144. */
  145. dptr = skb_put(skb, 2);
  146. lci1 = (x25->lci >> 8) & 0x0F;
  147. lci2 = (x25->lci >> 0) & 0xFF;
  148. if (x25->neighbour->extended) {
  149. *dptr++ = lci1 | X25_GFI_EXTSEQ;
  150. *dptr++ = lci2;
  151. } else {
  152. *dptr++ = lci1 | X25_GFI_STDSEQ;
  153. *dptr++ = lci2;
  154. }
  155. /*
  156. * Now fill in the frame type specific information.
  157. */
  158. switch (frametype) {
  159. case X25_CALL_REQUEST:
  160. dptr = skb_put(skb, 1);
  161. *dptr++ = X25_CALL_REQUEST;
  162. len = x25_addr_aton(addresses, &x25->dest_addr,
  163. &x25->source_addr);
  164. dptr = skb_put(skb, len);
  165. memcpy(dptr, addresses, len);
  166. len = x25_create_facilities(facilities,
  167. &x25->facilities,
  168. x25->neighbour->global_facil_mask);
  169. dptr = skb_put(skb, len);
  170. memcpy(dptr, facilities, len);
  171. dptr = skb_put(skb, x25->calluserdata.cudlength);
  172. memcpy(dptr, x25->calluserdata.cuddata,
  173. x25->calluserdata.cudlength);
  174. x25->calluserdata.cudlength = 0;
  175. break;
  176. case X25_CALL_ACCEPTED:
  177. dptr = skb_put(skb, 2);
  178. *dptr++ = X25_CALL_ACCEPTED;
  179. *dptr++ = 0x00; /* Address lengths */
  180. len = x25_create_facilities(facilities,
  181. &x25->facilities,
  182. x25->vc_facil_mask);
  183. dptr = skb_put(skb, len);
  184. memcpy(dptr, facilities, len);
  185. dptr = skb_put(skb, x25->calluserdata.cudlength);
  186. memcpy(dptr, x25->calluserdata.cuddata,
  187. x25->calluserdata.cudlength);
  188. x25->calluserdata.cudlength = 0;
  189. break;
  190. case X25_CLEAR_REQUEST:
  191. case X25_RESET_REQUEST:
  192. dptr = skb_put(skb, 3);
  193. *dptr++ = frametype;
  194. *dptr++ = 0x00; /* XXX */
  195. *dptr++ = 0x00; /* XXX */
  196. break;
  197. case X25_RR:
  198. case X25_RNR:
  199. case X25_REJ:
  200. if (x25->neighbour->extended) {
  201. dptr = skb_put(skb, 2);
  202. *dptr++ = frametype;
  203. *dptr++ = (x25->vr << 1) & 0xFE;
  204. } else {
  205. dptr = skb_put(skb, 1);
  206. *dptr = frametype;
  207. *dptr++ |= (x25->vr << 5) & 0xE0;
  208. }
  209. break;
  210. case X25_CLEAR_CONFIRMATION:
  211. case X25_INTERRUPT_CONFIRMATION:
  212. case X25_RESET_CONFIRMATION:
  213. dptr = skb_put(skb, 1);
  214. *dptr = frametype;
  215. break;
  216. }
  217. x25_transmit_link(skb, x25->neighbour);
  218. }
  219. /*
  220. * Unpick the contents of the passed X.25 Packet Layer frame.
  221. */
  222. int x25_decode(struct sock *sk, struct sk_buff *skb, int *ns, int *nr, int *q,
  223. int *d, int *m)
  224. {
  225. struct x25_sock *x25 = x25_sk(sk);
  226. unsigned char *frame = skb->data;
  227. *ns = *nr = *q = *d = *m = 0;
  228. switch (frame[2]) {
  229. case X25_CALL_REQUEST:
  230. case X25_CALL_ACCEPTED:
  231. case X25_CLEAR_REQUEST:
  232. case X25_CLEAR_CONFIRMATION:
  233. case X25_INTERRUPT:
  234. case X25_INTERRUPT_CONFIRMATION:
  235. case X25_RESET_REQUEST:
  236. case X25_RESET_CONFIRMATION:
  237. case X25_RESTART_REQUEST:
  238. case X25_RESTART_CONFIRMATION:
  239. case X25_REGISTRATION_REQUEST:
  240. case X25_REGISTRATION_CONFIRMATION:
  241. case X25_DIAGNOSTIC:
  242. return frame[2];
  243. }
  244. if (x25->neighbour->extended) {
  245. if (frame[2] == X25_RR ||
  246. frame[2] == X25_RNR ||
  247. frame[2] == X25_REJ) {
  248. *nr = (frame[3] >> 1) & 0x7F;
  249. return frame[2];
  250. }
  251. } else {
  252. if ((frame[2] & 0x1F) == X25_RR ||
  253. (frame[2] & 0x1F) == X25_RNR ||
  254. (frame[2] & 0x1F) == X25_REJ) {
  255. *nr = (frame[2] >> 5) & 0x07;
  256. return frame[2] & 0x1F;
  257. }
  258. }
  259. if (x25->neighbour->extended) {
  260. if ((frame[2] & 0x01) == X25_DATA) {
  261. *q = (frame[0] & X25_Q_BIT) == X25_Q_BIT;
  262. *d = (frame[0] & X25_D_BIT) == X25_D_BIT;
  263. *m = (frame[3] & X25_EXT_M_BIT) == X25_EXT_M_BIT;
  264. *nr = (frame[3] >> 1) & 0x7F;
  265. *ns = (frame[2] >> 1) & 0x7F;
  266. return X25_DATA;
  267. }
  268. } else {
  269. if ((frame[2] & 0x01) == X25_DATA) {
  270. *q = (frame[0] & X25_Q_BIT) == X25_Q_BIT;
  271. *d = (frame[0] & X25_D_BIT) == X25_D_BIT;
  272. *m = (frame[2] & X25_STD_M_BIT) == X25_STD_M_BIT;
  273. *nr = (frame[2] >> 5) & 0x07;
  274. *ns = (frame[2] >> 1) & 0x07;
  275. return X25_DATA;
  276. }
  277. }
  278. printk(KERN_DEBUG "X.25: invalid PLP frame %02X %02X %02X\n",
  279. frame[0], frame[1], frame[2]);
  280. return X25_ILLEGAL;
  281. }
  282. void x25_disconnect(struct sock *sk, int reason, unsigned char cause,
  283. unsigned char diagnostic)
  284. {
  285. struct x25_sock *x25 = x25_sk(sk);
  286. x25_clear_queues(sk);
  287. x25_stop_timer(sk);
  288. x25->lci = 0;
  289. x25->state = X25_STATE_0;
  290. x25->causediag.cause = cause;
  291. x25->causediag.diagnostic = diagnostic;
  292. sk->sk_state = TCP_CLOSE;
  293. sk->sk_err = reason;
  294. sk->sk_shutdown |= SEND_SHUTDOWN;
  295. if (!sock_flag(sk, SOCK_DEAD)) {
  296. sk->sk_state_change(sk);
  297. sock_set_flag(sk, SOCK_DEAD);
  298. }
  299. }
  300. /*
  301. * Clear an own-rx-busy condition and tell the peer about this, provided
  302. * that there is a significant amount of free receive buffer space available.
  303. */
  304. void x25_check_rbuf(struct sock *sk)
  305. {
  306. struct x25_sock *x25 = x25_sk(sk);
  307. if (atomic_read(&sk->sk_rmem_alloc) < (sk->sk_rcvbuf / 2) &&
  308. (x25->condition & X25_COND_OWN_RX_BUSY)) {
  309. x25->condition &= ~X25_COND_OWN_RX_BUSY;
  310. x25->condition &= ~X25_COND_ACK_PENDING;
  311. x25->vl = x25->vr;
  312. x25_write_internal(sk, X25_RR);
  313. x25_stop_timer(sk);
  314. }
  315. }
  316. /*
  317. * Compare 2 calluserdata structures, used to find correct listening sockets
  318. * when call user data is used.
  319. */
  320. int x25_check_calluserdata(struct x25_calluserdata *ours, struct x25_calluserdata *theirs)
  321. {
  322. int i;
  323. if (ours->cudlength != theirs->cudlength)
  324. return 0;
  325. for (i=0;i<ours->cudlength;i++) {
  326. if (ours->cuddata[i] != theirs->cuddata[i]) {
  327. return 0;
  328. }
  329. }
  330. return 1;
  331. }