x25_in.c 9.0 KB

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