tcp_output.c 91 KB

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