tcp_output.c 74 KB

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