tcp_output.c 81 KB

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