tcp.c 75 KB

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