tcp_output.c 74 KB

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