tcp.c 75 KB

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