tcp.c 77 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991
  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(skb && !before(tp->copied_seq, TCP_SKB_CB(skb)->end_seq),
  1036. KERN_INFO "cleanup rbuf bug: copied %X seq %X rcvnxt %X\n",
  1037. tp->copied_seq, TCP_SKB_CB(skb)->end_seq, tp->rcv_nxt);
  1038. #endif
  1039. if (inet_csk_ack_scheduled(sk)) {
  1040. const struct inet_connection_sock *icsk = inet_csk(sk);
  1041. /* Delayed ACKs frequently hit locked sockets during bulk
  1042. * receive. */
  1043. if (icsk->icsk_ack.blocked ||
  1044. /* Once-per-two-segments ACK was not sent by tcp_input.c */
  1045. tp->rcv_nxt - tp->rcv_wup > icsk->icsk_ack.rcv_mss ||
  1046. /*
  1047. * If this read emptied read buffer, we send ACK, if
  1048. * connection is not bidirectional, user drained
  1049. * receive buffer and there was a small segment
  1050. * in queue.
  1051. */
  1052. (copied > 0 &&
  1053. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED2) ||
  1054. ((icsk->icsk_ack.pending & ICSK_ACK_PUSHED) &&
  1055. !icsk->icsk_ack.pingpong)) &&
  1056. !atomic_read(&sk->sk_rmem_alloc)))
  1057. time_to_ack = 1;
  1058. }
  1059. /* We send an ACK if we can now advertise a non-zero window
  1060. * which has been raised "significantly".
  1061. *
  1062. * Even if window raised up to infinity, do not send window open ACK
  1063. * in states, where we will not receive more. It is useless.
  1064. */
  1065. if (copied > 0 && !time_to_ack && !(sk->sk_shutdown & RCV_SHUTDOWN)) {
  1066. __u32 rcv_window_now = tcp_receive_window(tp);
  1067. /* Optimize, __tcp_select_window() is not cheap. */
  1068. if (2*rcv_window_now <= tp->window_clamp) {
  1069. __u32 new_window = __tcp_select_window(sk);
  1070. /* Send ACK now, if this read freed lots of space
  1071. * in our buffer. Certainly, new_window is new window.
  1072. * We can advertise it now, if it is not less than current one.
  1073. * "Lots" means "at least twice" here.
  1074. */
  1075. if (new_window && new_window >= 2 * rcv_window_now)
  1076. time_to_ack = 1;
  1077. }
  1078. }
  1079. if (time_to_ack)
  1080. tcp_send_ack(sk);
  1081. }
  1082. static void tcp_prequeue_process(struct sock *sk)
  1083. {
  1084. struct sk_buff *skb;
  1085. struct tcp_sock *tp = tcp_sk(sk);
  1086. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPPREQUEUED);
  1087. /* RX process wants to run with disabled BHs, though it is not
  1088. * necessary */
  1089. local_bh_disable();
  1090. while ((skb = __skb_dequeue(&tp->ucopy.prequeue)) != NULL)
  1091. sk_backlog_rcv(sk, skb);
  1092. local_bh_enable();
  1093. /* Clear memory counter. */
  1094. tp->ucopy.memory = 0;
  1095. }
  1096. static inline struct sk_buff *tcp_recv_skb(struct sock *sk, u32 seq, u32 *off)
  1097. {
  1098. struct sk_buff *skb;
  1099. u32 offset;
  1100. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1101. offset = seq - TCP_SKB_CB(skb)->seq;
  1102. if (tcp_hdr(skb)->syn)
  1103. offset--;
  1104. if (offset < skb->len || tcp_hdr(skb)->fin) {
  1105. *off = offset;
  1106. return skb;
  1107. }
  1108. }
  1109. return NULL;
  1110. }
  1111. /*
  1112. * This routine provides an alternative to tcp_recvmsg() for routines
  1113. * that would like to handle copying from skbuffs directly in 'sendfile'
  1114. * fashion.
  1115. * Note:
  1116. * - It is assumed that the socket was locked by the caller.
  1117. * - The routine does not block.
  1118. * - At present, there is no support for reading OOB data
  1119. * or for 'peeking' the socket using this routine
  1120. * (although both would be easy to implement).
  1121. */
  1122. int tcp_read_sock(struct sock *sk, read_descriptor_t *desc,
  1123. sk_read_actor_t recv_actor)
  1124. {
  1125. struct sk_buff *skb;
  1126. struct tcp_sock *tp = tcp_sk(sk);
  1127. u32 seq = tp->copied_seq;
  1128. u32 offset;
  1129. int copied = 0;
  1130. if (sk->sk_state == TCP_LISTEN)
  1131. return -ENOTCONN;
  1132. while ((skb = tcp_recv_skb(sk, seq, &offset)) != NULL) {
  1133. if (offset < skb->len) {
  1134. int used;
  1135. size_t len;
  1136. len = skb->len - offset;
  1137. /* Stop reading if we hit a patch of urgent data */
  1138. if (tp->urg_data) {
  1139. u32 urg_offset = tp->urg_seq - seq;
  1140. if (urg_offset < len)
  1141. len = urg_offset;
  1142. if (!len)
  1143. break;
  1144. }
  1145. used = recv_actor(desc, skb, offset, len);
  1146. if (used < 0) {
  1147. if (!copied)
  1148. copied = used;
  1149. break;
  1150. } else if (used <= len) {
  1151. seq += used;
  1152. copied += used;
  1153. offset += used;
  1154. }
  1155. /*
  1156. * If recv_actor drops the lock (e.g. TCP splice
  1157. * receive) the skb pointer might be invalid when
  1158. * getting here: tcp_collapse might have deleted it
  1159. * while aggregating skbs from the socket queue.
  1160. */
  1161. skb = tcp_recv_skb(sk, seq-1, &offset);
  1162. if (!skb || (offset+1 != skb->len))
  1163. break;
  1164. }
  1165. if (tcp_hdr(skb)->fin) {
  1166. sk_eat_skb(sk, skb, 0);
  1167. ++seq;
  1168. break;
  1169. }
  1170. sk_eat_skb(sk, skb, 0);
  1171. if (!desc->count)
  1172. break;
  1173. }
  1174. tp->copied_seq = seq;
  1175. tcp_rcv_space_adjust(sk);
  1176. /* Clean up data we have read: This will do ACK frames. */
  1177. if (copied > 0)
  1178. tcp_cleanup_rbuf(sk, copied);
  1179. return copied;
  1180. }
  1181. /*
  1182. * This routine copies from a sock struct into the user buffer.
  1183. *
  1184. * Technical note: in 2.3 we work on _locked_ socket, so that
  1185. * tricks with *seq access order and skb->users are not required.
  1186. * Probably, code can be easily improved even more.
  1187. */
  1188. int tcp_recvmsg(struct kiocb *iocb, struct sock *sk, struct msghdr *msg,
  1189. size_t len, int nonblock, int flags, int *addr_len)
  1190. {
  1191. struct tcp_sock *tp = tcp_sk(sk);
  1192. int copied = 0;
  1193. u32 peek_seq;
  1194. u32 *seq;
  1195. unsigned long used;
  1196. int err;
  1197. int target; /* Read at least this many bytes */
  1198. long timeo;
  1199. struct task_struct *user_recv = NULL;
  1200. int copied_early = 0;
  1201. struct sk_buff *skb;
  1202. u32 urg_hole = 0;
  1203. lock_sock(sk);
  1204. TCP_CHECK_TIMER(sk);
  1205. err = -ENOTCONN;
  1206. if (sk->sk_state == TCP_LISTEN)
  1207. goto out;
  1208. timeo = sock_rcvtimeo(sk, nonblock);
  1209. /* Urgent data needs to be handled specially. */
  1210. if (flags & MSG_OOB)
  1211. goto recv_urg;
  1212. seq = &tp->copied_seq;
  1213. if (flags & MSG_PEEK) {
  1214. peek_seq = tp->copied_seq;
  1215. seq = &peek_seq;
  1216. }
  1217. target = sock_rcvlowat(sk, flags & MSG_WAITALL, len);
  1218. #ifdef CONFIG_NET_DMA
  1219. tp->ucopy.dma_chan = NULL;
  1220. preempt_disable();
  1221. skb = skb_peek_tail(&sk->sk_receive_queue);
  1222. {
  1223. int available = 0;
  1224. if (skb)
  1225. available = TCP_SKB_CB(skb)->seq + skb->len - (*seq);
  1226. if ((available < target) &&
  1227. (len > sysctl_tcp_dma_copybreak) && !(flags & MSG_PEEK) &&
  1228. !sysctl_tcp_low_latency &&
  1229. dma_find_channel(DMA_MEMCPY)) {
  1230. preempt_enable_no_resched();
  1231. tp->ucopy.pinned_list =
  1232. dma_pin_iovec_pages(msg->msg_iov, len);
  1233. } else {
  1234. preempt_enable_no_resched();
  1235. }
  1236. }
  1237. #endif
  1238. do {
  1239. u32 offset;
  1240. /* Are we at urgent data? Stop if we have read anything or have SIGURG pending. */
  1241. if (tp->urg_data && tp->urg_seq == *seq) {
  1242. if (copied)
  1243. break;
  1244. if (signal_pending(current)) {
  1245. copied = timeo ? sock_intr_errno(timeo) : -EAGAIN;
  1246. break;
  1247. }
  1248. }
  1249. /* Next get a buffer. */
  1250. skb_queue_walk(&sk->sk_receive_queue, skb) {
  1251. /* Now that we have two receive queues this
  1252. * shouldn't happen.
  1253. */
  1254. if (WARN(before(*seq, TCP_SKB_CB(skb)->seq),
  1255. KERN_INFO "recvmsg bug: copied %X "
  1256. "seq %X rcvnxt %X fl %X\n", *seq,
  1257. TCP_SKB_CB(skb)->seq, tp->rcv_nxt,
  1258. flags))
  1259. break;
  1260. offset = *seq - TCP_SKB_CB(skb)->seq;
  1261. if (tcp_hdr(skb)->syn)
  1262. offset--;
  1263. if (offset < skb->len)
  1264. goto found_ok_skb;
  1265. if (tcp_hdr(skb)->fin)
  1266. goto found_fin_ok;
  1267. WARN(!(flags & MSG_PEEK), KERN_INFO "recvmsg bug 2: "
  1268. "copied %X seq %X rcvnxt %X fl %X\n",
  1269. *seq, TCP_SKB_CB(skb)->seq,
  1270. tp->rcv_nxt, flags);
  1271. }
  1272. /* Well, if we have backlog, try to process it now yet. */
  1273. if (copied >= target && !sk->sk_backlog.tail)
  1274. break;
  1275. if (copied) {
  1276. if (sk->sk_err ||
  1277. sk->sk_state == TCP_CLOSE ||
  1278. (sk->sk_shutdown & RCV_SHUTDOWN) ||
  1279. !timeo ||
  1280. signal_pending(current))
  1281. break;
  1282. } else {
  1283. if (sock_flag(sk, SOCK_DONE))
  1284. break;
  1285. if (sk->sk_err) {
  1286. copied = sock_error(sk);
  1287. break;
  1288. }
  1289. if (sk->sk_shutdown & RCV_SHUTDOWN)
  1290. break;
  1291. if (sk->sk_state == TCP_CLOSE) {
  1292. if (!sock_flag(sk, SOCK_DONE)) {
  1293. /* This occurs when user tries to read
  1294. * from never connected socket.
  1295. */
  1296. copied = -ENOTCONN;
  1297. break;
  1298. }
  1299. break;
  1300. }
  1301. if (!timeo) {
  1302. copied = -EAGAIN;
  1303. break;
  1304. }
  1305. if (signal_pending(current)) {
  1306. copied = sock_intr_errno(timeo);
  1307. break;
  1308. }
  1309. }
  1310. tcp_cleanup_rbuf(sk, copied);
  1311. if (!sysctl_tcp_low_latency && tp->ucopy.task == user_recv) {
  1312. /* Install new reader */
  1313. if (!user_recv && !(flags & (MSG_TRUNC | MSG_PEEK))) {
  1314. user_recv = current;
  1315. tp->ucopy.task = user_recv;
  1316. tp->ucopy.iov = msg->msg_iov;
  1317. }
  1318. tp->ucopy.len = len;
  1319. WARN_ON(tp->copied_seq != tp->rcv_nxt &&
  1320. !(flags & (MSG_PEEK | MSG_TRUNC)));
  1321. /* Ugly... If prequeue is not empty, we have to
  1322. * process it before releasing socket, otherwise
  1323. * order will be broken at second iteration.
  1324. * More elegant solution is required!!!
  1325. *
  1326. * Look: we have the following (pseudo)queues:
  1327. *
  1328. * 1. packets in flight
  1329. * 2. backlog
  1330. * 3. prequeue
  1331. * 4. receive_queue
  1332. *
  1333. * Each queue can be processed only if the next ones
  1334. * are empty. At this point we have empty receive_queue.
  1335. * But prequeue _can_ be not empty after 2nd iteration,
  1336. * when we jumped to start of loop because backlog
  1337. * processing added something to receive_queue.
  1338. * We cannot release_sock(), because backlog contains
  1339. * packets arrived _after_ prequeued ones.
  1340. *
  1341. * Shortly, algorithm is clear --- to process all
  1342. * the queues in order. We could make it more directly,
  1343. * requeueing packets from backlog to prequeue, if
  1344. * is not empty. It is more elegant, but eats cycles,
  1345. * unfortunately.
  1346. */
  1347. if (!skb_queue_empty(&tp->ucopy.prequeue))
  1348. goto do_prequeue;
  1349. /* __ Set realtime policy in scheduler __ */
  1350. }
  1351. if (copied >= target) {
  1352. /* Do not sleep, just process backlog. */
  1353. release_sock(sk);
  1354. lock_sock(sk);
  1355. } else
  1356. sk_wait_data(sk, &timeo);
  1357. #ifdef CONFIG_NET_DMA
  1358. tp->ucopy.wakeup = 0;
  1359. #endif
  1360. if (user_recv) {
  1361. int chunk;
  1362. /* __ Restore normal policy in scheduler __ */
  1363. if ((chunk = len - tp->ucopy.len) != 0) {
  1364. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMBACKLOG, chunk);
  1365. len -= chunk;
  1366. copied += chunk;
  1367. }
  1368. if (tp->rcv_nxt == tp->copied_seq &&
  1369. !skb_queue_empty(&tp->ucopy.prequeue)) {
  1370. do_prequeue:
  1371. tcp_prequeue_process(sk);
  1372. if ((chunk = len - tp->ucopy.len) != 0) {
  1373. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1374. len -= chunk;
  1375. copied += chunk;
  1376. }
  1377. }
  1378. }
  1379. if ((flags & MSG_PEEK) &&
  1380. (peek_seq - copied - urg_hole != tp->copied_seq)) {
  1381. if (net_ratelimit())
  1382. printk(KERN_DEBUG "TCP(%s:%d): Application bug, race in MSG_PEEK.\n",
  1383. current->comm, task_pid_nr(current));
  1384. peek_seq = tp->copied_seq;
  1385. }
  1386. continue;
  1387. found_ok_skb:
  1388. /* Ok so how much can we use? */
  1389. used = skb->len - offset;
  1390. if (len < used)
  1391. used = len;
  1392. /* Do we have urgent data here? */
  1393. if (tp->urg_data) {
  1394. u32 urg_offset = tp->urg_seq - *seq;
  1395. if (urg_offset < used) {
  1396. if (!urg_offset) {
  1397. if (!sock_flag(sk, SOCK_URGINLINE)) {
  1398. ++*seq;
  1399. urg_hole++;
  1400. offset++;
  1401. used--;
  1402. if (!used)
  1403. goto skip_copy;
  1404. }
  1405. } else
  1406. used = urg_offset;
  1407. }
  1408. }
  1409. if (!(flags & MSG_TRUNC)) {
  1410. #ifdef CONFIG_NET_DMA
  1411. if (!tp->ucopy.dma_chan && tp->ucopy.pinned_list)
  1412. tp->ucopy.dma_chan = dma_find_channel(DMA_MEMCPY);
  1413. if (tp->ucopy.dma_chan) {
  1414. tp->ucopy.dma_cookie = dma_skb_copy_datagram_iovec(
  1415. tp->ucopy.dma_chan, skb, offset,
  1416. msg->msg_iov, used,
  1417. tp->ucopy.pinned_list);
  1418. if (tp->ucopy.dma_cookie < 0) {
  1419. printk(KERN_ALERT "dma_cookie < 0\n");
  1420. /* Exception. Bailout! */
  1421. if (!copied)
  1422. copied = -EFAULT;
  1423. break;
  1424. }
  1425. if ((offset + used) == skb->len)
  1426. copied_early = 1;
  1427. } else
  1428. #endif
  1429. {
  1430. err = skb_copy_datagram_iovec(skb, offset,
  1431. msg->msg_iov, used);
  1432. if (err) {
  1433. /* Exception. Bailout! */
  1434. if (!copied)
  1435. copied = -EFAULT;
  1436. break;
  1437. }
  1438. }
  1439. }
  1440. *seq += used;
  1441. copied += used;
  1442. len -= used;
  1443. tcp_rcv_space_adjust(sk);
  1444. skip_copy:
  1445. if (tp->urg_data && after(tp->copied_seq, tp->urg_seq)) {
  1446. tp->urg_data = 0;
  1447. tcp_fast_path_check(sk);
  1448. }
  1449. if (used + offset < skb->len)
  1450. continue;
  1451. if (tcp_hdr(skb)->fin)
  1452. goto found_fin_ok;
  1453. if (!(flags & MSG_PEEK)) {
  1454. sk_eat_skb(sk, skb, copied_early);
  1455. copied_early = 0;
  1456. }
  1457. continue;
  1458. found_fin_ok:
  1459. /* Process the FIN. */
  1460. ++*seq;
  1461. if (!(flags & MSG_PEEK)) {
  1462. sk_eat_skb(sk, skb, copied_early);
  1463. copied_early = 0;
  1464. }
  1465. break;
  1466. } while (len > 0);
  1467. if (user_recv) {
  1468. if (!skb_queue_empty(&tp->ucopy.prequeue)) {
  1469. int chunk;
  1470. tp->ucopy.len = copied > 0 ? len : 0;
  1471. tcp_prequeue_process(sk);
  1472. if (copied > 0 && (chunk = len - tp->ucopy.len) != 0) {
  1473. NET_ADD_STATS_USER(sock_net(sk), LINUX_MIB_TCPDIRECTCOPYFROMPREQUEUE, chunk);
  1474. len -= chunk;
  1475. copied += chunk;
  1476. }
  1477. }
  1478. tp->ucopy.task = NULL;
  1479. tp->ucopy.len = 0;
  1480. }
  1481. #ifdef CONFIG_NET_DMA
  1482. if (tp->ucopy.dma_chan) {
  1483. dma_cookie_t done, used;
  1484. dma_async_memcpy_issue_pending(tp->ucopy.dma_chan);
  1485. while (dma_async_memcpy_complete(tp->ucopy.dma_chan,
  1486. tp->ucopy.dma_cookie, &done,
  1487. &used) == DMA_IN_PROGRESS) {
  1488. /* do partial cleanup of sk_async_wait_queue */
  1489. while ((skb = skb_peek(&sk->sk_async_wait_queue)) &&
  1490. (dma_async_is_complete(skb->dma_cookie, done,
  1491. used) == DMA_SUCCESS)) {
  1492. __skb_dequeue(&sk->sk_async_wait_queue);
  1493. kfree_skb(skb);
  1494. }
  1495. }
  1496. /* Safe to free early-copied skbs now */
  1497. __skb_queue_purge(&sk->sk_async_wait_queue);
  1498. tp->ucopy.dma_chan = NULL;
  1499. }
  1500. if (tp->ucopy.pinned_list) {
  1501. dma_unpin_iovec_pages(tp->ucopy.pinned_list);
  1502. tp->ucopy.pinned_list = NULL;
  1503. }
  1504. #endif
  1505. /* According to UNIX98, msg_name/msg_namelen are ignored
  1506. * on connected socket. I was just happy when found this 8) --ANK
  1507. */
  1508. /* Clean up data we have read: This will do ACK frames. */
  1509. tcp_cleanup_rbuf(sk, copied);
  1510. TCP_CHECK_TIMER(sk);
  1511. release_sock(sk);
  1512. return copied;
  1513. out:
  1514. TCP_CHECK_TIMER(sk);
  1515. release_sock(sk);
  1516. return err;
  1517. recv_urg:
  1518. err = tcp_recv_urg(sk, msg, len, flags);
  1519. goto out;
  1520. }
  1521. void tcp_set_state(struct sock *sk, int state)
  1522. {
  1523. int oldstate = sk->sk_state;
  1524. switch (state) {
  1525. case TCP_ESTABLISHED:
  1526. if (oldstate != TCP_ESTABLISHED)
  1527. TCP_INC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1528. break;
  1529. case TCP_CLOSE:
  1530. if (oldstate == TCP_CLOSE_WAIT || oldstate == TCP_ESTABLISHED)
  1531. TCP_INC_STATS(sock_net(sk), TCP_MIB_ESTABRESETS);
  1532. sk->sk_prot->unhash(sk);
  1533. if (inet_csk(sk)->icsk_bind_hash &&
  1534. !(sk->sk_userlocks & SOCK_BINDPORT_LOCK))
  1535. inet_put_port(sk);
  1536. /* fall through */
  1537. default:
  1538. if (oldstate == TCP_ESTABLISHED)
  1539. TCP_DEC_STATS(sock_net(sk), TCP_MIB_CURRESTAB);
  1540. }
  1541. /* Change state AFTER socket is unhashed to avoid closed
  1542. * socket sitting in hash tables.
  1543. */
  1544. sk->sk_state = state;
  1545. #ifdef STATE_TRACE
  1546. SOCK_DEBUG(sk, "TCP sk=%p, State %s -> %s\n", sk, statename[oldstate], statename[state]);
  1547. #endif
  1548. }
  1549. EXPORT_SYMBOL_GPL(tcp_set_state);
  1550. /*
  1551. * State processing on a close. This implements the state shift for
  1552. * sending our FIN frame. Note that we only send a FIN for some
  1553. * states. A shutdown() may have already sent the FIN, or we may be
  1554. * closed.
  1555. */
  1556. static const unsigned char new_state[16] = {
  1557. /* current state: new state: action: */
  1558. /* (Invalid) */ TCP_CLOSE,
  1559. /* TCP_ESTABLISHED */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1560. /* TCP_SYN_SENT */ TCP_CLOSE,
  1561. /* TCP_SYN_RECV */ TCP_FIN_WAIT1 | TCP_ACTION_FIN,
  1562. /* TCP_FIN_WAIT1 */ TCP_FIN_WAIT1,
  1563. /* TCP_FIN_WAIT2 */ TCP_FIN_WAIT2,
  1564. /* TCP_TIME_WAIT */ TCP_CLOSE,
  1565. /* TCP_CLOSE */ TCP_CLOSE,
  1566. /* TCP_CLOSE_WAIT */ TCP_LAST_ACK | TCP_ACTION_FIN,
  1567. /* TCP_LAST_ACK */ TCP_LAST_ACK,
  1568. /* TCP_LISTEN */ TCP_CLOSE,
  1569. /* TCP_CLOSING */ TCP_CLOSING,
  1570. };
  1571. static int tcp_close_state(struct sock *sk)
  1572. {
  1573. int next = (int)new_state[sk->sk_state];
  1574. int ns = next & TCP_STATE_MASK;
  1575. tcp_set_state(sk, ns);
  1576. return next & TCP_ACTION_FIN;
  1577. }
  1578. /*
  1579. * Shutdown the sending side of a connection. Much like close except
  1580. * that we don't receive shut down or sock_set_flag(sk, SOCK_DEAD).
  1581. */
  1582. void tcp_shutdown(struct sock *sk, int how)
  1583. {
  1584. /* We need to grab some memory, and put together a FIN,
  1585. * and then put it into the queue to be sent.
  1586. * Tim MacKenzie(tym@dibbler.cs.monash.edu.au) 4 Dec '92.
  1587. */
  1588. if (!(how & SEND_SHUTDOWN))
  1589. return;
  1590. /* If we've already sent a FIN, or it's a closed state, skip this. */
  1591. if ((1 << sk->sk_state) &
  1592. (TCPF_ESTABLISHED | TCPF_SYN_SENT |
  1593. TCPF_SYN_RECV | TCPF_CLOSE_WAIT)) {
  1594. /* Clear out any half completed packets. FIN if needed. */
  1595. if (tcp_close_state(sk))
  1596. tcp_send_fin(sk);
  1597. }
  1598. }
  1599. void tcp_close(struct sock *sk, long timeout)
  1600. {
  1601. struct sk_buff *skb;
  1602. int data_was_unread = 0;
  1603. int state;
  1604. lock_sock(sk);
  1605. sk->sk_shutdown = SHUTDOWN_MASK;
  1606. if (sk->sk_state == TCP_LISTEN) {
  1607. tcp_set_state(sk, TCP_CLOSE);
  1608. /* Special case. */
  1609. inet_csk_listen_stop(sk);
  1610. goto adjudge_to_death;
  1611. }
  1612. /* We need to flush the recv. buffs. We do this only on the
  1613. * descriptor close, not protocol-sourced closes, because the
  1614. * reader process may not have drained the data yet!
  1615. */
  1616. while ((skb = __skb_dequeue(&sk->sk_receive_queue)) != NULL) {
  1617. u32 len = TCP_SKB_CB(skb)->end_seq - TCP_SKB_CB(skb)->seq -
  1618. tcp_hdr(skb)->fin;
  1619. data_was_unread += len;
  1620. __kfree_skb(skb);
  1621. }
  1622. sk_mem_reclaim(sk);
  1623. /* As outlined in RFC 2525, section 2.17, we send a RST here because
  1624. * data was lost. To witness the awful effects of the old behavior of
  1625. * always doing a FIN, run an older 2.1.x kernel or 2.0.x, start a bulk
  1626. * GET in an FTP client, suspend the process, wait for the client to
  1627. * advertise a zero window, then kill -9 the FTP client, wheee...
  1628. * Note: timeout is always zero in such a case.
  1629. */
  1630. if (data_was_unread) {
  1631. /* Unread data was tossed, zap the connection. */
  1632. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONCLOSE);
  1633. tcp_set_state(sk, TCP_CLOSE);
  1634. tcp_send_active_reset(sk, sk->sk_allocation);
  1635. } else if (sock_flag(sk, SOCK_LINGER) && !sk->sk_lingertime) {
  1636. /* Check zero linger _after_ checking for unread data. */
  1637. sk->sk_prot->disconnect(sk, 0);
  1638. NET_INC_STATS_USER(sock_net(sk), LINUX_MIB_TCPABORTONDATA);
  1639. } else if (tcp_close_state(sk)) {
  1640. /* We FIN if the application ate all the data before
  1641. * zapping the connection.
  1642. */
  1643. /* RED-PEN. Formally speaking, we have broken TCP state
  1644. * machine. State transitions:
  1645. *
  1646. * TCP_ESTABLISHED -> TCP_FIN_WAIT1
  1647. * TCP_SYN_RECV -> TCP_FIN_WAIT1 (forget it, it's impossible)
  1648. * TCP_CLOSE_WAIT -> TCP_LAST_ACK
  1649. *
  1650. * are legal only when FIN has been sent (i.e. in window),
  1651. * rather than queued out of window. Purists blame.
  1652. *
  1653. * F.e. "RFC state" is ESTABLISHED,
  1654. * if Linux state is FIN-WAIT-1, but FIN is still not sent.
  1655. *
  1656. * The visible declinations are that sometimes
  1657. * we enter time-wait state, when it is not required really
  1658. * (harmless), do not send active resets, when they are
  1659. * required by specs (TCP_ESTABLISHED, TCP_CLOSE_WAIT, when
  1660. * they look as CLOSING or LAST_ACK for Linux)
  1661. * Probably, I missed some more holelets.
  1662. * --ANK
  1663. */
  1664. tcp_send_fin(sk);
  1665. }
  1666. sk_stream_wait_close(sk, timeout);
  1667. adjudge_to_death:
  1668. state = sk->sk_state;
  1669. sock_hold(sk);
  1670. sock_orphan(sk);
  1671. /* It is the last release_sock in its life. It will remove backlog. */
  1672. release_sock(sk);
  1673. /* Now socket is owned by kernel and we acquire BH lock
  1674. to finish close. No need to check for user refs.
  1675. */
  1676. local_bh_disable();
  1677. bh_lock_sock(sk);
  1678. WARN_ON(sock_owned_by_user(sk));
  1679. percpu_counter_inc(sk->sk_prot->orphan_count);
  1680. /* Have we already been destroyed by a softirq or backlog? */
  1681. if (state != TCP_CLOSE && sk->sk_state == TCP_CLOSE)
  1682. goto out;
  1683. /* This is a (useful) BSD violating of the RFC. There is a
  1684. * problem with TCP as specified in that the other end could
  1685. * keep a socket open forever with no application left this end.
  1686. * We use a 3 minute timeout (about the same as BSD) then kill
  1687. * our end. If they send after that then tough - BUT: long enough
  1688. * that we won't make the old 4*rto = almost no time - whoops
  1689. * reset mistake.
  1690. *
  1691. * Nope, it was not mistake. It is really desired behaviour
  1692. * f.e. on http servers, when such sockets are useless, but
  1693. * consume significant resources. Let's do it with special
  1694. * linger2 option. --ANK
  1695. */
  1696. if (sk->sk_state == TCP_FIN_WAIT2) {
  1697. struct tcp_sock *tp = tcp_sk(sk);
  1698. if (tp->linger2 < 0) {
  1699. tcp_set_state(sk, TCP_CLOSE);
  1700. tcp_send_active_reset(sk, GFP_ATOMIC);
  1701. NET_INC_STATS_BH(sock_net(sk),
  1702. LINUX_MIB_TCPABORTONLINGER);
  1703. } else {
  1704. const int tmo = tcp_fin_time(sk);
  1705. if (tmo > TCP_TIMEWAIT_LEN) {
  1706. inet_csk_reset_keepalive_timer(sk,
  1707. tmo - TCP_TIMEWAIT_LEN);
  1708. } else {
  1709. tcp_time_wait(sk, TCP_FIN_WAIT2, tmo);
  1710. goto out;
  1711. }
  1712. }
  1713. }
  1714. if (sk->sk_state != TCP_CLOSE) {
  1715. int orphan_count = percpu_counter_read_positive(
  1716. sk->sk_prot->orphan_count);
  1717. sk_mem_reclaim(sk);
  1718. if (tcp_too_many_orphans(sk, orphan_count)) {
  1719. if (net_ratelimit())
  1720. printk(KERN_INFO "TCP: too many of orphaned "
  1721. "sockets\n");
  1722. tcp_set_state(sk, TCP_CLOSE);
  1723. tcp_send_active_reset(sk, GFP_ATOMIC);
  1724. NET_INC_STATS_BH(sock_net(sk),
  1725. LINUX_MIB_TCPABORTONMEMORY);
  1726. }
  1727. }
  1728. if (sk->sk_state == TCP_CLOSE)
  1729. inet_csk_destroy_sock(sk);
  1730. /* Otherwise, socket is reprieved until protocol close. */
  1731. out:
  1732. bh_unlock_sock(sk);
  1733. local_bh_enable();
  1734. sock_put(sk);
  1735. }
  1736. /* These states need RST on ABORT according to RFC793 */
  1737. static inline int tcp_need_reset(int state)
  1738. {
  1739. return (1 << state) &
  1740. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT | TCPF_FIN_WAIT1 |
  1741. TCPF_FIN_WAIT2 | TCPF_SYN_RECV);
  1742. }
  1743. int tcp_disconnect(struct sock *sk, int flags)
  1744. {
  1745. struct inet_sock *inet = inet_sk(sk);
  1746. struct inet_connection_sock *icsk = inet_csk(sk);
  1747. struct tcp_sock *tp = tcp_sk(sk);
  1748. int err = 0;
  1749. int old_state = sk->sk_state;
  1750. if (old_state != TCP_CLOSE)
  1751. tcp_set_state(sk, TCP_CLOSE);
  1752. /* ABORT function of RFC793 */
  1753. if (old_state == TCP_LISTEN) {
  1754. inet_csk_listen_stop(sk);
  1755. } else if (tcp_need_reset(old_state) ||
  1756. (tp->snd_nxt != tp->write_seq &&
  1757. (1 << old_state) & (TCPF_CLOSING | TCPF_LAST_ACK))) {
  1758. /* The last check adjusts for discrepancy of Linux wrt. RFC
  1759. * states
  1760. */
  1761. tcp_send_active_reset(sk, gfp_any());
  1762. sk->sk_err = ECONNRESET;
  1763. } else if (old_state == TCP_SYN_SENT)
  1764. sk->sk_err = ECONNRESET;
  1765. tcp_clear_xmit_timers(sk);
  1766. __skb_queue_purge(&sk->sk_receive_queue);
  1767. tcp_write_queue_purge(sk);
  1768. __skb_queue_purge(&tp->out_of_order_queue);
  1769. #ifdef CONFIG_NET_DMA
  1770. __skb_queue_purge(&sk->sk_async_wait_queue);
  1771. #endif
  1772. inet->dport = 0;
  1773. if (!(sk->sk_userlocks & SOCK_BINDADDR_LOCK))
  1774. inet_reset_saddr(sk);
  1775. sk->sk_shutdown = 0;
  1776. sock_reset_flag(sk, SOCK_DONE);
  1777. tp->srtt = 0;
  1778. if ((tp->write_seq += tp->max_window + 2) == 0)
  1779. tp->write_seq = 1;
  1780. icsk->icsk_backoff = 0;
  1781. tp->snd_cwnd = 2;
  1782. icsk->icsk_probes_out = 0;
  1783. tp->packets_out = 0;
  1784. tp->snd_ssthresh = TCP_INFINITE_SSTHRESH;
  1785. tp->snd_cwnd_cnt = 0;
  1786. tp->bytes_acked = 0;
  1787. tcp_set_ca_state(sk, TCP_CA_Open);
  1788. tcp_clear_retrans(tp);
  1789. inet_csk_delack_init(sk);
  1790. tcp_init_send_head(sk);
  1791. memset(&tp->rx_opt, 0, sizeof(tp->rx_opt));
  1792. __sk_dst_reset(sk);
  1793. WARN_ON(inet->num && !icsk->icsk_bind_hash);
  1794. sk->sk_error_report(sk);
  1795. return err;
  1796. }
  1797. /*
  1798. * Socket option code for TCP.
  1799. */
  1800. static int do_tcp_setsockopt(struct sock *sk, int level,
  1801. int optname, char __user *optval, unsigned int optlen)
  1802. {
  1803. struct tcp_sock *tp = tcp_sk(sk);
  1804. struct inet_connection_sock *icsk = inet_csk(sk);
  1805. int val;
  1806. int err = 0;
  1807. /* This is a string value all the others are int's */
  1808. if (optname == TCP_CONGESTION) {
  1809. char name[TCP_CA_NAME_MAX];
  1810. if (optlen < 1)
  1811. return -EINVAL;
  1812. val = strncpy_from_user(name, optval,
  1813. min_t(long, TCP_CA_NAME_MAX-1, optlen));
  1814. if (val < 0)
  1815. return -EFAULT;
  1816. name[val] = 0;
  1817. lock_sock(sk);
  1818. err = tcp_set_congestion_control(sk, name);
  1819. release_sock(sk);
  1820. return err;
  1821. }
  1822. if (optlen < sizeof(int))
  1823. return -EINVAL;
  1824. if (get_user(val, (int __user *)optval))
  1825. return -EFAULT;
  1826. lock_sock(sk);
  1827. switch (optname) {
  1828. case TCP_MAXSEG:
  1829. /* Values greater than interface MTU won't take effect. However
  1830. * at the point when this call is done we typically don't yet
  1831. * know which interface is going to be used */
  1832. if (val < 8 || val > MAX_TCP_WINDOW) {
  1833. err = -EINVAL;
  1834. break;
  1835. }
  1836. tp->rx_opt.user_mss = val;
  1837. break;
  1838. case TCP_NODELAY:
  1839. if (val) {
  1840. /* TCP_NODELAY is weaker than TCP_CORK, so that
  1841. * this option on corked socket is remembered, but
  1842. * it is not activated until cork is cleared.
  1843. *
  1844. * However, when TCP_NODELAY is set we make
  1845. * an explicit push, which overrides even TCP_CORK
  1846. * for currently queued segments.
  1847. */
  1848. tp->nonagle |= TCP_NAGLE_OFF|TCP_NAGLE_PUSH;
  1849. tcp_push_pending_frames(sk);
  1850. } else {
  1851. tp->nonagle &= ~TCP_NAGLE_OFF;
  1852. }
  1853. break;
  1854. case TCP_CORK:
  1855. /* When set indicates to always queue non-full frames.
  1856. * Later the user clears this option and we transmit
  1857. * any pending partial frames in the queue. This is
  1858. * meant to be used alongside sendfile() to get properly
  1859. * filled frames when the user (for example) must write
  1860. * out headers with a write() call first and then use
  1861. * sendfile to send out the data parts.
  1862. *
  1863. * TCP_CORK can be set together with TCP_NODELAY and it is
  1864. * stronger than TCP_NODELAY.
  1865. */
  1866. if (val) {
  1867. tp->nonagle |= TCP_NAGLE_CORK;
  1868. } else {
  1869. tp->nonagle &= ~TCP_NAGLE_CORK;
  1870. if (tp->nonagle&TCP_NAGLE_OFF)
  1871. tp->nonagle |= TCP_NAGLE_PUSH;
  1872. tcp_push_pending_frames(sk);
  1873. }
  1874. break;
  1875. case TCP_KEEPIDLE:
  1876. if (val < 1 || val > MAX_TCP_KEEPIDLE)
  1877. err = -EINVAL;
  1878. else {
  1879. tp->keepalive_time = val * HZ;
  1880. if (sock_flag(sk, SOCK_KEEPOPEN) &&
  1881. !((1 << sk->sk_state) &
  1882. (TCPF_CLOSE | TCPF_LISTEN))) {
  1883. __u32 elapsed = tcp_time_stamp - tp->rcv_tstamp;
  1884. if (tp->keepalive_time > elapsed)
  1885. elapsed = tp->keepalive_time - elapsed;
  1886. else
  1887. elapsed = 0;
  1888. inet_csk_reset_keepalive_timer(sk, elapsed);
  1889. }
  1890. }
  1891. break;
  1892. case TCP_KEEPINTVL:
  1893. if (val < 1 || val > MAX_TCP_KEEPINTVL)
  1894. err = -EINVAL;
  1895. else
  1896. tp->keepalive_intvl = val * HZ;
  1897. break;
  1898. case TCP_KEEPCNT:
  1899. if (val < 1 || val > MAX_TCP_KEEPCNT)
  1900. err = -EINVAL;
  1901. else
  1902. tp->keepalive_probes = val;
  1903. break;
  1904. case TCP_SYNCNT:
  1905. if (val < 1 || val > MAX_TCP_SYNCNT)
  1906. err = -EINVAL;
  1907. else
  1908. icsk->icsk_syn_retries = val;
  1909. break;
  1910. case TCP_LINGER2:
  1911. if (val < 0)
  1912. tp->linger2 = -1;
  1913. else if (val > sysctl_tcp_fin_timeout / HZ)
  1914. tp->linger2 = 0;
  1915. else
  1916. tp->linger2 = val * HZ;
  1917. break;
  1918. case TCP_DEFER_ACCEPT:
  1919. /* Translate value in seconds to number of retransmits */
  1920. icsk->icsk_accept_queue.rskq_defer_accept =
  1921. secs_to_retrans(val, TCP_TIMEOUT_INIT / HZ,
  1922. TCP_RTO_MAX / HZ);
  1923. break;
  1924. case TCP_WINDOW_CLAMP:
  1925. if (!val) {
  1926. if (sk->sk_state != TCP_CLOSE) {
  1927. err = -EINVAL;
  1928. break;
  1929. }
  1930. tp->window_clamp = 0;
  1931. } else
  1932. tp->window_clamp = val < SOCK_MIN_RCVBUF / 2 ?
  1933. SOCK_MIN_RCVBUF / 2 : val;
  1934. break;
  1935. case TCP_QUICKACK:
  1936. if (!val) {
  1937. icsk->icsk_ack.pingpong = 1;
  1938. } else {
  1939. icsk->icsk_ack.pingpong = 0;
  1940. if ((1 << sk->sk_state) &
  1941. (TCPF_ESTABLISHED | TCPF_CLOSE_WAIT) &&
  1942. inet_csk_ack_scheduled(sk)) {
  1943. icsk->icsk_ack.pending |= ICSK_ACK_PUSHED;
  1944. tcp_cleanup_rbuf(sk, 1);
  1945. if (!(val & 1))
  1946. icsk->icsk_ack.pingpong = 1;
  1947. }
  1948. }
  1949. break;
  1950. #ifdef CONFIG_TCP_MD5SIG
  1951. case TCP_MD5SIG:
  1952. /* Read the IP->Key mappings from userspace */
  1953. err = tp->af_specific->md5_parse(sk, optval, optlen);
  1954. break;
  1955. #endif
  1956. default:
  1957. err = -ENOPROTOOPT;
  1958. break;
  1959. }
  1960. release_sock(sk);
  1961. return err;
  1962. }
  1963. int tcp_setsockopt(struct sock *sk, int level, int optname, char __user *optval,
  1964. unsigned int optlen)
  1965. {
  1966. struct inet_connection_sock *icsk = inet_csk(sk);
  1967. if (level != SOL_TCP)
  1968. return icsk->icsk_af_ops->setsockopt(sk, level, optname,
  1969. optval, optlen);
  1970. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  1971. }
  1972. #ifdef CONFIG_COMPAT
  1973. int compat_tcp_setsockopt(struct sock *sk, int level, int optname,
  1974. char __user *optval, unsigned int optlen)
  1975. {
  1976. if (level != SOL_TCP)
  1977. return inet_csk_compat_setsockopt(sk, level, optname,
  1978. optval, optlen);
  1979. return do_tcp_setsockopt(sk, level, optname, optval, optlen);
  1980. }
  1981. EXPORT_SYMBOL(compat_tcp_setsockopt);
  1982. #endif
  1983. /* Return information about state of tcp endpoint in API format. */
  1984. void tcp_get_info(struct sock *sk, struct tcp_info *info)
  1985. {
  1986. struct tcp_sock *tp = tcp_sk(sk);
  1987. const struct inet_connection_sock *icsk = inet_csk(sk);
  1988. u32 now = tcp_time_stamp;
  1989. memset(info, 0, sizeof(*info));
  1990. info->tcpi_state = sk->sk_state;
  1991. info->tcpi_ca_state = icsk->icsk_ca_state;
  1992. info->tcpi_retransmits = icsk->icsk_retransmits;
  1993. info->tcpi_probes = icsk->icsk_probes_out;
  1994. info->tcpi_backoff = icsk->icsk_backoff;
  1995. if (tp->rx_opt.tstamp_ok)
  1996. info->tcpi_options |= TCPI_OPT_TIMESTAMPS;
  1997. if (tcp_is_sack(tp))
  1998. info->tcpi_options |= TCPI_OPT_SACK;
  1999. if (tp->rx_opt.wscale_ok) {
  2000. info->tcpi_options |= TCPI_OPT_WSCALE;
  2001. info->tcpi_snd_wscale = tp->rx_opt.snd_wscale;
  2002. info->tcpi_rcv_wscale = tp->rx_opt.rcv_wscale;
  2003. }
  2004. if (tp->ecn_flags&TCP_ECN_OK)
  2005. info->tcpi_options |= TCPI_OPT_ECN;
  2006. info->tcpi_rto = jiffies_to_usecs(icsk->icsk_rto);
  2007. info->tcpi_ato = jiffies_to_usecs(icsk->icsk_ack.ato);
  2008. info->tcpi_snd_mss = tp->mss_cache;
  2009. info->tcpi_rcv_mss = icsk->icsk_ack.rcv_mss;
  2010. if (sk->sk_state == TCP_LISTEN) {
  2011. info->tcpi_unacked = sk->sk_ack_backlog;
  2012. info->tcpi_sacked = sk->sk_max_ack_backlog;
  2013. } else {
  2014. info->tcpi_unacked = tp->packets_out;
  2015. info->tcpi_sacked = tp->sacked_out;
  2016. }
  2017. info->tcpi_lost = tp->lost_out;
  2018. info->tcpi_retrans = tp->retrans_out;
  2019. info->tcpi_fackets = tp->fackets_out;
  2020. info->tcpi_last_data_sent = jiffies_to_msecs(now - tp->lsndtime);
  2021. info->tcpi_last_data_recv = jiffies_to_msecs(now - icsk->icsk_ack.lrcvtime);
  2022. info->tcpi_last_ack_recv = jiffies_to_msecs(now - tp->rcv_tstamp);
  2023. info->tcpi_pmtu = icsk->icsk_pmtu_cookie;
  2024. info->tcpi_rcv_ssthresh = tp->rcv_ssthresh;
  2025. info->tcpi_rtt = jiffies_to_usecs(tp->srtt)>>3;
  2026. info->tcpi_rttvar = jiffies_to_usecs(tp->mdev)>>2;
  2027. info->tcpi_snd_ssthresh = tp->snd_ssthresh;
  2028. info->tcpi_snd_cwnd = tp->snd_cwnd;
  2029. info->tcpi_advmss = tp->advmss;
  2030. info->tcpi_reordering = tp->reordering;
  2031. info->tcpi_rcv_rtt = jiffies_to_usecs(tp->rcv_rtt_est.rtt)>>3;
  2032. info->tcpi_rcv_space = tp->rcvq_space.space;
  2033. info->tcpi_total_retrans = tp->total_retrans;
  2034. }
  2035. EXPORT_SYMBOL_GPL(tcp_get_info);
  2036. static int do_tcp_getsockopt(struct sock *sk, int level,
  2037. int optname, char __user *optval, int __user *optlen)
  2038. {
  2039. struct inet_connection_sock *icsk = inet_csk(sk);
  2040. struct tcp_sock *tp = tcp_sk(sk);
  2041. int val, len;
  2042. if (get_user(len, optlen))
  2043. return -EFAULT;
  2044. len = min_t(unsigned int, len, sizeof(int));
  2045. if (len < 0)
  2046. return -EINVAL;
  2047. switch (optname) {
  2048. case TCP_MAXSEG:
  2049. val = tp->mss_cache;
  2050. if (!val && ((1 << sk->sk_state) & (TCPF_CLOSE | TCPF_LISTEN)))
  2051. val = tp->rx_opt.user_mss;
  2052. break;
  2053. case TCP_NODELAY:
  2054. val = !!(tp->nonagle&TCP_NAGLE_OFF);
  2055. break;
  2056. case TCP_CORK:
  2057. val = !!(tp->nonagle&TCP_NAGLE_CORK);
  2058. break;
  2059. case TCP_KEEPIDLE:
  2060. val = keepalive_time_when(tp) / HZ;
  2061. break;
  2062. case TCP_KEEPINTVL:
  2063. val = keepalive_intvl_when(tp) / HZ;
  2064. break;
  2065. case TCP_KEEPCNT:
  2066. val = keepalive_probes(tp);
  2067. break;
  2068. case TCP_SYNCNT:
  2069. val = icsk->icsk_syn_retries ? : sysctl_tcp_syn_retries;
  2070. break;
  2071. case TCP_LINGER2:
  2072. val = tp->linger2;
  2073. if (val >= 0)
  2074. val = (val ? : sysctl_tcp_fin_timeout) / HZ;
  2075. break;
  2076. case TCP_DEFER_ACCEPT:
  2077. val = retrans_to_secs(icsk->icsk_accept_queue.rskq_defer_accept,
  2078. TCP_TIMEOUT_INIT / HZ, TCP_RTO_MAX / HZ);
  2079. break;
  2080. case TCP_WINDOW_CLAMP:
  2081. val = tp->window_clamp;
  2082. break;
  2083. case TCP_INFO: {
  2084. struct tcp_info info;
  2085. if (get_user(len, optlen))
  2086. return -EFAULT;
  2087. tcp_get_info(sk, &info);
  2088. len = min_t(unsigned int, len, sizeof(info));
  2089. if (put_user(len, optlen))
  2090. return -EFAULT;
  2091. if (copy_to_user(optval, &info, len))
  2092. return -EFAULT;
  2093. return 0;
  2094. }
  2095. case TCP_QUICKACK:
  2096. val = !icsk->icsk_ack.pingpong;
  2097. break;
  2098. case TCP_CONGESTION:
  2099. if (get_user(len, optlen))
  2100. return -EFAULT;
  2101. len = min_t(unsigned int, len, TCP_CA_NAME_MAX);
  2102. if (put_user(len, optlen))
  2103. return -EFAULT;
  2104. if (copy_to_user(optval, icsk->icsk_ca_ops->name, len))
  2105. return -EFAULT;
  2106. return 0;
  2107. default:
  2108. return -ENOPROTOOPT;
  2109. }
  2110. if (put_user(len, optlen))
  2111. return -EFAULT;
  2112. if (copy_to_user(optval, &val, len))
  2113. return -EFAULT;
  2114. return 0;
  2115. }
  2116. int tcp_getsockopt(struct sock *sk, int level, int optname, char __user *optval,
  2117. int __user *optlen)
  2118. {
  2119. struct inet_connection_sock *icsk = inet_csk(sk);
  2120. if (level != SOL_TCP)
  2121. return icsk->icsk_af_ops->getsockopt(sk, level, optname,
  2122. optval, optlen);
  2123. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2124. }
  2125. #ifdef CONFIG_COMPAT
  2126. int compat_tcp_getsockopt(struct sock *sk, int level, int optname,
  2127. char __user *optval, int __user *optlen)
  2128. {
  2129. if (level != SOL_TCP)
  2130. return inet_csk_compat_getsockopt(sk, level, optname,
  2131. optval, optlen);
  2132. return do_tcp_getsockopt(sk, level, optname, optval, optlen);
  2133. }
  2134. EXPORT_SYMBOL(compat_tcp_getsockopt);
  2135. #endif
  2136. struct sk_buff *tcp_tso_segment(struct sk_buff *skb, int features)
  2137. {
  2138. struct sk_buff *segs = ERR_PTR(-EINVAL);
  2139. struct tcphdr *th;
  2140. unsigned thlen;
  2141. unsigned int seq;
  2142. __be32 delta;
  2143. unsigned int oldlen;
  2144. unsigned int mss;
  2145. if (!pskb_may_pull(skb, sizeof(*th)))
  2146. goto out;
  2147. th = tcp_hdr(skb);
  2148. thlen = th->doff * 4;
  2149. if (thlen < sizeof(*th))
  2150. goto out;
  2151. if (!pskb_may_pull(skb, thlen))
  2152. goto out;
  2153. oldlen = (u16)~skb->len;
  2154. __skb_pull(skb, thlen);
  2155. mss = skb_shinfo(skb)->gso_size;
  2156. if (unlikely(skb->len <= mss))
  2157. goto out;
  2158. if (skb_gso_ok(skb, features | NETIF_F_GSO_ROBUST)) {
  2159. /* Packet is from an untrusted source, reset gso_segs. */
  2160. int type = skb_shinfo(skb)->gso_type;
  2161. if (unlikely(type &
  2162. ~(SKB_GSO_TCPV4 |
  2163. SKB_GSO_DODGY |
  2164. SKB_GSO_TCP_ECN |
  2165. SKB_GSO_TCPV6 |
  2166. 0) ||
  2167. !(type & (SKB_GSO_TCPV4 | SKB_GSO_TCPV6))))
  2168. goto out;
  2169. skb_shinfo(skb)->gso_segs = DIV_ROUND_UP(skb->len, mss);
  2170. segs = NULL;
  2171. goto out;
  2172. }
  2173. segs = skb_segment(skb, features);
  2174. if (IS_ERR(segs))
  2175. goto out;
  2176. delta = htonl(oldlen + (thlen + mss));
  2177. skb = segs;
  2178. th = tcp_hdr(skb);
  2179. seq = ntohl(th->seq);
  2180. do {
  2181. th->fin = th->psh = 0;
  2182. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2183. (__force u32)delta));
  2184. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2185. th->check =
  2186. csum_fold(csum_partial(skb_transport_header(skb),
  2187. thlen, skb->csum));
  2188. seq += mss;
  2189. skb = skb->next;
  2190. th = tcp_hdr(skb);
  2191. th->seq = htonl(seq);
  2192. th->cwr = 0;
  2193. } while (skb->next);
  2194. delta = htonl(oldlen + (skb->tail - skb->transport_header) +
  2195. skb->data_len);
  2196. th->check = ~csum_fold((__force __wsum)((__force u32)th->check +
  2197. (__force u32)delta));
  2198. if (skb->ip_summed != CHECKSUM_PARTIAL)
  2199. th->check = csum_fold(csum_partial(skb_transport_header(skb),
  2200. thlen, skb->csum));
  2201. out:
  2202. return segs;
  2203. }
  2204. EXPORT_SYMBOL(tcp_tso_segment);
  2205. struct sk_buff **tcp_gro_receive(struct sk_buff **head, struct sk_buff *skb)
  2206. {
  2207. struct sk_buff **pp = NULL;
  2208. struct sk_buff *p;
  2209. struct tcphdr *th;
  2210. struct tcphdr *th2;
  2211. unsigned int len;
  2212. unsigned int thlen;
  2213. unsigned int flags;
  2214. unsigned int mss = 1;
  2215. unsigned int hlen;
  2216. unsigned int off;
  2217. int flush = 1;
  2218. int i;
  2219. off = skb_gro_offset(skb);
  2220. hlen = off + sizeof(*th);
  2221. th = skb_gro_header_fast(skb, off);
  2222. if (skb_gro_header_hard(skb, hlen)) {
  2223. th = skb_gro_header_slow(skb, hlen, off);
  2224. if (unlikely(!th))
  2225. goto out;
  2226. }
  2227. thlen = th->doff * 4;
  2228. if (thlen < sizeof(*th))
  2229. goto out;
  2230. hlen = off + thlen;
  2231. if (skb_gro_header_hard(skb, hlen)) {
  2232. th = skb_gro_header_slow(skb, hlen, off);
  2233. if (unlikely(!th))
  2234. goto out;
  2235. }
  2236. skb_gro_pull(skb, thlen);
  2237. len = skb_gro_len(skb);
  2238. flags = tcp_flag_word(th);
  2239. for (; (p = *head); head = &p->next) {
  2240. if (!NAPI_GRO_CB(p)->same_flow)
  2241. continue;
  2242. th2 = tcp_hdr(p);
  2243. if (*(u32 *)&th->source ^ *(u32 *)&th2->source) {
  2244. NAPI_GRO_CB(p)->same_flow = 0;
  2245. continue;
  2246. }
  2247. goto found;
  2248. }
  2249. goto out_check_final;
  2250. found:
  2251. flush = NAPI_GRO_CB(p)->flush;
  2252. flush |= flags & TCP_FLAG_CWR;
  2253. flush |= (flags ^ tcp_flag_word(th2)) &
  2254. ~(TCP_FLAG_CWR | TCP_FLAG_FIN | TCP_FLAG_PSH);
  2255. flush |= th->ack_seq ^ th2->ack_seq;
  2256. for (i = sizeof(*th); i < thlen; i += 4)
  2257. flush |= *(u32 *)((u8 *)th + i) ^
  2258. *(u32 *)((u8 *)th2 + i);
  2259. mss = skb_shinfo(p)->gso_size;
  2260. flush |= (len - 1) >= mss;
  2261. flush |= (ntohl(th2->seq) + skb_gro_len(p)) ^ ntohl(th->seq);
  2262. if (flush || skb_gro_receive(head, skb)) {
  2263. mss = 1;
  2264. goto out_check_final;
  2265. }
  2266. p = *head;
  2267. th2 = tcp_hdr(p);
  2268. tcp_flag_word(th2) |= flags & (TCP_FLAG_FIN | TCP_FLAG_PSH);
  2269. out_check_final:
  2270. flush = len < mss;
  2271. flush |= flags & (TCP_FLAG_URG | TCP_FLAG_PSH | TCP_FLAG_RST |
  2272. TCP_FLAG_SYN | TCP_FLAG_FIN);
  2273. if (p && (!NAPI_GRO_CB(skb)->same_flow || flush))
  2274. pp = head;
  2275. out:
  2276. NAPI_GRO_CB(skb)->flush |= flush;
  2277. return pp;
  2278. }
  2279. EXPORT_SYMBOL(tcp_gro_receive);
  2280. int tcp_gro_complete(struct sk_buff *skb)
  2281. {
  2282. struct tcphdr *th = tcp_hdr(skb);
  2283. skb->csum_start = skb_transport_header(skb) - skb->head;
  2284. skb->csum_offset = offsetof(struct tcphdr, check);
  2285. skb->ip_summed = CHECKSUM_PARTIAL;
  2286. skb_shinfo(skb)->gso_segs = NAPI_GRO_CB(skb)->count;
  2287. if (th->cwr)
  2288. skb_shinfo(skb)->gso_type |= SKB_GSO_TCP_ECN;
  2289. return 0;
  2290. }
  2291. EXPORT_SYMBOL(tcp_gro_complete);
  2292. #ifdef CONFIG_TCP_MD5SIG
  2293. static unsigned long tcp_md5sig_users;
  2294. static struct tcp_md5sig_pool **tcp_md5sig_pool;
  2295. static DEFINE_SPINLOCK(tcp_md5sig_pool_lock);
  2296. static void __tcp_free_md5sig_pool(struct tcp_md5sig_pool **pool)
  2297. {
  2298. int cpu;
  2299. for_each_possible_cpu(cpu) {
  2300. struct tcp_md5sig_pool *p = *per_cpu_ptr(pool, cpu);
  2301. if (p) {
  2302. if (p->md5_desc.tfm)
  2303. crypto_free_hash(p->md5_desc.tfm);
  2304. kfree(p);
  2305. p = NULL;
  2306. }
  2307. }
  2308. free_percpu(pool);
  2309. }
  2310. void tcp_free_md5sig_pool(void)
  2311. {
  2312. struct tcp_md5sig_pool **pool = NULL;
  2313. spin_lock_bh(&tcp_md5sig_pool_lock);
  2314. if (--tcp_md5sig_users == 0) {
  2315. pool = tcp_md5sig_pool;
  2316. tcp_md5sig_pool = NULL;
  2317. }
  2318. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2319. if (pool)
  2320. __tcp_free_md5sig_pool(pool);
  2321. }
  2322. EXPORT_SYMBOL(tcp_free_md5sig_pool);
  2323. static struct tcp_md5sig_pool **__tcp_alloc_md5sig_pool(struct sock *sk)
  2324. {
  2325. int cpu;
  2326. struct tcp_md5sig_pool **pool;
  2327. pool = alloc_percpu(struct tcp_md5sig_pool *);
  2328. if (!pool)
  2329. return NULL;
  2330. for_each_possible_cpu(cpu) {
  2331. struct tcp_md5sig_pool *p;
  2332. struct crypto_hash *hash;
  2333. p = kzalloc(sizeof(*p), sk->sk_allocation);
  2334. if (!p)
  2335. goto out_free;
  2336. *per_cpu_ptr(pool, cpu) = p;
  2337. hash = crypto_alloc_hash("md5", 0, CRYPTO_ALG_ASYNC);
  2338. if (!hash || IS_ERR(hash))
  2339. goto out_free;
  2340. p->md5_desc.tfm = hash;
  2341. }
  2342. return pool;
  2343. out_free:
  2344. __tcp_free_md5sig_pool(pool);
  2345. return NULL;
  2346. }
  2347. struct tcp_md5sig_pool **tcp_alloc_md5sig_pool(struct sock *sk)
  2348. {
  2349. struct tcp_md5sig_pool **pool;
  2350. int alloc = 0;
  2351. retry:
  2352. spin_lock_bh(&tcp_md5sig_pool_lock);
  2353. pool = tcp_md5sig_pool;
  2354. if (tcp_md5sig_users++ == 0) {
  2355. alloc = 1;
  2356. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2357. } else if (!pool) {
  2358. tcp_md5sig_users--;
  2359. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2360. cpu_relax();
  2361. goto retry;
  2362. } else
  2363. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2364. if (alloc) {
  2365. /* we cannot hold spinlock here because this may sleep. */
  2366. struct tcp_md5sig_pool **p = __tcp_alloc_md5sig_pool(sk);
  2367. spin_lock_bh(&tcp_md5sig_pool_lock);
  2368. if (!p) {
  2369. tcp_md5sig_users--;
  2370. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2371. return NULL;
  2372. }
  2373. pool = tcp_md5sig_pool;
  2374. if (pool) {
  2375. /* oops, it has already been assigned. */
  2376. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2377. __tcp_free_md5sig_pool(p);
  2378. } else {
  2379. tcp_md5sig_pool = pool = p;
  2380. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2381. }
  2382. }
  2383. return pool;
  2384. }
  2385. EXPORT_SYMBOL(tcp_alloc_md5sig_pool);
  2386. struct tcp_md5sig_pool *__tcp_get_md5sig_pool(int cpu)
  2387. {
  2388. struct tcp_md5sig_pool **p;
  2389. spin_lock_bh(&tcp_md5sig_pool_lock);
  2390. p = tcp_md5sig_pool;
  2391. if (p)
  2392. tcp_md5sig_users++;
  2393. spin_unlock_bh(&tcp_md5sig_pool_lock);
  2394. return (p ? *per_cpu_ptr(p, cpu) : NULL);
  2395. }
  2396. EXPORT_SYMBOL(__tcp_get_md5sig_pool);
  2397. void __tcp_put_md5sig_pool(void)
  2398. {
  2399. tcp_free_md5sig_pool();
  2400. }
  2401. EXPORT_SYMBOL(__tcp_put_md5sig_pool);
  2402. int tcp_md5_hash_header(struct tcp_md5sig_pool *hp,
  2403. struct tcphdr *th)
  2404. {
  2405. struct scatterlist sg;
  2406. int err;
  2407. __sum16 old_checksum = th->check;
  2408. th->check = 0;
  2409. /* options aren't included in the hash */
  2410. sg_init_one(&sg, th, sizeof(struct tcphdr));
  2411. err = crypto_hash_update(&hp->md5_desc, &sg, sizeof(struct tcphdr));
  2412. th->check = old_checksum;
  2413. return err;
  2414. }
  2415. EXPORT_SYMBOL(tcp_md5_hash_header);
  2416. int tcp_md5_hash_skb_data(struct tcp_md5sig_pool *hp,
  2417. struct sk_buff *skb, unsigned header_len)
  2418. {
  2419. struct scatterlist sg;
  2420. const struct tcphdr *tp = tcp_hdr(skb);
  2421. struct hash_desc *desc = &hp->md5_desc;
  2422. unsigned i;
  2423. const unsigned head_data_len = skb_headlen(skb) > header_len ?
  2424. skb_headlen(skb) - header_len : 0;
  2425. const struct skb_shared_info *shi = skb_shinfo(skb);
  2426. sg_init_table(&sg, 1);
  2427. sg_set_buf(&sg, ((u8 *) tp) + header_len, head_data_len);
  2428. if (crypto_hash_update(desc, &sg, head_data_len))
  2429. return 1;
  2430. for (i = 0; i < shi->nr_frags; ++i) {
  2431. const struct skb_frag_struct *f = &shi->frags[i];
  2432. sg_set_page(&sg, f->page, f->size, f->page_offset);
  2433. if (crypto_hash_update(desc, &sg, f->size))
  2434. return 1;
  2435. }
  2436. return 0;
  2437. }
  2438. EXPORT_SYMBOL(tcp_md5_hash_skb_data);
  2439. int tcp_md5_hash_key(struct tcp_md5sig_pool *hp, struct tcp_md5sig_key *key)
  2440. {
  2441. struct scatterlist sg;
  2442. sg_init_one(&sg, key->key, key->keylen);
  2443. return crypto_hash_update(&hp->md5_desc, &sg, key->keylen);
  2444. }
  2445. EXPORT_SYMBOL(tcp_md5_hash_key);
  2446. #endif
  2447. void tcp_done(struct sock *sk)
  2448. {
  2449. if (sk->sk_state == TCP_SYN_SENT || sk->sk_state == TCP_SYN_RECV)
  2450. TCP_INC_STATS_BH(sock_net(sk), TCP_MIB_ATTEMPTFAILS);
  2451. tcp_set_state(sk, TCP_CLOSE);
  2452. tcp_clear_xmit_timers(sk);
  2453. sk->sk_shutdown = SHUTDOWN_MASK;
  2454. if (!sock_flag(sk, SOCK_DEAD))
  2455. sk->sk_state_change(sk);
  2456. else
  2457. inet_csk_destroy_sock(sk);
  2458. }
  2459. EXPORT_SYMBOL_GPL(tcp_done);
  2460. extern struct tcp_congestion_ops tcp_reno;
  2461. static __initdata unsigned long thash_entries;
  2462. static int __init set_thash_entries(char *str)
  2463. {
  2464. if (!str)
  2465. return 0;
  2466. thash_entries = simple_strtoul(str, &str, 0);
  2467. return 1;
  2468. }
  2469. __setup("thash_entries=", set_thash_entries);
  2470. void __init tcp_init(void)
  2471. {
  2472. struct sk_buff *skb = NULL;
  2473. unsigned long nr_pages, limit;
  2474. int order, i, max_share;
  2475. BUILD_BUG_ON(sizeof(struct tcp_skb_cb) > sizeof(skb->cb));
  2476. percpu_counter_init(&tcp_sockets_allocated, 0);
  2477. percpu_counter_init(&tcp_orphan_count, 0);
  2478. tcp_hashinfo.bind_bucket_cachep =
  2479. kmem_cache_create("tcp_bind_bucket",
  2480. sizeof(struct inet_bind_bucket), 0,
  2481. SLAB_HWCACHE_ALIGN|SLAB_PANIC, NULL);
  2482. /* Size and allocate the main established and bind bucket
  2483. * hash tables.
  2484. *
  2485. * The methodology is similar to that of the buffer cache.
  2486. */
  2487. tcp_hashinfo.ehash =
  2488. alloc_large_system_hash("TCP established",
  2489. sizeof(struct inet_ehash_bucket),
  2490. thash_entries,
  2491. (totalram_pages >= 128 * 1024) ?
  2492. 13 : 15,
  2493. 0,
  2494. &tcp_hashinfo.ehash_size,
  2495. NULL,
  2496. thash_entries ? 0 : 512 * 1024);
  2497. tcp_hashinfo.ehash_size = 1 << tcp_hashinfo.ehash_size;
  2498. for (i = 0; i < tcp_hashinfo.ehash_size; i++) {
  2499. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].chain, i);
  2500. INIT_HLIST_NULLS_HEAD(&tcp_hashinfo.ehash[i].twchain, i);
  2501. }
  2502. if (inet_ehash_locks_alloc(&tcp_hashinfo))
  2503. panic("TCP: failed to alloc ehash_locks");
  2504. tcp_hashinfo.bhash =
  2505. alloc_large_system_hash("TCP bind",
  2506. sizeof(struct inet_bind_hashbucket),
  2507. tcp_hashinfo.ehash_size,
  2508. (totalram_pages >= 128 * 1024) ?
  2509. 13 : 15,
  2510. 0,
  2511. &tcp_hashinfo.bhash_size,
  2512. NULL,
  2513. 64 * 1024);
  2514. tcp_hashinfo.bhash_size = 1 << tcp_hashinfo.bhash_size;
  2515. for (i = 0; i < tcp_hashinfo.bhash_size; i++) {
  2516. spin_lock_init(&tcp_hashinfo.bhash[i].lock);
  2517. INIT_HLIST_HEAD(&tcp_hashinfo.bhash[i].chain);
  2518. }
  2519. /* Try to be a bit smarter and adjust defaults depending
  2520. * on available memory.
  2521. */
  2522. for (order = 0; ((1 << order) << PAGE_SHIFT) <
  2523. (tcp_hashinfo.bhash_size * sizeof(struct inet_bind_hashbucket));
  2524. order++)
  2525. ;
  2526. if (order >= 4) {
  2527. tcp_death_row.sysctl_max_tw_buckets = 180000;
  2528. sysctl_tcp_max_orphans = 4096 << (order - 4);
  2529. sysctl_max_syn_backlog = 1024;
  2530. } else if (order < 3) {
  2531. tcp_death_row.sysctl_max_tw_buckets >>= (3 - order);
  2532. sysctl_tcp_max_orphans >>= (3 - order);
  2533. sysctl_max_syn_backlog = 128;
  2534. }
  2535. /* Set the pressure threshold to be a fraction of global memory that
  2536. * is up to 1/2 at 256 MB, decreasing toward zero with the amount of
  2537. * memory, with a floor of 128 pages.
  2538. */
  2539. nr_pages = totalram_pages - totalhigh_pages;
  2540. limit = min(nr_pages, 1UL<<(28-PAGE_SHIFT)) >> (20-PAGE_SHIFT);
  2541. limit = (limit * (nr_pages >> (20-PAGE_SHIFT))) >> (PAGE_SHIFT-11);
  2542. limit = max(limit, 128UL);
  2543. sysctl_tcp_mem[0] = limit / 4 * 3;
  2544. sysctl_tcp_mem[1] = limit;
  2545. sysctl_tcp_mem[2] = sysctl_tcp_mem[0] * 2;
  2546. /* Set per-socket limits to no more than 1/128 the pressure threshold */
  2547. limit = ((unsigned long)sysctl_tcp_mem[1]) << (PAGE_SHIFT - 7);
  2548. max_share = min(4UL*1024*1024, limit);
  2549. sysctl_tcp_wmem[0] = SK_MEM_QUANTUM;
  2550. sysctl_tcp_wmem[1] = 16*1024;
  2551. sysctl_tcp_wmem[2] = max(64*1024, max_share);
  2552. sysctl_tcp_rmem[0] = SK_MEM_QUANTUM;
  2553. sysctl_tcp_rmem[1] = 87380;
  2554. sysctl_tcp_rmem[2] = max(87380, max_share);
  2555. printk(KERN_INFO "TCP: Hash tables configured "
  2556. "(established %d bind %d)\n",
  2557. tcp_hashinfo.ehash_size, tcp_hashinfo.bhash_size);
  2558. tcp_register_congestion_control(&tcp_reno);
  2559. }
  2560. EXPORT_SYMBOL(tcp_close);
  2561. EXPORT_SYMBOL(tcp_disconnect);
  2562. EXPORT_SYMBOL(tcp_getsockopt);
  2563. EXPORT_SYMBOL(tcp_ioctl);
  2564. EXPORT_SYMBOL(tcp_poll);
  2565. EXPORT_SYMBOL(tcp_read_sock);
  2566. EXPORT_SYMBOL(tcp_recvmsg);
  2567. EXPORT_SYMBOL(tcp_sendmsg);
  2568. EXPORT_SYMBOL(tcp_splice_read);
  2569. EXPORT_SYMBOL(tcp_sendpage);
  2570. EXPORT_SYMBOL(tcp_setsockopt);
  2571. EXPORT_SYMBOL(tcp_shutdown);