x25_in.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418
  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 code.
  19. * New timer architecture.
  20. * 2000-03-20 Daniela Squassoni Disabling/enabling of facilities
  21. * negotiation.
  22. * 2000-11-10 Henner Eisen Check and reset for out-of-sequence
  23. * i-frames.
  24. */
  25. #include <linux/slab.h>
  26. #include <linux/errno.h>
  27. #include <linux/kernel.h>
  28. #include <linux/string.h>
  29. #include <linux/skbuff.h>
  30. #include <net/sock.h>
  31. #include <net/tcp_states.h>
  32. #include <net/x25.h>
  33. static int x25_queue_rx_frame(struct sock *sk, struct sk_buff *skb, int more)
  34. {
  35. struct sk_buff *skbo, *skbn = skb;
  36. struct x25_sock *x25 = x25_sk(sk);
  37. if (more) {
  38. x25->fraglen += skb->len;
  39. skb_queue_tail(&x25->fragment_queue, skb);
  40. skb_set_owner_r(skb, sk);
  41. return 0;
  42. }
  43. if (!more && x25->fraglen > 0) { /* End of fragment */
  44. int len = x25->fraglen + skb->len;
  45. if ((skbn = alloc_skb(len, GFP_ATOMIC)) == NULL){
  46. kfree_skb(skb);
  47. return 1;
  48. }
  49. skb_queue_tail(&x25->fragment_queue, skb);
  50. skb_reset_transport_header(skbn);
  51. skbo = skb_dequeue(&x25->fragment_queue);
  52. skb_copy_from_linear_data(skbo, skb_put(skbn, skbo->len),
  53. skbo->len);
  54. kfree_skb(skbo);
  55. while ((skbo =
  56. skb_dequeue(&x25->fragment_queue)) != NULL) {
  57. skb_pull(skbo, (x25->neighbour->extended) ?
  58. X25_EXT_MIN_LEN : X25_STD_MIN_LEN);
  59. skb_copy_from_linear_data(skbo,
  60. skb_put(skbn, skbo->len),
  61. skbo->len);
  62. kfree_skb(skbo);
  63. }
  64. x25->fraglen = 0;
  65. }
  66. skb_set_owner_r(skbn, sk);
  67. skb_queue_tail(&sk->sk_receive_queue, skbn);
  68. if (!sock_flag(sk, SOCK_DEAD))
  69. sk->sk_data_ready(sk, skbn->len);
  70. return 0;
  71. }
  72. /*
  73. * State machine for state 1, Awaiting Call Accepted State.
  74. * The handling of the timer(s) is in file x25_timer.c.
  75. * Handling of state 0 and connection release is in af_x25.c.
  76. */
  77. static int x25_state1_machine(struct sock *sk, struct sk_buff *skb, int frametype)
  78. {
  79. struct x25_address source_addr, dest_addr;
  80. int len;
  81. struct x25_sock *x25 = x25_sk(sk);
  82. switch (frametype) {
  83. case X25_CALL_ACCEPTED: {
  84. x25_stop_timer(sk);
  85. x25->condition = 0x00;
  86. x25->vs = 0;
  87. x25->va = 0;
  88. x25->vr = 0;
  89. x25->vl = 0;
  90. x25->state = X25_STATE_3;
  91. sk->sk_state = TCP_ESTABLISHED;
  92. /*
  93. * Parse the data in the frame.
  94. */
  95. if (!pskb_may_pull(skb, X25_STD_MIN_LEN))
  96. goto out_clear;
  97. skb_pull(skb, X25_STD_MIN_LEN);
  98. len = x25_parse_address_block(skb, &source_addr,
  99. &dest_addr);
  100. if (len > 0)
  101. skb_pull(skb, len);
  102. else if (len < 0)
  103. goto out_clear;
  104. len = x25_parse_facilities(skb, &x25->facilities,
  105. &x25->dte_facilities,
  106. &x25->vc_facil_mask);
  107. if (len > 0)
  108. skb_pull(skb, len);
  109. else if (len < 0)
  110. goto out_clear;
  111. /*
  112. * Copy any Call User Data.
  113. */
  114. if (skb->len > 0) {
  115. if (skb->len > X25_MAX_CUD_LEN)
  116. goto out_clear;
  117. skb_copy_bits(skb, 0, x25->calluserdata.cuddata,
  118. skb->len);
  119. x25->calluserdata.cudlength = skb->len;
  120. }
  121. if (!sock_flag(sk, SOCK_DEAD))
  122. sk->sk_state_change(sk);
  123. break;
  124. }
  125. case X25_CLEAR_REQUEST:
  126. if (!pskb_may_pull(skb, X25_STD_MIN_LEN + 2))
  127. goto out_clear;
  128. x25_write_internal(sk, X25_CLEAR_CONFIRMATION);
  129. x25_disconnect(sk, ECONNREFUSED, skb->data[3], skb->data[4]);
  130. break;
  131. default:
  132. break;
  133. }
  134. return 0;
  135. out_clear:
  136. x25_write_internal(sk, X25_CLEAR_REQUEST);
  137. x25->state = X25_STATE_2;
  138. x25_start_t23timer(sk);
  139. return 0;
  140. }
  141. /*
  142. * State machine for state 2, Awaiting Clear Confirmation State.
  143. * The handling of the timer(s) is in file x25_timer.c
  144. * Handling of state 0 and connection release is in af_x25.c.
  145. */
  146. static int x25_state2_machine(struct sock *sk, struct sk_buff *skb, int frametype)
  147. {
  148. switch (frametype) {
  149. case X25_CLEAR_REQUEST:
  150. if (!pskb_may_pull(skb, X25_STD_MIN_LEN + 2))
  151. goto out_clear;
  152. x25_write_internal(sk, X25_CLEAR_CONFIRMATION);
  153. x25_disconnect(sk, 0, skb->data[3], skb->data[4]);
  154. break;
  155. case X25_CLEAR_CONFIRMATION:
  156. x25_disconnect(sk, 0, 0, 0);
  157. break;
  158. default:
  159. break;
  160. }
  161. return 0;
  162. out_clear:
  163. x25_write_internal(sk, X25_CLEAR_REQUEST);
  164. x25_start_t23timer(sk);
  165. return 0;
  166. }
  167. /*
  168. * State machine for state 3, Connected State.
  169. * The handling of the timer(s) is in file x25_timer.c
  170. * Handling of state 0 and connection release is in af_x25.c.
  171. */
  172. static int x25_state3_machine(struct sock *sk, struct sk_buff *skb, int frametype, int ns, int nr, int q, int d, int m)
  173. {
  174. int queued = 0;
  175. int modulus;
  176. struct x25_sock *x25 = x25_sk(sk);
  177. modulus = (x25->neighbour->extended) ? X25_EMODULUS : X25_SMODULUS;
  178. switch (frametype) {
  179. case X25_RESET_REQUEST:
  180. x25_write_internal(sk, X25_RESET_CONFIRMATION);
  181. x25_stop_timer(sk);
  182. x25->condition = 0x00;
  183. x25->vs = 0;
  184. x25->vr = 0;
  185. x25->va = 0;
  186. x25->vl = 0;
  187. x25_requeue_frames(sk);
  188. break;
  189. case X25_CLEAR_REQUEST:
  190. if (!pskb_may_pull(skb, X25_STD_MIN_LEN + 2))
  191. goto out_clear;
  192. x25_write_internal(sk, X25_CLEAR_CONFIRMATION);
  193. x25_disconnect(sk, 0, skb->data[3], skb->data[4]);
  194. break;
  195. case X25_RR:
  196. case X25_RNR:
  197. if (!x25_validate_nr(sk, nr)) {
  198. x25_clear_queues(sk);
  199. x25_write_internal(sk, X25_RESET_REQUEST);
  200. x25_start_t22timer(sk);
  201. x25->condition = 0x00;
  202. x25->vs = 0;
  203. x25->vr = 0;
  204. x25->va = 0;
  205. x25->vl = 0;
  206. x25->state = X25_STATE_4;
  207. } else {
  208. x25_frames_acked(sk, nr);
  209. if (frametype == X25_RNR) {
  210. x25->condition |= X25_COND_PEER_RX_BUSY;
  211. } else {
  212. x25->condition &= ~X25_COND_PEER_RX_BUSY;
  213. }
  214. }
  215. break;
  216. case X25_DATA: /* XXX */
  217. x25->condition &= ~X25_COND_PEER_RX_BUSY;
  218. if ((ns != x25->vr) || !x25_validate_nr(sk, nr)) {
  219. x25_clear_queues(sk);
  220. x25_write_internal(sk, X25_RESET_REQUEST);
  221. x25_start_t22timer(sk);
  222. x25->condition = 0x00;
  223. x25->vs = 0;
  224. x25->vr = 0;
  225. x25->va = 0;
  226. x25->vl = 0;
  227. x25->state = X25_STATE_4;
  228. break;
  229. }
  230. x25_frames_acked(sk, nr);
  231. if (ns == x25->vr) {
  232. if (x25_queue_rx_frame(sk, skb, m) == 0) {
  233. x25->vr = (x25->vr + 1) % modulus;
  234. queued = 1;
  235. } else {
  236. /* Should never happen */
  237. x25_clear_queues(sk);
  238. x25_write_internal(sk, X25_RESET_REQUEST);
  239. x25_start_t22timer(sk);
  240. x25->condition = 0x00;
  241. x25->vs = 0;
  242. x25->vr = 0;
  243. x25->va = 0;
  244. x25->vl = 0;
  245. x25->state = X25_STATE_4;
  246. break;
  247. }
  248. if (atomic_read(&sk->sk_rmem_alloc) >
  249. (sk->sk_rcvbuf >> 1))
  250. x25->condition |= X25_COND_OWN_RX_BUSY;
  251. }
  252. /*
  253. * If the window is full Ack it immediately, else
  254. * start the holdback timer.
  255. */
  256. if (((x25->vl + x25->facilities.winsize_in) % modulus) == x25->vr) {
  257. x25->condition &= ~X25_COND_ACK_PENDING;
  258. x25_stop_timer(sk);
  259. x25_enquiry_response(sk);
  260. } else {
  261. x25->condition |= X25_COND_ACK_PENDING;
  262. x25_start_t2timer(sk);
  263. }
  264. break;
  265. case X25_INTERRUPT_CONFIRMATION:
  266. clear_bit(X25_INTERRUPT_FLAG, &x25->flags);
  267. break;
  268. case X25_INTERRUPT:
  269. if (sock_flag(sk, SOCK_URGINLINE))
  270. queued = !sock_queue_rcv_skb(sk, skb);
  271. else {
  272. skb_set_owner_r(skb, sk);
  273. skb_queue_tail(&x25->interrupt_in_queue, skb);
  274. queued = 1;
  275. }
  276. sk_send_sigurg(sk);
  277. x25_write_internal(sk, X25_INTERRUPT_CONFIRMATION);
  278. break;
  279. default:
  280. printk(KERN_WARNING "x25: unknown %02X in state 3\n", frametype);
  281. break;
  282. }
  283. return queued;
  284. out_clear:
  285. x25_write_internal(sk, X25_CLEAR_REQUEST);
  286. x25->state = X25_STATE_2;
  287. x25_start_t23timer(sk);
  288. return 0;
  289. }
  290. /*
  291. * State machine for state 4, Awaiting Reset Confirmation State.
  292. * The handling of the timer(s) is in file x25_timer.c
  293. * Handling of state 0 and connection release is in af_x25.c.
  294. */
  295. static int x25_state4_machine(struct sock *sk, struct sk_buff *skb, int frametype)
  296. {
  297. struct x25_sock *x25 = x25_sk(sk);
  298. switch (frametype) {
  299. case X25_RESET_REQUEST:
  300. x25_write_internal(sk, X25_RESET_CONFIRMATION);
  301. case X25_RESET_CONFIRMATION: {
  302. x25_stop_timer(sk);
  303. x25->condition = 0x00;
  304. x25->va = 0;
  305. x25->vr = 0;
  306. x25->vs = 0;
  307. x25->vl = 0;
  308. x25->state = X25_STATE_3;
  309. x25_requeue_frames(sk);
  310. break;
  311. }
  312. case X25_CLEAR_REQUEST:
  313. if (!pskb_may_pull(skb, X25_STD_MIN_LEN + 2))
  314. goto out_clear;
  315. x25_write_internal(sk, X25_CLEAR_CONFIRMATION);
  316. x25_disconnect(sk, 0, skb->data[3], skb->data[4]);
  317. break;
  318. default:
  319. break;
  320. }
  321. return 0;
  322. out_clear:
  323. x25_write_internal(sk, X25_CLEAR_REQUEST);
  324. x25->state = X25_STATE_2;
  325. x25_start_t23timer(sk);
  326. return 0;
  327. }
  328. /* Higher level upcall for a LAPB frame */
  329. int x25_process_rx_frame(struct sock *sk, struct sk_buff *skb)
  330. {
  331. struct x25_sock *x25 = x25_sk(sk);
  332. int queued = 0, frametype, ns, nr, q, d, m;
  333. if (x25->state == X25_STATE_0)
  334. return 0;
  335. frametype = x25_decode(sk, skb, &ns, &nr, &q, &d, &m);
  336. switch (x25->state) {
  337. case X25_STATE_1:
  338. queued = x25_state1_machine(sk, skb, frametype);
  339. break;
  340. case X25_STATE_2:
  341. queued = x25_state2_machine(sk, skb, frametype);
  342. break;
  343. case X25_STATE_3:
  344. queued = x25_state3_machine(sk, skb, frametype, ns, nr, q, d, m);
  345. break;
  346. case X25_STATE_4:
  347. queued = x25_state4_machine(sk, skb, frametype);
  348. break;
  349. }
  350. x25_kick(sk);
  351. return queued;
  352. }
  353. int x25_backlog_rcv(struct sock *sk, struct sk_buff *skb)
  354. {
  355. int queued = x25_process_rx_frame(sk, skb);
  356. if (!queued)
  357. kfree_skb(skb);
  358. return 0;
  359. }