x25_in.c 8.7 KB

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