sock.c 60 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408
  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. * Generic socket support routines. Memory allocators, socket lock/release
  7. * handler for protocols to use and generic option handler.
  8. *
  9. *
  10. * Authors: Ross Biro
  11. * Fred N. van Kempen, <waltje@uWalt.NL.Mugnet.ORG>
  12. * Florian La Roche, <flla@stud.uni-sb.de>
  13. * Alan Cox, <A.Cox@swansea.ac.uk>
  14. *
  15. * Fixes:
  16. * Alan Cox : Numerous verify_area() problems
  17. * Alan Cox : Connecting on a connecting socket
  18. * now returns an error for tcp.
  19. * Alan Cox : sock->protocol is set correctly.
  20. * and is not sometimes left as 0.
  21. * Alan Cox : connect handles icmp errors on a
  22. * connect properly. Unfortunately there
  23. * is a restart syscall nasty there. I
  24. * can't match BSD without hacking the C
  25. * library. Ideas urgently sought!
  26. * Alan Cox : Disallow bind() to addresses that are
  27. * not ours - especially broadcast ones!!
  28. * Alan Cox : Socket 1024 _IS_ ok for users. (fencepost)
  29. * Alan Cox : sock_wfree/sock_rfree don't destroy sockets,
  30. * instead they leave that for the DESTROY timer.
  31. * Alan Cox : Clean up error flag in accept
  32. * Alan Cox : TCP ack handling is buggy, the DESTROY timer
  33. * was buggy. Put a remove_sock() in the handler
  34. * for memory when we hit 0. Also altered the timer
  35. * code. The ACK stuff can wait and needs major
  36. * TCP layer surgery.
  37. * Alan Cox : Fixed TCP ack bug, removed remove sock
  38. * and fixed timer/inet_bh race.
  39. * Alan Cox : Added zapped flag for TCP
  40. * Alan Cox : Move kfree_skb into skbuff.c and tidied up surplus code
  41. * Alan Cox : for new sk_buff allocations wmalloc/rmalloc now call alloc_skb
  42. * Alan Cox : kfree_s calls now are kfree_skbmem so we can track skb resources
  43. * Alan Cox : Supports socket option broadcast now as does udp. Packet and raw need fixing.
  44. * Alan Cox : Added RCVBUF,SNDBUF size setting. It suddenly occurred to me how easy it was so...
  45. * Rick Sladkey : Relaxed UDP rules for matching packets.
  46. * C.E.Hawkins : IFF_PROMISC/SIOCGHWADDR support
  47. * Pauline Middelink : identd support
  48. * Alan Cox : Fixed connect() taking signals I think.
  49. * Alan Cox : SO_LINGER supported
  50. * Alan Cox : Error reporting fixes
  51. * Anonymous : inet_create tidied up (sk->reuse setting)
  52. * Alan Cox : inet sockets don't set sk->type!
  53. * Alan Cox : Split socket option code
  54. * Alan Cox : Callbacks
  55. * Alan Cox : Nagle flag for Charles & Johannes stuff
  56. * Alex : Removed restriction on inet fioctl
  57. * Alan Cox : Splitting INET from NET core
  58. * Alan Cox : Fixed bogus SO_TYPE handling in getsockopt()
  59. * Adam Caldwell : Missing return in SO_DONTROUTE/SO_DEBUG code
  60. * Alan Cox : Split IP from generic code
  61. * Alan Cox : New kfree_skbmem()
  62. * Alan Cox : Make SO_DEBUG superuser only.
  63. * Alan Cox : Allow anyone to clear SO_DEBUG
  64. * (compatibility fix)
  65. * Alan Cox : Added optimistic memory grabbing for AF_UNIX throughput.
  66. * Alan Cox : Allocator for a socket is settable.
  67. * Alan Cox : SO_ERROR includes soft errors.
  68. * Alan Cox : Allow NULL arguments on some SO_ opts
  69. * Alan Cox : Generic socket allocation to make hooks
  70. * easier (suggested by Craig Metz).
  71. * Michael Pall : SO_ERROR returns positive errno again
  72. * Steve Whitehouse: Added default destructor to free
  73. * protocol private data.
  74. * Steve Whitehouse: Added various other default routines
  75. * common to several socket families.
  76. * Chris Evans : Call suser() check last on F_SETOWN
  77. * Jay Schulist : Added SO_ATTACH_FILTER and SO_DETACH_FILTER.
  78. * Andi Kleen : Add sock_kmalloc()/sock_kfree_s()
  79. * Andi Kleen : Fix write_space callback
  80. * Chris Evans : Security fixes - signedness again
  81. * Arnaldo C. Melo : cleanups, use skb_queue_purge
  82. *
  83. * To Fix:
  84. *
  85. *
  86. * This program is free software; you can redistribute it and/or
  87. * modify it under the terms of the GNU General Public License
  88. * as published by the Free Software Foundation; either version
  89. * 2 of the License, or (at your option) any later version.
  90. */
  91. #include <linux/capability.h>
  92. #include <linux/errno.h>
  93. #include <linux/types.h>
  94. #include <linux/socket.h>
  95. #include <linux/in.h>
  96. #include <linux/kernel.h>
  97. #include <linux/module.h>
  98. #include <linux/proc_fs.h>
  99. #include <linux/seq_file.h>
  100. #include <linux/sched.h>
  101. #include <linux/timer.h>
  102. #include <linux/string.h>
  103. #include <linux/sockios.h>
  104. #include <linux/net.h>
  105. #include <linux/mm.h>
  106. #include <linux/slab.h>
  107. #include <linux/interrupt.h>
  108. #include <linux/poll.h>
  109. #include <linux/tcp.h>
  110. #include <linux/init.h>
  111. #include <linux/highmem.h>
  112. #include <asm/uaccess.h>
  113. #include <asm/system.h>
  114. #include <linux/netdevice.h>
  115. #include <net/protocol.h>
  116. #include <linux/skbuff.h>
  117. #include <net/net_namespace.h>
  118. #include <net/request_sock.h>
  119. #include <net/sock.h>
  120. #include <linux/net_tstamp.h>
  121. #include <net/xfrm.h>
  122. #include <linux/ipsec.h>
  123. #include <linux/filter.h>
  124. #ifdef CONFIG_INET
  125. #include <net/tcp.h>
  126. #endif
  127. /*
  128. * Each address family might have different locking rules, so we have
  129. * one slock key per address family:
  130. */
  131. static struct lock_class_key af_family_keys[AF_MAX];
  132. static struct lock_class_key af_family_slock_keys[AF_MAX];
  133. /*
  134. * Make lock validator output more readable. (we pre-construct these
  135. * strings build-time, so that runtime initialization of socket
  136. * locks is fast):
  137. */
  138. static const char *const af_family_key_strings[AF_MAX+1] = {
  139. "sk_lock-AF_UNSPEC", "sk_lock-AF_UNIX" , "sk_lock-AF_INET" ,
  140. "sk_lock-AF_AX25" , "sk_lock-AF_IPX" , "sk_lock-AF_APPLETALK",
  141. "sk_lock-AF_NETROM", "sk_lock-AF_BRIDGE" , "sk_lock-AF_ATMPVC" ,
  142. "sk_lock-AF_X25" , "sk_lock-AF_INET6" , "sk_lock-AF_ROSE" ,
  143. "sk_lock-AF_DECnet", "sk_lock-AF_NETBEUI" , "sk_lock-AF_SECURITY" ,
  144. "sk_lock-AF_KEY" , "sk_lock-AF_NETLINK" , "sk_lock-AF_PACKET" ,
  145. "sk_lock-AF_ASH" , "sk_lock-AF_ECONET" , "sk_lock-AF_ATMSVC" ,
  146. "sk_lock-AF_RDS" , "sk_lock-AF_SNA" , "sk_lock-AF_IRDA" ,
  147. "sk_lock-AF_PPPOX" , "sk_lock-AF_WANPIPE" , "sk_lock-AF_LLC" ,
  148. "sk_lock-27" , "sk_lock-28" , "sk_lock-AF_CAN" ,
  149. "sk_lock-AF_TIPC" , "sk_lock-AF_BLUETOOTH", "sk_lock-IUCV" ,
  150. "sk_lock-AF_RXRPC" , "sk_lock-AF_ISDN" , "sk_lock-AF_PHONET" ,
  151. "sk_lock-AF_IEEE802154",
  152. "sk_lock-AF_MAX"
  153. };
  154. static const char *const af_family_slock_key_strings[AF_MAX+1] = {
  155. "slock-AF_UNSPEC", "slock-AF_UNIX" , "slock-AF_INET" ,
  156. "slock-AF_AX25" , "slock-AF_IPX" , "slock-AF_APPLETALK",
  157. "slock-AF_NETROM", "slock-AF_BRIDGE" , "slock-AF_ATMPVC" ,
  158. "slock-AF_X25" , "slock-AF_INET6" , "slock-AF_ROSE" ,
  159. "slock-AF_DECnet", "slock-AF_NETBEUI" , "slock-AF_SECURITY" ,
  160. "slock-AF_KEY" , "slock-AF_NETLINK" , "slock-AF_PACKET" ,
  161. "slock-AF_ASH" , "slock-AF_ECONET" , "slock-AF_ATMSVC" ,
  162. "slock-AF_RDS" , "slock-AF_SNA" , "slock-AF_IRDA" ,
  163. "slock-AF_PPPOX" , "slock-AF_WANPIPE" , "slock-AF_LLC" ,
  164. "slock-27" , "slock-28" , "slock-AF_CAN" ,
  165. "slock-AF_TIPC" , "slock-AF_BLUETOOTH", "slock-AF_IUCV" ,
  166. "slock-AF_RXRPC" , "slock-AF_ISDN" , "slock-AF_PHONET" ,
  167. "slock-AF_IEEE802154",
  168. "slock-AF_MAX"
  169. };
  170. static const char *const af_family_clock_key_strings[AF_MAX+1] = {
  171. "clock-AF_UNSPEC", "clock-AF_UNIX" , "clock-AF_INET" ,
  172. "clock-AF_AX25" , "clock-AF_IPX" , "clock-AF_APPLETALK",
  173. "clock-AF_NETROM", "clock-AF_BRIDGE" , "clock-AF_ATMPVC" ,
  174. "clock-AF_X25" , "clock-AF_INET6" , "clock-AF_ROSE" ,
  175. "clock-AF_DECnet", "clock-AF_NETBEUI" , "clock-AF_SECURITY" ,
  176. "clock-AF_KEY" , "clock-AF_NETLINK" , "clock-AF_PACKET" ,
  177. "clock-AF_ASH" , "clock-AF_ECONET" , "clock-AF_ATMSVC" ,
  178. "clock-AF_RDS" , "clock-AF_SNA" , "clock-AF_IRDA" ,
  179. "clock-AF_PPPOX" , "clock-AF_WANPIPE" , "clock-AF_LLC" ,
  180. "clock-27" , "clock-28" , "clock-AF_CAN" ,
  181. "clock-AF_TIPC" , "clock-AF_BLUETOOTH", "clock-AF_IUCV" ,
  182. "clock-AF_RXRPC" , "clock-AF_ISDN" , "clock-AF_PHONET" ,
  183. "clock-AF_IEEE802154",
  184. "clock-AF_MAX"
  185. };
  186. /*
  187. * sk_callback_lock locking rules are per-address-family,
  188. * so split the lock classes by using a per-AF key:
  189. */
  190. static struct lock_class_key af_callback_keys[AF_MAX];
  191. /* Take into consideration the size of the struct sk_buff overhead in the
  192. * determination of these values, since that is non-constant across
  193. * platforms. This makes socket queueing behavior and performance
  194. * not depend upon such differences.
  195. */
  196. #define _SK_MEM_PACKETS 256
  197. #define _SK_MEM_OVERHEAD (sizeof(struct sk_buff) + 256)
  198. #define SK_WMEM_MAX (_SK_MEM_OVERHEAD * _SK_MEM_PACKETS)
  199. #define SK_RMEM_MAX (_SK_MEM_OVERHEAD * _SK_MEM_PACKETS)
  200. /* Run time adjustable parameters. */
  201. __u32 sysctl_wmem_max __read_mostly = SK_WMEM_MAX;
  202. __u32 sysctl_rmem_max __read_mostly = SK_RMEM_MAX;
  203. __u32 sysctl_wmem_default __read_mostly = SK_WMEM_MAX;
  204. __u32 sysctl_rmem_default __read_mostly = SK_RMEM_MAX;
  205. /* Maximal space eaten by iovec or ancilliary data plus some space */
  206. int sysctl_optmem_max __read_mostly = sizeof(unsigned long)*(2*UIO_MAXIOV+512);
  207. EXPORT_SYMBOL(sysctl_optmem_max);
  208. static int sock_set_timeout(long *timeo_p, char __user *optval, int optlen)
  209. {
  210. struct timeval tv;
  211. if (optlen < sizeof(tv))
  212. return -EINVAL;
  213. if (copy_from_user(&tv, optval, sizeof(tv)))
  214. return -EFAULT;
  215. if (tv.tv_usec < 0 || tv.tv_usec >= USEC_PER_SEC)
  216. return -EDOM;
  217. if (tv.tv_sec < 0) {
  218. static int warned __read_mostly;
  219. *timeo_p = 0;
  220. if (warned < 10 && net_ratelimit()) {
  221. warned++;
  222. printk(KERN_INFO "sock_set_timeout: `%s' (pid %d) "
  223. "tries to set negative timeout\n",
  224. current->comm, task_pid_nr(current));
  225. }
  226. return 0;
  227. }
  228. *timeo_p = MAX_SCHEDULE_TIMEOUT;
  229. if (tv.tv_sec == 0 && tv.tv_usec == 0)
  230. return 0;
  231. if (tv.tv_sec < (MAX_SCHEDULE_TIMEOUT/HZ - 1))
  232. *timeo_p = tv.tv_sec*HZ + (tv.tv_usec+(1000000/HZ-1))/(1000000/HZ);
  233. return 0;
  234. }
  235. static void sock_warn_obsolete_bsdism(const char *name)
  236. {
  237. static int warned;
  238. static char warncomm[TASK_COMM_LEN];
  239. if (strcmp(warncomm, current->comm) && warned < 5) {
  240. strcpy(warncomm, current->comm);
  241. printk(KERN_WARNING "process `%s' is using obsolete "
  242. "%s SO_BSDCOMPAT\n", warncomm, name);
  243. warned++;
  244. }
  245. }
  246. static void sock_disable_timestamp(struct sock *sk, int flag)
  247. {
  248. if (sock_flag(sk, flag)) {
  249. sock_reset_flag(sk, flag);
  250. if (!sock_flag(sk, SOCK_TIMESTAMP) &&
  251. !sock_flag(sk, SOCK_TIMESTAMPING_RX_SOFTWARE)) {
  252. net_disable_timestamp();
  253. }
  254. }
  255. }
  256. int sock_queue_rcv_skb(struct sock *sk, struct sk_buff *skb)
  257. {
  258. int err = 0;
  259. int skb_len;
  260. /* Cast sk->rcvbuf to unsigned... It's pointless, but reduces
  261. number of warnings when compiling with -W --ANK
  262. */
  263. if (atomic_read(&sk->sk_rmem_alloc) + skb->truesize >=
  264. (unsigned)sk->sk_rcvbuf) {
  265. err = -ENOMEM;
  266. goto out;
  267. }
  268. err = sk_filter(sk, skb);
  269. if (err)
  270. goto out;
  271. if (!sk_rmem_schedule(sk, skb->truesize)) {
  272. err = -ENOBUFS;
  273. goto out;
  274. }
  275. skb->dev = NULL;
  276. skb_set_owner_r(skb, sk);
  277. /* Cache the SKB length before we tack it onto the receive
  278. * queue. Once it is added it no longer belongs to us and
  279. * may be freed by other threads of control pulling packets
  280. * from the queue.
  281. */
  282. skb_len = skb->len;
  283. skb_queue_tail(&sk->sk_receive_queue, skb);
  284. if (!sock_flag(sk, SOCK_DEAD))
  285. sk->sk_data_ready(sk, skb_len);
  286. out:
  287. return err;
  288. }
  289. EXPORT_SYMBOL(sock_queue_rcv_skb);
  290. int sk_receive_skb(struct sock *sk, struct sk_buff *skb, const int nested)
  291. {
  292. int rc = NET_RX_SUCCESS;
  293. if (sk_filter(sk, skb))
  294. goto discard_and_relse;
  295. skb->dev = NULL;
  296. if (nested)
  297. bh_lock_sock_nested(sk);
  298. else
  299. bh_lock_sock(sk);
  300. if (!sock_owned_by_user(sk)) {
  301. /*
  302. * trylock + unlock semantics:
  303. */
  304. mutex_acquire(&sk->sk_lock.dep_map, 0, 1, _RET_IP_);
  305. rc = sk_backlog_rcv(sk, skb);
  306. mutex_release(&sk->sk_lock.dep_map, 1, _RET_IP_);
  307. } else
  308. sk_add_backlog(sk, skb);
  309. bh_unlock_sock(sk);
  310. out:
  311. sock_put(sk);
  312. return rc;
  313. discard_and_relse:
  314. kfree_skb(skb);
  315. goto out;
  316. }
  317. EXPORT_SYMBOL(sk_receive_skb);
  318. struct dst_entry *__sk_dst_check(struct sock *sk, u32 cookie)
  319. {
  320. struct dst_entry *dst = sk->sk_dst_cache;
  321. if (dst && dst->obsolete && dst->ops->check(dst, cookie) == NULL) {
  322. sk->sk_dst_cache = NULL;
  323. dst_release(dst);
  324. return NULL;
  325. }
  326. return dst;
  327. }
  328. EXPORT_SYMBOL(__sk_dst_check);
  329. struct dst_entry *sk_dst_check(struct sock *sk, u32 cookie)
  330. {
  331. struct dst_entry *dst = sk_dst_get(sk);
  332. if (dst && dst->obsolete && dst->ops->check(dst, cookie) == NULL) {
  333. sk_dst_reset(sk);
  334. dst_release(dst);
  335. return NULL;
  336. }
  337. return dst;
  338. }
  339. EXPORT_SYMBOL(sk_dst_check);
  340. static int sock_bindtodevice(struct sock *sk, char __user *optval, int optlen)
  341. {
  342. int ret = -ENOPROTOOPT;
  343. #ifdef CONFIG_NETDEVICES
  344. struct net *net = sock_net(sk);
  345. char devname[IFNAMSIZ];
  346. int index;
  347. /* Sorry... */
  348. ret = -EPERM;
  349. if (!capable(CAP_NET_RAW))
  350. goto out;
  351. ret = -EINVAL;
  352. if (optlen < 0)
  353. goto out;
  354. /* Bind this socket to a particular device like "eth0",
  355. * as specified in the passed interface name. If the
  356. * name is "" or the option length is zero the socket
  357. * is not bound.
  358. */
  359. if (optlen > IFNAMSIZ - 1)
  360. optlen = IFNAMSIZ - 1;
  361. memset(devname, 0, sizeof(devname));
  362. ret = -EFAULT;
  363. if (copy_from_user(devname, optval, optlen))
  364. goto out;
  365. if (devname[0] == '\0') {
  366. index = 0;
  367. } else {
  368. struct net_device *dev = dev_get_by_name(net, devname);
  369. ret = -ENODEV;
  370. if (!dev)
  371. goto out;
  372. index = dev->ifindex;
  373. dev_put(dev);
  374. }
  375. lock_sock(sk);
  376. sk->sk_bound_dev_if = index;
  377. sk_dst_reset(sk);
  378. release_sock(sk);
  379. ret = 0;
  380. out:
  381. #endif
  382. return ret;
  383. }
  384. static inline void sock_valbool_flag(struct sock *sk, int bit, int valbool)
  385. {
  386. if (valbool)
  387. sock_set_flag(sk, bit);
  388. else
  389. sock_reset_flag(sk, bit);
  390. }
  391. /*
  392. * This is meant for all protocols to use and covers goings on
  393. * at the socket level. Everything here is generic.
  394. */
  395. int sock_setsockopt(struct socket *sock, int level, int optname,
  396. char __user *optval, int optlen)
  397. {
  398. struct sock *sk = sock->sk;
  399. int val;
  400. int valbool;
  401. struct linger ling;
  402. int ret = 0;
  403. /*
  404. * Options without arguments
  405. */
  406. if (optname == SO_BINDTODEVICE)
  407. return sock_bindtodevice(sk, optval, optlen);
  408. if (optlen < sizeof(int))
  409. return -EINVAL;
  410. if (get_user(val, (int __user *)optval))
  411. return -EFAULT;
  412. valbool = val ? 1 : 0;
  413. lock_sock(sk);
  414. switch (optname) {
  415. case SO_DEBUG:
  416. if (val && !capable(CAP_NET_ADMIN))
  417. ret = -EACCES;
  418. else
  419. sock_valbool_flag(sk, SOCK_DBG, valbool);
  420. break;
  421. case SO_REUSEADDR:
  422. sk->sk_reuse = valbool;
  423. break;
  424. case SO_TYPE:
  425. case SO_PROTOCOL:
  426. case SO_DOMAIN:
  427. case SO_ERROR:
  428. ret = -ENOPROTOOPT;
  429. break;
  430. case SO_DONTROUTE:
  431. sock_valbool_flag(sk, SOCK_LOCALROUTE, valbool);
  432. break;
  433. case SO_BROADCAST:
  434. sock_valbool_flag(sk, SOCK_BROADCAST, valbool);
  435. break;
  436. case SO_SNDBUF:
  437. /* Don't error on this BSD doesn't and if you think
  438. about it this is right. Otherwise apps have to
  439. play 'guess the biggest size' games. RCVBUF/SNDBUF
  440. are treated in BSD as hints */
  441. if (val > sysctl_wmem_max)
  442. val = sysctl_wmem_max;
  443. set_sndbuf:
  444. sk->sk_userlocks |= SOCK_SNDBUF_LOCK;
  445. if ((val * 2) < SOCK_MIN_SNDBUF)
  446. sk->sk_sndbuf = SOCK_MIN_SNDBUF;
  447. else
  448. sk->sk_sndbuf = val * 2;
  449. /*
  450. * Wake up sending tasks if we
  451. * upped the value.
  452. */
  453. sk->sk_write_space(sk);
  454. break;
  455. case SO_SNDBUFFORCE:
  456. if (!capable(CAP_NET_ADMIN)) {
  457. ret = -EPERM;
  458. break;
  459. }
  460. goto set_sndbuf;
  461. case SO_RCVBUF:
  462. /* Don't error on this BSD doesn't and if you think
  463. about it this is right. Otherwise apps have to
  464. play 'guess the biggest size' games. RCVBUF/SNDBUF
  465. are treated in BSD as hints */
  466. if (val > sysctl_rmem_max)
  467. val = sysctl_rmem_max;
  468. set_rcvbuf:
  469. sk->sk_userlocks |= SOCK_RCVBUF_LOCK;
  470. /*
  471. * We double it on the way in to account for
  472. * "struct sk_buff" etc. overhead. Applications
  473. * assume that the SO_RCVBUF setting they make will
  474. * allow that much actual data to be received on that
  475. * socket.
  476. *
  477. * Applications are unaware that "struct sk_buff" and
  478. * other overheads allocate from the receive buffer
  479. * during socket buffer allocation.
  480. *
  481. * And after considering the possible alternatives,
  482. * returning the value we actually used in getsockopt
  483. * is the most desirable behavior.
  484. */
  485. if ((val * 2) < SOCK_MIN_RCVBUF)
  486. sk->sk_rcvbuf = SOCK_MIN_RCVBUF;
  487. else
  488. sk->sk_rcvbuf = val * 2;
  489. break;
  490. case SO_RCVBUFFORCE:
  491. if (!capable(CAP_NET_ADMIN)) {
  492. ret = -EPERM;
  493. break;
  494. }
  495. goto set_rcvbuf;
  496. case SO_KEEPALIVE:
  497. #ifdef CONFIG_INET
  498. if (sk->sk_protocol == IPPROTO_TCP)
  499. tcp_set_keepalive(sk, valbool);
  500. #endif
  501. sock_valbool_flag(sk, SOCK_KEEPOPEN, valbool);
  502. break;
  503. case SO_OOBINLINE:
  504. sock_valbool_flag(sk, SOCK_URGINLINE, valbool);
  505. break;
  506. case SO_NO_CHECK:
  507. sk->sk_no_check = valbool;
  508. break;
  509. case SO_PRIORITY:
  510. if ((val >= 0 && val <= 6) || capable(CAP_NET_ADMIN))
  511. sk->sk_priority = val;
  512. else
  513. ret = -EPERM;
  514. break;
  515. case SO_LINGER:
  516. if (optlen < sizeof(ling)) {
  517. ret = -EINVAL; /* 1003.1g */
  518. break;
  519. }
  520. if (copy_from_user(&ling, optval, sizeof(ling))) {
  521. ret = -EFAULT;
  522. break;
  523. }
  524. if (!ling.l_onoff)
  525. sock_reset_flag(sk, SOCK_LINGER);
  526. else {
  527. #if (BITS_PER_LONG == 32)
  528. if ((unsigned int)ling.l_linger >= MAX_SCHEDULE_TIMEOUT/HZ)
  529. sk->sk_lingertime = MAX_SCHEDULE_TIMEOUT;
  530. else
  531. #endif
  532. sk->sk_lingertime = (unsigned int)ling.l_linger * HZ;
  533. sock_set_flag(sk, SOCK_LINGER);
  534. }
  535. break;
  536. case SO_BSDCOMPAT:
  537. sock_warn_obsolete_bsdism("setsockopt");
  538. break;
  539. case SO_PASSCRED:
  540. if (valbool)
  541. set_bit(SOCK_PASSCRED, &sock->flags);
  542. else
  543. clear_bit(SOCK_PASSCRED, &sock->flags);
  544. break;
  545. case SO_TIMESTAMP:
  546. case SO_TIMESTAMPNS:
  547. if (valbool) {
  548. if (optname == SO_TIMESTAMP)
  549. sock_reset_flag(sk, SOCK_RCVTSTAMPNS);
  550. else
  551. sock_set_flag(sk, SOCK_RCVTSTAMPNS);
  552. sock_set_flag(sk, SOCK_RCVTSTAMP);
  553. sock_enable_timestamp(sk, SOCK_TIMESTAMP);
  554. } else {
  555. sock_reset_flag(sk, SOCK_RCVTSTAMP);
  556. sock_reset_flag(sk, SOCK_RCVTSTAMPNS);
  557. }
  558. break;
  559. case SO_TIMESTAMPING:
  560. if (val & ~SOF_TIMESTAMPING_MASK) {
  561. ret = -EINVAL;
  562. break;
  563. }
  564. sock_valbool_flag(sk, SOCK_TIMESTAMPING_TX_HARDWARE,
  565. val & SOF_TIMESTAMPING_TX_HARDWARE);
  566. sock_valbool_flag(sk, SOCK_TIMESTAMPING_TX_SOFTWARE,
  567. val & SOF_TIMESTAMPING_TX_SOFTWARE);
  568. sock_valbool_flag(sk, SOCK_TIMESTAMPING_RX_HARDWARE,
  569. val & SOF_TIMESTAMPING_RX_HARDWARE);
  570. if (val & SOF_TIMESTAMPING_RX_SOFTWARE)
  571. sock_enable_timestamp(sk,
  572. SOCK_TIMESTAMPING_RX_SOFTWARE);
  573. else
  574. sock_disable_timestamp(sk,
  575. SOCK_TIMESTAMPING_RX_SOFTWARE);
  576. sock_valbool_flag(sk, SOCK_TIMESTAMPING_SOFTWARE,
  577. val & SOF_TIMESTAMPING_SOFTWARE);
  578. sock_valbool_flag(sk, SOCK_TIMESTAMPING_SYS_HARDWARE,
  579. val & SOF_TIMESTAMPING_SYS_HARDWARE);
  580. sock_valbool_flag(sk, SOCK_TIMESTAMPING_RAW_HARDWARE,
  581. val & SOF_TIMESTAMPING_RAW_HARDWARE);
  582. break;
  583. case SO_RCVLOWAT:
  584. if (val < 0)
  585. val = INT_MAX;
  586. sk->sk_rcvlowat = val ? : 1;
  587. break;
  588. case SO_RCVTIMEO:
  589. ret = sock_set_timeout(&sk->sk_rcvtimeo, optval, optlen);
  590. break;
  591. case SO_SNDTIMEO:
  592. ret = sock_set_timeout(&sk->sk_sndtimeo, optval, optlen);
  593. break;
  594. case SO_ATTACH_FILTER:
  595. ret = -EINVAL;
  596. if (optlen == sizeof(struct sock_fprog)) {
  597. struct sock_fprog fprog;
  598. ret = -EFAULT;
  599. if (copy_from_user(&fprog, optval, sizeof(fprog)))
  600. break;
  601. ret = sk_attach_filter(&fprog, sk);
  602. }
  603. break;
  604. case SO_DETACH_FILTER:
  605. ret = sk_detach_filter(sk);
  606. break;
  607. case SO_PASSSEC:
  608. if (valbool)
  609. set_bit(SOCK_PASSSEC, &sock->flags);
  610. else
  611. clear_bit(SOCK_PASSSEC, &sock->flags);
  612. break;
  613. case SO_MARK:
  614. if (!capable(CAP_NET_ADMIN))
  615. ret = -EPERM;
  616. else
  617. sk->sk_mark = val;
  618. break;
  619. /* We implement the SO_SNDLOWAT etc to
  620. not be settable (1003.1g 5.3) */
  621. default:
  622. ret = -ENOPROTOOPT;
  623. break;
  624. }
  625. release_sock(sk);
  626. return ret;
  627. }
  628. EXPORT_SYMBOL(sock_setsockopt);
  629. int sock_getsockopt(struct socket *sock, int level, int optname,
  630. char __user *optval, int __user *optlen)
  631. {
  632. struct sock *sk = sock->sk;
  633. union {
  634. int val;
  635. struct linger ling;
  636. struct timeval tm;
  637. } v;
  638. unsigned int lv = sizeof(int);
  639. int len;
  640. if (get_user(len, optlen))
  641. return -EFAULT;
  642. if (len < 0)
  643. return -EINVAL;
  644. memset(&v, 0, sizeof(v));
  645. switch (optname) {
  646. case SO_DEBUG:
  647. v.val = sock_flag(sk, SOCK_DBG);
  648. break;
  649. case SO_DONTROUTE:
  650. v.val = sock_flag(sk, SOCK_LOCALROUTE);
  651. break;
  652. case SO_BROADCAST:
  653. v.val = !!sock_flag(sk, SOCK_BROADCAST);
  654. break;
  655. case SO_SNDBUF:
  656. v.val = sk->sk_sndbuf;
  657. break;
  658. case SO_RCVBUF:
  659. v.val = sk->sk_rcvbuf;
  660. break;
  661. case SO_REUSEADDR:
  662. v.val = sk->sk_reuse;
  663. break;
  664. case SO_KEEPALIVE:
  665. v.val = !!sock_flag(sk, SOCK_KEEPOPEN);
  666. break;
  667. case SO_TYPE:
  668. v.val = sk->sk_type;
  669. break;
  670. case SO_PROTOCOL:
  671. v.val = sk->sk_protocol;
  672. break;
  673. case SO_DOMAIN:
  674. v.val = sk->sk_family;
  675. break;
  676. case SO_ERROR:
  677. v.val = -sock_error(sk);
  678. if (v.val == 0)
  679. v.val = xchg(&sk->sk_err_soft, 0);
  680. break;
  681. case SO_OOBINLINE:
  682. v.val = !!sock_flag(sk, SOCK_URGINLINE);
  683. break;
  684. case SO_NO_CHECK:
  685. v.val = sk->sk_no_check;
  686. break;
  687. case SO_PRIORITY:
  688. v.val = sk->sk_priority;
  689. break;
  690. case SO_LINGER:
  691. lv = sizeof(v.ling);
  692. v.ling.l_onoff = !!sock_flag(sk, SOCK_LINGER);
  693. v.ling.l_linger = sk->sk_lingertime / HZ;
  694. break;
  695. case SO_BSDCOMPAT:
  696. sock_warn_obsolete_bsdism("getsockopt");
  697. break;
  698. case SO_TIMESTAMP:
  699. v.val = sock_flag(sk, SOCK_RCVTSTAMP) &&
  700. !sock_flag(sk, SOCK_RCVTSTAMPNS);
  701. break;
  702. case SO_TIMESTAMPNS:
  703. v.val = sock_flag(sk, SOCK_RCVTSTAMPNS);
  704. break;
  705. case SO_TIMESTAMPING:
  706. v.val = 0;
  707. if (sock_flag(sk, SOCK_TIMESTAMPING_TX_HARDWARE))
  708. v.val |= SOF_TIMESTAMPING_TX_HARDWARE;
  709. if (sock_flag(sk, SOCK_TIMESTAMPING_TX_SOFTWARE))
  710. v.val |= SOF_TIMESTAMPING_TX_SOFTWARE;
  711. if (sock_flag(sk, SOCK_TIMESTAMPING_RX_HARDWARE))
  712. v.val |= SOF_TIMESTAMPING_RX_HARDWARE;
  713. if (sock_flag(sk, SOCK_TIMESTAMPING_RX_SOFTWARE))
  714. v.val |= SOF_TIMESTAMPING_RX_SOFTWARE;
  715. if (sock_flag(sk, SOCK_TIMESTAMPING_SOFTWARE))
  716. v.val |= SOF_TIMESTAMPING_SOFTWARE;
  717. if (sock_flag(sk, SOCK_TIMESTAMPING_SYS_HARDWARE))
  718. v.val |= SOF_TIMESTAMPING_SYS_HARDWARE;
  719. if (sock_flag(sk, SOCK_TIMESTAMPING_RAW_HARDWARE))
  720. v.val |= SOF_TIMESTAMPING_RAW_HARDWARE;
  721. break;
  722. case SO_RCVTIMEO:
  723. lv = sizeof(struct timeval);
  724. if (sk->sk_rcvtimeo == MAX_SCHEDULE_TIMEOUT) {
  725. v.tm.tv_sec = 0;
  726. v.tm.tv_usec = 0;
  727. } else {
  728. v.tm.tv_sec = sk->sk_rcvtimeo / HZ;
  729. v.tm.tv_usec = ((sk->sk_rcvtimeo % HZ) * 1000000) / HZ;
  730. }
  731. break;
  732. case SO_SNDTIMEO:
  733. lv = sizeof(struct timeval);
  734. if (sk->sk_sndtimeo == MAX_SCHEDULE_TIMEOUT) {
  735. v.tm.tv_sec = 0;
  736. v.tm.tv_usec = 0;
  737. } else {
  738. v.tm.tv_sec = sk->sk_sndtimeo / HZ;
  739. v.tm.tv_usec = ((sk->sk_sndtimeo % HZ) * 1000000) / HZ;
  740. }
  741. break;
  742. case SO_RCVLOWAT:
  743. v.val = sk->sk_rcvlowat;
  744. break;
  745. case SO_SNDLOWAT:
  746. v.val = 1;
  747. break;
  748. case SO_PASSCRED:
  749. v.val = test_bit(SOCK_PASSCRED, &sock->flags) ? 1 : 0;
  750. break;
  751. case SO_PEERCRED:
  752. if (len > sizeof(sk->sk_peercred))
  753. len = sizeof(sk->sk_peercred);
  754. if (copy_to_user(optval, &sk->sk_peercred, len))
  755. return -EFAULT;
  756. goto lenout;
  757. case SO_PEERNAME:
  758. {
  759. char address[128];
  760. if (sock->ops->getname(sock, (struct sockaddr *)address, &lv, 2))
  761. return -ENOTCONN;
  762. if (lv < len)
  763. return -EINVAL;
  764. if (copy_to_user(optval, address, len))
  765. return -EFAULT;
  766. goto lenout;
  767. }
  768. /* Dubious BSD thing... Probably nobody even uses it, but
  769. * the UNIX standard wants it for whatever reason... -DaveM
  770. */
  771. case SO_ACCEPTCONN:
  772. v.val = sk->sk_state == TCP_LISTEN;
  773. break;
  774. case SO_PASSSEC:
  775. v.val = test_bit(SOCK_PASSSEC, &sock->flags) ? 1 : 0;
  776. break;
  777. case SO_PEERSEC:
  778. return security_socket_getpeersec_stream(sock, optval, optlen, len);
  779. case SO_MARK:
  780. v.val = sk->sk_mark;
  781. break;
  782. default:
  783. return -ENOPROTOOPT;
  784. }
  785. if (len > lv)
  786. len = lv;
  787. if (copy_to_user(optval, &v, len))
  788. return -EFAULT;
  789. lenout:
  790. if (put_user(len, optlen))
  791. return -EFAULT;
  792. return 0;
  793. }
  794. /*
  795. * Initialize an sk_lock.
  796. *
  797. * (We also register the sk_lock with the lock validator.)
  798. */
  799. static inline void sock_lock_init(struct sock *sk)
  800. {
  801. sock_lock_init_class_and_name(sk,
  802. af_family_slock_key_strings[sk->sk_family],
  803. af_family_slock_keys + sk->sk_family,
  804. af_family_key_strings[sk->sk_family],
  805. af_family_keys + sk->sk_family);
  806. }
  807. /*
  808. * Copy all fields from osk to nsk but nsk->sk_refcnt must not change yet,
  809. * even temporarly, because of RCU lookups. sk_node should also be left as is.
  810. */
  811. static void sock_copy(struct sock *nsk, const struct sock *osk)
  812. {
  813. #ifdef CONFIG_SECURITY_NETWORK
  814. void *sptr = nsk->sk_security;
  815. #endif
  816. BUILD_BUG_ON(offsetof(struct sock, sk_copy_start) !=
  817. sizeof(osk->sk_node) + sizeof(osk->sk_refcnt));
  818. memcpy(&nsk->sk_copy_start, &osk->sk_copy_start,
  819. osk->sk_prot->obj_size - offsetof(struct sock, sk_copy_start));
  820. #ifdef CONFIG_SECURITY_NETWORK
  821. nsk->sk_security = sptr;
  822. security_sk_clone(osk, nsk);
  823. #endif
  824. }
  825. static struct sock *sk_prot_alloc(struct proto *prot, gfp_t priority,
  826. int family)
  827. {
  828. struct sock *sk;
  829. struct kmem_cache *slab;
  830. slab = prot->slab;
  831. if (slab != NULL) {
  832. sk = kmem_cache_alloc(slab, priority & ~__GFP_ZERO);
  833. if (!sk)
  834. return sk;
  835. if (priority & __GFP_ZERO) {
  836. /*
  837. * caches using SLAB_DESTROY_BY_RCU should let
  838. * sk_node.next un-modified. Special care is taken
  839. * when initializing object to zero.
  840. */
  841. if (offsetof(struct sock, sk_node.next) != 0)
  842. memset(sk, 0, offsetof(struct sock, sk_node.next));
  843. memset(&sk->sk_node.pprev, 0,
  844. prot->obj_size - offsetof(struct sock,
  845. sk_node.pprev));
  846. }
  847. }
  848. else
  849. sk = kmalloc(prot->obj_size, priority);
  850. if (sk != NULL) {
  851. kmemcheck_annotate_bitfield(sk, flags);
  852. if (security_sk_alloc(sk, family, priority))
  853. goto out_free;
  854. if (!try_module_get(prot->owner))
  855. goto out_free_sec;
  856. }
  857. return sk;
  858. out_free_sec:
  859. security_sk_free(sk);
  860. out_free:
  861. if (slab != NULL)
  862. kmem_cache_free(slab, sk);
  863. else
  864. kfree(sk);
  865. return NULL;
  866. }
  867. static void sk_prot_free(struct proto *prot, struct sock *sk)
  868. {
  869. struct kmem_cache *slab;
  870. struct module *owner;
  871. owner = prot->owner;
  872. slab = prot->slab;
  873. security_sk_free(sk);
  874. if (slab != NULL)
  875. kmem_cache_free(slab, sk);
  876. else
  877. kfree(sk);
  878. module_put(owner);
  879. }
  880. /**
  881. * sk_alloc - All socket objects are allocated here
  882. * @net: the applicable net namespace
  883. * @family: protocol family
  884. * @priority: for allocation (%GFP_KERNEL, %GFP_ATOMIC, etc)
  885. * @prot: struct proto associated with this new sock instance
  886. */
  887. struct sock *sk_alloc(struct net *net, int family, gfp_t priority,
  888. struct proto *prot)
  889. {
  890. struct sock *sk;
  891. sk = sk_prot_alloc(prot, priority | __GFP_ZERO, family);
  892. if (sk) {
  893. sk->sk_family = family;
  894. /*
  895. * See comment in struct sock definition to understand
  896. * why we need sk_prot_creator -acme
  897. */
  898. sk->sk_prot = sk->sk_prot_creator = prot;
  899. sock_lock_init(sk);
  900. sock_net_set(sk, get_net(net));
  901. atomic_set(&sk->sk_wmem_alloc, 1);
  902. }
  903. return sk;
  904. }
  905. EXPORT_SYMBOL(sk_alloc);
  906. static void __sk_free(struct sock *sk)
  907. {
  908. struct sk_filter *filter;
  909. if (sk->sk_destruct)
  910. sk->sk_destruct(sk);
  911. filter = rcu_dereference(sk->sk_filter);
  912. if (filter) {
  913. sk_filter_uncharge(sk, filter);
  914. rcu_assign_pointer(sk->sk_filter, NULL);
  915. }
  916. sock_disable_timestamp(sk, SOCK_TIMESTAMP);
  917. sock_disable_timestamp(sk, SOCK_TIMESTAMPING_RX_SOFTWARE);
  918. if (atomic_read(&sk->sk_omem_alloc))
  919. printk(KERN_DEBUG "%s: optmem leakage (%d bytes) detected.\n",
  920. __func__, atomic_read(&sk->sk_omem_alloc));
  921. put_net(sock_net(sk));
  922. sk_prot_free(sk->sk_prot_creator, sk);
  923. }
  924. void sk_free(struct sock *sk)
  925. {
  926. /*
  927. * We substract one from sk_wmem_alloc and can know if
  928. * some packets are still in some tx queue.
  929. * If not null, sock_wfree() will call __sk_free(sk) later
  930. */
  931. if (atomic_dec_and_test(&sk->sk_wmem_alloc))
  932. __sk_free(sk);
  933. }
  934. EXPORT_SYMBOL(sk_free);
  935. /*
  936. * Last sock_put should drop referrence to sk->sk_net. It has already
  937. * been dropped in sk_change_net. Taking referrence to stopping namespace
  938. * is not an option.
  939. * Take referrence to a socket to remove it from hash _alive_ and after that
  940. * destroy it in the context of init_net.
  941. */
  942. void sk_release_kernel(struct sock *sk)
  943. {
  944. if (sk == NULL || sk->sk_socket == NULL)
  945. return;
  946. sock_hold(sk);
  947. sock_release(sk->sk_socket);
  948. release_net(sock_net(sk));
  949. sock_net_set(sk, get_net(&init_net));
  950. sock_put(sk);
  951. }
  952. EXPORT_SYMBOL(sk_release_kernel);
  953. struct sock *sk_clone(const struct sock *sk, const gfp_t priority)
  954. {
  955. struct sock *newsk;
  956. newsk = sk_prot_alloc(sk->sk_prot, priority, sk->sk_family);
  957. if (newsk != NULL) {
  958. struct sk_filter *filter;
  959. sock_copy(newsk, sk);
  960. /* SANITY */
  961. get_net(sock_net(newsk));
  962. sk_node_init(&newsk->sk_node);
  963. sock_lock_init(newsk);
  964. bh_lock_sock(newsk);
  965. newsk->sk_backlog.head = newsk->sk_backlog.tail = NULL;
  966. atomic_set(&newsk->sk_rmem_alloc, 0);
  967. /*
  968. * sk_wmem_alloc set to one (see sk_free() and sock_wfree())
  969. */
  970. atomic_set(&newsk->sk_wmem_alloc, 1);
  971. atomic_set(&newsk->sk_omem_alloc, 0);
  972. skb_queue_head_init(&newsk->sk_receive_queue);
  973. skb_queue_head_init(&newsk->sk_write_queue);
  974. #ifdef CONFIG_NET_DMA
  975. skb_queue_head_init(&newsk->sk_async_wait_queue);
  976. #endif
  977. rwlock_init(&newsk->sk_dst_lock);
  978. rwlock_init(&newsk->sk_callback_lock);
  979. lockdep_set_class_and_name(&newsk->sk_callback_lock,
  980. af_callback_keys + newsk->sk_family,
  981. af_family_clock_key_strings[newsk->sk_family]);
  982. newsk->sk_dst_cache = NULL;
  983. newsk->sk_wmem_queued = 0;
  984. newsk->sk_forward_alloc = 0;
  985. newsk->sk_send_head = NULL;
  986. newsk->sk_userlocks = sk->sk_userlocks & ~SOCK_BINDPORT_LOCK;
  987. sock_reset_flag(newsk, SOCK_DONE);
  988. skb_queue_head_init(&newsk->sk_error_queue);
  989. filter = newsk->sk_filter;
  990. if (filter != NULL)
  991. sk_filter_charge(newsk, filter);
  992. if (unlikely(xfrm_sk_clone_policy(newsk))) {
  993. /* It is still raw copy of parent, so invalidate
  994. * destructor and make plain sk_free() */
  995. newsk->sk_destruct = NULL;
  996. sk_free(newsk);
  997. newsk = NULL;
  998. goto out;
  999. }
  1000. newsk->sk_err = 0;
  1001. newsk->sk_priority = 0;
  1002. /*
  1003. * Before updating sk_refcnt, we must commit prior changes to memory
  1004. * (Documentation/RCU/rculist_nulls.txt for details)
  1005. */
  1006. smp_wmb();
  1007. atomic_set(&newsk->sk_refcnt, 2);
  1008. /*
  1009. * Increment the counter in the same struct proto as the master
  1010. * sock (sk_refcnt_debug_inc uses newsk->sk_prot->socks, that
  1011. * is the same as sk->sk_prot->socks, as this field was copied
  1012. * with memcpy).
  1013. *
  1014. * This _changes_ the previous behaviour, where
  1015. * tcp_create_openreq_child always was incrementing the
  1016. * equivalent to tcp_prot->socks (inet_sock_nr), so this have
  1017. * to be taken into account in all callers. -acme
  1018. */
  1019. sk_refcnt_debug_inc(newsk);
  1020. sk_set_socket(newsk, NULL);
  1021. newsk->sk_sleep = NULL;
  1022. if (newsk->sk_prot->sockets_allocated)
  1023. percpu_counter_inc(newsk->sk_prot->sockets_allocated);
  1024. }
  1025. out:
  1026. return newsk;
  1027. }
  1028. EXPORT_SYMBOL_GPL(sk_clone);
  1029. void sk_setup_caps(struct sock *sk, struct dst_entry *dst)
  1030. {
  1031. __sk_dst_set(sk, dst);
  1032. sk->sk_route_caps = dst->dev->features;
  1033. if (sk->sk_route_caps & NETIF_F_GSO)
  1034. sk->sk_route_caps |= NETIF_F_GSO_SOFTWARE;
  1035. if (sk_can_gso(sk)) {
  1036. if (dst->header_len) {
  1037. sk->sk_route_caps &= ~NETIF_F_GSO_MASK;
  1038. } else {
  1039. sk->sk_route_caps |= NETIF_F_SG | NETIF_F_HW_CSUM;
  1040. sk->sk_gso_max_size = dst->dev->gso_max_size;
  1041. }
  1042. }
  1043. }
  1044. EXPORT_SYMBOL_GPL(sk_setup_caps);
  1045. void __init sk_init(void)
  1046. {
  1047. if (totalram_pages <= 4096) {
  1048. sysctl_wmem_max = 32767;
  1049. sysctl_rmem_max = 32767;
  1050. sysctl_wmem_default = 32767;
  1051. sysctl_rmem_default = 32767;
  1052. } else if (totalram_pages >= 131072) {
  1053. sysctl_wmem_max = 131071;
  1054. sysctl_rmem_max = 131071;
  1055. }
  1056. }
  1057. /*
  1058. * Simple resource managers for sockets.
  1059. */
  1060. /*
  1061. * Write buffer destructor automatically called from kfree_skb.
  1062. */
  1063. void sock_wfree(struct sk_buff *skb)
  1064. {
  1065. struct sock *sk = skb->sk;
  1066. int res;
  1067. /* In case it might be waiting for more memory. */
  1068. res = atomic_sub_return(skb->truesize, &sk->sk_wmem_alloc);
  1069. if (!sock_flag(sk, SOCK_USE_WRITE_QUEUE))
  1070. sk->sk_write_space(sk);
  1071. /*
  1072. * if sk_wmem_alloc reached 0, we are last user and should
  1073. * free this sock, as sk_free() call could not do it.
  1074. */
  1075. if (res == 0)
  1076. __sk_free(sk);
  1077. }
  1078. EXPORT_SYMBOL(sock_wfree);
  1079. /*
  1080. * Read buffer destructor automatically called from kfree_skb.
  1081. */
  1082. void sock_rfree(struct sk_buff *skb)
  1083. {
  1084. struct sock *sk = skb->sk;
  1085. atomic_sub(skb->truesize, &sk->sk_rmem_alloc);
  1086. sk_mem_uncharge(skb->sk, skb->truesize);
  1087. }
  1088. EXPORT_SYMBOL(sock_rfree);
  1089. int sock_i_uid(struct sock *sk)
  1090. {
  1091. int uid;
  1092. read_lock(&sk->sk_callback_lock);
  1093. uid = sk->sk_socket ? SOCK_INODE(sk->sk_socket)->i_uid : 0;
  1094. read_unlock(&sk->sk_callback_lock);
  1095. return uid;
  1096. }
  1097. EXPORT_SYMBOL(sock_i_uid);
  1098. unsigned long sock_i_ino(struct sock *sk)
  1099. {
  1100. unsigned long ino;
  1101. read_lock(&sk->sk_callback_lock);
  1102. ino = sk->sk_socket ? SOCK_INODE(sk->sk_socket)->i_ino : 0;
  1103. read_unlock(&sk->sk_callback_lock);
  1104. return ino;
  1105. }
  1106. EXPORT_SYMBOL(sock_i_ino);
  1107. /*
  1108. * Allocate a skb from the socket's send buffer.
  1109. */
  1110. struct sk_buff *sock_wmalloc(struct sock *sk, unsigned long size, int force,
  1111. gfp_t priority)
  1112. {
  1113. if (force || atomic_read(&sk->sk_wmem_alloc) < sk->sk_sndbuf) {
  1114. struct sk_buff *skb = alloc_skb(size, priority);
  1115. if (skb) {
  1116. skb_set_owner_w(skb, sk);
  1117. return skb;
  1118. }
  1119. }
  1120. return NULL;
  1121. }
  1122. EXPORT_SYMBOL(sock_wmalloc);
  1123. /*
  1124. * Allocate a skb from the socket's receive buffer.
  1125. */
  1126. struct sk_buff *sock_rmalloc(struct sock *sk, unsigned long size, int force,
  1127. gfp_t priority)
  1128. {
  1129. if (force || atomic_read(&sk->sk_rmem_alloc) < sk->sk_rcvbuf) {
  1130. struct sk_buff *skb = alloc_skb(size, priority);
  1131. if (skb) {
  1132. skb_set_owner_r(skb, sk);
  1133. return skb;
  1134. }
  1135. }
  1136. return NULL;
  1137. }
  1138. /*
  1139. * Allocate a memory block from the socket's option memory buffer.
  1140. */
  1141. void *sock_kmalloc(struct sock *sk, int size, gfp_t priority)
  1142. {
  1143. if ((unsigned)size <= sysctl_optmem_max &&
  1144. atomic_read(&sk->sk_omem_alloc) + size < sysctl_optmem_max) {
  1145. void *mem;
  1146. /* First do the add, to avoid the race if kmalloc
  1147. * might sleep.
  1148. */
  1149. atomic_add(size, &sk->sk_omem_alloc);
  1150. mem = kmalloc(size, priority);
  1151. if (mem)
  1152. return mem;
  1153. atomic_sub(size, &sk->sk_omem_alloc);
  1154. }
  1155. return NULL;
  1156. }
  1157. EXPORT_SYMBOL(sock_kmalloc);
  1158. /*
  1159. * Free an option memory block.
  1160. */
  1161. void sock_kfree_s(struct sock *sk, void *mem, int size)
  1162. {
  1163. kfree(mem);
  1164. atomic_sub(size, &sk->sk_omem_alloc);
  1165. }
  1166. EXPORT_SYMBOL(sock_kfree_s);
  1167. /* It is almost wait_for_tcp_memory minus release_sock/lock_sock.
  1168. I think, these locks should be removed for datagram sockets.
  1169. */
  1170. static long sock_wait_for_wmem(struct sock *sk, long timeo)
  1171. {
  1172. DEFINE_WAIT(wait);
  1173. clear_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  1174. for (;;) {
  1175. if (!timeo)
  1176. break;
  1177. if (signal_pending(current))
  1178. break;
  1179. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  1180. prepare_to_wait(sk->sk_sleep, &wait, TASK_INTERRUPTIBLE);
  1181. if (atomic_read(&sk->sk_wmem_alloc) < sk->sk_sndbuf)
  1182. break;
  1183. if (sk->sk_shutdown & SEND_SHUTDOWN)
  1184. break;
  1185. if (sk->sk_err)
  1186. break;
  1187. timeo = schedule_timeout(timeo);
  1188. }
  1189. finish_wait(sk->sk_sleep, &wait);
  1190. return timeo;
  1191. }
  1192. /*
  1193. * Generic send/receive buffer handlers
  1194. */
  1195. struct sk_buff *sock_alloc_send_pskb(struct sock *sk, unsigned long header_len,
  1196. unsigned long data_len, int noblock,
  1197. int *errcode)
  1198. {
  1199. struct sk_buff *skb;
  1200. gfp_t gfp_mask;
  1201. long timeo;
  1202. int err;
  1203. gfp_mask = sk->sk_allocation;
  1204. if (gfp_mask & __GFP_WAIT)
  1205. gfp_mask |= __GFP_REPEAT;
  1206. timeo = sock_sndtimeo(sk, noblock);
  1207. while (1) {
  1208. err = sock_error(sk);
  1209. if (err != 0)
  1210. goto failure;
  1211. err = -EPIPE;
  1212. if (sk->sk_shutdown & SEND_SHUTDOWN)
  1213. goto failure;
  1214. if (atomic_read(&sk->sk_wmem_alloc) < sk->sk_sndbuf) {
  1215. skb = alloc_skb(header_len, gfp_mask);
  1216. if (skb) {
  1217. int npages;
  1218. int i;
  1219. /* No pages, we're done... */
  1220. if (!data_len)
  1221. break;
  1222. npages = (data_len + (PAGE_SIZE - 1)) >> PAGE_SHIFT;
  1223. skb->truesize += data_len;
  1224. skb_shinfo(skb)->nr_frags = npages;
  1225. for (i = 0; i < npages; i++) {
  1226. struct page *page;
  1227. skb_frag_t *frag;
  1228. page = alloc_pages(sk->sk_allocation, 0);
  1229. if (!page) {
  1230. err = -ENOBUFS;
  1231. skb_shinfo(skb)->nr_frags = i;
  1232. kfree_skb(skb);
  1233. goto failure;
  1234. }
  1235. frag = &skb_shinfo(skb)->frags[i];
  1236. frag->page = page;
  1237. frag->page_offset = 0;
  1238. frag->size = (data_len >= PAGE_SIZE ?
  1239. PAGE_SIZE :
  1240. data_len);
  1241. data_len -= PAGE_SIZE;
  1242. }
  1243. /* Full success... */
  1244. break;
  1245. }
  1246. err = -ENOBUFS;
  1247. goto failure;
  1248. }
  1249. set_bit(SOCK_ASYNC_NOSPACE, &sk->sk_socket->flags);
  1250. set_bit(SOCK_NOSPACE, &sk->sk_socket->flags);
  1251. err = -EAGAIN;
  1252. if (!timeo)
  1253. goto failure;
  1254. if (signal_pending(current))
  1255. goto interrupted;
  1256. timeo = sock_wait_for_wmem(sk, timeo);
  1257. }
  1258. skb_set_owner_w(skb, sk);
  1259. return skb;
  1260. interrupted:
  1261. err = sock_intr_errno(timeo);
  1262. failure:
  1263. *errcode = err;
  1264. return NULL;
  1265. }
  1266. EXPORT_SYMBOL(sock_alloc_send_pskb);
  1267. struct sk_buff *sock_alloc_send_skb(struct sock *sk, unsigned long size,
  1268. int noblock, int *errcode)
  1269. {
  1270. return sock_alloc_send_pskb(sk, size, 0, noblock, errcode);
  1271. }
  1272. EXPORT_SYMBOL(sock_alloc_send_skb);
  1273. static void __lock_sock(struct sock *sk)
  1274. {
  1275. DEFINE_WAIT(wait);
  1276. for (;;) {
  1277. prepare_to_wait_exclusive(&sk->sk_lock.wq, &wait,
  1278. TASK_UNINTERRUPTIBLE);
  1279. spin_unlock_bh(&sk->sk_lock.slock);
  1280. schedule();
  1281. spin_lock_bh(&sk->sk_lock.slock);
  1282. if (!sock_owned_by_user(sk))
  1283. break;
  1284. }
  1285. finish_wait(&sk->sk_lock.wq, &wait);
  1286. }
  1287. static void __release_sock(struct sock *sk)
  1288. {
  1289. struct sk_buff *skb = sk->sk_backlog.head;
  1290. do {
  1291. sk->sk_backlog.head = sk->sk_backlog.tail = NULL;
  1292. bh_unlock_sock(sk);
  1293. do {
  1294. struct sk_buff *next = skb->next;
  1295. skb->next = NULL;
  1296. sk_backlog_rcv(sk, skb);
  1297. /*
  1298. * We are in process context here with softirqs
  1299. * disabled, use cond_resched_softirq() to preempt.
  1300. * This is safe to do because we've taken the backlog
  1301. * queue private:
  1302. */
  1303. cond_resched_softirq();
  1304. skb = next;
  1305. } while (skb != NULL);
  1306. bh_lock_sock(sk);
  1307. } while ((skb = sk->sk_backlog.head) != NULL);
  1308. }
  1309. /**
  1310. * sk_wait_data - wait for data to arrive at sk_receive_queue
  1311. * @sk: sock to wait on
  1312. * @timeo: for how long
  1313. *
  1314. * Now socket state including sk->sk_err is changed only under lock,
  1315. * hence we may omit checks after joining wait queue.
  1316. * We check receive queue before schedule() only as optimization;
  1317. * it is very likely that release_sock() added new data.
  1318. */
  1319. int sk_wait_data(struct sock *sk, long *timeo)
  1320. {
  1321. int rc;
  1322. DEFINE_WAIT(wait);
  1323. prepare_to_wait(sk->sk_sleep, &wait, TASK_INTERRUPTIBLE);
  1324. set_bit(SOCK_ASYNC_WAITDATA, &sk->sk_socket->flags);
  1325. rc = sk_wait_event(sk, timeo, !skb_queue_empty(&sk->sk_receive_queue));
  1326. clear_bit(SOCK_ASYNC_WAITDATA, &sk->sk_socket->flags);
  1327. finish_wait(sk->sk_sleep, &wait);
  1328. return rc;
  1329. }
  1330. EXPORT_SYMBOL(sk_wait_data);
  1331. /**
  1332. * __sk_mem_schedule - increase sk_forward_alloc and memory_allocated
  1333. * @sk: socket
  1334. * @size: memory size to allocate
  1335. * @kind: allocation type
  1336. *
  1337. * If kind is SK_MEM_SEND, it means wmem allocation. Otherwise it means
  1338. * rmem allocation. This function assumes that protocols which have
  1339. * memory_pressure use sk_wmem_queued as write buffer accounting.
  1340. */
  1341. int __sk_mem_schedule(struct sock *sk, int size, int kind)
  1342. {
  1343. struct proto *prot = sk->sk_prot;
  1344. int amt = sk_mem_pages(size);
  1345. int allocated;
  1346. sk->sk_forward_alloc += amt * SK_MEM_QUANTUM;
  1347. allocated = atomic_add_return(amt, prot->memory_allocated);
  1348. /* Under limit. */
  1349. if (allocated <= prot->sysctl_mem[0]) {
  1350. if (prot->memory_pressure && *prot->memory_pressure)
  1351. *prot->memory_pressure = 0;
  1352. return 1;
  1353. }
  1354. /* Under pressure. */
  1355. if (allocated > prot->sysctl_mem[1])
  1356. if (prot->enter_memory_pressure)
  1357. prot->enter_memory_pressure(sk);
  1358. /* Over hard limit. */
  1359. if (allocated > prot->sysctl_mem[2])
  1360. goto suppress_allocation;
  1361. /* guarantee minimum buffer size under pressure */
  1362. if (kind == SK_MEM_RECV) {
  1363. if (atomic_read(&sk->sk_rmem_alloc) < prot->sysctl_rmem[0])
  1364. return 1;
  1365. } else { /* SK_MEM_SEND */
  1366. if (sk->sk_type == SOCK_STREAM) {
  1367. if (sk->sk_wmem_queued < prot->sysctl_wmem[0])
  1368. return 1;
  1369. } else if (atomic_read(&sk->sk_wmem_alloc) <
  1370. prot->sysctl_wmem[0])
  1371. return 1;
  1372. }
  1373. if (prot->memory_pressure) {
  1374. int alloc;
  1375. if (!*prot->memory_pressure)
  1376. return 1;
  1377. alloc = percpu_counter_read_positive(prot->sockets_allocated);
  1378. if (prot->sysctl_mem[2] > alloc *
  1379. sk_mem_pages(sk->sk_wmem_queued +
  1380. atomic_read(&sk->sk_rmem_alloc) +
  1381. sk->sk_forward_alloc))
  1382. return 1;
  1383. }
  1384. suppress_allocation:
  1385. if (kind == SK_MEM_SEND && sk->sk_type == SOCK_STREAM) {
  1386. sk_stream_moderate_sndbuf(sk);
  1387. /* Fail only if socket is _under_ its sndbuf.
  1388. * In this case we cannot block, so that we have to fail.
  1389. */
  1390. if (sk->sk_wmem_queued + size >= sk->sk_sndbuf)
  1391. return 1;
  1392. }
  1393. /* Alas. Undo changes. */
  1394. sk->sk_forward_alloc -= amt * SK_MEM_QUANTUM;
  1395. atomic_sub(amt, prot->memory_allocated);
  1396. return 0;
  1397. }
  1398. EXPORT_SYMBOL(__sk_mem_schedule);
  1399. /**
  1400. * __sk_reclaim - reclaim memory_allocated
  1401. * @sk: socket
  1402. */
  1403. void __sk_mem_reclaim(struct sock *sk)
  1404. {
  1405. struct proto *prot = sk->sk_prot;
  1406. atomic_sub(sk->sk_forward_alloc >> SK_MEM_QUANTUM_SHIFT,
  1407. prot->memory_allocated);
  1408. sk->sk_forward_alloc &= SK_MEM_QUANTUM - 1;
  1409. if (prot->memory_pressure && *prot->memory_pressure &&
  1410. (atomic_read(prot->memory_allocated) < prot->sysctl_mem[0]))
  1411. *prot->memory_pressure = 0;
  1412. }
  1413. EXPORT_SYMBOL(__sk_mem_reclaim);
  1414. /*
  1415. * Set of default routines for initialising struct proto_ops when
  1416. * the protocol does not support a particular function. In certain
  1417. * cases where it makes no sense for a protocol to have a "do nothing"
  1418. * function, some default processing is provided.
  1419. */
  1420. int sock_no_bind(struct socket *sock, struct sockaddr *saddr, int len)
  1421. {
  1422. return -EOPNOTSUPP;
  1423. }
  1424. EXPORT_SYMBOL(sock_no_bind);
  1425. int sock_no_connect(struct socket *sock, struct sockaddr *saddr,
  1426. int len, int flags)
  1427. {
  1428. return -EOPNOTSUPP;
  1429. }
  1430. EXPORT_SYMBOL(sock_no_connect);
  1431. int sock_no_socketpair(struct socket *sock1, struct socket *sock2)
  1432. {
  1433. return -EOPNOTSUPP;
  1434. }
  1435. EXPORT_SYMBOL(sock_no_socketpair);
  1436. int sock_no_accept(struct socket *sock, struct socket *newsock, int flags)
  1437. {
  1438. return -EOPNOTSUPP;
  1439. }
  1440. EXPORT_SYMBOL(sock_no_accept);
  1441. int sock_no_getname(struct socket *sock, struct sockaddr *saddr,
  1442. int *len, int peer)
  1443. {
  1444. return -EOPNOTSUPP;
  1445. }
  1446. EXPORT_SYMBOL(sock_no_getname);
  1447. unsigned int sock_no_poll(struct file *file, struct socket *sock, poll_table *pt)
  1448. {
  1449. return 0;
  1450. }
  1451. EXPORT_SYMBOL(sock_no_poll);
  1452. int sock_no_ioctl(struct socket *sock, unsigned int cmd, unsigned long arg)
  1453. {
  1454. return -EOPNOTSUPP;
  1455. }
  1456. EXPORT_SYMBOL(sock_no_ioctl);
  1457. int sock_no_listen(struct socket *sock, int backlog)
  1458. {
  1459. return -EOPNOTSUPP;
  1460. }
  1461. EXPORT_SYMBOL(sock_no_listen);
  1462. int sock_no_shutdown(struct socket *sock, int how)
  1463. {
  1464. return -EOPNOTSUPP;
  1465. }
  1466. EXPORT_SYMBOL(sock_no_shutdown);
  1467. int sock_no_setsockopt(struct socket *sock, int level, int optname,
  1468. char __user *optval, int optlen)
  1469. {
  1470. return -EOPNOTSUPP;
  1471. }
  1472. EXPORT_SYMBOL(sock_no_setsockopt);
  1473. int sock_no_getsockopt(struct socket *sock, int level, int optname,
  1474. char __user *optval, int __user *optlen)
  1475. {
  1476. return -EOPNOTSUPP;
  1477. }
  1478. EXPORT_SYMBOL(sock_no_getsockopt);
  1479. int sock_no_sendmsg(struct kiocb *iocb, struct socket *sock, struct msghdr *m,
  1480. size_t len)
  1481. {
  1482. return -EOPNOTSUPP;
  1483. }
  1484. EXPORT_SYMBOL(sock_no_sendmsg);
  1485. int sock_no_recvmsg(struct kiocb *iocb, struct socket *sock, struct msghdr *m,
  1486. size_t len, int flags)
  1487. {
  1488. return -EOPNOTSUPP;
  1489. }
  1490. EXPORT_SYMBOL(sock_no_recvmsg);
  1491. int sock_no_mmap(struct file *file, struct socket *sock, struct vm_area_struct *vma)
  1492. {
  1493. /* Mirror missing mmap method error code */
  1494. return -ENODEV;
  1495. }
  1496. EXPORT_SYMBOL(sock_no_mmap);
  1497. ssize_t sock_no_sendpage(struct socket *sock, struct page *page, int offset, size_t size, int flags)
  1498. {
  1499. ssize_t res;
  1500. struct msghdr msg = {.msg_flags = flags};
  1501. struct kvec iov;
  1502. char *kaddr = kmap(page);
  1503. iov.iov_base = kaddr + offset;
  1504. iov.iov_len = size;
  1505. res = kernel_sendmsg(sock, &msg, &iov, 1, size);
  1506. kunmap(page);
  1507. return res;
  1508. }
  1509. EXPORT_SYMBOL(sock_no_sendpage);
  1510. /*
  1511. * Default Socket Callbacks
  1512. */
  1513. static void sock_def_wakeup(struct sock *sk)
  1514. {
  1515. read_lock(&sk->sk_callback_lock);
  1516. if (sk_has_sleeper(sk))
  1517. wake_up_interruptible_all(sk->sk_sleep);
  1518. read_unlock(&sk->sk_callback_lock);
  1519. }
  1520. static void sock_def_error_report(struct sock *sk)
  1521. {
  1522. read_lock(&sk->sk_callback_lock);
  1523. if (sk_has_sleeper(sk))
  1524. wake_up_interruptible_poll(sk->sk_sleep, POLLERR);
  1525. sk_wake_async(sk, SOCK_WAKE_IO, POLL_ERR);
  1526. read_unlock(&sk->sk_callback_lock);
  1527. }
  1528. static void sock_def_readable(struct sock *sk, int len)
  1529. {
  1530. read_lock(&sk->sk_callback_lock);
  1531. if (sk_has_sleeper(sk))
  1532. wake_up_interruptible_sync_poll(sk->sk_sleep, POLLIN |
  1533. POLLRDNORM | POLLRDBAND);
  1534. sk_wake_async(sk, SOCK_WAKE_WAITD, POLL_IN);
  1535. read_unlock(&sk->sk_callback_lock);
  1536. }
  1537. static void sock_def_write_space(struct sock *sk)
  1538. {
  1539. read_lock(&sk->sk_callback_lock);
  1540. /* Do not wake up a writer until he can make "significant"
  1541. * progress. --DaveM
  1542. */
  1543. if ((atomic_read(&sk->sk_wmem_alloc) << 1) <= sk->sk_sndbuf) {
  1544. if (sk_has_sleeper(sk))
  1545. wake_up_interruptible_sync_poll(sk->sk_sleep, POLLOUT |
  1546. POLLWRNORM | POLLWRBAND);
  1547. /* Should agree with poll, otherwise some programs break */
  1548. if (sock_writeable(sk))
  1549. sk_wake_async(sk, SOCK_WAKE_SPACE, POLL_OUT);
  1550. }
  1551. read_unlock(&sk->sk_callback_lock);
  1552. }
  1553. static void sock_def_destruct(struct sock *sk)
  1554. {
  1555. kfree(sk->sk_protinfo);
  1556. }
  1557. void sk_send_sigurg(struct sock *sk)
  1558. {
  1559. if (sk->sk_socket && sk->sk_socket->file)
  1560. if (send_sigurg(&sk->sk_socket->file->f_owner))
  1561. sk_wake_async(sk, SOCK_WAKE_URG, POLL_PRI);
  1562. }
  1563. EXPORT_SYMBOL(sk_send_sigurg);
  1564. void sk_reset_timer(struct sock *sk, struct timer_list* timer,
  1565. unsigned long expires)
  1566. {
  1567. if (!mod_timer(timer, expires))
  1568. sock_hold(sk);
  1569. }
  1570. EXPORT_SYMBOL(sk_reset_timer);
  1571. void sk_stop_timer(struct sock *sk, struct timer_list* timer)
  1572. {
  1573. if (timer_pending(timer) && del_timer(timer))
  1574. __sock_put(sk);
  1575. }
  1576. EXPORT_SYMBOL(sk_stop_timer);
  1577. void sock_init_data(struct socket *sock, struct sock *sk)
  1578. {
  1579. skb_queue_head_init(&sk->sk_receive_queue);
  1580. skb_queue_head_init(&sk->sk_write_queue);
  1581. skb_queue_head_init(&sk->sk_error_queue);
  1582. #ifdef CONFIG_NET_DMA
  1583. skb_queue_head_init(&sk->sk_async_wait_queue);
  1584. #endif
  1585. sk->sk_send_head = NULL;
  1586. init_timer(&sk->sk_timer);
  1587. sk->sk_allocation = GFP_KERNEL;
  1588. sk->sk_rcvbuf = sysctl_rmem_default;
  1589. sk->sk_sndbuf = sysctl_wmem_default;
  1590. sk->sk_state = TCP_CLOSE;
  1591. sk_set_socket(sk, sock);
  1592. sock_set_flag(sk, SOCK_ZAPPED);
  1593. if (sock) {
  1594. sk->sk_type = sock->type;
  1595. sk->sk_sleep = &sock->wait;
  1596. sock->sk = sk;
  1597. } else
  1598. sk->sk_sleep = NULL;
  1599. rwlock_init(&sk->sk_dst_lock);
  1600. rwlock_init(&sk->sk_callback_lock);
  1601. lockdep_set_class_and_name(&sk->sk_callback_lock,
  1602. af_callback_keys + sk->sk_family,
  1603. af_family_clock_key_strings[sk->sk_family]);
  1604. sk->sk_state_change = sock_def_wakeup;
  1605. sk->sk_data_ready = sock_def_readable;
  1606. sk->sk_write_space = sock_def_write_space;
  1607. sk->sk_error_report = sock_def_error_report;
  1608. sk->sk_destruct = sock_def_destruct;
  1609. sk->sk_sndmsg_page = NULL;
  1610. sk->sk_sndmsg_off = 0;
  1611. sk->sk_peercred.pid = 0;
  1612. sk->sk_peercred.uid = -1;
  1613. sk->sk_peercred.gid = -1;
  1614. sk->sk_write_pending = 0;
  1615. sk->sk_rcvlowat = 1;
  1616. sk->sk_rcvtimeo = MAX_SCHEDULE_TIMEOUT;
  1617. sk->sk_sndtimeo = MAX_SCHEDULE_TIMEOUT;
  1618. sk->sk_stamp = ktime_set(-1L, 0);
  1619. /*
  1620. * Before updating sk_refcnt, we must commit prior changes to memory
  1621. * (Documentation/RCU/rculist_nulls.txt for details)
  1622. */
  1623. smp_wmb();
  1624. atomic_set(&sk->sk_refcnt, 1);
  1625. atomic_set(&sk->sk_drops, 0);
  1626. }
  1627. EXPORT_SYMBOL(sock_init_data);
  1628. void lock_sock_nested(struct sock *sk, int subclass)
  1629. {
  1630. might_sleep();
  1631. spin_lock_bh(&sk->sk_lock.slock);
  1632. if (sk->sk_lock.owned)
  1633. __lock_sock(sk);
  1634. sk->sk_lock.owned = 1;
  1635. spin_unlock(&sk->sk_lock.slock);
  1636. /*
  1637. * The sk_lock has mutex_lock() semantics here:
  1638. */
  1639. mutex_acquire(&sk->sk_lock.dep_map, subclass, 0, _RET_IP_);
  1640. local_bh_enable();
  1641. }
  1642. EXPORT_SYMBOL(lock_sock_nested);
  1643. void release_sock(struct sock *sk)
  1644. {
  1645. /*
  1646. * The sk_lock has mutex_unlock() semantics:
  1647. */
  1648. mutex_release(&sk->sk_lock.dep_map, 1, _RET_IP_);
  1649. spin_lock_bh(&sk->sk_lock.slock);
  1650. if (sk->sk_backlog.tail)
  1651. __release_sock(sk);
  1652. sk->sk_lock.owned = 0;
  1653. if (waitqueue_active(&sk->sk_lock.wq))
  1654. wake_up(&sk->sk_lock.wq);
  1655. spin_unlock_bh(&sk->sk_lock.slock);
  1656. }
  1657. EXPORT_SYMBOL(release_sock);
  1658. int sock_get_timestamp(struct sock *sk, struct timeval __user *userstamp)
  1659. {
  1660. struct timeval tv;
  1661. if (!sock_flag(sk, SOCK_TIMESTAMP))
  1662. sock_enable_timestamp(sk, SOCK_TIMESTAMP);
  1663. tv = ktime_to_timeval(sk->sk_stamp);
  1664. if (tv.tv_sec == -1)
  1665. return -ENOENT;
  1666. if (tv.tv_sec == 0) {
  1667. sk->sk_stamp = ktime_get_real();
  1668. tv = ktime_to_timeval(sk->sk_stamp);
  1669. }
  1670. return copy_to_user(userstamp, &tv, sizeof(tv)) ? -EFAULT : 0;
  1671. }
  1672. EXPORT_SYMBOL(sock_get_timestamp);
  1673. int sock_get_timestampns(struct sock *sk, struct timespec __user *userstamp)
  1674. {
  1675. struct timespec ts;
  1676. if (!sock_flag(sk, SOCK_TIMESTAMP))
  1677. sock_enable_timestamp(sk, SOCK_TIMESTAMP);
  1678. ts = ktime_to_timespec(sk->sk_stamp);
  1679. if (ts.tv_sec == -1)
  1680. return -ENOENT;
  1681. if (ts.tv_sec == 0) {
  1682. sk->sk_stamp = ktime_get_real();
  1683. ts = ktime_to_timespec(sk->sk_stamp);
  1684. }
  1685. return copy_to_user(userstamp, &ts, sizeof(ts)) ? -EFAULT : 0;
  1686. }
  1687. EXPORT_SYMBOL(sock_get_timestampns);
  1688. void sock_enable_timestamp(struct sock *sk, int flag)
  1689. {
  1690. if (!sock_flag(sk, flag)) {
  1691. sock_set_flag(sk, flag);
  1692. /*
  1693. * we just set one of the two flags which require net
  1694. * time stamping, but time stamping might have been on
  1695. * already because of the other one
  1696. */
  1697. if (!sock_flag(sk,
  1698. flag == SOCK_TIMESTAMP ?
  1699. SOCK_TIMESTAMPING_RX_SOFTWARE :
  1700. SOCK_TIMESTAMP))
  1701. net_enable_timestamp();
  1702. }
  1703. }
  1704. /*
  1705. * Get a socket option on an socket.
  1706. *
  1707. * FIX: POSIX 1003.1g is very ambiguous here. It states that
  1708. * asynchronous errors should be reported by getsockopt. We assume
  1709. * this means if you specify SO_ERROR (otherwise whats the point of it).
  1710. */
  1711. int sock_common_getsockopt(struct socket *sock, int level, int optname,
  1712. char __user *optval, int __user *optlen)
  1713. {
  1714. struct sock *sk = sock->sk;
  1715. return sk->sk_prot->getsockopt(sk, level, optname, optval, optlen);
  1716. }
  1717. EXPORT_SYMBOL(sock_common_getsockopt);
  1718. #ifdef CONFIG_COMPAT
  1719. int compat_sock_common_getsockopt(struct socket *sock, int level, int optname,
  1720. char __user *optval, int __user *optlen)
  1721. {
  1722. struct sock *sk = sock->sk;
  1723. if (sk->sk_prot->compat_getsockopt != NULL)
  1724. return sk->sk_prot->compat_getsockopt(sk, level, optname,
  1725. optval, optlen);
  1726. return sk->sk_prot->getsockopt(sk, level, optname, optval, optlen);
  1727. }
  1728. EXPORT_SYMBOL(compat_sock_common_getsockopt);
  1729. #endif
  1730. int sock_common_recvmsg(struct kiocb *iocb, struct socket *sock,
  1731. struct msghdr *msg, size_t size, int flags)
  1732. {
  1733. struct sock *sk = sock->sk;
  1734. int addr_len = 0;
  1735. int err;
  1736. err = sk->sk_prot->recvmsg(iocb, sk, msg, size, flags & MSG_DONTWAIT,
  1737. flags & ~MSG_DONTWAIT, &addr_len);
  1738. if (err >= 0)
  1739. msg->msg_namelen = addr_len;
  1740. return err;
  1741. }
  1742. EXPORT_SYMBOL(sock_common_recvmsg);
  1743. /*
  1744. * Set socket options on an inet socket.
  1745. */
  1746. int sock_common_setsockopt(struct socket *sock, int level, int optname,
  1747. char __user *optval, int optlen)
  1748. {
  1749. struct sock *sk = sock->sk;
  1750. return sk->sk_prot->setsockopt(sk, level, optname, optval, optlen);
  1751. }
  1752. EXPORT_SYMBOL(sock_common_setsockopt);
  1753. #ifdef CONFIG_COMPAT
  1754. int compat_sock_common_setsockopt(struct socket *sock, int level, int optname,
  1755. char __user *optval, int optlen)
  1756. {
  1757. struct sock *sk = sock->sk;
  1758. if (sk->sk_prot->compat_setsockopt != NULL)
  1759. return sk->sk_prot->compat_setsockopt(sk, level, optname,
  1760. optval, optlen);
  1761. return sk->sk_prot->setsockopt(sk, level, optname, optval, optlen);
  1762. }
  1763. EXPORT_SYMBOL(compat_sock_common_setsockopt);
  1764. #endif
  1765. void sk_common_release(struct sock *sk)
  1766. {
  1767. if (sk->sk_prot->destroy)
  1768. sk->sk_prot->destroy(sk);
  1769. /*
  1770. * Observation: when sock_common_release is called, processes have
  1771. * no access to socket. But net still has.
  1772. * Step one, detach it from networking:
  1773. *
  1774. * A. Remove from hash tables.
  1775. */
  1776. sk->sk_prot->unhash(sk);
  1777. /*
  1778. * In this point socket cannot receive new packets, but it is possible
  1779. * that some packets are in flight because some CPU runs receiver and
  1780. * did hash table lookup before we unhashed socket. They will achieve
  1781. * receive queue and will be purged by socket destructor.
  1782. *
  1783. * Also we still have packets pending on receive queue and probably,
  1784. * our own packets waiting in device queues. sock_destroy will drain
  1785. * receive queue, but transmitted packets will delay socket destruction
  1786. * until the last reference will be released.
  1787. */
  1788. sock_orphan(sk);
  1789. xfrm_sk_free_policy(sk);
  1790. sk_refcnt_debug_release(sk);
  1791. sock_put(sk);
  1792. }
  1793. EXPORT_SYMBOL(sk_common_release);
  1794. static DEFINE_RWLOCK(proto_list_lock);
  1795. static LIST_HEAD(proto_list);
  1796. #ifdef CONFIG_PROC_FS
  1797. #define PROTO_INUSE_NR 64 /* should be enough for the first time */
  1798. struct prot_inuse {
  1799. int val[PROTO_INUSE_NR];
  1800. };
  1801. static DECLARE_BITMAP(proto_inuse_idx, PROTO_INUSE_NR);
  1802. #ifdef CONFIG_NET_NS
  1803. void sock_prot_inuse_add(struct net *net, struct proto *prot, int val)
  1804. {
  1805. int cpu = smp_processor_id();
  1806. per_cpu_ptr(net->core.inuse, cpu)->val[prot->inuse_idx] += val;
  1807. }
  1808. EXPORT_SYMBOL_GPL(sock_prot_inuse_add);
  1809. int sock_prot_inuse_get(struct net *net, struct proto *prot)
  1810. {
  1811. int cpu, idx = prot->inuse_idx;
  1812. int res = 0;
  1813. for_each_possible_cpu(cpu)
  1814. res += per_cpu_ptr(net->core.inuse, cpu)->val[idx];
  1815. return res >= 0 ? res : 0;
  1816. }
  1817. EXPORT_SYMBOL_GPL(sock_prot_inuse_get);
  1818. static int sock_inuse_init_net(struct net *net)
  1819. {
  1820. net->core.inuse = alloc_percpu(struct prot_inuse);
  1821. return net->core.inuse ? 0 : -ENOMEM;
  1822. }
  1823. static void sock_inuse_exit_net(struct net *net)
  1824. {
  1825. free_percpu(net->core.inuse);
  1826. }
  1827. static struct pernet_operations net_inuse_ops = {
  1828. .init = sock_inuse_init_net,
  1829. .exit = sock_inuse_exit_net,
  1830. };
  1831. static __init int net_inuse_init(void)
  1832. {
  1833. if (register_pernet_subsys(&net_inuse_ops))
  1834. panic("Cannot initialize net inuse counters");
  1835. return 0;
  1836. }
  1837. core_initcall(net_inuse_init);
  1838. #else
  1839. static DEFINE_PER_CPU(struct prot_inuse, prot_inuse);
  1840. void sock_prot_inuse_add(struct net *net, struct proto *prot, int val)
  1841. {
  1842. __get_cpu_var(prot_inuse).val[prot->inuse_idx] += val;
  1843. }
  1844. EXPORT_SYMBOL_GPL(sock_prot_inuse_add);
  1845. int sock_prot_inuse_get(struct net *net, struct proto *prot)
  1846. {
  1847. int cpu, idx = prot->inuse_idx;
  1848. int res = 0;
  1849. for_each_possible_cpu(cpu)
  1850. res += per_cpu(prot_inuse, cpu).val[idx];
  1851. return res >= 0 ? res : 0;
  1852. }
  1853. EXPORT_SYMBOL_GPL(sock_prot_inuse_get);
  1854. #endif
  1855. static void assign_proto_idx(struct proto *prot)
  1856. {
  1857. prot->inuse_idx = find_first_zero_bit(proto_inuse_idx, PROTO_INUSE_NR);
  1858. if (unlikely(prot->inuse_idx == PROTO_INUSE_NR - 1)) {
  1859. printk(KERN_ERR "PROTO_INUSE_NR exhausted\n");
  1860. return;
  1861. }
  1862. set_bit(prot->inuse_idx, proto_inuse_idx);
  1863. }
  1864. static void release_proto_idx(struct proto *prot)
  1865. {
  1866. if (prot->inuse_idx != PROTO_INUSE_NR - 1)
  1867. clear_bit(prot->inuse_idx, proto_inuse_idx);
  1868. }
  1869. #else
  1870. static inline void assign_proto_idx(struct proto *prot)
  1871. {
  1872. }
  1873. static inline void release_proto_idx(struct proto *prot)
  1874. {
  1875. }
  1876. #endif
  1877. int proto_register(struct proto *prot, int alloc_slab)
  1878. {
  1879. if (alloc_slab) {
  1880. prot->slab = kmem_cache_create(prot->name, prot->obj_size, 0,
  1881. SLAB_HWCACHE_ALIGN | prot->slab_flags,
  1882. NULL);
  1883. if (prot->slab == NULL) {
  1884. printk(KERN_CRIT "%s: Can't create sock SLAB cache!\n",
  1885. prot->name);
  1886. goto out;
  1887. }
  1888. if (prot->rsk_prot != NULL) {
  1889. static const char mask[] = "request_sock_%s";
  1890. prot->rsk_prot->slab_name = kmalloc(strlen(prot->name) + sizeof(mask) - 1, GFP_KERNEL);
  1891. if (prot->rsk_prot->slab_name == NULL)
  1892. goto out_free_sock_slab;
  1893. sprintf(prot->rsk_prot->slab_name, mask, prot->name);
  1894. prot->rsk_prot->slab = kmem_cache_create(prot->rsk_prot->slab_name,
  1895. prot->rsk_prot->obj_size, 0,
  1896. SLAB_HWCACHE_ALIGN, NULL);
  1897. if (prot->rsk_prot->slab == NULL) {
  1898. printk(KERN_CRIT "%s: Can't create request sock SLAB cache!\n",
  1899. prot->name);
  1900. goto out_free_request_sock_slab_name;
  1901. }
  1902. }
  1903. if (prot->twsk_prot != NULL) {
  1904. static const char mask[] = "tw_sock_%s";
  1905. prot->twsk_prot->twsk_slab_name = kmalloc(strlen(prot->name) + sizeof(mask) - 1, GFP_KERNEL);
  1906. if (prot->twsk_prot->twsk_slab_name == NULL)
  1907. goto out_free_request_sock_slab;
  1908. sprintf(prot->twsk_prot->twsk_slab_name, mask, prot->name);
  1909. prot->twsk_prot->twsk_slab =
  1910. kmem_cache_create(prot->twsk_prot->twsk_slab_name,
  1911. prot->twsk_prot->twsk_obj_size,
  1912. 0,
  1913. SLAB_HWCACHE_ALIGN |
  1914. prot->slab_flags,
  1915. NULL);
  1916. if (prot->twsk_prot->twsk_slab == NULL)
  1917. goto out_free_timewait_sock_slab_name;
  1918. }
  1919. }
  1920. write_lock(&proto_list_lock);
  1921. list_add(&prot->node, &proto_list);
  1922. assign_proto_idx(prot);
  1923. write_unlock(&proto_list_lock);
  1924. return 0;
  1925. out_free_timewait_sock_slab_name:
  1926. kfree(prot->twsk_prot->twsk_slab_name);
  1927. out_free_request_sock_slab:
  1928. if (prot->rsk_prot && prot->rsk_prot->slab) {
  1929. kmem_cache_destroy(prot->rsk_prot->slab);
  1930. prot->rsk_prot->slab = NULL;
  1931. }
  1932. out_free_request_sock_slab_name:
  1933. kfree(prot->rsk_prot->slab_name);
  1934. out_free_sock_slab:
  1935. kmem_cache_destroy(prot->slab);
  1936. prot->slab = NULL;
  1937. out:
  1938. return -ENOBUFS;
  1939. }
  1940. EXPORT_SYMBOL(proto_register);
  1941. void proto_unregister(struct proto *prot)
  1942. {
  1943. write_lock(&proto_list_lock);
  1944. release_proto_idx(prot);
  1945. list_del(&prot->node);
  1946. write_unlock(&proto_list_lock);
  1947. if (prot->slab != NULL) {
  1948. kmem_cache_destroy(prot->slab);
  1949. prot->slab = NULL;
  1950. }
  1951. if (prot->rsk_prot != NULL && prot->rsk_prot->slab != NULL) {
  1952. kmem_cache_destroy(prot->rsk_prot->slab);
  1953. kfree(prot->rsk_prot->slab_name);
  1954. prot->rsk_prot->slab = NULL;
  1955. }
  1956. if (prot->twsk_prot != NULL && prot->twsk_prot->twsk_slab != NULL) {
  1957. kmem_cache_destroy(prot->twsk_prot->twsk_slab);
  1958. kfree(prot->twsk_prot->twsk_slab_name);
  1959. prot->twsk_prot->twsk_slab = NULL;
  1960. }
  1961. }
  1962. EXPORT_SYMBOL(proto_unregister);
  1963. #ifdef CONFIG_PROC_FS
  1964. static void *proto_seq_start(struct seq_file *seq, loff_t *pos)
  1965. __acquires(proto_list_lock)
  1966. {
  1967. read_lock(&proto_list_lock);
  1968. return seq_list_start_head(&proto_list, *pos);
  1969. }
  1970. static void *proto_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  1971. {
  1972. return seq_list_next(v, &proto_list, pos);
  1973. }
  1974. static void proto_seq_stop(struct seq_file *seq, void *v)
  1975. __releases(proto_list_lock)
  1976. {
  1977. read_unlock(&proto_list_lock);
  1978. }
  1979. static char proto_method_implemented(const void *method)
  1980. {
  1981. return method == NULL ? 'n' : 'y';
  1982. }
  1983. static void proto_seq_printf(struct seq_file *seq, struct proto *proto)
  1984. {
  1985. seq_printf(seq, "%-9s %4u %6d %6d %-3s %6u %-3s %-10s "
  1986. "%2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c %2c\n",
  1987. proto->name,
  1988. proto->obj_size,
  1989. sock_prot_inuse_get(seq_file_net(seq), proto),
  1990. proto->memory_allocated != NULL ? atomic_read(proto->memory_allocated) : -1,
  1991. proto->memory_pressure != NULL ? *proto->memory_pressure ? "yes" : "no" : "NI",
  1992. proto->max_header,
  1993. proto->slab == NULL ? "no" : "yes",
  1994. module_name(proto->owner),
  1995. proto_method_implemented(proto->close),
  1996. proto_method_implemented(proto->connect),
  1997. proto_method_implemented(proto->disconnect),
  1998. proto_method_implemented(proto->accept),
  1999. proto_method_implemented(proto->ioctl),
  2000. proto_method_implemented(proto->init),
  2001. proto_method_implemented(proto->destroy),
  2002. proto_method_implemented(proto->shutdown),
  2003. proto_method_implemented(proto->setsockopt),
  2004. proto_method_implemented(proto->getsockopt),
  2005. proto_method_implemented(proto->sendmsg),
  2006. proto_method_implemented(proto->recvmsg),
  2007. proto_method_implemented(proto->sendpage),
  2008. proto_method_implemented(proto->bind),
  2009. proto_method_implemented(proto->backlog_rcv),
  2010. proto_method_implemented(proto->hash),
  2011. proto_method_implemented(proto->unhash),
  2012. proto_method_implemented(proto->get_port),
  2013. proto_method_implemented(proto->enter_memory_pressure));
  2014. }
  2015. static int proto_seq_show(struct seq_file *seq, void *v)
  2016. {
  2017. if (v == &proto_list)
  2018. seq_printf(seq, "%-9s %-4s %-8s %-6s %-5s %-7s %-4s %-10s %s",
  2019. "protocol",
  2020. "size",
  2021. "sockets",
  2022. "memory",
  2023. "press",
  2024. "maxhdr",
  2025. "slab",
  2026. "module",
  2027. "cl co di ac io in de sh ss gs se re sp bi br ha uh gp em\n");
  2028. else
  2029. proto_seq_printf(seq, list_entry(v, struct proto, node));
  2030. return 0;
  2031. }
  2032. static const struct seq_operations proto_seq_ops = {
  2033. .start = proto_seq_start,
  2034. .next = proto_seq_next,
  2035. .stop = proto_seq_stop,
  2036. .show = proto_seq_show,
  2037. };
  2038. static int proto_seq_open(struct inode *inode, struct file *file)
  2039. {
  2040. return seq_open_net(inode, file, &proto_seq_ops,
  2041. sizeof(struct seq_net_private));
  2042. }
  2043. static const struct file_operations proto_seq_fops = {
  2044. .owner = THIS_MODULE,
  2045. .open = proto_seq_open,
  2046. .read = seq_read,
  2047. .llseek = seq_lseek,
  2048. .release = seq_release_net,
  2049. };
  2050. static __net_init int proto_init_net(struct net *net)
  2051. {
  2052. if (!proc_net_fops_create(net, "protocols", S_IRUGO, &proto_seq_fops))
  2053. return -ENOMEM;
  2054. return 0;
  2055. }
  2056. static __net_exit void proto_exit_net(struct net *net)
  2057. {
  2058. proc_net_remove(net, "protocols");
  2059. }
  2060. static __net_initdata struct pernet_operations proto_net_ops = {
  2061. .init = proto_init_net,
  2062. .exit = proto_exit_net,
  2063. };
  2064. static int __init proto_init(void)
  2065. {
  2066. return register_pernet_subsys(&proto_net_ops);
  2067. }
  2068. subsys_initcall(proto_init);
  2069. #endif /* PROC_FS */