input.c 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. /* Processing of received RxRPC packets
  3. *
  4. * Copyright (C) 2020 Red Hat, Inc. All Rights Reserved.
  5. * Written by David Howells (dhowells@redhat.com)
  6. */
  7. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  8. #include "ar-internal.h"
  9. /* Override priority when generating ACKs for received DATA */
  10. static const u8 rxrpc_ack_priority[RXRPC_ACK__INVALID] = {
  11. [RXRPC_ACK_IDLE] = 1,
  12. [RXRPC_ACK_DELAY] = 2,
  13. [RXRPC_ACK_REQUESTED] = 3,
  14. [RXRPC_ACK_DUPLICATE] = 4,
  15. [RXRPC_ACK_EXCEEDS_WINDOW] = 5,
  16. [RXRPC_ACK_NOSPACE] = 6,
  17. [RXRPC_ACK_OUT_OF_SEQUENCE] = 7,
  18. };
  19. static void rxrpc_proto_abort(struct rxrpc_call *call, rxrpc_seq_t seq,
  20. enum rxrpc_abort_reason why)
  21. {
  22. rxrpc_abort_call(call, seq, RX_PROTOCOL_ERROR, -EBADMSG, why);
  23. }
  24. /*
  25. * Do TCP-style congestion management [RFC5681].
  26. */
  27. static void rxrpc_congestion_management(struct rxrpc_call *call,
  28. struct rxrpc_ack_summary *summary)
  29. {
  30. summary->change = rxrpc_cong_no_change;
  31. summary->in_flight = rxrpc_tx_in_flight(call);
  32. if (test_and_clear_bit(RXRPC_CALL_RETRANS_TIMEOUT, &call->flags)) {
  33. summary->retrans_timeo = true;
  34. call->cong_ssthresh = umax(summary->in_flight / 2, 2);
  35. call->cong_cwnd = 1;
  36. if (call->cong_cwnd >= call->cong_ssthresh &&
  37. call->cong_ca_state == RXRPC_CA_SLOW_START) {
  38. call->cong_ca_state = RXRPC_CA_CONGEST_AVOIDANCE;
  39. call->cong_tstamp = call->acks_latest_ts;
  40. call->cong_cumul_acks = 0;
  41. }
  42. }
  43. call->cong_cumul_acks += summary->nr_new_sacks;
  44. call->cong_cumul_acks += summary->nr_new_hacks;
  45. if (call->cong_cumul_acks > 255)
  46. call->cong_cumul_acks = 255;
  47. switch (call->cong_ca_state) {
  48. case RXRPC_CA_SLOW_START:
  49. if (call->acks_nr_snacks > 0)
  50. goto packet_loss_detected;
  51. if (call->cong_cumul_acks > 0)
  52. call->cong_cwnd += 1;
  53. if (call->cong_cwnd >= call->cong_ssthresh) {
  54. call->cong_ca_state = RXRPC_CA_CONGEST_AVOIDANCE;
  55. call->cong_tstamp = call->acks_latest_ts;
  56. }
  57. goto out;
  58. case RXRPC_CA_CONGEST_AVOIDANCE:
  59. if (call->acks_nr_snacks > 0)
  60. goto packet_loss_detected;
  61. /* We analyse the number of packets that get ACK'd per RTT
  62. * period and increase the window if we managed to fill it.
  63. */
  64. if (call->rtt_count == 0)
  65. goto out;
  66. if (ktime_before(call->acks_latest_ts,
  67. ktime_add_us(call->cong_tstamp,
  68. call->srtt_us >> 3)))
  69. goto out_no_clear_ca;
  70. summary->change = rxrpc_cong_rtt_window_end;
  71. call->cong_tstamp = call->acks_latest_ts;
  72. if (call->cong_cumul_acks >= call->cong_cwnd)
  73. call->cong_cwnd++;
  74. goto out;
  75. case RXRPC_CA_PACKET_LOSS:
  76. if (call->acks_nr_snacks == 0)
  77. goto resume_normality;
  78. if (summary->new_low_snack) {
  79. summary->change = rxrpc_cong_new_low_nack;
  80. call->cong_dup_acks = 1;
  81. if (call->cong_extra > 1)
  82. call->cong_extra = 1;
  83. goto send_extra_data;
  84. }
  85. call->cong_dup_acks++;
  86. if (call->cong_dup_acks < 3)
  87. goto send_extra_data;
  88. summary->change = rxrpc_cong_begin_retransmission;
  89. call->cong_ca_state = RXRPC_CA_FAST_RETRANSMIT;
  90. call->cong_ssthresh = umax(summary->in_flight / 2, 2);
  91. call->cong_cwnd = call->cong_ssthresh + 3;
  92. call->cong_extra = 0;
  93. call->cong_dup_acks = 0;
  94. summary->need_retransmit = true;
  95. summary->in_fast_or_rto_recovery = true;
  96. goto out;
  97. case RXRPC_CA_FAST_RETRANSMIT:
  98. rxrpc_tlp_init(call);
  99. summary->in_fast_or_rto_recovery = true;
  100. if (!summary->new_low_snack) {
  101. if (summary->nr_new_sacks == 0)
  102. call->cong_cwnd += 1;
  103. call->cong_dup_acks++;
  104. if (call->cong_dup_acks == 2) {
  105. summary->change = rxrpc_cong_retransmit_again;
  106. call->cong_dup_acks = 0;
  107. summary->need_retransmit = true;
  108. }
  109. } else {
  110. summary->change = rxrpc_cong_progress;
  111. call->cong_cwnd = call->cong_ssthresh;
  112. if (call->acks_nr_snacks == 0) {
  113. summary->exiting_fast_or_rto_recovery = true;
  114. goto resume_normality;
  115. }
  116. }
  117. goto out;
  118. default:
  119. BUG();
  120. goto out;
  121. }
  122. resume_normality:
  123. summary->change = rxrpc_cong_cleared_nacks;
  124. call->cong_dup_acks = 0;
  125. call->cong_extra = 0;
  126. call->cong_tstamp = call->acks_latest_ts;
  127. if (call->cong_cwnd < call->cong_ssthresh)
  128. call->cong_ca_state = RXRPC_CA_SLOW_START;
  129. else
  130. call->cong_ca_state = RXRPC_CA_CONGEST_AVOIDANCE;
  131. out:
  132. call->cong_cumul_acks = 0;
  133. out_no_clear_ca:
  134. if (call->cong_cwnd >= RXRPC_TX_MAX_WINDOW)
  135. call->cong_cwnd = RXRPC_TX_MAX_WINDOW;
  136. trace_rxrpc_congest(call, summary);
  137. return;
  138. packet_loss_detected:
  139. summary->change = rxrpc_cong_saw_nack;
  140. call->cong_ca_state = RXRPC_CA_PACKET_LOSS;
  141. call->cong_dup_acks = 0;
  142. goto send_extra_data;
  143. send_extra_data:
  144. /* Send some previously unsent DATA if we have some to advance the ACK
  145. * state.
  146. */
  147. if (test_bit(RXRPC_CALL_TX_LAST, &call->flags) ||
  148. call->acks_nr_sacks != call->tx_top - call->tx_bottom) {
  149. call->cong_extra++;
  150. wake_up(&call->waitq);
  151. }
  152. goto out_no_clear_ca;
  153. }
  154. /*
  155. * Degrade the congestion window if we haven't transmitted a packet for >1RTT.
  156. */
  157. void rxrpc_congestion_degrade(struct rxrpc_call *call)
  158. {
  159. ktime_t rtt, now, time_since;
  160. if (call->cong_ca_state != RXRPC_CA_SLOW_START &&
  161. call->cong_ca_state != RXRPC_CA_CONGEST_AVOIDANCE)
  162. return;
  163. if (__rxrpc_call_state(call) == RXRPC_CALL_CLIENT_AWAIT_REPLY)
  164. return;
  165. rtt = ns_to_ktime(call->srtt_us * (NSEC_PER_USEC / 8));
  166. now = ktime_get_real();
  167. time_since = ktime_sub(now, call->tx_last_sent);
  168. if (ktime_before(time_since, rtt))
  169. return;
  170. trace_rxrpc_reset_cwnd(call, time_since, rtt);
  171. rxrpc_inc_stat(call->rxnet, stat_tx_data_cwnd_reset);
  172. call->tx_last_sent = now;
  173. call->cong_ca_state = RXRPC_CA_SLOW_START;
  174. call->cong_ssthresh = umax(call->cong_ssthresh, call->cong_cwnd * 3 / 4);
  175. call->cong_cwnd = umax(call->cong_cwnd / 2, RXRPC_MIN_CWND);
  176. }
  177. /*
  178. * Add an RTT sample derived from an ACK'd DATA packet.
  179. */
  180. static void rxrpc_add_data_rtt_sample(struct rxrpc_call *call,
  181. struct rxrpc_ack_summary *summary,
  182. struct rxrpc_txqueue *tq,
  183. int ix)
  184. {
  185. ktime_t xmit_ts = ktime_add_us(tq->xmit_ts_base, tq->segment_xmit_ts[ix]);
  186. rxrpc_call_add_rtt(call, rxrpc_rtt_rx_data_ack, -1,
  187. summary->acked_serial, summary->ack_serial,
  188. xmit_ts, call->acks_latest_ts);
  189. __clear_bit(ix, &tq->rtt_samples); /* Prevent repeat RTT sample */
  190. }
  191. /*
  192. * Apply a hard ACK by advancing the Tx window.
  193. */
  194. static bool rxrpc_rotate_tx_window(struct rxrpc_call *call, rxrpc_seq_t to,
  195. struct rxrpc_ack_summary *summary)
  196. {
  197. struct rxrpc_txqueue *tq = call->tx_queue;
  198. rxrpc_seq_t seq = call->tx_bottom + 1;
  199. bool rot_last = false, trace = false;
  200. _enter("%x,%x", call->tx_bottom, to);
  201. trace_rxrpc_tx_rotate(call, seq, to);
  202. trace_rxrpc_tq(call, tq, seq, rxrpc_tq_rotate);
  203. if (call->acks_lowest_nak == call->tx_bottom) {
  204. call->acks_lowest_nak = to;
  205. } else if (after(to, call->acks_lowest_nak)) {
  206. summary->new_low_snack = true;
  207. call->acks_lowest_nak = to;
  208. }
  209. /* We may have a left over fully-consumed buffer at the front that we
  210. * couldn't drop before (rotate_and_keep below).
  211. */
  212. if (seq == call->tx_qbase + RXRPC_NR_TXQUEUE) {
  213. call->tx_qbase += RXRPC_NR_TXQUEUE;
  214. call->tx_queue = tq->next;
  215. trace_rxrpc_tq(call, tq, seq, rxrpc_tq_rotate_and_free);
  216. kfree(tq);
  217. tq = call->tx_queue;
  218. }
  219. do {
  220. unsigned int ix = seq - call->tx_qbase;
  221. _debug("tq=%x seq=%x i=%d f=%x", tq->qbase, seq, ix, tq->bufs[ix]->flags);
  222. if (tq->bufs[ix]->flags & RXRPC_LAST_PACKET) {
  223. set_bit(RXRPC_CALL_TX_LAST, &call->flags);
  224. rot_last = true;
  225. }
  226. if (summary->acked_serial == tq->segment_serial[ix] &&
  227. test_bit(ix, &tq->rtt_samples))
  228. rxrpc_add_data_rtt_sample(call, summary, tq, ix);
  229. if (ix == tq->nr_reported_acks) {
  230. /* Packet directly hard ACK'd. */
  231. tq->nr_reported_acks++;
  232. rxrpc_input_rack_one(call, summary, tq, ix);
  233. if (seq == call->tlp_seq)
  234. summary->tlp_probe_acked = true;
  235. summary->nr_new_hacks++;
  236. __set_bit(ix, &tq->segment_acked);
  237. trace_rxrpc_rotate(call, tq, summary, seq, rxrpc_rotate_trace_hack);
  238. } else if (test_bit(ix, &tq->segment_acked)) {
  239. /* Soft ACK -> hard ACK. */
  240. call->acks_nr_sacks--;
  241. trace_rxrpc_rotate(call, tq, summary, seq, rxrpc_rotate_trace_sack);
  242. } else {
  243. /* Soft NAK -> hard ACK. */
  244. call->acks_nr_snacks--;
  245. rxrpc_input_rack_one(call, summary, tq, ix);
  246. if (seq == call->tlp_seq)
  247. summary->tlp_probe_acked = true;
  248. summary->nr_new_hacks++;
  249. __set_bit(ix, &tq->segment_acked);
  250. trace_rxrpc_rotate(call, tq, summary, seq, rxrpc_rotate_trace_snak);
  251. }
  252. call->tx_nr_sent--;
  253. if (__test_and_clear_bit(ix, &tq->segment_lost))
  254. call->tx_nr_lost--;
  255. if (__test_and_clear_bit(ix, &tq->segment_retransmitted))
  256. call->tx_nr_resent--;
  257. __clear_bit(ix, &tq->ever_retransmitted);
  258. rxrpc_put_txbuf(tq->bufs[ix], rxrpc_txbuf_put_rotated);
  259. tq->bufs[ix] = NULL;
  260. WRITE_ONCE(call->tx_bottom, seq);
  261. trace_rxrpc_txqueue(call, (rot_last ?
  262. rxrpc_txqueue_rotate_last :
  263. rxrpc_txqueue_rotate));
  264. seq++;
  265. trace = true;
  266. if (!(seq & RXRPC_TXQ_MASK)) {
  267. trace_rxrpc_rack_update(call, summary);
  268. trace = false;
  269. prefetch(tq->next);
  270. if (tq != call->tx_qtail) {
  271. call->tx_qbase += RXRPC_NR_TXQUEUE;
  272. call->tx_queue = tq->next;
  273. trace_rxrpc_tq(call, tq, seq, rxrpc_tq_rotate_and_free);
  274. kfree(tq);
  275. tq = call->tx_queue;
  276. } else {
  277. trace_rxrpc_tq(call, tq, seq, rxrpc_tq_rotate_and_keep);
  278. tq = NULL;
  279. break;
  280. }
  281. }
  282. } while (before_eq(seq, to));
  283. if (trace)
  284. trace_rxrpc_rack_update(call, summary);
  285. if (rot_last) {
  286. set_bit(RXRPC_CALL_TX_ALL_ACKED, &call->flags);
  287. if (tq) {
  288. trace_rxrpc_tq(call, tq, seq, rxrpc_tq_rotate_and_free);
  289. kfree(tq);
  290. call->tx_queue = NULL;
  291. }
  292. }
  293. _debug("%x,%x,%x,%d", to, call->tx_bottom, call->tx_top, rot_last);
  294. wake_up(&call->waitq);
  295. return rot_last;
  296. }
  297. /*
  298. * End the transmission phase of a call.
  299. *
  300. * This occurs when we get an ACKALL packet, the first DATA packet of a reply,
  301. * or a final ACK packet.
  302. */
  303. static void rxrpc_end_tx_phase(struct rxrpc_call *call, bool reply_begun,
  304. enum rxrpc_abort_reason abort_why)
  305. {
  306. ASSERT(test_bit(RXRPC_CALL_TX_LAST, &call->flags));
  307. call->rack_timer_mode = RXRPC_CALL_RACKTIMER_OFF;
  308. call->rack_timo_at = KTIME_MAX;
  309. trace_rxrpc_rack_timer(call, 0, false);
  310. trace_rxrpc_timer_can(call, rxrpc_timer_trace_rack_off + call->rack_timer_mode);
  311. switch (__rxrpc_call_state(call)) {
  312. case RXRPC_CALL_CLIENT_SEND_REQUEST:
  313. case RXRPC_CALL_CLIENT_AWAIT_REPLY:
  314. if (reply_begun) {
  315. rxrpc_set_call_state(call, RXRPC_CALL_CLIENT_RECV_REPLY);
  316. trace_rxrpc_txqueue(call, rxrpc_txqueue_end);
  317. break;
  318. }
  319. rxrpc_set_call_state(call, RXRPC_CALL_CLIENT_AWAIT_REPLY);
  320. trace_rxrpc_txqueue(call, rxrpc_txqueue_await_reply);
  321. break;
  322. case RXRPC_CALL_SERVER_AWAIT_ACK:
  323. rxrpc_call_completed(call);
  324. trace_rxrpc_txqueue(call, rxrpc_txqueue_end);
  325. break;
  326. default:
  327. kdebug("end_tx %s", rxrpc_call_states[__rxrpc_call_state(call)]);
  328. rxrpc_proto_abort(call, call->tx_top, abort_why);
  329. break;
  330. }
  331. }
  332. /*
  333. * Begin the reply reception phase of a call.
  334. */
  335. static bool rxrpc_receiving_reply(struct rxrpc_call *call)
  336. {
  337. struct rxrpc_ack_summary summary = { 0 };
  338. rxrpc_seq_t top = READ_ONCE(call->tx_top);
  339. if (call->ackr_reason) {
  340. call->delay_ack_at = KTIME_MAX;
  341. trace_rxrpc_timer_can(call, rxrpc_timer_trace_delayed_ack);
  342. }
  343. if (!test_bit(RXRPC_CALL_TX_LAST, &call->flags)) {
  344. if (!rxrpc_rotate_tx_window(call, top, &summary)) {
  345. rxrpc_proto_abort(call, top, rxrpc_eproto_early_reply);
  346. return false;
  347. }
  348. }
  349. rxrpc_end_tx_phase(call, true, rxrpc_eproto_unexpected_reply);
  350. return true;
  351. }
  352. /*
  353. * End the packet reception phase.
  354. */
  355. static void rxrpc_end_rx_phase(struct rxrpc_call *call, rxrpc_serial_t serial)
  356. {
  357. rxrpc_seq_t whigh = READ_ONCE(call->rx_highest_seq);
  358. _enter("%d,%s", call->debug_id, rxrpc_call_states[__rxrpc_call_state(call)]);
  359. trace_rxrpc_receive(call, rxrpc_receive_end, 0, whigh);
  360. switch (__rxrpc_call_state(call)) {
  361. case RXRPC_CALL_CLIENT_RECV_REPLY:
  362. rxrpc_propose_delay_ACK(call, serial, rxrpc_propose_ack_terminal_ack);
  363. rxrpc_call_completed(call);
  364. break;
  365. case RXRPC_CALL_SERVER_RECV_REQUEST:
  366. rxrpc_set_call_state(call, RXRPC_CALL_SERVER_ACK_REQUEST);
  367. call->expect_req_by = KTIME_MAX;
  368. rxrpc_propose_delay_ACK(call, serial, rxrpc_propose_ack_processing_op);
  369. break;
  370. default:
  371. break;
  372. }
  373. }
  374. static void rxrpc_input_update_ack_window(struct rxrpc_call *call,
  375. rxrpc_seq_t window, rxrpc_seq_t wtop)
  376. {
  377. call->ackr_window = window;
  378. call->ackr_wtop = wtop;
  379. }
  380. /*
  381. * Push a DATA packet onto the Rx queue.
  382. */
  383. static void rxrpc_input_queue_data(struct rxrpc_call *call, struct sk_buff *skb,
  384. rxrpc_seq_t window, rxrpc_seq_t wtop,
  385. enum rxrpc_receive_trace why)
  386. {
  387. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  388. bool last = sp->hdr.flags & RXRPC_LAST_PACKET;
  389. spin_lock_irq(&call->recvmsg_queue.lock);
  390. __skb_queue_tail(&call->recvmsg_queue, skb);
  391. rxrpc_input_update_ack_window(call, window, wtop);
  392. trace_rxrpc_receive(call, last ? why + 1 : why, sp->hdr.serial, sp->hdr.seq);
  393. if (last)
  394. /* Change the state inside the lock so that recvmsg syncs
  395. * correctly with it and using sendmsg() to send a reply
  396. * doesn't race.
  397. */
  398. rxrpc_end_rx_phase(call, sp->hdr.serial);
  399. spin_unlock_irq(&call->recvmsg_queue.lock);
  400. }
  401. /*
  402. * Process a DATA packet.
  403. */
  404. static void rxrpc_input_data_one(struct rxrpc_call *call, struct sk_buff *skb,
  405. bool *_notify, rxrpc_serial_t *_ack_serial, int *_ack_reason)
  406. {
  407. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  408. struct sk_buff *oos;
  409. rxrpc_serial_t serial = sp->hdr.serial;
  410. unsigned int sack = call->ackr_sack_base;
  411. rxrpc_seq_t window = call->ackr_window;
  412. rxrpc_seq_t wtop = call->ackr_wtop;
  413. rxrpc_seq_t wlimit = window + call->rx_winsize - 1;
  414. rxrpc_seq_t seq = sp->hdr.seq;
  415. bool last = sp->hdr.flags & RXRPC_LAST_PACKET;
  416. int ack_reason = -1;
  417. rxrpc_inc_stat(call->rxnet, stat_rx_data);
  418. if (sp->hdr.flags & RXRPC_REQUEST_ACK)
  419. rxrpc_inc_stat(call->rxnet, stat_rx_data_reqack);
  420. if (sp->hdr.flags & RXRPC_JUMBO_PACKET)
  421. rxrpc_inc_stat(call->rxnet, stat_rx_data_jumbo);
  422. if (last) {
  423. if (test_and_set_bit(RXRPC_CALL_RX_LAST, &call->flags) &&
  424. seq + 1 != wtop)
  425. return rxrpc_proto_abort(call, seq, rxrpc_eproto_different_last);
  426. } else {
  427. if (test_bit(RXRPC_CALL_RX_LAST, &call->flags) &&
  428. after_eq(seq, wtop)) {
  429. pr_warn("Packet beyond last: c=%x q=%x window=%x-%x wlimit=%x\n",
  430. call->debug_id, seq, window, wtop, wlimit);
  431. return rxrpc_proto_abort(call, seq, rxrpc_eproto_data_after_last);
  432. }
  433. }
  434. if (after(seq, call->rx_highest_seq))
  435. call->rx_highest_seq = seq;
  436. trace_rxrpc_rx_data(call->debug_id, seq, serial, sp->hdr.flags);
  437. if (before(seq, window)) {
  438. ack_reason = RXRPC_ACK_DUPLICATE;
  439. goto send_ack;
  440. }
  441. if (after(seq, wlimit)) {
  442. ack_reason = RXRPC_ACK_EXCEEDS_WINDOW;
  443. goto send_ack;
  444. }
  445. /* Queue the packet. */
  446. if (seq == window) {
  447. if (sp->hdr.flags & RXRPC_REQUEST_ACK)
  448. ack_reason = RXRPC_ACK_REQUESTED;
  449. /* Send an immediate ACK if we fill in a hole */
  450. else if (!skb_queue_empty(&call->rx_oos_queue))
  451. ack_reason = RXRPC_ACK_DELAY;
  452. window++;
  453. if (after(window, wtop)) {
  454. trace_rxrpc_sack(call, seq, sack, rxrpc_sack_none);
  455. wtop = window;
  456. } else {
  457. trace_rxrpc_sack(call, seq, sack, rxrpc_sack_advance);
  458. sack = (sack + 1) % RXRPC_SACK_SIZE;
  459. }
  460. rxrpc_get_skb(skb, rxrpc_skb_get_to_recvmsg);
  461. rxrpc_input_queue_data(call, skb, window, wtop, rxrpc_receive_queue);
  462. *_notify = true;
  463. while ((oos = skb_peek(&call->rx_oos_queue))) {
  464. struct rxrpc_skb_priv *osp = rxrpc_skb(oos);
  465. if (after(osp->hdr.seq, window))
  466. break;
  467. __skb_unlink(oos, &call->rx_oos_queue);
  468. last = osp->hdr.flags & RXRPC_LAST_PACKET;
  469. seq = osp->hdr.seq;
  470. call->ackr_sack_table[sack] = 0;
  471. trace_rxrpc_sack(call, seq, sack, rxrpc_sack_fill);
  472. sack = (sack + 1) % RXRPC_SACK_SIZE;
  473. window++;
  474. rxrpc_input_queue_data(call, oos, window, wtop,
  475. rxrpc_receive_queue_oos);
  476. }
  477. call->ackr_sack_base = sack;
  478. } else {
  479. unsigned int slot;
  480. ack_reason = RXRPC_ACK_OUT_OF_SEQUENCE;
  481. slot = seq - window;
  482. sack = (sack + slot) % RXRPC_SACK_SIZE;
  483. if (call->ackr_sack_table[sack % RXRPC_SACK_SIZE]) {
  484. ack_reason = RXRPC_ACK_DUPLICATE;
  485. goto send_ack;
  486. }
  487. call->ackr_sack_table[sack % RXRPC_SACK_SIZE] |= 1;
  488. trace_rxrpc_sack(call, seq, sack, rxrpc_sack_oos);
  489. if (after(seq + 1, wtop)) {
  490. wtop = seq + 1;
  491. rxrpc_input_update_ack_window(call, window, wtop);
  492. }
  493. skb_queue_walk(&call->rx_oos_queue, oos) {
  494. struct rxrpc_skb_priv *osp = rxrpc_skb(oos);
  495. if (after(osp->hdr.seq, seq)) {
  496. rxrpc_get_skb(skb, rxrpc_skb_get_to_recvmsg_oos);
  497. __skb_queue_before(&call->rx_oos_queue, oos, skb);
  498. goto oos_queued;
  499. }
  500. }
  501. rxrpc_get_skb(skb, rxrpc_skb_get_to_recvmsg_oos);
  502. __skb_queue_tail(&call->rx_oos_queue, skb);
  503. oos_queued:
  504. trace_rxrpc_receive(call, last ? rxrpc_receive_oos_last : rxrpc_receive_oos,
  505. sp->hdr.serial, sp->hdr.seq);
  506. }
  507. send_ack:
  508. if (ack_reason >= 0) {
  509. if (rxrpc_ack_priority[ack_reason] > rxrpc_ack_priority[*_ack_reason]) {
  510. *_ack_serial = serial;
  511. *_ack_reason = ack_reason;
  512. } else if (rxrpc_ack_priority[ack_reason] == rxrpc_ack_priority[*_ack_reason] &&
  513. ack_reason == RXRPC_ACK_REQUESTED) {
  514. *_ack_serial = serial;
  515. *_ack_reason = ack_reason;
  516. }
  517. }
  518. }
  519. /*
  520. * Split a jumbo packet and file the bits separately.
  521. */
  522. static bool rxrpc_input_split_jumbo(struct rxrpc_call *call, struct sk_buff *skb)
  523. {
  524. struct rxrpc_jumbo_header jhdr;
  525. struct rxrpc_skb_priv *sp = rxrpc_skb(skb), *jsp;
  526. struct sk_buff *jskb;
  527. rxrpc_serial_t ack_serial = 0;
  528. unsigned int offset = sizeof(struct rxrpc_wire_header);
  529. unsigned int len = skb->len - offset;
  530. bool notify = false;
  531. int ack_reason = 0, count = 1, stat_ix;
  532. while (sp->hdr.flags & RXRPC_JUMBO_PACKET) {
  533. if (len < RXRPC_JUMBO_SUBPKTLEN)
  534. goto protocol_error;
  535. if (sp->hdr.flags & RXRPC_LAST_PACKET)
  536. goto protocol_error;
  537. if (skb_copy_bits(skb, offset + RXRPC_JUMBO_DATALEN,
  538. &jhdr, sizeof(jhdr)) < 0)
  539. goto protocol_error;
  540. jskb = skb_clone(skb, GFP_NOFS);
  541. if (!jskb) {
  542. kdebug("couldn't clone");
  543. return false;
  544. }
  545. rxrpc_new_skb(jskb, rxrpc_skb_new_jumbo_subpacket);
  546. jsp = rxrpc_skb(jskb);
  547. jsp->offset = offset;
  548. jsp->len = RXRPC_JUMBO_DATALEN;
  549. rxrpc_input_data_one(call, jskb, &notify, &ack_serial, &ack_reason);
  550. rxrpc_free_skb(jskb, rxrpc_skb_put_jumbo_subpacket);
  551. sp->hdr.flags = jhdr.flags;
  552. sp->hdr._rsvd = ntohs(jhdr._rsvd);
  553. sp->hdr.seq++;
  554. sp->hdr.serial++;
  555. offset += RXRPC_JUMBO_SUBPKTLEN;
  556. len -= RXRPC_JUMBO_SUBPKTLEN;
  557. count++;
  558. }
  559. sp->offset = offset;
  560. sp->len = len;
  561. rxrpc_input_data_one(call, skb, &notify, &ack_serial, &ack_reason);
  562. stat_ix = umin(count, ARRAY_SIZE(call->rxnet->stat_rx_jumbo)) - 1;
  563. atomic_inc(&call->rxnet->stat_rx_jumbo[stat_ix]);
  564. if (ack_reason > 0) {
  565. rxrpc_send_ACK(call, ack_reason, ack_serial,
  566. rxrpc_propose_ack_input_data);
  567. } else {
  568. call->ackr_nr_unacked++;
  569. rxrpc_propose_delay_ACK(call, sp->hdr.serial,
  570. rxrpc_propose_ack_input_data);
  571. }
  572. if (notify && !test_bit(RXRPC_CALL_CONN_CHALLENGING, &call->flags)) {
  573. trace_rxrpc_notify_socket(call->debug_id, sp->hdr.serial);
  574. rxrpc_notify_socket(call);
  575. }
  576. return true;
  577. protocol_error:
  578. return false;
  579. }
  580. /*
  581. * Process a DATA packet, adding the packet to the Rx ring. The caller's
  582. * packet ref must be passed on or discarded.
  583. */
  584. static void rxrpc_input_data(struct rxrpc_call *call, struct sk_buff *skb)
  585. {
  586. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  587. rxrpc_serial_t serial = sp->hdr.serial;
  588. rxrpc_seq_t seq0 = sp->hdr.seq;
  589. _enter("{%x,%x,%x},{%u,%x}",
  590. call->ackr_window, call->ackr_wtop, call->rx_highest_seq,
  591. skb->len, seq0);
  592. if (__rxrpc_call_is_complete(call))
  593. return;
  594. switch (__rxrpc_call_state(call)) {
  595. case RXRPC_CALL_CLIENT_SEND_REQUEST:
  596. case RXRPC_CALL_CLIENT_AWAIT_REPLY:
  597. /* Received data implicitly ACKs all of the request
  598. * packets we sent when we're acting as a client.
  599. */
  600. if (!rxrpc_receiving_reply(call))
  601. goto out_notify;
  602. break;
  603. case RXRPC_CALL_SERVER_RECV_REQUEST: {
  604. unsigned long timo = READ_ONCE(call->next_req_timo);
  605. if (timo) {
  606. ktime_t delay = ms_to_ktime(timo);
  607. call->expect_req_by = ktime_add(ktime_get_real(), delay);
  608. trace_rxrpc_timer_set(call, delay, rxrpc_timer_trace_idle);
  609. }
  610. break;
  611. }
  612. default:
  613. break;
  614. }
  615. if (!rxrpc_input_split_jumbo(call, skb)) {
  616. rxrpc_proto_abort(call, sp->hdr.seq, rxrpc_badmsg_bad_jumbo);
  617. goto out_notify;
  618. }
  619. return;
  620. out_notify:
  621. trace_rxrpc_notify_socket(call->debug_id, serial);
  622. rxrpc_notify_socket(call);
  623. _leave(" [queued]");
  624. }
  625. /*
  626. * See if there's a cached RTT probe to complete.
  627. */
  628. static void rxrpc_complete_rtt_probe(struct rxrpc_call *call,
  629. ktime_t resp_time,
  630. rxrpc_serial_t acked_serial,
  631. rxrpc_serial_t ack_serial,
  632. enum rxrpc_rtt_rx_trace type)
  633. {
  634. rxrpc_serial_t orig_serial;
  635. unsigned long avail;
  636. ktime_t sent_at;
  637. bool matched = false;
  638. int i;
  639. avail = READ_ONCE(call->rtt_avail);
  640. smp_rmb(); /* Read avail bits before accessing data. */
  641. for (i = 0; i < ARRAY_SIZE(call->rtt_serial); i++) {
  642. if (!test_bit(i + RXRPC_CALL_RTT_PEND_SHIFT, &avail))
  643. continue;
  644. sent_at = call->rtt_sent_at[i];
  645. orig_serial = call->rtt_serial[i];
  646. if (orig_serial == acked_serial) {
  647. clear_bit(i + RXRPC_CALL_RTT_PEND_SHIFT, &call->rtt_avail);
  648. smp_mb(); /* Read data before setting avail bit */
  649. set_bit(i, &call->rtt_avail);
  650. rxrpc_call_add_rtt(call, type, i, acked_serial, ack_serial,
  651. sent_at, resp_time);
  652. matched = true;
  653. }
  654. /* If a later serial is being acked, then mark this slot as
  655. * being available.
  656. */
  657. if (after(acked_serial, orig_serial)) {
  658. trace_rxrpc_rtt_rx(call, rxrpc_rtt_rx_obsolete, i,
  659. orig_serial, acked_serial, 0, 0, 0);
  660. clear_bit(i + RXRPC_CALL_RTT_PEND_SHIFT, &call->rtt_avail);
  661. smp_wmb();
  662. set_bit(i, &call->rtt_avail);
  663. }
  664. }
  665. if (!matched)
  666. trace_rxrpc_rtt_rx(call, rxrpc_rtt_rx_lost, 9, 0, acked_serial, 0, 0, 0);
  667. }
  668. /*
  669. * Process the extra information that may be appended to an ACK packet
  670. */
  671. static void rxrpc_input_ack_trailer(struct rxrpc_call *call, struct sk_buff *skb,
  672. struct rxrpc_acktrailer *trailer)
  673. {
  674. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  675. struct rxrpc_peer *peer = call->peer;
  676. unsigned int max_data, capacity;
  677. bool wake = false;
  678. u32 max_mtu = ntohl(trailer->maxMTU);
  679. //u32 if_mtu = ntohl(trailer->ifMTU);
  680. u32 rwind = ntohl(trailer->rwind);
  681. u32 jumbo_max = ntohl(trailer->jumbo_max);
  682. if (rwind > RXRPC_TX_MAX_WINDOW)
  683. rwind = RXRPC_TX_MAX_WINDOW;
  684. if (call->tx_winsize != rwind) {
  685. if (rwind > call->tx_winsize)
  686. wake = true;
  687. trace_rxrpc_rx_rwind_change(call, sp->hdr.serial, rwind, wake);
  688. call->tx_winsize = rwind;
  689. }
  690. max_mtu = clamp(max_mtu, 500, 65535);
  691. peer->ackr_max_data = max_mtu;
  692. if (max_mtu < peer->max_data) {
  693. trace_rxrpc_pmtud_reduce(peer, sp->hdr.serial, max_mtu,
  694. rxrpc_pmtud_reduce_ack);
  695. peer->max_data = max_mtu;
  696. }
  697. max_data = umin(max_mtu, peer->max_data);
  698. capacity = max_data;
  699. capacity += sizeof(struct rxrpc_jumbo_header); /* First subpacket has main hdr, not jumbo */
  700. capacity /= sizeof(struct rxrpc_jumbo_header) + RXRPC_JUMBO_DATALEN;
  701. if (jumbo_max == 0) {
  702. /* The peer says it supports pmtu discovery */
  703. peer->ackr_adv_pmtud = true;
  704. } else {
  705. peer->ackr_adv_pmtud = false;
  706. capacity = clamp(capacity, 1, jumbo_max);
  707. }
  708. call->tx_jumbo_max = capacity;
  709. if (wake)
  710. wake_up(&call->waitq);
  711. }
  712. #if defined(CONFIG_X86) && __GNUC__ && !defined(__clang__)
  713. /* Clang doesn't support the %z constraint modifier */
  714. #define shiftr_adv_rotr(shift_from, rotate_into) ({ \
  715. asm(" shr%z1 %1\n" \
  716. " inc %0\n" \
  717. " rcr%z2 %2\n" \
  718. : "+d"(shift_from), "+m"(*(shift_from)), "+rm"(rotate_into) \
  719. ); \
  720. })
  721. #else
  722. #define shiftr_adv_rotr(shift_from, rotate_into) ({ \
  723. typeof(rotate_into) __bit0 = *(shift_from) & 1; \
  724. *(shift_from) >>= 1; \
  725. shift_from++; \
  726. rotate_into >>= 1; \
  727. rotate_into |= __bit0 << (sizeof(rotate_into) * 8 - 1); \
  728. })
  729. #endif
  730. /*
  731. * Deal with RTT samples from soft ACKs.
  732. */
  733. static void rxrpc_input_soft_rtt(struct rxrpc_call *call,
  734. struct rxrpc_ack_summary *summary,
  735. struct rxrpc_txqueue *tq)
  736. {
  737. for (int ix = 0; ix < RXRPC_NR_TXQUEUE; ix++)
  738. if (summary->acked_serial == tq->segment_serial[ix])
  739. return rxrpc_add_data_rtt_sample(call, summary, tq, ix);
  740. }
  741. /*
  742. * Process a batch of soft ACKs specific to a transmission queue segment.
  743. */
  744. static void rxrpc_input_soft_ack_tq(struct rxrpc_call *call,
  745. struct rxrpc_ack_summary *summary,
  746. struct rxrpc_txqueue *tq,
  747. unsigned long extracted_acks,
  748. int nr_reported,
  749. rxrpc_seq_t seq,
  750. rxrpc_seq_t *lowest_nak)
  751. {
  752. unsigned long old_reported = 0, flipped, new_acks = 0;
  753. unsigned long a_to_n, n_to_a = 0;
  754. int new, a, n;
  755. if (tq->nr_reported_acks > 0)
  756. old_reported = ~0UL >> (RXRPC_NR_TXQUEUE - tq->nr_reported_acks);
  757. _enter("{%x,%lx,%d},%lx,%d,%x",
  758. tq->qbase, tq->segment_acked, tq->nr_reported_acks,
  759. extracted_acks, nr_reported, seq);
  760. _debug("[%x]", tq->qbase);
  761. _debug("tq %16lx %u", tq->segment_acked, tq->nr_reported_acks);
  762. _debug("sack %16lx %u", extracted_acks, nr_reported);
  763. /* See how many previously logged ACKs/NAKs have flipped. */
  764. flipped = (tq->segment_acked ^ extracted_acks) & old_reported;
  765. if (flipped) {
  766. n_to_a = ~tq->segment_acked & flipped; /* Old NAK -> ACK */
  767. a_to_n = tq->segment_acked & flipped; /* Old ACK -> NAK */
  768. a = hweight_long(n_to_a);
  769. n = hweight_long(a_to_n);
  770. _debug("flip %16lx", flipped);
  771. _debug("ntoa %16lx %d", n_to_a, a);
  772. _debug("aton %16lx %d", a_to_n, n);
  773. call->acks_nr_sacks += a - n;
  774. call->acks_nr_snacks += n - a;
  775. summary->nr_new_sacks += a;
  776. summary->nr_new_snacks += n;
  777. }
  778. /* See how many new ACKs/NAKs have been acquired. */
  779. new = nr_reported - tq->nr_reported_acks;
  780. if (new > 0) {
  781. new_acks = extracted_acks & ~old_reported;
  782. if (new_acks) {
  783. a = hweight_long(new_acks);
  784. n = new - a;
  785. _debug("new_a %16lx new=%d a=%d n=%d", new_acks, new, a, n);
  786. call->acks_nr_sacks += a;
  787. call->acks_nr_snacks += n;
  788. summary->nr_new_sacks += a;
  789. summary->nr_new_snacks += n;
  790. } else {
  791. call->acks_nr_snacks += new;
  792. summary->nr_new_snacks += new;
  793. }
  794. }
  795. tq->nr_reported_acks = nr_reported;
  796. tq->segment_acked = extracted_acks;
  797. trace_rxrpc_apply_acks(call, tq);
  798. if (extracted_acks != ~0UL) {
  799. rxrpc_seq_t lowest = seq + ffz(extracted_acks);
  800. if (before(lowest, *lowest_nak))
  801. *lowest_nak = lowest;
  802. }
  803. if (summary->acked_serial)
  804. rxrpc_input_soft_rtt(call, summary, tq);
  805. new_acks |= n_to_a;
  806. if (new_acks)
  807. rxrpc_input_rack(call, summary, tq, new_acks);
  808. if (call->tlp_serial &&
  809. rxrpc_seq_in_txq(tq, call->tlp_seq) &&
  810. test_bit(call->tlp_seq - tq->qbase, &new_acks))
  811. summary->tlp_probe_acked = true;
  812. }
  813. /*
  814. * Process individual soft ACKs.
  815. *
  816. * Each ACK in the array corresponds to one packet and can be either an ACK or
  817. * a NAK. If we get find an explicitly NAK'd packet we resend immediately;
  818. * packets that lie beyond the end of the ACK list are scheduled for resend by
  819. * the timer on the basis that the peer might just not have processed them at
  820. * the time the ACK was sent.
  821. */
  822. static void rxrpc_input_soft_acks(struct rxrpc_call *call,
  823. struct rxrpc_ack_summary *summary,
  824. struct sk_buff *skb)
  825. {
  826. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  827. struct rxrpc_txqueue *tq = call->tx_queue;
  828. unsigned long extracted = ~0UL;
  829. unsigned int nr = 0;
  830. rxrpc_seq_t seq = call->acks_hard_ack + 1;
  831. rxrpc_seq_t lowest_nak = seq + sp->ack.nr_acks;
  832. u8 *acks = skb->data + sizeof(struct rxrpc_wire_header) + sizeof(struct rxrpc_ackpacket);
  833. _enter("%x,%x,%u", tq->qbase, seq, sp->ack.nr_acks);
  834. while (after(seq, tq->qbase + RXRPC_NR_TXQUEUE - 1))
  835. tq = tq->next;
  836. for (unsigned int i = 0; i < sp->ack.nr_acks; i++) {
  837. /* Decant ACKs until we hit a txqueue boundary. */
  838. shiftr_adv_rotr(acks, extracted);
  839. if (i == 256) {
  840. acks -= i;
  841. i = 0;
  842. }
  843. seq++;
  844. nr++;
  845. if ((seq & RXRPC_TXQ_MASK) != 0)
  846. continue;
  847. _debug("bound %16lx %u", extracted, nr);
  848. rxrpc_input_soft_ack_tq(call, summary, tq, extracted, RXRPC_NR_TXQUEUE,
  849. seq - RXRPC_NR_TXQUEUE, &lowest_nak);
  850. extracted = ~0UL;
  851. nr = 0;
  852. tq = tq->next;
  853. prefetch(tq);
  854. }
  855. if (nr) {
  856. unsigned int nr_reported = seq & RXRPC_TXQ_MASK;
  857. extracted >>= RXRPC_NR_TXQUEUE - nr_reported;
  858. _debug("tail %16lx %u", extracted, nr_reported);
  859. rxrpc_input_soft_ack_tq(call, summary, tq, extracted, nr_reported,
  860. seq & ~RXRPC_TXQ_MASK, &lowest_nak);
  861. }
  862. /* We *can* have more nacks than we did - the peer is permitted to drop
  863. * packets it has soft-acked and re-request them. Further, it is
  864. * possible for the nack distribution to change whilst the number of
  865. * nacks stays the same or goes down.
  866. */
  867. if (lowest_nak != call->acks_lowest_nak) {
  868. call->acks_lowest_nak = lowest_nak;
  869. summary->new_low_snack = true;
  870. }
  871. _debug("summary A=%d+%d N=%d+%d",
  872. call->acks_nr_sacks, summary->nr_new_sacks,
  873. call->acks_nr_snacks, summary->nr_new_snacks);
  874. }
  875. /*
  876. * Return true if the ACK is valid - ie. it doesn't appear to have regressed
  877. * with respect to the ack state conveyed by preceding ACKs.
  878. */
  879. static bool rxrpc_is_ack_valid(struct rxrpc_call *call,
  880. rxrpc_seq_t hard_ack, rxrpc_seq_t prev_pkt)
  881. {
  882. rxrpc_seq_t base = READ_ONCE(call->acks_hard_ack);
  883. if (after(hard_ack, base))
  884. return true; /* The window advanced */
  885. if (before(hard_ack, base))
  886. return false; /* firstPacket regressed */
  887. if (after_eq(prev_pkt, call->acks_prev_seq))
  888. return true; /* previousPacket hasn't regressed. */
  889. /* Some rx implementations put a serial number in previousPacket. */
  890. if (after(prev_pkt, base + call->tx_winsize))
  891. return false;
  892. return true;
  893. }
  894. /*
  895. * Process an ACK packet.
  896. *
  897. * ack.firstPacket is the sequence number of the first soft-ACK'd/NAK'd packet
  898. * in the ACK array. Anything before that is hard-ACK'd and may be discarded.
  899. *
  900. * A hard-ACK means that a packet has been processed and may be discarded; a
  901. * soft-ACK means that the packet may be discarded and retransmission
  902. * requested. A phase is complete when all packets are hard-ACK'd.
  903. */
  904. static void rxrpc_input_ack(struct rxrpc_call *call, struct sk_buff *skb)
  905. {
  906. struct rxrpc_ack_summary summary = { 0 };
  907. struct rxrpc_acktrailer trailer;
  908. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  909. rxrpc_seq_t first_soft_ack, hard_ack, prev_pkt;
  910. int nr_acks, offset, ioffset;
  911. _enter("");
  912. offset = sizeof(struct rxrpc_wire_header) + sizeof(struct rxrpc_ackpacket);
  913. summary.ack_serial = sp->hdr.serial;
  914. first_soft_ack = sp->ack.first_ack;
  915. prev_pkt = sp->ack.prev_ack;
  916. nr_acks = sp->ack.nr_acks;
  917. hard_ack = first_soft_ack - 1;
  918. summary.acked_serial = sp->ack.acked_serial;
  919. summary.ack_reason = (sp->ack.reason < RXRPC_ACK__INVALID ?
  920. sp->ack.reason : RXRPC_ACK__INVALID);
  921. trace_rxrpc_rx_ack(call, sp);
  922. rxrpc_inc_stat(call->rxnet, stat_rx_acks[summary.ack_reason]);
  923. prefetch(call->tx_queue);
  924. /* If we get an EXCEEDS_WINDOW ACK from the server, it probably
  925. * indicates that the client address changed due to NAT. The server
  926. * lost the call because it switched to a different peer.
  927. */
  928. if (unlikely(summary.ack_reason == RXRPC_ACK_EXCEEDS_WINDOW) &&
  929. hard_ack == 0 &&
  930. prev_pkt == 0 &&
  931. rxrpc_is_client_call(call)) {
  932. rxrpc_set_call_completion(call, RXRPC_CALL_REMOTELY_ABORTED,
  933. 0, -ENETRESET);
  934. goto send_response;
  935. }
  936. /* If we get an OUT_OF_SEQUENCE ACK from the server, that can also
  937. * indicate a change of address. However, we can retransmit the call
  938. * if we still have it buffered to the beginning.
  939. */
  940. if (unlikely(summary.ack_reason == RXRPC_ACK_OUT_OF_SEQUENCE) &&
  941. hard_ack == 0 &&
  942. prev_pkt == 0 &&
  943. call->tx_bottom == 0 &&
  944. rxrpc_is_client_call(call)) {
  945. rxrpc_set_call_completion(call, RXRPC_CALL_REMOTELY_ABORTED,
  946. 0, -ENETRESET);
  947. goto send_response;
  948. }
  949. /* Discard any out-of-order or duplicate ACKs (outside lock). */
  950. if (!rxrpc_is_ack_valid(call, hard_ack, prev_pkt)) {
  951. trace_rxrpc_rx_discard_ack(call, summary.ack_serial, hard_ack, prev_pkt);
  952. goto send_response; /* Still respond if requested. */
  953. }
  954. trailer.maxMTU = 0;
  955. ioffset = offset + nr_acks + 3;
  956. if (skb->len >= ioffset + sizeof(trailer) &&
  957. skb_copy_bits(skb, ioffset, &trailer, sizeof(trailer)) < 0)
  958. return rxrpc_proto_abort(call, 0, rxrpc_badmsg_short_ack_trailer);
  959. if (nr_acks > 0)
  960. skb_condense(skb);
  961. call->acks_latest_ts = ktime_get_real();
  962. call->acks_hard_ack = hard_ack;
  963. call->acks_prev_seq = prev_pkt;
  964. if (summary.acked_serial) {
  965. switch (summary.ack_reason) {
  966. case RXRPC_ACK_PING_RESPONSE:
  967. rxrpc_complete_rtt_probe(call, call->acks_latest_ts,
  968. summary.acked_serial, summary.ack_serial,
  969. rxrpc_rtt_rx_ping_response);
  970. break;
  971. default:
  972. if (after(summary.acked_serial, call->acks_highest_serial))
  973. call->acks_highest_serial = summary.acked_serial;
  974. summary.rtt_sample_avail = true;
  975. break;
  976. }
  977. }
  978. /* Parse rwind and mtu sizes if provided. */
  979. if (trailer.maxMTU)
  980. rxrpc_input_ack_trailer(call, skb, &trailer);
  981. if (hard_ack + 1 == 0)
  982. return rxrpc_proto_abort(call, 0, rxrpc_eproto_ackr_zero);
  983. /* Ignore ACKs unless we are or have just been transmitting. */
  984. switch (__rxrpc_call_state(call)) {
  985. case RXRPC_CALL_CLIENT_SEND_REQUEST:
  986. case RXRPC_CALL_CLIENT_AWAIT_REPLY:
  987. case RXRPC_CALL_SERVER_SEND_REPLY:
  988. case RXRPC_CALL_SERVER_AWAIT_ACK:
  989. break;
  990. default:
  991. goto send_response;
  992. }
  993. if (before(hard_ack, call->tx_bottom) ||
  994. after(hard_ack, call->tx_top))
  995. return rxrpc_proto_abort(call, 0, rxrpc_eproto_ackr_outside_window);
  996. if (nr_acks > call->tx_top - hard_ack)
  997. return rxrpc_proto_abort(call, 0, rxrpc_eproto_ackr_sack_overflow);
  998. if (after(hard_ack, call->tx_bottom)) {
  999. if (rxrpc_rotate_tx_window(call, hard_ack, &summary)) {
  1000. rxrpc_end_tx_phase(call, false, rxrpc_eproto_unexpected_ack);
  1001. goto send_response;
  1002. }
  1003. }
  1004. if (nr_acks > 0) {
  1005. if (offset > (int)skb->len - nr_acks)
  1006. return rxrpc_proto_abort(call, 0, rxrpc_eproto_ackr_short_sack);
  1007. rxrpc_input_soft_acks(call, &summary, skb);
  1008. }
  1009. if (test_bit(RXRPC_CALL_TX_LAST, &call->flags) &&
  1010. call->acks_nr_sacks == call->tx_top - hard_ack &&
  1011. rxrpc_is_client_call(call))
  1012. rxrpc_propose_ping(call, summary.ack_serial,
  1013. rxrpc_propose_ack_ping_for_lost_reply);
  1014. /* Drive the congestion management algorithm first and then RACK-TLP as
  1015. * the latter depends on the state/change in state in the former.
  1016. */
  1017. rxrpc_congestion_management(call, &summary);
  1018. rxrpc_rack_detect_loss_and_arm_timer(call, &summary);
  1019. rxrpc_tlp_process_ack(call, &summary);
  1020. if (call->tlp_serial && after_eq(summary.acked_serial, call->tlp_serial))
  1021. call->tlp_serial = 0;
  1022. send_response:
  1023. if (summary.ack_reason == RXRPC_ACK_PING)
  1024. rxrpc_send_ACK(call, RXRPC_ACK_PING_RESPONSE, summary.ack_serial,
  1025. rxrpc_propose_ack_respond_to_ping);
  1026. else if (sp->hdr.flags & RXRPC_REQUEST_ACK)
  1027. rxrpc_send_ACK(call, RXRPC_ACK_REQUESTED, summary.ack_serial,
  1028. rxrpc_propose_ack_respond_to_ack);
  1029. }
  1030. /*
  1031. * Process an ACKALL packet.
  1032. */
  1033. static void rxrpc_input_ackall(struct rxrpc_call *call, struct sk_buff *skb)
  1034. {
  1035. struct rxrpc_ack_summary summary = { 0 };
  1036. if (rxrpc_rotate_tx_window(call, call->tx_top, &summary))
  1037. rxrpc_end_tx_phase(call, false, rxrpc_eproto_unexpected_ackall);
  1038. }
  1039. /*
  1040. * Process an ABORT packet directed at a call.
  1041. */
  1042. static void rxrpc_input_abort(struct rxrpc_call *call, struct sk_buff *skb)
  1043. {
  1044. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  1045. trace_rxrpc_rx_abort(call, sp->hdr.serial, skb->priority);
  1046. rxrpc_set_call_completion(call, RXRPC_CALL_REMOTELY_ABORTED,
  1047. skb->priority, -ECONNABORTED);
  1048. }
  1049. /*
  1050. * Process an incoming call packet.
  1051. */
  1052. void rxrpc_input_call_packet(struct rxrpc_call *call, struct sk_buff *skb)
  1053. {
  1054. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  1055. unsigned long timo;
  1056. _enter("%p,%p", call, skb);
  1057. if (sp->hdr.serviceId != call->dest_srx.srx_service)
  1058. call->dest_srx.srx_service = sp->hdr.serviceId;
  1059. if ((int)sp->hdr.serial - (int)call->rx_serial > 0)
  1060. call->rx_serial = sp->hdr.serial;
  1061. if (!test_bit(RXRPC_CALL_RX_HEARD, &call->flags))
  1062. set_bit(RXRPC_CALL_RX_HEARD, &call->flags);
  1063. timo = READ_ONCE(call->next_rx_timo);
  1064. if (timo) {
  1065. ktime_t delay = ms_to_ktime(timo);
  1066. call->expect_rx_by = ktime_add(ktime_get_real(), delay);
  1067. trace_rxrpc_timer_set(call, delay, rxrpc_timer_trace_expect_rx);
  1068. }
  1069. switch (sp->hdr.type) {
  1070. case RXRPC_PACKET_TYPE_DATA:
  1071. return rxrpc_input_data(call, skb);
  1072. case RXRPC_PACKET_TYPE_ACK:
  1073. return rxrpc_input_ack(call, skb);
  1074. case RXRPC_PACKET_TYPE_BUSY:
  1075. /* Just ignore BUSY packets from the server; the retry and
  1076. * lifespan timers will take care of business. BUSY packets
  1077. * from the client don't make sense.
  1078. */
  1079. return;
  1080. case RXRPC_PACKET_TYPE_ABORT:
  1081. return rxrpc_input_abort(call, skb);
  1082. case RXRPC_PACKET_TYPE_ACKALL:
  1083. return rxrpc_input_ackall(call, skb);
  1084. default:
  1085. break;
  1086. }
  1087. }
  1088. /*
  1089. * Handle a new service call on a channel implicitly completing the preceding
  1090. * call on that channel. This does not apply to client conns.
  1091. *
  1092. * TODO: If callNumber > call_id + 1, renegotiate security.
  1093. */
  1094. void rxrpc_implicit_end_call(struct rxrpc_call *call, struct sk_buff *skb)
  1095. {
  1096. switch (__rxrpc_call_state(call)) {
  1097. case RXRPC_CALL_SERVER_AWAIT_ACK:
  1098. rxrpc_call_completed(call);
  1099. fallthrough;
  1100. case RXRPC_CALL_COMPLETE:
  1101. break;
  1102. default:
  1103. rxrpc_abort_call(call, 0, RX_CALL_DEAD, -ESHUTDOWN,
  1104. rxrpc_eproto_improper_term);
  1105. trace_rxrpc_improper_term(call);
  1106. break;
  1107. }
  1108. rxrpc_input_call_event(call);
  1109. }