tcp.c 86 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298
  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 <linux/time.h>
  267. #include <linux/slab.h>
  268. #include <net/icmp.h>
  269. #include <net/tcp.h>
  270. #include <net/xfrm.h>
  271. #include <net/ip.h>
  272. #include <net/netdma.h>
  273. #include <net/sock.h>
  274. #include <asm/uaccess.h>
  275. #include <asm/ioctls.h>
  276. int sysctl_tcp_fin_timeout __read_mostly = TCP_FIN_TIMEOUT;
  277. struct percpu_counter tcp_orphan_count;
  278. EXPORT_SYMBOL_GPL(tcp_orphan_count);
  279. int sysctl_tcp_mem[3] __read_mostly;
  280. int sysctl_tcp_wmem[3] __read_mostly;
  281. int sysctl_tcp_rmem[3] __read_mostly;
  282. EXPORT_SYMBOL(sysctl_tcp_mem);
  283. EXPORT_SYMBOL(sysctl_tcp_rmem);
  284. EXPORT_SYMBOL(sysctl_tcp_wmem);
  285. atomic_t tcp_memory_allocated; /* Current allocated memory. */
  286. EXPORT_SYMBOL(tcp_memory_allocated);
  287. /*
  288. * Current number of TCP sockets.
  289. */
  290. struct percpu_counter tcp_sockets_allocated;
  291. EXPORT_SYMBOL(tcp_sockets_allocated);
  292. /*
  293. * TCP splice context
  294. */
  295. struct tcp_splice_state {
  296. struct pipe_inode_info *pipe;
  297. size_t len;
  298. unsigned int flags;
  299. };
  300. /*
  301. * Pressure flag: try to collapse.
  302. * Technical note: it is used by multiple contexts non atomically.
  303. * All the __sk_mem_schedule() is of this nature: accounting
  304. * is strict, actions are advisory and have some latency.
  305. */
  306. int tcp_memory_pressure __read_mostly;
  307. EXPORT_SYMBOL(tcp_memory_pressure);
  308. void tcp_enter_memory_pressure(struct sock *sk)
  309. {
  310. if (!tcp_memory_pressure) {
  311. NET_INC_STATS(sock_net(sk), LINUX_MIB_TCPMEMORYPRESSURES);
  312. tcp_memory_pressure = 1;
  313. }
  314. }
  315. EXPORT_SYMBOL(tcp_enter_memory_pressure);
  316. /* Convert seconds to retransmits based on initial and max timeout */
  317. static u8 secs_to_retrans(int seconds, int timeout, int rto_max)
  318. {
  319. u8 res = 0;
  320. if (seconds > 0) {
  321. int period = timeout;
  322. res = 1;
  323. while (seconds > period && res < 255) {
  324. res++;
  325. timeout <<= 1;
  326. if (timeout > rto_max)
  327. timeout = rto_max;
  328. period += timeout;
  329. }
  330. }
  331. return res;
  332. }
  333. /* Convert retransmits to seconds based on initial and max timeout */
  334. static int retrans_to_secs(u8 retrans, int timeout, int rto_max)
  335. {
  336. int period = 0;
  337. if (retrans > 0) {
  338. period = timeout;
  339. while (--retrans) {
  340. timeout <<= 1;
  341. if (timeout > rto_max)
  342. timeout = rto_max;
  343. period += timeout;
  344. }
  345. }
  346. return period;
  347. }
  348. /*
  349. * Wait for a TCP event.
  350. *
  351. * Note that we don't need to lock the socket, as the upper poll layers
  352. * take care of normal races (between the test and the event) and we don't
  353. * go look at any of the socket buffers directly.
  354. */
  355. unsigned int tcp_poll(struct file *file, struct socket *sock, poll_table *wait)
  356. {
  357. unsigned int mask;
  358. struct sock *sk = sock->sk;
  359. struct tcp_sock *tp = tcp_sk(sk);
  360. sock_poll_wait(file, sk_sleep(sk), wait);
  361. if (sk->sk_state == TCP_LISTEN)
  362. return inet_csk_listen_poll(sk);
  363. /* Socket is not locked. We are protected from async events
  364. * by poll logic and correct handling of state changes
  365. * made by other threads is impossible in any case.
  366. */
  367. mask = 0;
  368. if (sk->sk_err)
  369. mask = POLLERR;
  370. /*
  371. * POLLHUP is certainly not done right. But poll() doesn't
  372. * have a notion of HUP in just one direction, and for a
  373. * socket the read side is more interesting.
  374. *
  375. * Some poll() documentation says that POLLHUP is incompatible
  376. * with the POLLOUT/POLLWR flags, so somebody should check this
  377. * all. But careful, it tends to be safer to return too many
  378. * bits than too few, and you can easily break real applications
  379. * if you don't tell them that something has hung up!
  380. *
  381. * Check-me.
  382. *
  383. * Check number 1. POLLHUP is _UNMASKABLE_ event (see UNIX98 and
  384. * our fs/select.c). It means that after we received EOF,
  385. * poll always returns immediately, making impossible poll() on write()
  386. * in state CLOSE_WAIT. One solution is evident --- to set POLLHUP
  387. * if and only if shutdown has been made in both directions.
  388. * Actually, it is interesting to look how Solaris and DUX
  389. * solve this dilemma. I would prefer, if POLLHUP were maskable,
  390. * then we could set it on SND_SHUTDOWN. BTW examples given
  391. * in Stevens' books assume exactly this behaviour, it explains
  392. * why POLLHUP is incompatible with POLLOUT. --ANK
  393. *
  394. * NOTE. Check for TCP_CLOSE is added. The goal is to prevent
  395. * blocking on fresh not-connected or disconnected socket. --ANK
  396. */
  397. if (sk->sk_shutdown == SHUTDOWN_MASK || sk->sk_state == TCP_CLOSE)
  398. mask |= POLLHUP;
  399. if (sk->sk_shutdown & RCV_SHUTDOWN)
  400. mask |= POLLIN | POLLRDNORM | POLLRDHUP;
  401. /* Connected? */
  402. if ((1 << sk->sk_state) & ~(TCPF_SYN_SENT | TCPF_SYN_RECV)) {
  403. int target = sock_rcvlowat(sk, 0, INT_MAX);
  404. if (tp->urg_seq == tp->copied_seq &&
  405. !sock_flag(sk, SOCK_URGINLINE) &&
  406. tp->urg_data)
  407. target++;
  408. /* Potential race condition. If read of tp below will
  409. * escape above sk->sk_state, we can be illegally awaken
  410. * in SYN_* states. */
  411. if (tp->rcv_nxt - tp->copied_seq >= target)
  412. mask |= POLLIN | POLLRDNORM;
  413. if (!(sk->sk_shutdown & SEND_SHUTDOWN)) {
  414. if (sk_stream_wspace(sk) >= sk_stream_min_wspace(sk)) {
  415. mask |= POLLOUT | POLLWRNORM;
  416. } else { /* send SIGIO later */
  417. set_bit(SOCK_ASYNC_NOSPACE,
  418. &sk->sk_socket->flags);
  419. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  420. /* Race breaker. If space is freed after
  421. * wspace test but before the flags are set,
  422. * IO signal will be lost.
  423. */
  424. if (sk_stream_wspace(sk) >= sk_stream_min_wspace(sk))
  425. mask |= POLLOUT | POLLWRNORM;
  426. }
  427. }
  428. if (tp->urg_data & TCP_URG_VALID)
  429. mask |= POLLPRI;
  430. }
  431. return mask;
  432. }
  433. int tcp_ioctl(struct sock *sk, int cmd, unsigned long arg)
  434. {
  435. struct tcp_sock *tp = tcp_sk(sk);
  436. int answ;
  437. switch (cmd) {
  438. case SIOCINQ:
  439. if (sk->sk_state == TCP_LISTEN)
  440. return -EINVAL;
  441. lock_sock(sk);
  442. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  443. answ = 0;
  444. else if (sock_flag(sk, SOCK_URGINLINE) ||
  445. !tp->urg_data ||
  446. before(tp->urg_seq, tp->copied_seq) ||
  447. !before(tp->urg_seq, tp->rcv_nxt)) {
  448. struct sk_buff *skb;
  449. answ = tp->rcv_nxt - tp->copied_seq;
  450. /* Subtract 1, if FIN is in queue. */
  451. skb = skb_peek_tail(&sk->sk_receive_queue);
  452. if (answ && skb)
  453. answ -= tcp_hdr(skb)->fin;
  454. } else
  455. answ = tp->urg_seq - tp->copied_seq;
  456. release_sock(sk);
  457. break;
  458. case SIOCATMARK:
  459. answ = tp->urg_data && tp->urg_seq == tp->copied_seq;
  460. break;
  461. case SIOCOUTQ:
  462. if (sk->sk_state == TCP_LISTEN)
  463. return -EINVAL;
  464. if ((1 << sk->sk_state) & (TCPF_SYN_SENT | TCPF_SYN_RECV))
  465. answ = 0;
  466. else
  467. answ = tp->write_seq - tp->snd_una;
  468. break;
  469. default:
  470. return -ENOIOCTLCMD;
  471. }
  472. return put_user(answ, (int __user *)arg);
  473. }
  474. static inline void tcp_mark_push(struct tcp_sock *tp, struct sk_buff *skb)
  475. {
  476. TCP_SKB_CB(skb)->flags |= TCPCB_FLAG_PSH;
  477. tp->pushed_seq = tp->write_seq;
  478. }
  479. static inline int forced_push(struct tcp_sock *tp)
  480. {
  481. return after(tp->write_seq, tp->pushed_seq + (tp->max_window >> 1));
  482. }
  483. static inline void skb_entail(struct sock *sk, struct sk_buff *skb)
  484. {
  485. struct tcp_sock *tp = tcp_sk(sk);
  486. struct tcp_skb_cb *tcb = TCP_SKB_CB(skb);
  487. skb->csum = 0;
  488. tcb->seq = tcb->end_seq = tp->write_seq;
  489. tcb->flags = TCPCB_FLAG_ACK;
  490. tcb->sacked = 0;
  491. skb_header_release(skb);
  492. tcp_add_write_queue_tail(sk, skb);
  493. sk->sk_wmem_queued += skb->truesize;
  494. sk_mem_charge(sk, skb->truesize);
  495. if (tp->nonagle & TCP_NAGLE_PUSH)
  496. tp->nonagle &= ~TCP_NAGLE_PUSH;
  497. }
  498. static inline void tcp_mark_urg(struct tcp_sock *tp, int flags)
  499. {
  500. if (flags & MSG_OOB)
  501. tp->snd_up = tp->write_seq;
  502. }
  503. static inline void tcp_push(struct sock *sk, int flags, int mss_now,
  504. int nonagle)
  505. {
  506. if (tcp_send_head(sk)) {
  507. struct tcp_sock *tp = tcp_sk(sk);
  508. if (!(flags & MSG_MORE) || forced_push(tp))
  509. tcp_mark_push(tp, tcp_write_queue_tail(sk));
  510. tcp_mark_urg(tp, flags);
  511. __tcp_push_pending_frames(sk, mss_now,
  512. (flags & MSG_MORE) ? TCP_NAGLE_CORK : nonagle);
  513. }
  514. }
  515. static int tcp_splice_data_recv(read_descriptor_t *rd_desc, struct sk_buff *skb,
  516. unsigned int offset, size_t len)
  517. {
  518. struct tcp_splice_state *tss = rd_desc->arg.data;
  519. int ret;
  520. ret = skb_splice_bits(skb, offset, tss->pipe, min(rd_desc->count, len),
  521. tss->flags);
  522. if (ret > 0)
  523. rd_desc->count -= ret;
  524. return ret;
  525. }
  526. static int __tcp_splice_read(struct sock *sk, struct tcp_splice_state *tss)
  527. {
  528. /* Store TCP splice context information in read_descriptor_t. */
  529. read_descriptor_t rd_desc = {
  530. .arg.data = tss,
  531. .count = tss->len,
  532. };
  533. return tcp_read_sock(sk, &rd_desc, tcp_splice_data_recv);
  534. }
  535. /**
  536. * tcp_splice_read - splice data from TCP socket to a pipe
  537. * @sock: socket to splice from
  538. * @ppos: position (not valid)
  539. * @pipe: pipe to splice to
  540. * @len: number of bytes to splice
  541. * @flags: splice modifier flags
  542. *
  543. * Description:
  544. * Will read pages from given socket and fill them into a pipe.
  545. *
  546. **/
  547. ssize_t tcp_splice_read(struct socket *sock, loff_t *ppos,
  548. struct pipe_inode_info *pipe, size_t len,
  549. unsigned int flags)
  550. {
  551. struct sock *sk = sock->sk;
  552. struct tcp_splice_state tss = {
  553. .pipe = pipe,
  554. .len = len,
  555. .flags = flags,
  556. };
  557. long timeo;
  558. ssize_t spliced;
  559. int ret;
  560. /*
  561. * We can't seek on a socket input
  562. */
  563. if (unlikely(*ppos))
  564. return -ESPIPE;
  565. ret = spliced = 0;
  566. lock_sock(sk);
  567. timeo = sock_rcvtimeo(sk, sock->file->f_flags & O_NONBLOCK);
  568. while (tss.len) {
  569. ret = __tcp_splice_read(sk, &tss);
  570. if (ret < 0)
  571. break;
  572. else if (!ret) {
  573. if (spliced)
  574. break;
  575. if (sock_flag(sk, SOCK_DONE))
  576. break;
  577. if (sk->sk_err) {
  578. ret = sock_error(sk);
  579. break;
  580. }
  581. if (sk->sk_shutdown & RCV_SHUTDOWN)
  582. break;
  583. if (sk->sk_state == TCP_CLOSE) {
  584. /*
  585. * This occurs when user tries to read
  586. * from never connected socket.
  587. */
  588. if (!sock_flag(sk, SOCK_DONE))
  589. ret = -ENOTCONN;
  590. break;
  591. }
  592. if (!timeo) {
  593. ret = -EAGAIN;
  594. break;
  595. }
  596. sk_wait_data(sk, &timeo);
  597. if (signal_pending(current)) {
  598. ret = sock_intr_errno(timeo);
  599. break;
  600. }
  601. continue;
  602. }
  603. tss.len -= ret;
  604. spliced += ret;
  605. if (!timeo)
  606. break;
  607. release_sock(sk);
  608. lock_sock(sk);
  609. if (sk->sk_err || sk->sk_state == TCP_CLOSE ||
  610. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  611. signal_pending(current))
  612. break;
  613. }
  614. release_sock(sk);
  615. if (spliced)
  616. return spliced;
  617. return ret;
  618. }
  619. struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp)
  620. {
  621. struct sk_buff *skb;
  622. /* The TCP header must be at least 32-bit aligned. */
  623. size = ALIGN(size, 4);
  624. skb = alloc_skb_fclone(size + sk->sk_prot->max_header, gfp);
  625. if (skb) {
  626. if (sk_wmem_schedule(sk, skb->truesize)) {
  627. /*
  628. * Make sure that we have exactly size bytes
  629. * available to the caller, no more, no less.
  630. */
  631. skb_reserve(skb, skb_tailroom(skb) - size);
  632. return skb;
  633. }
  634. __kfree_skb(skb);
  635. } else {
  636. sk->sk_prot->enter_memory_pressure(sk);
  637. sk_stream_moderate_sndbuf(sk);
  638. }
  639. return NULL;
  640. }
  641. static unsigned int tcp_xmit_size_goal(struct sock *sk, u32 mss_now,
  642. int large_allowed)
  643. {
  644. struct tcp_sock *tp = tcp_sk(sk);
  645. u32 xmit_size_goal, old_size_goal;
  646. xmit_size_goal = mss_now;
  647. if (large_allowed && sk_can_gso(sk)) {
  648. xmit_size_goal = ((sk->sk_gso_max_size - 1) -
  649. inet_csk(sk)->icsk_af_ops->net_header_len -
  650. inet_csk(sk)->icsk_ext_hdr_len -
  651. tp->tcp_header_len);
  652. xmit_size_goal = tcp_bound_to_half_wnd(tp, xmit_size_goal);
  653. /* We try hard to avoid divides here */
  654. old_size_goal = tp->xmit_size_goal_segs * mss_now;
  655. if (likely(old_size_goal <= xmit_size_goal &&
  656. old_size_goal + mss_now > xmit_size_goal)) {
  657. xmit_size_goal = old_size_goal;
  658. } else {
  659. tp->xmit_size_goal_segs = xmit_size_goal / mss_now;
  660. xmit_size_goal = tp->xmit_size_goal_segs * mss_now;
  661. }
  662. }
  663. return max(xmit_size_goal, mss_now);
  664. }
  665. static int tcp_send_mss(struct sock *sk, int *size_goal, int flags)
  666. {
  667. int mss_now;
  668. mss_now = tcp_current_mss(sk);
  669. *size_goal = tcp_xmit_size_goal(sk, mss_now, !(flags & MSG_OOB));
  670. return mss_now;
  671. }
  672. static ssize_t do_tcp_sendpages(struct sock *sk, struct page **pages, int poffset,
  673. size_t psize, int flags)
  674. {
  675. struct tcp_sock *tp = tcp_sk(sk);
  676. int mss_now, size_goal;
  677. int err;
  678. ssize_t copied;
  679. long timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  680. /* Wait for a connection to finish. */
  681. if ((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT))
  682. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  683. goto out_err;
  684. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  685. mss_now = tcp_send_mss(sk, &size_goal, flags);
  686. copied = 0;
  687. err = -EPIPE;
  688. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  689. goto out_err;
  690. while (psize > 0) {
  691. struct sk_buff *skb = tcp_write_queue_tail(sk);
  692. struct page *page = pages[poffset / PAGE_SIZE];
  693. int copy, i, can_coalesce;
  694. int offset = poffset % PAGE_SIZE;
  695. int size = min_t(size_t, psize, PAGE_SIZE - offset);
  696. if (!tcp_send_head(sk) || (copy = size_goal - skb->len) <= 0) {
  697. new_segment:
  698. if (!sk_stream_memory_free(sk))
  699. goto wait_for_sndbuf;
  700. skb = sk_stream_alloc_skb(sk, 0, sk->sk_allocation);
  701. if (!skb)
  702. goto wait_for_memory;
  703. skb_entail(sk, skb);
  704. copy = size_goal;
  705. }
  706. if (copy > size)
  707. copy = size;
  708. i = skb_shinfo(skb)->nr_frags;
  709. can_coalesce = skb_can_coalesce(skb, i, page, offset);
  710. if (!can_coalesce && i >= MAX_SKB_FRAGS) {
  711. tcp_mark_push(tp, skb);
  712. goto new_segment;
  713. }
  714. if (!sk_wmem_schedule(sk, copy))
  715. goto wait_for_memory;
  716. if (can_coalesce) {
  717. skb_shinfo(skb)->frags[i - 1].size += copy;
  718. } else {
  719. get_page(page);
  720. skb_fill_page_desc(skb, i, page, offset, copy);
  721. }
  722. skb->len += copy;
  723. skb->data_len += copy;
  724. skb->truesize += copy;
  725. sk->sk_wmem_queued += copy;
  726. sk_mem_charge(sk, copy);
  727. skb->ip_summed = CHECKSUM_PARTIAL;
  728. tp->write_seq += copy;
  729. TCP_SKB_CB(skb)->end_seq += copy;
  730. skb_shinfo(skb)->gso_segs = 0;
  731. if (!copied)
  732. TCP_SKB_CB(skb)->flags &= ~TCPCB_FLAG_PSH;
  733. copied += copy;
  734. poffset += copy;
  735. if (!(psize -= copy))
  736. goto out;
  737. if (skb->len < size_goal || (flags & MSG_OOB))
  738. continue;
  739. if (forced_push(tp)) {
  740. tcp_mark_push(tp, skb);
  741. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  742. } else if (skb == tcp_send_head(sk))
  743. tcp_push_one(sk, mss_now);
  744. continue;
  745. wait_for_sndbuf:
  746. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  747. wait_for_memory:
  748. if (copied)
  749. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  750. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  751. goto do_error;
  752. mss_now = tcp_send_mss(sk, &size_goal, flags);
  753. }
  754. out:
  755. if (copied)
  756. tcp_push(sk, flags, mss_now, tp->nonagle);
  757. return copied;
  758. do_error:
  759. if (copied)
  760. goto out;
  761. out_err:
  762. return sk_stream_error(sk, flags, err);
  763. }
  764. ssize_t tcp_sendpage(struct socket *sock, struct page *page, int offset,
  765. size_t size, int flags)
  766. {
  767. ssize_t res;
  768. struct sock *sk = sock->sk;
  769. if (!(sk->sk_route_caps & NETIF_F_SG) ||
  770. !(sk->sk_route_caps & NETIF_F_ALL_CSUM))
  771. return sock_no_sendpage(sock, page, offset, size, flags);
  772. lock_sock(sk);
  773. TCP_CHECK_TIMER(sk);
  774. res = do_tcp_sendpages(sk, &page, offset, size, flags);
  775. TCP_CHECK_TIMER(sk);
  776. release_sock(sk);
  777. return res;
  778. }
  779. #define TCP_PAGE(sk) (sk->sk_sndmsg_page)
  780. #define TCP_OFF(sk) (sk->sk_sndmsg_off)
  781. static inline int select_size(struct sock *sk, int sg)
  782. {
  783. struct tcp_sock *tp = tcp_sk(sk);
  784. int tmp = tp->mss_cache;
  785. if (sg) {
  786. if (sk_can_gso(sk))
  787. tmp = 0;
  788. else {
  789. int pgbreak = SKB_MAX_HEAD(MAX_TCP_HEADER);
  790. if (tmp >= pgbreak &&
  791. tmp <= pgbreak + (MAX_SKB_FRAGS - 1) * PAGE_SIZE)
  792. tmp = pgbreak;
  793. }
  794. }
  795. return tmp;
  796. }
  797. int tcp_sendmsg(struct kiocb *iocb, struct socket *sock, struct msghdr *msg,
  798. size_t size)
  799. {
  800. struct sock *sk = sock->sk;
  801. struct iovec *iov;
  802. struct tcp_sock *tp = tcp_sk(sk);
  803. struct sk_buff *skb;
  804. int iovlen, flags;
  805. int mss_now, size_goal;
  806. int sg, err, copied;
  807. long timeo;
  808. lock_sock(sk);
  809. TCP_CHECK_TIMER(sk);
  810. flags = msg->msg_flags;
  811. timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  812. /* Wait for a connection to finish. */
  813. if ((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT))
  814. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  815. goto out_err;
  816. /* This should be in poll */
  817. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  818. mss_now = tcp_send_mss(sk, &size_goal, flags);
  819. /* Ok commence sending. */
  820. iovlen = msg->msg_iovlen;
  821. iov = msg->msg_iov;
  822. copied = 0;
  823. err = -EPIPE;
  824. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  825. goto out_err;
  826. sg = sk->sk_route_caps & NETIF_F_SG;
  827. while (--iovlen >= 0) {
  828. int seglen = iov->iov_len;
  829. unsigned char __user *from = iov->iov_base;
  830. iov++;
  831. while (seglen > 0) {
  832. int copy = 0;
  833. int max = size_goal;
  834. skb = tcp_write_queue_tail(sk);
  835. if (tcp_send_head(sk)) {
  836. if (skb->ip_summed == CHECKSUM_NONE)
  837. max = mss_now;
  838. copy = max - skb->len;
  839. }
  840. if (copy <= 0) {
  841. new_segment:
  842. /* Allocate new segment. If the interface is SG,
  843. * allocate skb fitting to single page.
  844. */
  845. if (!sk_stream_memory_free(sk))
  846. goto wait_for_sndbuf;
  847. skb = sk_stream_alloc_skb(sk,
  848. select_size(sk, sg),
  849. sk->sk_allocation);
  850. if (!skb)
  851. goto wait_for_memory;
  852. /*
  853. * Check whether we can use HW checksum.
  854. */
  855. if (sk->sk_route_caps & NETIF_F_ALL_CSUM)
  856. skb->ip_summed = CHECKSUM_PARTIAL;
  857. skb_entail(sk, skb);
  858. copy = size_goal;
  859. max = size_goal;
  860. }
  861. /* Try to append data to the end of skb. */
  862. if (copy > seglen)
  863. copy = seglen;
  864. /* Where to copy to? */
  865. if (skb_tailroom(skb) > 0) {
  866. /* We have some space in skb head. Superb! */
  867. if (copy > skb_tailroom(skb))
  868. copy = skb_tailroom(skb);
  869. if ((err = skb_add_data(skb, from, copy)) != 0)
  870. goto do_fault;
  871. } else {
  872. int merge = 0;
  873. int i = skb_shinfo(skb)->nr_frags;
  874. struct page *page = TCP_PAGE(sk);
  875. int off = TCP_OFF(sk);
  876. if (skb_can_coalesce(skb, i, page, off) &&
  877. off != PAGE_SIZE) {
  878. /* We can extend the last page
  879. * fragment. */
  880. merge = 1;
  881. } else if (i == MAX_SKB_FRAGS || !sg) {
  882. /* Need to add new fragment and cannot
  883. * do this because interface is non-SG,
  884. * or because all the page slots are
  885. * busy. */
  886. tcp_mark_push(tp, skb);
  887. goto new_segment;
  888. } else if (page) {
  889. if (off == PAGE_SIZE) {
  890. put_page(page);
  891. TCP_PAGE(sk) = page = NULL;
  892. off = 0;
  893. }
  894. } else
  895. off = 0;
  896. if (copy > PAGE_SIZE - off)
  897. copy = PAGE_SIZE - off;
  898. if (!sk_wmem_schedule(sk, copy))
  899. goto wait_for_memory;
  900. if (!page) {
  901. /* Allocate new cache page. */
  902. if (!(page = sk_stream_alloc_page(sk)))
  903. goto wait_for_memory;
  904. }
  905. /* Time to copy data. We are close to
  906. * the end! */
  907. err = skb_copy_to_page(sk, from, skb, page,
  908. off, copy);
  909. if (err) {
  910. /* If this page was new, give it to the
  911. * socket so it does not get leaked.
  912. */
  913. if (!TCP_PAGE(sk)) {
  914. TCP_PAGE(sk) = page;
  915. TCP_OFF(sk) = 0;
  916. }
  917. goto do_error;
  918. }
  919. /* Update the skb. */
  920. if (merge) {
  921. skb_shinfo(skb)->frags[i - 1].size +=
  922. copy;
  923. } else {
  924. skb_fill_page_desc(skb, i, page, off, copy);
  925. if (TCP_PAGE(sk)) {
  926. get_page(page);
  927. } else if (off + copy < PAGE_SIZE) {
  928. get_page(page);
  929. TCP_PAGE(sk) = page;
  930. }
  931. }
  932. TCP_OFF(sk) = off + copy;
  933. }
  934. if (!copied)
  935. TCP_SKB_CB(skb)->flags &= ~TCPCB_FLAG_PSH;
  936. tp->write_seq += copy;
  937. TCP_SKB_CB(skb)->end_seq += copy;
  938. skb_shinfo(skb)->gso_segs = 0;
  939. from += copy;
  940. copied += copy;
  941. if ((seglen -= copy) == 0 && iovlen == 0)
  942. goto out;
  943. if (skb->len < max || (flags & MSG_OOB))
  944. continue;
  945. if (forced_push(tp)) {
  946. tcp_mark_push(tp, skb);
  947. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  948. } else if (skb == tcp_send_head(sk))
  949. tcp_push_one(sk, mss_now);
  950. continue;
  951. wait_for_sndbuf:
  952. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  953. wait_for_memory:
  954. if (copied)
  955. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  956. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  957. goto do_error;
  958. mss_now = tcp_send_mss(sk, &size_goal, flags);
  959. }
  960. }
  961. out:
  962. if (copied)
  963. tcp_push(sk, flags, mss_now, tp->nonagle);
  964. TCP_CHECK_TIMER(sk);
  965. release_sock(sk);
  966. return copied;
  967. do_fault:
  968. if (!skb->len) {
  969. tcp_unlink_write_queue(skb, sk);
  970. /* It is the one place in all of TCP, except connection
  971. * reset, where we can be unlinking the send_head.
  972. */
  973. tcp_check_send_head(sk, skb);
  974. sk_wmem_free_skb(sk, skb);
  975. }
  976. do_error:
  977. if (copied)
  978. goto out;
  979. out_err:
  980. err = sk_stream_error(sk, flags, err);
  981. TCP_CHECK_TIMER(sk);
  982. release_sock(sk);
  983. return err;
  984. }
  985. /*
  986. * Handle reading urgent data. BSD has very simple semantics for
  987. * this, no blocking and very strange errors 8)
  988. */
  989. static int tcp_recv_urg(struct sock *sk, struct msghdr *msg, int len, int flags)
  990. {
  991. struct tcp_sock *tp = tcp_sk(sk);
  992. /* No URG data to read. */
  993. if (sock_flag(sk, SOCK_URGINLINE) || !tp->urg_data ||
  994. tp->urg_data == TCP_URG_READ)
  995. return -EINVAL; /* Yes this is right ! */
  996. if (sk->sk_state == TCP_CLOSE && !sock_flag(sk, SOCK_DONE))
  997. return -ENOTCONN;
  998. if (tp->urg_data & TCP_URG_VALID) {
  999. int err = 0;
  1000. char c = tp->urg_data;
  1001. if (!(flags & MSG_PEEK))
  1002. tp->urg_data = TCP_URG_READ;
  1003. /* Read urgent data. */
  1004. msg->msg_flags |= MSG_OOB;
  1005. if (len > 0) {
  1006. if (!(flags & MSG_TRUNC))
  1007. err = memcpy_toiovec(msg->msg_iov, &c, 1);
  1008. len = 1;
  1009. } else
  1010. msg->msg_flags |= MSG_TRUNC;
  1011. return err ? -EFAULT : len;
  1012. }
  1013. if (sk->sk_state == TCP_CLOSE || (sk->sk_shutdown & RCV_SHUTDOWN))
  1014. return 0;
  1015. /* Fixed the recv(..., MSG_OOB) behaviour. BSD docs and
  1016. * the available implementations agree in this case:
  1017. * this call should never block, independent of the
  1018. * blocking state of the socket.
  1019. * Mike <pall@rz.uni-karlsruhe.de>
  1020. */
  1021. return -EAGAIN;
  1022. }
  1023. /* Clean up the receive buffer for full frames taken by the user,
  1024. * then send an ACK if necessary. COPIED is the number of bytes
  1025. * tcp_recvmsg has given to the user so far, it speeds up the
  1026. * calculation of whether or not we must ACK for the sake of
  1027. * a window update.
  1028. */
  1029. void tcp_cleanup_rbuf(struct sock *sk, int copied)
  1030. {
  1031. struct tcp_sock *tp = tcp_sk(sk);
  1032. int time_to_ack = 0;
  1033. #if TCP_DEBUG
  1034. struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
  1035. WARN(skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq),
  1036. KERN_INFO "cleanup rbuf bug: copied %X seq %X rcvnxt %X\n",
  1037. tp->copied_seq, TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt);
  1038. #endif
  1039. if (inet_csk_ack_scheduled(sk)) {
  1040. const struct inet_connection_sock *icsk = inet_csk(sk);
  1041. /* Delayed ACKs frequently hit locked sockets during bulk
  1042. * receive. */
  1043. if (icsk->icsk_ack.blocked ||
  1044. /* Once-per-two-segments ACK was not sent by tcp_input.c */
  1045. tp->rcv_nxt - tp->rcv_wup > icsk->icsk_ack.rcv_mss ||
  1046. /*
  1047. * If this read emptied read buffer, we send ACK, if
  1048. * connection is not bidirectional, user drained
  1049. * receive buffer and there was a small segment
  1050. * in queue.
  1051. */
  1052. (copied > 0 &&
  1053. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED2) ||
  1054. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED) &&
  1055. !icsk->icsk_ack.pingpong)) &&
  1056. !atomic_read(&sk->sk_rmem_alloc)))
  1057. time_to_ack = 1;
  1058. }
  1059. /* We send an ACK if we can now advertise a non-zero window
  1060. * which has been raised "significantly".
  1061. *
  1062. * Even if window raised up to infinity, do not send window open ACK
  1063. * in states, where we will not receive more. It is useless.
  1064. */
  1065. if (copied > 0 && !time_to_ack && !(sk->sk_shutdown & RCV_SHUTDOWN)) {
  1066. __u32 rcv_window_now = tcp_receive_window(tp);
  1067. /* Optimize, __tcp_select_window() is not cheap. */
  1068. if (2*rcv_window_now <= tp->window_clamp) {
  1069. __u32 new_window = __tcp_select_window(sk);
  1070. /* Send ACK now, if this read freed lots of space
  1071. * in our buffer. Certainly, new_window is new window.
  1072. * We can advertise it now, if it is not less than current one.
  1073. * "Lots" means "at least twice" here.
  1074. */
  1075. if (new_window && new_window >= 2 * rcv_window_now)
  1076. time_to_ack = 1;
  1077. }
  1078. }
  1079. if (time_to_ack)
  1080. tcp_send_ack(sk);
  1081. }
  1082. static void tcp_prequeue_process(struct sock *sk)
  1083. {
  1084. struct sk_buff *skb;
  1085. struct tcp_sock *tp = tcp_sk(sk);
  1086. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPPREQUEUED);
  1087. /* RX process wants to run with disabled BHs, though it is not
  1088. * necessary */
  1089. local_bh_disable();
  1090. while ((skb = __skb_dequeue(&tp->ucopy.prequeue)) != NULL)
  1091. sk_backlog_rcv(sk, skb);
  1092. local_bh_enable();
  1093. /* Clear memory counter. */
  1094. tp->ucopy.memory = 0;
  1095. }
  1096. #ifdef CONFIG_NET_DMA
  1097. static void tcp_service_net_dma(struct sock *sk, bool wait)
  1098. {
  1099. dma_cookie_t done, used;
  1100. dma_cookie_t last_issued;
  1101. struct tcp_sock *tp = tcp_sk(sk);
  1102. if (!tp->ucopy.dma_chan)
  1103. return;
  1104. last_issued = tp->ucopy.dma_cookie;
  1105. dma_async_memcpy_issue_pending(tp->ucopy.dma_chan);
  1106. do {
  1107. if (dma_async_memcpy_complete(tp->ucopy.dma_chan,
  1108. last_issued, &done,
  1109. &used) == DMA_SUCCESS) {
  1110. /* Safe to free early-copied skbs now */
  1111. __skb_queue_purge(&sk->sk_async_wait_queue);
  1112. break;
  1113. } else {
  1114. struct sk_buff *skb;
  1115. while ((skb = skb_peek(&sk->sk_async_wait_queue)) &&
  1116. (dma_async_is_complete(skb->dma_cookie, done,
  1117. used) == DMA_SUCCESS)) {
  1118. __skb_dequeue(&sk->sk_async_wait_queue);
  1119. kfree_skb(skb);
  1120. }
  1121. }
  1122. } while (wait);
  1123. }
  1124. #endif
  1125. static inline struct sk_buff *tcp_recv_skb(struct sock *sk, u32 seq, u32 *off)
  1126. {
  1127. struct sk_buff *skb;
  1128. u32 offset;
  1129. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1130. offset = seq - TCP_SKB_CB(skb)->seq;
  1131. if (tcp_hdr(skb)->syn)
  1132. offset--;
  1133. if (offset < skb->len || tcp_hdr(skb)->fin) {
  1134. *off = offset;
  1135. return skb;
  1136. }
  1137. }
  1138. return NULL;
  1139. }
  1140. /*
  1141. * This routine provides an alternative to tcp_recvmsg() for routines
  1142. * that would like to handle copying from skbuffs directly in 'sendfile'
  1143. * fashion.
  1144. * Note:
  1145. * - It is assumed that the socket was locked by the caller.
  1146. * - The routine does not block.
  1147. * - At present, there is no support for reading OOB data
  1148. * or for 'peeking' the socket using this routine
  1149. * (although both would be easy to implement).
  1150. */
  1151. int tcp_read_sock(struct sock *sk, read_descriptor_t *desc,
  1152. sk_read_actor_t recv_actor)
  1153. {
  1154. struct sk_buff *skb;
  1155. struct tcp_sock *tp = tcp_sk(sk);
  1156. u32 seq = tp->copied_seq;
  1157. u32 offset;
  1158. int copied = 0;
  1159. if (sk->sk_state == TCP_LISTEN)
  1160. return -ENOTCONN;
  1161. while ((skb = tcp_recv_skb(sk, seq, &offset)) != NULL) {
  1162. if (offset < skb->len) {
  1163. int used;
  1164. size_t len;
  1165. len = skb->len - offset;
  1166. /* Stop reading if we hit a patch of urgent data */
  1167. if (tp->urg_data) {
  1168. u32 urg_offset = tp->urg_seq - seq;
  1169. if (urg_offset < len)
  1170. len = urg_offset;
  1171. if (!len)
  1172. break;
  1173. }
  1174. used = recv_actor(desc, skb, offset, len);
  1175. if (used < 0) {
  1176. if (!copied)
  1177. copied = used;
  1178. break;
  1179. } else if (used <= len) {
  1180. seq += used;
  1181. copied += used;
  1182. offset += used;
  1183. }
  1184. /*
  1185. * If recv_actor drops the lock (e.g. TCP splice
  1186. * receive) the skb pointer might be invalid when
  1187. * getting here: tcp_collapse might have deleted it
  1188. * while aggregating skbs from the socket queue.
  1189. */
  1190. skb = tcp_recv_skb(sk, seq-1, &offset);
  1191. if (!skb || (offset+1 != skb->len))
  1192. break;
  1193. }
  1194. if (tcp_hdr(skb)->fin) {
  1195. sk_eat_skb(sk, skb, 0);
  1196. ++seq;
  1197. break;
  1198. }
  1199. sk_eat_skb(sk, skb, 0);
  1200. if (!desc->count)
  1201. break;
  1202. tp->copied_seq = seq;
  1203. }
  1204. tp->copied_seq = seq;
  1205. tcp_rcv_space_adjust(sk);
  1206. /* Clean up data we have read: This will do ACK frames. */
  1207. if (copied > 0)
  1208. tcp_cleanup_rbuf(sk, copied);
  1209. return copied;
  1210. }
  1211. /*
  1212. * This routine copies from a sock struct into the user buffer.
  1213. *
  1214. * Technical note: in 2.3 we work on _locked_ socket, so that
  1215. * tricks with *seq access order and skb->users are not required.
  1216. * Probably, code can be easily improved even more.
  1217. */
  1218. int tcp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  1219. size_t len, int nonblock, int flags, int *addr_len)
  1220. {
  1221. struct tcp_sock *tp = tcp_sk(sk);
  1222. int copied = 0;
  1223. u32 peek_seq;
  1224. u32 *seq;
  1225. unsigned long used;
  1226. int err;
  1227. int target; /* Read at least this many bytes */
  1228. long timeo;
  1229. struct task_struct *user_recv = NULL;
  1230. int copied_early = 0;
  1231. struct sk_buff *skb;
  1232. u32 urg_hole = 0;
  1233. lock_sock(sk);
  1234. TCP_CHECK_TIMER(sk);
  1235. err = -ENOTCONN;
  1236. if (sk->sk_state == TCP_LISTEN)
  1237. goto out;
  1238. timeo = sock_rcvtimeo(sk, nonblock);
  1239. /* Urgent data needs to be handled specially. */
  1240. if (flags & MSG_OOB)
  1241. goto recv_urg;
  1242. seq = &tp->copied_seq;
  1243. if (flags & MSG_PEEK) {
  1244. peek_seq = tp->copied_seq;
  1245. seq = &peek_seq;
  1246. }
  1247. target = sock_rcvlowat(sk, flags & MSG_WAITALL, len);
  1248. #ifdef CONFIG_NET_DMA
  1249. tp->ucopy.dma_chan = NULL;
  1250. preempt_disable();
  1251. skb = skb_peek_tail(&sk->sk_receive_queue);
  1252. {
  1253. int available = 0;
  1254. if (skb)
  1255. available = TCP_SKB_CB(skb)->seq + skb->len - (*seq);
  1256. if ((available < target) &&
  1257. (len > sysctl_tcp_dma_copybreak) && !(flags & MSG_PEEK) &&
  1258. !sysctl_tcp_low_latency &&
  1259. dma_find_channel(DMA_MEMCPY)) {
  1260. preempt_enable_no_resched();
  1261. tp->ucopy.pinned_list =
  1262. dma_pin_iovec_pages(msg->msg_iov, len);
  1263. } else {
  1264. preempt_enable_no_resched();
  1265. }
  1266. }
  1267. #endif
  1268. do {
  1269. u32 offset;
  1270. /* Are we at urgent data? Stop if we have read anything or have SIGURG pending. */
  1271. if (tp->urg_data && tp->urg_seq == *seq) {
  1272. if (copied)
  1273. break;
  1274. if (signal_pending(current)) {
  1275. copied = timeo ? sock_intr_errno(timeo) : -EAGAIN;
  1276. break;
  1277. }
  1278. }
  1279. /* Next get a buffer. */
  1280. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1281. /* Now that we have two receive queues this
  1282. * shouldn't happen.
  1283. */
  1284. if (WARN(before(*seq, TCP_SKB_CB(skb)->seq),
  1285. KERN_INFO "recvmsg bug: copied %X "
  1286. "seq %X rcvnxt %X fl %X\n", *seq,
  1287. TCP_SKB_CB(skb)->seq, tp->rcv_nxt,
  1288. flags))
  1289. break;
  1290. offset = *seq - TCP_SKB_CB(skb)->seq;
  1291. if (tcp_hdr(skb)->syn)
  1292. offset--;
  1293. if (offset < skb->len)
  1294. goto found_ok_skb;
  1295. if (tcp_hdr(skb)->fin)
  1296. goto found_fin_ok;
  1297. WARN(!(flags & MSG_PEEK), KERN_INFO "recvmsg bug 2: "
  1298. "copied %X seq %X rcvnxt %X fl %X\n",
  1299. *seq, TCP_SKB_CB(skb)->seq,
  1300. tp->rcv_nxt, flags);
  1301. }
  1302. /* Well, if we have backlog, try to process it now yet. */
  1303. if (copied >= target && !sk->sk_backlog.tail)
  1304. break;
  1305. if (copied) {
  1306. if (sk->sk_err ||
  1307. sk->sk_state == TCP_CLOSE ||
  1308. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  1309. !timeo ||
  1310. signal_pending(current))
  1311. break;
  1312. } else {
  1313. if (sock_flag(sk, SOCK_DONE))
  1314. break;
  1315. if (sk->sk_err) {
  1316. copied = sock_error(sk);
  1317. break;
  1318. }
  1319. if (sk->sk_shutdown & RCV_SHUTDOWN)
  1320. break;
  1321. if (sk->sk_state == TCP_CLOSE) {
  1322. if (!sock_flag(sk, SOCK_DONE)) {
  1323. /* This occurs when user tries to read
  1324. * from never connected socket.
  1325. */
  1326. copied = -ENOTCONN;
  1327. break;
  1328. }
  1329. break;
  1330. }
  1331. if (!timeo) {
  1332. copied = -EAGAIN;
  1333. break;
  1334. }
  1335. if (signal_pending(current)) {
  1336. copied = sock_intr_errno(timeo);
  1337. break;
  1338. }
  1339. }
  1340. tcp_cleanup_rbuf(sk, copied);
  1341. if (!sysctl_tcp_low_latency && tp->ucopy.task == user_recv) {
  1342. /* Install new reader */
  1343. if (!user_recv && !(flags & (MSG_TRUNC | MSG_PEEK))) {
  1344. user_recv = current;
  1345. tp->ucopy.task = user_recv;
  1346. tp->ucopy.iov = msg->msg_iov;
  1347. }
  1348. tp->ucopy.len = len;
  1349. WARN_ON(tp->copied_seq != tp->rcv_nxt &&
  1350. !(flags & (MSG_PEEK | MSG_TRUNC)));
  1351. /* Ugly... If prequeue is not empty, we have to
  1352. * process it before releasing socket, otherwise
  1353. * order will be broken at second iteration.
  1354. * More elegant solution is required!!!
  1355. *
  1356. * Look: we have the following (pseudo)queues:
  1357. *
  1358. * 1. packets in flight
  1359. * 2. backlog
  1360. * 3. prequeue
  1361. * 4. receive_queue
  1362. *
  1363. * Each queue can be processed only if the next ones
  1364. * are empty. At this point we have empty receive_queue.
  1365. * But prequeue _can_ be not empty after 2nd iteration,
  1366. * when we jumped to start of loop because backlog
  1367. * processing added something to receive_queue.
  1368. * We cannot release_sock(), because backlog contains
  1369. * packets arrived _after_ prequeued ones.
  1370. *
  1371. * Shortly, algorithm is clear --- to process all
  1372. * the queues in order. We could make it more directly,
  1373. * requeueing packets from backlog to prequeue, if
  1374. * is not empty. It is more elegant, but eats cycles,
  1375. * unfortunately.
  1376. */
  1377. if (!skb_queue_empty(&tp->ucopy.prequeue))
  1378. goto do_prequeue;
  1379. /* __ Set realtime policy in scheduler __ */
  1380. }
  1381. #ifdef CONFIG_NET_DMA
  1382. if (tp->ucopy.dma_chan)
  1383. dma_async_memcpy_issue_pending(tp->ucopy.dma_chan);
  1384. #endif
  1385. if (copied >= target) {
  1386. /* Do not sleep, just process backlog. */
  1387. release_sock(sk);
  1388. lock_sock(sk);
  1389. } else
  1390. sk_wait_data(sk, &timeo);
  1391. #ifdef CONFIG_NET_DMA
  1392. tcp_service_net_dma(sk, false); /* Don't block */
  1393. tp->ucopy.wakeup = 0;
  1394. #endif
  1395. if (user_recv) {
  1396. int chunk;
  1397. /* __ Restore normal policy in scheduler __ */
  1398. if ((chunk = len - tp->ucopy.len) != 0) {
  1399. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMBACKLOG, chunk);
  1400. len -= chunk;
  1401. copied += chunk;
  1402. }
  1403. if (tp->rcv_nxt == tp->copied_seq &&
  1404. !skb_queue_empty(&tp->ucopy.prequeue)) {
  1405. do_prequeue:
  1406. tcp_prequeue_process(sk);
  1407. if ((chunk = len - tp->ucopy.len) != 0) {
  1408. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1409. len -= chunk;
  1410. copied += chunk;
  1411. }
  1412. }
  1413. }
  1414. if ((flags & MSG_PEEK) &&
  1415. (peek_seq - copied - urg_hole != tp->copied_seq)) {
  1416. if (net_ratelimit())
  1417. printk(KERN_DEBUG "TCP(%s:%d): Application bug, race in MSG_PEEK.\n",
  1418. current->comm, task_pid_nr(current));
  1419. peek_seq = tp->copied_seq;
  1420. }
  1421. continue;
  1422. found_ok_skb:
  1423. /* Ok so how much can we use? */
  1424. used = skb->len - offset;
  1425. if (len < used)
  1426. used = len;
  1427. /* Do we have urgent data here? */
  1428. if (tp->urg_data) {
  1429. u32 urg_offset = tp->urg_seq - *seq;
  1430. if (urg_offset < used) {
  1431. if (!urg_offset) {
  1432. if (!sock_flag(sk, SOCK_URGINLINE)) {
  1433. ++*seq;
  1434. urg_hole++;
  1435. offset++;
  1436. used--;
  1437. if (!used)
  1438. goto skip_copy;
  1439. }
  1440. } else
  1441. used = urg_offset;
  1442. }
  1443. }
  1444. if (!(flags & MSG_TRUNC)) {
  1445. #ifdef CONFIG_NET_DMA
  1446. if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
  1447. tp->ucopy.dma_chan = dma_find_channel(DMA_MEMCPY);
  1448. if (tp->ucopy.dma_chan) {
  1449. tp->ucopy.dma_cookie = dma_skb_copy_datagram_iovec(
  1450. tp->ucopy.dma_chan, skb, offset,
  1451. msg->msg_iov, used,
  1452. tp->ucopy.pinned_list);
  1453. if (tp->ucopy.dma_cookie < 0) {
  1454. printk(KERN_ALERT "dma_cookie < 0\n");
  1455. /* Exception. Bailout! */
  1456. if (!copied)
  1457. copied = -EFAULT;
  1458. break;
  1459. }
  1460. dma_async_memcpy_issue_pending(tp->ucopy.dma_chan);
  1461. if ((offset + used) == skb->len)
  1462. copied_early = 1;
  1463. } else
  1464. #endif
  1465. {
  1466. err = skb_copy_datagram_iovec(skb, offset,
  1467. msg->msg_iov, used);
  1468. if (err) {
  1469. /* Exception. Bailout! */
  1470. if (!copied)
  1471. copied = -EFAULT;
  1472. break;
  1473. }
  1474. }
  1475. }
  1476. *seq += used;
  1477. copied += used;
  1478. len -= used;
  1479. tcp_rcv_space_adjust(sk);
  1480. skip_copy:
  1481. if (tp->urg_data && after(tp->copied_seq, tp->urg_seq)) {
  1482. tp->urg_data = 0;
  1483. tcp_fast_path_check(sk);
  1484. }
  1485. if (used + offset < skb->len)
  1486. continue;
  1487. if (tcp_hdr(skb)->fin)
  1488. goto found_fin_ok;
  1489. if (!(flags & MSG_PEEK)) {
  1490. sk_eat_skb(sk, skb, copied_early);
  1491. copied_early = 0;
  1492. }
  1493. continue;
  1494. found_fin_ok:
  1495. /* Process the FIN. */
  1496. ++*seq;
  1497. if (!(flags & MSG_PEEK)) {
  1498. sk_eat_skb(sk, skb, copied_early);
  1499. copied_early = 0;
  1500. }
  1501. break;
  1502. } while (len > 0);
  1503. if (user_recv) {
  1504. if (!skb_queue_empty(&tp->ucopy.prequeue)) {
  1505. int chunk;
  1506. tp->ucopy.len = copied > 0 ? len : 0;
  1507. tcp_prequeue_process(sk);
  1508. if (copied > 0 && (chunk = len - tp->ucopy.len) != 0) {
  1509. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1510. len -= chunk;
  1511. copied += chunk;
  1512. }
  1513. }
  1514. tp->ucopy.task = NULL;
  1515. tp->ucopy.len = 0;
  1516. }
  1517. #ifdef CONFIG_NET_DMA
  1518. tcp_service_net_dma(sk, true); /* Wait for queue to drain */
  1519. tp->ucopy.dma_chan = NULL;
  1520. if (tp->ucopy.pinned_list) {
  1521. dma_unpin_iovec_pages(tp->ucopy.pinned_list);
  1522. tp->ucopy.pinned_list = NULL;
  1523. }
  1524. #endif
  1525. /* According to UNIX98, msg_name/msg_namelen are ignored
  1526. * on connected socket. I was just happy when found this 8) --ANK
  1527. */
  1528. /* Clean up data we have read: This will do ACK frames. */
  1529. tcp_cleanup_rbuf(sk, copied);
  1530. TCP_CHECK_TIMER(sk);
  1531. release_sock(sk);
  1532. return copied;
  1533. out:
  1534. TCP_CHECK_TIMER(sk);
  1535. release_sock(sk);
  1536. return err;
  1537. recv_urg:
  1538. err = tcp_recv_urg(sk, msg, len, flags);
  1539. goto out;
  1540. }
  1541. void tcp_set_state(struct sock *sk, int state)
  1542. {
  1543. int oldstate = sk->sk_state;
  1544. switch (state) {
  1545. case TCP_ESTABLISHED:
  1546. if (oldstate != TCP_ESTABLISHED)
  1547. TCP_INC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1548. break;
  1549. case TCP_CLOSE:
  1550. if (oldstate == TCP_CLOSE_WAIT || oldstate == TCP_ESTABLISHED)
  1551. TCP_INC_STATS(sock_net(sk), TCP_MIB_ESTABRESETS);
  1552. sk->sk_prot->unhash(sk);
  1553. if (inet_csk(sk)->icsk_bind_hash &&
  1554. !(sk->sk_userlocks & SOCK_BINDPORT_LOCK))
  1555. inet_put_port(sk);
  1556. /* fall through */
  1557. default:
  1558. if (oldstate == TCP_ESTABLISHED)
  1559. TCP_DEC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1560. }
  1561. /* Change state AFTER socket is unhashed to avoid closed
  1562. * socket sitting in hash tables.
  1563. */
  1564. sk->sk_state = state;
  1565. #ifdef STATE_TRACE
  1566. SOCK_DEBUG(sk, "TCP sk=%p, State %s -> %s\n", sk, statename[oldstate], statename[state]);
  1567. #endif
  1568. }
  1569. EXPORT_SYMBOL_GPL(tcp_set_state);
  1570. /*
  1571. * State processing on a close. This implements the state shift for
  1572. * sending our FIN frame. Note that we only send a FIN for some
  1573. * states. A shutdown() may have already sent the FIN, or we may be
  1574. * closed.
  1575. */
  1576. static const unsigned char new_state[16] = {
  1577. /* current state: new state: action: */
  1578. /* (Invalid) */ TCP_CLOSE,
  1579. /* TCP_ESTABLISHED */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1580. /* TCP_SYN_SENT */ TCP_CLOSE,
  1581. /* TCP_SYN_RECV */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1582. /* TCP_FIN_WAIT1 */ TCP_FIN_WAIT1,
  1583. /* TCP_FIN_WAIT2 */ TCP_FIN_WAIT2,
  1584. /* TCP_TIME_WAIT */ TCP_CLOSE,
  1585. /* TCP_CLOSE */ TCP_CLOSE,
  1586. /* TCP_CLOSE_WAIT */ TCP_LAST_ACK | TCP_ACTION_FIN,
  1587. /* TCP_LAST_ACK */ TCP_LAST_ACK,
  1588. /* TCP_LISTEN */ TCP_CLOSE,
  1589. /* TCP_CLOSING */ TCP_CLOSING,
  1590. };
  1591. static int tcp_close_state(struct sock *sk)
  1592. {
  1593. int next = (int)new_state[sk->sk_state];
  1594. int ns = next & TCP_STATE_MASK;
  1595. tcp_set_state(sk, ns);
  1596. return next & TCP_ACTION_FIN;
  1597. }
  1598. /*
  1599. * Shutdown the sending side of a connection. Much like close except
  1600. * that we don't receive shut down or sock_set_flag(sk, SOCK_DEAD).
  1601. */
  1602. void tcp_shutdown(struct sock *sk, int how)
  1603. {
  1604. /* We need to grab some memory, and put together a FIN,
  1605. * and then put it into the queue to be sent.
  1606. * Tim MacKenzie(tym@dibbler.cs.monash.edu.au) 4 Dec '92.
  1607. */
  1608. if (!(how & SEND_SHUTDOWN))
  1609. return;
  1610. /* If we've already sent a FIN, or it's a closed state, skip this. */
  1611. if ((1 << sk->sk_state) &
  1612. (TCPF_ESTABLISHED | TCPF_SYN_SENT |
  1613. TCPF_SYN_RECV | TCPF_CLOSE_WAIT)) {
  1614. /* Clear out any half completed packets. FIN if needed. */
  1615. if (tcp_close_state(sk))
  1616. tcp_send_fin(sk);
  1617. }
  1618. }
  1619. void tcp_close(struct sock *sk, long timeout)
  1620. {
  1621. struct sk_buff *skb;
  1622. int data_was_unread = 0;
  1623. int state;
  1624. lock_sock(sk);
  1625. sk->sk_shutdown = SHUTDOWN_MASK;
  1626. if (sk->sk_state == TCP_LISTEN) {
  1627. tcp_set_state(sk, TCP_CLOSE);
  1628. /* Special case. */
  1629. inet_csk_listen_stop(sk);
  1630. goto adjudge_to_death;
  1631. }
  1632. /* We need to flush the recv. buffs. We do this only on the
  1633. * descriptor close, not protocol-sourced closes, because the
  1634. * reader process may not have drained the data yet!
  1635. */
  1636. while ((skb = __skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  1637. u32 len = TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq -
  1638. tcp_hdr(skb)->fin;
  1639. data_was_unread += len;
  1640. __kfree_skb(skb);
  1641. }
  1642. sk_mem_reclaim(sk);
  1643. /* As outlined in RFC 2525, section 2.17, we send a RST here because
  1644. * data was lost. To witness the awful effects of the old behavior of
  1645. * always doing a FIN, run an older 2.1.x kernel or 2.0.x, start a bulk
  1646. * GET in an FTP client, suspend the process, wait for the client to
  1647. * advertise a zero window, then kill -9 the FTP client, wheee...
  1648. * Note: timeout is always zero in such a case.
  1649. */
  1650. if (data_was_unread) {
  1651. /* Unread data was tossed, zap the connection. */
  1652. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONCLOSE);
  1653. tcp_set_state(sk, TCP_CLOSE);
  1654. tcp_send_active_reset(sk, sk->sk_allocation);
  1655. } else if (sock_flag(sk, SOCK_LINGER) && !sk->sk_lingertime) {
  1656. /* Check zero linger _after_ checking for unread data. */
  1657. sk->sk_prot->disconnect(sk, 0);
  1658. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
  1659. } else if (tcp_close_state(sk)) {
  1660. /* We FIN if the application ate all the data before
  1661. * zapping the connection.
  1662. */
  1663. /* RED-PEN. Formally speaking, we have broken TCP state
  1664. * machine. State transitions:
  1665. *
  1666. * TCP_ESTABLISHED -> TCP_FIN_WAIT1
  1667. * TCP_SYN_RECV -> TCP_FIN_WAIT1 (forget it, it's impossible)
  1668. * TCP_CLOSE_WAIT -> TCP_LAST_ACK
  1669. *
  1670. * are legal only when FIN has been sent (i.e. in window),
  1671. * rather than queued out of window. Purists blame.
  1672. *
  1673. * F.e. "RFC state" is ESTABLISHED,
  1674. * if Linux state is FIN-WAIT-1, but FIN is still not sent.
  1675. *
  1676. * The visible declinations are that sometimes
  1677. * we enter time-wait state, when it is not required really
  1678. * (harmless), do not send active resets, when they are
  1679. * required by specs (TCP_ESTABLISHED, TCP_CLOSE_WAIT, when
  1680. * they look as CLOSING or LAST_ACK for Linux)
  1681. * Probably, I missed some more holelets.
  1682. * --ANK
  1683. */
  1684. tcp_send_fin(sk);
  1685. }
  1686. sk_stream_wait_close(sk, timeout);
  1687. adjudge_to_death:
  1688. state = sk->sk_state;
  1689. sock_hold(sk);
  1690. sock_orphan(sk);
  1691. /* It is the last release_sock in its life. It will remove backlog. */
  1692. release_sock(sk);
  1693. /* Now socket is owned by kernel and we acquire BH lock
  1694. to finish close. No need to check for user refs.
  1695. */
  1696. local_bh_disable();
  1697. bh_lock_sock(sk);
  1698. WARN_ON(sock_owned_by_user(sk));
  1699. percpu_counter_inc(sk->sk_prot->orphan_count);
  1700. /* Have we already been destroyed by a softirq or backlog? */
  1701. if (state != TCP_CLOSE && sk->sk_state == TCP_CLOSE)
  1702. goto out;
  1703. /* This is a (useful) BSD violating of the RFC. There is a
  1704. * problem with TCP as specified in that the other end could
  1705. * keep a socket open forever with no application left this end.
  1706. * We use a 3 minute timeout (about the same as BSD) then kill
  1707. * our end. If they send after that then tough - BUT: long enough
  1708. * that we won't make the old 4*rto = almost no time - whoops
  1709. * reset mistake.
  1710. *
  1711. * Nope, it was not mistake. It is really desired behaviour
  1712. * f.e. on http servers, when such sockets are useless, but
  1713. * consume significant resources. Let's do it with special
  1714. * linger2 option. --ANK
  1715. */
  1716. if (sk->sk_state == TCP_FIN_WAIT2) {
  1717. struct tcp_sock *tp = tcp_sk(sk);
  1718. if (tp->linger2 < 0) {
  1719. tcp_set_state(sk, TCP_CLOSE);
  1720. tcp_send_active_reset(sk, GFP_ATOMIC);
  1721. NET_INC_STATS_BH(sock_net(sk),
  1722. LINUX_MIB_TCPABORTONLINGER);
  1723. } else {
  1724. const int tmo = tcp_fin_time(sk);
  1725. if (tmo > TCP_TIMEWAIT_LEN) {
  1726. inet_csk_reset_keepalive_timer(sk,
  1727. tmo - TCP_TIMEWAIT_LEN);
  1728. } else {
  1729. tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
  1730. goto out;
  1731. }
  1732. }
  1733. }
  1734. if (sk->sk_state != TCP_CLOSE) {
  1735. int orphan_count = percpu_counter_read_positive(
  1736. sk->sk_prot->orphan_count);
  1737. sk_mem_reclaim(sk);
  1738. if (tcp_too_many_orphans(sk, orphan_count)) {
  1739. if (net_ratelimit())
  1740. printk(KERN_INFO "TCP: too many of orphaned "
  1741. "sockets\n");
  1742. tcp_set_state(sk, TCP_CLOSE);
  1743. tcp_send_active_reset(sk, GFP_ATOMIC);
  1744. NET_INC_STATS_BH(sock_net(sk),
  1745. LINUX_MIB_TCPABORTONMEMORY);
  1746. }
  1747. }
  1748. if (sk->sk_state == TCP_CLOSE)
  1749. inet_csk_destroy_sock(sk);
  1750. /* Otherwise, socket is reprieved until protocol close. */
  1751. out:
  1752. bh_unlock_sock(sk);
  1753. local_bh_enable();
  1754. sock_put(sk);
  1755. }
  1756. /* These states need RST on ABORT according to RFC793 */
  1757. static inline int tcp_need_reset(int state)
  1758. {
  1759. return (1 << state) &
  1760. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT | TCPF_FIN_WAIT1 |
  1761. TCPF_FIN_WAIT2 | TCPF_SYN_RECV);
  1762. }
  1763. int tcp_disconnect(struct sock *sk, int flags)
  1764. {
  1765. struct inet_sock *inet = inet_sk(sk);
  1766. struct inet_connection_sock *icsk = inet_csk(sk);
  1767. struct tcp_sock *tp = tcp_sk(sk);
  1768. int err = 0;
  1769. int old_state = sk->sk_state;
  1770. if (old_state != TCP_CLOSE)
  1771. tcp_set_state(sk, TCP_CLOSE);
  1772. /* ABORT function of RFC793 */
  1773. if (old_state == TCP_LISTEN) {
  1774. inet_csk_listen_stop(sk);
  1775. } else if (tcp_need_reset(old_state) ||
  1776. (tp->snd_nxt != tp->write_seq &&
  1777. (1 << old_state) & (TCPF_CLOSING | TCPF_LAST_ACK))) {
  1778. /* The last check adjusts for discrepancy of Linux wrt. RFC
  1779. * states
  1780. */
  1781. tcp_send_active_reset(sk, gfp_any());
  1782. sk->sk_err = ECONNRESET;
  1783. } else if (old_state == TCP_SYN_SENT)
  1784. sk->sk_err = ECONNRESET;
  1785. tcp_clear_xmit_timers(sk);
  1786. __skb_queue_purge(&sk->sk_receive_queue);
  1787. tcp_write_queue_purge(sk);
  1788. __skb_queue_purge(&tp->out_of_order_queue);
  1789. #ifdef CONFIG_NET_DMA
  1790. __skb_queue_purge(&sk->sk_async_wait_queue);
  1791. #endif
  1792. inet->inet_dport = 0;
  1793. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1794. inet_reset_saddr(sk);
  1795. sk->sk_shutdown = 0;
  1796. sock_reset_flag(sk, SOCK_DONE);
  1797. tp->srtt = 0;
  1798. if ((tp->write_seq += tp->max_window + 2) == 0)
  1799. tp->write_seq = 1;
  1800. icsk->icsk_backoff = 0;
  1801. tp->snd_cwnd = 2;
  1802. icsk->icsk_probes_out = 0;
  1803. tp->packets_out = 0;
  1804. tp->snd_ssthresh = TCP_INFINITE_SSTHRESH;
  1805. tp->snd_cwnd_cnt = 0;
  1806. tp->bytes_acked = 0;
  1807. tp->window_clamp = 0;
  1808. tcp_set_ca_state(sk, TCP_CA_Open);
  1809. tcp_clear_retrans(tp);
  1810. inet_csk_delack_init(sk);
  1811. tcp_init_send_head(sk);
  1812. memset(&tp->rx_opt, 0, sizeof(tp->rx_opt));
  1813. __sk_dst_reset(sk);
  1814. WARN_ON(inet->inet_num && !icsk->icsk_bind_hash);
  1815. sk->sk_error_report(sk);
  1816. return err;
  1817. }
  1818. /*
  1819. * Socket option code for TCP.
  1820. */
  1821. static int do_tcp_setsockopt(struct sock *sk, int level,
  1822. int optname, char __user *optval, unsigned int optlen)
  1823. {
  1824. struct tcp_sock *tp = tcp_sk(sk);
  1825. struct inet_connection_sock *icsk = inet_csk(sk);
  1826. int val;
  1827. int err = 0;
  1828. /* These are data/string values, all the others are ints */
  1829. switch (optname) {
  1830. case TCP_CONGESTION: {
  1831. char name[TCP_CA_NAME_MAX];
  1832. if (optlen < 1)
  1833. return -EINVAL;
  1834. val = strncpy_from_user(name, optval,
  1835. min_t(long, TCP_CA_NAME_MAX-1, optlen));
  1836. if (val < 0)
  1837. return -EFAULT;
  1838. name[val] = 0;
  1839. lock_sock(sk);
  1840. err = tcp_set_congestion_control(sk, name);
  1841. release_sock(sk);
  1842. return err;
  1843. }
  1844. case TCP_COOKIE_TRANSACTIONS: {
  1845. struct tcp_cookie_transactions ctd;
  1846. struct tcp_cookie_values *cvp = NULL;
  1847. if (sizeof(ctd) > optlen)
  1848. return -EINVAL;
  1849. if (copy_from_user(&ctd, optval, sizeof(ctd)))
  1850. return -EFAULT;
  1851. if (ctd.tcpct_used > sizeof(ctd.tcpct_value) ||
  1852. ctd.tcpct_s_data_desired > TCP_MSS_DESIRED)
  1853. return -EINVAL;
  1854. if (ctd.tcpct_cookie_desired == 0) {
  1855. /* default to global value */
  1856. } else if ((0x1 & ctd.tcpct_cookie_desired) ||
  1857. ctd.tcpct_cookie_desired > TCP_COOKIE_MAX ||
  1858. ctd.tcpct_cookie_desired < TCP_COOKIE_MIN) {
  1859. return -EINVAL;
  1860. }
  1861. if (TCP_COOKIE_OUT_NEVER & ctd.tcpct_flags) {
  1862. /* Supercedes all other values */
  1863. lock_sock(sk);
  1864. if (tp->cookie_values != NULL) {
  1865. kref_put(&tp->cookie_values->kref,
  1866. tcp_cookie_values_release);
  1867. tp->cookie_values = NULL;
  1868. }
  1869. tp->rx_opt.cookie_in_always = 0; /* false */
  1870. tp->rx_opt.cookie_out_never = 1; /* true */
  1871. release_sock(sk);
  1872. return err;
  1873. }
  1874. /* Allocate ancillary memory before locking.
  1875. */
  1876. if (ctd.tcpct_used > 0 ||
  1877. (tp->cookie_values == NULL &&
  1878. (sysctl_tcp_cookie_size > 0 ||
  1879. ctd.tcpct_cookie_desired > 0 ||
  1880. ctd.tcpct_s_data_desired > 0))) {
  1881. cvp = kzalloc(sizeof(*cvp) + ctd.tcpct_used,
  1882. GFP_KERNEL);
  1883. if (cvp == NULL)
  1884. return -ENOMEM;
  1885. }
  1886. lock_sock(sk);
  1887. tp->rx_opt.cookie_in_always =
  1888. (TCP_COOKIE_IN_ALWAYS & ctd.tcpct_flags);
  1889. tp->rx_opt.cookie_out_never = 0; /* false */
  1890. if (tp->cookie_values != NULL) {
  1891. if (cvp != NULL) {
  1892. /* Changed values are recorded by a changed
  1893. * pointer, ensuring the cookie will differ,
  1894. * without separately hashing each value later.
  1895. */
  1896. kref_put(&tp->cookie_values->kref,
  1897. tcp_cookie_values_release);
  1898. kref_init(&cvp->kref);
  1899. tp->cookie_values = cvp;
  1900. } else {
  1901. cvp = tp->cookie_values;
  1902. }
  1903. }
  1904. if (cvp != NULL) {
  1905. cvp->cookie_desired = ctd.tcpct_cookie_desired;
  1906. if (ctd.tcpct_used > 0) {
  1907. memcpy(cvp->s_data_payload, ctd.tcpct_value,
  1908. ctd.tcpct_used);
  1909. cvp->s_data_desired = ctd.tcpct_used;
  1910. cvp->s_data_constant = 1; /* true */
  1911. } else {
  1912. /* No constant payload data. */
  1913. cvp->s_data_desired = ctd.tcpct_s_data_desired;
  1914. cvp->s_data_constant = 0; /* false */
  1915. }
  1916. }
  1917. release_sock(sk);
  1918. return err;
  1919. }
  1920. default:
  1921. /* fallthru */
  1922. break;
  1923. };
  1924. if (optlen < sizeof(int))
  1925. return -EINVAL;
  1926. if (get_user(val, (int __user *)optval))
  1927. return -EFAULT;
  1928. lock_sock(sk);
  1929. switch (optname) {
  1930. case TCP_MAXSEG:
  1931. /* Values greater than interface MTU won't take effect. However
  1932. * at the point when this call is done we typically don't yet
  1933. * know which interface is going to be used */
  1934. if (val < 8 || val > MAX_TCP_WINDOW) {
  1935. err = -EINVAL;
  1936. break;
  1937. }
  1938. tp->rx_opt.user_mss = val;
  1939. break;
  1940. case TCP_NODELAY:
  1941. if (val) {
  1942. /* TCP_NODELAY is weaker than TCP_CORK, so that
  1943. * this option on corked socket is remembered, but
  1944. * it is not activated until cork is cleared.
  1945. *
  1946. * However, when TCP_NODELAY is set we make
  1947. * an explicit push, which overrides even TCP_CORK
  1948. * for currently queued segments.
  1949. */
  1950. tp->nonagle |= TCP_NAGLE_OFF|TCP_NAGLE_PUSH;
  1951. tcp_push_pending_frames(sk);
  1952. } else {
  1953. tp->nonagle &= ~TCP_NAGLE_OFF;
  1954. }
  1955. break;
  1956. case TCP_THIN_LINEAR_TIMEOUTS:
  1957. if (val < 0 || val > 1)
  1958. err = -EINVAL;
  1959. else
  1960. tp->thin_lto = val;
  1961. break;
  1962. case TCP_THIN_DUPACK:
  1963. if (val < 0 || val > 1)
  1964. err = -EINVAL;
  1965. else
  1966. tp->thin_dupack = val;
  1967. break;
  1968. case TCP_CORK:
  1969. /* When set indicates to always queue non-full frames.
  1970. * Later the user clears this option and we transmit
  1971. * any pending partial frames in the queue. This is
  1972. * meant to be used alongside sendfile() to get properly
  1973. * filled frames when the user (for example) must write
  1974. * out headers with a write() call first and then use
  1975. * sendfile to send out the data parts.
  1976. *
  1977. * TCP_CORK can be set together with TCP_NODELAY and it is
  1978. * stronger than TCP_NODELAY.
  1979. */
  1980. if (val) {
  1981. tp->nonagle |= TCP_NAGLE_CORK;
  1982. } else {
  1983. tp->nonagle &= ~TCP_NAGLE_CORK;
  1984. if (tp->nonagle&TCP_NAGLE_OFF)
  1985. tp->nonagle |= TCP_NAGLE_PUSH;
  1986. tcp_push_pending_frames(sk);
  1987. }
  1988. break;
  1989. case TCP_KEEPIDLE:
  1990. if (val < 1 || val > MAX_TCP_KEEPIDLE)
  1991. err = -EINVAL;
  1992. else {
  1993. tp->keepalive_time = val * HZ;
  1994. if (sock_flag(sk, SOCK_KEEPOPEN) &&
  1995. !((1 << sk->sk_state) &
  1996. (TCPF_CLOSE | TCPF_LISTEN))) {
  1997. u32 elapsed = keepalive_time_elapsed(tp);
  1998. if (tp->keepalive_time > elapsed)
  1999. elapsed = tp->keepalive_time - elapsed;
  2000. else
  2001. elapsed = 0;
  2002. inet_csk_reset_keepalive_timer(sk, elapsed);
  2003. }
  2004. }
  2005. break;
  2006. case TCP_KEEPINTVL:
  2007. if (val < 1 || val > MAX_TCP_KEEPINTVL)
  2008. err = -EINVAL;
  2009. else
  2010. tp->keepalive_intvl = val * HZ;
  2011. break;
  2012. case TCP_KEEPCNT:
  2013. if (val < 1 || val > MAX_TCP_KEEPCNT)
  2014. err = -EINVAL;
  2015. else
  2016. tp->keepalive_probes = val;
  2017. break;
  2018. case TCP_SYNCNT:
  2019. if (val < 1 || val > MAX_TCP_SYNCNT)
  2020. err = -EINVAL;
  2021. else
  2022. icsk->icsk_syn_retries = val;
  2023. break;
  2024. case TCP_LINGER2:
  2025. if (val < 0)
  2026. tp->linger2 = -1;
  2027. else if (val > sysctl_tcp_fin_timeout / HZ)
  2028. tp->linger2 = 0;
  2029. else
  2030. tp->linger2 = val * HZ;
  2031. break;
  2032. case TCP_DEFER_ACCEPT:
  2033. /* Translate value in seconds to number of retransmits */
  2034. icsk->icsk_accept_queue.rskq_defer_accept =
  2035. secs_to_retrans(val, TCP_TIMEOUT_INIT / HZ,
  2036. TCP_RTO_MAX / HZ);
  2037. break;
  2038. case TCP_WINDOW_CLAMP:
  2039. if (!val) {
  2040. if (sk->sk_state != TCP_CLOSE) {
  2041. err = -EINVAL;
  2042. break;
  2043. }
  2044. tp->window_clamp = 0;
  2045. } else
  2046. tp->window_clamp = val < SOCK_MIN_RCVBUF / 2 ?
  2047. SOCK_MIN_RCVBUF / 2 : val;
  2048. break;
  2049. case TCP_QUICKACK:
  2050. if (!val) {
  2051. icsk->icsk_ack.pingpong = 1;
  2052. } else {
  2053. icsk->icsk_ack.pingpong = 0;
  2054. if ((1 << sk->sk_state) &
  2055. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT) &&
  2056. inet_csk_ack_scheduled(sk)) {
  2057. icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
  2058. tcp_cleanup_rbuf(sk, 1);
  2059. if (!(val & 1))
  2060. icsk->icsk_ack.pingpong = 1;
  2061. }
  2062. }
  2063. break;
  2064. #ifdef CONFIG_TCP_MD5SIG
  2065. case TCP_MD5SIG:
  2066. /* Read the IP->Key mappings from userspace */
  2067. err = tp->af_specific->md5_parse(sk, optval, optlen);
  2068. break;
  2069. #endif
  2070. default:
  2071. err = -ENOPROTOOPT;
  2072. break;
  2073. }
  2074. release_sock(sk);
  2075. return err;
  2076. }
  2077. int tcp_setsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2078. unsigned int optlen)
  2079. {
  2080. struct inet_connection_sock *icsk = inet_csk(sk);
  2081. if (level != SOL_TCP)
  2082. return icsk->icsk_af_ops->setsockopt(sk, level, optname,
  2083. optval, optlen);
  2084. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  2085. }
  2086. #ifdef CONFIG_COMPAT
  2087. int compat_tcp_setsockopt(struct sock *sk, int level, int optname,
  2088. char __user *optval, unsigned int optlen)
  2089. {
  2090. if (level != SOL_TCP)
  2091. return inet_csk_compat_setsockopt(sk, level, optname,
  2092. optval, optlen);
  2093. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  2094. }
  2095. EXPORT_SYMBOL(compat_tcp_setsockopt);
  2096. #endif
  2097. /* Return information about state of tcp endpoint in API format. */
  2098. void tcp_get_info(struct sock *sk, struct tcp_info *info)
  2099. {
  2100. struct tcp_sock *tp = tcp_sk(sk);
  2101. const struct inet_connection_sock *icsk = inet_csk(sk);
  2102. u32 now = tcp_time_stamp;
  2103. memset(info, 0, sizeof(*info));
  2104. info->tcpi_state = sk->sk_state;
  2105. info->tcpi_ca_state = icsk->icsk_ca_state;
  2106. info->tcpi_retransmits = icsk->icsk_retransmits;
  2107. info->tcpi_probes = icsk->icsk_probes_out;
  2108. info->tcpi_backoff = icsk->icsk_backoff;
  2109. if (tp->rx_opt.tstamp_ok)
  2110. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  2111. if (tcp_is_sack(tp))
  2112. info->tcpi_options |= TCPI_OPT_SACK;
  2113. if (tp->rx_opt.wscale_ok) {
  2114. info->tcpi_options |= TCPI_OPT_WSCALE;
  2115. info->tcpi_snd_wscale = tp->rx_opt.snd_wscale;
  2116. info->tcpi_rcv_wscale = tp->rx_opt.rcv_wscale;
  2117. }
  2118. if (tp->ecn_flags&TCP_ECN_OK)
  2119. info->tcpi_options |= TCPI_OPT_ECN;
  2120. info->tcpi_rto = jiffies_to_usecs(icsk->icsk_rto);
  2121. info->tcpi_ato = jiffies_to_usecs(icsk->icsk_ack.ato);
  2122. info->tcpi_snd_mss = tp->mss_cache;
  2123. info->tcpi_rcv_mss = icsk->icsk_ack.rcv_mss;
  2124. if (sk->sk_state == TCP_LISTEN) {
  2125. info->tcpi_unacked = sk->sk_ack_backlog;
  2126. info->tcpi_sacked = sk->sk_max_ack_backlog;
  2127. } else {
  2128. info->tcpi_unacked = tp->packets_out;
  2129. info->tcpi_sacked = tp->sacked_out;
  2130. }
  2131. info->tcpi_lost = tp->lost_out;
  2132. info->tcpi_retrans = tp->retrans_out;
  2133. info->tcpi_fackets = tp->fackets_out;
  2134. info->tcpi_last_data_sent = jiffies_to_msecs(now - tp->lsndtime);
  2135. info->tcpi_last_data_recv = jiffies_to_msecs(now - icsk->icsk_ack.lrcvtime);
  2136. info->tcpi_last_ack_recv = jiffies_to_msecs(now - tp->rcv_tstamp);
  2137. info->tcpi_pmtu = icsk->icsk_pmtu_cookie;
  2138. info->tcpi_rcv_ssthresh = tp->rcv_ssthresh;
  2139. info->tcpi_rtt = jiffies_to_usecs(tp->srtt)>>3;
  2140. info->tcpi_rttvar = jiffies_to_usecs(tp->mdev)>>2;
  2141. info->tcpi_snd_ssthresh = tp->snd_ssthresh;
  2142. info->tcpi_snd_cwnd = tp->snd_cwnd;
  2143. info->tcpi_advmss = tp->advmss;
  2144. info->tcpi_reordering = tp->reordering;
  2145. info->tcpi_rcv_rtt = jiffies_to_usecs(tp->rcv_rtt_est.rtt)>>3;
  2146. info->tcpi_rcv_space = tp->rcvq_space.space;
  2147. info->tcpi_total_retrans = tp->total_retrans;
  2148. }
  2149. EXPORT_SYMBOL_GPL(tcp_get_info);
  2150. static int do_tcp_getsockopt(struct sock *sk, int level,
  2151. int optname, char __user *optval, int __user *optlen)
  2152. {
  2153. struct inet_connection_sock *icsk = inet_csk(sk);
  2154. struct tcp_sock *tp = tcp_sk(sk);
  2155. int val, len;
  2156. if (get_user(len, optlen))
  2157. return -EFAULT;
  2158. len = min_t(unsigned int, len, sizeof(int));
  2159. if (len < 0)
  2160. return -EINVAL;
  2161. switch (optname) {
  2162. case TCP_MAXSEG:
  2163. val = tp->mss_cache;
  2164. if (!val && ((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_LISTEN)))
  2165. val = tp->rx_opt.user_mss;
  2166. break;
  2167. case TCP_NODELAY:
  2168. val = !!(tp->nonagle&TCP_NAGLE_OFF);
  2169. break;
  2170. case TCP_CORK:
  2171. val = !!(tp->nonagle&TCP_NAGLE_CORK);
  2172. break;
  2173. case TCP_KEEPIDLE:
  2174. val = keepalive_time_when(tp) / HZ;
  2175. break;
  2176. case TCP_KEEPINTVL:
  2177. val = keepalive_intvl_when(tp) / HZ;
  2178. break;
  2179. case TCP_KEEPCNT:
  2180. val = keepalive_probes(tp);
  2181. break;
  2182. case TCP_SYNCNT:
  2183. val = icsk->icsk_syn_retries ? : sysctl_tcp_syn_retries;
  2184. break;
  2185. case TCP_LINGER2:
  2186. val = tp->linger2;
  2187. if (val >= 0)
  2188. val = (val ? : sysctl_tcp_fin_timeout) / HZ;
  2189. break;
  2190. case TCP_DEFER_ACCEPT:
  2191. val = retrans_to_secs(icsk->icsk_accept_queue.rskq_defer_accept,
  2192. TCP_TIMEOUT_INIT / HZ, TCP_RTO_MAX / HZ);
  2193. break;
  2194. case TCP_WINDOW_CLAMP:
  2195. val = tp->window_clamp;
  2196. break;
  2197. case TCP_INFO: {
  2198. struct tcp_info info;
  2199. if (get_user(len, optlen))
  2200. return -EFAULT;
  2201. tcp_get_info(sk, &info);
  2202. len = min_t(unsigned int, len, sizeof(info));
  2203. if (put_user(len, optlen))
  2204. return -EFAULT;
  2205. if (copy_to_user(optval, &info, len))
  2206. return -EFAULT;
  2207. return 0;
  2208. }
  2209. case TCP_QUICKACK:
  2210. val = !icsk->icsk_ack.pingpong;
  2211. break;
  2212. case TCP_CONGESTION:
  2213. if (get_user(len, optlen))
  2214. return -EFAULT;
  2215. len = min_t(unsigned int, len, TCP_CA_NAME_MAX);
  2216. if (put_user(len, optlen))
  2217. return -EFAULT;
  2218. if (copy_to_user(optval, icsk->icsk_ca_ops->name, len))
  2219. return -EFAULT;
  2220. return 0;
  2221. case TCP_COOKIE_TRANSACTIONS: {
  2222. struct tcp_cookie_transactions ctd;
  2223. struct tcp_cookie_values *cvp = tp->cookie_values;
  2224. if (get_user(len, optlen))
  2225. return -EFAULT;
  2226. if (len < sizeof(ctd))
  2227. return -EINVAL;
  2228. memset(&ctd, 0, sizeof(ctd));
  2229. ctd.tcpct_flags = (tp->rx_opt.cookie_in_always ?
  2230. TCP_COOKIE_IN_ALWAYS : 0)
  2231. | (tp->rx_opt.cookie_out_never ?
  2232. TCP_COOKIE_OUT_NEVER : 0);
  2233. if (cvp != NULL) {
  2234. ctd.tcpct_flags |= (cvp->s_data_in ?
  2235. TCP_S_DATA_IN : 0)
  2236. | (cvp->s_data_out ?
  2237. TCP_S_DATA_OUT : 0);
  2238. ctd.tcpct_cookie_desired = cvp->cookie_desired;
  2239. ctd.tcpct_s_data_desired = cvp->s_data_desired;
  2240. memcpy(&ctd.tcpct_value[0], &cvp->cookie_pair[0],
  2241. cvp->cookie_pair_size);
  2242. ctd.tcpct_used = cvp->cookie_pair_size;
  2243. }
  2244. if (put_user(sizeof(ctd), optlen))
  2245. return -EFAULT;
  2246. if (copy_to_user(optval, &ctd, sizeof(ctd)))
  2247. return -EFAULT;
  2248. return 0;
  2249. }
  2250. default:
  2251. return -ENOPROTOOPT;
  2252. }
  2253. if (put_user(len, optlen))
  2254. return -EFAULT;
  2255. if (copy_to_user(optval, &val, len))
  2256. return -EFAULT;
  2257. return 0;
  2258. }
  2259. int tcp_getsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2260. int __user *optlen)
  2261. {
  2262. struct inet_connection_sock *icsk = inet_csk(sk);
  2263. if (level != SOL_TCP)
  2264. return icsk->icsk_af_ops->getsockopt(sk, level, optname,
  2265. optval, optlen);
  2266. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2267. }
  2268. #ifdef CONFIG_COMPAT
  2269. int compat_tcp_getsockopt(struct sock *sk, int level, int optname,
  2270. char __user *optval, int __user *optlen)
  2271. {
  2272. if (level != SOL_TCP)
  2273. return inet_csk_compat_getsockopt(sk, level, optname,
  2274. optval, optlen);
  2275. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2276. }
  2277. EXPORT_SYMBOL(compat_tcp_getsockopt);
  2278. #endif
  2279. struct sk_buff *tcp_tso_segment(struct sk_buff *skb, int features)
  2280. {
  2281. struct sk_buff *segs = ERR_PTR(-EINVAL);
  2282. struct tcphdr *th;
  2283. unsigned thlen;
  2284. unsigned int seq;
  2285. __be32 delta;
  2286. unsigned int oldlen;
  2287. unsigned int mss;
  2288. if (!pskb_may_pull(skb, sizeof(*th)))
  2289. goto out;
  2290. th = tcp_hdr(skb);
  2291. thlen = th->doff * 4;
  2292. if (thlen < sizeof(*th))
  2293. goto out;
  2294. if (!pskb_may_pull(skb, thlen))
  2295. goto out;
  2296. oldlen = (u16)~skb->len;
  2297. __skb_pull(skb, thlen);
  2298. mss = skb_shinfo(skb)->gso_size;
  2299. if (unlikely(skb->len <= mss))
  2300. goto out;
  2301. if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
  2302. /* Packet is from an untrusted source, reset gso_segs. */
  2303. int type = skb_shinfo(skb)->gso_type;
  2304. if (unlikely(type &
  2305. ~(SKB_GSO_TCPV4 |
  2306. SKB_GSO_DODGY |
  2307. SKB_GSO_TCP_ECN |
  2308. SKB_GSO_TCPV6 |
  2309. 0) ||
  2310. !(type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6))))
  2311. goto out;
  2312. skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
  2313. segs = NULL;
  2314. goto out;
  2315. }
  2316. segs = skb_segment(skb, features);
  2317. if (IS_ERR(segs))
  2318. goto out;
  2319. delta = htonl(oldlen + (thlen + mss));
  2320. skb = segs;
  2321. th = tcp_hdr(skb);
  2322. seq = ntohl(th->seq);
  2323. do {
  2324. th->fin = th->psh = 0;
  2325. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2326. (__force u32)delta));
  2327. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2328. th->check =
  2329. csum_fold(csum_partial(skb_transport_header(skb),
  2330. thlen, skb->csum));
  2331. seq += mss;
  2332. skb = skb->next;
  2333. th = tcp_hdr(skb);
  2334. th->seq = htonl(seq);
  2335. th->cwr = 0;
  2336. } while (skb->next);
  2337. delta = htonl(oldlen + (skb->tail - skb->transport_header) +
  2338. skb->data_len);
  2339. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2340. (__force u32)delta));
  2341. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2342. th->check = csum_fold(csum_partial(skb_transport_header(skb),
  2343. thlen, skb->csum));
  2344. out:
  2345. return segs;
  2346. }
  2347. EXPORT_SYMBOL(tcp_tso_segment);
  2348. struct sk_buff **tcp_gro_receive(struct sk_buff **head, struct sk_buff *skb)
  2349. {
  2350. struct sk_buff **pp = NULL;
  2351. struct sk_buff *p;
  2352. struct tcphdr *th;
  2353. struct tcphdr *th2;
  2354. unsigned int len;
  2355. unsigned int thlen;
  2356. __be32 flags;
  2357. unsigned int mss = 1;
  2358. unsigned int hlen;
  2359. unsigned int off;
  2360. int flush = 1;
  2361. int i;
  2362. off = skb_gro_offset(skb);
  2363. hlen = off + sizeof(*th);
  2364. th = skb_gro_header_fast(skb, off);
  2365. if (skb_gro_header_hard(skb, hlen)) {
  2366. th = skb_gro_header_slow(skb, hlen, off);
  2367. if (unlikely(!th))
  2368. goto out;
  2369. }
  2370. thlen = th->doff * 4;
  2371. if (thlen < sizeof(*th))
  2372. goto out;
  2373. hlen = off + thlen;
  2374. if (skb_gro_header_hard(skb, hlen)) {
  2375. th = skb_gro_header_slow(skb, hlen, off);
  2376. if (unlikely(!th))
  2377. goto out;
  2378. }
  2379. skb_gro_pull(skb, thlen);
  2380. len = skb_gro_len(skb);
  2381. flags = tcp_flag_word(th);
  2382. for (; (p = *head); head = &p->next) {
  2383. if (!NAPI_GRO_CB(p)->same_flow)
  2384. continue;
  2385. th2 = tcp_hdr(p);
  2386. if (*(u32 *)&th->source ^ *(u32 *)&th2->source) {
  2387. NAPI_GRO_CB(p)->same_flow = 0;
  2388. continue;
  2389. }
  2390. goto found;
  2391. }
  2392. goto out_check_final;
  2393. found:
  2394. flush = NAPI_GRO_CB(p)->flush;
  2395. flush |= (__force int)(flags & TCP_FLAG_CWR);
  2396. flush |= (__force int)((flags ^ tcp_flag_word(th2)) &
  2397. ~(TCP_FLAG_CWR | TCP_FLAG_FIN | TCP_FLAG_PSH));
  2398. flush |= (__force int)(th->ack_seq ^ th2->ack_seq);
  2399. for (i = sizeof(*th); i < thlen; i += 4)
  2400. flush |= *(u32 *)((u8 *)th + i) ^
  2401. *(u32 *)((u8 *)th2 + i);
  2402. mss = skb_shinfo(p)->gso_size;
  2403. flush |= (len - 1) >= mss;
  2404. flush |= (ntohl(th2->seq) + skb_gro_len(p)) ^ ntohl(th->seq);
  2405. if (flush || skb_gro_receive(head, skb)) {
  2406. mss = 1;
  2407. goto out_check_final;
  2408. }
  2409. p = *head;
  2410. th2 = tcp_hdr(p);
  2411. tcp_flag_word(th2) |= flags & (TCP_FLAG_FIN | TCP_FLAG_PSH);
  2412. out_check_final:
  2413. flush = len < mss;
  2414. flush |= (__force int)(flags & (TCP_FLAG_URG | TCP_FLAG_PSH |
  2415. TCP_FLAG_RST | TCP_FLAG_SYN |
  2416. TCP_FLAG_FIN));
  2417. if (p && (!NAPI_GRO_CB(skb)->same_flow || flush))
  2418. pp = head;
  2419. out:
  2420. NAPI_GRO_CB(skb)->flush |= flush;
  2421. return pp;
  2422. }
  2423. EXPORT_SYMBOL(tcp_gro_receive);
  2424. int tcp_gro_complete(struct sk_buff *skb)
  2425. {
  2426. struct tcphdr *th = tcp_hdr(skb);
  2427. skb->csum_start = skb_transport_header(skb) - skb->head;
  2428. skb->csum_offset = offsetof(struct tcphdr, check);
  2429. skb->ip_summed = CHECKSUM_PARTIAL;
  2430. skb_shinfo(skb)->gso_segs = NAPI_GRO_CB(skb)->count;
  2431. if (th->cwr)
  2432. skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
  2433. return 0;
  2434. }
  2435. EXPORT_SYMBOL(tcp_gro_complete);
  2436. #ifdef CONFIG_TCP_MD5SIG
  2437. static unsigned long tcp_md5sig_users;
  2438. static struct tcp_md5sig_pool * __percpu *tcp_md5sig_pool;
  2439. static DEFINE_SPINLOCK(tcp_md5sig_pool_lock);
  2440. static void __tcp_free_md5sig_pool(struct tcp_md5sig_pool * __percpu *pool)
  2441. {
  2442. int cpu;
  2443. for_each_possible_cpu(cpu) {
  2444. struct tcp_md5sig_pool *p = *per_cpu_ptr(pool, cpu);
  2445. if (p) {
  2446. if (p->md5_desc.tfm)
  2447. crypto_free_hash(p->md5_desc.tfm);
  2448. kfree(p);
  2449. p = NULL;
  2450. }
  2451. }
  2452. free_percpu(pool);
  2453. }
  2454. void tcp_free_md5sig_pool(void)
  2455. {
  2456. struct tcp_md5sig_pool * __percpu *pool = NULL;
  2457. spin_lock_bh(&tcp_md5sig_pool_lock);
  2458. if (--tcp_md5sig_users == 0) {
  2459. pool = tcp_md5sig_pool;
  2460. tcp_md5sig_pool = NULL;
  2461. }
  2462. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2463. if (pool)
  2464. __tcp_free_md5sig_pool(pool);
  2465. }
  2466. EXPORT_SYMBOL(tcp_free_md5sig_pool);
  2467. static struct tcp_md5sig_pool * __percpu *
  2468. __tcp_alloc_md5sig_pool(struct sock *sk)
  2469. {
  2470. int cpu;
  2471. struct tcp_md5sig_pool * __percpu *pool;
  2472. pool = alloc_percpu(struct tcp_md5sig_pool *);
  2473. if (!pool)
  2474. return NULL;
  2475. for_each_possible_cpu(cpu) {
  2476. struct tcp_md5sig_pool *p;
  2477. struct crypto_hash *hash;
  2478. p = kzalloc(sizeof(*p), sk->sk_allocation);
  2479. if (!p)
  2480. goto out_free;
  2481. *per_cpu_ptr(pool, cpu) = p;
  2482. hash = crypto_alloc_hash("md5", 0, CRYPTO_ALG_ASYNC);
  2483. if (!hash || IS_ERR(hash))
  2484. goto out_free;
  2485. p->md5_desc.tfm = hash;
  2486. }
  2487. return pool;
  2488. out_free:
  2489. __tcp_free_md5sig_pool(pool);
  2490. return NULL;
  2491. }
  2492. struct tcp_md5sig_pool * __percpu *tcp_alloc_md5sig_pool(struct sock *sk)
  2493. {
  2494. struct tcp_md5sig_pool * __percpu *pool;
  2495. int alloc = 0;
  2496. retry:
  2497. spin_lock_bh(&tcp_md5sig_pool_lock);
  2498. pool = tcp_md5sig_pool;
  2499. if (tcp_md5sig_users++ == 0) {
  2500. alloc = 1;
  2501. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2502. } else if (!pool) {
  2503. tcp_md5sig_users--;
  2504. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2505. cpu_relax();
  2506. goto retry;
  2507. } else
  2508. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2509. if (alloc) {
  2510. /* we cannot hold spinlock here because this may sleep. */
  2511. struct tcp_md5sig_pool * __percpu *p;
  2512. p = __tcp_alloc_md5sig_pool(sk);
  2513. spin_lock_bh(&tcp_md5sig_pool_lock);
  2514. if (!p) {
  2515. tcp_md5sig_users--;
  2516. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2517. return NULL;
  2518. }
  2519. pool = tcp_md5sig_pool;
  2520. if (pool) {
  2521. /* oops, it has already been assigned. */
  2522. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2523. __tcp_free_md5sig_pool(p);
  2524. } else {
  2525. tcp_md5sig_pool = pool = p;
  2526. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2527. }
  2528. }
  2529. return pool;
  2530. }
  2531. EXPORT_SYMBOL(tcp_alloc_md5sig_pool);
  2532. struct tcp_md5sig_pool *__tcp_get_md5sig_pool(int cpu)
  2533. {
  2534. struct tcp_md5sig_pool * __percpu *p;
  2535. spin_lock_bh(&tcp_md5sig_pool_lock);
  2536. p = tcp_md5sig_pool;
  2537. if (p)
  2538. tcp_md5sig_users++;
  2539. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2540. return (p ? *per_cpu_ptr(p, cpu) : NULL);
  2541. }
  2542. EXPORT_SYMBOL(__tcp_get_md5sig_pool);
  2543. void __tcp_put_md5sig_pool(void)
  2544. {
  2545. tcp_free_md5sig_pool();
  2546. }
  2547. EXPORT_SYMBOL(__tcp_put_md5sig_pool);
  2548. int tcp_md5_hash_header(struct tcp_md5sig_pool *hp,
  2549. struct tcphdr *th)
  2550. {
  2551. struct scatterlist sg;
  2552. int err;
  2553. __sum16 old_checksum = th->check;
  2554. th->check = 0;
  2555. /* options aren't included in the hash */
  2556. sg_init_one(&sg, th, sizeof(struct tcphdr));
  2557. err = crypto_hash_update(&hp->md5_desc, &sg, sizeof(struct tcphdr));
  2558. th->check = old_checksum;
  2559. return err;
  2560. }
  2561. EXPORT_SYMBOL(tcp_md5_hash_header);
  2562. int tcp_md5_hash_skb_data(struct tcp_md5sig_pool *hp,
  2563. struct sk_buff *skb, unsigned header_len)
  2564. {
  2565. struct scatterlist sg;
  2566. const struct tcphdr *tp = tcp_hdr(skb);
  2567. struct hash_desc *desc = &hp->md5_desc;
  2568. unsigned i;
  2569. const unsigned head_data_len = skb_headlen(skb) > header_len ?
  2570. skb_headlen(skb) - header_len : 0;
  2571. const struct skb_shared_info *shi = skb_shinfo(skb);
  2572. sg_init_table(&sg, 1);
  2573. sg_set_buf(&sg, ((u8 *) tp) + header_len, head_data_len);
  2574. if (crypto_hash_update(desc, &sg, head_data_len))
  2575. return 1;
  2576. for (i = 0; i < shi->nr_frags; ++i) {
  2577. const struct skb_frag_struct *f = &shi->frags[i];
  2578. sg_set_page(&sg, f->page, f->size, f->page_offset);
  2579. if (crypto_hash_update(desc, &sg, f->size))
  2580. return 1;
  2581. }
  2582. return 0;
  2583. }
  2584. EXPORT_SYMBOL(tcp_md5_hash_skb_data);
  2585. int tcp_md5_hash_key(struct tcp_md5sig_pool *hp, struct tcp_md5sig_key *key)
  2586. {
  2587. struct scatterlist sg;
  2588. sg_init_one(&sg, key->key, key->keylen);
  2589. return crypto_hash_update(&hp->md5_desc, &sg, key->keylen);
  2590. }
  2591. EXPORT_SYMBOL(tcp_md5_hash_key);
  2592. #endif
  2593. /**
  2594. * Each Responder maintains up to two secret values concurrently for
  2595. * efficient secret rollover. Each secret value has 4 states:
  2596. *
  2597. * Generating. (tcp_secret_generating != tcp_secret_primary)
  2598. * Generates new Responder-Cookies, but not yet used for primary
  2599. * verification. This is a short-term state, typically lasting only
  2600. * one round trip time (RTT).
  2601. *
  2602. * Primary. (tcp_secret_generating == tcp_secret_primary)
  2603. * Used both for generation and primary verification.
  2604. *
  2605. * Retiring. (tcp_secret_retiring != tcp_secret_secondary)
  2606. * Used for verification, until the first failure that can be
  2607. * verified by the newer Generating secret. At that time, this
  2608. * cookie's state is changed to Secondary, and the Generating
  2609. * cookie's state is changed to Primary. This is a short-term state,
  2610. * typically lasting only one round trip time (RTT).
  2611. *
  2612. * Secondary. (tcp_secret_retiring == tcp_secret_secondary)
  2613. * Used for secondary verification, after primary verification
  2614. * failures. This state lasts no more than twice the Maximum Segment
  2615. * Lifetime (2MSL). Then, the secret is discarded.
  2616. */
  2617. struct tcp_cookie_secret {
  2618. /* The secret is divided into two parts. The digest part is the
  2619. * equivalent of previously hashing a secret and saving the state,
  2620. * and serves as an initialization vector (IV). The message part
  2621. * serves as the trailing secret.
  2622. */
  2623. u32 secrets[COOKIE_WORKSPACE_WORDS];
  2624. unsigned long expires;
  2625. };
  2626. #define TCP_SECRET_1MSL (HZ * TCP_PAWS_MSL)
  2627. #define TCP_SECRET_2MSL (HZ * TCP_PAWS_MSL * 2)
  2628. #define TCP_SECRET_LIFE (HZ * 600)
  2629. static struct tcp_cookie_secret tcp_secret_one;
  2630. static struct tcp_cookie_secret tcp_secret_two;
  2631. /* Essentially a circular list, without dynamic allocation. */
  2632. static struct tcp_cookie_secret *tcp_secret_generating;
  2633. static struct tcp_cookie_secret *tcp_secret_primary;
  2634. static struct tcp_cookie_secret *tcp_secret_retiring;
  2635. static struct tcp_cookie_secret *tcp_secret_secondary;
  2636. static DEFINE_SPINLOCK(tcp_secret_locker);
  2637. /* Select a pseudo-random word in the cookie workspace.
  2638. */
  2639. static inline u32 tcp_cookie_work(const u32 *ws, const int n)
  2640. {
  2641. return ws[COOKIE_DIGEST_WORDS + ((COOKIE_MESSAGE_WORDS-1) & ws[n])];
  2642. }
  2643. /* Fill bakery[COOKIE_WORKSPACE_WORDS] with generator, updating as needed.
  2644. * Called in softirq context.
  2645. * Returns: 0 for success.
  2646. */
  2647. int tcp_cookie_generator(u32 *bakery)
  2648. {
  2649. unsigned long jiffy = jiffies;
  2650. if (unlikely(time_after_eq(jiffy, tcp_secret_generating->expires))) {
  2651. spin_lock_bh(&tcp_secret_locker);
  2652. if (!time_after_eq(jiffy, tcp_secret_generating->expires)) {
  2653. /* refreshed by another */
  2654. memcpy(bakery,
  2655. &tcp_secret_generating->secrets[0],
  2656. COOKIE_WORKSPACE_WORDS);
  2657. } else {
  2658. /* still needs refreshing */
  2659. get_random_bytes(bakery, COOKIE_WORKSPACE_WORDS);
  2660. /* The first time, paranoia assumes that the
  2661. * randomization function isn't as strong. But,
  2662. * this secret initialization is delayed until
  2663. * the last possible moment (packet arrival).
  2664. * Although that time is observable, it is
  2665. * unpredictably variable. Mash in the most
  2666. * volatile clock bits available, and expire the
  2667. * secret extra quickly.
  2668. */
  2669. if (unlikely(tcp_secret_primary->expires ==
  2670. tcp_secret_secondary->expires)) {
  2671. struct timespec tv;
  2672. getnstimeofday(&tv);
  2673. bakery[COOKIE_DIGEST_WORDS+0] ^=
  2674. (u32)tv.tv_nsec;
  2675. tcp_secret_secondary->expires = jiffy
  2676. + TCP_SECRET_1MSL
  2677. + (0x0f & tcp_cookie_work(bakery, 0));
  2678. } else {
  2679. tcp_secret_secondary->expires = jiffy
  2680. + TCP_SECRET_LIFE
  2681. + (0xff & tcp_cookie_work(bakery, 1));
  2682. tcp_secret_primary->expires = jiffy
  2683. + TCP_SECRET_2MSL
  2684. + (0x1f & tcp_cookie_work(bakery, 2));
  2685. }
  2686. memcpy(&tcp_secret_secondary->secrets[0],
  2687. bakery, COOKIE_WORKSPACE_WORDS);
  2688. rcu_assign_pointer(tcp_secret_generating,
  2689. tcp_secret_secondary);
  2690. rcu_assign_pointer(tcp_secret_retiring,
  2691. tcp_secret_primary);
  2692. /*
  2693. * Neither call_rcu() nor synchronize_rcu() needed.
  2694. * Retiring data is not freed. It is replaced after
  2695. * further (locked) pointer updates, and a quiet time
  2696. * (minimum 1MSL, maximum LIFE - 2MSL).
  2697. */
  2698. }
  2699. spin_unlock_bh(&tcp_secret_locker);
  2700. } else {
  2701. rcu_read_lock_bh();
  2702. memcpy(bakery,
  2703. &rcu_dereference(tcp_secret_generating)->secrets[0],
  2704. COOKIE_WORKSPACE_WORDS);
  2705. rcu_read_unlock_bh();
  2706. }
  2707. return 0;
  2708. }
  2709. EXPORT_SYMBOL(tcp_cookie_generator);
  2710. void tcp_done(struct sock *sk)
  2711. {
  2712. if (sk->sk_state == TCP_SYN_SENT || sk->sk_state == TCP_SYN_RECV)
  2713. TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_ATTEMPTFAILS);
  2714. tcp_set_state(sk, TCP_CLOSE);
  2715. tcp_clear_xmit_timers(sk);
  2716. sk->sk_shutdown = SHUTDOWN_MASK;
  2717. if (!sock_flag(sk, SOCK_DEAD))
  2718. sk->sk_state_change(sk);
  2719. else
  2720. inet_csk_destroy_sock(sk);
  2721. }
  2722. EXPORT_SYMBOL_GPL(tcp_done);
  2723. extern struct tcp_congestion_ops tcp_reno;
  2724. static __initdata unsigned long thash_entries;
  2725. static int __init set_thash_entries(char *str)
  2726. {
  2727. if (!str)
  2728. return 0;
  2729. thash_entries = simple_strtoul(str, &str, 0);
  2730. return 1;
  2731. }
  2732. __setup("thash_entries=", set_thash_entries);
  2733. void __init tcp_init(void)
  2734. {
  2735. struct sk_buff *skb = NULL;
  2736. unsigned long nr_pages, limit;
  2737. int order, i, max_share;
  2738. unsigned long jiffy = jiffies;
  2739. BUILD_BUG_ON(sizeof(struct tcp_skb_cb) > sizeof(skb->cb));
  2740. percpu_counter_init(&tcp_sockets_allocated, 0);
  2741. percpu_counter_init(&tcp_orphan_count, 0);
  2742. tcp_hashinfo.bind_bucket_cachep =
  2743. kmem_cache_create("tcp_bind_bucket",
  2744. sizeof(struct inet_bind_bucket), 0,
  2745. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  2746. /* Size and allocate the main established and bind bucket
  2747. * hash tables.
  2748. *
  2749. * The methodology is similar to that of the buffer cache.
  2750. */
  2751. tcp_hashinfo.ehash =
  2752. alloc_large_system_hash("TCP established",
  2753. sizeof(struct inet_ehash_bucket),
  2754. thash_entries,
  2755. (totalram_pages >= 128 * 1024) ?
  2756. 13 : 15,
  2757. 0,
  2758. NULL,
  2759. &tcp_hashinfo.ehash_mask,
  2760. thash_entries ? 0 : 512 * 1024);
  2761. for (i = 0; i <= tcp_hashinfo.ehash_mask; i++) {
  2762. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].chain, i);
  2763. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].twchain, i);
  2764. }
  2765. if (inet_ehash_locks_alloc(&tcp_hashinfo))
  2766. panic("TCP: failed to alloc ehash_locks");
  2767. tcp_hashinfo.bhash =
  2768. alloc_large_system_hash("TCP bind",
  2769. sizeof(struct inet_bind_hashbucket),
  2770. tcp_hashinfo.ehash_mask + 1,
  2771. (totalram_pages >= 128 * 1024) ?
  2772. 13 : 15,
  2773. 0,
  2774. &tcp_hashinfo.bhash_size,
  2775. NULL,
  2776. 64 * 1024);
  2777. tcp_hashinfo.bhash_size = 1 << tcp_hashinfo.bhash_size;
  2778. for (i = 0; i < tcp_hashinfo.bhash_size; i++) {
  2779. spin_lock_init(&tcp_hashinfo.bhash[i].lock);
  2780. INIT_HLIST_HEAD(&tcp_hashinfo.bhash[i].chain);
  2781. }
  2782. /* Try to be a bit smarter and adjust defaults depending
  2783. * on available memory.
  2784. */
  2785. for (order = 0; ((1 << order) << PAGE_SHIFT) <
  2786. (tcp_hashinfo.bhash_size * sizeof(struct inet_bind_hashbucket));
  2787. order++)
  2788. ;
  2789. if (order >= 4) {
  2790. tcp_death_row.sysctl_max_tw_buckets = 180000;
  2791. sysctl_tcp_max_orphans = 4096 << (order - 4);
  2792. sysctl_max_syn_backlog = 1024;
  2793. } else if (order < 3) {
  2794. tcp_death_row.sysctl_max_tw_buckets >>= (3 - order);
  2795. sysctl_tcp_max_orphans >>= (3 - order);
  2796. sysctl_max_syn_backlog = 128;
  2797. }
  2798. /* Set the pressure threshold to be a fraction of global memory that
  2799. * is up to 1/2 at 256 MB, decreasing toward zero with the amount of
  2800. * memory, with a floor of 128 pages.
  2801. */
  2802. nr_pages = totalram_pages - totalhigh_pages;
  2803. limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
  2804. limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
  2805. limit = max(limit, 128UL);
  2806. sysctl_tcp_mem[0] = limit / 4 * 3;
  2807. sysctl_tcp_mem[1] = limit;
  2808. sysctl_tcp_mem[2] = sysctl_tcp_mem[0] * 2;
  2809. /* Set per-socket limits to no more than 1/128 the pressure threshold */
  2810. limit = ((unsigned long)sysctl_tcp_mem[1]) << (PAGE_SHIFT - 7);
  2811. max_share = min(4UL*1024*1024, limit);
  2812. sysctl_tcp_wmem[0] = SK_MEM_QUANTUM;
  2813. sysctl_tcp_wmem[1] = 16*1024;
  2814. sysctl_tcp_wmem[2] = max(64*1024, max_share);
  2815. sysctl_tcp_rmem[0] = SK_MEM_QUANTUM;
  2816. sysctl_tcp_rmem[1] = 87380;
  2817. sysctl_tcp_rmem[2] = max(87380, max_share);
  2818. printk(KERN_INFO "TCP: Hash tables configured "
  2819. "(established %u bind %u)\n",
  2820. tcp_hashinfo.ehash_mask + 1, tcp_hashinfo.bhash_size);
  2821. tcp_register_congestion_control(&tcp_reno);
  2822. memset(&tcp_secret_one.secrets[0], 0, sizeof(tcp_secret_one.secrets));
  2823. memset(&tcp_secret_two.secrets[0], 0, sizeof(tcp_secret_two.secrets));
  2824. tcp_secret_one.expires = jiffy; /* past due */
  2825. tcp_secret_two.expires = jiffy; /* past due */
  2826. tcp_secret_generating = &tcp_secret_one;
  2827. tcp_secret_primary = &tcp_secret_one;
  2828. tcp_secret_retiring = &tcp_secret_two;
  2829. tcp_secret_secondary = &tcp_secret_two;
  2830. }
  2831. EXPORT_SYMBOL(tcp_close);
  2832. EXPORT_SYMBOL(tcp_disconnect);
  2833. EXPORT_SYMBOL(tcp_getsockopt);
  2834. EXPORT_SYMBOL(tcp_ioctl);
  2835. EXPORT_SYMBOL(tcp_poll);
  2836. EXPORT_SYMBOL(tcp_read_sock);
  2837. EXPORT_SYMBOL(tcp_recvmsg);
  2838. EXPORT_SYMBOL(tcp_sendmsg);
  2839. EXPORT_SYMBOL(tcp_splice_read);
  2840. EXPORT_SYMBOL(tcp_sendpage);
  2841. EXPORT_SYMBOL(tcp_setsockopt);
  2842. EXPORT_SYMBOL(tcp_shutdown);