tcp_output.c 74 KB

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