tcp_output.c 74 KB

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