tcp.c 76 KB

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