tcp.c 76 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953
  1. /*
  2. * INET An implementation of the TCP/IP protocol suite for the LINUX
  3. * operating system. INET is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * Implementation of the Transmission Control Protocol(TCP).
  7. *
  8. * Authors: Ross Biro
  9. * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
  10. * Mark Evans, <evansmp@uhura.aston.ac.uk>
  11. * Corey Minyard <wf-rch!minyard@relay.EU.net>
  12. * Florian La Roche, <flla@stud.uni-sb.de>
  13. * Charles Hedrick, <hedrick@klinzhai.rutgers.edu>
  14. * Linus Torvalds, <torvalds@cs.helsinki.fi>
  15. * Alan Cox, <gw4pts@gw4pts.ampr.org>
  16. * Matthew Dillon, <dillon@apollo.west.oic.com>
  17. * Arnt Gulbrandsen, <agulbra@nvg.unit.no>
  18. * Jorge Cwik, <jorge@laser.satlink.net>
  19. *
  20. * Fixes:
  21. * Alan Cox : Numerous verify_area() calls
  22. * Alan Cox : Set the ACK bit on a reset
  23. * Alan Cox : Stopped it crashing if it closed while
  24. * sk->inuse=1 and was trying to connect
  25. * (tcp_err()).
  26. * Alan Cox : All icmp error handling was broken
  27. * pointers passed where wrong and the
  28. * socket was looked up backwards. Nobody
  29. * tested any icmp error code obviously.
  30. * Alan Cox : tcp_err() now handled properly. It
  31. * wakes people on errors. poll
  32. * behaves and the icmp error race
  33. * has gone by moving it into sock.c
  34. * Alan Cox : tcp_send_reset() fixed to work for
  35. * everything not just packets for
  36. * unknown sockets.
  37. * Alan Cox : tcp option processing.
  38. * Alan Cox : Reset tweaked (still not 100%) [Had
  39. * syn rule wrong]
  40. * Herp Rosmanith : More reset fixes
  41. * Alan Cox : No longer acks invalid rst frames.
  42. * Acking any kind of RST is right out.
  43. * Alan Cox : Sets an ignore me flag on an rst
  44. * receive otherwise odd bits of prattle
  45. * escape still
  46. * Alan Cox : Fixed another acking RST frame bug.
  47. * Should stop LAN workplace lockups.
  48. * Alan Cox : Some tidyups using the new skb list
  49. * facilities
  50. * Alan Cox : sk->keepopen now seems to work
  51. * Alan Cox : Pulls options out correctly on accepts
  52. * Alan Cox : Fixed assorted sk->rqueue->next errors
  53. * Alan Cox : PSH doesn't end a TCP read. Switched a
  54. * bit to skb ops.
  55. * Alan Cox : Tidied tcp_data to avoid a potential
  56. * nasty.
  57. * Alan Cox : Added some better commenting, as the
  58. * tcp is hard to follow
  59. * Alan Cox : Removed incorrect check for 20 * psh
  60. * Michael O'Reilly : ack < copied bug fix.
  61. * Johannes Stille : Misc tcp fixes (not all in yet).
  62. * Alan Cox : FIN with no memory -> CRASH
  63. * Alan Cox : Added socket option proto entries.
  64. * Also added awareness of them to accept.
  65. * Alan Cox : Added TCP options (SOL_TCP)
  66. * Alan Cox : Switched wakeup calls to callbacks,
  67. * so the kernel can layer network
  68. * sockets.
  69. * Alan Cox : Use ip_tos/ip_ttl settings.
  70. * Alan Cox : Handle FIN (more) properly (we hope).
  71. * Alan Cox : RST frames sent on unsynchronised
  72. * state ack error.
  73. * Alan Cox : Put in missing check for SYN bit.
  74. * Alan Cox : Added tcp_select_window() aka NET2E
  75. * window non shrink trick.
  76. * Alan Cox : Added a couple of small NET2E timer
  77. * fixes
  78. * Charles Hedrick : TCP fixes
  79. * Toomas Tamm : TCP window fixes
  80. * Alan Cox : Small URG fix to rlogin ^C ack fight
  81. * Charles Hedrick : Rewrote most of it to actually work
  82. * Linus : Rewrote tcp_read() and URG handling
  83. * completely
  84. * Gerhard Koerting: Fixed some missing timer handling
  85. * Matthew Dillon : Reworked TCP machine states as per RFC
  86. * Gerhard Koerting: PC/TCP workarounds
  87. * Adam Caldwell : Assorted timer/timing errors
  88. * Matthew Dillon : Fixed another RST bug
  89. * Alan Cox : Move to kernel side addressing changes.
  90. * Alan Cox : Beginning work on TCP fastpathing
  91. * (not yet usable)
  92. * Arnt Gulbrandsen: Turbocharged tcp_check() routine.
  93. * Alan Cox : TCP fast path debugging
  94. * Alan Cox : Window clamping
  95. * Michael Riepe : Bug in tcp_check()
  96. * Matt Dillon : More TCP improvements and RST bug fixes
  97. * Matt Dillon : Yet more small nasties remove from the
  98. * TCP code (Be very nice to this man if
  99. * tcp finally works 100%) 8)
  100. * Alan Cox : BSD accept semantics.
  101. * Alan Cox : Reset on closedown bug.
  102. * Peter De Schrijver : ENOTCONN check missing in tcp_sendto().
  103. * Michael Pall : Handle poll() after URG properly in
  104. * all cases.
  105. * Michael Pall : Undo the last fix in tcp_read_urg()
  106. * (multi URG PUSH broke rlogin).
  107. * Michael Pall : Fix the multi URG PUSH problem in
  108. * tcp_readable(), poll() after URG
  109. * works now.
  110. * Michael Pall : recv(...,MSG_OOB) never blocks in the
  111. * BSD api.
  112. * Alan Cox : Changed the semantics of sk->socket to
  113. * fix a race and a signal problem with
  114. * accept() and async I/O.
  115. * Alan Cox : Relaxed the rules on tcp_sendto().
  116. * Yury Shevchuk : Really fixed accept() blocking problem.
  117. * Craig I. Hagan : Allow for BSD compatible TIME_WAIT for
  118. * clients/servers which listen in on
  119. * fixed ports.
  120. * Alan Cox : Cleaned the above up and shrank it to
  121. * a sensible code size.
  122. * Alan Cox : Self connect lockup fix.
  123. * Alan Cox : No connect to multicast.
  124. * Ross Biro : Close unaccepted children on master
  125. * socket close.
  126. * Alan Cox : Reset tracing code.
  127. * Alan Cox : Spurious resets on shutdown.
  128. * Alan Cox : Giant 15 minute/60 second timer error
  129. * Alan Cox : Small whoops in polling before an
  130. * accept.
  131. * Alan Cox : Kept the state trace facility since
  132. * it's handy for debugging.
  133. * Alan Cox : More reset handler fixes.
  134. * Alan Cox : Started rewriting the code based on
  135. * the RFC's for other useful protocol
  136. * references see: Comer, KA9Q NOS, and
  137. * for a reference on the difference
  138. * between specifications and how BSD
  139. * works see the 4.4lite source.
  140. * A.N.Kuznetsov : Don't time wait on completion of tidy
  141. * close.
  142. * Linus Torvalds : Fin/Shutdown & copied_seq changes.
  143. * Linus Torvalds : Fixed BSD port reuse to work first syn
  144. * Alan Cox : Reimplemented timers as per the RFC
  145. * and using multiple timers for sanity.
  146. * Alan Cox : Small bug fixes, and a lot of new
  147. * comments.
  148. * Alan Cox : Fixed dual reader crash by locking
  149. * the buffers (much like datagram.c)
  150. * Alan Cox : Fixed stuck sockets in probe. A probe
  151. * now gets fed up of retrying without
  152. * (even a no space) answer.
  153. * Alan Cox : Extracted closing code better
  154. * Alan Cox : Fixed the closing state machine to
  155. * resemble the RFC.
  156. * Alan Cox : More 'per spec' fixes.
  157. * Jorge Cwik : Even faster checksumming.
  158. * Alan Cox : tcp_data() doesn't ack illegal PSH
  159. * only frames. At least one pc tcp stack
  160. * generates them.
  161. * Alan Cox : Cache last socket.
  162. * Alan Cox : Per route irtt.
  163. * Matt Day : poll()->select() match BSD precisely on error
  164. * Alan Cox : New buffers
  165. * Marc Tamsky : Various sk->prot->retransmits and
  166. * sk->retransmits misupdating fixed.
  167. * Fixed tcp_write_timeout: stuck close,
  168. * and TCP syn retries gets used now.
  169. * Mark Yarvis : In tcp_read_wakeup(), don't send an
  170. * ack if state is TCP_CLOSED.
  171. * Alan Cox : Look up device on a retransmit - routes may
  172. * change. Doesn't yet cope with MSS shrink right
  173. * but it's a start!
  174. * Marc Tamsky : Closing in closing fixes.
  175. * Mike Shaver : RFC1122 verifications.
  176. * Alan Cox : rcv_saddr errors.
  177. * Alan Cox : Block double connect().
  178. * Alan Cox : Small hooks for enSKIP.
  179. * Alexey Kuznetsov: Path MTU discovery.
  180. * Alan Cox : Support soft errors.
  181. * Alan Cox : Fix MTU discovery pathological case
  182. * when the remote claims no mtu!
  183. * Marc Tamsky : TCP_CLOSE fix.
  184. * Colin (G3TNE) : Send a reset on syn ack replies in
  185. * window but wrong (fixes NT lpd problems)
  186. * Pedro Roque : Better TCP window handling, delayed ack.
  187. * Joerg Reuter : No modification of locked buffers in
  188. * tcp_do_retransmit()
  189. * Eric Schenk : Changed receiver side silly window
  190. * avoidance algorithm to BSD style
  191. * algorithm. This doubles throughput
  192. * against machines running Solaris,
  193. * and seems to result in general
  194. * improvement.
  195. * Stefan Magdalinski : adjusted tcp_readable() to fix FIONREAD
  196. * Willy Konynenberg : Transparent proxying support.
  197. * Mike McLagan : Routing by source
  198. * Keith Owens : Do proper merging with partial SKB's in
  199. * tcp_do_sendmsg to avoid burstiness.
  200. * Eric Schenk : Fix fast close down bug with
  201. * shutdown() followed by close().
  202. * Andi Kleen : Make poll agree with SIGIO
  203. * Salvatore Sanfilippo : Support SO_LINGER with linger == 1 and
  204. * lingertime == 0 (RFC 793 ABORT Call)
  205. * Hirokazu Takahashi : Use copy_from_user() instead of
  206. * csum_and_copy_from_user() if possible.
  207. *
  208. * This program is free software; you can redistribute it and/or
  209. * modify it under the terms of the GNU General Public License
  210. * as published by the Free Software Foundation; either version
  211. * 2 of the License, or(at your option) any later version.
  212. *
  213. * Description of States:
  214. *
  215. * TCP_SYN_SENT sent a connection request, waiting for ack
  216. *
  217. * TCP_SYN_RECV received a connection request, sent ack,
  218. * waiting for final ack in three-way handshake.
  219. *
  220. * TCP_ESTABLISHED connection established
  221. *
  222. * TCP_FIN_WAIT1 our side has shutdown, waiting to complete
  223. * transmission of remaining buffered data
  224. *
  225. * TCP_FIN_WAIT2 all buffered data sent, waiting for remote
  226. * to shutdown
  227. *
  228. * TCP_CLOSING both sides have shutdown but we still have
  229. * data we have to finish sending
  230. *
  231. * TCP_TIME_WAIT timeout to catch resent junk before entering
  232. * closed, can only be entered from FIN_WAIT2
  233. * or CLOSING. Required because the other end
  234. * may not have gotten our last ACK causing it
  235. * to retransmit the data packet (which we ignore)
  236. *
  237. * TCP_CLOSE_WAIT remote side has shutdown and is waiting for
  238. * us to finish writing our data and to shutdown
  239. * (we have to close() to move on to LAST_ACK)
  240. *
  241. * TCP_LAST_ACK out side has shutdown after remote has
  242. * shutdown. There may still be data in our
  243. * buffer that we have to finish sending
  244. *
  245. * TCP_CLOSE socket is finished
  246. */
  247. #include <linux/kernel.h>
  248. #include <linux/module.h>
  249. #include <linux/types.h>
  250. #include <linux/fcntl.h>
  251. #include <linux/poll.h>
  252. #include <linux/init.h>
  253. #include <linux/fs.h>
  254. #include <linux/skbuff.h>
  255. #include <linux/scatterlist.h>
  256. #include <linux/splice.h>
  257. #include <linux/net.h>
  258. #include <linux/socket.h>
  259. #include <linux/random.h>
  260. #include <linux/bootmem.h>
  261. #include <linux/highmem.h>
  262. #include <linux/swap.h>
  263. #include <linux/cache.h>
  264. #include <linux/err.h>
  265. #include <linux/crypto.h>
  266. #include <net/icmp.h>
  267. #include <net/tcp.h>
  268. #include <net/xfrm.h>
  269. #include <net/ip.h>
  270. #include <net/netdma.h>
  271. #include <net/sock.h>
  272. #include <asm/uaccess.h>
  273. #include <asm/ioctls.h>
  274. int sysctl_tcp_fin_timeout __read_mostly = TCP_FIN_TIMEOUT;
  275. struct percpu_counter tcp_orphan_count;
  276. EXPORT_SYMBOL_GPL(tcp_orphan_count);
  277. int sysctl_tcp_mem[3] __read_mostly;
  278. int sysctl_tcp_wmem[3] __read_mostly;
  279. int sysctl_tcp_rmem[3] __read_mostly;
  280. EXPORT_SYMBOL(sysctl_tcp_mem);
  281. EXPORT_SYMBOL(sysctl_tcp_rmem);
  282. EXPORT_SYMBOL(sysctl_tcp_wmem);
  283. atomic_t tcp_memory_allocated; /* Current allocated memory. */
  284. EXPORT_SYMBOL(tcp_memory_allocated);
  285. /*
  286. * Current number of TCP sockets.
  287. */
  288. struct percpu_counter tcp_sockets_allocated;
  289. EXPORT_SYMBOL(tcp_sockets_allocated);
  290. /*
  291. * TCP splice context
  292. */
  293. struct tcp_splice_state {
  294. struct pipe_inode_info *pipe;
  295. size_t len;
  296. unsigned int flags;
  297. };
  298. /*
  299. * Pressure flag: try to collapse.
  300. * Technical note: it is used by multiple contexts non atomically.
  301. * All the __sk_mem_schedule() is of this nature: accounting
  302. * is strict, actions are advisory and have some latency.
  303. */
  304. int tcp_memory_pressure __read_mostly;
  305. EXPORT_SYMBOL(tcp_memory_pressure);
  306. void tcp_enter_memory_pressure(struct sock *sk)
  307. {
  308. if (!tcp_memory_pressure) {
  309. NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPMEMORYPRESSURES);
  310. tcp_memory_pressure = 1;
  311. }
  312. }
  313. EXPORT_SYMBOL(tcp_enter_memory_pressure);
  314. /*
  315. * Wait for a TCP event.
  316. *
  317. * Note that we don't need to lock the socket, as the upper poll layers
  318. * take care of normal races (between the test and the event) and we don't
  319. * go look at any of the socket buffers directly.
  320. */
  321. unsigned int tcp_poll(struct file *file, struct socket *sock, poll_table *wait)
  322. {
  323. unsigned int mask;
  324. struct sock *sk = sock->sk;
  325. struct tcp_sock *tp = tcp_sk(sk);
  326. sock_poll_wait(file, sk->sk_sleep, wait);
  327. if (sk->sk_state == TCP_LISTEN)
  328. return inet_csk_listen_poll(sk);
  329. /* Socket is not locked. We are protected from async events
  330. * by poll logic and correct handling of state changes
  331. * made by other threads is impossible in any case.
  332. */
  333. mask = 0;
  334. if (sk->sk_err)
  335. mask = POLLERR;
  336. /*
  337. * POLLHUP is certainly not done right. But poll() doesn't
  338. * have a notion of HUP in just one direction, and for a
  339. * socket the read side is more interesting.
  340. *
  341. * Some poll() documentation says that POLLHUP is incompatible
  342. * with the POLLOUT/POLLWR flags, so somebody should check this
  343. * all. But careful, it tends to be safer to return too many
  344. * bits than too few, and you can easily break real applications
  345. * if you don't tell them that something has hung up!
  346. *
  347. * Check-me.
  348. *
  349. * Check number 1. POLLHUP is _UNMASKABLE_ event (see UNIX98 and
  350. * our fs/select.c). It means that after we received EOF,
  351. * poll always returns immediately, making impossible poll() on write()
  352. * in state CLOSE_WAIT. One solution is evident --- to set POLLHUP
  353. * if and only if shutdown has been made in both directions.
  354. * Actually, it is interesting to look how Solaris and DUX
  355. * solve this dilemma. I would prefer, if POLLHUP were maskable,
  356. * then we could set it on SND_SHUTDOWN. BTW examples given
  357. * in Stevens' books assume exactly this behaviour, it explains
  358. * why POLLHUP is incompatible with POLLOUT. --ANK
  359. *
  360. * NOTE. Check for TCP_CLOSE is added. The goal is to prevent
  361. * blocking on fresh not-connected or disconnected socket. --ANK
  362. */
  363. if (sk->sk_shutdown == SHUTDOWN_MASK || sk->sk_state == TCP_CLOSE)
  364. mask |= POLLHUP;
  365. if (sk->sk_shutdown & RCV_SHUTDOWN)
  366. mask |= POLLIN | POLLRDNORM | POLLRDHUP;
  367. /* Connected? */
  368. if ((1 << sk->sk_state) & ~(TCPF_SYN_SENT | TCPF_SYN_RECV)) {
  369. int target = sock_rcvlowat(sk, 0, INT_MAX);
  370. if (tp->urg_seq == tp->copied_seq &&
  371. !sock_flag(sk, SOCK_URGINLINE) &&
  372. tp->urg_data)
  373. target--;
  374. /* Potential race condition. If read of tp below will
  375. * escape above sk->sk_state, we can be illegally awaken
  376. * in SYN_* states. */
  377. if (tp->rcv_nxt - tp->copied_seq >= target)
  378. mask |= POLLIN | POLLRDNORM;
  379. if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
  380. if (sk_stream_wspace(sk) >= sk_stream_min_wspace(sk)) {
  381. mask |= POLLOUT | POLLWRNORM;
  382. } else { /* send SIGIO later */
  383. set_bit(SOCK_ASYNC_NOSPACE,
  384. &sk->sk_socket->flags);
  385. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  386. /* Race breaker. If space is freed after
  387. * wspace test but before the flags are set,
  388. * IO signal will be lost.
  389. */
  390. if (sk_stream_wspace(sk) >= sk_stream_min_wspace(sk))
  391. mask |= POLLOUT | POLLWRNORM;
  392. }
  393. }
  394. if (tp->urg_data & TCP_URG_VALID)
  395. mask |= POLLPRI;
  396. }
  397. return mask;
  398. }
  399. int tcp_ioctl(struct sock *sk, int cmd, unsigned long arg)
  400. {
  401. struct tcp_sock *tp = tcp_sk(sk);
  402. int answ;
  403. switch (cmd) {
  404. case SIOCINQ:
  405. if (sk->sk_state == TCP_LISTEN)
  406. return -EINVAL;
  407. lock_sock(sk);
  408. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  409. answ = 0;
  410. else if (sock_flag(sk, SOCK_URGINLINE) ||
  411. !tp->urg_data ||
  412. before(tp->urg_seq, tp->copied_seq) ||
  413. !before(tp->urg_seq, tp->rcv_nxt)) {
  414. struct sk_buff *skb;
  415. answ = tp->rcv_nxt - tp->copied_seq;
  416. /* Subtract 1, if FIN is in queue. */
  417. skb = skb_peek_tail(&sk->sk_receive_queue);
  418. if (answ && skb)
  419. answ -= tcp_hdr(skb)->fin;
  420. } else
  421. answ = tp->urg_seq - tp->copied_seq;
  422. release_sock(sk);
  423. break;
  424. case SIOCATMARK:
  425. answ = tp->urg_data && tp->urg_seq == tp->copied_seq;
  426. break;
  427. case SIOCOUTQ:
  428. if (sk->sk_state == TCP_LISTEN)
  429. return -EINVAL;
  430. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  431. answ = 0;
  432. else
  433. answ = tp->write_seq - tp->snd_una;
  434. break;
  435. default:
  436. return -ENOIOCTLCMD;
  437. }
  438. return put_user(answ, (int __user *)arg);
  439. }
  440. static inline void tcp_mark_push(struct tcp_sock *tp, struct sk_buff *skb)
  441. {
  442. TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_PSH;
  443. tp->pushed_seq = tp->write_seq;
  444. }
  445. static inline int forced_push(struct tcp_sock *tp)
  446. {
  447. return after(tp->write_seq, tp->pushed_seq + (tp->max_window >> 1));
  448. }
  449. static inline void skb_entail(struct sock *sk, struct sk_buff *skb)
  450. {
  451. struct tcp_sock *tp = tcp_sk(sk);
  452. struct tcp_skb_cb *tcb = TCP_SKB_CB(skb);
  453. skb->csum = 0;
  454. tcb->seq = tcb->end_seq = tp->write_seq;
  455. tcb->flags = TCPCB_FLAG_ACK;
  456. tcb->sacked = 0;
  457. skb_header_release(skb);
  458. tcp_add_write_queue_tail(sk, skb);
  459. sk->sk_wmem_queued += skb->truesize;
  460. sk_mem_charge(sk, skb->truesize);
  461. if (tp->nonagle & TCP_NAGLE_PUSH)
  462. tp->nonagle &= ~TCP_NAGLE_PUSH;
  463. }
  464. static inline void tcp_mark_urg(struct tcp_sock *tp, int flags,
  465. struct sk_buff *skb)
  466. {
  467. if (flags & MSG_OOB)
  468. tp->snd_up = tp->write_seq;
  469. }
  470. static inline void tcp_push(struct sock *sk, int flags, int mss_now,
  471. int nonagle)
  472. {
  473. struct tcp_sock *tp = tcp_sk(sk);
  474. if (tcp_send_head(sk)) {
  475. struct sk_buff *skb = tcp_write_queue_tail(sk);
  476. if (!(flags & MSG_MORE) || forced_push(tp))
  477. tcp_mark_push(tp, skb);
  478. tcp_mark_urg(tp, flags, skb);
  479. __tcp_push_pending_frames(sk, mss_now,
  480. (flags & MSG_MORE) ? TCP_NAGLE_CORK : nonagle);
  481. }
  482. }
  483. static int tcp_splice_data_recv(read_descriptor_t *rd_desc, struct sk_buff *skb,
  484. unsigned int offset, size_t len)
  485. {
  486. struct tcp_splice_state *tss = rd_desc->arg.data;
  487. int ret;
  488. ret = skb_splice_bits(skb, offset, tss->pipe, min(rd_desc->count, len),
  489. tss->flags);
  490. if (ret > 0)
  491. rd_desc->count -= ret;
  492. return ret;
  493. }
  494. static int __tcp_splice_read(struct sock *sk, struct tcp_splice_state *tss)
  495. {
  496. /* Store TCP splice context information in read_descriptor_t. */
  497. read_descriptor_t rd_desc = {
  498. .arg.data = tss,
  499. .count = tss->len,
  500. };
  501. return tcp_read_sock(sk, &rd_desc, tcp_splice_data_recv);
  502. }
  503. /**
  504. * tcp_splice_read - splice data from TCP socket to a pipe
  505. * @sock: socket to splice from
  506. * @ppos: position (not valid)
  507. * @pipe: pipe to splice to
  508. * @len: number of bytes to splice
  509. * @flags: splice modifier flags
  510. *
  511. * Description:
  512. * Will read pages from given socket and fill them into a pipe.
  513. *
  514. **/
  515. ssize_t tcp_splice_read(struct socket *sock, loff_t *ppos,
  516. struct pipe_inode_info *pipe, size_t len,
  517. unsigned int flags)
  518. {
  519. struct sock *sk = sock->sk;
  520. struct tcp_splice_state tss = {
  521. .pipe = pipe,
  522. .len = len,
  523. .flags = flags,
  524. };
  525. long timeo;
  526. ssize_t spliced;
  527. int ret;
  528. /*
  529. * We can't seek on a socket input
  530. */
  531. if (unlikely(*ppos))
  532. return -ESPIPE;
  533. ret = spliced = 0;
  534. lock_sock(sk);
  535. timeo = sock_rcvtimeo(sk, flags & SPLICE_F_NONBLOCK);
  536. while (tss.len) {
  537. ret = __tcp_splice_read(sk, &tss);
  538. if (ret < 0)
  539. break;
  540. else if (!ret) {
  541. if (spliced)
  542. break;
  543. if (sock_flag(sk, SOCK_DONE))
  544. break;
  545. if (sk->sk_err) {
  546. ret = sock_error(sk);
  547. break;
  548. }
  549. if (sk->sk_shutdown & RCV_SHUTDOWN)
  550. break;
  551. if (sk->sk_state == TCP_CLOSE) {
  552. /*
  553. * This occurs when user tries to read
  554. * from never connected socket.
  555. */
  556. if (!sock_flag(sk, SOCK_DONE))
  557. ret = -ENOTCONN;
  558. break;
  559. }
  560. if (!timeo) {
  561. ret = -EAGAIN;
  562. break;
  563. }
  564. sk_wait_data(sk, &timeo);
  565. if (signal_pending(current)) {
  566. ret = sock_intr_errno(timeo);
  567. break;
  568. }
  569. continue;
  570. }
  571. tss.len -= ret;
  572. spliced += ret;
  573. if (!timeo)
  574. break;
  575. release_sock(sk);
  576. lock_sock(sk);
  577. if (sk->sk_err || sk->sk_state == TCP_CLOSE ||
  578. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  579. signal_pending(current))
  580. break;
  581. }
  582. release_sock(sk);
  583. if (spliced)
  584. return spliced;
  585. return ret;
  586. }
  587. struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp)
  588. {
  589. struct sk_buff *skb;
  590. /* The TCP header must be at least 32-bit aligned. */
  591. size = ALIGN(size, 4);
  592. skb = alloc_skb_fclone(size + sk->sk_prot->max_header, gfp);
  593. if (skb) {
  594. if (sk_wmem_schedule(sk, skb->truesize)) {
  595. /*
  596. * Make sure that we have exactly size bytes
  597. * available to the caller, no more, no less.
  598. */
  599. skb_reserve(skb, skb_tailroom(skb) - size);
  600. return skb;
  601. }
  602. __kfree_skb(skb);
  603. } else {
  604. sk->sk_prot->enter_memory_pressure(sk);
  605. sk_stream_moderate_sndbuf(sk);
  606. }
  607. return NULL;
  608. }
  609. static unsigned int tcp_xmit_size_goal(struct sock *sk, u32 mss_now,
  610. int large_allowed)
  611. {
  612. struct tcp_sock *tp = tcp_sk(sk);
  613. u32 xmit_size_goal, old_size_goal;
  614. xmit_size_goal = mss_now;
  615. if (large_allowed && sk_can_gso(sk)) {
  616. xmit_size_goal = ((sk->sk_gso_max_size - 1) -
  617. inet_csk(sk)->icsk_af_ops->net_header_len -
  618. inet_csk(sk)->icsk_ext_hdr_len -
  619. tp->tcp_header_len);
  620. xmit_size_goal = tcp_bound_to_half_wnd(tp, xmit_size_goal);
  621. /* We try hard to avoid divides here */
  622. old_size_goal = tp->xmit_size_goal_segs * mss_now;
  623. if (likely(old_size_goal <= xmit_size_goal &&
  624. old_size_goal + mss_now > xmit_size_goal)) {
  625. xmit_size_goal = old_size_goal;
  626. } else {
  627. tp->xmit_size_goal_segs = xmit_size_goal / mss_now;
  628. xmit_size_goal = tp->xmit_size_goal_segs * mss_now;
  629. }
  630. }
  631. return max(xmit_size_goal, mss_now);
  632. }
  633. static int tcp_send_mss(struct sock *sk, int *size_goal, int flags)
  634. {
  635. int mss_now;
  636. mss_now = tcp_current_mss(sk);
  637. *size_goal = tcp_xmit_size_goal(sk, mss_now, !(flags & MSG_OOB));
  638. return mss_now;
  639. }
  640. static ssize_t do_tcp_sendpages(struct sock *sk, struct page **pages, int poffset,
  641. size_t psize, int flags)
  642. {
  643. struct tcp_sock *tp = tcp_sk(sk);
  644. int mss_now, size_goal;
  645. int err;
  646. ssize_t copied;
  647. long timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  648. /* Wait for a connection to finish. */
  649. if ((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT))
  650. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  651. goto out_err;
  652. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  653. mss_now = tcp_send_mss(sk, &size_goal, flags);
  654. copied = 0;
  655. err = -EPIPE;
  656. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  657. goto out_err;
  658. while (psize > 0) {
  659. struct sk_buff *skb = tcp_write_queue_tail(sk);
  660. struct page *page = pages[poffset / PAGE_SIZE];
  661. int copy, i, can_coalesce;
  662. int offset = poffset % PAGE_SIZE;
  663. int size = min_t(size_t, psize, PAGE_SIZE - offset);
  664. if (!tcp_send_head(sk) || (copy = size_goal - skb->len) <= 0) {
  665. new_segment:
  666. if (!sk_stream_memory_free(sk))
  667. goto wait_for_sndbuf;
  668. skb = sk_stream_alloc_skb(sk, 0, sk->sk_allocation);
  669. if (!skb)
  670. goto wait_for_memory;
  671. skb_entail(sk, skb);
  672. copy = size_goal;
  673. }
  674. if (copy > size)
  675. copy = size;
  676. i = skb_shinfo(skb)->nr_frags;
  677. can_coalesce = skb_can_coalesce(skb, i, page, offset);
  678. if (!can_coalesce && i >= MAX_SKB_FRAGS) {
  679. tcp_mark_push(tp, skb);
  680. goto new_segment;
  681. }
  682. if (!sk_wmem_schedule(sk, copy))
  683. goto wait_for_memory;
  684. if (can_coalesce) {
  685. skb_shinfo(skb)->frags[i - 1].size += copy;
  686. } else {
  687. get_page(page);
  688. skb_fill_page_desc(skb, i, page, offset, copy);
  689. }
  690. skb->len += copy;
  691. skb->data_len += copy;
  692. skb->truesize += copy;
  693. sk->sk_wmem_queued += copy;
  694. sk_mem_charge(sk, copy);
  695. skb->ip_summed = CHECKSUM_PARTIAL;
  696. tp->write_seq += copy;
  697. TCP_SKB_CB(skb)->end_seq += copy;
  698. skb_shinfo(skb)->gso_segs = 0;
  699. if (!copied)
  700. TCP_SKB_CB(skb)->flags &= ~TCPCB_FLAG_PSH;
  701. copied += copy;
  702. poffset += copy;
  703. if (!(psize -= copy))
  704. goto out;
  705. if (skb->len < size_goal || (flags & MSG_OOB))
  706. continue;
  707. if (forced_push(tp)) {
  708. tcp_mark_push(tp, skb);
  709. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  710. } else if (skb == tcp_send_head(sk))
  711. tcp_push_one(sk, mss_now);
  712. continue;
  713. wait_for_sndbuf:
  714. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  715. wait_for_memory:
  716. if (copied)
  717. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  718. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  719. goto do_error;
  720. mss_now = tcp_send_mss(sk, &size_goal, flags);
  721. }
  722. out:
  723. if (copied)
  724. tcp_push(sk, flags, mss_now, tp->nonagle);
  725. return copied;
  726. do_error:
  727. if (copied)
  728. goto out;
  729. out_err:
  730. return sk_stream_error(sk, flags, err);
  731. }
  732. ssize_t tcp_sendpage(struct socket *sock, struct page *page, int offset,
  733. size_t size, int flags)
  734. {
  735. ssize_t res;
  736. struct sock *sk = sock->sk;
  737. if (!(sk->sk_route_caps & NETIF_F_SG) ||
  738. !(sk->sk_route_caps & NETIF_F_ALL_CSUM))
  739. return sock_no_sendpage(sock, page, offset, size, flags);
  740. lock_sock(sk);
  741. TCP_CHECK_TIMER(sk);
  742. res = do_tcp_sendpages(sk, &page, offset, size, flags);
  743. TCP_CHECK_TIMER(sk);
  744. release_sock(sk);
  745. return res;
  746. }
  747. #define TCP_PAGE(sk) (sk->sk_sndmsg_page)
  748. #define TCP_OFF(sk) (sk->sk_sndmsg_off)
  749. static inline int select_size(struct sock *sk)
  750. {
  751. struct tcp_sock *tp = tcp_sk(sk);
  752. int tmp = tp->mss_cache;
  753. if (sk->sk_route_caps & NETIF_F_SG) {
  754. if (sk_can_gso(sk))
  755. tmp = 0;
  756. else {
  757. int pgbreak = SKB_MAX_HEAD(MAX_TCP_HEADER);
  758. if (tmp >= pgbreak &&
  759. tmp <= pgbreak + (MAX_SKB_FRAGS - 1) * PAGE_SIZE)
  760. tmp = pgbreak;
  761. }
  762. }
  763. return tmp;
  764. }
  765. int tcp_sendmsg(struct kiocb *iocb, struct socket *sock, struct msghdr *msg,
  766. size_t size)
  767. {
  768. struct sock *sk = sock->sk;
  769. struct iovec *iov;
  770. struct tcp_sock *tp = tcp_sk(sk);
  771. struct sk_buff *skb;
  772. int iovlen, flags;
  773. int mss_now, size_goal;
  774. int err, copied;
  775. long timeo;
  776. lock_sock(sk);
  777. TCP_CHECK_TIMER(sk);
  778. flags = msg->msg_flags;
  779. timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  780. /* Wait for a connection to finish. */
  781. if ((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT))
  782. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  783. goto out_err;
  784. /* This should be in poll */
  785. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  786. mss_now = tcp_send_mss(sk, &size_goal, flags);
  787. /* Ok commence sending. */
  788. iovlen = msg->msg_iovlen;
  789. iov = msg->msg_iov;
  790. copied = 0;
  791. err = -EPIPE;
  792. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  793. goto out_err;
  794. while (--iovlen >= 0) {
  795. int seglen = iov->iov_len;
  796. unsigned char __user *from = iov->iov_base;
  797. iov++;
  798. while (seglen > 0) {
  799. int copy = 0;
  800. int max = size_goal;
  801. skb = tcp_write_queue_tail(sk);
  802. if (tcp_send_head(sk)) {
  803. if (skb->ip_summed == CHECKSUM_NONE)
  804. max = mss_now;
  805. copy = max - skb->len;
  806. }
  807. if (copy <= 0) {
  808. new_segment:
  809. /* Allocate new segment. If the interface is SG,
  810. * allocate skb fitting to single page.
  811. */
  812. if (!sk_stream_memory_free(sk))
  813. goto wait_for_sndbuf;
  814. skb = sk_stream_alloc_skb(sk, select_size(sk),
  815. sk->sk_allocation);
  816. if (!skb)
  817. goto wait_for_memory;
  818. /*
  819. * Check whether we can use HW checksum.
  820. */
  821. if (sk->sk_route_caps & NETIF_F_ALL_CSUM)
  822. skb->ip_summed = CHECKSUM_PARTIAL;
  823. skb_entail(sk, skb);
  824. copy = size_goal;
  825. max = size_goal;
  826. }
  827. /* Try to append data to the end of skb. */
  828. if (copy > seglen)
  829. copy = seglen;
  830. /* Where to copy to? */
  831. if (skb_tailroom(skb) > 0) {
  832. /* We have some space in skb head. Superb! */
  833. if (copy > skb_tailroom(skb))
  834. copy = skb_tailroom(skb);
  835. if ((err = skb_add_data(skb, from, copy)) != 0)
  836. goto do_fault;
  837. } else {
  838. int merge = 0;
  839. int i = skb_shinfo(skb)->nr_frags;
  840. struct page *page = TCP_PAGE(sk);
  841. int off = TCP_OFF(sk);
  842. if (skb_can_coalesce(skb, i, page, off) &&
  843. off != PAGE_SIZE) {
  844. /* We can extend the last page
  845. * fragment. */
  846. merge = 1;
  847. } else if (i == MAX_SKB_FRAGS ||
  848. (!i &&
  849. !(sk->sk_route_caps & NETIF_F_SG))) {
  850. /* Need to add new fragment and cannot
  851. * do this because interface is non-SG,
  852. * or because all the page slots are
  853. * busy. */
  854. tcp_mark_push(tp, skb);
  855. goto new_segment;
  856. } else if (page) {
  857. if (off == PAGE_SIZE) {
  858. put_page(page);
  859. TCP_PAGE(sk) = page = NULL;
  860. off = 0;
  861. }
  862. } else
  863. off = 0;
  864. if (copy > PAGE_SIZE - off)
  865. copy = PAGE_SIZE - off;
  866. if (!sk_wmem_schedule(sk, copy))
  867. goto wait_for_memory;
  868. if (!page) {
  869. /* Allocate new cache page. */
  870. if (!(page = sk_stream_alloc_page(sk)))
  871. goto wait_for_memory;
  872. }
  873. /* Time to copy data. We are close to
  874. * the end! */
  875. err = skb_copy_to_page(sk, from, skb, page,
  876. off, copy);
  877. if (err) {
  878. /* If this page was new, give it to the
  879. * socket so it does not get leaked.
  880. */
  881. if (!TCP_PAGE(sk)) {
  882. TCP_PAGE(sk) = page;
  883. TCP_OFF(sk) = 0;
  884. }
  885. goto do_error;
  886. }
  887. /* Update the skb. */
  888. if (merge) {
  889. skb_shinfo(skb)->frags[i - 1].size +=
  890. copy;
  891. } else {
  892. skb_fill_page_desc(skb, i, page, off, copy);
  893. if (TCP_PAGE(sk)) {
  894. get_page(page);
  895. } else if (off + copy < PAGE_SIZE) {
  896. get_page(page);
  897. TCP_PAGE(sk) = page;
  898. }
  899. }
  900. TCP_OFF(sk) = off + copy;
  901. }
  902. if (!copied)
  903. TCP_SKB_CB(skb)->flags &= ~TCPCB_FLAG_PSH;
  904. tp->write_seq += copy;
  905. TCP_SKB_CB(skb)->end_seq += copy;
  906. skb_shinfo(skb)->gso_segs = 0;
  907. from += copy;
  908. copied += copy;
  909. if ((seglen -= copy) == 0 && iovlen == 0)
  910. goto out;
  911. if (skb->len < max || (flags & MSG_OOB))
  912. continue;
  913. if (forced_push(tp)) {
  914. tcp_mark_push(tp, skb);
  915. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  916. } else if (skb == tcp_send_head(sk))
  917. tcp_push_one(sk, mss_now);
  918. continue;
  919. wait_for_sndbuf:
  920. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  921. wait_for_memory:
  922. if (copied)
  923. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  924. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  925. goto do_error;
  926. mss_now = tcp_send_mss(sk, &size_goal, flags);
  927. }
  928. }
  929. out:
  930. if (copied)
  931. tcp_push(sk, flags, mss_now, tp->nonagle);
  932. TCP_CHECK_TIMER(sk);
  933. release_sock(sk);
  934. return copied;
  935. do_fault:
  936. if (!skb->len) {
  937. tcp_unlink_write_queue(skb, sk);
  938. /* It is the one place in all of TCP, except connection
  939. * reset, where we can be unlinking the send_head.
  940. */
  941. tcp_check_send_head(sk, skb);
  942. sk_wmem_free_skb(sk, skb);
  943. }
  944. do_error:
  945. if (copied)
  946. goto out;
  947. out_err:
  948. err = sk_stream_error(sk, flags, err);
  949. TCP_CHECK_TIMER(sk);
  950. release_sock(sk);
  951. return err;
  952. }
  953. /*
  954. * Handle reading urgent data. BSD has very simple semantics for
  955. * this, no blocking and very strange errors 8)
  956. */
  957. static int tcp_recv_urg(struct sock *sk, struct msghdr *msg, int len, int flags)
  958. {
  959. struct tcp_sock *tp = tcp_sk(sk);
  960. /* No URG data to read. */
  961. if (sock_flag(sk, SOCK_URGINLINE) || !tp->urg_data ||
  962. tp->urg_data == TCP_URG_READ)
  963. return -EINVAL; /* Yes this is right ! */
  964. if (sk->sk_state == TCP_CLOSE && !sock_flag(sk, SOCK_DONE))
  965. return -ENOTCONN;
  966. if (tp->urg_data & TCP_URG_VALID) {
  967. int err = 0;
  968. char c = tp->urg_data;
  969. if (!(flags & MSG_PEEK))
  970. tp->urg_data = TCP_URG_READ;
  971. /* Read urgent data. */
  972. msg->msg_flags |= MSG_OOB;
  973. if (len > 0) {
  974. if (!(flags & MSG_TRUNC))
  975. err = memcpy_toiovec(msg->msg_iov, &c, 1);
  976. len = 1;
  977. } else
  978. msg->msg_flags |= MSG_TRUNC;
  979. return err ? -EFAULT : len;
  980. }
  981. if (sk->sk_state == TCP_CLOSE || (sk->sk_shutdown & RCV_SHUTDOWN))
  982. return 0;
  983. /* Fixed the recv(..., MSG_OOB) behaviour. BSD docs and
  984. * the available implementations agree in this case:
  985. * this call should never block, independent of the
  986. * blocking state of the socket.
  987. * Mike <pall@rz.uni-karlsruhe.de>
  988. */
  989. return -EAGAIN;
  990. }
  991. /* Clean up the receive buffer for full frames taken by the user,
  992. * then send an ACK if necessary. COPIED is the number of bytes
  993. * tcp_recvmsg has given to the user so far, it speeds up the
  994. * calculation of whether or not we must ACK for the sake of
  995. * a window update.
  996. */
  997. void tcp_cleanup_rbuf(struct sock *sk, int copied)
  998. {
  999. struct tcp_sock *tp = tcp_sk(sk);
  1000. int time_to_ack = 0;
  1001. #if TCP_DEBUG
  1002. struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
  1003. WARN_ON(skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq));
  1004. #endif
  1005. if (inet_csk_ack_scheduled(sk)) {
  1006. const struct inet_connection_sock *icsk = inet_csk(sk);
  1007. /* Delayed ACKs frequently hit locked sockets during bulk
  1008. * receive. */
  1009. if (icsk->icsk_ack.blocked ||
  1010. /* Once-per-two-segments ACK was not sent by tcp_input.c */
  1011. tp->rcv_nxt - tp->rcv_wup > icsk->icsk_ack.rcv_mss ||
  1012. /*
  1013. * If this read emptied read buffer, we send ACK, if
  1014. * connection is not bidirectional, user drained
  1015. * receive buffer and there was a small segment
  1016. * in queue.
  1017. */
  1018. (copied > 0 &&
  1019. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED2) ||
  1020. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED) &&
  1021. !icsk->icsk_ack.pingpong)) &&
  1022. !atomic_read(&sk->sk_rmem_alloc)))
  1023. time_to_ack = 1;
  1024. }
  1025. /* We send an ACK if we can now advertise a non-zero window
  1026. * which has been raised "significantly".
  1027. *
  1028. * Even if window raised up to infinity, do not send window open ACK
  1029. * in states, where we will not receive more. It is useless.
  1030. */
  1031. if (copied > 0 && !time_to_ack && !(sk->sk_shutdown & RCV_SHUTDOWN)) {
  1032. __u32 rcv_window_now = tcp_receive_window(tp);
  1033. /* Optimize, __tcp_select_window() is not cheap. */
  1034. if (2*rcv_window_now <= tp->window_clamp) {
  1035. __u32 new_window = __tcp_select_window(sk);
  1036. /* Send ACK now, if this read freed lots of space
  1037. * in our buffer. Certainly, new_window is new window.
  1038. * We can advertise it now, if it is not less than current one.
  1039. * "Lots" means "at least twice" here.
  1040. */
  1041. if (new_window && new_window >= 2 * rcv_window_now)
  1042. time_to_ack = 1;
  1043. }
  1044. }
  1045. if (time_to_ack)
  1046. tcp_send_ack(sk);
  1047. }
  1048. static void tcp_prequeue_process(struct sock *sk)
  1049. {
  1050. struct sk_buff *skb;
  1051. struct tcp_sock *tp = tcp_sk(sk);
  1052. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPPREQUEUED);
  1053. /* RX process wants to run with disabled BHs, though it is not
  1054. * necessary */
  1055. local_bh_disable();
  1056. while ((skb = __skb_dequeue(&tp->ucopy.prequeue)) != NULL)
  1057. sk_backlog_rcv(sk, skb);
  1058. local_bh_enable();
  1059. /* Clear memory counter. */
  1060. tp->ucopy.memory = 0;
  1061. }
  1062. static inline struct sk_buff *tcp_recv_skb(struct sock *sk, u32 seq, u32 *off)
  1063. {
  1064. struct sk_buff *skb;
  1065. u32 offset;
  1066. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1067. offset = seq - TCP_SKB_CB(skb)->seq;
  1068. if (tcp_hdr(skb)->syn)
  1069. offset--;
  1070. if (offset < skb->len || tcp_hdr(skb)->fin) {
  1071. *off = offset;
  1072. return skb;
  1073. }
  1074. }
  1075. return NULL;
  1076. }
  1077. /*
  1078. * This routine provides an alternative to tcp_recvmsg() for routines
  1079. * that would like to handle copying from skbuffs directly in 'sendfile'
  1080. * fashion.
  1081. * Note:
  1082. * - It is assumed that the socket was locked by the caller.
  1083. * - The routine does not block.
  1084. * - At present, there is no support for reading OOB data
  1085. * or for 'peeking' the socket using this routine
  1086. * (although both would be easy to implement).
  1087. */
  1088. int tcp_read_sock(struct sock *sk, read_descriptor_t *desc,
  1089. sk_read_actor_t recv_actor)
  1090. {
  1091. struct sk_buff *skb;
  1092. struct tcp_sock *tp = tcp_sk(sk);
  1093. u32 seq = tp->copied_seq;
  1094. u32 offset;
  1095. int copied = 0;
  1096. if (sk->sk_state == TCP_LISTEN)
  1097. return -ENOTCONN;
  1098. while ((skb = tcp_recv_skb(sk, seq, &offset)) != NULL) {
  1099. if (offset < skb->len) {
  1100. int used;
  1101. size_t len;
  1102. len = skb->len - offset;
  1103. /* Stop reading if we hit a patch of urgent data */
  1104. if (tp->urg_data) {
  1105. u32 urg_offset = tp->urg_seq - seq;
  1106. if (urg_offset < len)
  1107. len = urg_offset;
  1108. if (!len)
  1109. break;
  1110. }
  1111. used = recv_actor(desc, skb, offset, len);
  1112. if (used < 0) {
  1113. if (!copied)
  1114. copied = used;
  1115. break;
  1116. } else if (used <= len) {
  1117. seq += used;
  1118. copied += used;
  1119. offset += used;
  1120. }
  1121. /*
  1122. * If recv_actor drops the lock (e.g. TCP splice
  1123. * receive) the skb pointer might be invalid when
  1124. * getting here: tcp_collapse might have deleted it
  1125. * while aggregating skbs from the socket queue.
  1126. */
  1127. skb = tcp_recv_skb(sk, seq-1, &offset);
  1128. if (!skb || (offset+1 != skb->len))
  1129. break;
  1130. }
  1131. if (tcp_hdr(skb)->fin) {
  1132. sk_eat_skb(sk, skb, 0);
  1133. ++seq;
  1134. break;
  1135. }
  1136. sk_eat_skb(sk, skb, 0);
  1137. if (!desc->count)
  1138. break;
  1139. }
  1140. tp->copied_seq = seq;
  1141. tcp_rcv_space_adjust(sk);
  1142. /* Clean up data we have read: This will do ACK frames. */
  1143. if (copied > 0)
  1144. tcp_cleanup_rbuf(sk, copied);
  1145. return copied;
  1146. }
  1147. /*
  1148. * This routine copies from a sock struct into the user buffer.
  1149. *
  1150. * Technical note: in 2.3 we work on _locked_ socket, so that
  1151. * tricks with *seq access order and skb->users are not required.
  1152. * Probably, code can be easily improved even more.
  1153. */
  1154. int tcp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  1155. size_t len, int nonblock, int flags, int *addr_len)
  1156. {
  1157. struct tcp_sock *tp = tcp_sk(sk);
  1158. int copied = 0;
  1159. u32 peek_seq;
  1160. u32 *seq;
  1161. unsigned long used;
  1162. int err;
  1163. int target; /* Read at least this many bytes */
  1164. long timeo;
  1165. struct task_struct *user_recv = NULL;
  1166. int copied_early = 0;
  1167. struct sk_buff *skb;
  1168. u32 urg_hole = 0;
  1169. lock_sock(sk);
  1170. TCP_CHECK_TIMER(sk);
  1171. err = -ENOTCONN;
  1172. if (sk->sk_state == TCP_LISTEN)
  1173. goto out;
  1174. timeo = sock_rcvtimeo(sk, nonblock);
  1175. /* Urgent data needs to be handled specially. */
  1176. if (flags & MSG_OOB)
  1177. goto recv_urg;
  1178. seq = &tp->copied_seq;
  1179. if (flags & MSG_PEEK) {
  1180. peek_seq = tp->copied_seq;
  1181. seq = &peek_seq;
  1182. }
  1183. target = sock_rcvlowat(sk, flags & MSG_WAITALL, len);
  1184. #ifdef CONFIG_NET_DMA
  1185. tp->ucopy.dma_chan = NULL;
  1186. preempt_disable();
  1187. skb = skb_peek_tail(&sk->sk_receive_queue);
  1188. {
  1189. int available = 0;
  1190. if (skb)
  1191. available = TCP_SKB_CB(skb)->seq + skb->len - (*seq);
  1192. if ((available < target) &&
  1193. (len > sysctl_tcp_dma_copybreak) && !(flags & MSG_PEEK) &&
  1194. !sysctl_tcp_low_latency &&
  1195. dma_find_channel(DMA_MEMCPY)) {
  1196. preempt_enable_no_resched();
  1197. tp->ucopy.pinned_list =
  1198. dma_pin_iovec_pages(msg->msg_iov, len);
  1199. } else {
  1200. preempt_enable_no_resched();
  1201. }
  1202. }
  1203. #endif
  1204. do {
  1205. u32 offset;
  1206. /* Are we at urgent data? Stop if we have read anything or have SIGURG pending. */
  1207. if (tp->urg_data && tp->urg_seq == *seq) {
  1208. if (copied)
  1209. break;
  1210. if (signal_pending(current)) {
  1211. copied = timeo ? sock_intr_errno(timeo) : -EAGAIN;
  1212. break;
  1213. }
  1214. }
  1215. /* Next get a buffer. */
  1216. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1217. /* Now that we have two receive queues this
  1218. * shouldn't happen.
  1219. */
  1220. if (before(*seq, TCP_SKB_CB(skb)->seq)) {
  1221. printk(KERN_INFO "recvmsg bug: copied %X "
  1222. "seq %X\n", *seq, TCP_SKB_CB(skb)->seq);
  1223. break;
  1224. }
  1225. offset = *seq - TCP_SKB_CB(skb)->seq;
  1226. if (tcp_hdr(skb)->syn)
  1227. offset--;
  1228. if (offset < skb->len)
  1229. goto found_ok_skb;
  1230. if (tcp_hdr(skb)->fin)
  1231. goto found_fin_ok;
  1232. WARN_ON(!(flags & MSG_PEEK));
  1233. }
  1234. /* Well, if we have backlog, try to process it now yet. */
  1235. if (copied >= target && !sk->sk_backlog.tail)
  1236. break;
  1237. if (copied) {
  1238. if (sk->sk_err ||
  1239. sk->sk_state == TCP_CLOSE ||
  1240. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  1241. !timeo ||
  1242. signal_pending(current))
  1243. break;
  1244. } else {
  1245. if (sock_flag(sk, SOCK_DONE))
  1246. break;
  1247. if (sk->sk_err) {
  1248. copied = sock_error(sk);
  1249. break;
  1250. }
  1251. if (sk->sk_shutdown & RCV_SHUTDOWN)
  1252. break;
  1253. if (sk->sk_state == TCP_CLOSE) {
  1254. if (!sock_flag(sk, SOCK_DONE)) {
  1255. /* This occurs when user tries to read
  1256. * from never connected socket.
  1257. */
  1258. copied = -ENOTCONN;
  1259. break;
  1260. }
  1261. break;
  1262. }
  1263. if (!timeo) {
  1264. copied = -EAGAIN;
  1265. break;
  1266. }
  1267. if (signal_pending(current)) {
  1268. copied = sock_intr_errno(timeo);
  1269. break;
  1270. }
  1271. }
  1272. tcp_cleanup_rbuf(sk, copied);
  1273. if (!sysctl_tcp_low_latency && tp->ucopy.task == user_recv) {
  1274. /* Install new reader */
  1275. if (!user_recv && !(flags & (MSG_TRUNC | MSG_PEEK))) {
  1276. user_recv = current;
  1277. tp->ucopy.task = user_recv;
  1278. tp->ucopy.iov = msg->msg_iov;
  1279. }
  1280. tp->ucopy.len = len;
  1281. WARN_ON(tp->copied_seq != tp->rcv_nxt &&
  1282. !(flags & (MSG_PEEK | MSG_TRUNC)));
  1283. /* Ugly... If prequeue is not empty, we have to
  1284. * process it before releasing socket, otherwise
  1285. * order will be broken at second iteration.
  1286. * More elegant solution is required!!!
  1287. *
  1288. * Look: we have the following (pseudo)queues:
  1289. *
  1290. * 1. packets in flight
  1291. * 2. backlog
  1292. * 3. prequeue
  1293. * 4. receive_queue
  1294. *
  1295. * Each queue can be processed only if the next ones
  1296. * are empty. At this point we have empty receive_queue.
  1297. * But prequeue _can_ be not empty after 2nd iteration,
  1298. * when we jumped to start of loop because backlog
  1299. * processing added something to receive_queue.
  1300. * We cannot release_sock(), because backlog contains
  1301. * packets arrived _after_ prequeued ones.
  1302. *
  1303. * Shortly, algorithm is clear --- to process all
  1304. * the queues in order. We could make it more directly,
  1305. * requeueing packets from backlog to prequeue, if
  1306. * is not empty. It is more elegant, but eats cycles,
  1307. * unfortunately.
  1308. */
  1309. if (!skb_queue_empty(&tp->ucopy.prequeue))
  1310. goto do_prequeue;
  1311. /* __ Set realtime policy in scheduler __ */
  1312. }
  1313. if (copied >= target) {
  1314. /* Do not sleep, just process backlog. */
  1315. release_sock(sk);
  1316. lock_sock(sk);
  1317. } else
  1318. sk_wait_data(sk, &timeo);
  1319. #ifdef CONFIG_NET_DMA
  1320. tp->ucopy.wakeup = 0;
  1321. #endif
  1322. if (user_recv) {
  1323. int chunk;
  1324. /* __ Restore normal policy in scheduler __ */
  1325. if ((chunk = len - tp->ucopy.len) != 0) {
  1326. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMBACKLOG, chunk);
  1327. len -= chunk;
  1328. copied += chunk;
  1329. }
  1330. if (tp->rcv_nxt == tp->copied_seq &&
  1331. !skb_queue_empty(&tp->ucopy.prequeue)) {
  1332. do_prequeue:
  1333. tcp_prequeue_process(sk);
  1334. if ((chunk = len - tp->ucopy.len) != 0) {
  1335. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1336. len -= chunk;
  1337. copied += chunk;
  1338. }
  1339. }
  1340. }
  1341. if ((flags & MSG_PEEK) &&
  1342. (peek_seq - copied - urg_hole != tp->copied_seq)) {
  1343. if (net_ratelimit())
  1344. printk(KERN_DEBUG "TCP(%s:%d): Application bug, race in MSG_PEEK.\n",
  1345. current->comm, task_pid_nr(current));
  1346. peek_seq = tp->copied_seq;
  1347. }
  1348. continue;
  1349. found_ok_skb:
  1350. /* Ok so how much can we use? */
  1351. used = skb->len - offset;
  1352. if (len < used)
  1353. used = len;
  1354. /* Do we have urgent data here? */
  1355. if (tp->urg_data) {
  1356. u32 urg_offset = tp->urg_seq - *seq;
  1357. if (urg_offset < used) {
  1358. if (!urg_offset) {
  1359. if (!sock_flag(sk, SOCK_URGINLINE)) {
  1360. ++*seq;
  1361. urg_hole++;
  1362. offset++;
  1363. used--;
  1364. if (!used)
  1365. goto skip_copy;
  1366. }
  1367. } else
  1368. used = urg_offset;
  1369. }
  1370. }
  1371. if (!(flags & MSG_TRUNC)) {
  1372. #ifdef CONFIG_NET_DMA
  1373. if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
  1374. tp->ucopy.dma_chan = dma_find_channel(DMA_MEMCPY);
  1375. if (tp->ucopy.dma_chan) {
  1376. tp->ucopy.dma_cookie = dma_skb_copy_datagram_iovec(
  1377. tp->ucopy.dma_chan, skb, offset,
  1378. msg->msg_iov, used,
  1379. tp->ucopy.pinned_list);
  1380. if (tp->ucopy.dma_cookie < 0) {
  1381. printk(KERN_ALERT "dma_cookie < 0\n");
  1382. /* Exception. Bailout! */
  1383. if (!copied)
  1384. copied = -EFAULT;
  1385. break;
  1386. }
  1387. if ((offset + used) == skb->len)
  1388. copied_early = 1;
  1389. } else
  1390. #endif
  1391. {
  1392. err = skb_copy_datagram_iovec(skb, offset,
  1393. msg->msg_iov, used);
  1394. if (err) {
  1395. /* Exception. Bailout! */
  1396. if (!copied)
  1397. copied = -EFAULT;
  1398. break;
  1399. }
  1400. }
  1401. }
  1402. *seq += used;
  1403. copied += used;
  1404. len -= used;
  1405. tcp_rcv_space_adjust(sk);
  1406. skip_copy:
  1407. if (tp->urg_data && after(tp->copied_seq, tp->urg_seq)) {
  1408. tp->urg_data = 0;
  1409. tcp_fast_path_check(sk);
  1410. }
  1411. if (used + offset < skb->len)
  1412. continue;
  1413. if (tcp_hdr(skb)->fin)
  1414. goto found_fin_ok;
  1415. if (!(flags & MSG_PEEK)) {
  1416. sk_eat_skb(sk, skb, copied_early);
  1417. copied_early = 0;
  1418. }
  1419. continue;
  1420. found_fin_ok:
  1421. /* Process the FIN. */
  1422. ++*seq;
  1423. if (!(flags & MSG_PEEK)) {
  1424. sk_eat_skb(sk, skb, copied_early);
  1425. copied_early = 0;
  1426. }
  1427. break;
  1428. } while (len > 0);
  1429. if (user_recv) {
  1430. if (!skb_queue_empty(&tp->ucopy.prequeue)) {
  1431. int chunk;
  1432. tp->ucopy.len = copied > 0 ? len : 0;
  1433. tcp_prequeue_process(sk);
  1434. if (copied > 0 && (chunk = len - tp->ucopy.len) != 0) {
  1435. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1436. len -= chunk;
  1437. copied += chunk;
  1438. }
  1439. }
  1440. tp->ucopy.task = NULL;
  1441. tp->ucopy.len = 0;
  1442. }
  1443. #ifdef CONFIG_NET_DMA
  1444. if (tp->ucopy.dma_chan) {
  1445. dma_cookie_t done, used;
  1446. dma_async_memcpy_issue_pending(tp->ucopy.dma_chan);
  1447. while (dma_async_memcpy_complete(tp->ucopy.dma_chan,
  1448. tp->ucopy.dma_cookie, &done,
  1449. &used) == DMA_IN_PROGRESS) {
  1450. /* do partial cleanup of sk_async_wait_queue */
  1451. while ((skb = skb_peek(&sk->sk_async_wait_queue)) &&
  1452. (dma_async_is_complete(skb->dma_cookie, done,
  1453. used) == DMA_SUCCESS)) {
  1454. __skb_dequeue(&sk->sk_async_wait_queue);
  1455. kfree_skb(skb);
  1456. }
  1457. }
  1458. /* Safe to free early-copied skbs now */
  1459. __skb_queue_purge(&sk->sk_async_wait_queue);
  1460. tp->ucopy.dma_chan = NULL;
  1461. }
  1462. if (tp->ucopy.pinned_list) {
  1463. dma_unpin_iovec_pages(tp->ucopy.pinned_list);
  1464. tp->ucopy.pinned_list = NULL;
  1465. }
  1466. #endif
  1467. /* According to UNIX98, msg_name/msg_namelen are ignored
  1468. * on connected socket. I was just happy when found this 8) --ANK
  1469. */
  1470. /* Clean up data we have read: This will do ACK frames. */
  1471. tcp_cleanup_rbuf(sk, copied);
  1472. TCP_CHECK_TIMER(sk);
  1473. release_sock(sk);
  1474. return copied;
  1475. out:
  1476. TCP_CHECK_TIMER(sk);
  1477. release_sock(sk);
  1478. return err;
  1479. recv_urg:
  1480. err = tcp_recv_urg(sk, msg, len, flags);
  1481. goto out;
  1482. }
  1483. void tcp_set_state(struct sock *sk, int state)
  1484. {
  1485. int oldstate = sk->sk_state;
  1486. switch (state) {
  1487. case TCP_ESTABLISHED:
  1488. if (oldstate != TCP_ESTABLISHED)
  1489. TCP_INC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1490. break;
  1491. case TCP_CLOSE:
  1492. if (oldstate == TCP_CLOSE_WAIT || oldstate == TCP_ESTABLISHED)
  1493. TCP_INC_STATS(sock_net(sk), TCP_MIB_ESTABRESETS);
  1494. sk->sk_prot->unhash(sk);
  1495. if (inet_csk(sk)->icsk_bind_hash &&
  1496. !(sk->sk_userlocks & SOCK_BINDPORT_LOCK))
  1497. inet_put_port(sk);
  1498. /* fall through */
  1499. default:
  1500. if (oldstate == TCP_ESTABLISHED)
  1501. TCP_DEC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1502. }
  1503. /* Change state AFTER socket is unhashed to avoid closed
  1504. * socket sitting in hash tables.
  1505. */
  1506. sk->sk_state = state;
  1507. #ifdef STATE_TRACE
  1508. SOCK_DEBUG(sk, "TCP sk=%p, State %s -> %s\n", sk, statename[oldstate], statename[state]);
  1509. #endif
  1510. }
  1511. EXPORT_SYMBOL_GPL(tcp_set_state);
  1512. /*
  1513. * State processing on a close. This implements the state shift for
  1514. * sending our FIN frame. Note that we only send a FIN for some
  1515. * states. A shutdown() may have already sent the FIN, or we may be
  1516. * closed.
  1517. */
  1518. static const unsigned char new_state[16] = {
  1519. /* current state: new state: action: */
  1520. /* (Invalid) */ TCP_CLOSE,
  1521. /* TCP_ESTABLISHED */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1522. /* TCP_SYN_SENT */ TCP_CLOSE,
  1523. /* TCP_SYN_RECV */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1524. /* TCP_FIN_WAIT1 */ TCP_FIN_WAIT1,
  1525. /* TCP_FIN_WAIT2 */ TCP_FIN_WAIT2,
  1526. /* TCP_TIME_WAIT */ TCP_CLOSE,
  1527. /* TCP_CLOSE */ TCP_CLOSE,
  1528. /* TCP_CLOSE_WAIT */ TCP_LAST_ACK | TCP_ACTION_FIN,
  1529. /* TCP_LAST_ACK */ TCP_LAST_ACK,
  1530. /* TCP_LISTEN */ TCP_CLOSE,
  1531. /* TCP_CLOSING */ TCP_CLOSING,
  1532. };
  1533. static int tcp_close_state(struct sock *sk)
  1534. {
  1535. int next = (int)new_state[sk->sk_state];
  1536. int ns = next & TCP_STATE_MASK;
  1537. tcp_set_state(sk, ns);
  1538. return next & TCP_ACTION_FIN;
  1539. }
  1540. /*
  1541. * Shutdown the sending side of a connection. Much like close except
  1542. * that we don't receive shut down or sock_set_flag(sk, SOCK_DEAD).
  1543. */
  1544. void tcp_shutdown(struct sock *sk, int how)
  1545. {
  1546. /* We need to grab some memory, and put together a FIN,
  1547. * and then put it into the queue to be sent.
  1548. * Tim MacKenzie(tym@dibbler.cs.monash.edu.au) 4 Dec '92.
  1549. */
  1550. if (!(how & SEND_SHUTDOWN))
  1551. return;
  1552. /* If we've already sent a FIN, or it's a closed state, skip this. */
  1553. if ((1 << sk->sk_state) &
  1554. (TCPF_ESTABLISHED | TCPF_SYN_SENT |
  1555. TCPF_SYN_RECV | TCPF_CLOSE_WAIT)) {
  1556. /* Clear out any half completed packets. FIN if needed. */
  1557. if (tcp_close_state(sk))
  1558. tcp_send_fin(sk);
  1559. }
  1560. }
  1561. void tcp_close(struct sock *sk, long timeout)
  1562. {
  1563. struct sk_buff *skb;
  1564. int data_was_unread = 0;
  1565. int state;
  1566. lock_sock(sk);
  1567. sk->sk_shutdown = SHUTDOWN_MASK;
  1568. if (sk->sk_state == TCP_LISTEN) {
  1569. tcp_set_state(sk, TCP_CLOSE);
  1570. /* Special case. */
  1571. inet_csk_listen_stop(sk);
  1572. goto adjudge_to_death;
  1573. }
  1574. /* We need to flush the recv. buffs. We do this only on the
  1575. * descriptor close, not protocol-sourced closes, because the
  1576. * reader process may not have drained the data yet!
  1577. */
  1578. while ((skb = __skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  1579. u32 len = TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq -
  1580. tcp_hdr(skb)->fin;
  1581. data_was_unread += len;
  1582. __kfree_skb(skb);
  1583. }
  1584. sk_mem_reclaim(sk);
  1585. /* As outlined in RFC 2525, section 2.17, we send a RST here because
  1586. * data was lost. To witness the awful effects of the old behavior of
  1587. * always doing a FIN, run an older 2.1.x kernel or 2.0.x, start a bulk
  1588. * GET in an FTP client, suspend the process, wait for the client to
  1589. * advertise a zero window, then kill -9 the FTP client, wheee...
  1590. * Note: timeout is always zero in such a case.
  1591. */
  1592. if (data_was_unread) {
  1593. /* Unread data was tossed, zap the connection. */
  1594. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONCLOSE);
  1595. tcp_set_state(sk, TCP_CLOSE);
  1596. tcp_send_active_reset(sk, GFP_KERNEL);
  1597. } else if (sock_flag(sk, SOCK_LINGER) && !sk->sk_lingertime) {
  1598. /* Check zero linger _after_ checking for unread data. */
  1599. sk->sk_prot->disconnect(sk, 0);
  1600. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
  1601. } else if (tcp_close_state(sk)) {
  1602. /* We FIN if the application ate all the data before
  1603. * zapping the connection.
  1604. */
  1605. /* RED-PEN. Formally speaking, we have broken TCP state
  1606. * machine. State transitions:
  1607. *
  1608. * TCP_ESTABLISHED -> TCP_FIN_WAIT1
  1609. * TCP_SYN_RECV -> TCP_FIN_WAIT1 (forget it, it's impossible)
  1610. * TCP_CLOSE_WAIT -> TCP_LAST_ACK
  1611. *
  1612. * are legal only when FIN has been sent (i.e. in window),
  1613. * rather than queued out of window. Purists blame.
  1614. *
  1615. * F.e. "RFC state" is ESTABLISHED,
  1616. * if Linux state is FIN-WAIT-1, but FIN is still not sent.
  1617. *
  1618. * The visible declinations are that sometimes
  1619. * we enter time-wait state, when it is not required really
  1620. * (harmless), do not send active resets, when they are
  1621. * required by specs (TCP_ESTABLISHED, TCP_CLOSE_WAIT, when
  1622. * they look as CLOSING or LAST_ACK for Linux)
  1623. * Probably, I missed some more holelets.
  1624. * --ANK
  1625. */
  1626. tcp_send_fin(sk);
  1627. }
  1628. sk_stream_wait_close(sk, timeout);
  1629. adjudge_to_death:
  1630. state = sk->sk_state;
  1631. sock_hold(sk);
  1632. sock_orphan(sk);
  1633. /* It is the last release_sock in its life. It will remove backlog. */
  1634. release_sock(sk);
  1635. /* Now socket is owned by kernel and we acquire BH lock
  1636. to finish close. No need to check for user refs.
  1637. */
  1638. local_bh_disable();
  1639. bh_lock_sock(sk);
  1640. WARN_ON(sock_owned_by_user(sk));
  1641. percpu_counter_inc(sk->sk_prot->orphan_count);
  1642. /* Have we already been destroyed by a softirq or backlog? */
  1643. if (state != TCP_CLOSE && sk->sk_state == TCP_CLOSE)
  1644. goto out;
  1645. /* This is a (useful) BSD violating of the RFC. There is a
  1646. * problem with TCP as specified in that the other end could
  1647. * keep a socket open forever with no application left this end.
  1648. * We use a 3 minute timeout (about the same as BSD) then kill
  1649. * our end. If they send after that then tough - BUT: long enough
  1650. * that we won't make the old 4*rto = almost no time - whoops
  1651. * reset mistake.
  1652. *
  1653. * Nope, it was not mistake. It is really desired behaviour
  1654. * f.e. on http servers, when such sockets are useless, but
  1655. * consume significant resources. Let's do it with special
  1656. * linger2 option. --ANK
  1657. */
  1658. if (sk->sk_state == TCP_FIN_WAIT2) {
  1659. struct tcp_sock *tp = tcp_sk(sk);
  1660. if (tp->linger2 < 0) {
  1661. tcp_set_state(sk, TCP_CLOSE);
  1662. tcp_send_active_reset(sk, GFP_ATOMIC);
  1663. NET_INC_STATS_BH(sock_net(sk),
  1664. LINUX_MIB_TCPABORTONLINGER);
  1665. } else {
  1666. const int tmo = tcp_fin_time(sk);
  1667. if (tmo > TCP_TIMEWAIT_LEN) {
  1668. inet_csk_reset_keepalive_timer(sk,
  1669. tmo - TCP_TIMEWAIT_LEN);
  1670. } else {
  1671. tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
  1672. goto out;
  1673. }
  1674. }
  1675. }
  1676. if (sk->sk_state != TCP_CLOSE) {
  1677. int orphan_count = percpu_counter_read_positive(
  1678. sk->sk_prot->orphan_count);
  1679. sk_mem_reclaim(sk);
  1680. if (tcp_too_many_orphans(sk, orphan_count)) {
  1681. if (net_ratelimit())
  1682. printk(KERN_INFO "TCP: too many of orphaned "
  1683. "sockets\n");
  1684. tcp_set_state(sk, TCP_CLOSE);
  1685. tcp_send_active_reset(sk, GFP_ATOMIC);
  1686. NET_INC_STATS_BH(sock_net(sk),
  1687. LINUX_MIB_TCPABORTONMEMORY);
  1688. }
  1689. }
  1690. if (sk->sk_state == TCP_CLOSE)
  1691. inet_csk_destroy_sock(sk);
  1692. /* Otherwise, socket is reprieved until protocol close. */
  1693. out:
  1694. bh_unlock_sock(sk);
  1695. local_bh_enable();
  1696. sock_put(sk);
  1697. }
  1698. /* These states need RST on ABORT according to RFC793 */
  1699. static inline int tcp_need_reset(int state)
  1700. {
  1701. return (1 << state) &
  1702. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT | TCPF_FIN_WAIT1 |
  1703. TCPF_FIN_WAIT2 | TCPF_SYN_RECV);
  1704. }
  1705. int tcp_disconnect(struct sock *sk, int flags)
  1706. {
  1707. struct inet_sock *inet = inet_sk(sk);
  1708. struct inet_connection_sock *icsk = inet_csk(sk);
  1709. struct tcp_sock *tp = tcp_sk(sk);
  1710. int err = 0;
  1711. int old_state = sk->sk_state;
  1712. if (old_state != TCP_CLOSE)
  1713. tcp_set_state(sk, TCP_CLOSE);
  1714. /* ABORT function of RFC793 */
  1715. if (old_state == TCP_LISTEN) {
  1716. inet_csk_listen_stop(sk);
  1717. } else if (tcp_need_reset(old_state) ||
  1718. (tp->snd_nxt != tp->write_seq &&
  1719. (1 << old_state) & (TCPF_CLOSING | TCPF_LAST_ACK))) {
  1720. /* The last check adjusts for discrepancy of Linux wrt. RFC
  1721. * states
  1722. */
  1723. tcp_send_active_reset(sk, gfp_any());
  1724. sk->sk_err = ECONNRESET;
  1725. } else if (old_state == TCP_SYN_SENT)
  1726. sk->sk_err = ECONNRESET;
  1727. tcp_clear_xmit_timers(sk);
  1728. __skb_queue_purge(&sk->sk_receive_queue);
  1729. tcp_write_queue_purge(sk);
  1730. __skb_queue_purge(&tp->out_of_order_queue);
  1731. #ifdef CONFIG_NET_DMA
  1732. __skb_queue_purge(&sk->sk_async_wait_queue);
  1733. #endif
  1734. inet->dport = 0;
  1735. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1736. inet_reset_saddr(sk);
  1737. sk->sk_shutdown = 0;
  1738. sock_reset_flag(sk, SOCK_DONE);
  1739. tp->srtt = 0;
  1740. if ((tp->write_seq += tp->max_window + 2) == 0)
  1741. tp->write_seq = 1;
  1742. icsk->icsk_backoff = 0;
  1743. tp->snd_cwnd = 2;
  1744. icsk->icsk_probes_out = 0;
  1745. tp->packets_out = 0;
  1746. tp->snd_ssthresh = 0x7fffffff;
  1747. tp->snd_cwnd_cnt = 0;
  1748. tp->bytes_acked = 0;
  1749. tcp_set_ca_state(sk, TCP_CA_Open);
  1750. tcp_clear_retrans(tp);
  1751. inet_csk_delack_init(sk);
  1752. tcp_init_send_head(sk);
  1753. memset(&tp->rx_opt, 0, sizeof(tp->rx_opt));
  1754. __sk_dst_reset(sk);
  1755. WARN_ON(inet->num && !icsk->icsk_bind_hash);
  1756. sk->sk_error_report(sk);
  1757. return err;
  1758. }
  1759. /*
  1760. * Socket option code for TCP.
  1761. */
  1762. static int do_tcp_setsockopt(struct sock *sk, int level,
  1763. int optname, char __user *optval, int optlen)
  1764. {
  1765. struct tcp_sock *tp = tcp_sk(sk);
  1766. struct inet_connection_sock *icsk = inet_csk(sk);
  1767. int val;
  1768. int err = 0;
  1769. /* This is a string value all the others are int's */
  1770. if (optname == TCP_CONGESTION) {
  1771. char name[TCP_CA_NAME_MAX];
  1772. if (optlen < 1)
  1773. return -EINVAL;
  1774. val = strncpy_from_user(name, optval,
  1775. min(TCP_CA_NAME_MAX-1, optlen));
  1776. if (val < 0)
  1777. return -EFAULT;
  1778. name[val] = 0;
  1779. lock_sock(sk);
  1780. err = tcp_set_congestion_control(sk, name);
  1781. release_sock(sk);
  1782. return err;
  1783. }
  1784. if (optlen < sizeof(int))
  1785. return -EINVAL;
  1786. if (get_user(val, (int __user *)optval))
  1787. return -EFAULT;
  1788. lock_sock(sk);
  1789. switch (optname) {
  1790. case TCP_MAXSEG:
  1791. /* Values greater than interface MTU won't take effect. However
  1792. * at the point when this call is done we typically don't yet
  1793. * know which interface is going to be used */
  1794. if (val < 8 || val > MAX_TCP_WINDOW) {
  1795. err = -EINVAL;
  1796. break;
  1797. }
  1798. tp->rx_opt.user_mss = val;
  1799. break;
  1800. case TCP_NODELAY:
  1801. if (val) {
  1802. /* TCP_NODELAY is weaker than TCP_CORK, so that
  1803. * this option on corked socket is remembered, but
  1804. * it is not activated until cork is cleared.
  1805. *
  1806. * However, when TCP_NODELAY is set we make
  1807. * an explicit push, which overrides even TCP_CORK
  1808. * for currently queued segments.
  1809. */
  1810. tp->nonagle |= TCP_NAGLE_OFF|TCP_NAGLE_PUSH;
  1811. tcp_push_pending_frames(sk);
  1812. } else {
  1813. tp->nonagle &= ~TCP_NAGLE_OFF;
  1814. }
  1815. break;
  1816. case TCP_CORK:
  1817. /* When set indicates to always queue non-full frames.
  1818. * Later the user clears this option and we transmit
  1819. * any pending partial frames in the queue. This is
  1820. * meant to be used alongside sendfile() to get properly
  1821. * filled frames when the user (for example) must write
  1822. * out headers with a write() call first and then use
  1823. * sendfile to send out the data parts.
  1824. *
  1825. * TCP_CORK can be set together with TCP_NODELAY and it is
  1826. * stronger than TCP_NODELAY.
  1827. */
  1828. if (val) {
  1829. tp->nonagle |= TCP_NAGLE_CORK;
  1830. } else {
  1831. tp->nonagle &= ~TCP_NAGLE_CORK;
  1832. if (tp->nonagle&TCP_NAGLE_OFF)
  1833. tp->nonagle |= TCP_NAGLE_PUSH;
  1834. tcp_push_pending_frames(sk);
  1835. }
  1836. break;
  1837. case TCP_KEEPIDLE:
  1838. if (val < 1 || val > MAX_TCP_KEEPIDLE)
  1839. err = -EINVAL;
  1840. else {
  1841. tp->keepalive_time = val * HZ;
  1842. if (sock_flag(sk, SOCK_KEEPOPEN) &&
  1843. !((1 << sk->sk_state) &
  1844. (TCPF_CLOSE | TCPF_LISTEN))) {
  1845. __u32 elapsed = tcp_time_stamp - tp->rcv_tstamp;
  1846. if (tp->keepalive_time > elapsed)
  1847. elapsed = tp->keepalive_time - elapsed;
  1848. else
  1849. elapsed = 0;
  1850. inet_csk_reset_keepalive_timer(sk, elapsed);
  1851. }
  1852. }
  1853. break;
  1854. case TCP_KEEPINTVL:
  1855. if (val < 1 || val > MAX_TCP_KEEPINTVL)
  1856. err = -EINVAL;
  1857. else
  1858. tp->keepalive_intvl = val * HZ;
  1859. break;
  1860. case TCP_KEEPCNT:
  1861. if (val < 1 || val > MAX_TCP_KEEPCNT)
  1862. err = -EINVAL;
  1863. else
  1864. tp->keepalive_probes = val;
  1865. break;
  1866. case TCP_SYNCNT:
  1867. if (val < 1 || val > MAX_TCP_SYNCNT)
  1868. err = -EINVAL;
  1869. else
  1870. icsk->icsk_syn_retries = val;
  1871. break;
  1872. case TCP_LINGER2:
  1873. if (val < 0)
  1874. tp->linger2 = -1;
  1875. else if (val > sysctl_tcp_fin_timeout / HZ)
  1876. tp->linger2 = 0;
  1877. else
  1878. tp->linger2 = val * HZ;
  1879. break;
  1880. case TCP_DEFER_ACCEPT:
  1881. icsk->icsk_accept_queue.rskq_defer_accept = 0;
  1882. if (val > 0) {
  1883. /* Translate value in seconds to number of
  1884. * retransmits */
  1885. while (icsk->icsk_accept_queue.rskq_defer_accept < 32 &&
  1886. val > ((TCP_TIMEOUT_INIT / HZ) <<
  1887. icsk->icsk_accept_queue.rskq_defer_accept))
  1888. icsk->icsk_accept_queue.rskq_defer_accept++;
  1889. icsk->icsk_accept_queue.rskq_defer_accept++;
  1890. }
  1891. break;
  1892. case TCP_WINDOW_CLAMP:
  1893. if (!val) {
  1894. if (sk->sk_state != TCP_CLOSE) {
  1895. err = -EINVAL;
  1896. break;
  1897. }
  1898. tp->window_clamp = 0;
  1899. } else
  1900. tp->window_clamp = val < SOCK_MIN_RCVBUF / 2 ?
  1901. SOCK_MIN_RCVBUF / 2 : val;
  1902. break;
  1903. case TCP_QUICKACK:
  1904. if (!val) {
  1905. icsk->icsk_ack.pingpong = 1;
  1906. } else {
  1907. icsk->icsk_ack.pingpong = 0;
  1908. if ((1 << sk->sk_state) &
  1909. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT) &&
  1910. inet_csk_ack_scheduled(sk)) {
  1911. icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
  1912. tcp_cleanup_rbuf(sk, 1);
  1913. if (!(val & 1))
  1914. icsk->icsk_ack.pingpong = 1;
  1915. }
  1916. }
  1917. break;
  1918. #ifdef CONFIG_TCP_MD5SIG
  1919. case TCP_MD5SIG:
  1920. /* Read the IP->Key mappings from userspace */
  1921. err = tp->af_specific->md5_parse(sk, optval, optlen);
  1922. break;
  1923. #endif
  1924. default:
  1925. err = -ENOPROTOOPT;
  1926. break;
  1927. }
  1928. release_sock(sk);
  1929. return err;
  1930. }
  1931. int tcp_setsockopt(struct sock *sk, int level, int optname, char __user *optval,
  1932. int optlen)
  1933. {
  1934. struct inet_connection_sock *icsk = inet_csk(sk);
  1935. if (level != SOL_TCP)
  1936. return icsk->icsk_af_ops->setsockopt(sk, level, optname,
  1937. optval, optlen);
  1938. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  1939. }
  1940. #ifdef CONFIG_COMPAT
  1941. int compat_tcp_setsockopt(struct sock *sk, int level, int optname,
  1942. char __user *optval, int optlen)
  1943. {
  1944. if (level != SOL_TCP)
  1945. return inet_csk_compat_setsockopt(sk, level, optname,
  1946. optval, optlen);
  1947. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  1948. }
  1949. EXPORT_SYMBOL(compat_tcp_setsockopt);
  1950. #endif
  1951. /* Return information about state of tcp endpoint in API format. */
  1952. void tcp_get_info(struct sock *sk, struct tcp_info *info)
  1953. {
  1954. struct tcp_sock *tp = tcp_sk(sk);
  1955. const struct inet_connection_sock *icsk = inet_csk(sk);
  1956. u32 now = tcp_time_stamp;
  1957. memset(info, 0, sizeof(*info));
  1958. info->tcpi_state = sk->sk_state;
  1959. info->tcpi_ca_state = icsk->icsk_ca_state;
  1960. info->tcpi_retransmits = icsk->icsk_retransmits;
  1961. info->tcpi_probes = icsk->icsk_probes_out;
  1962. info->tcpi_backoff = icsk->icsk_backoff;
  1963. if (tp->rx_opt.tstamp_ok)
  1964. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  1965. if (tcp_is_sack(tp))
  1966. info->tcpi_options |= TCPI_OPT_SACK;
  1967. if (tp->rx_opt.wscale_ok) {
  1968. info->tcpi_options |= TCPI_OPT_WSCALE;
  1969. info->tcpi_snd_wscale = tp->rx_opt.snd_wscale;
  1970. info->tcpi_rcv_wscale = tp->rx_opt.rcv_wscale;
  1971. }
  1972. if (tp->ecn_flags&TCP_ECN_OK)
  1973. info->tcpi_options |= TCPI_OPT_ECN;
  1974. info->tcpi_rto = jiffies_to_usecs(icsk->icsk_rto);
  1975. info->tcpi_ato = jiffies_to_usecs(icsk->icsk_ack.ato);
  1976. info->tcpi_snd_mss = tp->mss_cache;
  1977. info->tcpi_rcv_mss = icsk->icsk_ack.rcv_mss;
  1978. if (sk->sk_state == TCP_LISTEN) {
  1979. info->tcpi_unacked = sk->sk_ack_backlog;
  1980. info->tcpi_sacked = sk->sk_max_ack_backlog;
  1981. } else {
  1982. info->tcpi_unacked = tp->packets_out;
  1983. info->tcpi_sacked = tp->sacked_out;
  1984. }
  1985. info->tcpi_lost = tp->lost_out;
  1986. info->tcpi_retrans = tp->retrans_out;
  1987. info->tcpi_fackets = tp->fackets_out;
  1988. info->tcpi_last_data_sent = jiffies_to_msecs(now - tp->lsndtime);
  1989. info->tcpi_last_data_recv = jiffies_to_msecs(now - icsk->icsk_ack.lrcvtime);
  1990. info->tcpi_last_ack_recv = jiffies_to_msecs(now - tp->rcv_tstamp);
  1991. info->tcpi_pmtu = icsk->icsk_pmtu_cookie;
  1992. info->tcpi_rcv_ssthresh = tp->rcv_ssthresh;
  1993. info->tcpi_rtt = jiffies_to_usecs(tp->srtt)>>3;
  1994. info->tcpi_rttvar = jiffies_to_usecs(tp->mdev)>>2;
  1995. info->tcpi_snd_ssthresh = tp->snd_ssthresh;
  1996. info->tcpi_snd_cwnd = tp->snd_cwnd;
  1997. info->tcpi_advmss = tp->advmss;
  1998. info->tcpi_reordering = tp->reordering;
  1999. info->tcpi_rcv_rtt = jiffies_to_usecs(tp->rcv_rtt_est.rtt)>>3;
  2000. info->tcpi_rcv_space = tp->rcvq_space.space;
  2001. info->tcpi_total_retrans = tp->total_retrans;
  2002. }
  2003. EXPORT_SYMBOL_GPL(tcp_get_info);
  2004. static int do_tcp_getsockopt(struct sock *sk, int level,
  2005. int optname, char __user *optval, int __user *optlen)
  2006. {
  2007. struct inet_connection_sock *icsk = inet_csk(sk);
  2008. struct tcp_sock *tp = tcp_sk(sk);
  2009. int val, len;
  2010. if (get_user(len, optlen))
  2011. return -EFAULT;
  2012. len = min_t(unsigned int, len, sizeof(int));
  2013. if (len < 0)
  2014. return -EINVAL;
  2015. switch (optname) {
  2016. case TCP_MAXSEG:
  2017. val = tp->mss_cache;
  2018. if (!val && ((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_LISTEN)))
  2019. val = tp->rx_opt.user_mss;
  2020. break;
  2021. case TCP_NODELAY:
  2022. val = !!(tp->nonagle&TCP_NAGLE_OFF);
  2023. break;
  2024. case TCP_CORK:
  2025. val = !!(tp->nonagle&TCP_NAGLE_CORK);
  2026. break;
  2027. case TCP_KEEPIDLE:
  2028. val = (tp->keepalive_time ? : sysctl_tcp_keepalive_time) / HZ;
  2029. break;
  2030. case TCP_KEEPINTVL:
  2031. val = (tp->keepalive_intvl ? : sysctl_tcp_keepalive_intvl) / HZ;
  2032. break;
  2033. case TCP_KEEPCNT:
  2034. val = tp->keepalive_probes ? : sysctl_tcp_keepalive_probes;
  2035. break;
  2036. case TCP_SYNCNT:
  2037. val = icsk->icsk_syn_retries ? : sysctl_tcp_syn_retries;
  2038. break;
  2039. case TCP_LINGER2:
  2040. val = tp->linger2;
  2041. if (val >= 0)
  2042. val = (val ? : sysctl_tcp_fin_timeout) / HZ;
  2043. break;
  2044. case TCP_DEFER_ACCEPT:
  2045. val = !icsk->icsk_accept_queue.rskq_defer_accept ? 0 :
  2046. ((TCP_TIMEOUT_INIT / HZ) << (icsk->icsk_accept_queue.rskq_defer_accept - 1));
  2047. break;
  2048. case TCP_WINDOW_CLAMP:
  2049. val = tp->window_clamp;
  2050. break;
  2051. case TCP_INFO: {
  2052. struct tcp_info info;
  2053. if (get_user(len, optlen))
  2054. return -EFAULT;
  2055. tcp_get_info(sk, &info);
  2056. len = min_t(unsigned int, len, sizeof(info));
  2057. if (put_user(len, optlen))
  2058. return -EFAULT;
  2059. if (copy_to_user(optval, &info, len))
  2060. return -EFAULT;
  2061. return 0;
  2062. }
  2063. case TCP_QUICKACK:
  2064. val = !icsk->icsk_ack.pingpong;
  2065. break;
  2066. case TCP_CONGESTION:
  2067. if (get_user(len, optlen))
  2068. return -EFAULT;
  2069. len = min_t(unsigned int, len, TCP_CA_NAME_MAX);
  2070. if (put_user(len, optlen))
  2071. return -EFAULT;
  2072. if (copy_to_user(optval, icsk->icsk_ca_ops->name, len))
  2073. return -EFAULT;
  2074. return 0;
  2075. default:
  2076. return -ENOPROTOOPT;
  2077. }
  2078. if (put_user(len, optlen))
  2079. return -EFAULT;
  2080. if (copy_to_user(optval, &val, len))
  2081. return -EFAULT;
  2082. return 0;
  2083. }
  2084. int tcp_getsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2085. int __user *optlen)
  2086. {
  2087. struct inet_connection_sock *icsk = inet_csk(sk);
  2088. if (level != SOL_TCP)
  2089. return icsk->icsk_af_ops->getsockopt(sk, level, optname,
  2090. optval, optlen);
  2091. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2092. }
  2093. #ifdef CONFIG_COMPAT
  2094. int compat_tcp_getsockopt(struct sock *sk, int level, int optname,
  2095. char __user *optval, int __user *optlen)
  2096. {
  2097. if (level != SOL_TCP)
  2098. return inet_csk_compat_getsockopt(sk, level, optname,
  2099. optval, optlen);
  2100. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2101. }
  2102. EXPORT_SYMBOL(compat_tcp_getsockopt);
  2103. #endif
  2104. struct sk_buff *tcp_tso_segment(struct sk_buff *skb, int features)
  2105. {
  2106. struct sk_buff *segs = ERR_PTR(-EINVAL);
  2107. struct tcphdr *th;
  2108. unsigned thlen;
  2109. unsigned int seq;
  2110. __be32 delta;
  2111. unsigned int oldlen;
  2112. unsigned int mss;
  2113. if (!pskb_may_pull(skb, sizeof(*th)))
  2114. goto out;
  2115. th = tcp_hdr(skb);
  2116. thlen = th->doff * 4;
  2117. if (thlen < sizeof(*th))
  2118. goto out;
  2119. if (!pskb_may_pull(skb, thlen))
  2120. goto out;
  2121. oldlen = (u16)~skb->len;
  2122. __skb_pull(skb, thlen);
  2123. mss = skb_shinfo(skb)->gso_size;
  2124. if (unlikely(skb->len <= mss))
  2125. goto out;
  2126. if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
  2127. /* Packet is from an untrusted source, reset gso_segs. */
  2128. int type = skb_shinfo(skb)->gso_type;
  2129. if (unlikely(type &
  2130. ~(SKB_GSO_TCPV4 |
  2131. SKB_GSO_DODGY |
  2132. SKB_GSO_TCP_ECN |
  2133. SKB_GSO_TCPV6 |
  2134. 0) ||
  2135. !(type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6))))
  2136. goto out;
  2137. skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
  2138. segs = NULL;
  2139. goto out;
  2140. }
  2141. segs = skb_segment(skb, features);
  2142. if (IS_ERR(segs))
  2143. goto out;
  2144. delta = htonl(oldlen + (thlen + mss));
  2145. skb = segs;
  2146. th = tcp_hdr(skb);
  2147. seq = ntohl(th->seq);
  2148. do {
  2149. th->fin = th->psh = 0;
  2150. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2151. (__force u32)delta));
  2152. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2153. th->check =
  2154. csum_fold(csum_partial(skb_transport_header(skb),
  2155. thlen, skb->csum));
  2156. seq += mss;
  2157. skb = skb->next;
  2158. th = tcp_hdr(skb);
  2159. th->seq = htonl(seq);
  2160. th->cwr = 0;
  2161. } while (skb->next);
  2162. delta = htonl(oldlen + (skb->tail - skb->transport_header) +
  2163. skb->data_len);
  2164. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2165. (__force u32)delta));
  2166. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2167. th->check = csum_fold(csum_partial(skb_transport_header(skb),
  2168. thlen, skb->csum));
  2169. out:
  2170. return segs;
  2171. }
  2172. EXPORT_SYMBOL(tcp_tso_segment);
  2173. struct sk_buff **tcp_gro_receive(struct sk_buff **head, struct sk_buff *skb)
  2174. {
  2175. struct sk_buff **pp = NULL;
  2176. struct sk_buff *p;
  2177. struct tcphdr *th;
  2178. struct tcphdr *th2;
  2179. unsigned int len;
  2180. unsigned int thlen;
  2181. unsigned int flags;
  2182. unsigned int mss = 1;
  2183. unsigned int hlen;
  2184. unsigned int off;
  2185. int flush = 1;
  2186. int i;
  2187. off = skb_gro_offset(skb);
  2188. hlen = off + sizeof(*th);
  2189. th = skb_gro_header_fast(skb, off);
  2190. if (skb_gro_header_hard(skb, hlen)) {
  2191. th = skb_gro_header_slow(skb, hlen, off);
  2192. if (unlikely(!th))
  2193. goto out;
  2194. }
  2195. thlen = th->doff * 4;
  2196. if (thlen < sizeof(*th))
  2197. goto out;
  2198. hlen = off + thlen;
  2199. if (skb_gro_header_hard(skb, hlen)) {
  2200. th = skb_gro_header_slow(skb, hlen, off);
  2201. if (unlikely(!th))
  2202. goto out;
  2203. }
  2204. skb_gro_pull(skb, thlen);
  2205. len = skb_gro_len(skb);
  2206. flags = tcp_flag_word(th);
  2207. for (; (p = *head); head = &p->next) {
  2208. if (!NAPI_GRO_CB(p)->same_flow)
  2209. continue;
  2210. th2 = tcp_hdr(p);
  2211. if (*(u32 *)&th->source ^ *(u32 *)&th2->source) {
  2212. NAPI_GRO_CB(p)->same_flow = 0;
  2213. continue;
  2214. }
  2215. goto found;
  2216. }
  2217. goto out_check_final;
  2218. found:
  2219. flush = NAPI_GRO_CB(p)->flush;
  2220. flush |= flags & TCP_FLAG_CWR;
  2221. flush |= (flags ^ tcp_flag_word(th2)) &
  2222. ~(TCP_FLAG_CWR | TCP_FLAG_FIN | TCP_FLAG_PSH);
  2223. flush |= th->ack_seq ^ th2->ack_seq;
  2224. for (i = sizeof(*th); i < thlen; i += 4)
  2225. flush |= *(u32 *)((u8 *)th + i) ^
  2226. *(u32 *)((u8 *)th2 + i);
  2227. mss = skb_shinfo(p)->gso_size;
  2228. flush |= (len - 1) >= mss;
  2229. flush |= (ntohl(th2->seq) + skb_gro_len(p)) ^ ntohl(th->seq);
  2230. if (flush || skb_gro_receive(head, skb)) {
  2231. mss = 1;
  2232. goto out_check_final;
  2233. }
  2234. p = *head;
  2235. th2 = tcp_hdr(p);
  2236. tcp_flag_word(th2) |= flags & (TCP_FLAG_FIN | TCP_FLAG_PSH);
  2237. out_check_final:
  2238. flush = len < mss;
  2239. flush |= flags & (TCP_FLAG_URG | TCP_FLAG_PSH | TCP_FLAG_RST |
  2240. TCP_FLAG_SYN | TCP_FLAG_FIN);
  2241. if (p && (!NAPI_GRO_CB(skb)->same_flow || flush))
  2242. pp = head;
  2243. out:
  2244. NAPI_GRO_CB(skb)->flush |= flush;
  2245. return pp;
  2246. }
  2247. EXPORT_SYMBOL(tcp_gro_receive);
  2248. int tcp_gro_complete(struct sk_buff *skb)
  2249. {
  2250. struct tcphdr *th = tcp_hdr(skb);
  2251. skb->csum_start = skb_transport_header(skb) - skb->head;
  2252. skb->csum_offset = offsetof(struct tcphdr, check);
  2253. skb->ip_summed = CHECKSUM_PARTIAL;
  2254. skb_shinfo(skb)->gso_segs = NAPI_GRO_CB(skb)->count;
  2255. if (th->cwr)
  2256. skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
  2257. return 0;
  2258. }
  2259. EXPORT_SYMBOL(tcp_gro_complete);
  2260. #ifdef CONFIG_TCP_MD5SIG
  2261. static unsigned long tcp_md5sig_users;
  2262. static struct tcp_md5sig_pool **tcp_md5sig_pool;
  2263. static DEFINE_SPINLOCK(tcp_md5sig_pool_lock);
  2264. static void __tcp_free_md5sig_pool(struct tcp_md5sig_pool **pool)
  2265. {
  2266. int cpu;
  2267. for_each_possible_cpu(cpu) {
  2268. struct tcp_md5sig_pool *p = *per_cpu_ptr(pool, cpu);
  2269. if (p) {
  2270. if (p->md5_desc.tfm)
  2271. crypto_free_hash(p->md5_desc.tfm);
  2272. kfree(p);
  2273. p = NULL;
  2274. }
  2275. }
  2276. free_percpu(pool);
  2277. }
  2278. void tcp_free_md5sig_pool(void)
  2279. {
  2280. struct tcp_md5sig_pool **pool = NULL;
  2281. spin_lock_bh(&tcp_md5sig_pool_lock);
  2282. if (--tcp_md5sig_users == 0) {
  2283. pool = tcp_md5sig_pool;
  2284. tcp_md5sig_pool = NULL;
  2285. }
  2286. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2287. if (pool)
  2288. __tcp_free_md5sig_pool(pool);
  2289. }
  2290. EXPORT_SYMBOL(tcp_free_md5sig_pool);
  2291. static struct tcp_md5sig_pool **__tcp_alloc_md5sig_pool(void)
  2292. {
  2293. int cpu;
  2294. struct tcp_md5sig_pool **pool;
  2295. pool = alloc_percpu(struct tcp_md5sig_pool *);
  2296. if (!pool)
  2297. return NULL;
  2298. for_each_possible_cpu(cpu) {
  2299. struct tcp_md5sig_pool *p;
  2300. struct crypto_hash *hash;
  2301. p = kzalloc(sizeof(*p), GFP_KERNEL);
  2302. if (!p)
  2303. goto out_free;
  2304. *per_cpu_ptr(pool, cpu) = p;
  2305. hash = crypto_alloc_hash("md5", 0, CRYPTO_ALG_ASYNC);
  2306. if (!hash || IS_ERR(hash))
  2307. goto out_free;
  2308. p->md5_desc.tfm = hash;
  2309. }
  2310. return pool;
  2311. out_free:
  2312. __tcp_free_md5sig_pool(pool);
  2313. return NULL;
  2314. }
  2315. struct tcp_md5sig_pool **tcp_alloc_md5sig_pool(void)
  2316. {
  2317. struct tcp_md5sig_pool **pool;
  2318. int alloc = 0;
  2319. retry:
  2320. spin_lock_bh(&tcp_md5sig_pool_lock);
  2321. pool = tcp_md5sig_pool;
  2322. if (tcp_md5sig_users++ == 0) {
  2323. alloc = 1;
  2324. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2325. } else if (!pool) {
  2326. tcp_md5sig_users--;
  2327. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2328. cpu_relax();
  2329. goto retry;
  2330. } else
  2331. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2332. if (alloc) {
  2333. /* we cannot hold spinlock here because this may sleep. */
  2334. struct tcp_md5sig_pool **p = __tcp_alloc_md5sig_pool();
  2335. spin_lock_bh(&tcp_md5sig_pool_lock);
  2336. if (!p) {
  2337. tcp_md5sig_users--;
  2338. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2339. return NULL;
  2340. }
  2341. pool = tcp_md5sig_pool;
  2342. if (pool) {
  2343. /* oops, it has already been assigned. */
  2344. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2345. __tcp_free_md5sig_pool(p);
  2346. } else {
  2347. tcp_md5sig_pool = pool = p;
  2348. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2349. }
  2350. }
  2351. return pool;
  2352. }
  2353. EXPORT_SYMBOL(tcp_alloc_md5sig_pool);
  2354. struct tcp_md5sig_pool *__tcp_get_md5sig_pool(int cpu)
  2355. {
  2356. struct tcp_md5sig_pool **p;
  2357. spin_lock_bh(&tcp_md5sig_pool_lock);
  2358. p = tcp_md5sig_pool;
  2359. if (p)
  2360. tcp_md5sig_users++;
  2361. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2362. return (p ? *per_cpu_ptr(p, cpu) : NULL);
  2363. }
  2364. EXPORT_SYMBOL(__tcp_get_md5sig_pool);
  2365. void __tcp_put_md5sig_pool(void)
  2366. {
  2367. tcp_free_md5sig_pool();
  2368. }
  2369. EXPORT_SYMBOL(__tcp_put_md5sig_pool);
  2370. int tcp_md5_hash_header(struct tcp_md5sig_pool *hp,
  2371. struct tcphdr *th)
  2372. {
  2373. struct scatterlist sg;
  2374. int err;
  2375. __sum16 old_checksum = th->check;
  2376. th->check = 0;
  2377. /* options aren't included in the hash */
  2378. sg_init_one(&sg, th, sizeof(struct tcphdr));
  2379. err = crypto_hash_update(&hp->md5_desc, &sg, sizeof(struct tcphdr));
  2380. th->check = old_checksum;
  2381. return err;
  2382. }
  2383. EXPORT_SYMBOL(tcp_md5_hash_header);
  2384. int tcp_md5_hash_skb_data(struct tcp_md5sig_pool *hp,
  2385. struct sk_buff *skb, unsigned header_len)
  2386. {
  2387. struct scatterlist sg;
  2388. const struct tcphdr *tp = tcp_hdr(skb);
  2389. struct hash_desc *desc = &hp->md5_desc;
  2390. unsigned i;
  2391. const unsigned head_data_len = skb_headlen(skb) > header_len ?
  2392. skb_headlen(skb) - header_len : 0;
  2393. const struct skb_shared_info *shi = skb_shinfo(skb);
  2394. sg_init_table(&sg, 1);
  2395. sg_set_buf(&sg, ((u8 *) tp) + header_len, head_data_len);
  2396. if (crypto_hash_update(desc, &sg, head_data_len))
  2397. return 1;
  2398. for (i = 0; i < shi->nr_frags; ++i) {
  2399. const struct skb_frag_struct *f = &shi->frags[i];
  2400. sg_set_page(&sg, f->page, f->size, f->page_offset);
  2401. if (crypto_hash_update(desc, &sg, f->size))
  2402. return 1;
  2403. }
  2404. return 0;
  2405. }
  2406. EXPORT_SYMBOL(tcp_md5_hash_skb_data);
  2407. int tcp_md5_hash_key(struct tcp_md5sig_pool *hp, struct tcp_md5sig_key *key)
  2408. {
  2409. struct scatterlist sg;
  2410. sg_init_one(&sg, key->key, key->keylen);
  2411. return crypto_hash_update(&hp->md5_desc, &sg, key->keylen);
  2412. }
  2413. EXPORT_SYMBOL(tcp_md5_hash_key);
  2414. #endif
  2415. void tcp_done(struct sock *sk)
  2416. {
  2417. if (sk->sk_state == TCP_SYN_SENT || sk->sk_state == TCP_SYN_RECV)
  2418. TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_ATTEMPTFAILS);
  2419. tcp_set_state(sk, TCP_CLOSE);
  2420. tcp_clear_xmit_timers(sk);
  2421. sk->sk_shutdown = SHUTDOWN_MASK;
  2422. if (!sock_flag(sk, SOCK_DEAD))
  2423. sk->sk_state_change(sk);
  2424. else
  2425. inet_csk_destroy_sock(sk);
  2426. }
  2427. EXPORT_SYMBOL_GPL(tcp_done);
  2428. extern struct tcp_congestion_ops tcp_reno;
  2429. static __initdata unsigned long thash_entries;
  2430. static int __init set_thash_entries(char *str)
  2431. {
  2432. if (!str)
  2433. return 0;
  2434. thash_entries = simple_strtoul(str, &str, 0);
  2435. return 1;
  2436. }
  2437. __setup("thash_entries=", set_thash_entries);
  2438. void __init tcp_init(void)
  2439. {
  2440. struct sk_buff *skb = NULL;
  2441. unsigned long nr_pages, limit;
  2442. int order, i, max_share;
  2443. BUILD_BUG_ON(sizeof(struct tcp_skb_cb) > sizeof(skb->cb));
  2444. percpu_counter_init(&tcp_sockets_allocated, 0);
  2445. percpu_counter_init(&tcp_orphan_count, 0);
  2446. tcp_hashinfo.bind_bucket_cachep =
  2447. kmem_cache_create("tcp_bind_bucket",
  2448. sizeof(struct inet_bind_bucket), 0,
  2449. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  2450. /* Size and allocate the main established and bind bucket
  2451. * hash tables.
  2452. *
  2453. * The methodology is similar to that of the buffer cache.
  2454. */
  2455. tcp_hashinfo.ehash =
  2456. alloc_large_system_hash("TCP established",
  2457. sizeof(struct inet_ehash_bucket),
  2458. thash_entries,
  2459. (num_physpages >= 128 * 1024) ?
  2460. 13 : 15,
  2461. 0,
  2462. &tcp_hashinfo.ehash_size,
  2463. NULL,
  2464. thash_entries ? 0 : 512 * 1024);
  2465. tcp_hashinfo.ehash_size = 1 << tcp_hashinfo.ehash_size;
  2466. for (i = 0; i < tcp_hashinfo.ehash_size; i++) {
  2467. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].chain, i);
  2468. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].twchain, i);
  2469. }
  2470. if (inet_ehash_locks_alloc(&tcp_hashinfo))
  2471. panic("TCP: failed to alloc ehash_locks");
  2472. tcp_hashinfo.bhash =
  2473. alloc_large_system_hash("TCP bind",
  2474. sizeof(struct inet_bind_hashbucket),
  2475. tcp_hashinfo.ehash_size,
  2476. (num_physpages >= 128 * 1024) ?
  2477. 13 : 15,
  2478. 0,
  2479. &tcp_hashinfo.bhash_size,
  2480. NULL,
  2481. 64 * 1024);
  2482. tcp_hashinfo.bhash_size = 1 << tcp_hashinfo.bhash_size;
  2483. for (i = 0; i < tcp_hashinfo.bhash_size; i++) {
  2484. spin_lock_init(&tcp_hashinfo.bhash[i].lock);
  2485. INIT_HLIST_HEAD(&tcp_hashinfo.bhash[i].chain);
  2486. }
  2487. /* Try to be a bit smarter and adjust defaults depending
  2488. * on available memory.
  2489. */
  2490. for (order = 0; ((1 << order) << PAGE_SHIFT) <
  2491. (tcp_hashinfo.bhash_size * sizeof(struct inet_bind_hashbucket));
  2492. order++)
  2493. ;
  2494. if (order >= 4) {
  2495. tcp_death_row.sysctl_max_tw_buckets = 180000;
  2496. sysctl_tcp_max_orphans = 4096 << (order - 4);
  2497. sysctl_max_syn_backlog = 1024;
  2498. } else if (order < 3) {
  2499. tcp_death_row.sysctl_max_tw_buckets >>= (3 - order);
  2500. sysctl_tcp_max_orphans >>= (3 - order);
  2501. sysctl_max_syn_backlog = 128;
  2502. }
  2503. /* Set the pressure threshold to be a fraction of global memory that
  2504. * is up to 1/2 at 256 MB, decreasing toward zero with the amount of
  2505. * memory, with a floor of 128 pages.
  2506. */
  2507. nr_pages = totalram_pages - totalhigh_pages;
  2508. limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
  2509. limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
  2510. limit = max(limit, 128UL);
  2511. sysctl_tcp_mem[0] = limit / 4 * 3;
  2512. sysctl_tcp_mem[1] = limit;
  2513. sysctl_tcp_mem[2] = sysctl_tcp_mem[0] * 2;
  2514. /* Set per-socket limits to no more than 1/128 the pressure threshold */
  2515. limit = ((unsigned long)sysctl_tcp_mem[1]) << (PAGE_SHIFT - 7);
  2516. max_share = min(4UL*1024*1024, limit);
  2517. sysctl_tcp_wmem[0] = SK_MEM_QUANTUM;
  2518. sysctl_tcp_wmem[1] = 16*1024;
  2519. sysctl_tcp_wmem[2] = max(64*1024, max_share);
  2520. sysctl_tcp_rmem[0] = SK_MEM_QUANTUM;
  2521. sysctl_tcp_rmem[1] = 87380;
  2522. sysctl_tcp_rmem[2] = max(87380, max_share);
  2523. printk(KERN_INFO "TCP: Hash tables configured "
  2524. "(established %d bind %d)\n",
  2525. tcp_hashinfo.ehash_size, tcp_hashinfo.bhash_size);
  2526. tcp_register_congestion_control(&tcp_reno);
  2527. }
  2528. EXPORT_SYMBOL(tcp_close);
  2529. EXPORT_SYMBOL(tcp_disconnect);
  2530. EXPORT_SYMBOL(tcp_getsockopt);
  2531. EXPORT_SYMBOL(tcp_ioctl);
  2532. EXPORT_SYMBOL(tcp_poll);
  2533. EXPORT_SYMBOL(tcp_read_sock);
  2534. EXPORT_SYMBOL(tcp_recvmsg);
  2535. EXPORT_SYMBOL(tcp_sendmsg);
  2536. EXPORT_SYMBOL(tcp_splice_read);
  2537. EXPORT_SYMBOL(tcp_sendpage);
  2538. EXPORT_SYMBOL(tcp_setsockopt);
  2539. EXPORT_SYMBOL(tcp_shutdown);