x25_in.c 8.8 KB

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