x25_subr.c 9.3 KB

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