x25_in.c 8.9 KB

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