x25_in.c 9.8 KB

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