tcp_output.c 82 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854
  1. /*
  2. * INET An implementation of the TCP/IP protocol suite for the LINUX
  3. * operating system. INET is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * Implementation of the Transmission Control Protocol(TCP).
  7. *
  8. * Authors: Ross Biro
  9. * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
  10. * Mark Evans, <evansmp@uhura.aston.ac.uk>
  11. * Corey Minyard <wf-rch!minyard@relay.EU.net>
  12. * Florian La Roche, <flla@stud.uni-sb.de>
  13. * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
  14. * Linus Torvalds, <torvalds@cs.helsinki.fi>
  15. * Alan Cox, <gw4pts@gw4pts.ampr.org>
  16. * Matthew Dillon, <dillon@apollo.west.oic.com>
  17. * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
  18. * Jorge Cwik, <jorge@laser.satlink.net>
  19. */
  20. /*
  21. * Changes: Pedro Roque : Retransmit queue handled by TCP.
  22. * : Fragmentation on mtu decrease
  23. * : Segment collapse on retransmit
  24. * : AF independence
  25. *
  26. * Linus Torvalds : send_delayed_ack
  27. * David S. Miller : Charge memory using the right skb
  28. * during syn/ack processing.
  29. * David S. Miller : Output engine completely rewritten.
  30. * Andrea Arcangeli: SYNACK carry ts_recent in tsecr.
  31. * Cacophonix Gaul : draft-minshall-nagle-01
  32. * J Hadi Salim : ECN support
  33. *
  34. */
  35. #include <net/tcp.h>
  36. #include <linux/compiler.h>
  37. #include <linux/gfp.h>
  38. #include <linux/module.h>
  39. /* People can turn this off for buggy TCP's found in printers etc. */
  40. int sysctl_tcp_retrans_collapse __read_mostly = 1;
  41. /* People can turn this on to work with those rare, broken TCPs that
  42. * interpret the window field as a signed quantity.
  43. */
  44. int sysctl_tcp_workaround_signed_windows __read_mostly = 0;
  45. /* This limits the percentage of the congestion window which we
  46. * will allow a single TSO frame to consume. Building TSO frames
  47. * which are too large can cause TCP streams to be bursty.
  48. */
  49. int sysctl_tcp_tso_win_divisor __read_mostly = 3;
  50. int sysctl_tcp_mtu_probing __read_mostly = 0;
  51. int sysctl_tcp_base_mss __read_mostly = TCP_BASE_MSS;
  52. /* By default, RFC2861 behavior. */
  53. int sysctl_tcp_slow_start_after_idle __read_mostly = 1;
  54. int sysctl_tcp_cookie_size __read_mostly = 0; /* TCP_COOKIE_MAX */
  55. EXPORT_SYMBOL_GPL(sysctl_tcp_cookie_size);
  56. /* Account for new data that has been sent to the network. */
  57. static void tcp_event_new_data_sent(struct sock *sk, struct sk_buff *skb)
  58. {
  59. struct tcp_sock *tp = tcp_sk(sk);
  60. unsigned int prior_packets = tp->packets_out;
  61. tcp_advance_send_head(sk, skb);
  62. tp->snd_nxt = TCP_SKB_CB(skb)->end_seq;
  63. /* Don't override Nagle indefinitely with F-RTO */
  64. if (tp->frto_counter == 2)
  65. tp->frto_counter = 3;
  66. tp->packets_out += tcp_skb_pcount(skb);
  67. if (!prior_packets)
  68. inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
  69. inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
  70. }
  71. /* SND.NXT, if window was not shrunk.
  72. * If window has been shrunk, what should we make? It is not clear at all.
  73. * Using SND.UNA we will fail to open window, SND.NXT is out of window. :-(
  74. * Anything in between SND.UNA...SND.UNA+SND.WND also can be already
  75. * invalid. OK, let's make this for now:
  76. */
  77. static inline __u32 tcp_acceptable_seq(struct sock *sk)
  78. {
  79. struct tcp_sock *tp = tcp_sk(sk);
  80. if (!before(tcp_wnd_end(tp), tp->snd_nxt))
  81. return tp->snd_nxt;
  82. else
  83. return tcp_wnd_end(tp);
  84. }
  85. /* Calculate mss to advertise in SYN segment.
  86. * RFC1122, RFC1063, draft-ietf-tcpimpl-pmtud-01 state that:
  87. *
  88. * 1. It is independent of path mtu.
  89. * 2. Ideally, it is maximal possible segment size i.e. 65535-40.
  90. * 3. For IPv4 it is reasonable to calculate it from maximal MTU of
  91. * attached devices, because some buggy hosts are confused by
  92. * large MSS.
  93. * 4. We do not make 3, we advertise MSS, calculated from first
  94. * hop device mtu, but allow to raise it to ip_rt_min_advmss.
  95. * This may be overridden via information stored in routing table.
  96. * 5. Value 65535 for MSS is valid in IPv6 and means "as large as possible,
  97. * probably even Jumbo".
  98. */
  99. static __u16 tcp_advertise_mss(struct sock *sk)
  100. {
  101. struct tcp_sock *tp = tcp_sk(sk);
  102. struct dst_entry *dst = __sk_dst_get(sk);
  103. int mss = tp->advmss;
  104. if (dst) {
  105. unsigned int metric = dst_metric_advmss(dst);
  106. if (metric < mss) {
  107. mss = metric;
  108. tp->advmss = mss;
  109. }
  110. }
  111. return (__u16)mss;
  112. }
  113. /* RFC2861. Reset CWND after idle period longer RTO to "restart window".
  114. * This is the first part of cwnd validation mechanism. */
  115. static void tcp_cwnd_restart(struct sock *sk, struct dst_entry *dst)
  116. {
  117. struct tcp_sock *tp = tcp_sk(sk);
  118. s32 delta = tcp_time_stamp - tp->lsndtime;
  119. u32 restart_cwnd = tcp_init_cwnd(tp, dst);
  120. u32 cwnd = tp->snd_cwnd;
  121. tcp_ca_event(sk, CA_EVENT_CWND_RESTART);
  122. tp->snd_ssthresh = tcp_current_ssthresh(sk);
  123. restart_cwnd = min(restart_cwnd, cwnd);
  124. while ((delta -= inet_csk(sk)->icsk_rto) > 0 && cwnd > restart_cwnd)
  125. cwnd >>= 1;
  126. tp->snd_cwnd = max(cwnd, restart_cwnd);
  127. tp->snd_cwnd_stamp = tcp_time_stamp;
  128. tp->snd_cwnd_used = 0;
  129. }
  130. /* Congestion state accounting after a packet has been sent. */
  131. static void tcp_event_data_sent(struct tcp_sock *tp,
  132. struct sk_buff *skb, struct sock *sk)
  133. {
  134. struct inet_connection_sock *icsk = inet_csk(sk);
  135. const u32 now = tcp_time_stamp;
  136. if (sysctl_tcp_slow_start_after_idle &&
  137. (!tp->packets_out && (s32)(now - tp->lsndtime) > icsk->icsk_rto))
  138. tcp_cwnd_restart(sk, __sk_dst_get(sk));
  139. tp->lsndtime = now;
  140. /* If it is a reply for ato after last received
  141. * packet, enter pingpong mode.
  142. */
  143. if ((u32)(now - icsk->icsk_ack.lrcvtime) < icsk->icsk_ack.ato)
  144. icsk->icsk_ack.pingpong = 1;
  145. }
  146. /* Account for an ACK we sent. */
  147. static inline void tcp_event_ack_sent(struct sock *sk, unsigned int pkts)
  148. {
  149. tcp_dec_quickack_mode(sk, pkts);
  150. inet_csk_clear_xmit_timer(sk, ICSK_TIME_DACK);
  151. }
  152. /* Determine a window scaling and initial window to offer.
  153. * Based on the assumption that the given amount of space
  154. * will be offered. Store the results in the tp structure.
  155. * NOTE: for smooth operation initial space offering should
  156. * be a multiple of mss if possible. We assume here that mss >= 1.
  157. * This MUST be enforced by all callers.
  158. */
  159. void tcp_select_initial_window(int __space, __u32 mss,
  160. __u32 *rcv_wnd, __u32 *window_clamp,
  161. int wscale_ok, __u8 *rcv_wscale,
  162. __u32 init_rcv_wnd)
  163. {
  164. unsigned int space = (__space < 0 ? 0 : __space);
  165. /* If no clamp set the clamp to the max possible scaled window */
  166. if (*window_clamp == 0)
  167. (*window_clamp) = (65535 << 14);
  168. space = min(*window_clamp, space);
  169. /* Quantize space offering to a multiple of mss if possible. */
  170. if (space > mss)
  171. space = (space / mss) * mss;
  172. /* NOTE: offering an initial window larger than 32767
  173. * will break some buggy TCP stacks. If the admin tells us
  174. * it is likely we could be speaking with such a buggy stack
  175. * we will truncate our initial window offering to 32K-1
  176. * unless the remote has sent us a window scaling option,
  177. * which we interpret as a sign the remote TCP is not
  178. * misinterpreting the window field as a signed quantity.
  179. */
  180. if (sysctl_tcp_workaround_signed_windows)
  181. (*rcv_wnd) = min(space, MAX_TCP_WINDOW);
  182. else
  183. (*rcv_wnd) = space;
  184. (*rcv_wscale) = 0;
  185. if (wscale_ok) {
  186. /* Set window scaling on max possible window
  187. * See RFC1323 for an explanation of the limit to 14
  188. */
  189. space = max_t(u32, sysctl_tcp_rmem[2], sysctl_rmem_max);
  190. space = min_t(u32, space, *window_clamp);
  191. while (space > 65535 && (*rcv_wscale) < 14) {
  192. space >>= 1;
  193. (*rcv_wscale)++;
  194. }
  195. }
  196. /* Set initial window to a value enough for senders starting with
  197. * initial congestion window of TCP_DEFAULT_INIT_RCVWND. Place
  198. * a limit on the initial window when mss is larger than 1460.
  199. */
  200. if (mss > (1 << *rcv_wscale)) {
  201. int init_cwnd = TCP_DEFAULT_INIT_RCVWND;
  202. if (mss > 1460)
  203. init_cwnd =
  204. max_t(u32, (1460 * TCP_DEFAULT_INIT_RCVWND) / mss, 2);
  205. /* when initializing use the value from init_rcv_wnd
  206. * rather than the default from above
  207. */
  208. if (init_rcv_wnd)
  209. *rcv_wnd = min(*rcv_wnd, init_rcv_wnd * mss);
  210. else
  211. *rcv_wnd = min(*rcv_wnd, init_cwnd * mss);
  212. }
  213. /* Set the clamp no higher than max representable value */
  214. (*window_clamp) = min(65535U << (*rcv_wscale), *window_clamp);
  215. }
  216. EXPORT_SYMBOL(tcp_select_initial_window);
  217. /* Chose a new window to advertise, update state in tcp_sock for the
  218. * socket, and return result with RFC1323 scaling applied. The return
  219. * value can be stuffed directly into th->window for an outgoing
  220. * frame.
  221. */
  222. static u16 tcp_select_window(struct sock *sk)
  223. {
  224. struct tcp_sock *tp = tcp_sk(sk);
  225. u32 cur_win = tcp_receive_window(tp);
  226. u32 new_win = __tcp_select_window(sk);
  227. /* Never shrink the offered window */
  228. if (new_win < cur_win) {
  229. /* Danger Will Robinson!
  230. * Don't update rcv_wup/rcv_wnd here or else
  231. * we will not be able to advertise a zero
  232. * window in time. --DaveM
  233. *
  234. * Relax Will Robinson.
  235. */
  236. new_win = ALIGN(cur_win, 1 << tp->rx_opt.rcv_wscale);
  237. }
  238. tp->rcv_wnd = new_win;
  239. tp->rcv_wup = tp->rcv_nxt;
  240. /* Make sure we do not exceed the maximum possible
  241. * scaled window.
  242. */
  243. if (!tp->rx_opt.rcv_wscale && sysctl_tcp_workaround_signed_windows)
  244. new_win = min(new_win, MAX_TCP_WINDOW);
  245. else
  246. new_win = min(new_win, (65535U << tp->rx_opt.rcv_wscale));
  247. /* RFC1323 scaling applied */
  248. new_win >>= tp->rx_opt.rcv_wscale;
  249. /* If we advertise zero window, disable fast path. */
  250. if (new_win == 0)
  251. tp->pred_flags = 0;
  252. return new_win;
  253. }
  254. /* Packet ECN state for a SYN-ACK */
  255. static inline void TCP_ECN_send_synack(struct tcp_sock *tp, struct sk_buff *skb)
  256. {
  257. TCP_SKB_CB(skb)->flags &= ~TCPHDR_CWR;
  258. if (!(tp->ecn_flags & TCP_ECN_OK))
  259. TCP_SKB_CB(skb)->flags &= ~TCPHDR_ECE;
  260. }
  261. /* Packet ECN state for a SYN. */
  262. static inline void TCP_ECN_send_syn(struct sock *sk, struct sk_buff *skb)
  263. {
  264. struct tcp_sock *tp = tcp_sk(sk);
  265. tp->ecn_flags = 0;
  266. if (sysctl_tcp_ecn == 1) {
  267. TCP_SKB_CB(skb)->flags |= TCPHDR_ECE | TCPHDR_CWR;
  268. tp->ecn_flags = TCP_ECN_OK;
  269. }
  270. }
  271. static __inline__ void
  272. TCP_ECN_make_synack(struct request_sock *req, struct tcphdr *th)
  273. {
  274. if (inet_rsk(req)->ecn_ok)
  275. th->ece = 1;
  276. }
  277. /* Set up ECN state for a packet on a ESTABLISHED socket that is about to
  278. * be sent.
  279. */
  280. static inline void TCP_ECN_send(struct sock *sk, struct sk_buff *skb,
  281. int tcp_header_len)
  282. {
  283. struct tcp_sock *tp = tcp_sk(sk);
  284. if (tp->ecn_flags & TCP_ECN_OK) {
  285. /* Not-retransmitted data segment: set ECT and inject CWR. */
  286. if (skb->len != tcp_header_len &&
  287. !before(TCP_SKB_CB(skb)->seq, tp->snd_nxt)) {
  288. INET_ECN_xmit(sk);
  289. if (tp->ecn_flags & TCP_ECN_QUEUE_CWR) {
  290. tp->ecn_flags &= ~TCP_ECN_QUEUE_CWR;
  291. tcp_hdr(skb)->cwr = 1;
  292. skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
  293. }
  294. } else {
  295. /* ACK or retransmitted segment: clear ECT|CE */
  296. INET_ECN_dontxmit(sk);
  297. }
  298. if (tp->ecn_flags & TCP_ECN_DEMAND_CWR)
  299. tcp_hdr(skb)->ece = 1;
  300. }
  301. }
  302. /* Constructs common control bits of non-data skb. If SYN/FIN is present,
  303. * auto increment end seqno.
  304. */
  305. static void tcp_init_nondata_skb(struct sk_buff *skb, u32 seq, u8 flags)
  306. {
  307. skb->ip_summed = CHECKSUM_PARTIAL;
  308. skb->csum = 0;
  309. TCP_SKB_CB(skb)->flags = flags;
  310. TCP_SKB_CB(skb)->sacked = 0;
  311. skb_shinfo(skb)->gso_segs = 1;
  312. skb_shinfo(skb)->gso_size = 0;
  313. skb_shinfo(skb)->gso_type = 0;
  314. TCP_SKB_CB(skb)->seq = seq;
  315. if (flags & (TCPHDR_SYN | TCPHDR_FIN))
  316. seq++;
  317. TCP_SKB_CB(skb)->end_seq = seq;
  318. }
  319. static inline int tcp_urg_mode(const struct tcp_sock *tp)
  320. {
  321. return tp->snd_una != tp->snd_up;
  322. }
  323. #define OPTION_SACK_ADVERTISE (1 << 0)
  324. #define OPTION_TS (1 << 1)
  325. #define OPTION_MD5 (1 << 2)
  326. #define OPTION_WSCALE (1 << 3)
  327. #define OPTION_COOKIE_EXTENSION (1 << 4)
  328. struct tcp_out_options {
  329. u8 options; /* bit field of OPTION_* */
  330. u8 ws; /* window scale, 0 to disable */
  331. u8 num_sack_blocks; /* number of SACK blocks to include */
  332. u8 hash_size; /* bytes in hash_location */
  333. u16 mss; /* 0 to disable */
  334. __u32 tsval, tsecr; /* need to include OPTION_TS */
  335. __u8 *hash_location; /* temporary pointer, overloaded */
  336. };
  337. /* The sysctl int routines are generic, so check consistency here.
  338. */
  339. static u8 tcp_cookie_size_check(u8 desired)
  340. {
  341. int cookie_size;
  342. if (desired > 0)
  343. /* previously specified */
  344. return desired;
  345. cookie_size = ACCESS_ONCE(sysctl_tcp_cookie_size);
  346. if (cookie_size <= 0)
  347. /* no default specified */
  348. return 0;
  349. if (cookie_size <= TCP_COOKIE_MIN)
  350. /* value too small, specify minimum */
  351. return TCP_COOKIE_MIN;
  352. if (cookie_size >= TCP_COOKIE_MAX)
  353. /* value too large, specify maximum */
  354. return TCP_COOKIE_MAX;
  355. if (cookie_size & 1)
  356. /* 8-bit multiple, illegal, fix it */
  357. cookie_size++;
  358. return (u8)cookie_size;
  359. }
  360. /* Write previously computed TCP options to the packet.
  361. *
  362. * Beware: Something in the Internet is very sensitive to the ordering of
  363. * TCP options, we learned this through the hard way, so be careful here.
  364. * Luckily we can at least blame others for their non-compliance but from
  365. * inter-operatibility perspective it seems that we're somewhat stuck with
  366. * the ordering which we have been using if we want to keep working with
  367. * those broken things (not that it currently hurts anybody as there isn't
  368. * particular reason why the ordering would need to be changed).
  369. *
  370. * At least SACK_PERM as the first option is known to lead to a disaster
  371. * (but it may well be that other scenarios fail similarly).
  372. */
  373. static void tcp_options_write(__be32 *ptr, struct tcp_sock *tp,
  374. struct tcp_out_options *opts)
  375. {
  376. u8 options = opts->options; /* mungable copy */
  377. /* Having both authentication and cookies for security is redundant,
  378. * and there's certainly not enough room. Instead, the cookie-less
  379. * extension variant is proposed.
  380. *
  381. * Consider the pessimal case with authentication. The options
  382. * could look like:
  383. * COOKIE|MD5(20) + MSS(4) + SACK|TS(12) + WSCALE(4) == 40
  384. */
  385. if (unlikely(OPTION_MD5 & options)) {
  386. if (unlikely(OPTION_COOKIE_EXTENSION & options)) {
  387. *ptr++ = htonl((TCPOPT_COOKIE << 24) |
  388. (TCPOLEN_COOKIE_BASE << 16) |
  389. (TCPOPT_MD5SIG << 8) |
  390. TCPOLEN_MD5SIG);
  391. } else {
  392. *ptr++ = htonl((TCPOPT_NOP << 24) |
  393. (TCPOPT_NOP << 16) |
  394. (TCPOPT_MD5SIG << 8) |
  395. TCPOLEN_MD5SIG);
  396. }
  397. options &= ~OPTION_COOKIE_EXTENSION;
  398. /* overload cookie hash location */
  399. opts->hash_location = (__u8 *)ptr;
  400. ptr += 4;
  401. }
  402. if (unlikely(opts->mss)) {
  403. *ptr++ = htonl((TCPOPT_MSS << 24) |
  404. (TCPOLEN_MSS << 16) |
  405. opts->mss);
  406. }
  407. if (likely(OPTION_TS & options)) {
  408. if (unlikely(OPTION_SACK_ADVERTISE & options)) {
  409. *ptr++ = htonl((TCPOPT_SACK_PERM << 24) |
  410. (TCPOLEN_SACK_PERM << 16) |
  411. (TCPOPT_TIMESTAMP << 8) |
  412. TCPOLEN_TIMESTAMP);
  413. options &= ~OPTION_SACK_ADVERTISE;
  414. } else {
  415. *ptr++ = htonl((TCPOPT_NOP << 24) |
  416. (TCPOPT_NOP << 16) |
  417. (TCPOPT_TIMESTAMP << 8) |
  418. TCPOLEN_TIMESTAMP);
  419. }
  420. *ptr++ = htonl(opts->tsval);
  421. *ptr++ = htonl(opts->tsecr);
  422. }
  423. /* Specification requires after timestamp, so do it now.
  424. *
  425. * Consider the pessimal case without authentication. The options
  426. * could look like:
  427. * MSS(4) + SACK|TS(12) + COOKIE(20) + WSCALE(4) == 40
  428. */
  429. if (unlikely(OPTION_COOKIE_EXTENSION & options)) {
  430. __u8 *cookie_copy = opts->hash_location;
  431. u8 cookie_size = opts->hash_size;
  432. /* 8-bit multiple handled in tcp_cookie_size_check() above,
  433. * and elsewhere.
  434. */
  435. if (0x2 & cookie_size) {
  436. __u8 *p = (__u8 *)ptr;
  437. /* 16-bit multiple */
  438. *p++ = TCPOPT_COOKIE;
  439. *p++ = TCPOLEN_COOKIE_BASE + cookie_size;
  440. *p++ = *cookie_copy++;
  441. *p++ = *cookie_copy++;
  442. ptr++;
  443. cookie_size -= 2;
  444. } else {
  445. /* 32-bit multiple */
  446. *ptr++ = htonl(((TCPOPT_NOP << 24) |
  447. (TCPOPT_NOP << 16) |
  448. (TCPOPT_COOKIE << 8) |
  449. TCPOLEN_COOKIE_BASE) +
  450. cookie_size);
  451. }
  452. if (cookie_size > 0) {
  453. memcpy(ptr, cookie_copy, cookie_size);
  454. ptr += (cookie_size / 4);
  455. }
  456. }
  457. if (unlikely(OPTION_SACK_ADVERTISE & options)) {
  458. *ptr++ = htonl((TCPOPT_NOP << 24) |
  459. (TCPOPT_NOP << 16) |
  460. (TCPOPT_SACK_PERM << 8) |
  461. TCPOLEN_SACK_PERM);
  462. }
  463. if (unlikely(OPTION_WSCALE & options)) {
  464. *ptr++ = htonl((TCPOPT_NOP << 24) |
  465. (TCPOPT_WINDOW << 16) |
  466. (TCPOLEN_WINDOW << 8) |
  467. opts->ws);
  468. }
  469. if (unlikely(opts->num_sack_blocks)) {
  470. struct tcp_sack_block *sp = tp->rx_opt.dsack ?
  471. tp->duplicate_sack : tp->selective_acks;
  472. int this_sack;
  473. *ptr++ = htonl((TCPOPT_NOP << 24) |
  474. (TCPOPT_NOP << 16) |
  475. (TCPOPT_SACK << 8) |
  476. (TCPOLEN_SACK_BASE + (opts->num_sack_blocks *
  477. TCPOLEN_SACK_PERBLOCK)));
  478. for (this_sack = 0; this_sack < opts->num_sack_blocks;
  479. ++this_sack) {
  480. *ptr++ = htonl(sp[this_sack].start_seq);
  481. *ptr++ = htonl(sp[this_sack].end_seq);
  482. }
  483. tp->rx_opt.dsack = 0;
  484. }
  485. }
  486. /* Compute TCP options for SYN packets. This is not the final
  487. * network wire format yet.
  488. */
  489. static unsigned tcp_syn_options(struct sock *sk, struct sk_buff *skb,
  490. struct tcp_out_options *opts,
  491. struct tcp_md5sig_key **md5) {
  492. struct tcp_sock *tp = tcp_sk(sk);
  493. struct tcp_cookie_values *cvp = tp->cookie_values;
  494. unsigned remaining = MAX_TCP_OPTION_SPACE;
  495. u8 cookie_size = (!tp->rx_opt.cookie_out_never && cvp != NULL) ?
  496. tcp_cookie_size_check(cvp->cookie_desired) :
  497. 0;
  498. #ifdef CONFIG_TCP_MD5SIG
  499. *md5 = tp->af_specific->md5_lookup(sk, sk);
  500. if (*md5) {
  501. opts->options |= OPTION_MD5;
  502. remaining -= TCPOLEN_MD5SIG_ALIGNED;
  503. }
  504. #else
  505. *md5 = NULL;
  506. #endif
  507. /* We always get an MSS option. The option bytes which will be seen in
  508. * normal data packets should timestamps be used, must be in the MSS
  509. * advertised. But we subtract them from tp->mss_cache so that
  510. * calculations in tcp_sendmsg are simpler etc. So account for this
  511. * fact here if necessary. If we don't do this correctly, as a
  512. * receiver we won't recognize data packets as being full sized when we
  513. * should, and thus we won't abide by the delayed ACK rules correctly.
  514. * SACKs don't matter, we never delay an ACK when we have any of those
  515. * going out. */
  516. opts->mss = tcp_advertise_mss(sk);
  517. remaining -= TCPOLEN_MSS_ALIGNED;
  518. if (likely(sysctl_tcp_timestamps && *md5 == NULL)) {
  519. opts->options |= OPTION_TS;
  520. opts->tsval = TCP_SKB_CB(skb)->when;
  521. opts->tsecr = tp->rx_opt.ts_recent;
  522. remaining -= TCPOLEN_TSTAMP_ALIGNED;
  523. }
  524. if (likely(sysctl_tcp_window_scaling)) {
  525. opts->ws = tp->rx_opt.rcv_wscale;
  526. opts->options |= OPTION_WSCALE;
  527. remaining -= TCPOLEN_WSCALE_ALIGNED;
  528. }
  529. if (likely(sysctl_tcp_sack)) {
  530. opts->options |= OPTION_SACK_ADVERTISE;
  531. if (unlikely(!(OPTION_TS & opts->options)))
  532. remaining -= TCPOLEN_SACKPERM_ALIGNED;
  533. }
  534. /* Note that timestamps are required by the specification.
  535. *
  536. * Odd numbers of bytes are prohibited by the specification, ensuring
  537. * that the cookie is 16-bit aligned, and the resulting cookie pair is
  538. * 32-bit aligned.
  539. */
  540. if (*md5 == NULL &&
  541. (OPTION_TS & opts->options) &&
  542. cookie_size > 0) {
  543. int need = TCPOLEN_COOKIE_BASE + cookie_size;
  544. if (0x2 & need) {
  545. /* 32-bit multiple */
  546. need += 2; /* NOPs */
  547. if (need > remaining) {
  548. /* try shrinking cookie to fit */
  549. cookie_size -= 2;
  550. need -= 4;
  551. }
  552. }
  553. while (need > remaining && TCP_COOKIE_MIN <= cookie_size) {
  554. cookie_size -= 4;
  555. need -= 4;
  556. }
  557. if (TCP_COOKIE_MIN <= cookie_size) {
  558. opts->options |= OPTION_COOKIE_EXTENSION;
  559. opts->hash_location = (__u8 *)&cvp->cookie_pair[0];
  560. opts->hash_size = cookie_size;
  561. /* Remember for future incarnations. */
  562. cvp->cookie_desired = cookie_size;
  563. if (cvp->cookie_desired != cvp->cookie_pair_size) {
  564. /* Currently use random bytes as a nonce,
  565. * assuming these are completely unpredictable
  566. * by hostile users of the same system.
  567. */
  568. get_random_bytes(&cvp->cookie_pair[0],
  569. cookie_size);
  570. cvp->cookie_pair_size = cookie_size;
  571. }
  572. remaining -= need;
  573. }
  574. }
  575. return MAX_TCP_OPTION_SPACE - remaining;
  576. }
  577. /* Set up TCP options for SYN-ACKs. */
  578. static unsigned tcp_synack_options(struct sock *sk,
  579. struct request_sock *req,
  580. unsigned mss, struct sk_buff *skb,
  581. struct tcp_out_options *opts,
  582. struct tcp_md5sig_key **md5,
  583. struct tcp_extend_values *xvp)
  584. {
  585. struct inet_request_sock *ireq = inet_rsk(req);
  586. unsigned remaining = MAX_TCP_OPTION_SPACE;
  587. u8 cookie_plus = (xvp != NULL && !xvp->cookie_out_never) ?
  588. xvp->cookie_plus :
  589. 0;
  590. #ifdef CONFIG_TCP_MD5SIG
  591. *md5 = tcp_rsk(req)->af_specific->md5_lookup(sk, req);
  592. if (*md5) {
  593. opts->options |= OPTION_MD5;
  594. remaining -= TCPOLEN_MD5SIG_ALIGNED;
  595. /* We can't fit any SACK blocks in a packet with MD5 + TS
  596. * options. There was discussion about disabling SACK
  597. * rather than TS in order to fit in better with old,
  598. * buggy kernels, but that was deemed to be unnecessary.
  599. */
  600. ireq->tstamp_ok &= !ireq->sack_ok;
  601. }
  602. #else
  603. *md5 = NULL;
  604. #endif
  605. /* We always send an MSS option. */
  606. opts->mss = mss;
  607. remaining -= TCPOLEN_MSS_ALIGNED;
  608. if (likely(ireq->wscale_ok)) {
  609. opts->ws = ireq->rcv_wscale;
  610. opts->options |= OPTION_WSCALE;
  611. remaining -= TCPOLEN_WSCALE_ALIGNED;
  612. }
  613. if (likely(ireq->tstamp_ok)) {
  614. opts->options |= OPTION_TS;
  615. opts->tsval = TCP_SKB_CB(skb)->when;
  616. opts->tsecr = req->ts_recent;
  617. remaining -= TCPOLEN_TSTAMP_ALIGNED;
  618. }
  619. if (likely(ireq->sack_ok)) {
  620. opts->options |= OPTION_SACK_ADVERTISE;
  621. if (unlikely(!ireq->tstamp_ok))
  622. remaining -= TCPOLEN_SACKPERM_ALIGNED;
  623. }
  624. /* Similar rationale to tcp_syn_options() applies here, too.
  625. * If the <SYN> options fit, the same options should fit now!
  626. */
  627. if (*md5 == NULL &&
  628. ireq->tstamp_ok &&
  629. cookie_plus > TCPOLEN_COOKIE_BASE) {
  630. int need = cookie_plus; /* has TCPOLEN_COOKIE_BASE */
  631. if (0x2 & need) {
  632. /* 32-bit multiple */
  633. need += 2; /* NOPs */
  634. }
  635. if (need <= remaining) {
  636. opts->options |= OPTION_COOKIE_EXTENSION;
  637. opts->hash_size = cookie_plus - TCPOLEN_COOKIE_BASE;
  638. remaining -= need;
  639. } else {
  640. /* There's no error return, so flag it. */
  641. xvp->cookie_out_never = 1; /* true */
  642. opts->hash_size = 0;
  643. }
  644. }
  645. return MAX_TCP_OPTION_SPACE - remaining;
  646. }
  647. /* Compute TCP options for ESTABLISHED sockets. This is not the
  648. * final wire format yet.
  649. */
  650. static unsigned tcp_established_options(struct sock *sk, struct sk_buff *skb,
  651. struct tcp_out_options *opts,
  652. struct tcp_md5sig_key **md5) {
  653. struct tcp_skb_cb *tcb = skb ? TCP_SKB_CB(skb) : NULL;
  654. struct tcp_sock *tp = tcp_sk(sk);
  655. unsigned size = 0;
  656. unsigned int eff_sacks;
  657. #ifdef CONFIG_TCP_MD5SIG
  658. *md5 = tp->af_specific->md5_lookup(sk, sk);
  659. if (unlikely(*md5)) {
  660. opts->options |= OPTION_MD5;
  661. size += TCPOLEN_MD5SIG_ALIGNED;
  662. }
  663. #else
  664. *md5 = NULL;
  665. #endif
  666. if (likely(tp->rx_opt.tstamp_ok)) {
  667. opts->options |= OPTION_TS;
  668. opts->tsval = tcb ? tcb->when : 0;
  669. opts->tsecr = tp->rx_opt.ts_recent;
  670. size += TCPOLEN_TSTAMP_ALIGNED;
  671. }
  672. eff_sacks = tp->rx_opt.num_sacks + tp->rx_opt.dsack;
  673. if (unlikely(eff_sacks)) {
  674. const unsigned remaining = MAX_TCP_OPTION_SPACE - size;
  675. opts->num_sack_blocks =
  676. min_t(unsigned, eff_sacks,
  677. (remaining - TCPOLEN_SACK_BASE_ALIGNED) /
  678. TCPOLEN_SACK_PERBLOCK);
  679. size += TCPOLEN_SACK_BASE_ALIGNED +
  680. opts->num_sack_blocks * TCPOLEN_SACK_PERBLOCK;
  681. }
  682. return size;
  683. }
  684. /* This routine actually transmits TCP packets queued in by
  685. * tcp_do_sendmsg(). This is used by both the initial
  686. * transmission and possible later retransmissions.
  687. * All SKB's seen here are completely headerless. It is our
  688. * job to build the TCP header, and pass the packet down to
  689. * IP so it can do the same plus pass the packet off to the
  690. * device.
  691. *
  692. * We are working here with either a clone of the original
  693. * SKB, or a fresh unique copy made by the retransmit engine.
  694. */
  695. static int tcp_transmit_skb(struct sock *sk, struct sk_buff *skb, int clone_it,
  696. gfp_t gfp_mask)
  697. {
  698. const struct inet_connection_sock *icsk = inet_csk(sk);
  699. struct inet_sock *inet;
  700. struct tcp_sock *tp;
  701. struct tcp_skb_cb *tcb;
  702. struct tcp_out_options opts;
  703. unsigned tcp_options_size, tcp_header_size;
  704. struct tcp_md5sig_key *md5;
  705. struct tcphdr *th;
  706. int err;
  707. BUG_ON(!skb || !tcp_skb_pcount(skb));
  708. /* If congestion control is doing timestamping, we must
  709. * take such a timestamp before we potentially clone/copy.
  710. */
  711. if (icsk->icsk_ca_ops->flags & TCP_CONG_RTT_STAMP)
  712. __net_timestamp(skb);
  713. if (likely(clone_it)) {
  714. if (unlikely(skb_cloned(skb)))
  715. skb = pskb_copy(skb, gfp_mask);
  716. else
  717. skb = skb_clone(skb, gfp_mask);
  718. if (unlikely(!skb))
  719. return -ENOBUFS;
  720. }
  721. inet = inet_sk(sk);
  722. tp = tcp_sk(sk);
  723. tcb = TCP_SKB_CB(skb);
  724. memset(&opts, 0, sizeof(opts));
  725. if (unlikely(tcb->flags & TCPHDR_SYN))
  726. tcp_options_size = tcp_syn_options(sk, skb, &opts, &md5);
  727. else
  728. tcp_options_size = tcp_established_options(sk, skb, &opts,
  729. &md5);
  730. tcp_header_size = tcp_options_size + sizeof(struct tcphdr);
  731. if (tcp_packets_in_flight(tp) == 0) {
  732. tcp_ca_event(sk, CA_EVENT_TX_START);
  733. skb->ooo_okay = 1;
  734. } else
  735. skb->ooo_okay = 0;
  736. skb_push(skb, tcp_header_size);
  737. skb_reset_transport_header(skb);
  738. skb_set_owner_w(skb, sk);
  739. /* Build TCP header and checksum it. */
  740. th = tcp_hdr(skb);
  741. th->source = inet->inet_sport;
  742. th->dest = inet->inet_dport;
  743. th->seq = htonl(tcb->seq);
  744. th->ack_seq = htonl(tp->rcv_nxt);
  745. *(((__be16 *)th) + 6) = htons(((tcp_header_size >> 2) << 12) |
  746. tcb->flags);
  747. if (unlikely(tcb->flags & TCPHDR_SYN)) {
  748. /* RFC1323: The window in SYN & SYN/ACK segments
  749. * is never scaled.
  750. */
  751. th->window = htons(min(tp->rcv_wnd, 65535U));
  752. } else {
  753. th->window = htons(tcp_select_window(sk));
  754. }
  755. th->check = 0;
  756. th->urg_ptr = 0;
  757. /* The urg_mode check is necessary during a below snd_una win probe */
  758. if (unlikely(tcp_urg_mode(tp) && before(tcb->seq, tp->snd_up))) {
  759. if (before(tp->snd_up, tcb->seq + 0x10000)) {
  760. th->urg_ptr = htons(tp->snd_up - tcb->seq);
  761. th->urg = 1;
  762. } else if (after(tcb->seq + 0xFFFF, tp->snd_nxt)) {
  763. th->urg_ptr = htons(0xFFFF);
  764. th->urg = 1;
  765. }
  766. }
  767. tcp_options_write((__be32 *)(th + 1), tp, &opts);
  768. if (likely((tcb->flags & TCPHDR_SYN) == 0))
  769. TCP_ECN_send(sk, skb, tcp_header_size);
  770. #ifdef CONFIG_TCP_MD5SIG
  771. /* Calculate the MD5 hash, as we have all we need now */
  772. if (md5) {
  773. sk_nocaps_add(sk, NETIF_F_GSO_MASK);
  774. tp->af_specific->calc_md5_hash(opts.hash_location,
  775. md5, sk, NULL, skb);
  776. }
  777. #endif
  778. icsk->icsk_af_ops->send_check(sk, skb);
  779. if (likely(tcb->flags & TCPHDR_ACK))
  780. tcp_event_ack_sent(sk, tcp_skb_pcount(skb));
  781. if (skb->len != tcp_header_size)
  782. tcp_event_data_sent(tp, skb, sk);
  783. if (after(tcb->end_seq, tp->snd_nxt) || tcb->seq == tcb->end_seq)
  784. TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS,
  785. tcp_skb_pcount(skb));
  786. err = icsk->icsk_af_ops->queue_xmit(skb, &inet->cork.fl);
  787. if (likely(err <= 0))
  788. return err;
  789. tcp_enter_cwr(sk, 1);
  790. return net_xmit_eval(err);
  791. }
  792. /* This routine just queues the buffer for sending.
  793. *
  794. * NOTE: probe0 timer is not checked, do not forget tcp_push_pending_frames,
  795. * otherwise socket can stall.
  796. */
  797. static void tcp_queue_skb(struct sock *sk, struct sk_buff *skb)
  798. {
  799. struct tcp_sock *tp = tcp_sk(sk);
  800. /* Advance write_seq and place onto the write_queue. */
  801. tp->write_seq = TCP_SKB_CB(skb)->end_seq;
  802. skb_header_release(skb);
  803. tcp_add_write_queue_tail(sk, skb);
  804. sk->sk_wmem_queued += skb->truesize;
  805. sk_mem_charge(sk, skb->truesize);
  806. }
  807. /* Initialize TSO segments for a packet. */
  808. static void tcp_set_skb_tso_segs(struct sock *sk, struct sk_buff *skb,
  809. unsigned int mss_now)
  810. {
  811. if (skb->len <= mss_now || !sk_can_gso(sk) ||
  812. skb->ip_summed == CHECKSUM_NONE) {
  813. /* Avoid the costly divide in the normal
  814. * non-TSO case.
  815. */
  816. skb_shinfo(skb)->gso_segs = 1;
  817. skb_shinfo(skb)->gso_size = 0;
  818. skb_shinfo(skb)->gso_type = 0;
  819. } else {
  820. skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss_now);
  821. skb_shinfo(skb)->gso_size = mss_now;
  822. skb_shinfo(skb)->gso_type = sk->sk_gso_type;
  823. }
  824. }
  825. /* When a modification to fackets out becomes necessary, we need to check
  826. * skb is counted to fackets_out or not.
  827. */
  828. static void tcp_adjust_fackets_out(struct sock *sk, struct sk_buff *skb,
  829. int decr)
  830. {
  831. struct tcp_sock *tp = tcp_sk(sk);
  832. if (!tp->sacked_out || tcp_is_reno(tp))
  833. return;
  834. if (after(tcp_highest_sack_seq(tp), TCP_SKB_CB(skb)->seq))
  835. tp->fackets_out -= decr;
  836. }
  837. /* Pcount in the middle of the write queue got changed, we need to do various
  838. * tweaks to fix counters
  839. */
  840. static void tcp_adjust_pcount(struct sock *sk, struct sk_buff *skb, int decr)
  841. {
  842. struct tcp_sock *tp = tcp_sk(sk);
  843. tp->packets_out -= decr;
  844. if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
  845. tp->sacked_out -= decr;
  846. if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS)
  847. tp->retrans_out -= decr;
  848. if (TCP_SKB_CB(skb)->sacked & TCPCB_LOST)
  849. tp->lost_out -= decr;
  850. /* Reno case is special. Sigh... */
  851. if (tcp_is_reno(tp) && decr > 0)
  852. tp->sacked_out -= min_t(u32, tp->sacked_out, decr);
  853. tcp_adjust_fackets_out(sk, skb, decr);
  854. if (tp->lost_skb_hint &&
  855. before(TCP_SKB_CB(skb)->seq, TCP_SKB_CB(tp->lost_skb_hint)->seq) &&
  856. (tcp_is_fack(tp) || (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)))
  857. tp->lost_cnt_hint -= decr;
  858. tcp_verify_left_out(tp);
  859. }
  860. /* Function to create two new TCP segments. Shrinks the given segment
  861. * to the specified size and appends a new segment with the rest of the
  862. * packet to the list. This won't be called frequently, I hope.
  863. * Remember, these are still headerless SKBs at this point.
  864. */
  865. int tcp_fragment(struct sock *sk, struct sk_buff *skb, u32 len,
  866. unsigned int mss_now)
  867. {
  868. struct tcp_sock *tp = tcp_sk(sk);
  869. struct sk_buff *buff;
  870. int nsize, old_factor;
  871. int nlen;
  872. u8 flags;
  873. if (WARN_ON(len > skb->len))
  874. return -EINVAL;
  875. nsize = skb_headlen(skb) - len;
  876. if (nsize < 0)
  877. nsize = 0;
  878. if (skb_cloned(skb) &&
  879. skb_is_nonlinear(skb) &&
  880. pskb_expand_head(skb, 0, 0, GFP_ATOMIC))
  881. return -ENOMEM;
  882. /* Get a new skb... force flag on. */
  883. buff = sk_stream_alloc_skb(sk, nsize, GFP_ATOMIC);
  884. if (buff == NULL)
  885. return -ENOMEM; /* We'll just try again later. */
  886. sk->sk_wmem_queued += buff->truesize;
  887. sk_mem_charge(sk, buff->truesize);
  888. nlen = skb->len - len - nsize;
  889. buff->truesize += nlen;
  890. skb->truesize -= nlen;
  891. /* Correct the sequence numbers. */
  892. TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
  893. TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
  894. TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
  895. /* PSH and FIN should only be set in the second packet. */
  896. flags = TCP_SKB_CB(skb)->flags;
  897. TCP_SKB_CB(skb)->flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH);
  898. TCP_SKB_CB(buff)->flags = flags;
  899. TCP_SKB_CB(buff)->sacked = TCP_SKB_CB(skb)->sacked;
  900. if (!skb_shinfo(skb)->nr_frags && skb->ip_summed != CHECKSUM_PARTIAL) {
  901. /* Copy and checksum data tail into the new buffer. */
  902. buff->csum = csum_partial_copy_nocheck(skb->data + len,
  903. skb_put(buff, nsize),
  904. nsize, 0);
  905. skb_trim(skb, len);
  906. skb->csum = csum_block_sub(skb->csum, buff->csum, len);
  907. } else {
  908. skb->ip_summed = CHECKSUM_PARTIAL;
  909. skb_split(skb, buff, len);
  910. }
  911. buff->ip_summed = skb->ip_summed;
  912. /* Looks stupid, but our code really uses when of
  913. * skbs, which it never sent before. --ANK
  914. */
  915. TCP_SKB_CB(buff)->when = TCP_SKB_CB(skb)->when;
  916. buff->tstamp = skb->tstamp;
  917. old_factor = tcp_skb_pcount(skb);
  918. /* Fix up tso_factor for both original and new SKB. */
  919. tcp_set_skb_tso_segs(sk, skb, mss_now);
  920. tcp_set_skb_tso_segs(sk, buff, mss_now);
  921. /* If this packet has been sent out already, we must
  922. * adjust the various packet counters.
  923. */
  924. if (!before(tp->snd_nxt, TCP_SKB_CB(buff)->end_seq)) {
  925. int diff = old_factor - tcp_skb_pcount(skb) -
  926. tcp_skb_pcount(buff);
  927. if (diff)
  928. tcp_adjust_pcount(sk, skb, diff);
  929. }
  930. /* Link BUFF into the send queue. */
  931. skb_header_release(buff);
  932. tcp_insert_write_queue_after(skb, buff, sk);
  933. return 0;
  934. }
  935. /* This is similar to __pskb_pull_head() (it will go to core/skbuff.c
  936. * eventually). The difference is that pulled data not copied, but
  937. * immediately discarded.
  938. */
  939. static void __pskb_trim_head(struct sk_buff *skb, int len)
  940. {
  941. int i, k, eat;
  942. eat = len;
  943. k = 0;
  944. for (i = 0; i < skb_shinfo(skb)->nr_frags; i++) {
  945. if (skb_shinfo(skb)->frags[i].size <= eat) {
  946. put_page(skb_shinfo(skb)->frags[i].page);
  947. eat -= skb_shinfo(skb)->frags[i].size;
  948. } else {
  949. skb_shinfo(skb)->frags[k] = skb_shinfo(skb)->frags[i];
  950. if (eat) {
  951. skb_shinfo(skb)->frags[k].page_offset += eat;
  952. skb_shinfo(skb)->frags[k].size -= eat;
  953. eat = 0;
  954. }
  955. k++;
  956. }
  957. }
  958. skb_shinfo(skb)->nr_frags = k;
  959. skb_reset_tail_pointer(skb);
  960. skb->data_len -= len;
  961. skb->len = skb->data_len;
  962. }
  963. /* Remove acked data from a packet in the transmit queue. */
  964. int tcp_trim_head(struct sock *sk, struct sk_buff *skb, u32 len)
  965. {
  966. if (skb_cloned(skb) && pskb_expand_head(skb, 0, 0, GFP_ATOMIC))
  967. return -ENOMEM;
  968. /* If len == headlen, we avoid __skb_pull to preserve alignment. */
  969. if (unlikely(len < skb_headlen(skb)))
  970. __skb_pull(skb, len);
  971. else
  972. __pskb_trim_head(skb, len - skb_headlen(skb));
  973. TCP_SKB_CB(skb)->seq += len;
  974. skb->ip_summed = CHECKSUM_PARTIAL;
  975. skb->truesize -= len;
  976. sk->sk_wmem_queued -= len;
  977. sk_mem_uncharge(sk, len);
  978. sock_set_flag(sk, SOCK_QUEUE_SHRUNK);
  979. /* Any change of skb->len requires recalculation of tso factor. */
  980. if (tcp_skb_pcount(skb) > 1)
  981. tcp_set_skb_tso_segs(sk, skb, tcp_skb_mss(skb));
  982. return 0;
  983. }
  984. /* Calculate MSS. Not accounting for SACKs here. */
  985. int tcp_mtu_to_mss(struct sock *sk, int pmtu)
  986. {
  987. struct tcp_sock *tp = tcp_sk(sk);
  988. struct inet_connection_sock *icsk = inet_csk(sk);
  989. int mss_now;
  990. /* Calculate base mss without TCP options:
  991. It is MMS_S - sizeof(tcphdr) of rfc1122
  992. */
  993. mss_now = pmtu - icsk->icsk_af_ops->net_header_len - sizeof(struct tcphdr);
  994. /* Clamp it (mss_clamp does not include tcp options) */
  995. if (mss_now > tp->rx_opt.mss_clamp)
  996. mss_now = tp->rx_opt.mss_clamp;
  997. /* Now subtract optional transport overhead */
  998. mss_now -= icsk->icsk_ext_hdr_len;
  999. /* Then reserve room for full set of TCP options and 8 bytes of data */
  1000. if (mss_now < 48)
  1001. mss_now = 48;
  1002. /* Now subtract TCP options size, not including SACKs */
  1003. mss_now -= tp->tcp_header_len - sizeof(struct tcphdr);
  1004. return mss_now;
  1005. }
  1006. /* Inverse of above */
  1007. int tcp_mss_to_mtu(struct sock *sk, int mss)
  1008. {
  1009. struct tcp_sock *tp = tcp_sk(sk);
  1010. struct inet_connection_sock *icsk = inet_csk(sk);
  1011. int mtu;
  1012. mtu = mss +
  1013. tp->tcp_header_len +
  1014. icsk->icsk_ext_hdr_len +
  1015. icsk->icsk_af_ops->net_header_len;
  1016. return mtu;
  1017. }
  1018. /* MTU probing init per socket */
  1019. void tcp_mtup_init(struct sock *sk)
  1020. {
  1021. struct tcp_sock *tp = tcp_sk(sk);
  1022. struct inet_connection_sock *icsk = inet_csk(sk);
  1023. icsk->icsk_mtup.enabled = sysctl_tcp_mtu_probing > 1;
  1024. icsk->icsk_mtup.search_high = tp->rx_opt.mss_clamp + sizeof(struct tcphdr) +
  1025. icsk->icsk_af_ops->net_header_len;
  1026. icsk->icsk_mtup.search_low = tcp_mss_to_mtu(sk, sysctl_tcp_base_mss);
  1027. icsk->icsk_mtup.probe_size = 0;
  1028. }
  1029. EXPORT_SYMBOL(tcp_mtup_init);
  1030. /* This function synchronize snd mss to current pmtu/exthdr set.
  1031. tp->rx_opt.user_mss is mss set by user by TCP_MAXSEG. It does NOT counts
  1032. for TCP options, but includes only bare TCP header.
  1033. tp->rx_opt.mss_clamp is mss negotiated at connection setup.
  1034. It is minimum of user_mss and mss received with SYN.
  1035. It also does not include TCP options.
  1036. inet_csk(sk)->icsk_pmtu_cookie is last pmtu, seen by this function.
  1037. tp->mss_cache is current effective sending mss, including
  1038. all tcp options except for SACKs. It is evaluated,
  1039. taking into account current pmtu, but never exceeds
  1040. tp->rx_opt.mss_clamp.
  1041. NOTE1. rfc1122 clearly states that advertised MSS
  1042. DOES NOT include either tcp or ip options.
  1043. NOTE2. inet_csk(sk)->icsk_pmtu_cookie and tp->mss_cache
  1044. are READ ONLY outside this function. --ANK (980731)
  1045. */
  1046. unsigned int tcp_sync_mss(struct sock *sk, u32 pmtu)
  1047. {
  1048. struct tcp_sock *tp = tcp_sk(sk);
  1049. struct inet_connection_sock *icsk = inet_csk(sk);
  1050. int mss_now;
  1051. if (icsk->icsk_mtup.search_high > pmtu)
  1052. icsk->icsk_mtup.search_high = pmtu;
  1053. mss_now = tcp_mtu_to_mss(sk, pmtu);
  1054. mss_now = tcp_bound_to_half_wnd(tp, mss_now);
  1055. /* And store cached results */
  1056. icsk->icsk_pmtu_cookie = pmtu;
  1057. if (icsk->icsk_mtup.enabled)
  1058. mss_now = min(mss_now, tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_low));
  1059. tp->mss_cache = mss_now;
  1060. return mss_now;
  1061. }
  1062. EXPORT_SYMBOL(tcp_sync_mss);
  1063. /* Compute the current effective MSS, taking SACKs and IP options,
  1064. * and even PMTU discovery events into account.
  1065. */
  1066. unsigned int tcp_current_mss(struct sock *sk)
  1067. {
  1068. struct tcp_sock *tp = tcp_sk(sk);
  1069. struct dst_entry *dst = __sk_dst_get(sk);
  1070. u32 mss_now;
  1071. unsigned header_len;
  1072. struct tcp_out_options opts;
  1073. struct tcp_md5sig_key *md5;
  1074. mss_now = tp->mss_cache;
  1075. if (dst) {
  1076. u32 mtu = dst_mtu(dst);
  1077. if (mtu != inet_csk(sk)->icsk_pmtu_cookie)
  1078. mss_now = tcp_sync_mss(sk, mtu);
  1079. }
  1080. header_len = tcp_established_options(sk, NULL, &opts, &md5) +
  1081. sizeof(struct tcphdr);
  1082. /* The mss_cache is sized based on tp->tcp_header_len, which assumes
  1083. * some common options. If this is an odd packet (because we have SACK
  1084. * blocks etc) then our calculated header_len will be different, and
  1085. * we have to adjust mss_now correspondingly */
  1086. if (header_len != tp->tcp_header_len) {
  1087. int delta = (int) header_len - tp->tcp_header_len;
  1088. mss_now -= delta;
  1089. }
  1090. return mss_now;
  1091. }
  1092. /* Congestion window validation. (RFC2861) */
  1093. static void tcp_cwnd_validate(struct sock *sk)
  1094. {
  1095. struct tcp_sock *tp = tcp_sk(sk);
  1096. if (tp->packets_out >= tp->snd_cwnd) {
  1097. /* Network is feed fully. */
  1098. tp->snd_cwnd_used = 0;
  1099. tp->snd_cwnd_stamp = tcp_time_stamp;
  1100. } else {
  1101. /* Network starves. */
  1102. if (tp->packets_out > tp->snd_cwnd_used)
  1103. tp->snd_cwnd_used = tp->packets_out;
  1104. if (sysctl_tcp_slow_start_after_idle &&
  1105. (s32)(tcp_time_stamp - tp->snd_cwnd_stamp) >= inet_csk(sk)->icsk_rto)
  1106. tcp_cwnd_application_limited(sk);
  1107. }
  1108. }
  1109. /* Returns the portion of skb which can be sent right away without
  1110. * introducing MSS oddities to segment boundaries. In rare cases where
  1111. * mss_now != mss_cache, we will request caller to create a small skb
  1112. * per input skb which could be mostly avoided here (if desired).
  1113. *
  1114. * We explicitly want to create a request for splitting write queue tail
  1115. * to a small skb for Nagle purposes while avoiding unnecessary modulos,
  1116. * thus all the complexity (cwnd_len is always MSS multiple which we
  1117. * return whenever allowed by the other factors). Basically we need the
  1118. * modulo only when the receiver window alone is the limiting factor or
  1119. * when we would be allowed to send the split-due-to-Nagle skb fully.
  1120. */
  1121. static unsigned int tcp_mss_split_point(struct sock *sk, struct sk_buff *skb,
  1122. unsigned int mss_now, unsigned int cwnd)
  1123. {
  1124. struct tcp_sock *tp = tcp_sk(sk);
  1125. u32 needed, window, cwnd_len;
  1126. window = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
  1127. cwnd_len = mss_now * cwnd;
  1128. if (likely(cwnd_len <= window && skb != tcp_write_queue_tail(sk)))
  1129. return cwnd_len;
  1130. needed = min(skb->len, window);
  1131. if (cwnd_len <= needed)
  1132. return cwnd_len;
  1133. return needed - needed % mss_now;
  1134. }
  1135. /* Can at least one segment of SKB be sent right now, according to the
  1136. * congestion window rules? If so, return how many segments are allowed.
  1137. */
  1138. static inline unsigned int tcp_cwnd_test(struct tcp_sock *tp,
  1139. struct sk_buff *skb)
  1140. {
  1141. u32 in_flight, cwnd;
  1142. /* Don't be strict about the congestion window for the final FIN. */
  1143. if ((TCP_SKB_CB(skb)->flags & TCPHDR_FIN) && tcp_skb_pcount(skb) == 1)
  1144. return 1;
  1145. in_flight = tcp_packets_in_flight(tp);
  1146. cwnd = tp->snd_cwnd;
  1147. if (in_flight < cwnd)
  1148. return (cwnd - in_flight);
  1149. return 0;
  1150. }
  1151. /* Initialize TSO state of a skb.
  1152. * This must be invoked the first time we consider transmitting
  1153. * SKB onto the wire.
  1154. */
  1155. static int tcp_init_tso_segs(struct sock *sk, struct sk_buff *skb,
  1156. unsigned int mss_now)
  1157. {
  1158. int tso_segs = tcp_skb_pcount(skb);
  1159. if (!tso_segs || (tso_segs > 1 && tcp_skb_mss(skb) != mss_now)) {
  1160. tcp_set_skb_tso_segs(sk, skb, mss_now);
  1161. tso_segs = tcp_skb_pcount(skb);
  1162. }
  1163. return tso_segs;
  1164. }
  1165. /* Minshall's variant of the Nagle send check. */
  1166. static inline int tcp_minshall_check(const struct tcp_sock *tp)
  1167. {
  1168. return after(tp->snd_sml, tp->snd_una) &&
  1169. !after(tp->snd_sml, tp->snd_nxt);
  1170. }
  1171. /* Return 0, if packet can be sent now without violation Nagle's rules:
  1172. * 1. It is full sized.
  1173. * 2. Or it contains FIN. (already checked by caller)
  1174. * 3. Or TCP_NODELAY was set.
  1175. * 4. Or TCP_CORK is not set, and all sent packets are ACKed.
  1176. * With Minshall's modification: all sent small packets are ACKed.
  1177. */
  1178. static inline int tcp_nagle_check(const struct tcp_sock *tp,
  1179. const struct sk_buff *skb,
  1180. unsigned mss_now, int nonagle)
  1181. {
  1182. return skb->len < mss_now &&
  1183. ((nonagle & TCP_NAGLE_CORK) ||
  1184. (!nonagle && tp->packets_out && tcp_minshall_check(tp)));
  1185. }
  1186. /* Return non-zero if the Nagle test allows this packet to be
  1187. * sent now.
  1188. */
  1189. static inline int tcp_nagle_test(struct tcp_sock *tp, struct sk_buff *skb,
  1190. unsigned int cur_mss, int nonagle)
  1191. {
  1192. /* Nagle rule does not apply to frames, which sit in the middle of the
  1193. * write_queue (they have no chances to get new data).
  1194. *
  1195. * This is implemented in the callers, where they modify the 'nonagle'
  1196. * argument based upon the location of SKB in the send queue.
  1197. */
  1198. if (nonagle & TCP_NAGLE_PUSH)
  1199. return 1;
  1200. /* Don't use the nagle rule for urgent data (or for the final FIN).
  1201. * Nagle can be ignored during F-RTO too (see RFC4138).
  1202. */
  1203. if (tcp_urg_mode(tp) || (tp->frto_counter == 2) ||
  1204. (TCP_SKB_CB(skb)->flags & TCPHDR_FIN))
  1205. return 1;
  1206. if (!tcp_nagle_check(tp, skb, cur_mss, nonagle))
  1207. return 1;
  1208. return 0;
  1209. }
  1210. /* Does at least the first segment of SKB fit into the send window? */
  1211. static inline int tcp_snd_wnd_test(struct tcp_sock *tp, struct sk_buff *skb,
  1212. unsigned int cur_mss)
  1213. {
  1214. u32 end_seq = TCP_SKB_CB(skb)->end_seq;
  1215. if (skb->len > cur_mss)
  1216. end_seq = TCP_SKB_CB(skb)->seq + cur_mss;
  1217. return !after(end_seq, tcp_wnd_end(tp));
  1218. }
  1219. /* This checks if the data bearing packet SKB (usually tcp_send_head(sk))
  1220. * should be put on the wire right now. If so, it returns the number of
  1221. * packets allowed by the congestion window.
  1222. */
  1223. static unsigned int tcp_snd_test(struct sock *sk, struct sk_buff *skb,
  1224. unsigned int cur_mss, int nonagle)
  1225. {
  1226. struct tcp_sock *tp = tcp_sk(sk);
  1227. unsigned int cwnd_quota;
  1228. tcp_init_tso_segs(sk, skb, cur_mss);
  1229. if (!tcp_nagle_test(tp, skb, cur_mss, nonagle))
  1230. return 0;
  1231. cwnd_quota = tcp_cwnd_test(tp, skb);
  1232. if (cwnd_quota && !tcp_snd_wnd_test(tp, skb, cur_mss))
  1233. cwnd_quota = 0;
  1234. return cwnd_quota;
  1235. }
  1236. /* Test if sending is allowed right now. */
  1237. int tcp_may_send_now(struct sock *sk)
  1238. {
  1239. struct tcp_sock *tp = tcp_sk(sk);
  1240. struct sk_buff *skb = tcp_send_head(sk);
  1241. return skb &&
  1242. tcp_snd_test(sk, skb, tcp_current_mss(sk),
  1243. (tcp_skb_is_last(sk, skb) ?
  1244. tp->nonagle : TCP_NAGLE_PUSH));
  1245. }
  1246. /* Trim TSO SKB to LEN bytes, put the remaining data into a new packet
  1247. * which is put after SKB on the list. It is very much like
  1248. * tcp_fragment() except that it may make several kinds of assumptions
  1249. * in order to speed up the splitting operation. In particular, we
  1250. * know that all the data is in scatter-gather pages, and that the
  1251. * packet has never been sent out before (and thus is not cloned).
  1252. */
  1253. static int tso_fragment(struct sock *sk, struct sk_buff *skb, unsigned int len,
  1254. unsigned int mss_now, gfp_t gfp)
  1255. {
  1256. struct sk_buff *buff;
  1257. int nlen = skb->len - len;
  1258. u8 flags;
  1259. /* All of a TSO frame must be composed of paged data. */
  1260. if (skb->len != skb->data_len)
  1261. return tcp_fragment(sk, skb, len, mss_now);
  1262. buff = sk_stream_alloc_skb(sk, 0, gfp);
  1263. if (unlikely(buff == NULL))
  1264. return -ENOMEM;
  1265. sk->sk_wmem_queued += buff->truesize;
  1266. sk_mem_charge(sk, buff->truesize);
  1267. buff->truesize += nlen;
  1268. skb->truesize -= nlen;
  1269. /* Correct the sequence numbers. */
  1270. TCP_SKB_CB(buff)->seq = TCP_SKB_CB(skb)->seq + len;
  1271. TCP_SKB_CB(buff)->end_seq = TCP_SKB_CB(skb)->end_seq;
  1272. TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(buff)->seq;
  1273. /* PSH and FIN should only be set in the second packet. */
  1274. flags = TCP_SKB_CB(skb)->flags;
  1275. TCP_SKB_CB(skb)->flags = flags & ~(TCPHDR_FIN | TCPHDR_PSH);
  1276. TCP_SKB_CB(buff)->flags = flags;
  1277. /* This packet was never sent out yet, so no SACK bits. */
  1278. TCP_SKB_CB(buff)->sacked = 0;
  1279. buff->ip_summed = skb->ip_summed = CHECKSUM_PARTIAL;
  1280. skb_split(skb, buff, len);
  1281. /* Fix up tso_factor for both original and new SKB. */
  1282. tcp_set_skb_tso_segs(sk, skb, mss_now);
  1283. tcp_set_skb_tso_segs(sk, buff, mss_now);
  1284. /* Link BUFF into the send queue. */
  1285. skb_header_release(buff);
  1286. tcp_insert_write_queue_after(skb, buff, sk);
  1287. return 0;
  1288. }
  1289. /* Try to defer sending, if possible, in order to minimize the amount
  1290. * of TSO splitting we do. View it as a kind of TSO Nagle test.
  1291. *
  1292. * This algorithm is from John Heffner.
  1293. */
  1294. static int tcp_tso_should_defer(struct sock *sk, struct sk_buff *skb)
  1295. {
  1296. struct tcp_sock *tp = tcp_sk(sk);
  1297. const struct inet_connection_sock *icsk = inet_csk(sk);
  1298. u32 send_win, cong_win, limit, in_flight;
  1299. int win_divisor;
  1300. if (TCP_SKB_CB(skb)->flags & TCPHDR_FIN)
  1301. goto send_now;
  1302. if (icsk->icsk_ca_state != TCP_CA_Open)
  1303. goto send_now;
  1304. /* Defer for less than two clock ticks. */
  1305. if (tp->tso_deferred &&
  1306. (((u32)jiffies << 1) >> 1) - (tp->tso_deferred >> 1) > 1)
  1307. goto send_now;
  1308. in_flight = tcp_packets_in_flight(tp);
  1309. BUG_ON(tcp_skb_pcount(skb) <= 1 || (tp->snd_cwnd <= in_flight));
  1310. send_win = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
  1311. /* From in_flight test above, we know that cwnd > in_flight. */
  1312. cong_win = (tp->snd_cwnd - in_flight) * tp->mss_cache;
  1313. limit = min(send_win, cong_win);
  1314. /* If a full-sized TSO skb can be sent, do it. */
  1315. if (limit >= sk->sk_gso_max_size)
  1316. goto send_now;
  1317. /* Middle in queue won't get any more data, full sendable already? */
  1318. if ((skb != tcp_write_queue_tail(sk)) && (limit >= skb->len))
  1319. goto send_now;
  1320. win_divisor = ACCESS_ONCE(sysctl_tcp_tso_win_divisor);
  1321. if (win_divisor) {
  1322. u32 chunk = min(tp->snd_wnd, tp->snd_cwnd * tp->mss_cache);
  1323. /* If at least some fraction of a window is available,
  1324. * just use it.
  1325. */
  1326. chunk /= win_divisor;
  1327. if (limit >= chunk)
  1328. goto send_now;
  1329. } else {
  1330. /* Different approach, try not to defer past a single
  1331. * ACK. Receiver should ACK every other full sized
  1332. * frame, so if we have space for more than 3 frames
  1333. * then send now.
  1334. */
  1335. if (limit > tcp_max_burst(tp) * tp->mss_cache)
  1336. goto send_now;
  1337. }
  1338. /* Ok, it looks like it is advisable to defer. */
  1339. tp->tso_deferred = 1 | (jiffies << 1);
  1340. return 1;
  1341. send_now:
  1342. tp->tso_deferred = 0;
  1343. return 0;
  1344. }
  1345. /* Create a new MTU probe if we are ready.
  1346. * MTU probe is regularly attempting to increase the path MTU by
  1347. * deliberately sending larger packets. This discovers routing
  1348. * changes resulting in larger path MTUs.
  1349. *
  1350. * Returns 0 if we should wait to probe (no cwnd available),
  1351. * 1 if a probe was sent,
  1352. * -1 otherwise
  1353. */
  1354. static int tcp_mtu_probe(struct sock *sk)
  1355. {
  1356. struct tcp_sock *tp = tcp_sk(sk);
  1357. struct inet_connection_sock *icsk = inet_csk(sk);
  1358. struct sk_buff *skb, *nskb, *next;
  1359. int len;
  1360. int probe_size;
  1361. int size_needed;
  1362. int copy;
  1363. int mss_now;
  1364. /* Not currently probing/verifying,
  1365. * not in recovery,
  1366. * have enough cwnd, and
  1367. * not SACKing (the variable headers throw things off) */
  1368. if (!icsk->icsk_mtup.enabled ||
  1369. icsk->icsk_mtup.probe_size ||
  1370. inet_csk(sk)->icsk_ca_state != TCP_CA_Open ||
  1371. tp->snd_cwnd < 11 ||
  1372. tp->rx_opt.num_sacks || tp->rx_opt.dsack)
  1373. return -1;
  1374. /* Very simple search strategy: just double the MSS. */
  1375. mss_now = tcp_current_mss(sk);
  1376. probe_size = 2 * tp->mss_cache;
  1377. size_needed = probe_size + (tp->reordering + 1) * tp->mss_cache;
  1378. if (probe_size > tcp_mtu_to_mss(sk, icsk->icsk_mtup.search_high)) {
  1379. /* TODO: set timer for probe_converge_event */
  1380. return -1;
  1381. }
  1382. /* Have enough data in the send queue to probe? */
  1383. if (tp->write_seq - tp->snd_nxt < size_needed)
  1384. return -1;
  1385. if (tp->snd_wnd < size_needed)
  1386. return -1;
  1387. if (after(tp->snd_nxt + size_needed, tcp_wnd_end(tp)))
  1388. return 0;
  1389. /* Do we need to wait to drain cwnd? With none in flight, don't stall */
  1390. if (tcp_packets_in_flight(tp) + 2 > tp->snd_cwnd) {
  1391. if (!tcp_packets_in_flight(tp))
  1392. return -1;
  1393. else
  1394. return 0;
  1395. }
  1396. /* We're allowed to probe. Build it now. */
  1397. if ((nskb = sk_stream_alloc_skb(sk, probe_size, GFP_ATOMIC)) == NULL)
  1398. return -1;
  1399. sk->sk_wmem_queued += nskb->truesize;
  1400. sk_mem_charge(sk, nskb->truesize);
  1401. skb = tcp_send_head(sk);
  1402. TCP_SKB_CB(nskb)->seq = TCP_SKB_CB(skb)->seq;
  1403. TCP_SKB_CB(nskb)->end_seq = TCP_SKB_CB(skb)->seq + probe_size;
  1404. TCP_SKB_CB(nskb)->flags = TCPHDR_ACK;
  1405. TCP_SKB_CB(nskb)->sacked = 0;
  1406. nskb->csum = 0;
  1407. nskb->ip_summed = skb->ip_summed;
  1408. tcp_insert_write_queue_before(nskb, skb, sk);
  1409. len = 0;
  1410. tcp_for_write_queue_from_safe(skb, next, sk) {
  1411. copy = min_t(int, skb->len, probe_size - len);
  1412. if (nskb->ip_summed)
  1413. skb_copy_bits(skb, 0, skb_put(nskb, copy), copy);
  1414. else
  1415. nskb->csum = skb_copy_and_csum_bits(skb, 0,
  1416. skb_put(nskb, copy),
  1417. copy, nskb->csum);
  1418. if (skb->len <= copy) {
  1419. /* We've eaten all the data from this skb.
  1420. * Throw it away. */
  1421. TCP_SKB_CB(nskb)->flags |= TCP_SKB_CB(skb)->flags;
  1422. tcp_unlink_write_queue(skb, sk);
  1423. sk_wmem_free_skb(sk, skb);
  1424. } else {
  1425. TCP_SKB_CB(nskb)->flags |= TCP_SKB_CB(skb)->flags &
  1426. ~(TCPHDR_FIN|TCPHDR_PSH);
  1427. if (!skb_shinfo(skb)->nr_frags) {
  1428. skb_pull(skb, copy);
  1429. if (skb->ip_summed != CHECKSUM_PARTIAL)
  1430. skb->csum = csum_partial(skb->data,
  1431. skb->len, 0);
  1432. } else {
  1433. __pskb_trim_head(skb, copy);
  1434. tcp_set_skb_tso_segs(sk, skb, mss_now);
  1435. }
  1436. TCP_SKB_CB(skb)->seq += copy;
  1437. }
  1438. len += copy;
  1439. if (len >= probe_size)
  1440. break;
  1441. }
  1442. tcp_init_tso_segs(sk, nskb, nskb->len);
  1443. /* We're ready to send. If this fails, the probe will
  1444. * be resegmented into mss-sized pieces by tcp_write_xmit(). */
  1445. TCP_SKB_CB(nskb)->when = tcp_time_stamp;
  1446. if (!tcp_transmit_skb(sk, nskb, 1, GFP_ATOMIC)) {
  1447. /* Decrement cwnd here because we are sending
  1448. * effectively two packets. */
  1449. tp->snd_cwnd--;
  1450. tcp_event_new_data_sent(sk, nskb);
  1451. icsk->icsk_mtup.probe_size = tcp_mss_to_mtu(sk, nskb->len);
  1452. tp->mtu_probe.probe_seq_start = TCP_SKB_CB(nskb)->seq;
  1453. tp->mtu_probe.probe_seq_end = TCP_SKB_CB(nskb)->end_seq;
  1454. return 1;
  1455. }
  1456. return -1;
  1457. }
  1458. /* This routine writes packets to the network. It advances the
  1459. * send_head. This happens as incoming acks open up the remote
  1460. * window for us.
  1461. *
  1462. * LARGESEND note: !tcp_urg_mode is overkill, only frames between
  1463. * snd_up-64k-mss .. snd_up cannot be large. However, taking into
  1464. * account rare use of URG, this is not a big flaw.
  1465. *
  1466. * Returns 1, if no segments are in flight and we have queued segments, but
  1467. * cannot send anything now because of SWS or another problem.
  1468. */
  1469. static int tcp_write_xmit(struct sock *sk, unsigned int mss_now, int nonagle,
  1470. int push_one, gfp_t gfp)
  1471. {
  1472. struct tcp_sock *tp = tcp_sk(sk);
  1473. struct sk_buff *skb;
  1474. unsigned int tso_segs, sent_pkts;
  1475. int cwnd_quota;
  1476. int result;
  1477. sent_pkts = 0;
  1478. if (!push_one) {
  1479. /* Do MTU probing. */
  1480. result = tcp_mtu_probe(sk);
  1481. if (!result) {
  1482. return 0;
  1483. } else if (result > 0) {
  1484. sent_pkts = 1;
  1485. }
  1486. }
  1487. while ((skb = tcp_send_head(sk))) {
  1488. unsigned int limit;
  1489. tso_segs = tcp_init_tso_segs(sk, skb, mss_now);
  1490. BUG_ON(!tso_segs);
  1491. cwnd_quota = tcp_cwnd_test(tp, skb);
  1492. if (!cwnd_quota)
  1493. break;
  1494. if (unlikely(!tcp_snd_wnd_test(tp, skb, mss_now)))
  1495. break;
  1496. if (tso_segs == 1) {
  1497. if (unlikely(!tcp_nagle_test(tp, skb, mss_now,
  1498. (tcp_skb_is_last(sk, skb) ?
  1499. nonagle : TCP_NAGLE_PUSH))))
  1500. break;
  1501. } else {
  1502. if (!push_one && tcp_tso_should_defer(sk, skb))
  1503. break;
  1504. }
  1505. limit = mss_now;
  1506. if (tso_segs > 1 && !tcp_urg_mode(tp))
  1507. limit = tcp_mss_split_point(sk, skb, mss_now,
  1508. cwnd_quota);
  1509. if (skb->len > limit &&
  1510. unlikely(tso_fragment(sk, skb, limit, mss_now, gfp)))
  1511. break;
  1512. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  1513. if (unlikely(tcp_transmit_skb(sk, skb, 1, gfp)))
  1514. break;
  1515. /* Advance the send_head. This one is sent out.
  1516. * This call will increment packets_out.
  1517. */
  1518. tcp_event_new_data_sent(sk, skb);
  1519. tcp_minshall_update(tp, mss_now, skb);
  1520. sent_pkts++;
  1521. if (push_one)
  1522. break;
  1523. }
  1524. if (likely(sent_pkts)) {
  1525. tcp_cwnd_validate(sk);
  1526. return 0;
  1527. }
  1528. return !tp->packets_out && tcp_send_head(sk);
  1529. }
  1530. /* Push out any pending frames which were held back due to
  1531. * TCP_CORK or attempt at coalescing tiny packets.
  1532. * The socket must be locked by the caller.
  1533. */
  1534. void __tcp_push_pending_frames(struct sock *sk, unsigned int cur_mss,
  1535. int nonagle)
  1536. {
  1537. /* If we are closed, the bytes will have to remain here.
  1538. * In time closedown will finish, we empty the write queue and
  1539. * all will be happy.
  1540. */
  1541. if (unlikely(sk->sk_state == TCP_CLOSE))
  1542. return;
  1543. if (tcp_write_xmit(sk, cur_mss, nonagle, 0, GFP_ATOMIC))
  1544. tcp_check_probe_timer(sk);
  1545. }
  1546. /* Send _single_ skb sitting at the send head. This function requires
  1547. * true push pending frames to setup probe timer etc.
  1548. */
  1549. void tcp_push_one(struct sock *sk, unsigned int mss_now)
  1550. {
  1551. struct sk_buff *skb = tcp_send_head(sk);
  1552. BUG_ON(!skb || skb->len < mss_now);
  1553. tcp_write_xmit(sk, mss_now, TCP_NAGLE_PUSH, 1, sk->sk_allocation);
  1554. }
  1555. /* This function returns the amount that we can raise the
  1556. * usable window based on the following constraints
  1557. *
  1558. * 1. The window can never be shrunk once it is offered (RFC 793)
  1559. * 2. We limit memory per socket
  1560. *
  1561. * RFC 1122:
  1562. * "the suggested [SWS] avoidance algorithm for the receiver is to keep
  1563. * RECV.NEXT + RCV.WIN fixed until:
  1564. * RCV.BUFF - RCV.USER - RCV.WINDOW >= min(1/2 RCV.BUFF, MSS)"
  1565. *
  1566. * i.e. don't raise the right edge of the window until you can raise
  1567. * it at least MSS bytes.
  1568. *
  1569. * Unfortunately, the recommended algorithm breaks header prediction,
  1570. * since header prediction assumes th->window stays fixed.
  1571. *
  1572. * Strictly speaking, keeping th->window fixed violates the receiver
  1573. * side SWS prevention criteria. The problem is that under this rule
  1574. * a stream of single byte packets will cause the right side of the
  1575. * window to always advance by a single byte.
  1576. *
  1577. * Of course, if the sender implements sender side SWS prevention
  1578. * then this will not be a problem.
  1579. *
  1580. * BSD seems to make the following compromise:
  1581. *
  1582. * If the free space is less than the 1/4 of the maximum
  1583. * space available and the free space is less than 1/2 mss,
  1584. * then set the window to 0.
  1585. * [ Actually, bsd uses MSS and 1/4 of maximal _window_ ]
  1586. * Otherwise, just prevent the window from shrinking
  1587. * and from being larger than the largest representable value.
  1588. *
  1589. * This prevents incremental opening of the window in the regime
  1590. * where TCP is limited by the speed of the reader side taking
  1591. * data out of the TCP receive queue. It does nothing about
  1592. * those cases where the window is constrained on the sender side
  1593. * because the pipeline is full.
  1594. *
  1595. * BSD also seems to "accidentally" limit itself to windows that are a
  1596. * multiple of MSS, at least until the free space gets quite small.
  1597. * This would appear to be a side effect of the mbuf implementation.
  1598. * Combining these two algorithms results in the observed behavior
  1599. * of having a fixed window size at almost all times.
  1600. *
  1601. * Below we obtain similar behavior by forcing the offered window to
  1602. * a multiple of the mss when it is feasible to do so.
  1603. *
  1604. * Note, we don't "adjust" for TIMESTAMP or SACK option bytes.
  1605. * Regular options like TIMESTAMP are taken into account.
  1606. */
  1607. u32 __tcp_select_window(struct sock *sk)
  1608. {
  1609. struct inet_connection_sock *icsk = inet_csk(sk);
  1610. struct tcp_sock *tp = tcp_sk(sk);
  1611. /* MSS for the peer's data. Previous versions used mss_clamp
  1612. * here. I don't know if the value based on our guesses
  1613. * of peer's MSS is better for the performance. It's more correct
  1614. * but may be worse for the performance because of rcv_mss
  1615. * fluctuations. --SAW 1998/11/1
  1616. */
  1617. int mss = icsk->icsk_ack.rcv_mss;
  1618. int free_space = tcp_space(sk);
  1619. int full_space = min_t(int, tp->window_clamp, tcp_full_space(sk));
  1620. int window;
  1621. if (mss > full_space)
  1622. mss = full_space;
  1623. if (free_space < (full_space >> 1)) {
  1624. icsk->icsk_ack.quick = 0;
  1625. if (tcp_memory_pressure)
  1626. tp->rcv_ssthresh = min(tp->rcv_ssthresh,
  1627. 4U * tp->advmss);
  1628. if (free_space < mss)
  1629. return 0;
  1630. }
  1631. if (free_space > tp->rcv_ssthresh)
  1632. free_space = tp->rcv_ssthresh;
  1633. /* Don't do rounding if we are using window scaling, since the
  1634. * scaled window will not line up with the MSS boundary anyway.
  1635. */
  1636. window = tp->rcv_wnd;
  1637. if (tp->rx_opt.rcv_wscale) {
  1638. window = free_space;
  1639. /* Advertise enough space so that it won't get scaled away.
  1640. * Import case: prevent zero window announcement if
  1641. * 1<<rcv_wscale > mss.
  1642. */
  1643. if (((window >> tp->rx_opt.rcv_wscale) << tp->rx_opt.rcv_wscale) != window)
  1644. window = (((window >> tp->rx_opt.rcv_wscale) + 1)
  1645. << tp->rx_opt.rcv_wscale);
  1646. } else {
  1647. /* Get the largest window that is a nice multiple of mss.
  1648. * Window clamp already applied above.
  1649. * If our current window offering is within 1 mss of the
  1650. * free space we just keep it. This prevents the divide
  1651. * and multiply from happening most of the time.
  1652. * We also don't do any window rounding when the free space
  1653. * is too small.
  1654. */
  1655. if (window <= free_space - mss || window > free_space)
  1656. window = (free_space / mss) * mss;
  1657. else if (mss == full_space &&
  1658. free_space > window + (full_space >> 1))
  1659. window = free_space;
  1660. }
  1661. return window;
  1662. }
  1663. /* Collapses two adjacent SKB's during retransmission. */
  1664. static void tcp_collapse_retrans(struct sock *sk, struct sk_buff *skb)
  1665. {
  1666. struct tcp_sock *tp = tcp_sk(sk);
  1667. struct sk_buff *next_skb = tcp_write_queue_next(sk, skb);
  1668. int skb_size, next_skb_size;
  1669. skb_size = skb->len;
  1670. next_skb_size = next_skb->len;
  1671. BUG_ON(tcp_skb_pcount(skb) != 1 || tcp_skb_pcount(next_skb) != 1);
  1672. tcp_highest_sack_combine(sk, next_skb, skb);
  1673. tcp_unlink_write_queue(next_skb, sk);
  1674. skb_copy_from_linear_data(next_skb, skb_put(skb, next_skb_size),
  1675. next_skb_size);
  1676. if (next_skb->ip_summed == CHECKSUM_PARTIAL)
  1677. skb->ip_summed = CHECKSUM_PARTIAL;
  1678. if (skb->ip_summed != CHECKSUM_PARTIAL)
  1679. skb->csum = csum_block_add(skb->csum, next_skb->csum, skb_size);
  1680. /* Update sequence range on original skb. */
  1681. TCP_SKB_CB(skb)->end_seq = TCP_SKB_CB(next_skb)->end_seq;
  1682. /* Merge over control information. This moves PSH/FIN etc. over */
  1683. TCP_SKB_CB(skb)->flags |= TCP_SKB_CB(next_skb)->flags;
  1684. /* All done, get rid of second SKB and account for it so
  1685. * packet counting does not break.
  1686. */
  1687. TCP_SKB_CB(skb)->sacked |= TCP_SKB_CB(next_skb)->sacked & TCPCB_EVER_RETRANS;
  1688. /* changed transmit queue under us so clear hints */
  1689. tcp_clear_retrans_hints_partial(tp);
  1690. if (next_skb == tp->retransmit_skb_hint)
  1691. tp->retransmit_skb_hint = skb;
  1692. tcp_adjust_pcount(sk, next_skb, tcp_skb_pcount(next_skb));
  1693. sk_wmem_free_skb(sk, next_skb);
  1694. }
  1695. /* Check if coalescing SKBs is legal. */
  1696. static int tcp_can_collapse(struct sock *sk, struct sk_buff *skb)
  1697. {
  1698. if (tcp_skb_pcount(skb) > 1)
  1699. return 0;
  1700. /* TODO: SACK collapsing could be used to remove this condition */
  1701. if (skb_shinfo(skb)->nr_frags != 0)
  1702. return 0;
  1703. if (skb_cloned(skb))
  1704. return 0;
  1705. if (skb == tcp_send_head(sk))
  1706. return 0;
  1707. /* Some heurestics for collapsing over SACK'd could be invented */
  1708. if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_ACKED)
  1709. return 0;
  1710. return 1;
  1711. }
  1712. /* Collapse packets in the retransmit queue to make to create
  1713. * less packets on the wire. This is only done on retransmission.
  1714. */
  1715. static void tcp_retrans_try_collapse(struct sock *sk, struct sk_buff *to,
  1716. int space)
  1717. {
  1718. struct tcp_sock *tp = tcp_sk(sk);
  1719. struct sk_buff *skb = to, *tmp;
  1720. int first = 1;
  1721. if (!sysctl_tcp_retrans_collapse)
  1722. return;
  1723. if (TCP_SKB_CB(skb)->flags & TCPHDR_SYN)
  1724. return;
  1725. tcp_for_write_queue_from_safe(skb, tmp, sk) {
  1726. if (!tcp_can_collapse(sk, skb))
  1727. break;
  1728. space -= skb->len;
  1729. if (first) {
  1730. first = 0;
  1731. continue;
  1732. }
  1733. if (space < 0)
  1734. break;
  1735. /* Punt if not enough space exists in the first SKB for
  1736. * the data in the second
  1737. */
  1738. if (skb->len > skb_tailroom(to))
  1739. break;
  1740. if (after(TCP_SKB_CB(skb)->end_seq, tcp_wnd_end(tp)))
  1741. break;
  1742. tcp_collapse_retrans(sk, to);
  1743. }
  1744. }
  1745. /* This retransmits one SKB. Policy decisions and retransmit queue
  1746. * state updates are done by the caller. Returns non-zero if an
  1747. * error occurred which prevented the send.
  1748. */
  1749. int tcp_retransmit_skb(struct sock *sk, struct sk_buff *skb)
  1750. {
  1751. struct tcp_sock *tp = tcp_sk(sk);
  1752. struct inet_connection_sock *icsk = inet_csk(sk);
  1753. unsigned int cur_mss;
  1754. int err;
  1755. /* Inconslusive MTU probe */
  1756. if (icsk->icsk_mtup.probe_size) {
  1757. icsk->icsk_mtup.probe_size = 0;
  1758. }
  1759. /* Do not sent more than we queued. 1/4 is reserved for possible
  1760. * copying overhead: fragmentation, tunneling, mangling etc.
  1761. */
  1762. if (atomic_read(&sk->sk_wmem_alloc) >
  1763. min(sk->sk_wmem_queued + (sk->sk_wmem_queued >> 2), sk->sk_sndbuf))
  1764. return -EAGAIN;
  1765. if (before(TCP_SKB_CB(skb)->seq, tp->snd_una)) {
  1766. if (before(TCP_SKB_CB(skb)->end_seq, tp->snd_una))
  1767. BUG();
  1768. if (tcp_trim_head(sk, skb, tp->snd_una - TCP_SKB_CB(skb)->seq))
  1769. return -ENOMEM;
  1770. }
  1771. if (inet_csk(sk)->icsk_af_ops->rebuild_header(sk))
  1772. return -EHOSTUNREACH; /* Routing failure or similar. */
  1773. cur_mss = tcp_current_mss(sk);
  1774. /* If receiver has shrunk his window, and skb is out of
  1775. * new window, do not retransmit it. The exception is the
  1776. * case, when window is shrunk to zero. In this case
  1777. * our retransmit serves as a zero window probe.
  1778. */
  1779. if (!before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp)) &&
  1780. TCP_SKB_CB(skb)->seq != tp->snd_una)
  1781. return -EAGAIN;
  1782. if (skb->len > cur_mss) {
  1783. if (tcp_fragment(sk, skb, cur_mss, cur_mss))
  1784. return -ENOMEM; /* We'll try again later. */
  1785. } else {
  1786. int oldpcount = tcp_skb_pcount(skb);
  1787. if (unlikely(oldpcount > 1)) {
  1788. tcp_init_tso_segs(sk, skb, cur_mss);
  1789. tcp_adjust_pcount(sk, skb, oldpcount - tcp_skb_pcount(skb));
  1790. }
  1791. }
  1792. tcp_retrans_try_collapse(sk, skb, cur_mss);
  1793. /* Some Solaris stacks overoptimize and ignore the FIN on a
  1794. * retransmit when old data is attached. So strip it off
  1795. * since it is cheap to do so and saves bytes on the network.
  1796. */
  1797. if (skb->len > 0 &&
  1798. (TCP_SKB_CB(skb)->flags & TCPHDR_FIN) &&
  1799. tp->snd_una == (TCP_SKB_CB(skb)->end_seq - 1)) {
  1800. if (!pskb_trim(skb, 0)) {
  1801. /* Reuse, even though it does some unnecessary work */
  1802. tcp_init_nondata_skb(skb, TCP_SKB_CB(skb)->end_seq - 1,
  1803. TCP_SKB_CB(skb)->flags);
  1804. skb->ip_summed = CHECKSUM_NONE;
  1805. }
  1806. }
  1807. /* Make a copy, if the first transmission SKB clone we made
  1808. * is still in somebody's hands, else make a clone.
  1809. */
  1810. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  1811. err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
  1812. if (err == 0) {
  1813. /* Update global TCP statistics. */
  1814. TCP_INC_STATS(sock_net(sk), TCP_MIB_RETRANSSEGS);
  1815. tp->total_retrans++;
  1816. #if FASTRETRANS_DEBUG > 0
  1817. if (TCP_SKB_CB(skb)->sacked & TCPCB_SACKED_RETRANS) {
  1818. if (net_ratelimit())
  1819. printk(KERN_DEBUG "retrans_out leaked.\n");
  1820. }
  1821. #endif
  1822. if (!tp->retrans_out)
  1823. tp->lost_retrans_low = tp->snd_nxt;
  1824. TCP_SKB_CB(skb)->sacked |= TCPCB_RETRANS;
  1825. tp->retrans_out += tcp_skb_pcount(skb);
  1826. /* Save stamp of the first retransmit. */
  1827. if (!tp->retrans_stamp)
  1828. tp->retrans_stamp = TCP_SKB_CB(skb)->when;
  1829. tp->undo_retrans += tcp_skb_pcount(skb);
  1830. /* snd_nxt is stored to detect loss of retransmitted segment,
  1831. * see tcp_input.c tcp_sacktag_write_queue().
  1832. */
  1833. TCP_SKB_CB(skb)->ack_seq = tp->snd_nxt;
  1834. }
  1835. return err;
  1836. }
  1837. /* Check if we forward retransmits are possible in the current
  1838. * window/congestion state.
  1839. */
  1840. static int tcp_can_forward_retransmit(struct sock *sk)
  1841. {
  1842. const struct inet_connection_sock *icsk = inet_csk(sk);
  1843. struct tcp_sock *tp = tcp_sk(sk);
  1844. /* Forward retransmissions are possible only during Recovery. */
  1845. if (icsk->icsk_ca_state != TCP_CA_Recovery)
  1846. return 0;
  1847. /* No forward retransmissions in Reno are possible. */
  1848. if (tcp_is_reno(tp))
  1849. return 0;
  1850. /* Yeah, we have to make difficult choice between forward transmission
  1851. * and retransmission... Both ways have their merits...
  1852. *
  1853. * For now we do not retransmit anything, while we have some new
  1854. * segments to send. In the other cases, follow rule 3 for
  1855. * NextSeg() specified in RFC3517.
  1856. */
  1857. if (tcp_may_send_now(sk))
  1858. return 0;
  1859. return 1;
  1860. }
  1861. /* This gets called after a retransmit timeout, and the initially
  1862. * retransmitted data is acknowledged. It tries to continue
  1863. * resending the rest of the retransmit queue, until either
  1864. * we've sent it all or the congestion window limit is reached.
  1865. * If doing SACK, the first ACK which comes back for a timeout
  1866. * based retransmit packet might feed us FACK information again.
  1867. * If so, we use it to avoid unnecessarily retransmissions.
  1868. */
  1869. void tcp_xmit_retransmit_queue(struct sock *sk)
  1870. {
  1871. const struct inet_connection_sock *icsk = inet_csk(sk);
  1872. struct tcp_sock *tp = tcp_sk(sk);
  1873. struct sk_buff *skb;
  1874. struct sk_buff *hole = NULL;
  1875. u32 last_lost;
  1876. int mib_idx;
  1877. int fwd_rexmitting = 0;
  1878. if (!tp->packets_out)
  1879. return;
  1880. if (!tp->lost_out)
  1881. tp->retransmit_high = tp->snd_una;
  1882. if (tp->retransmit_skb_hint) {
  1883. skb = tp->retransmit_skb_hint;
  1884. last_lost = TCP_SKB_CB(skb)->end_seq;
  1885. if (after(last_lost, tp->retransmit_high))
  1886. last_lost = tp->retransmit_high;
  1887. } else {
  1888. skb = tcp_write_queue_head(sk);
  1889. last_lost = tp->snd_una;
  1890. }
  1891. tcp_for_write_queue_from(skb, sk) {
  1892. __u8 sacked = TCP_SKB_CB(skb)->sacked;
  1893. if (skb == tcp_send_head(sk))
  1894. break;
  1895. /* we could do better than to assign each time */
  1896. if (hole == NULL)
  1897. tp->retransmit_skb_hint = skb;
  1898. /* Assume this retransmit will generate
  1899. * only one packet for congestion window
  1900. * calculation purposes. This works because
  1901. * tcp_retransmit_skb() will chop up the
  1902. * packet to be MSS sized and all the
  1903. * packet counting works out.
  1904. */
  1905. if (tcp_packets_in_flight(tp) >= tp->snd_cwnd)
  1906. return;
  1907. if (fwd_rexmitting) {
  1908. begin_fwd:
  1909. if (!before(TCP_SKB_CB(skb)->seq, tcp_highest_sack_seq(tp)))
  1910. break;
  1911. mib_idx = LINUX_MIB_TCPFORWARDRETRANS;
  1912. } else if (!before(TCP_SKB_CB(skb)->seq, tp->retransmit_high)) {
  1913. tp->retransmit_high = last_lost;
  1914. if (!tcp_can_forward_retransmit(sk))
  1915. break;
  1916. /* Backtrack if necessary to non-L'ed skb */
  1917. if (hole != NULL) {
  1918. skb = hole;
  1919. hole = NULL;
  1920. }
  1921. fwd_rexmitting = 1;
  1922. goto begin_fwd;
  1923. } else if (!(sacked & TCPCB_LOST)) {
  1924. if (hole == NULL && !(sacked & (TCPCB_SACKED_RETRANS|TCPCB_SACKED_ACKED)))
  1925. hole = skb;
  1926. continue;
  1927. } else {
  1928. last_lost = TCP_SKB_CB(skb)->end_seq;
  1929. if (icsk->icsk_ca_state != TCP_CA_Loss)
  1930. mib_idx = LINUX_MIB_TCPFASTRETRANS;
  1931. else
  1932. mib_idx = LINUX_MIB_TCPSLOWSTARTRETRANS;
  1933. }
  1934. if (sacked & (TCPCB_SACKED_ACKED|TCPCB_SACKED_RETRANS))
  1935. continue;
  1936. if (tcp_retransmit_skb(sk, skb))
  1937. return;
  1938. NET_INC_STATS_BH(sock_net(sk), mib_idx);
  1939. if (skb == tcp_write_queue_head(sk))
  1940. inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
  1941. inet_csk(sk)->icsk_rto,
  1942. TCP_RTO_MAX);
  1943. }
  1944. }
  1945. /* Send a fin. The caller locks the socket for us. This cannot be
  1946. * allowed to fail queueing a FIN frame under any circumstances.
  1947. */
  1948. void tcp_send_fin(struct sock *sk)
  1949. {
  1950. struct tcp_sock *tp = tcp_sk(sk);
  1951. struct sk_buff *skb = tcp_write_queue_tail(sk);
  1952. int mss_now;
  1953. /* Optimization, tack on the FIN if we have a queue of
  1954. * unsent frames. But be careful about outgoing SACKS
  1955. * and IP options.
  1956. */
  1957. mss_now = tcp_current_mss(sk);
  1958. if (tcp_send_head(sk) != NULL) {
  1959. TCP_SKB_CB(skb)->flags |= TCPHDR_FIN;
  1960. TCP_SKB_CB(skb)->end_seq++;
  1961. tp->write_seq++;
  1962. } else {
  1963. /* Socket is locked, keep trying until memory is available. */
  1964. for (;;) {
  1965. skb = alloc_skb_fclone(MAX_TCP_HEADER,
  1966. sk->sk_allocation);
  1967. if (skb)
  1968. break;
  1969. yield();
  1970. }
  1971. /* Reserve space for headers and prepare control bits. */
  1972. skb_reserve(skb, MAX_TCP_HEADER);
  1973. /* FIN eats a sequence byte, write_seq advanced by tcp_queue_skb(). */
  1974. tcp_init_nondata_skb(skb, tp->write_seq,
  1975. TCPHDR_ACK | TCPHDR_FIN);
  1976. tcp_queue_skb(sk, skb);
  1977. }
  1978. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_OFF);
  1979. }
  1980. /* We get here when a process closes a file descriptor (either due to
  1981. * an explicit close() or as a byproduct of exit()'ing) and there
  1982. * was unread data in the receive queue. This behavior is recommended
  1983. * by RFC 2525, section 2.17. -DaveM
  1984. */
  1985. void tcp_send_active_reset(struct sock *sk, gfp_t priority)
  1986. {
  1987. struct sk_buff *skb;
  1988. /* NOTE: No TCP options attached and we never retransmit this. */
  1989. skb = alloc_skb(MAX_TCP_HEADER, priority);
  1990. if (!skb) {
  1991. NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED);
  1992. return;
  1993. }
  1994. /* Reserve space for headers and prepare control bits. */
  1995. skb_reserve(skb, MAX_TCP_HEADER);
  1996. tcp_init_nondata_skb(skb, tcp_acceptable_seq(sk),
  1997. TCPHDR_ACK | TCPHDR_RST);
  1998. /* Send it off. */
  1999. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  2000. if (tcp_transmit_skb(sk, skb, 0, priority))
  2001. NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPABORTFAILED);
  2002. TCP_INC_STATS(sock_net(sk), TCP_MIB_OUTRSTS);
  2003. }
  2004. /* Send a crossed SYN-ACK during socket establishment.
  2005. * WARNING: This routine must only be called when we have already sent
  2006. * a SYN packet that crossed the incoming SYN that caused this routine
  2007. * to get called. If this assumption fails then the initial rcv_wnd
  2008. * and rcv_wscale values will not be correct.
  2009. */
  2010. int tcp_send_synack(struct sock *sk)
  2011. {
  2012. struct sk_buff *skb;
  2013. skb = tcp_write_queue_head(sk);
  2014. if (skb == NULL || !(TCP_SKB_CB(skb)->flags & TCPHDR_SYN)) {
  2015. printk(KERN_DEBUG "tcp_send_synack: wrong queue state\n");
  2016. return -EFAULT;
  2017. }
  2018. if (!(TCP_SKB_CB(skb)->flags & TCPHDR_ACK)) {
  2019. if (skb_cloned(skb)) {
  2020. struct sk_buff *nskb = skb_copy(skb, GFP_ATOMIC);
  2021. if (nskb == NULL)
  2022. return -ENOMEM;
  2023. tcp_unlink_write_queue(skb, sk);
  2024. skb_header_release(nskb);
  2025. __tcp_add_write_queue_head(sk, nskb);
  2026. sk_wmem_free_skb(sk, skb);
  2027. sk->sk_wmem_queued += nskb->truesize;
  2028. sk_mem_charge(sk, nskb->truesize);
  2029. skb = nskb;
  2030. }
  2031. TCP_SKB_CB(skb)->flags |= TCPHDR_ACK;
  2032. TCP_ECN_send_synack(tcp_sk(sk), skb);
  2033. }
  2034. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  2035. return tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
  2036. }
  2037. /* Prepare a SYN-ACK. */
  2038. struct sk_buff *tcp_make_synack(struct sock *sk, struct dst_entry *dst,
  2039. struct request_sock *req,
  2040. struct request_values *rvp)
  2041. {
  2042. struct tcp_out_options opts;
  2043. struct tcp_extend_values *xvp = tcp_xv(rvp);
  2044. struct inet_request_sock *ireq = inet_rsk(req);
  2045. struct tcp_sock *tp = tcp_sk(sk);
  2046. const struct tcp_cookie_values *cvp = tp->cookie_values;
  2047. struct tcphdr *th;
  2048. struct sk_buff *skb;
  2049. struct tcp_md5sig_key *md5;
  2050. int tcp_header_size;
  2051. int mss;
  2052. int s_data_desired = 0;
  2053. if (cvp != NULL && cvp->s_data_constant && cvp->s_data_desired)
  2054. s_data_desired = cvp->s_data_desired;
  2055. skb = sock_wmalloc(sk, MAX_TCP_HEADER + 15 + s_data_desired, 1, GFP_ATOMIC);
  2056. if (skb == NULL)
  2057. return NULL;
  2058. /* Reserve space for headers. */
  2059. skb_reserve(skb, MAX_TCP_HEADER);
  2060. skb_dst_set(skb, dst_clone(dst));
  2061. mss = dst_metric_advmss(dst);
  2062. if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < mss)
  2063. mss = tp->rx_opt.user_mss;
  2064. if (req->rcv_wnd == 0) { /* ignored for retransmitted syns */
  2065. __u8 rcv_wscale;
  2066. /* Set this up on the first call only */
  2067. req->window_clamp = tp->window_clamp ? : dst_metric(dst, RTAX_WINDOW);
  2068. /* limit the window selection if the user enforce a smaller rx buffer */
  2069. if (sk->sk_userlocks & SOCK_RCVBUF_LOCK &&
  2070. (req->window_clamp > tcp_full_space(sk) || req->window_clamp == 0))
  2071. req->window_clamp = tcp_full_space(sk);
  2072. /* tcp_full_space because it is guaranteed to be the first packet */
  2073. tcp_select_initial_window(tcp_full_space(sk),
  2074. mss - (ireq->tstamp_ok ? TCPOLEN_TSTAMP_ALIGNED : 0),
  2075. &req->rcv_wnd,
  2076. &req->window_clamp,
  2077. ireq->wscale_ok,
  2078. &rcv_wscale,
  2079. dst_metric(dst, RTAX_INITRWND));
  2080. ireq->rcv_wscale = rcv_wscale;
  2081. }
  2082. memset(&opts, 0, sizeof(opts));
  2083. #ifdef CONFIG_SYN_COOKIES
  2084. if (unlikely(req->cookie_ts))
  2085. TCP_SKB_CB(skb)->when = cookie_init_timestamp(req);
  2086. else
  2087. #endif
  2088. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  2089. tcp_header_size = tcp_synack_options(sk, req, mss,
  2090. skb, &opts, &md5, xvp)
  2091. + sizeof(*th);
  2092. skb_push(skb, tcp_header_size);
  2093. skb_reset_transport_header(skb);
  2094. th = tcp_hdr(skb);
  2095. memset(th, 0, sizeof(struct tcphdr));
  2096. th->syn = 1;
  2097. th->ack = 1;
  2098. TCP_ECN_make_synack(req, th);
  2099. th->source = ireq->loc_port;
  2100. th->dest = ireq->rmt_port;
  2101. /* Setting of flags are superfluous here for callers (and ECE is
  2102. * not even correctly set)
  2103. */
  2104. tcp_init_nondata_skb(skb, tcp_rsk(req)->snt_isn,
  2105. TCPHDR_SYN | TCPHDR_ACK);
  2106. if (OPTION_COOKIE_EXTENSION & opts.options) {
  2107. if (s_data_desired) {
  2108. u8 *buf = skb_put(skb, s_data_desired);
  2109. /* copy data directly from the listening socket. */
  2110. memcpy(buf, cvp->s_data_payload, s_data_desired);
  2111. TCP_SKB_CB(skb)->end_seq += s_data_desired;
  2112. }
  2113. if (opts.hash_size > 0) {
  2114. __u32 workspace[SHA_WORKSPACE_WORDS];
  2115. u32 *mess = &xvp->cookie_bakery[COOKIE_DIGEST_WORDS];
  2116. u32 *tail = &mess[COOKIE_MESSAGE_WORDS-1];
  2117. /* Secret recipe depends on the Timestamp, (future)
  2118. * Sequence and Acknowledgment Numbers, Initiator
  2119. * Cookie, and others handled by IP variant caller.
  2120. */
  2121. *tail-- ^= opts.tsval;
  2122. *tail-- ^= tcp_rsk(req)->rcv_isn + 1;
  2123. *tail-- ^= TCP_SKB_CB(skb)->seq + 1;
  2124. /* recommended */
  2125. *tail-- ^= (((__force u32)th->dest << 16) | (__force u32)th->source);
  2126. *tail-- ^= (u32)(unsigned long)cvp; /* per sockopt */
  2127. sha_transform((__u32 *)&xvp->cookie_bakery[0],
  2128. (char *)mess,
  2129. &workspace[0]);
  2130. opts.hash_location =
  2131. (__u8 *)&xvp->cookie_bakery[0];
  2132. }
  2133. }
  2134. th->seq = htonl(TCP_SKB_CB(skb)->seq);
  2135. th->ack_seq = htonl(tcp_rsk(req)->rcv_isn + 1);
  2136. /* RFC1323: The window in SYN & SYN/ACK segments is never scaled. */
  2137. th->window = htons(min(req->rcv_wnd, 65535U));
  2138. tcp_options_write((__be32 *)(th + 1), tp, &opts);
  2139. th->doff = (tcp_header_size >> 2);
  2140. TCP_ADD_STATS(sock_net(sk), TCP_MIB_OUTSEGS, tcp_skb_pcount(skb));
  2141. #ifdef CONFIG_TCP_MD5SIG
  2142. /* Okay, we have all we need - do the md5 hash if needed */
  2143. if (md5) {
  2144. tcp_rsk(req)->af_specific->calc_md5_hash(opts.hash_location,
  2145. md5, NULL, req, skb);
  2146. }
  2147. #endif
  2148. return skb;
  2149. }
  2150. EXPORT_SYMBOL(tcp_make_synack);
  2151. /* Do all connect socket setups that can be done AF independent. */
  2152. static void tcp_connect_init(struct sock *sk)
  2153. {
  2154. struct dst_entry *dst = __sk_dst_get(sk);
  2155. struct tcp_sock *tp = tcp_sk(sk);
  2156. __u8 rcv_wscale;
  2157. /* We'll fix this up when we get a response from the other end.
  2158. * See tcp_input.c:tcp_rcv_state_process case TCP_SYN_SENT.
  2159. */
  2160. tp->tcp_header_len = sizeof(struct tcphdr) +
  2161. (sysctl_tcp_timestamps ? TCPOLEN_TSTAMP_ALIGNED : 0);
  2162. #ifdef CONFIG_TCP_MD5SIG
  2163. if (tp->af_specific->md5_lookup(sk, sk) != NULL)
  2164. tp->tcp_header_len += TCPOLEN_MD5SIG_ALIGNED;
  2165. #endif
  2166. /* If user gave his TCP_MAXSEG, record it to clamp */
  2167. if (tp->rx_opt.user_mss)
  2168. tp->rx_opt.mss_clamp = tp->rx_opt.user_mss;
  2169. tp->max_window = 0;
  2170. tcp_mtup_init(sk);
  2171. tcp_sync_mss(sk, dst_mtu(dst));
  2172. if (!tp->window_clamp)
  2173. tp->window_clamp = dst_metric(dst, RTAX_WINDOW);
  2174. tp->advmss = dst_metric_advmss(dst);
  2175. if (tp->rx_opt.user_mss && tp->rx_opt.user_mss < tp->advmss)
  2176. tp->advmss = tp->rx_opt.user_mss;
  2177. tcp_initialize_rcv_mss(sk);
  2178. /* limit the window selection if the user enforce a smaller rx buffer */
  2179. if (sk->sk_userlocks & SOCK_RCVBUF_LOCK &&
  2180. (tp->window_clamp > tcp_full_space(sk) || tp->window_clamp == 0))
  2181. tp->window_clamp = tcp_full_space(sk);
  2182. tcp_select_initial_window(tcp_full_space(sk),
  2183. tp->advmss - (tp->rx_opt.ts_recent_stamp ? tp->tcp_header_len - sizeof(struct tcphdr) : 0),
  2184. &tp->rcv_wnd,
  2185. &tp->window_clamp,
  2186. sysctl_tcp_window_scaling,
  2187. &rcv_wscale,
  2188. dst_metric(dst, RTAX_INITRWND));
  2189. tp->rx_opt.rcv_wscale = rcv_wscale;
  2190. tp->rcv_ssthresh = tp->rcv_wnd;
  2191. sk->sk_err = 0;
  2192. sock_reset_flag(sk, SOCK_DONE);
  2193. tp->snd_wnd = 0;
  2194. tcp_init_wl(tp, 0);
  2195. tp->snd_una = tp->write_seq;
  2196. tp->snd_sml = tp->write_seq;
  2197. tp->snd_up = tp->write_seq;
  2198. tp->rcv_nxt = 0;
  2199. tp->rcv_wup = 0;
  2200. tp->copied_seq = 0;
  2201. inet_csk(sk)->icsk_rto = TCP_TIMEOUT_INIT;
  2202. inet_csk(sk)->icsk_retransmits = 0;
  2203. tcp_clear_retrans(tp);
  2204. }
  2205. /* Build a SYN and send it off. */
  2206. int tcp_connect(struct sock *sk)
  2207. {
  2208. struct tcp_sock *tp = tcp_sk(sk);
  2209. struct sk_buff *buff;
  2210. int err;
  2211. tcp_connect_init(sk);
  2212. buff = alloc_skb_fclone(MAX_TCP_HEADER + 15, sk->sk_allocation);
  2213. if (unlikely(buff == NULL))
  2214. return -ENOBUFS;
  2215. /* Reserve space for headers. */
  2216. skb_reserve(buff, MAX_TCP_HEADER);
  2217. tp->snd_nxt = tp->write_seq;
  2218. tcp_init_nondata_skb(buff, tp->write_seq++, TCPHDR_SYN);
  2219. TCP_ECN_send_syn(sk, buff);
  2220. /* Send it off. */
  2221. TCP_SKB_CB(buff)->when = tcp_time_stamp;
  2222. tp->retrans_stamp = TCP_SKB_CB(buff)->when;
  2223. skb_header_release(buff);
  2224. __tcp_add_write_queue_tail(sk, buff);
  2225. sk->sk_wmem_queued += buff->truesize;
  2226. sk_mem_charge(sk, buff->truesize);
  2227. tp->packets_out += tcp_skb_pcount(buff);
  2228. err = tcp_transmit_skb(sk, buff, 1, sk->sk_allocation);
  2229. if (err == -ECONNREFUSED)
  2230. return err;
  2231. /* We change tp->snd_nxt after the tcp_transmit_skb() call
  2232. * in order to make this packet get counted in tcpOutSegs.
  2233. */
  2234. tp->snd_nxt = tp->write_seq;
  2235. tp->pushed_seq = tp->write_seq;
  2236. TCP_INC_STATS(sock_net(sk), TCP_MIB_ACTIVEOPENS);
  2237. /* Timer for repeating the SYN until an answer. */
  2238. inet_csk_reset_xmit_timer(sk, ICSK_TIME_RETRANS,
  2239. inet_csk(sk)->icsk_rto, TCP_RTO_MAX);
  2240. return 0;
  2241. }
  2242. EXPORT_SYMBOL(tcp_connect);
  2243. /* Send out a delayed ack, the caller does the policy checking
  2244. * to see if we should even be here. See tcp_input.c:tcp_ack_snd_check()
  2245. * for details.
  2246. */
  2247. void tcp_send_delayed_ack(struct sock *sk)
  2248. {
  2249. struct inet_connection_sock *icsk = inet_csk(sk);
  2250. int ato = icsk->icsk_ack.ato;
  2251. unsigned long timeout;
  2252. if (ato > TCP_DELACK_MIN) {
  2253. const struct tcp_sock *tp = tcp_sk(sk);
  2254. int max_ato = HZ / 2;
  2255. if (icsk->icsk_ack.pingpong ||
  2256. (icsk->icsk_ack.pending & ICSK_ACK_PUSHED))
  2257. max_ato = TCP_DELACK_MAX;
  2258. /* Slow path, intersegment interval is "high". */
  2259. /* If some rtt estimate is known, use it to bound delayed ack.
  2260. * Do not use inet_csk(sk)->icsk_rto here, use results of rtt measurements
  2261. * directly.
  2262. */
  2263. if (tp->srtt) {
  2264. int rtt = max(tp->srtt >> 3, TCP_DELACK_MIN);
  2265. if (rtt < max_ato)
  2266. max_ato = rtt;
  2267. }
  2268. ato = min(ato, max_ato);
  2269. }
  2270. /* Stay within the limit we were given */
  2271. timeout = jiffies + ato;
  2272. /* Use new timeout only if there wasn't a older one earlier. */
  2273. if (icsk->icsk_ack.pending & ICSK_ACK_TIMER) {
  2274. /* If delack timer was blocked or is about to expire,
  2275. * send ACK now.
  2276. */
  2277. if (icsk->icsk_ack.blocked ||
  2278. time_before_eq(icsk->icsk_ack.timeout, jiffies + (ato >> 2))) {
  2279. tcp_send_ack(sk);
  2280. return;
  2281. }
  2282. if (!time_before(timeout, icsk->icsk_ack.timeout))
  2283. timeout = icsk->icsk_ack.timeout;
  2284. }
  2285. icsk->icsk_ack.pending |= ICSK_ACK_SCHED | ICSK_ACK_TIMER;
  2286. icsk->icsk_ack.timeout = timeout;
  2287. sk_reset_timer(sk, &icsk->icsk_delack_timer, timeout);
  2288. }
  2289. /* This routine sends an ack and also updates the window. */
  2290. void tcp_send_ack(struct sock *sk)
  2291. {
  2292. struct sk_buff *buff;
  2293. /* If we have been reset, we may not send again. */
  2294. if (sk->sk_state == TCP_CLOSE)
  2295. return;
  2296. /* We are not putting this on the write queue, so
  2297. * tcp_transmit_skb() will set the ownership to this
  2298. * sock.
  2299. */
  2300. buff = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC);
  2301. if (buff == NULL) {
  2302. inet_csk_schedule_ack(sk);
  2303. inet_csk(sk)->icsk_ack.ato = TCP_ATO_MIN;
  2304. inet_csk_reset_xmit_timer(sk, ICSK_TIME_DACK,
  2305. TCP_DELACK_MAX, TCP_RTO_MAX);
  2306. return;
  2307. }
  2308. /* Reserve space for headers and prepare control bits. */
  2309. skb_reserve(buff, MAX_TCP_HEADER);
  2310. tcp_init_nondata_skb(buff, tcp_acceptable_seq(sk), TCPHDR_ACK);
  2311. /* Send it off, this clears delayed acks for us. */
  2312. TCP_SKB_CB(buff)->when = tcp_time_stamp;
  2313. tcp_transmit_skb(sk, buff, 0, GFP_ATOMIC);
  2314. }
  2315. /* This routine sends a packet with an out of date sequence
  2316. * number. It assumes the other end will try to ack it.
  2317. *
  2318. * Question: what should we make while urgent mode?
  2319. * 4.4BSD forces sending single byte of data. We cannot send
  2320. * out of window data, because we have SND.NXT==SND.MAX...
  2321. *
  2322. * Current solution: to send TWO zero-length segments in urgent mode:
  2323. * one is with SEG.SEQ=SND.UNA to deliver urgent pointer, another is
  2324. * out-of-date with SND.UNA-1 to probe window.
  2325. */
  2326. static int tcp_xmit_probe_skb(struct sock *sk, int urgent)
  2327. {
  2328. struct tcp_sock *tp = tcp_sk(sk);
  2329. struct sk_buff *skb;
  2330. /* We don't queue it, tcp_transmit_skb() sets ownership. */
  2331. skb = alloc_skb(MAX_TCP_HEADER, GFP_ATOMIC);
  2332. if (skb == NULL)
  2333. return -1;
  2334. /* Reserve space for headers and set control bits. */
  2335. skb_reserve(skb, MAX_TCP_HEADER);
  2336. /* Use a previous sequence. This should cause the other
  2337. * end to send an ack. Don't queue or clone SKB, just
  2338. * send it.
  2339. */
  2340. tcp_init_nondata_skb(skb, tp->snd_una - !urgent, TCPHDR_ACK);
  2341. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  2342. return tcp_transmit_skb(sk, skb, 0, GFP_ATOMIC);
  2343. }
  2344. /* Initiate keepalive or window probe from timer. */
  2345. int tcp_write_wakeup(struct sock *sk)
  2346. {
  2347. struct tcp_sock *tp = tcp_sk(sk);
  2348. struct sk_buff *skb;
  2349. if (sk->sk_state == TCP_CLOSE)
  2350. return -1;
  2351. if ((skb = tcp_send_head(sk)) != NULL &&
  2352. before(TCP_SKB_CB(skb)->seq, tcp_wnd_end(tp))) {
  2353. int err;
  2354. unsigned int mss = tcp_current_mss(sk);
  2355. unsigned int seg_size = tcp_wnd_end(tp) - TCP_SKB_CB(skb)->seq;
  2356. if (before(tp->pushed_seq, TCP_SKB_CB(skb)->end_seq))
  2357. tp->pushed_seq = TCP_SKB_CB(skb)->end_seq;
  2358. /* We are probing the opening of a window
  2359. * but the window size is != 0
  2360. * must have been a result SWS avoidance ( sender )
  2361. */
  2362. if (seg_size < TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq ||
  2363. skb->len > mss) {
  2364. seg_size = min(seg_size, mss);
  2365. TCP_SKB_CB(skb)->flags |= TCPHDR_PSH;
  2366. if (tcp_fragment(sk, skb, seg_size, mss))
  2367. return -1;
  2368. } else if (!tcp_skb_pcount(skb))
  2369. tcp_set_skb_tso_segs(sk, skb, mss);
  2370. TCP_SKB_CB(skb)->flags |= TCPHDR_PSH;
  2371. TCP_SKB_CB(skb)->when = tcp_time_stamp;
  2372. err = tcp_transmit_skb(sk, skb, 1, GFP_ATOMIC);
  2373. if (!err)
  2374. tcp_event_new_data_sent(sk, skb);
  2375. return err;
  2376. } else {
  2377. if (between(tp->snd_up, tp->snd_una + 1, tp->snd_una + 0xFFFF))
  2378. tcp_xmit_probe_skb(sk, 1);
  2379. return tcp_xmit_probe_skb(sk, 0);
  2380. }
  2381. }
  2382. /* A window probe timeout has occurred. If window is not closed send
  2383. * a partial packet else a zero probe.
  2384. */
  2385. void tcp_send_probe0(struct sock *sk)
  2386. {
  2387. struct inet_connection_sock *icsk = inet_csk(sk);
  2388. struct tcp_sock *tp = tcp_sk(sk);
  2389. int err;
  2390. err = tcp_write_wakeup(sk);
  2391. if (tp->packets_out || !tcp_send_head(sk)) {
  2392. /* Cancel probe timer, if it is not required. */
  2393. icsk->icsk_probes_out = 0;
  2394. icsk->icsk_backoff = 0;
  2395. return;
  2396. }
  2397. if (err <= 0) {
  2398. if (icsk->icsk_backoff < sysctl_tcp_retries2)
  2399. icsk->icsk_backoff++;
  2400. icsk->icsk_probes_out++;
  2401. inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
  2402. min(icsk->icsk_rto << icsk->icsk_backoff, TCP_RTO_MAX),
  2403. TCP_RTO_MAX);
  2404. } else {
  2405. /* If packet was not sent due to local congestion,
  2406. * do not backoff and do not remember icsk_probes_out.
  2407. * Let local senders to fight for local resources.
  2408. *
  2409. * Use accumulated backoff yet.
  2410. */
  2411. if (!icsk->icsk_probes_out)
  2412. icsk->icsk_probes_out = 1;
  2413. inet_csk_reset_xmit_timer(sk, ICSK_TIME_PROBE0,
  2414. min(icsk->icsk_rto << icsk->icsk_backoff,
  2415. TCP_RESOURCE_PROBE_INTERVAL),
  2416. TCP_RTO_MAX);
  2417. }
  2418. }