tcp_output.c 83 KB

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