tcp_output.c 72 KB

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