tcp_output.c 91 KB

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