tcp.c 75 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900
  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, min(rd_desc->count, len),
  488. tss->flags);
  489. if (ret > 0)
  490. rd_desc->count -= ret;
  491. return ret;
  492. }
  493. static int __tcp_splice_read(struct sock *sk, struct tcp_splice_state *tss)
  494. {
  495. /* Store TCP splice context information in read_descriptor_t. */
  496. read_descriptor_t rd_desc = {
  497. .arg.data = tss,
  498. .count = tss->len,
  499. };
  500. return tcp_read_sock(sk, &rd_desc, tcp_splice_data_recv);
  501. }
  502. /**
  503. * tcp_splice_read - splice data from TCP socket to a pipe
  504. * @sock: socket to splice from
  505. * @ppos: position (not valid)
  506. * @pipe: pipe to splice to
  507. * @len: number of bytes to splice
  508. * @flags: splice modifier flags
  509. *
  510. * Description:
  511. * Will read pages from given socket and fill them into a pipe.
  512. *
  513. **/
  514. ssize_t tcp_splice_read(struct socket *sock, loff_t *ppos,
  515. struct pipe_inode_info *pipe, size_t len,
  516. unsigned int flags)
  517. {
  518. struct sock *sk = sock->sk;
  519. struct tcp_splice_state tss = {
  520. .pipe = pipe,
  521. .len = len,
  522. .flags = flags,
  523. };
  524. long timeo;
  525. ssize_t spliced;
  526. int ret;
  527. /*
  528. * We can't seek on a socket input
  529. */
  530. if (unlikely(*ppos))
  531. return -ESPIPE;
  532. ret = spliced = 0;
  533. lock_sock(sk);
  534. timeo = sock_rcvtimeo(sk, flags & SPLICE_F_NONBLOCK);
  535. while (tss.len) {
  536. ret = __tcp_splice_read(sk, &tss);
  537. if (ret < 0)
  538. break;
  539. else if (!ret) {
  540. if (spliced)
  541. break;
  542. if (sock_flag(sk, SOCK_DONE))
  543. break;
  544. if (sk->sk_err) {
  545. ret = sock_error(sk);
  546. break;
  547. }
  548. if (sk->sk_shutdown & RCV_SHUTDOWN)
  549. break;
  550. if (sk->sk_state == TCP_CLOSE) {
  551. /*
  552. * This occurs when user tries to read
  553. * from never connected socket.
  554. */
  555. if (!sock_flag(sk, SOCK_DONE))
  556. ret = -ENOTCONN;
  557. break;
  558. }
  559. if (!timeo) {
  560. ret = -EAGAIN;
  561. break;
  562. }
  563. sk_wait_data(sk, &timeo);
  564. if (signal_pending(current)) {
  565. ret = sock_intr_errno(timeo);
  566. break;
  567. }
  568. continue;
  569. }
  570. tss.len -= ret;
  571. spliced += ret;
  572. if (!timeo)
  573. break;
  574. release_sock(sk);
  575. lock_sock(sk);
  576. if (sk->sk_err || sk->sk_state == TCP_CLOSE ||
  577. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  578. signal_pending(current))
  579. break;
  580. }
  581. release_sock(sk);
  582. if (spliced)
  583. return spliced;
  584. return ret;
  585. }
  586. struct sk_buff *sk_stream_alloc_skb(struct sock *sk, int size, gfp_t gfp)
  587. {
  588. struct sk_buff *skb;
  589. /* The TCP header must be at least 32-bit aligned. */
  590. size = ALIGN(size, 4);
  591. skb = alloc_skb_fclone(size + sk->sk_prot->max_header, gfp);
  592. if (skb) {
  593. if (sk_wmem_schedule(sk, skb->truesize)) {
  594. /*
  595. * Make sure that we have exactly size bytes
  596. * available to the caller, no more, no less.
  597. */
  598. skb_reserve(skb, skb_tailroom(skb) - size);
  599. return skb;
  600. }
  601. __kfree_skb(skb);
  602. } else {
  603. sk->sk_prot->enter_memory_pressure(sk);
  604. sk_stream_moderate_sndbuf(sk);
  605. }
  606. return NULL;
  607. }
  608. static ssize_t do_tcp_sendpages(struct sock *sk, struct page **pages, int poffset,
  609. size_t psize, int flags)
  610. {
  611. struct tcp_sock *tp = tcp_sk(sk);
  612. int mss_now, size_goal;
  613. int err;
  614. ssize_t copied;
  615. long timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  616. /* Wait for a connection to finish. */
  617. if ((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT))
  618. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  619. goto out_err;
  620. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  621. mss_now = tcp_current_mss(sk, !(flags&MSG_OOB));
  622. size_goal = tp->xmit_size_goal;
  623. copied = 0;
  624. err = -EPIPE;
  625. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  626. goto do_error;
  627. while (psize > 0) {
  628. struct sk_buff *skb = tcp_write_queue_tail(sk);
  629. struct page *page = pages[poffset / PAGE_SIZE];
  630. int copy, i, can_coalesce;
  631. int offset = poffset % PAGE_SIZE;
  632. int size = min_t(size_t, psize, PAGE_SIZE - offset);
  633. if (!tcp_send_head(sk) || (copy = size_goal - skb->len) <= 0) {
  634. new_segment:
  635. if (!sk_stream_memory_free(sk))
  636. goto wait_for_sndbuf;
  637. skb = sk_stream_alloc_skb(sk, 0, sk->sk_allocation);
  638. if (!skb)
  639. goto wait_for_memory;
  640. skb_entail(sk, skb);
  641. copy = size_goal;
  642. }
  643. if (copy > size)
  644. copy = size;
  645. i = skb_shinfo(skb)->nr_frags;
  646. can_coalesce = skb_can_coalesce(skb, i, page, offset);
  647. if (!can_coalesce && i >= MAX_SKB_FRAGS) {
  648. tcp_mark_push(tp, skb);
  649. goto new_segment;
  650. }
  651. if (!sk_wmem_schedule(sk, copy))
  652. goto wait_for_memory;
  653. if (can_coalesce) {
  654. skb_shinfo(skb)->frags[i - 1].size += copy;
  655. } else {
  656. get_page(page);
  657. skb_fill_page_desc(skb, i, page, offset, copy);
  658. }
  659. skb->len += copy;
  660. skb->data_len += copy;
  661. skb->truesize += copy;
  662. sk->sk_wmem_queued += copy;
  663. sk_mem_charge(sk, copy);
  664. skb->ip_summed = CHECKSUM_PARTIAL;
  665. tp->write_seq += copy;
  666. TCP_SKB_CB(skb)->end_seq += copy;
  667. skb_shinfo(skb)->gso_segs = 0;
  668. if (!copied)
  669. TCP_SKB_CB(skb)->flags &= ~TCPCB_FLAG_PSH;
  670. copied += copy;
  671. poffset += copy;
  672. if (!(psize -= copy))
  673. goto out;
  674. if (skb->len < size_goal || (flags & MSG_OOB))
  675. continue;
  676. if (forced_push(tp)) {
  677. tcp_mark_push(tp, skb);
  678. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  679. } else if (skb == tcp_send_head(sk))
  680. tcp_push_one(sk, mss_now);
  681. continue;
  682. wait_for_sndbuf:
  683. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  684. wait_for_memory:
  685. if (copied)
  686. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  687. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  688. goto do_error;
  689. mss_now = tcp_current_mss(sk, !(flags&MSG_OOB));
  690. size_goal = tp->xmit_size_goal;
  691. }
  692. out:
  693. if (copied)
  694. tcp_push(sk, flags, mss_now, tp->nonagle);
  695. return copied;
  696. do_error:
  697. if (copied)
  698. goto out;
  699. out_err:
  700. return sk_stream_error(sk, flags, err);
  701. }
  702. ssize_t tcp_sendpage(struct socket *sock, struct page *page, int offset,
  703. size_t size, int flags)
  704. {
  705. ssize_t res;
  706. struct sock *sk = sock->sk;
  707. if (!(sk->sk_route_caps & NETIF_F_SG) ||
  708. !(sk->sk_route_caps & NETIF_F_ALL_CSUM))
  709. return sock_no_sendpage(sock, page, offset, size, flags);
  710. lock_sock(sk);
  711. TCP_CHECK_TIMER(sk);
  712. res = do_tcp_sendpages(sk, &page, offset, size, flags);
  713. TCP_CHECK_TIMER(sk);
  714. release_sock(sk);
  715. return res;
  716. }
  717. #define TCP_PAGE(sk) (sk->sk_sndmsg_page)
  718. #define TCP_OFF(sk) (sk->sk_sndmsg_off)
  719. static inline int select_size(struct sock *sk)
  720. {
  721. struct tcp_sock *tp = tcp_sk(sk);
  722. int tmp = tp->mss_cache;
  723. if (sk->sk_route_caps & NETIF_F_SG) {
  724. if (sk_can_gso(sk))
  725. tmp = 0;
  726. else {
  727. int pgbreak = SKB_MAX_HEAD(MAX_TCP_HEADER);
  728. if (tmp >= pgbreak &&
  729. tmp <= pgbreak + (MAX_SKB_FRAGS - 1) * PAGE_SIZE)
  730. tmp = pgbreak;
  731. }
  732. }
  733. return tmp;
  734. }
  735. int tcp_sendmsg(struct kiocb *iocb, struct socket *sock, struct msghdr *msg,
  736. size_t size)
  737. {
  738. struct sock *sk = sock->sk;
  739. struct iovec *iov;
  740. struct tcp_sock *tp = tcp_sk(sk);
  741. struct sk_buff *skb;
  742. int iovlen, flags;
  743. int mss_now, size_goal;
  744. int err, copied;
  745. long timeo;
  746. lock_sock(sk);
  747. TCP_CHECK_TIMER(sk);
  748. flags = msg->msg_flags;
  749. timeo = sock_sndtimeo(sk, flags & MSG_DONTWAIT);
  750. /* Wait for a connection to finish. */
  751. if ((1 << sk->sk_state) & ~(TCPF_ESTABLISHED | TCPF_CLOSE_WAIT))
  752. if ((err = sk_stream_wait_connect(sk, &timeo)) != 0)
  753. goto out_err;
  754. /* This should be in poll */
  755. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  756. mss_now = tcp_current_mss(sk, !(flags&MSG_OOB));
  757. size_goal = tp->xmit_size_goal;
  758. /* Ok commence sending. */
  759. iovlen = msg->msg_iovlen;
  760. iov = msg->msg_iov;
  761. copied = 0;
  762. err = -EPIPE;
  763. if (sk->sk_err || (sk->sk_shutdown & SEND_SHUTDOWN))
  764. goto do_error;
  765. while (--iovlen >= 0) {
  766. int seglen = iov->iov_len;
  767. unsigned char __user *from = iov->iov_base;
  768. iov++;
  769. while (seglen > 0) {
  770. int copy;
  771. skb = tcp_write_queue_tail(sk);
  772. if (!tcp_send_head(sk) ||
  773. (copy = size_goal - skb->len) <= 0) {
  774. new_segment:
  775. /* Allocate new segment. If the interface is SG,
  776. * allocate skb fitting to single page.
  777. */
  778. if (!sk_stream_memory_free(sk))
  779. goto wait_for_sndbuf;
  780. skb = sk_stream_alloc_skb(sk, select_size(sk),
  781. sk->sk_allocation);
  782. if (!skb)
  783. goto wait_for_memory;
  784. /*
  785. * Check whether we can use HW checksum.
  786. */
  787. if (sk->sk_route_caps & NETIF_F_ALL_CSUM)
  788. skb->ip_summed = CHECKSUM_PARTIAL;
  789. skb_entail(sk, skb);
  790. copy = size_goal;
  791. }
  792. /* Try to append data to the end of skb. */
  793. if (copy > seglen)
  794. copy = seglen;
  795. /* Where to copy to? */
  796. if (skb_tailroom(skb) > 0) {
  797. /* We have some space in skb head. Superb! */
  798. if (copy > skb_tailroom(skb))
  799. copy = skb_tailroom(skb);
  800. if ((err = skb_add_data(skb, from, copy)) != 0)
  801. goto do_fault;
  802. } else {
  803. int merge = 0;
  804. int i = skb_shinfo(skb)->nr_frags;
  805. struct page *page = TCP_PAGE(sk);
  806. int off = TCP_OFF(sk);
  807. if (skb_can_coalesce(skb, i, page, off) &&
  808. off != PAGE_SIZE) {
  809. /* We can extend the last page
  810. * fragment. */
  811. merge = 1;
  812. } else if (i == MAX_SKB_FRAGS ||
  813. (!i &&
  814. !(sk->sk_route_caps & NETIF_F_SG))) {
  815. /* Need to add new fragment and cannot
  816. * do this because interface is non-SG,
  817. * or because all the page slots are
  818. * busy. */
  819. tcp_mark_push(tp, skb);
  820. goto new_segment;
  821. } else if (page) {
  822. if (off == PAGE_SIZE) {
  823. put_page(page);
  824. TCP_PAGE(sk) = page = NULL;
  825. off = 0;
  826. }
  827. } else
  828. off = 0;
  829. if (copy > PAGE_SIZE - off)
  830. copy = PAGE_SIZE - off;
  831. if (!sk_wmem_schedule(sk, copy))
  832. goto wait_for_memory;
  833. if (!page) {
  834. /* Allocate new cache page. */
  835. if (!(page = sk_stream_alloc_page(sk)))
  836. goto wait_for_memory;
  837. }
  838. /* Time to copy data. We are close to
  839. * the end! */
  840. err = skb_copy_to_page(sk, from, skb, page,
  841. off, copy);
  842. if (err) {
  843. /* If this page was new, give it to the
  844. * socket so it does not get leaked.
  845. */
  846. if (!TCP_PAGE(sk)) {
  847. TCP_PAGE(sk) = page;
  848. TCP_OFF(sk) = 0;
  849. }
  850. goto do_error;
  851. }
  852. /* Update the skb. */
  853. if (merge) {
  854. skb_shinfo(skb)->frags[i - 1].size +=
  855. copy;
  856. } else {
  857. skb_fill_page_desc(skb, i, page, off, copy);
  858. if (TCP_PAGE(sk)) {
  859. get_page(page);
  860. } else if (off + copy < PAGE_SIZE) {
  861. get_page(page);
  862. TCP_PAGE(sk) = page;
  863. }
  864. }
  865. TCP_OFF(sk) = off + copy;
  866. }
  867. if (!copied)
  868. TCP_SKB_CB(skb)->flags &= ~TCPCB_FLAG_PSH;
  869. tp->write_seq += copy;
  870. TCP_SKB_CB(skb)->end_seq += copy;
  871. skb_shinfo(skb)->gso_segs = 0;
  872. from += copy;
  873. copied += copy;
  874. if ((seglen -= copy) == 0 && iovlen == 0)
  875. goto out;
  876. if (skb->len < size_goal || (flags & MSG_OOB))
  877. continue;
  878. if (forced_push(tp)) {
  879. tcp_mark_push(tp, skb);
  880. __tcp_push_pending_frames(sk, mss_now, TCP_NAGLE_PUSH);
  881. } else if (skb == tcp_send_head(sk))
  882. tcp_push_one(sk, mss_now);
  883. continue;
  884. wait_for_sndbuf:
  885. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  886. wait_for_memory:
  887. if (copied)
  888. tcp_push(sk, flags & ~MSG_MORE, mss_now, TCP_NAGLE_PUSH);
  889. if ((err = sk_stream_wait_memory(sk, &timeo)) != 0)
  890. goto do_error;
  891. mss_now = tcp_current_mss(sk, !(flags&MSG_OOB));
  892. size_goal = tp->xmit_size_goal;
  893. }
  894. }
  895. out:
  896. if (copied)
  897. tcp_push(sk, flags, mss_now, tp->nonagle);
  898. TCP_CHECK_TIMER(sk);
  899. release_sock(sk);
  900. return copied;
  901. do_fault:
  902. if (!skb->len) {
  903. tcp_unlink_write_queue(skb, sk);
  904. /* It is the one place in all of TCP, except connection
  905. * reset, where we can be unlinking the send_head.
  906. */
  907. tcp_check_send_head(sk, skb);
  908. sk_wmem_free_skb(sk, skb);
  909. }
  910. do_error:
  911. if (copied)
  912. goto out;
  913. out_err:
  914. err = sk_stream_error(sk, flags, err);
  915. TCP_CHECK_TIMER(sk);
  916. release_sock(sk);
  917. return err;
  918. }
  919. /*
  920. * Handle reading urgent data. BSD has very simple semantics for
  921. * this, no blocking and very strange errors 8)
  922. */
  923. static int tcp_recv_urg(struct sock *sk, long timeo,
  924. struct msghdr *msg, int len, int flags,
  925. int *addr_len)
  926. {
  927. struct tcp_sock *tp = tcp_sk(sk);
  928. /* No URG data to read. */
  929. if (sock_flag(sk, SOCK_URGINLINE) || !tp->urg_data ||
  930. tp->urg_data == TCP_URG_READ)
  931. return -EINVAL; /* Yes this is right ! */
  932. if (sk->sk_state == TCP_CLOSE && !sock_flag(sk, SOCK_DONE))
  933. return -ENOTCONN;
  934. if (tp->urg_data & TCP_URG_VALID) {
  935. int err = 0;
  936. char c = tp->urg_data;
  937. if (!(flags & MSG_PEEK))
  938. tp->urg_data = TCP_URG_READ;
  939. /* Read urgent data. */
  940. msg->msg_flags |= MSG_OOB;
  941. if (len > 0) {
  942. if (!(flags & MSG_TRUNC))
  943. err = memcpy_toiovec(msg->msg_iov, &c, 1);
  944. len = 1;
  945. } else
  946. msg->msg_flags |= MSG_TRUNC;
  947. return err ? -EFAULT : len;
  948. }
  949. if (sk->sk_state == TCP_CLOSE || (sk->sk_shutdown & RCV_SHUTDOWN))
  950. return 0;
  951. /* Fixed the recv(..., MSG_OOB) behaviour. BSD docs and
  952. * the available implementations agree in this case:
  953. * this call should never block, independent of the
  954. * blocking state of the socket.
  955. * Mike <pall@rz.uni-karlsruhe.de>
  956. */
  957. return -EAGAIN;
  958. }
  959. /* Clean up the receive buffer for full frames taken by the user,
  960. * then send an ACK if necessary. COPIED is the number of bytes
  961. * tcp_recvmsg has given to the user so far, it speeds up the
  962. * calculation of whether or not we must ACK for the sake of
  963. * a window update.
  964. */
  965. void tcp_cleanup_rbuf(struct sock *sk, int copied)
  966. {
  967. struct tcp_sock *tp = tcp_sk(sk);
  968. int time_to_ack = 0;
  969. #if TCP_DEBUG
  970. struct sk_buff *skb = skb_peek(&sk->sk_receive_queue);
  971. WARN_ON(skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq));
  972. #endif
  973. if (inet_csk_ack_scheduled(sk)) {
  974. const struct inet_connection_sock *icsk = inet_csk(sk);
  975. /* Delayed ACKs frequently hit locked sockets during bulk
  976. * receive. */
  977. if (icsk->icsk_ack.blocked ||
  978. /* Once-per-two-segments ACK was not sent by tcp_input.c */
  979. tp->rcv_nxt - tp->rcv_wup > icsk->icsk_ack.rcv_mss ||
  980. /*
  981. * If this read emptied read buffer, we send ACK, if
  982. * connection is not bidirectional, user drained
  983. * receive buffer and there was a small segment
  984. * in queue.
  985. */
  986. (copied > 0 &&
  987. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED2) ||
  988. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED) &&
  989. !icsk->icsk_ack.pingpong)) &&
  990. !atomic_read(&sk->sk_rmem_alloc)))
  991. time_to_ack = 1;
  992. }
  993. /* We send an ACK if we can now advertise a non-zero window
  994. * which has been raised "significantly".
  995. *
  996. * Even if window raised up to infinity, do not send window open ACK
  997. * in states, where we will not receive more. It is useless.
  998. */
  999. if (copied > 0 && !time_to_ack && !(sk->sk_shutdown & RCV_SHUTDOWN)) {
  1000. __u32 rcv_window_now = tcp_receive_window(tp);
  1001. /* Optimize, __tcp_select_window() is not cheap. */
  1002. if (2*rcv_window_now <= tp->window_clamp) {
  1003. __u32 new_window = __tcp_select_window(sk);
  1004. /* Send ACK now, if this read freed lots of space
  1005. * in our buffer. Certainly, new_window is new window.
  1006. * We can advertise it now, if it is not less than current one.
  1007. * "Lots" means "at least twice" here.
  1008. */
  1009. if (new_window && new_window >= 2 * rcv_window_now)
  1010. time_to_ack = 1;
  1011. }
  1012. }
  1013. if (time_to_ack)
  1014. tcp_send_ack(sk);
  1015. }
  1016. static void tcp_prequeue_process(struct sock *sk)
  1017. {
  1018. struct sk_buff *skb;
  1019. struct tcp_sock *tp = tcp_sk(sk);
  1020. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPPREQUEUED);
  1021. /* RX process wants to run with disabled BHs, though it is not
  1022. * necessary */
  1023. local_bh_disable();
  1024. while ((skb = __skb_dequeue(&tp->ucopy.prequeue)) != NULL)
  1025. sk_backlog_rcv(sk, skb);
  1026. local_bh_enable();
  1027. /* Clear memory counter. */
  1028. tp->ucopy.memory = 0;
  1029. }
  1030. static inline struct sk_buff *tcp_recv_skb(struct sock *sk, u32 seq, u32 *off)
  1031. {
  1032. struct sk_buff *skb;
  1033. u32 offset;
  1034. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1035. offset = seq - TCP_SKB_CB(skb)->seq;
  1036. if (tcp_hdr(skb)->syn)
  1037. offset--;
  1038. if (offset < skb->len || tcp_hdr(skb)->fin) {
  1039. *off = offset;
  1040. return skb;
  1041. }
  1042. }
  1043. return NULL;
  1044. }
  1045. /*
  1046. * This routine provides an alternative to tcp_recvmsg() for routines
  1047. * that would like to handle copying from skbuffs directly in 'sendfile'
  1048. * fashion.
  1049. * Note:
  1050. * - It is assumed that the socket was locked by the caller.
  1051. * - The routine does not block.
  1052. * - At present, there is no support for reading OOB data
  1053. * or for 'peeking' the socket using this routine
  1054. * (although both would be easy to implement).
  1055. */
  1056. int tcp_read_sock(struct sock *sk, read_descriptor_t *desc,
  1057. sk_read_actor_t recv_actor)
  1058. {
  1059. struct sk_buff *skb;
  1060. struct tcp_sock *tp = tcp_sk(sk);
  1061. u32 seq = tp->copied_seq;
  1062. u32 offset;
  1063. int copied = 0;
  1064. if (sk->sk_state == TCP_LISTEN)
  1065. return -ENOTCONN;
  1066. while ((skb = tcp_recv_skb(sk, seq, &offset)) != NULL) {
  1067. if (offset < skb->len) {
  1068. int used;
  1069. size_t len;
  1070. len = skb->len - offset;
  1071. /* Stop reading if we hit a patch of urgent data */
  1072. if (tp->urg_data) {
  1073. u32 urg_offset = tp->urg_seq - seq;
  1074. if (urg_offset < len)
  1075. len = urg_offset;
  1076. if (!len)
  1077. break;
  1078. }
  1079. used = recv_actor(desc, skb, offset, len);
  1080. if (used < 0) {
  1081. if (!copied)
  1082. copied = used;
  1083. break;
  1084. } else if (used <= len) {
  1085. seq += used;
  1086. copied += used;
  1087. offset += used;
  1088. }
  1089. /*
  1090. * If recv_actor drops the lock (e.g. TCP splice
  1091. * receive) the skb pointer might be invalid when
  1092. * getting here: tcp_collapse might have deleted it
  1093. * while aggregating skbs from the socket queue.
  1094. */
  1095. skb = tcp_recv_skb(sk, seq-1, &offset);
  1096. if (!skb || (offset+1 != skb->len))
  1097. break;
  1098. }
  1099. if (tcp_hdr(skb)->fin) {
  1100. sk_eat_skb(sk, skb, 0);
  1101. ++seq;
  1102. break;
  1103. }
  1104. sk_eat_skb(sk, skb, 0);
  1105. if (!desc->count)
  1106. break;
  1107. }
  1108. tp->copied_seq = seq;
  1109. tcp_rcv_space_adjust(sk);
  1110. /* Clean up data we have read: This will do ACK frames. */
  1111. if (copied > 0)
  1112. tcp_cleanup_rbuf(sk, copied);
  1113. return copied;
  1114. }
  1115. /*
  1116. * This routine copies from a sock struct into the user buffer.
  1117. *
  1118. * Technical note: in 2.3 we work on _locked_ socket, so that
  1119. * tricks with *seq access order and skb->users are not required.
  1120. * Probably, code can be easily improved even more.
  1121. */
  1122. int tcp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  1123. size_t len, int nonblock, int flags, int *addr_len)
  1124. {
  1125. struct tcp_sock *tp = tcp_sk(sk);
  1126. int copied = 0;
  1127. u32 peek_seq;
  1128. u32 *seq;
  1129. unsigned long used;
  1130. int err;
  1131. int target; /* Read at least this many bytes */
  1132. long timeo;
  1133. struct task_struct *user_recv = NULL;
  1134. int copied_early = 0;
  1135. struct sk_buff *skb;
  1136. lock_sock(sk);
  1137. TCP_CHECK_TIMER(sk);
  1138. err = -ENOTCONN;
  1139. if (sk->sk_state == TCP_LISTEN)
  1140. goto out;
  1141. timeo = sock_rcvtimeo(sk, nonblock);
  1142. /* Urgent data needs to be handled specially. */
  1143. if (flags & MSG_OOB)
  1144. goto recv_urg;
  1145. seq = &tp->copied_seq;
  1146. if (flags & MSG_PEEK) {
  1147. peek_seq = tp->copied_seq;
  1148. seq = &peek_seq;
  1149. }
  1150. target = sock_rcvlowat(sk, flags & MSG_WAITALL, len);
  1151. #ifdef CONFIG_NET_DMA
  1152. tp->ucopy.dma_chan = NULL;
  1153. preempt_disable();
  1154. skb = skb_peek_tail(&sk->sk_receive_queue);
  1155. {
  1156. int available = 0;
  1157. if (skb)
  1158. available = TCP_SKB_CB(skb)->seq + skb->len - (*seq);
  1159. if ((available < target) &&
  1160. (len > sysctl_tcp_dma_copybreak) && !(flags & MSG_PEEK) &&
  1161. !sysctl_tcp_low_latency &&
  1162. dma_find_channel(DMA_MEMCPY)) {
  1163. preempt_enable_no_resched();
  1164. tp->ucopy.pinned_list =
  1165. dma_pin_iovec_pages(msg->msg_iov, len);
  1166. } else {
  1167. preempt_enable_no_resched();
  1168. }
  1169. }
  1170. #endif
  1171. do {
  1172. u32 offset;
  1173. /* Are we at urgent data? Stop if we have read anything or have SIGURG pending. */
  1174. if (tp->urg_data && tp->urg_seq == *seq) {
  1175. if (copied)
  1176. break;
  1177. if (signal_pending(current)) {
  1178. copied = timeo ? sock_intr_errno(timeo) : -EAGAIN;
  1179. break;
  1180. }
  1181. }
  1182. /* Next get a buffer. */
  1183. skb = skb_peek(&sk->sk_receive_queue);
  1184. do {
  1185. if (!skb)
  1186. break;
  1187. /* Now that we have two receive queues this
  1188. * shouldn't happen.
  1189. */
  1190. if (before(*seq, TCP_SKB_CB(skb)->seq)) {
  1191. printk(KERN_INFO "recvmsg bug: copied %X "
  1192. "seq %X\n", *seq, TCP_SKB_CB(skb)->seq);
  1193. break;
  1194. }
  1195. offset = *seq - TCP_SKB_CB(skb)->seq;
  1196. if (tcp_hdr(skb)->syn)
  1197. offset--;
  1198. if (offset < skb->len)
  1199. goto found_ok_skb;
  1200. if (tcp_hdr(skb)->fin)
  1201. goto found_fin_ok;
  1202. WARN_ON(!(flags & MSG_PEEK));
  1203. skb = skb->next;
  1204. } while (skb != (struct sk_buff *)&sk->sk_receive_queue);
  1205. /* Well, if we have backlog, try to process it now yet. */
  1206. if (copied >= target && !sk->sk_backlog.tail)
  1207. break;
  1208. if (copied) {
  1209. if (sk->sk_err ||
  1210. sk->sk_state == TCP_CLOSE ||
  1211. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  1212. !timeo ||
  1213. signal_pending(current))
  1214. break;
  1215. } else {
  1216. if (sock_flag(sk, SOCK_DONE))
  1217. break;
  1218. if (sk->sk_err) {
  1219. copied = sock_error(sk);
  1220. break;
  1221. }
  1222. if (sk->sk_shutdown & RCV_SHUTDOWN)
  1223. break;
  1224. if (sk->sk_state == TCP_CLOSE) {
  1225. if (!sock_flag(sk, SOCK_DONE)) {
  1226. /* This occurs when user tries to read
  1227. * from never connected socket.
  1228. */
  1229. copied = -ENOTCONN;
  1230. break;
  1231. }
  1232. break;
  1233. }
  1234. if (!timeo) {
  1235. copied = -EAGAIN;
  1236. break;
  1237. }
  1238. if (signal_pending(current)) {
  1239. copied = sock_intr_errno(timeo);
  1240. break;
  1241. }
  1242. }
  1243. tcp_cleanup_rbuf(sk, copied);
  1244. if (!sysctl_tcp_low_latency && tp->ucopy.task == user_recv) {
  1245. /* Install new reader */
  1246. if (!user_recv && !(flags & (MSG_TRUNC | MSG_PEEK))) {
  1247. user_recv = current;
  1248. tp->ucopy.task = user_recv;
  1249. tp->ucopy.iov = msg->msg_iov;
  1250. }
  1251. tp->ucopy.len = len;
  1252. WARN_ON(tp->copied_seq != tp->rcv_nxt &&
  1253. !(flags & (MSG_PEEK | MSG_TRUNC)));
  1254. /* Ugly... If prequeue is not empty, we have to
  1255. * process it before releasing socket, otherwise
  1256. * order will be broken at second iteration.
  1257. * More elegant solution is required!!!
  1258. *
  1259. * Look: we have the following (pseudo)queues:
  1260. *
  1261. * 1. packets in flight
  1262. * 2. backlog
  1263. * 3. prequeue
  1264. * 4. receive_queue
  1265. *
  1266. * Each queue can be processed only if the next ones
  1267. * are empty. At this point we have empty receive_queue.
  1268. * But prequeue _can_ be not empty after 2nd iteration,
  1269. * when we jumped to start of loop because backlog
  1270. * processing added something to receive_queue.
  1271. * We cannot release_sock(), because backlog contains
  1272. * packets arrived _after_ prequeued ones.
  1273. *
  1274. * Shortly, algorithm is clear --- to process all
  1275. * the queues in order. We could make it more directly,
  1276. * requeueing packets from backlog to prequeue, if
  1277. * is not empty. It is more elegant, but eats cycles,
  1278. * unfortunately.
  1279. */
  1280. if (!skb_queue_empty(&tp->ucopy.prequeue))
  1281. goto do_prequeue;
  1282. /* __ Set realtime policy in scheduler __ */
  1283. }
  1284. if (copied >= target) {
  1285. /* Do not sleep, just process backlog. */
  1286. release_sock(sk);
  1287. lock_sock(sk);
  1288. } else
  1289. sk_wait_data(sk, &timeo);
  1290. #ifdef CONFIG_NET_DMA
  1291. tp->ucopy.wakeup = 0;
  1292. #endif
  1293. if (user_recv) {
  1294. int chunk;
  1295. /* __ Restore normal policy in scheduler __ */
  1296. if ((chunk = len - tp->ucopy.len) != 0) {
  1297. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMBACKLOG, chunk);
  1298. len -= chunk;
  1299. copied += chunk;
  1300. }
  1301. if (tp->rcv_nxt == tp->copied_seq &&
  1302. !skb_queue_empty(&tp->ucopy.prequeue)) {
  1303. do_prequeue:
  1304. tcp_prequeue_process(sk);
  1305. if ((chunk = len - tp->ucopy.len) != 0) {
  1306. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1307. len -= chunk;
  1308. copied += chunk;
  1309. }
  1310. }
  1311. }
  1312. if ((flags & MSG_PEEK) && peek_seq != tp->copied_seq) {
  1313. if (net_ratelimit())
  1314. printk(KERN_DEBUG "TCP(%s:%d): Application bug, race in MSG_PEEK.\n",
  1315. current->comm, task_pid_nr(current));
  1316. peek_seq = tp->copied_seq;
  1317. }
  1318. continue;
  1319. found_ok_skb:
  1320. /* Ok so how much can we use? */
  1321. used = skb->len - offset;
  1322. if (len < used)
  1323. used = len;
  1324. /* Do we have urgent data here? */
  1325. if (tp->urg_data) {
  1326. u32 urg_offset = tp->urg_seq - *seq;
  1327. if (urg_offset < used) {
  1328. if (!urg_offset) {
  1329. if (!sock_flag(sk, SOCK_URGINLINE)) {
  1330. ++*seq;
  1331. offset++;
  1332. used--;
  1333. if (!used)
  1334. goto skip_copy;
  1335. }
  1336. } else
  1337. used = urg_offset;
  1338. }
  1339. }
  1340. if (!(flags & MSG_TRUNC)) {
  1341. #ifdef CONFIG_NET_DMA
  1342. if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
  1343. tp->ucopy.dma_chan = dma_find_channel(DMA_MEMCPY);
  1344. if (tp->ucopy.dma_chan) {
  1345. tp->ucopy.dma_cookie = dma_skb_copy_datagram_iovec(
  1346. tp->ucopy.dma_chan, skb, offset,
  1347. msg->msg_iov, used,
  1348. tp->ucopy.pinned_list);
  1349. if (tp->ucopy.dma_cookie < 0) {
  1350. printk(KERN_ALERT "dma_cookie < 0\n");
  1351. /* Exception. Bailout! */
  1352. if (!copied)
  1353. copied = -EFAULT;
  1354. break;
  1355. }
  1356. if ((offset + used) == skb->len)
  1357. copied_early = 1;
  1358. } else
  1359. #endif
  1360. {
  1361. err = skb_copy_datagram_iovec(skb, offset,
  1362. msg->msg_iov, used);
  1363. if (err) {
  1364. /* Exception. Bailout! */
  1365. if (!copied)
  1366. copied = -EFAULT;
  1367. break;
  1368. }
  1369. }
  1370. }
  1371. *seq += used;
  1372. copied += used;
  1373. len -= used;
  1374. tcp_rcv_space_adjust(sk);
  1375. skip_copy:
  1376. if (tp->urg_data && after(tp->copied_seq, tp->urg_seq)) {
  1377. tp->urg_data = 0;
  1378. tcp_fast_path_check(sk);
  1379. }
  1380. if (used + offset < skb->len)
  1381. continue;
  1382. if (tcp_hdr(skb)->fin)
  1383. goto found_fin_ok;
  1384. if (!(flags & MSG_PEEK)) {
  1385. sk_eat_skb(sk, skb, copied_early);
  1386. copied_early = 0;
  1387. }
  1388. continue;
  1389. found_fin_ok:
  1390. /* Process the FIN. */
  1391. ++*seq;
  1392. if (!(flags & MSG_PEEK)) {
  1393. sk_eat_skb(sk, skb, copied_early);
  1394. copied_early = 0;
  1395. }
  1396. break;
  1397. } while (len > 0);
  1398. if (user_recv) {
  1399. if (!skb_queue_empty(&tp->ucopy.prequeue)) {
  1400. int chunk;
  1401. tp->ucopy.len = copied > 0 ? len : 0;
  1402. tcp_prequeue_process(sk);
  1403. if (copied > 0 && (chunk = len - tp->ucopy.len) != 0) {
  1404. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1405. len -= chunk;
  1406. copied += chunk;
  1407. }
  1408. }
  1409. tp->ucopy.task = NULL;
  1410. tp->ucopy.len = 0;
  1411. }
  1412. #ifdef CONFIG_NET_DMA
  1413. if (tp->ucopy.dma_chan) {
  1414. dma_cookie_t done, used;
  1415. dma_async_memcpy_issue_pending(tp->ucopy.dma_chan);
  1416. while (dma_async_memcpy_complete(tp->ucopy.dma_chan,
  1417. tp->ucopy.dma_cookie, &done,
  1418. &used) == DMA_IN_PROGRESS) {
  1419. /* do partial cleanup of sk_async_wait_queue */
  1420. while ((skb = skb_peek(&sk->sk_async_wait_queue)) &&
  1421. (dma_async_is_complete(skb->dma_cookie, done,
  1422. used) == DMA_SUCCESS)) {
  1423. __skb_dequeue(&sk->sk_async_wait_queue);
  1424. kfree_skb(skb);
  1425. }
  1426. }
  1427. /* Safe to free early-copied skbs now */
  1428. __skb_queue_purge(&sk->sk_async_wait_queue);
  1429. tp->ucopy.dma_chan = NULL;
  1430. }
  1431. if (tp->ucopy.pinned_list) {
  1432. dma_unpin_iovec_pages(tp->ucopy.pinned_list);
  1433. tp->ucopy.pinned_list = NULL;
  1434. }
  1435. #endif
  1436. /* According to UNIX98, msg_name/msg_namelen are ignored
  1437. * on connected socket. I was just happy when found this 8) --ANK
  1438. */
  1439. /* Clean up data we have read: This will do ACK frames. */
  1440. tcp_cleanup_rbuf(sk, copied);
  1441. TCP_CHECK_TIMER(sk);
  1442. release_sock(sk);
  1443. return copied;
  1444. out:
  1445. TCP_CHECK_TIMER(sk);
  1446. release_sock(sk);
  1447. return err;
  1448. recv_urg:
  1449. err = tcp_recv_urg(sk, timeo, msg, len, flags, addr_len);
  1450. goto out;
  1451. }
  1452. void tcp_set_state(struct sock *sk, int state)
  1453. {
  1454. int oldstate = sk->sk_state;
  1455. switch (state) {
  1456. case TCP_ESTABLISHED:
  1457. if (oldstate != TCP_ESTABLISHED)
  1458. TCP_INC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1459. break;
  1460. case TCP_CLOSE:
  1461. if (oldstate == TCP_CLOSE_WAIT || oldstate == TCP_ESTABLISHED)
  1462. TCP_INC_STATS(sock_net(sk), TCP_MIB_ESTABRESETS);
  1463. sk->sk_prot->unhash(sk);
  1464. if (inet_csk(sk)->icsk_bind_hash &&
  1465. !(sk->sk_userlocks & SOCK_BINDPORT_LOCK))
  1466. inet_put_port(sk);
  1467. /* fall through */
  1468. default:
  1469. if (oldstate == TCP_ESTABLISHED)
  1470. TCP_DEC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1471. }
  1472. /* Change state AFTER socket is unhashed to avoid closed
  1473. * socket sitting in hash tables.
  1474. */
  1475. sk->sk_state = state;
  1476. #ifdef STATE_TRACE
  1477. SOCK_DEBUG(sk, "TCP sk=%p, State %s -> %s\n", sk, statename[oldstate], statename[state]);
  1478. #endif
  1479. }
  1480. EXPORT_SYMBOL_GPL(tcp_set_state);
  1481. /*
  1482. * State processing on a close. This implements the state shift for
  1483. * sending our FIN frame. Note that we only send a FIN for some
  1484. * states. A shutdown() may have already sent the FIN, or we may be
  1485. * closed.
  1486. */
  1487. static const unsigned char new_state[16] = {
  1488. /* current state: new state: action: */
  1489. /* (Invalid) */ TCP_CLOSE,
  1490. /* TCP_ESTABLISHED */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1491. /* TCP_SYN_SENT */ TCP_CLOSE,
  1492. /* TCP_SYN_RECV */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1493. /* TCP_FIN_WAIT1 */ TCP_FIN_WAIT1,
  1494. /* TCP_FIN_WAIT2 */ TCP_FIN_WAIT2,
  1495. /* TCP_TIME_WAIT */ TCP_CLOSE,
  1496. /* TCP_CLOSE */ TCP_CLOSE,
  1497. /* TCP_CLOSE_WAIT */ TCP_LAST_ACK | TCP_ACTION_FIN,
  1498. /* TCP_LAST_ACK */ TCP_LAST_ACK,
  1499. /* TCP_LISTEN */ TCP_CLOSE,
  1500. /* TCP_CLOSING */ TCP_CLOSING,
  1501. };
  1502. static int tcp_close_state(struct sock *sk)
  1503. {
  1504. int next = (int)new_state[sk->sk_state];
  1505. int ns = next & TCP_STATE_MASK;
  1506. tcp_set_state(sk, ns);
  1507. return next & TCP_ACTION_FIN;
  1508. }
  1509. /*
  1510. * Shutdown the sending side of a connection. Much like close except
  1511. * that we don't receive shut down or sock_set_flag(sk, SOCK_DEAD).
  1512. */
  1513. void tcp_shutdown(struct sock *sk, int how)
  1514. {
  1515. /* We need to grab some memory, and put together a FIN,
  1516. * and then put it into the queue to be sent.
  1517. * Tim MacKenzie(tym@dibbler.cs.monash.edu.au) 4 Dec '92.
  1518. */
  1519. if (!(how & SEND_SHUTDOWN))
  1520. return;
  1521. /* If we've already sent a FIN, or it's a closed state, skip this. */
  1522. if ((1 << sk->sk_state) &
  1523. (TCPF_ESTABLISHED | TCPF_SYN_SENT |
  1524. TCPF_SYN_RECV | TCPF_CLOSE_WAIT)) {
  1525. /* Clear out any half completed packets. FIN if needed. */
  1526. if (tcp_close_state(sk))
  1527. tcp_send_fin(sk);
  1528. }
  1529. }
  1530. void tcp_close(struct sock *sk, long timeout)
  1531. {
  1532. struct sk_buff *skb;
  1533. int data_was_unread = 0;
  1534. int state;
  1535. lock_sock(sk);
  1536. sk->sk_shutdown = SHUTDOWN_MASK;
  1537. if (sk->sk_state == TCP_LISTEN) {
  1538. tcp_set_state(sk, TCP_CLOSE);
  1539. /* Special case. */
  1540. inet_csk_listen_stop(sk);
  1541. goto adjudge_to_death;
  1542. }
  1543. /* We need to flush the recv. buffs. We do this only on the
  1544. * descriptor close, not protocol-sourced closes, because the
  1545. * reader process may not have drained the data yet!
  1546. */
  1547. while ((skb = __skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  1548. u32 len = TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq -
  1549. tcp_hdr(skb)->fin;
  1550. data_was_unread += len;
  1551. __kfree_skb(skb);
  1552. }
  1553. sk_mem_reclaim(sk);
  1554. /* As outlined in RFC 2525, section 2.17, we send a RST here because
  1555. * data was lost. To witness the awful effects of the old behavior of
  1556. * always doing a FIN, run an older 2.1.x kernel or 2.0.x, start a bulk
  1557. * GET in an FTP client, suspend the process, wait for the client to
  1558. * advertise a zero window, then kill -9 the FTP client, wheee...
  1559. * Note: timeout is always zero in such a case.
  1560. */
  1561. if (data_was_unread) {
  1562. /* Unread data was tossed, zap the connection. */
  1563. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONCLOSE);
  1564. tcp_set_state(sk, TCP_CLOSE);
  1565. tcp_send_active_reset(sk, GFP_KERNEL);
  1566. } else if (sock_flag(sk, SOCK_LINGER) && !sk->sk_lingertime) {
  1567. /* Check zero linger _after_ checking for unread data. */
  1568. sk->sk_prot->disconnect(sk, 0);
  1569. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
  1570. } else if (tcp_close_state(sk)) {
  1571. /* We FIN if the application ate all the data before
  1572. * zapping the connection.
  1573. */
  1574. /* RED-PEN. Formally speaking, we have broken TCP state
  1575. * machine. State transitions:
  1576. *
  1577. * TCP_ESTABLISHED -> TCP_FIN_WAIT1
  1578. * TCP_SYN_RECV -> TCP_FIN_WAIT1 (forget it, it's impossible)
  1579. * TCP_CLOSE_WAIT -> TCP_LAST_ACK
  1580. *
  1581. * are legal only when FIN has been sent (i.e. in window),
  1582. * rather than queued out of window. Purists blame.
  1583. *
  1584. * F.e. "RFC state" is ESTABLISHED,
  1585. * if Linux state is FIN-WAIT-1, but FIN is still not sent.
  1586. *
  1587. * The visible declinations are that sometimes
  1588. * we enter time-wait state, when it is not required really
  1589. * (harmless), do not send active resets, when they are
  1590. * required by specs (TCP_ESTABLISHED, TCP_CLOSE_WAIT, when
  1591. * they look as CLOSING or LAST_ACK for Linux)
  1592. * Probably, I missed some more holelets.
  1593. * --ANK
  1594. */
  1595. tcp_send_fin(sk);
  1596. }
  1597. sk_stream_wait_close(sk, timeout);
  1598. adjudge_to_death:
  1599. state = sk->sk_state;
  1600. sock_hold(sk);
  1601. sock_orphan(sk);
  1602. /* It is the last release_sock in its life. It will remove backlog. */
  1603. release_sock(sk);
  1604. /* Now socket is owned by kernel and we acquire BH lock
  1605. to finish close. No need to check for user refs.
  1606. */
  1607. local_bh_disable();
  1608. bh_lock_sock(sk);
  1609. WARN_ON(sock_owned_by_user(sk));
  1610. percpu_counter_inc(sk->sk_prot->orphan_count);
  1611. /* Have we already been destroyed by a softirq or backlog? */
  1612. if (state != TCP_CLOSE && sk->sk_state == TCP_CLOSE)
  1613. goto out;
  1614. /* This is a (useful) BSD violating of the RFC. There is a
  1615. * problem with TCP as specified in that the other end could
  1616. * keep a socket open forever with no application left this end.
  1617. * We use a 3 minute timeout (about the same as BSD) then kill
  1618. * our end. If they send after that then tough - BUT: long enough
  1619. * that we won't make the old 4*rto = almost no time - whoops
  1620. * reset mistake.
  1621. *
  1622. * Nope, it was not mistake. It is really desired behaviour
  1623. * f.e. on http servers, when such sockets are useless, but
  1624. * consume significant resources. Let's do it with special
  1625. * linger2 option. --ANK
  1626. */
  1627. if (sk->sk_state == TCP_FIN_WAIT2) {
  1628. struct tcp_sock *tp = tcp_sk(sk);
  1629. if (tp->linger2 < 0) {
  1630. tcp_set_state(sk, TCP_CLOSE);
  1631. tcp_send_active_reset(sk, GFP_ATOMIC);
  1632. NET_INC_STATS_BH(sock_net(sk),
  1633. LINUX_MIB_TCPABORTONLINGER);
  1634. } else {
  1635. const int tmo = tcp_fin_time(sk);
  1636. if (tmo > TCP_TIMEWAIT_LEN) {
  1637. inet_csk_reset_keepalive_timer(sk,
  1638. tmo - TCP_TIMEWAIT_LEN);
  1639. } else {
  1640. tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
  1641. goto out;
  1642. }
  1643. }
  1644. }
  1645. if (sk->sk_state != TCP_CLOSE) {
  1646. int orphan_count = percpu_counter_read_positive(
  1647. sk->sk_prot->orphan_count);
  1648. sk_mem_reclaim(sk);
  1649. if (tcp_too_many_orphans(sk, orphan_count)) {
  1650. if (net_ratelimit())
  1651. printk(KERN_INFO "TCP: too many of orphaned "
  1652. "sockets\n");
  1653. tcp_set_state(sk, TCP_CLOSE);
  1654. tcp_send_active_reset(sk, GFP_ATOMIC);
  1655. NET_INC_STATS_BH(sock_net(sk),
  1656. LINUX_MIB_TCPABORTONMEMORY);
  1657. }
  1658. }
  1659. if (sk->sk_state == TCP_CLOSE)
  1660. inet_csk_destroy_sock(sk);
  1661. /* Otherwise, socket is reprieved until protocol close. */
  1662. out:
  1663. bh_unlock_sock(sk);
  1664. local_bh_enable();
  1665. sock_put(sk);
  1666. }
  1667. /* These states need RST on ABORT according to RFC793 */
  1668. static inline int tcp_need_reset(int state)
  1669. {
  1670. return (1 << state) &
  1671. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT | TCPF_FIN_WAIT1 |
  1672. TCPF_FIN_WAIT2 | TCPF_SYN_RECV);
  1673. }
  1674. int tcp_disconnect(struct sock *sk, int flags)
  1675. {
  1676. struct inet_sock *inet = inet_sk(sk);
  1677. struct inet_connection_sock *icsk = inet_csk(sk);
  1678. struct tcp_sock *tp = tcp_sk(sk);
  1679. int err = 0;
  1680. int old_state = sk->sk_state;
  1681. if (old_state != TCP_CLOSE)
  1682. tcp_set_state(sk, TCP_CLOSE);
  1683. /* ABORT function of RFC793 */
  1684. if (old_state == TCP_LISTEN) {
  1685. inet_csk_listen_stop(sk);
  1686. } else if (tcp_need_reset(old_state) ||
  1687. (tp->snd_nxt != tp->write_seq &&
  1688. (1 << old_state) & (TCPF_CLOSING | TCPF_LAST_ACK))) {
  1689. /* The last check adjusts for discrepancy of Linux wrt. RFC
  1690. * states
  1691. */
  1692. tcp_send_active_reset(sk, gfp_any());
  1693. sk->sk_err = ECONNRESET;
  1694. } else if (old_state == TCP_SYN_SENT)
  1695. sk->sk_err = ECONNRESET;
  1696. tcp_clear_xmit_timers(sk);
  1697. __skb_queue_purge(&sk->sk_receive_queue);
  1698. tcp_write_queue_purge(sk);
  1699. __skb_queue_purge(&tp->out_of_order_queue);
  1700. #ifdef CONFIG_NET_DMA
  1701. __skb_queue_purge(&sk->sk_async_wait_queue);
  1702. #endif
  1703. inet->dport = 0;
  1704. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1705. inet_reset_saddr(sk);
  1706. sk->sk_shutdown = 0;
  1707. sock_reset_flag(sk, SOCK_DONE);
  1708. tp->srtt = 0;
  1709. if ((tp->write_seq += tp->max_window + 2) == 0)
  1710. tp->write_seq = 1;
  1711. icsk->icsk_backoff = 0;
  1712. tp->snd_cwnd = 2;
  1713. icsk->icsk_probes_out = 0;
  1714. tp->packets_out = 0;
  1715. tp->snd_ssthresh = 0x7fffffff;
  1716. tp->snd_cwnd_cnt = 0;
  1717. tp->bytes_acked = 0;
  1718. tcp_set_ca_state(sk, TCP_CA_Open);
  1719. tcp_clear_retrans(tp);
  1720. inet_csk_delack_init(sk);
  1721. tcp_init_send_head(sk);
  1722. memset(&tp->rx_opt, 0, sizeof(tp->rx_opt));
  1723. __sk_dst_reset(sk);
  1724. WARN_ON(inet->num && !icsk->icsk_bind_hash);
  1725. sk->sk_error_report(sk);
  1726. return err;
  1727. }
  1728. /*
  1729. * Socket option code for TCP.
  1730. */
  1731. static int do_tcp_setsockopt(struct sock *sk, int level,
  1732. int optname, char __user *optval, int optlen)
  1733. {
  1734. struct tcp_sock *tp = tcp_sk(sk);
  1735. struct inet_connection_sock *icsk = inet_csk(sk);
  1736. int val;
  1737. int err = 0;
  1738. /* This is a string value all the others are int's */
  1739. if (optname == TCP_CONGESTION) {
  1740. char name[TCP_CA_NAME_MAX];
  1741. if (optlen < 1)
  1742. return -EINVAL;
  1743. val = strncpy_from_user(name, optval,
  1744. min(TCP_CA_NAME_MAX-1, optlen));
  1745. if (val < 0)
  1746. return -EFAULT;
  1747. name[val] = 0;
  1748. lock_sock(sk);
  1749. err = tcp_set_congestion_control(sk, name);
  1750. release_sock(sk);
  1751. return err;
  1752. }
  1753. if (optlen < sizeof(int))
  1754. return -EINVAL;
  1755. if (get_user(val, (int __user *)optval))
  1756. return -EFAULT;
  1757. lock_sock(sk);
  1758. switch (optname) {
  1759. case TCP_MAXSEG:
  1760. /* Values greater than interface MTU won't take effect. However
  1761. * at the point when this call is done we typically don't yet
  1762. * know which interface is going to be used */
  1763. if (val < 8 || val > MAX_TCP_WINDOW) {
  1764. err = -EINVAL;
  1765. break;
  1766. }
  1767. tp->rx_opt.user_mss = val;
  1768. break;
  1769. case TCP_NODELAY:
  1770. if (val) {
  1771. /* TCP_NODELAY is weaker than TCP_CORK, so that
  1772. * this option on corked socket is remembered, but
  1773. * it is not activated until cork is cleared.
  1774. *
  1775. * However, when TCP_NODELAY is set we make
  1776. * an explicit push, which overrides even TCP_CORK
  1777. * for currently queued segments.
  1778. */
  1779. tp->nonagle |= TCP_NAGLE_OFF|TCP_NAGLE_PUSH;
  1780. tcp_push_pending_frames(sk);
  1781. } else {
  1782. tp->nonagle &= ~TCP_NAGLE_OFF;
  1783. }
  1784. break;
  1785. case TCP_CORK:
  1786. /* When set indicates to always queue non-full frames.
  1787. * Later the user clears this option and we transmit
  1788. * any pending partial frames in the queue. This is
  1789. * meant to be used alongside sendfile() to get properly
  1790. * filled frames when the user (for example) must write
  1791. * out headers with a write() call first and then use
  1792. * sendfile to send out the data parts.
  1793. *
  1794. * TCP_CORK can be set together with TCP_NODELAY and it is
  1795. * stronger than TCP_NODELAY.
  1796. */
  1797. if (val) {
  1798. tp->nonagle |= TCP_NAGLE_CORK;
  1799. } else {
  1800. tp->nonagle &= ~TCP_NAGLE_CORK;
  1801. if (tp->nonagle&TCP_NAGLE_OFF)
  1802. tp->nonagle |= TCP_NAGLE_PUSH;
  1803. tcp_push_pending_frames(sk);
  1804. }
  1805. break;
  1806. case TCP_KEEPIDLE:
  1807. if (val < 1 || val > MAX_TCP_KEEPIDLE)
  1808. err = -EINVAL;
  1809. else {
  1810. tp->keepalive_time = val * HZ;
  1811. if (sock_flag(sk, SOCK_KEEPOPEN) &&
  1812. !((1 << sk->sk_state) &
  1813. (TCPF_CLOSE | TCPF_LISTEN))) {
  1814. __u32 elapsed = tcp_time_stamp - tp->rcv_tstamp;
  1815. if (tp->keepalive_time > elapsed)
  1816. elapsed = tp->keepalive_time - elapsed;
  1817. else
  1818. elapsed = 0;
  1819. inet_csk_reset_keepalive_timer(sk, elapsed);
  1820. }
  1821. }
  1822. break;
  1823. case TCP_KEEPINTVL:
  1824. if (val < 1 || val > MAX_TCP_KEEPINTVL)
  1825. err = -EINVAL;
  1826. else
  1827. tp->keepalive_intvl = val * HZ;
  1828. break;
  1829. case TCP_KEEPCNT:
  1830. if (val < 1 || val > MAX_TCP_KEEPCNT)
  1831. err = -EINVAL;
  1832. else
  1833. tp->keepalive_probes = val;
  1834. break;
  1835. case TCP_SYNCNT:
  1836. if (val < 1 || val > MAX_TCP_SYNCNT)
  1837. err = -EINVAL;
  1838. else
  1839. icsk->icsk_syn_retries = val;
  1840. break;
  1841. case TCP_LINGER2:
  1842. if (val < 0)
  1843. tp->linger2 = -1;
  1844. else if (val > sysctl_tcp_fin_timeout / HZ)
  1845. tp->linger2 = 0;
  1846. else
  1847. tp->linger2 = val * HZ;
  1848. break;
  1849. case TCP_DEFER_ACCEPT:
  1850. icsk->icsk_accept_queue.rskq_defer_accept = 0;
  1851. if (val > 0) {
  1852. /* Translate value in seconds to number of
  1853. * retransmits */
  1854. while (icsk->icsk_accept_queue.rskq_defer_accept < 32 &&
  1855. val > ((TCP_TIMEOUT_INIT / HZ) <<
  1856. icsk->icsk_accept_queue.rskq_defer_accept))
  1857. icsk->icsk_accept_queue.rskq_defer_accept++;
  1858. icsk->icsk_accept_queue.rskq_defer_accept++;
  1859. }
  1860. break;
  1861. case TCP_WINDOW_CLAMP:
  1862. if (!val) {
  1863. if (sk->sk_state != TCP_CLOSE) {
  1864. err = -EINVAL;
  1865. break;
  1866. }
  1867. tp->window_clamp = 0;
  1868. } else
  1869. tp->window_clamp = val < SOCK_MIN_RCVBUF / 2 ?
  1870. SOCK_MIN_RCVBUF / 2 : val;
  1871. break;
  1872. case TCP_QUICKACK:
  1873. if (!val) {
  1874. icsk->icsk_ack.pingpong = 1;
  1875. } else {
  1876. icsk->icsk_ack.pingpong = 0;
  1877. if ((1 << sk->sk_state) &
  1878. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT) &&
  1879. inet_csk_ack_scheduled(sk)) {
  1880. icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
  1881. tcp_cleanup_rbuf(sk, 1);
  1882. if (!(val & 1))
  1883. icsk->icsk_ack.pingpong = 1;
  1884. }
  1885. }
  1886. break;
  1887. #ifdef CONFIG_TCP_MD5SIG
  1888. case TCP_MD5SIG:
  1889. /* Read the IP->Key mappings from userspace */
  1890. err = tp->af_specific->md5_parse(sk, optval, optlen);
  1891. break;
  1892. #endif
  1893. default:
  1894. err = -ENOPROTOOPT;
  1895. break;
  1896. }
  1897. release_sock(sk);
  1898. return err;
  1899. }
  1900. int tcp_setsockopt(struct sock *sk, int level, int optname, char __user *optval,
  1901. int optlen)
  1902. {
  1903. struct inet_connection_sock *icsk = inet_csk(sk);
  1904. if (level != SOL_TCP)
  1905. return icsk->icsk_af_ops->setsockopt(sk, level, optname,
  1906. optval, optlen);
  1907. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  1908. }
  1909. #ifdef CONFIG_COMPAT
  1910. int compat_tcp_setsockopt(struct sock *sk, int level, int optname,
  1911. char __user *optval, int optlen)
  1912. {
  1913. if (level != SOL_TCP)
  1914. return inet_csk_compat_setsockopt(sk, level, optname,
  1915. optval, optlen);
  1916. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  1917. }
  1918. EXPORT_SYMBOL(compat_tcp_setsockopt);
  1919. #endif
  1920. /* Return information about state of tcp endpoint in API format. */
  1921. void tcp_get_info(struct sock *sk, struct tcp_info *info)
  1922. {
  1923. struct tcp_sock *tp = tcp_sk(sk);
  1924. const struct inet_connection_sock *icsk = inet_csk(sk);
  1925. u32 now = tcp_time_stamp;
  1926. memset(info, 0, sizeof(*info));
  1927. info->tcpi_state = sk->sk_state;
  1928. info->tcpi_ca_state = icsk->icsk_ca_state;
  1929. info->tcpi_retransmits = icsk->icsk_retransmits;
  1930. info->tcpi_probes = icsk->icsk_probes_out;
  1931. info->tcpi_backoff = icsk->icsk_backoff;
  1932. if (tp->rx_opt.tstamp_ok)
  1933. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  1934. if (tcp_is_sack(tp))
  1935. info->tcpi_options |= TCPI_OPT_SACK;
  1936. if (tp->rx_opt.wscale_ok) {
  1937. info->tcpi_options |= TCPI_OPT_WSCALE;
  1938. info->tcpi_snd_wscale = tp->rx_opt.snd_wscale;
  1939. info->tcpi_rcv_wscale = tp->rx_opt.rcv_wscale;
  1940. }
  1941. if (tp->ecn_flags&TCP_ECN_OK)
  1942. info->tcpi_options |= TCPI_OPT_ECN;
  1943. info->tcpi_rto = jiffies_to_usecs(icsk->icsk_rto);
  1944. info->tcpi_ato = jiffies_to_usecs(icsk->icsk_ack.ato);
  1945. info->tcpi_snd_mss = tp->mss_cache;
  1946. info->tcpi_rcv_mss = icsk->icsk_ack.rcv_mss;
  1947. if (sk->sk_state == TCP_LISTEN) {
  1948. info->tcpi_unacked = sk->sk_ack_backlog;
  1949. info->tcpi_sacked = sk->sk_max_ack_backlog;
  1950. } else {
  1951. info->tcpi_unacked = tp->packets_out;
  1952. info->tcpi_sacked = tp->sacked_out;
  1953. }
  1954. info->tcpi_lost = tp->lost_out;
  1955. info->tcpi_retrans = tp->retrans_out;
  1956. info->tcpi_fackets = tp->fackets_out;
  1957. info->tcpi_last_data_sent = jiffies_to_msecs(now - tp->lsndtime);
  1958. info->tcpi_last_data_recv = jiffies_to_msecs(now - icsk->icsk_ack.lrcvtime);
  1959. info->tcpi_last_ack_recv = jiffies_to_msecs(now - tp->rcv_tstamp);
  1960. info->tcpi_pmtu = icsk->icsk_pmtu_cookie;
  1961. info->tcpi_rcv_ssthresh = tp->rcv_ssthresh;
  1962. info->tcpi_rtt = jiffies_to_usecs(tp->srtt)>>3;
  1963. info->tcpi_rttvar = jiffies_to_usecs(tp->mdev)>>2;
  1964. info->tcpi_snd_ssthresh = tp->snd_ssthresh;
  1965. info->tcpi_snd_cwnd = tp->snd_cwnd;
  1966. info->tcpi_advmss = tp->advmss;
  1967. info->tcpi_reordering = tp->reordering;
  1968. info->tcpi_rcv_rtt = jiffies_to_usecs(tp->rcv_rtt_est.rtt)>>3;
  1969. info->tcpi_rcv_space = tp->rcvq_space.space;
  1970. info->tcpi_total_retrans = tp->total_retrans;
  1971. }
  1972. EXPORT_SYMBOL_GPL(tcp_get_info);
  1973. static int do_tcp_getsockopt(struct sock *sk, int level,
  1974. int optname, char __user *optval, int __user *optlen)
  1975. {
  1976. struct inet_connection_sock *icsk = inet_csk(sk);
  1977. struct tcp_sock *tp = tcp_sk(sk);
  1978. int val, len;
  1979. if (get_user(len, optlen))
  1980. return -EFAULT;
  1981. len = min_t(unsigned int, len, sizeof(int));
  1982. if (len < 0)
  1983. return -EINVAL;
  1984. switch (optname) {
  1985. case TCP_MAXSEG:
  1986. val = tp->mss_cache;
  1987. if (!val && ((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_LISTEN)))
  1988. val = tp->rx_opt.user_mss;
  1989. break;
  1990. case TCP_NODELAY:
  1991. val = !!(tp->nonagle&TCP_NAGLE_OFF);
  1992. break;
  1993. case TCP_CORK:
  1994. val = !!(tp->nonagle&TCP_NAGLE_CORK);
  1995. break;
  1996. case TCP_KEEPIDLE:
  1997. val = (tp->keepalive_time ? : sysctl_tcp_keepalive_time) / HZ;
  1998. break;
  1999. case TCP_KEEPINTVL:
  2000. val = (tp->keepalive_intvl ? : sysctl_tcp_keepalive_intvl) / HZ;
  2001. break;
  2002. case TCP_KEEPCNT:
  2003. val = tp->keepalive_probes ? : sysctl_tcp_keepalive_probes;
  2004. break;
  2005. case TCP_SYNCNT:
  2006. val = icsk->icsk_syn_retries ? : sysctl_tcp_syn_retries;
  2007. break;
  2008. case TCP_LINGER2:
  2009. val = tp->linger2;
  2010. if (val >= 0)
  2011. val = (val ? : sysctl_tcp_fin_timeout) / HZ;
  2012. break;
  2013. case TCP_DEFER_ACCEPT:
  2014. val = !icsk->icsk_accept_queue.rskq_defer_accept ? 0 :
  2015. ((TCP_TIMEOUT_INIT / HZ) << (icsk->icsk_accept_queue.rskq_defer_accept - 1));
  2016. break;
  2017. case TCP_WINDOW_CLAMP:
  2018. val = tp->window_clamp;
  2019. break;
  2020. case TCP_INFO: {
  2021. struct tcp_info info;
  2022. if (get_user(len, optlen))
  2023. return -EFAULT;
  2024. tcp_get_info(sk, &info);
  2025. len = min_t(unsigned int, len, sizeof(info));
  2026. if (put_user(len, optlen))
  2027. return -EFAULT;
  2028. if (copy_to_user(optval, &info, len))
  2029. return -EFAULT;
  2030. return 0;
  2031. }
  2032. case TCP_QUICKACK:
  2033. val = !icsk->icsk_ack.pingpong;
  2034. break;
  2035. case TCP_CONGESTION:
  2036. if (get_user(len, optlen))
  2037. return -EFAULT;
  2038. len = min_t(unsigned int, len, TCP_CA_NAME_MAX);
  2039. if (put_user(len, optlen))
  2040. return -EFAULT;
  2041. if (copy_to_user(optval, icsk->icsk_ca_ops->name, len))
  2042. return -EFAULT;
  2043. return 0;
  2044. default:
  2045. return -ENOPROTOOPT;
  2046. }
  2047. if (put_user(len, optlen))
  2048. return -EFAULT;
  2049. if (copy_to_user(optval, &val, len))
  2050. return -EFAULT;
  2051. return 0;
  2052. }
  2053. int tcp_getsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2054. int __user *optlen)
  2055. {
  2056. struct inet_connection_sock *icsk = inet_csk(sk);
  2057. if (level != SOL_TCP)
  2058. return icsk->icsk_af_ops->getsockopt(sk, level, optname,
  2059. optval, optlen);
  2060. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2061. }
  2062. #ifdef CONFIG_COMPAT
  2063. int compat_tcp_getsockopt(struct sock *sk, int level, int optname,
  2064. char __user *optval, int __user *optlen)
  2065. {
  2066. if (level != SOL_TCP)
  2067. return inet_csk_compat_getsockopt(sk, level, optname,
  2068. optval, optlen);
  2069. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2070. }
  2071. EXPORT_SYMBOL(compat_tcp_getsockopt);
  2072. #endif
  2073. struct sk_buff *tcp_tso_segment(struct sk_buff *skb, int features)
  2074. {
  2075. struct sk_buff *segs = ERR_PTR(-EINVAL);
  2076. struct tcphdr *th;
  2077. unsigned thlen;
  2078. unsigned int seq;
  2079. __be32 delta;
  2080. unsigned int oldlen;
  2081. unsigned int mss;
  2082. if (!pskb_may_pull(skb, sizeof(*th)))
  2083. goto out;
  2084. th = tcp_hdr(skb);
  2085. thlen = th->doff * 4;
  2086. if (thlen < sizeof(*th))
  2087. goto out;
  2088. if (!pskb_may_pull(skb, thlen))
  2089. goto out;
  2090. oldlen = (u16)~skb->len;
  2091. __skb_pull(skb, thlen);
  2092. mss = skb_shinfo(skb)->gso_size;
  2093. if (unlikely(skb->len <= mss))
  2094. goto out;
  2095. if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
  2096. /* Packet is from an untrusted source, reset gso_segs. */
  2097. int type = skb_shinfo(skb)->gso_type;
  2098. if (unlikely(type &
  2099. ~(SKB_GSO_TCPV4 |
  2100. SKB_GSO_DODGY |
  2101. SKB_GSO_TCP_ECN |
  2102. SKB_GSO_TCPV6 |
  2103. 0) ||
  2104. !(type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6))))
  2105. goto out;
  2106. skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
  2107. segs = NULL;
  2108. goto out;
  2109. }
  2110. segs = skb_segment(skb, features);
  2111. if (IS_ERR(segs))
  2112. goto out;
  2113. delta = htonl(oldlen + (thlen + mss));
  2114. skb = segs;
  2115. th = tcp_hdr(skb);
  2116. seq = ntohl(th->seq);
  2117. do {
  2118. th->fin = th->psh = 0;
  2119. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2120. (__force u32)delta));
  2121. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2122. th->check =
  2123. csum_fold(csum_partial(skb_transport_header(skb),
  2124. thlen, skb->csum));
  2125. seq += mss;
  2126. skb = skb->next;
  2127. th = tcp_hdr(skb);
  2128. th->seq = htonl(seq);
  2129. th->cwr = 0;
  2130. } while (skb->next);
  2131. delta = htonl(oldlen + (skb->tail - skb->transport_header) +
  2132. skb->data_len);
  2133. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2134. (__force u32)delta));
  2135. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2136. th->check = csum_fold(csum_partial(skb_transport_header(skb),
  2137. thlen, skb->csum));
  2138. out:
  2139. return segs;
  2140. }
  2141. EXPORT_SYMBOL(tcp_tso_segment);
  2142. struct sk_buff **tcp_gro_receive(struct sk_buff **head, struct sk_buff *skb)
  2143. {
  2144. struct sk_buff **pp = NULL;
  2145. struct sk_buff *p;
  2146. struct tcphdr *th;
  2147. struct tcphdr *th2;
  2148. unsigned int thlen;
  2149. unsigned int flags;
  2150. unsigned int total;
  2151. unsigned int mss = 1;
  2152. int flush = 1;
  2153. if (!pskb_may_pull(skb, sizeof(*th)))
  2154. goto out;
  2155. th = tcp_hdr(skb);
  2156. thlen = th->doff * 4;
  2157. if (thlen < sizeof(*th))
  2158. goto out;
  2159. if (!pskb_may_pull(skb, thlen))
  2160. goto out;
  2161. th = tcp_hdr(skb);
  2162. __skb_pull(skb, thlen);
  2163. flags = tcp_flag_word(th);
  2164. for (; (p = *head); head = &p->next) {
  2165. if (!NAPI_GRO_CB(p)->same_flow)
  2166. continue;
  2167. th2 = tcp_hdr(p);
  2168. if (th->source != th2->source || th->dest != th2->dest) {
  2169. NAPI_GRO_CB(p)->same_flow = 0;
  2170. continue;
  2171. }
  2172. goto found;
  2173. }
  2174. goto out_check_final;
  2175. found:
  2176. flush = NAPI_GRO_CB(p)->flush;
  2177. flush |= flags & TCP_FLAG_CWR;
  2178. flush |= (flags ^ tcp_flag_word(th2)) &
  2179. ~(TCP_FLAG_CWR | TCP_FLAG_FIN | TCP_FLAG_PSH);
  2180. flush |= th->ack_seq != th2->ack_seq || th->window != th2->window;
  2181. flush |= memcmp(th + 1, th2 + 1, thlen - sizeof(*th));
  2182. total = p->len;
  2183. mss = skb_shinfo(p)->gso_size;
  2184. flush |= skb->len > mss || skb->len <= 0;
  2185. flush |= ntohl(th2->seq) + total != ntohl(th->seq);
  2186. if (flush || skb_gro_receive(head, skb)) {
  2187. mss = 1;
  2188. goto out_check_final;
  2189. }
  2190. p = *head;
  2191. th2 = tcp_hdr(p);
  2192. tcp_flag_word(th2) |= flags & (TCP_FLAG_FIN | TCP_FLAG_PSH);
  2193. out_check_final:
  2194. flush = skb->len < mss;
  2195. flush |= flags & (TCP_FLAG_URG | TCP_FLAG_PSH | TCP_FLAG_RST |
  2196. TCP_FLAG_SYN | TCP_FLAG_FIN);
  2197. if (p && (!NAPI_GRO_CB(skb)->same_flow || flush))
  2198. pp = head;
  2199. out:
  2200. NAPI_GRO_CB(skb)->flush |= flush;
  2201. return pp;
  2202. }
  2203. EXPORT_SYMBOL(tcp_gro_receive);
  2204. int tcp_gro_complete(struct sk_buff *skb)
  2205. {
  2206. struct tcphdr *th = tcp_hdr(skb);
  2207. skb->csum_start = skb_transport_header(skb) - skb->head;
  2208. skb->csum_offset = offsetof(struct tcphdr, check);
  2209. skb->ip_summed = CHECKSUM_PARTIAL;
  2210. skb_shinfo(skb)->gso_segs = NAPI_GRO_CB(skb)->count;
  2211. if (th->cwr)
  2212. skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
  2213. return 0;
  2214. }
  2215. EXPORT_SYMBOL(tcp_gro_complete);
  2216. #ifdef CONFIG_TCP_MD5SIG
  2217. static unsigned long tcp_md5sig_users;
  2218. static struct tcp_md5sig_pool **tcp_md5sig_pool;
  2219. static DEFINE_SPINLOCK(tcp_md5sig_pool_lock);
  2220. static void __tcp_free_md5sig_pool(struct tcp_md5sig_pool **pool)
  2221. {
  2222. int cpu;
  2223. for_each_possible_cpu(cpu) {
  2224. struct tcp_md5sig_pool *p = *per_cpu_ptr(pool, cpu);
  2225. if (p) {
  2226. if (p->md5_desc.tfm)
  2227. crypto_free_hash(p->md5_desc.tfm);
  2228. kfree(p);
  2229. p = NULL;
  2230. }
  2231. }
  2232. free_percpu(pool);
  2233. }
  2234. void tcp_free_md5sig_pool(void)
  2235. {
  2236. struct tcp_md5sig_pool **pool = NULL;
  2237. spin_lock_bh(&tcp_md5sig_pool_lock);
  2238. if (--tcp_md5sig_users == 0) {
  2239. pool = tcp_md5sig_pool;
  2240. tcp_md5sig_pool = NULL;
  2241. }
  2242. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2243. if (pool)
  2244. __tcp_free_md5sig_pool(pool);
  2245. }
  2246. EXPORT_SYMBOL(tcp_free_md5sig_pool);
  2247. static struct tcp_md5sig_pool **__tcp_alloc_md5sig_pool(void)
  2248. {
  2249. int cpu;
  2250. struct tcp_md5sig_pool **pool;
  2251. pool = alloc_percpu(struct tcp_md5sig_pool *);
  2252. if (!pool)
  2253. return NULL;
  2254. for_each_possible_cpu(cpu) {
  2255. struct tcp_md5sig_pool *p;
  2256. struct crypto_hash *hash;
  2257. p = kzalloc(sizeof(*p), GFP_KERNEL);
  2258. if (!p)
  2259. goto out_free;
  2260. *per_cpu_ptr(pool, cpu) = p;
  2261. hash = crypto_alloc_hash("md5", 0, CRYPTO_ALG_ASYNC);
  2262. if (!hash || IS_ERR(hash))
  2263. goto out_free;
  2264. p->md5_desc.tfm = hash;
  2265. }
  2266. return pool;
  2267. out_free:
  2268. __tcp_free_md5sig_pool(pool);
  2269. return NULL;
  2270. }
  2271. struct tcp_md5sig_pool **tcp_alloc_md5sig_pool(void)
  2272. {
  2273. struct tcp_md5sig_pool **pool;
  2274. int alloc = 0;
  2275. retry:
  2276. spin_lock_bh(&tcp_md5sig_pool_lock);
  2277. pool = tcp_md5sig_pool;
  2278. if (tcp_md5sig_users++ == 0) {
  2279. alloc = 1;
  2280. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2281. } else if (!pool) {
  2282. tcp_md5sig_users--;
  2283. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2284. cpu_relax();
  2285. goto retry;
  2286. } else
  2287. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2288. if (alloc) {
  2289. /* we cannot hold spinlock here because this may sleep. */
  2290. struct tcp_md5sig_pool **p = __tcp_alloc_md5sig_pool();
  2291. spin_lock_bh(&tcp_md5sig_pool_lock);
  2292. if (!p) {
  2293. tcp_md5sig_users--;
  2294. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2295. return NULL;
  2296. }
  2297. pool = tcp_md5sig_pool;
  2298. if (pool) {
  2299. /* oops, it has already been assigned. */
  2300. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2301. __tcp_free_md5sig_pool(p);
  2302. } else {
  2303. tcp_md5sig_pool = pool = p;
  2304. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2305. }
  2306. }
  2307. return pool;
  2308. }
  2309. EXPORT_SYMBOL(tcp_alloc_md5sig_pool);
  2310. struct tcp_md5sig_pool *__tcp_get_md5sig_pool(int cpu)
  2311. {
  2312. struct tcp_md5sig_pool **p;
  2313. spin_lock_bh(&tcp_md5sig_pool_lock);
  2314. p = tcp_md5sig_pool;
  2315. if (p)
  2316. tcp_md5sig_users++;
  2317. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2318. return (p ? *per_cpu_ptr(p, cpu) : NULL);
  2319. }
  2320. EXPORT_SYMBOL(__tcp_get_md5sig_pool);
  2321. void __tcp_put_md5sig_pool(void)
  2322. {
  2323. tcp_free_md5sig_pool();
  2324. }
  2325. EXPORT_SYMBOL(__tcp_put_md5sig_pool);
  2326. int tcp_md5_hash_header(struct tcp_md5sig_pool *hp,
  2327. struct tcphdr *th)
  2328. {
  2329. struct scatterlist sg;
  2330. int err;
  2331. __sum16 old_checksum = th->check;
  2332. th->check = 0;
  2333. /* options aren't included in the hash */
  2334. sg_init_one(&sg, th, sizeof(struct tcphdr));
  2335. err = crypto_hash_update(&hp->md5_desc, &sg, sizeof(struct tcphdr));
  2336. th->check = old_checksum;
  2337. return err;
  2338. }
  2339. EXPORT_SYMBOL(tcp_md5_hash_header);
  2340. int tcp_md5_hash_skb_data(struct tcp_md5sig_pool *hp,
  2341. struct sk_buff *skb, unsigned header_len)
  2342. {
  2343. struct scatterlist sg;
  2344. const struct tcphdr *tp = tcp_hdr(skb);
  2345. struct hash_desc *desc = &hp->md5_desc;
  2346. unsigned i;
  2347. const unsigned head_data_len = skb_headlen(skb) > header_len ?
  2348. skb_headlen(skb) - header_len : 0;
  2349. const struct skb_shared_info *shi = skb_shinfo(skb);
  2350. sg_init_table(&sg, 1);
  2351. sg_set_buf(&sg, ((u8 *) tp) + header_len, head_data_len);
  2352. if (crypto_hash_update(desc, &sg, head_data_len))
  2353. return 1;
  2354. for (i = 0; i < shi->nr_frags; ++i) {
  2355. const struct skb_frag_struct *f = &shi->frags[i];
  2356. sg_set_page(&sg, f->page, f->size, f->page_offset);
  2357. if (crypto_hash_update(desc, &sg, f->size))
  2358. return 1;
  2359. }
  2360. return 0;
  2361. }
  2362. EXPORT_SYMBOL(tcp_md5_hash_skb_data);
  2363. int tcp_md5_hash_key(struct tcp_md5sig_pool *hp, struct tcp_md5sig_key *key)
  2364. {
  2365. struct scatterlist sg;
  2366. sg_init_one(&sg, key->key, key->keylen);
  2367. return crypto_hash_update(&hp->md5_desc, &sg, key->keylen);
  2368. }
  2369. EXPORT_SYMBOL(tcp_md5_hash_key);
  2370. #endif
  2371. void tcp_done(struct sock *sk)
  2372. {
  2373. if (sk->sk_state == TCP_SYN_SENT || sk->sk_state == TCP_SYN_RECV)
  2374. TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_ATTEMPTFAILS);
  2375. tcp_set_state(sk, TCP_CLOSE);
  2376. tcp_clear_xmit_timers(sk);
  2377. sk->sk_shutdown = SHUTDOWN_MASK;
  2378. if (!sock_flag(sk, SOCK_DEAD))
  2379. sk->sk_state_change(sk);
  2380. else
  2381. inet_csk_destroy_sock(sk);
  2382. }
  2383. EXPORT_SYMBOL_GPL(tcp_done);
  2384. extern struct tcp_congestion_ops tcp_reno;
  2385. static __initdata unsigned long thash_entries;
  2386. static int __init set_thash_entries(char *str)
  2387. {
  2388. if (!str)
  2389. return 0;
  2390. thash_entries = simple_strtoul(str, &str, 0);
  2391. return 1;
  2392. }
  2393. __setup("thash_entries=", set_thash_entries);
  2394. void __init tcp_init(void)
  2395. {
  2396. struct sk_buff *skb = NULL;
  2397. unsigned long nr_pages, limit;
  2398. int order, i, max_share;
  2399. BUILD_BUG_ON(sizeof(struct tcp_skb_cb) > sizeof(skb->cb));
  2400. percpu_counter_init(&tcp_sockets_allocated, 0);
  2401. percpu_counter_init(&tcp_orphan_count, 0);
  2402. tcp_hashinfo.bind_bucket_cachep =
  2403. kmem_cache_create("tcp_bind_bucket",
  2404. sizeof(struct inet_bind_bucket), 0,
  2405. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  2406. /* Size and allocate the main established and bind bucket
  2407. * hash tables.
  2408. *
  2409. * The methodology is similar to that of the buffer cache.
  2410. */
  2411. tcp_hashinfo.ehash =
  2412. alloc_large_system_hash("TCP established",
  2413. sizeof(struct inet_ehash_bucket),
  2414. thash_entries,
  2415. (num_physpages >= 128 * 1024) ?
  2416. 13 : 15,
  2417. 0,
  2418. &tcp_hashinfo.ehash_size,
  2419. NULL,
  2420. thash_entries ? 0 : 512 * 1024);
  2421. tcp_hashinfo.ehash_size = 1 << tcp_hashinfo.ehash_size;
  2422. for (i = 0; i < tcp_hashinfo.ehash_size; i++) {
  2423. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].chain, i);
  2424. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].twchain, i);
  2425. }
  2426. if (inet_ehash_locks_alloc(&tcp_hashinfo))
  2427. panic("TCP: failed to alloc ehash_locks");
  2428. tcp_hashinfo.bhash =
  2429. alloc_large_system_hash("TCP bind",
  2430. sizeof(struct inet_bind_hashbucket),
  2431. tcp_hashinfo.ehash_size,
  2432. (num_physpages >= 128 * 1024) ?
  2433. 13 : 15,
  2434. 0,
  2435. &tcp_hashinfo.bhash_size,
  2436. NULL,
  2437. 64 * 1024);
  2438. tcp_hashinfo.bhash_size = 1 << tcp_hashinfo.bhash_size;
  2439. for (i = 0; i < tcp_hashinfo.bhash_size; i++) {
  2440. spin_lock_init(&tcp_hashinfo.bhash[i].lock);
  2441. INIT_HLIST_HEAD(&tcp_hashinfo.bhash[i].chain);
  2442. }
  2443. /* Try to be a bit smarter and adjust defaults depending
  2444. * on available memory.
  2445. */
  2446. for (order = 0; ((1 << order) << PAGE_SHIFT) <
  2447. (tcp_hashinfo.bhash_size * sizeof(struct inet_bind_hashbucket));
  2448. order++)
  2449. ;
  2450. if (order >= 4) {
  2451. tcp_death_row.sysctl_max_tw_buckets = 180000;
  2452. sysctl_tcp_max_orphans = 4096 << (order - 4);
  2453. sysctl_max_syn_backlog = 1024;
  2454. } else if (order < 3) {
  2455. tcp_death_row.sysctl_max_tw_buckets >>= (3 - order);
  2456. sysctl_tcp_max_orphans >>= (3 - order);
  2457. sysctl_max_syn_backlog = 128;
  2458. }
  2459. /* Set the pressure threshold to be a fraction of global memory that
  2460. * is up to 1/2 at 256 MB, decreasing toward zero with the amount of
  2461. * memory, with a floor of 128 pages.
  2462. */
  2463. nr_pages = totalram_pages - totalhigh_pages;
  2464. limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
  2465. limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
  2466. limit = max(limit, 128UL);
  2467. sysctl_tcp_mem[0] = limit / 4 * 3;
  2468. sysctl_tcp_mem[1] = limit;
  2469. sysctl_tcp_mem[2] = sysctl_tcp_mem[0] * 2;
  2470. /* Set per-socket limits to no more than 1/128 the pressure threshold */
  2471. limit = ((unsigned long)sysctl_tcp_mem[1]) << (PAGE_SHIFT - 7);
  2472. max_share = min(4UL*1024*1024, limit);
  2473. sysctl_tcp_wmem[0] = SK_MEM_QUANTUM;
  2474. sysctl_tcp_wmem[1] = 16*1024;
  2475. sysctl_tcp_wmem[2] = max(64*1024, max_share);
  2476. sysctl_tcp_rmem[0] = SK_MEM_QUANTUM;
  2477. sysctl_tcp_rmem[1] = 87380;
  2478. sysctl_tcp_rmem[2] = max(87380, max_share);
  2479. printk(KERN_INFO "TCP: Hash tables configured "
  2480. "(established %d bind %d)\n",
  2481. tcp_hashinfo.ehash_size, tcp_hashinfo.bhash_size);
  2482. tcp_register_congestion_control(&tcp_reno);
  2483. }
  2484. EXPORT_SYMBOL(tcp_close);
  2485. EXPORT_SYMBOL(tcp_disconnect);
  2486. EXPORT_SYMBOL(tcp_getsockopt);
  2487. EXPORT_SYMBOL(tcp_ioctl);
  2488. EXPORT_SYMBOL(tcp_poll);
  2489. EXPORT_SYMBOL(tcp_read_sock);
  2490. EXPORT_SYMBOL(tcp_recvmsg);
  2491. EXPORT_SYMBOL(tcp_sendmsg);
  2492. EXPORT_SYMBOL(tcp_splice_read);
  2493. EXPORT_SYMBOL(tcp_sendpage);
  2494. EXPORT_SYMBOL(tcp_setsockopt);
  2495. EXPORT_SYMBOL(tcp_shutdown);