tcp_output.c 82 KB

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