tcp_output.c 73 KB

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