svcsock.c 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579
  1. /*
  2. * linux/net/sunrpc/svcsock.c
  3. *
  4. * These are the RPC server socket internals.
  5. *
  6. * The server scheduling algorithm does not always distribute the load
  7. * evenly when servicing a single client. May need to modify the
  8. * svc_sock_enqueue procedure...
  9. *
  10. * TCP support is largely untested and may be a little slow. The problem
  11. * is that we currently do two separate recvfrom's, one for the 4-byte
  12. * record length, and the second for the actual record. This could possibly
  13. * be improved by always reading a minimum size of around 100 bytes and
  14. * tucking any superfluous bytes away in a temporary store. Still, that
  15. * leaves write requests out in the rain. An alternative may be to peek at
  16. * the first skb in the queue, and if it matches the next TCP sequence
  17. * number, to extract the record marker. Yuck.
  18. *
  19. * Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
  20. */
  21. #include <linux/sched.h>
  22. #include <linux/errno.h>
  23. #include <linux/fcntl.h>
  24. #include <linux/net.h>
  25. #include <linux/in.h>
  26. #include <linux/inet.h>
  27. #include <linux/udp.h>
  28. #include <linux/tcp.h>
  29. #include <linux/unistd.h>
  30. #include <linux/slab.h>
  31. #include <linux/netdevice.h>
  32. #include <linux/skbuff.h>
  33. #include <net/sock.h>
  34. #include <net/checksum.h>
  35. #include <net/ip.h>
  36. #include <net/tcp_states.h>
  37. #include <asm/uaccess.h>
  38. #include <asm/ioctls.h>
  39. #include <linux/sunrpc/types.h>
  40. #include <linux/sunrpc/xdr.h>
  41. #include <linux/sunrpc/svcsock.h>
  42. #include <linux/sunrpc/stats.h>
  43. /* SMP locking strategy:
  44. *
  45. * svc_serv->sv_lock protects most stuff for that service.
  46. *
  47. * Some flags can be set to certain values at any time
  48. * providing that certain rules are followed:
  49. *
  50. * SK_BUSY can be set to 0 at any time.
  51. * svc_sock_enqueue must be called afterwards
  52. * SK_CONN, SK_DATA, can be set or cleared at any time.
  53. * after a set, svc_sock_enqueue must be called.
  54. * after a clear, the socket must be read/accepted
  55. * if this succeeds, it must be set again.
  56. * SK_CLOSE can set at any time. It is never cleared.
  57. *
  58. */
  59. #define RPCDBG_FACILITY RPCDBG_SVCSOCK
  60. static struct svc_sock *svc_setup_socket(struct svc_serv *, struct socket *,
  61. int *errp, int pmap_reg);
  62. static void svc_udp_data_ready(struct sock *, int);
  63. static int svc_udp_recvfrom(struct svc_rqst *);
  64. static int svc_udp_sendto(struct svc_rqst *);
  65. static struct svc_deferred_req *svc_deferred_dequeue(struct svc_sock *svsk);
  66. static int svc_deferred_recv(struct svc_rqst *rqstp);
  67. static struct cache_deferred_req *svc_defer(struct cache_req *req);
  68. /*
  69. * Queue up an idle server thread. Must have serv->sv_lock held.
  70. * Note: this is really a stack rather than a queue, so that we only
  71. * use as many different threads as we need, and the rest don't polute
  72. * the cache.
  73. */
  74. static inline void
  75. svc_serv_enqueue(struct svc_serv *serv, struct svc_rqst *rqstp)
  76. {
  77. list_add(&rqstp->rq_list, &serv->sv_threads);
  78. }
  79. /*
  80. * Dequeue an nfsd thread. Must have serv->sv_lock held.
  81. */
  82. static inline void
  83. svc_serv_dequeue(struct svc_serv *serv, struct svc_rqst *rqstp)
  84. {
  85. list_del(&rqstp->rq_list);
  86. }
  87. /*
  88. * Release an skbuff after use
  89. */
  90. static inline void
  91. svc_release_skb(struct svc_rqst *rqstp)
  92. {
  93. struct sk_buff *skb = rqstp->rq_skbuff;
  94. struct svc_deferred_req *dr = rqstp->rq_deferred;
  95. if (skb) {
  96. rqstp->rq_skbuff = NULL;
  97. dprintk("svc: service %p, releasing skb %p\n", rqstp, skb);
  98. skb_free_datagram(rqstp->rq_sock->sk_sk, skb);
  99. }
  100. if (dr) {
  101. rqstp->rq_deferred = NULL;
  102. kfree(dr);
  103. }
  104. }
  105. /*
  106. * Any space to write?
  107. */
  108. static inline unsigned long
  109. svc_sock_wspace(struct svc_sock *svsk)
  110. {
  111. int wspace;
  112. if (svsk->sk_sock->type == SOCK_STREAM)
  113. wspace = sk_stream_wspace(svsk->sk_sk);
  114. else
  115. wspace = sock_wspace(svsk->sk_sk);
  116. return wspace;
  117. }
  118. /*
  119. * Queue up a socket with data pending. If there are idle nfsd
  120. * processes, wake 'em up.
  121. *
  122. */
  123. static void
  124. svc_sock_enqueue(struct svc_sock *svsk)
  125. {
  126. struct svc_serv *serv = svsk->sk_server;
  127. struct svc_rqst *rqstp;
  128. if (!(svsk->sk_flags &
  129. ( (1<<SK_CONN)|(1<<SK_DATA)|(1<<SK_CLOSE)|(1<<SK_DEFERRED)) ))
  130. return;
  131. if (test_bit(SK_DEAD, &svsk->sk_flags))
  132. return;
  133. spin_lock_bh(&serv->sv_lock);
  134. if (!list_empty(&serv->sv_threads) &&
  135. !list_empty(&serv->sv_sockets))
  136. printk(KERN_ERR
  137. "svc_sock_enqueue: threads and sockets both waiting??\n");
  138. if (test_bit(SK_DEAD, &svsk->sk_flags)) {
  139. /* Don't enqueue dead sockets */
  140. dprintk("svc: socket %p is dead, not enqueued\n", svsk->sk_sk);
  141. goto out_unlock;
  142. }
  143. if (test_bit(SK_BUSY, &svsk->sk_flags)) {
  144. /* Don't enqueue socket while daemon is receiving */
  145. dprintk("svc: socket %p busy, not enqueued\n", svsk->sk_sk);
  146. goto out_unlock;
  147. }
  148. set_bit(SOCK_NOSPACE, &svsk->sk_sock->flags);
  149. if (((svsk->sk_reserved + serv->sv_bufsz)*2
  150. > svc_sock_wspace(svsk))
  151. && !test_bit(SK_CLOSE, &svsk->sk_flags)
  152. && !test_bit(SK_CONN, &svsk->sk_flags)) {
  153. /* Don't enqueue while not enough space for reply */
  154. dprintk("svc: socket %p no space, %d*2 > %ld, not enqueued\n",
  155. svsk->sk_sk, svsk->sk_reserved+serv->sv_bufsz,
  156. svc_sock_wspace(svsk));
  157. goto out_unlock;
  158. }
  159. clear_bit(SOCK_NOSPACE, &svsk->sk_sock->flags);
  160. /* Mark socket as busy. It will remain in this state until the
  161. * server has processed all pending data and put the socket back
  162. * on the idle list.
  163. */
  164. set_bit(SK_BUSY, &svsk->sk_flags);
  165. if (!list_empty(&serv->sv_threads)) {
  166. rqstp = list_entry(serv->sv_threads.next,
  167. struct svc_rqst,
  168. rq_list);
  169. dprintk("svc: socket %p served by daemon %p\n",
  170. svsk->sk_sk, rqstp);
  171. svc_serv_dequeue(serv, rqstp);
  172. if (rqstp->rq_sock)
  173. printk(KERN_ERR
  174. "svc_sock_enqueue: server %p, rq_sock=%p!\n",
  175. rqstp, rqstp->rq_sock);
  176. rqstp->rq_sock = svsk;
  177. svsk->sk_inuse++;
  178. rqstp->rq_reserved = serv->sv_bufsz;
  179. svsk->sk_reserved += rqstp->rq_reserved;
  180. wake_up(&rqstp->rq_wait);
  181. } else {
  182. dprintk("svc: socket %p put into queue\n", svsk->sk_sk);
  183. list_add_tail(&svsk->sk_ready, &serv->sv_sockets);
  184. }
  185. out_unlock:
  186. spin_unlock_bh(&serv->sv_lock);
  187. }
  188. /*
  189. * Dequeue the first socket. Must be called with the serv->sv_lock held.
  190. */
  191. static inline struct svc_sock *
  192. svc_sock_dequeue(struct svc_serv *serv)
  193. {
  194. struct svc_sock *svsk;
  195. if (list_empty(&serv->sv_sockets))
  196. return NULL;
  197. svsk = list_entry(serv->sv_sockets.next,
  198. struct svc_sock, sk_ready);
  199. list_del_init(&svsk->sk_ready);
  200. dprintk("svc: socket %p dequeued, inuse=%d\n",
  201. svsk->sk_sk, svsk->sk_inuse);
  202. return svsk;
  203. }
  204. /*
  205. * Having read something from a socket, check whether it
  206. * needs to be re-enqueued.
  207. * Note: SK_DATA only gets cleared when a read-attempt finds
  208. * no (or insufficient) data.
  209. */
  210. static inline void
  211. svc_sock_received(struct svc_sock *svsk)
  212. {
  213. clear_bit(SK_BUSY, &svsk->sk_flags);
  214. svc_sock_enqueue(svsk);
  215. }
  216. /**
  217. * svc_reserve - change the space reserved for the reply to a request.
  218. * @rqstp: The request in question
  219. * @space: new max space to reserve
  220. *
  221. * Each request reserves some space on the output queue of the socket
  222. * to make sure the reply fits. This function reduces that reserved
  223. * space to be the amount of space used already, plus @space.
  224. *
  225. */
  226. void svc_reserve(struct svc_rqst *rqstp, int space)
  227. {
  228. space += rqstp->rq_res.head[0].iov_len;
  229. if (space < rqstp->rq_reserved) {
  230. struct svc_sock *svsk = rqstp->rq_sock;
  231. spin_lock_bh(&svsk->sk_server->sv_lock);
  232. svsk->sk_reserved -= (rqstp->rq_reserved - space);
  233. rqstp->rq_reserved = space;
  234. spin_unlock_bh(&svsk->sk_server->sv_lock);
  235. svc_sock_enqueue(svsk);
  236. }
  237. }
  238. /*
  239. * Release a socket after use.
  240. */
  241. static inline void
  242. svc_sock_put(struct svc_sock *svsk)
  243. {
  244. struct svc_serv *serv = svsk->sk_server;
  245. spin_lock_bh(&serv->sv_lock);
  246. if (!--(svsk->sk_inuse) && test_bit(SK_DEAD, &svsk->sk_flags)) {
  247. spin_unlock_bh(&serv->sv_lock);
  248. dprintk("svc: releasing dead socket\n");
  249. sock_release(svsk->sk_sock);
  250. kfree(svsk);
  251. }
  252. else
  253. spin_unlock_bh(&serv->sv_lock);
  254. }
  255. static void
  256. svc_sock_release(struct svc_rqst *rqstp)
  257. {
  258. struct svc_sock *svsk = rqstp->rq_sock;
  259. svc_release_skb(rqstp);
  260. svc_free_allpages(rqstp);
  261. rqstp->rq_res.page_len = 0;
  262. rqstp->rq_res.page_base = 0;
  263. /* Reset response buffer and release
  264. * the reservation.
  265. * But first, check that enough space was reserved
  266. * for the reply, otherwise we have a bug!
  267. */
  268. if ((rqstp->rq_res.len) > rqstp->rq_reserved)
  269. printk(KERN_ERR "RPC request reserved %d but used %d\n",
  270. rqstp->rq_reserved,
  271. rqstp->rq_res.len);
  272. rqstp->rq_res.head[0].iov_len = 0;
  273. svc_reserve(rqstp, 0);
  274. rqstp->rq_sock = NULL;
  275. svc_sock_put(svsk);
  276. }
  277. /*
  278. * External function to wake up a server waiting for data
  279. */
  280. void
  281. svc_wake_up(struct svc_serv *serv)
  282. {
  283. struct svc_rqst *rqstp;
  284. spin_lock_bh(&serv->sv_lock);
  285. if (!list_empty(&serv->sv_threads)) {
  286. rqstp = list_entry(serv->sv_threads.next,
  287. struct svc_rqst,
  288. rq_list);
  289. dprintk("svc: daemon %p woken up.\n", rqstp);
  290. /*
  291. svc_serv_dequeue(serv, rqstp);
  292. rqstp->rq_sock = NULL;
  293. */
  294. wake_up(&rqstp->rq_wait);
  295. }
  296. spin_unlock_bh(&serv->sv_lock);
  297. }
  298. /*
  299. * Generic sendto routine
  300. */
  301. static int
  302. svc_sendto(struct svc_rqst *rqstp, struct xdr_buf *xdr)
  303. {
  304. struct svc_sock *svsk = rqstp->rq_sock;
  305. struct socket *sock = svsk->sk_sock;
  306. int slen;
  307. char buffer[CMSG_SPACE(sizeof(struct in_pktinfo))];
  308. struct cmsghdr *cmh = (struct cmsghdr *)buffer;
  309. struct in_pktinfo *pki = (struct in_pktinfo *)CMSG_DATA(cmh);
  310. int len = 0;
  311. int result;
  312. int size;
  313. struct page **ppage = xdr->pages;
  314. size_t base = xdr->page_base;
  315. unsigned int pglen = xdr->page_len;
  316. unsigned int flags = MSG_MORE;
  317. slen = xdr->len;
  318. if (rqstp->rq_prot == IPPROTO_UDP) {
  319. /* set the source and destination */
  320. struct msghdr msg;
  321. msg.msg_name = &rqstp->rq_addr;
  322. msg.msg_namelen = sizeof(rqstp->rq_addr);
  323. msg.msg_iov = NULL;
  324. msg.msg_iovlen = 0;
  325. msg.msg_flags = MSG_MORE;
  326. msg.msg_control = cmh;
  327. msg.msg_controllen = sizeof(buffer);
  328. cmh->cmsg_len = CMSG_LEN(sizeof(*pki));
  329. cmh->cmsg_level = SOL_IP;
  330. cmh->cmsg_type = IP_PKTINFO;
  331. pki->ipi_ifindex = 0;
  332. pki->ipi_spec_dst.s_addr = rqstp->rq_daddr;
  333. if (sock_sendmsg(sock, &msg, 0) < 0)
  334. goto out;
  335. }
  336. /* send head */
  337. if (slen == xdr->head[0].iov_len)
  338. flags = 0;
  339. len = sock->ops->sendpage(sock, rqstp->rq_respages[0], 0, xdr->head[0].iov_len, flags);
  340. if (len != xdr->head[0].iov_len)
  341. goto out;
  342. slen -= xdr->head[0].iov_len;
  343. if (slen == 0)
  344. goto out;
  345. /* send page data */
  346. size = PAGE_SIZE - base < pglen ? PAGE_SIZE - base : pglen;
  347. while (pglen > 0) {
  348. if (slen == size)
  349. flags = 0;
  350. result = sock->ops->sendpage(sock, *ppage, base, size, flags);
  351. if (result > 0)
  352. len += result;
  353. if (result != size)
  354. goto out;
  355. slen -= size;
  356. pglen -= size;
  357. size = PAGE_SIZE < pglen ? PAGE_SIZE : pglen;
  358. base = 0;
  359. ppage++;
  360. }
  361. /* send tail */
  362. if (xdr->tail[0].iov_len) {
  363. result = sock->ops->sendpage(sock, rqstp->rq_respages[rqstp->rq_restailpage],
  364. ((unsigned long)xdr->tail[0].iov_base)& (PAGE_SIZE-1),
  365. xdr->tail[0].iov_len, 0);
  366. if (result > 0)
  367. len += result;
  368. }
  369. out:
  370. dprintk("svc: socket %p sendto([%p %Zu... ], %d) = %d (addr %x)\n",
  371. rqstp->rq_sock, xdr->head[0].iov_base, xdr->head[0].iov_len, xdr->len, len,
  372. rqstp->rq_addr.sin_addr.s_addr);
  373. return len;
  374. }
  375. /*
  376. * Check input queue length
  377. */
  378. static int
  379. svc_recv_available(struct svc_sock *svsk)
  380. {
  381. mm_segment_t oldfs;
  382. struct socket *sock = svsk->sk_sock;
  383. int avail, err;
  384. oldfs = get_fs(); set_fs(KERNEL_DS);
  385. err = sock->ops->ioctl(sock, TIOCINQ, (unsigned long) &avail);
  386. set_fs(oldfs);
  387. return (err >= 0)? avail : err;
  388. }
  389. /*
  390. * Generic recvfrom routine.
  391. */
  392. static int
  393. svc_recvfrom(struct svc_rqst *rqstp, struct kvec *iov, int nr, int buflen)
  394. {
  395. struct msghdr msg;
  396. struct socket *sock;
  397. int len, alen;
  398. rqstp->rq_addrlen = sizeof(rqstp->rq_addr);
  399. sock = rqstp->rq_sock->sk_sock;
  400. msg.msg_name = &rqstp->rq_addr;
  401. msg.msg_namelen = sizeof(rqstp->rq_addr);
  402. msg.msg_control = NULL;
  403. msg.msg_controllen = 0;
  404. msg.msg_flags = MSG_DONTWAIT;
  405. len = kernel_recvmsg(sock, &msg, iov, nr, buflen, MSG_DONTWAIT);
  406. /* sock_recvmsg doesn't fill in the name/namelen, so we must..
  407. * possibly we should cache this in the svc_sock structure
  408. * at accept time. FIXME
  409. */
  410. alen = sizeof(rqstp->rq_addr);
  411. sock->ops->getname(sock, (struct sockaddr *)&rqstp->rq_addr, &alen, 1);
  412. dprintk("svc: socket %p recvfrom(%p, %Zu) = %d\n",
  413. rqstp->rq_sock, iov[0].iov_base, iov[0].iov_len, len);
  414. return len;
  415. }
  416. /*
  417. * Set socket snd and rcv buffer lengths
  418. */
  419. static inline void
  420. svc_sock_setbufsize(struct socket *sock, unsigned int snd, unsigned int rcv)
  421. {
  422. #if 0
  423. mm_segment_t oldfs;
  424. oldfs = get_fs(); set_fs(KERNEL_DS);
  425. sock_setsockopt(sock, SOL_SOCKET, SO_SNDBUF,
  426. (char*)&snd, sizeof(snd));
  427. sock_setsockopt(sock, SOL_SOCKET, SO_RCVBUF,
  428. (char*)&rcv, sizeof(rcv));
  429. #else
  430. /* sock_setsockopt limits use to sysctl_?mem_max,
  431. * which isn't acceptable. Until that is made conditional
  432. * on not having CAP_SYS_RESOURCE or similar, we go direct...
  433. * DaveM said I could!
  434. */
  435. lock_sock(sock->sk);
  436. sock->sk->sk_sndbuf = snd * 2;
  437. sock->sk->sk_rcvbuf = rcv * 2;
  438. sock->sk->sk_userlocks |= SOCK_SNDBUF_LOCK|SOCK_RCVBUF_LOCK;
  439. release_sock(sock->sk);
  440. #endif
  441. }
  442. /*
  443. * INET callback when data has been received on the socket.
  444. */
  445. static void
  446. svc_udp_data_ready(struct sock *sk, int count)
  447. {
  448. struct svc_sock *svsk = (struct svc_sock *)sk->sk_user_data;
  449. if (svsk) {
  450. dprintk("svc: socket %p(inet %p), count=%d, busy=%d\n",
  451. svsk, sk, count, test_bit(SK_BUSY, &svsk->sk_flags));
  452. set_bit(SK_DATA, &svsk->sk_flags);
  453. svc_sock_enqueue(svsk);
  454. }
  455. if (sk->sk_sleep && waitqueue_active(sk->sk_sleep))
  456. wake_up_interruptible(sk->sk_sleep);
  457. }
  458. /*
  459. * INET callback when space is newly available on the socket.
  460. */
  461. static void
  462. svc_write_space(struct sock *sk)
  463. {
  464. struct svc_sock *svsk = (struct svc_sock *)(sk->sk_user_data);
  465. if (svsk) {
  466. dprintk("svc: socket %p(inet %p), write_space busy=%d\n",
  467. svsk, sk, test_bit(SK_BUSY, &svsk->sk_flags));
  468. svc_sock_enqueue(svsk);
  469. }
  470. if (sk->sk_sleep && waitqueue_active(sk->sk_sleep)) {
  471. dprintk("RPC svc_write_space: someone sleeping on %p\n",
  472. svsk);
  473. wake_up_interruptible(sk->sk_sleep);
  474. }
  475. }
  476. /*
  477. * Receive a datagram from a UDP socket.
  478. */
  479. static int
  480. svc_udp_recvfrom(struct svc_rqst *rqstp)
  481. {
  482. struct svc_sock *svsk = rqstp->rq_sock;
  483. struct svc_serv *serv = svsk->sk_server;
  484. struct sk_buff *skb;
  485. int err, len;
  486. if (test_and_clear_bit(SK_CHNGBUF, &svsk->sk_flags))
  487. /* udp sockets need large rcvbuf as all pending
  488. * requests are still in that buffer. sndbuf must
  489. * also be large enough that there is enough space
  490. * for one reply per thread.
  491. */
  492. svc_sock_setbufsize(svsk->sk_sock,
  493. (serv->sv_nrthreads+3) * serv->sv_bufsz,
  494. (serv->sv_nrthreads+3) * serv->sv_bufsz);
  495. if ((rqstp->rq_deferred = svc_deferred_dequeue(svsk))) {
  496. svc_sock_received(svsk);
  497. return svc_deferred_recv(rqstp);
  498. }
  499. clear_bit(SK_DATA, &svsk->sk_flags);
  500. while ((skb = skb_recv_datagram(svsk->sk_sk, 0, 1, &err)) == NULL) {
  501. if (err == -EAGAIN) {
  502. svc_sock_received(svsk);
  503. return err;
  504. }
  505. /* possibly an icmp error */
  506. dprintk("svc: recvfrom returned error %d\n", -err);
  507. }
  508. if (skb->tstamp.off_sec == 0) {
  509. struct timeval tv;
  510. tv.tv_sec = xtime.tv_sec;
  511. tv.tv_usec = xtime.tv_nsec / NSEC_PER_USEC;
  512. skb_set_timestamp(skb, &tv);
  513. /* Don't enable netstamp, sunrpc doesn't
  514. need that much accuracy */
  515. }
  516. skb_get_timestamp(skb, &svsk->sk_sk->sk_stamp);
  517. set_bit(SK_DATA, &svsk->sk_flags); /* there may be more data... */
  518. /*
  519. * Maybe more packets - kick another thread ASAP.
  520. */
  521. svc_sock_received(svsk);
  522. len = skb->len - sizeof(struct udphdr);
  523. rqstp->rq_arg.len = len;
  524. rqstp->rq_prot = IPPROTO_UDP;
  525. /* Get sender address */
  526. rqstp->rq_addr.sin_family = AF_INET;
  527. rqstp->rq_addr.sin_port = skb->h.uh->source;
  528. rqstp->rq_addr.sin_addr.s_addr = skb->nh.iph->saddr;
  529. rqstp->rq_daddr = skb->nh.iph->daddr;
  530. if (skb_is_nonlinear(skb)) {
  531. /* we have to copy */
  532. local_bh_disable();
  533. if (csum_partial_copy_to_xdr(&rqstp->rq_arg, skb)) {
  534. local_bh_enable();
  535. /* checksum error */
  536. skb_free_datagram(svsk->sk_sk, skb);
  537. return 0;
  538. }
  539. local_bh_enable();
  540. skb_free_datagram(svsk->sk_sk, skb);
  541. } else {
  542. /* we can use it in-place */
  543. rqstp->rq_arg.head[0].iov_base = skb->data + sizeof(struct udphdr);
  544. rqstp->rq_arg.head[0].iov_len = len;
  545. if (skb_checksum_complete(skb)) {
  546. skb_free_datagram(svsk->sk_sk, skb);
  547. return 0;
  548. }
  549. rqstp->rq_skbuff = skb;
  550. }
  551. rqstp->rq_arg.page_base = 0;
  552. if (len <= rqstp->rq_arg.head[0].iov_len) {
  553. rqstp->rq_arg.head[0].iov_len = len;
  554. rqstp->rq_arg.page_len = 0;
  555. } else {
  556. rqstp->rq_arg.page_len = len - rqstp->rq_arg.head[0].iov_len;
  557. rqstp->rq_argused += (rqstp->rq_arg.page_len + PAGE_SIZE - 1)/ PAGE_SIZE;
  558. }
  559. if (serv->sv_stats)
  560. serv->sv_stats->netudpcnt++;
  561. return len;
  562. }
  563. static int
  564. svc_udp_sendto(struct svc_rqst *rqstp)
  565. {
  566. int error;
  567. error = svc_sendto(rqstp, &rqstp->rq_res);
  568. if (error == -ECONNREFUSED)
  569. /* ICMP error on earlier request. */
  570. error = svc_sendto(rqstp, &rqstp->rq_res);
  571. return error;
  572. }
  573. static void
  574. svc_udp_init(struct svc_sock *svsk)
  575. {
  576. svsk->sk_sk->sk_data_ready = svc_udp_data_ready;
  577. svsk->sk_sk->sk_write_space = svc_write_space;
  578. svsk->sk_recvfrom = svc_udp_recvfrom;
  579. svsk->sk_sendto = svc_udp_sendto;
  580. /* initialise setting must have enough space to
  581. * receive and respond to one request.
  582. * svc_udp_recvfrom will re-adjust if necessary
  583. */
  584. svc_sock_setbufsize(svsk->sk_sock,
  585. 3 * svsk->sk_server->sv_bufsz,
  586. 3 * svsk->sk_server->sv_bufsz);
  587. set_bit(SK_DATA, &svsk->sk_flags); /* might have come in before data_ready set up */
  588. set_bit(SK_CHNGBUF, &svsk->sk_flags);
  589. }
  590. /*
  591. * A data_ready event on a listening socket means there's a connection
  592. * pending. Do not use state_change as a substitute for it.
  593. */
  594. static void
  595. svc_tcp_listen_data_ready(struct sock *sk, int count_unused)
  596. {
  597. struct svc_sock *svsk = (struct svc_sock *)sk->sk_user_data;
  598. dprintk("svc: socket %p TCP (listen) state change %d\n",
  599. sk, sk->sk_state);
  600. /*
  601. * This callback may called twice when a new connection
  602. * is established as a child socket inherits everything
  603. * from a parent LISTEN socket.
  604. * 1) data_ready method of the parent socket will be called
  605. * when one of child sockets become ESTABLISHED.
  606. * 2) data_ready method of the child socket may be called
  607. * when it receives data before the socket is accepted.
  608. * In case of 2, we should ignore it silently.
  609. */
  610. if (sk->sk_state == TCP_LISTEN) {
  611. if (svsk) {
  612. set_bit(SK_CONN, &svsk->sk_flags);
  613. svc_sock_enqueue(svsk);
  614. } else
  615. printk("svc: socket %p: no user data\n", sk);
  616. }
  617. if (sk->sk_sleep && waitqueue_active(sk->sk_sleep))
  618. wake_up_interruptible_all(sk->sk_sleep);
  619. }
  620. /*
  621. * A state change on a connected socket means it's dying or dead.
  622. */
  623. static void
  624. svc_tcp_state_change(struct sock *sk)
  625. {
  626. struct svc_sock *svsk = (struct svc_sock *)sk->sk_user_data;
  627. dprintk("svc: socket %p TCP (connected) state change %d (svsk %p)\n",
  628. sk, sk->sk_state, sk->sk_user_data);
  629. if (!svsk)
  630. printk("svc: socket %p: no user data\n", sk);
  631. else {
  632. set_bit(SK_CLOSE, &svsk->sk_flags);
  633. svc_sock_enqueue(svsk);
  634. }
  635. if (sk->sk_sleep && waitqueue_active(sk->sk_sleep))
  636. wake_up_interruptible_all(sk->sk_sleep);
  637. }
  638. static void
  639. svc_tcp_data_ready(struct sock *sk, int count)
  640. {
  641. struct svc_sock *svsk = (struct svc_sock *)sk->sk_user_data;
  642. dprintk("svc: socket %p TCP data ready (svsk %p)\n",
  643. sk, sk->sk_user_data);
  644. if (svsk) {
  645. set_bit(SK_DATA, &svsk->sk_flags);
  646. svc_sock_enqueue(svsk);
  647. }
  648. if (sk->sk_sleep && waitqueue_active(sk->sk_sleep))
  649. wake_up_interruptible(sk->sk_sleep);
  650. }
  651. /*
  652. * Accept a TCP connection
  653. */
  654. static void
  655. svc_tcp_accept(struct svc_sock *svsk)
  656. {
  657. struct sockaddr_in sin;
  658. struct svc_serv *serv = svsk->sk_server;
  659. struct socket *sock = svsk->sk_sock;
  660. struct socket *newsock;
  661. const struct proto_ops *ops;
  662. struct svc_sock *newsvsk;
  663. int err, slen;
  664. dprintk("svc: tcp_accept %p sock %p\n", svsk, sock);
  665. if (!sock)
  666. return;
  667. err = sock_create_lite(PF_INET, SOCK_STREAM, IPPROTO_TCP, &newsock);
  668. if (err) {
  669. if (err == -ENOMEM)
  670. printk(KERN_WARNING "%s: no more sockets!\n",
  671. serv->sv_name);
  672. return;
  673. }
  674. dprintk("svc: tcp_accept %p allocated\n", newsock);
  675. newsock->ops = ops = sock->ops;
  676. clear_bit(SK_CONN, &svsk->sk_flags);
  677. if ((err = ops->accept(sock, newsock, O_NONBLOCK)) < 0) {
  678. if (err != -EAGAIN && net_ratelimit())
  679. printk(KERN_WARNING "%s: accept failed (err %d)!\n",
  680. serv->sv_name, -err);
  681. goto failed; /* aborted connection or whatever */
  682. }
  683. set_bit(SK_CONN, &svsk->sk_flags);
  684. svc_sock_enqueue(svsk);
  685. slen = sizeof(sin);
  686. err = ops->getname(newsock, (struct sockaddr *) &sin, &slen, 1);
  687. if (err < 0) {
  688. if (net_ratelimit())
  689. printk(KERN_WARNING "%s: peername failed (err %d)!\n",
  690. serv->sv_name, -err);
  691. goto failed; /* aborted connection or whatever */
  692. }
  693. /* Ideally, we would want to reject connections from unauthorized
  694. * hosts here, but when we get encription, the IP of the host won't
  695. * tell us anything. For now just warn about unpriv connections.
  696. */
  697. if (ntohs(sin.sin_port) >= 1024) {
  698. dprintk(KERN_WARNING
  699. "%s: connect from unprivileged port: %u.%u.%u.%u:%d\n",
  700. serv->sv_name,
  701. NIPQUAD(sin.sin_addr.s_addr), ntohs(sin.sin_port));
  702. }
  703. dprintk("%s: connect from %u.%u.%u.%u:%04x\n", serv->sv_name,
  704. NIPQUAD(sin.sin_addr.s_addr), ntohs(sin.sin_port));
  705. /* make sure that a write doesn't block forever when
  706. * low on memory
  707. */
  708. newsock->sk->sk_sndtimeo = HZ*30;
  709. if (!(newsvsk = svc_setup_socket(serv, newsock, &err, 0)))
  710. goto failed;
  711. /* make sure that we don't have too many active connections.
  712. * If we have, something must be dropped.
  713. *
  714. * There's no point in trying to do random drop here for
  715. * DoS prevention. The NFS clients does 1 reconnect in 15
  716. * seconds. An attacker can easily beat that.
  717. *
  718. * The only somewhat efficient mechanism would be if drop
  719. * old connections from the same IP first. But right now
  720. * we don't even record the client IP in svc_sock.
  721. */
  722. if (serv->sv_tmpcnt > (serv->sv_nrthreads+3)*20) {
  723. struct svc_sock *svsk = NULL;
  724. spin_lock_bh(&serv->sv_lock);
  725. if (!list_empty(&serv->sv_tempsocks)) {
  726. if (net_ratelimit()) {
  727. /* Try to help the admin */
  728. printk(KERN_NOTICE "%s: too many open TCP "
  729. "sockets, consider increasing the "
  730. "number of nfsd threads\n",
  731. serv->sv_name);
  732. printk(KERN_NOTICE "%s: last TCP connect from "
  733. "%u.%u.%u.%u:%d\n",
  734. serv->sv_name,
  735. NIPQUAD(sin.sin_addr.s_addr),
  736. ntohs(sin.sin_port));
  737. }
  738. /*
  739. * Always select the oldest socket. It's not fair,
  740. * but so is life
  741. */
  742. svsk = list_entry(serv->sv_tempsocks.prev,
  743. struct svc_sock,
  744. sk_list);
  745. set_bit(SK_CLOSE, &svsk->sk_flags);
  746. svsk->sk_inuse ++;
  747. }
  748. spin_unlock_bh(&serv->sv_lock);
  749. if (svsk) {
  750. svc_sock_enqueue(svsk);
  751. svc_sock_put(svsk);
  752. }
  753. }
  754. if (serv->sv_stats)
  755. serv->sv_stats->nettcpconn++;
  756. return;
  757. failed:
  758. sock_release(newsock);
  759. return;
  760. }
  761. /*
  762. * Receive data from a TCP socket.
  763. */
  764. static int
  765. svc_tcp_recvfrom(struct svc_rqst *rqstp)
  766. {
  767. struct svc_sock *svsk = rqstp->rq_sock;
  768. struct svc_serv *serv = svsk->sk_server;
  769. int len;
  770. struct kvec vec[RPCSVC_MAXPAGES];
  771. int pnum, vlen;
  772. dprintk("svc: tcp_recv %p data %d conn %d close %d\n",
  773. svsk, test_bit(SK_DATA, &svsk->sk_flags),
  774. test_bit(SK_CONN, &svsk->sk_flags),
  775. test_bit(SK_CLOSE, &svsk->sk_flags));
  776. if ((rqstp->rq_deferred = svc_deferred_dequeue(svsk))) {
  777. svc_sock_received(svsk);
  778. return svc_deferred_recv(rqstp);
  779. }
  780. if (test_bit(SK_CLOSE, &svsk->sk_flags)) {
  781. svc_delete_socket(svsk);
  782. return 0;
  783. }
  784. if (test_bit(SK_CONN, &svsk->sk_flags)) {
  785. svc_tcp_accept(svsk);
  786. svc_sock_received(svsk);
  787. return 0;
  788. }
  789. if (test_and_clear_bit(SK_CHNGBUF, &svsk->sk_flags))
  790. /* sndbuf needs to have room for one request
  791. * per thread, otherwise we can stall even when the
  792. * network isn't a bottleneck.
  793. * rcvbuf just needs to be able to hold a few requests.
  794. * Normally they will be removed from the queue
  795. * as soon a a complete request arrives.
  796. */
  797. svc_sock_setbufsize(svsk->sk_sock,
  798. (serv->sv_nrthreads+3) * serv->sv_bufsz,
  799. 3 * serv->sv_bufsz);
  800. clear_bit(SK_DATA, &svsk->sk_flags);
  801. /* Receive data. If we haven't got the record length yet, get
  802. * the next four bytes. Otherwise try to gobble up as much as
  803. * possible up to the complete record length.
  804. */
  805. if (svsk->sk_tcplen < 4) {
  806. unsigned long want = 4 - svsk->sk_tcplen;
  807. struct kvec iov;
  808. iov.iov_base = ((char *) &svsk->sk_reclen) + svsk->sk_tcplen;
  809. iov.iov_len = want;
  810. if ((len = svc_recvfrom(rqstp, &iov, 1, want)) < 0)
  811. goto error;
  812. svsk->sk_tcplen += len;
  813. if (len < want) {
  814. dprintk("svc: short recvfrom while reading record length (%d of %lu)\n",
  815. len, want);
  816. svc_sock_received(svsk);
  817. return -EAGAIN; /* record header not complete */
  818. }
  819. svsk->sk_reclen = ntohl(svsk->sk_reclen);
  820. if (!(svsk->sk_reclen & 0x80000000)) {
  821. /* FIXME: technically, a record can be fragmented,
  822. * and non-terminal fragments will not have the top
  823. * bit set in the fragment length header.
  824. * But apparently no known nfs clients send fragmented
  825. * records. */
  826. printk(KERN_NOTICE "RPC: bad TCP reclen 0x%08lx (non-terminal)\n",
  827. (unsigned long) svsk->sk_reclen);
  828. goto err_delete;
  829. }
  830. svsk->sk_reclen &= 0x7fffffff;
  831. dprintk("svc: TCP record, %d bytes\n", svsk->sk_reclen);
  832. if (svsk->sk_reclen > serv->sv_bufsz) {
  833. printk(KERN_NOTICE "RPC: bad TCP reclen 0x%08lx (large)\n",
  834. (unsigned long) svsk->sk_reclen);
  835. goto err_delete;
  836. }
  837. }
  838. /* Check whether enough data is available */
  839. len = svc_recv_available(svsk);
  840. if (len < 0)
  841. goto error;
  842. if (len < svsk->sk_reclen) {
  843. dprintk("svc: incomplete TCP record (%d of %d)\n",
  844. len, svsk->sk_reclen);
  845. svc_sock_received(svsk);
  846. return -EAGAIN; /* record not complete */
  847. }
  848. len = svsk->sk_reclen;
  849. set_bit(SK_DATA, &svsk->sk_flags);
  850. vec[0] = rqstp->rq_arg.head[0];
  851. vlen = PAGE_SIZE;
  852. pnum = 1;
  853. while (vlen < len) {
  854. vec[pnum].iov_base = page_address(rqstp->rq_argpages[rqstp->rq_argused++]);
  855. vec[pnum].iov_len = PAGE_SIZE;
  856. pnum++;
  857. vlen += PAGE_SIZE;
  858. }
  859. /* Now receive data */
  860. len = svc_recvfrom(rqstp, vec, pnum, len);
  861. if (len < 0)
  862. goto error;
  863. dprintk("svc: TCP complete record (%d bytes)\n", len);
  864. rqstp->rq_arg.len = len;
  865. rqstp->rq_arg.page_base = 0;
  866. if (len <= rqstp->rq_arg.head[0].iov_len) {
  867. rqstp->rq_arg.head[0].iov_len = len;
  868. rqstp->rq_arg.page_len = 0;
  869. } else {
  870. rqstp->rq_arg.page_len = len - rqstp->rq_arg.head[0].iov_len;
  871. }
  872. rqstp->rq_skbuff = NULL;
  873. rqstp->rq_prot = IPPROTO_TCP;
  874. /* Reset TCP read info */
  875. svsk->sk_reclen = 0;
  876. svsk->sk_tcplen = 0;
  877. svc_sock_received(svsk);
  878. if (serv->sv_stats)
  879. serv->sv_stats->nettcpcnt++;
  880. return len;
  881. err_delete:
  882. svc_delete_socket(svsk);
  883. return -EAGAIN;
  884. error:
  885. if (len == -EAGAIN) {
  886. dprintk("RPC: TCP recvfrom got EAGAIN\n");
  887. svc_sock_received(svsk);
  888. } else {
  889. printk(KERN_NOTICE "%s: recvfrom returned errno %d\n",
  890. svsk->sk_server->sv_name, -len);
  891. goto err_delete;
  892. }
  893. return len;
  894. }
  895. /*
  896. * Send out data on TCP socket.
  897. */
  898. static int
  899. svc_tcp_sendto(struct svc_rqst *rqstp)
  900. {
  901. struct xdr_buf *xbufp = &rqstp->rq_res;
  902. int sent;
  903. u32 reclen;
  904. /* Set up the first element of the reply kvec.
  905. * Any other kvecs that may be in use have been taken
  906. * care of by the server implementation itself.
  907. */
  908. reclen = htonl(0x80000000|((xbufp->len ) - 4));
  909. memcpy(xbufp->head[0].iov_base, &reclen, 4);
  910. if (test_bit(SK_DEAD, &rqstp->rq_sock->sk_flags))
  911. return -ENOTCONN;
  912. sent = svc_sendto(rqstp, &rqstp->rq_res);
  913. if (sent != xbufp->len) {
  914. printk(KERN_NOTICE "rpc-srv/tcp: %s: %s %d when sending %d bytes - shutting down socket\n",
  915. rqstp->rq_sock->sk_server->sv_name,
  916. (sent<0)?"got error":"sent only",
  917. sent, xbufp->len);
  918. svc_delete_socket(rqstp->rq_sock);
  919. sent = -EAGAIN;
  920. }
  921. return sent;
  922. }
  923. static void
  924. svc_tcp_init(struct svc_sock *svsk)
  925. {
  926. struct sock *sk = svsk->sk_sk;
  927. struct tcp_sock *tp = tcp_sk(sk);
  928. svsk->sk_recvfrom = svc_tcp_recvfrom;
  929. svsk->sk_sendto = svc_tcp_sendto;
  930. if (sk->sk_state == TCP_LISTEN) {
  931. dprintk("setting up TCP socket for listening\n");
  932. sk->sk_data_ready = svc_tcp_listen_data_ready;
  933. set_bit(SK_CONN, &svsk->sk_flags);
  934. } else {
  935. dprintk("setting up TCP socket for reading\n");
  936. sk->sk_state_change = svc_tcp_state_change;
  937. sk->sk_data_ready = svc_tcp_data_ready;
  938. sk->sk_write_space = svc_write_space;
  939. svsk->sk_reclen = 0;
  940. svsk->sk_tcplen = 0;
  941. tp->nonagle = 1; /* disable Nagle's algorithm */
  942. /* initialise setting must have enough space to
  943. * receive and respond to one request.
  944. * svc_tcp_recvfrom will re-adjust if necessary
  945. */
  946. svc_sock_setbufsize(svsk->sk_sock,
  947. 3 * svsk->sk_server->sv_bufsz,
  948. 3 * svsk->sk_server->sv_bufsz);
  949. set_bit(SK_CHNGBUF, &svsk->sk_flags);
  950. set_bit(SK_DATA, &svsk->sk_flags);
  951. if (sk->sk_state != TCP_ESTABLISHED)
  952. set_bit(SK_CLOSE, &svsk->sk_flags);
  953. }
  954. }
  955. void
  956. svc_sock_update_bufs(struct svc_serv *serv)
  957. {
  958. /*
  959. * The number of server threads has changed. Update
  960. * rcvbuf and sndbuf accordingly on all sockets
  961. */
  962. struct list_head *le;
  963. spin_lock_bh(&serv->sv_lock);
  964. list_for_each(le, &serv->sv_permsocks) {
  965. struct svc_sock *svsk =
  966. list_entry(le, struct svc_sock, sk_list);
  967. set_bit(SK_CHNGBUF, &svsk->sk_flags);
  968. }
  969. list_for_each(le, &serv->sv_tempsocks) {
  970. struct svc_sock *svsk =
  971. list_entry(le, struct svc_sock, sk_list);
  972. set_bit(SK_CHNGBUF, &svsk->sk_flags);
  973. }
  974. spin_unlock_bh(&serv->sv_lock);
  975. }
  976. /*
  977. * Receive the next request on any socket.
  978. */
  979. int
  980. svc_recv(struct svc_serv *serv, struct svc_rqst *rqstp, long timeout)
  981. {
  982. struct svc_sock *svsk =NULL;
  983. int len;
  984. int pages;
  985. struct xdr_buf *arg;
  986. DECLARE_WAITQUEUE(wait, current);
  987. dprintk("svc: server %p waiting for data (to = %ld)\n",
  988. rqstp, timeout);
  989. if (rqstp->rq_sock)
  990. printk(KERN_ERR
  991. "svc_recv: service %p, socket not NULL!\n",
  992. rqstp);
  993. if (waitqueue_active(&rqstp->rq_wait))
  994. printk(KERN_ERR
  995. "svc_recv: service %p, wait queue active!\n",
  996. rqstp);
  997. /* Initialize the buffers */
  998. /* first reclaim pages that were moved to response list */
  999. svc_pushback_allpages(rqstp);
  1000. /* now allocate needed pages. If we get a failure, sleep briefly */
  1001. pages = 2 + (serv->sv_bufsz + PAGE_SIZE -1) / PAGE_SIZE;
  1002. while (rqstp->rq_arghi < pages) {
  1003. struct page *p = alloc_page(GFP_KERNEL);
  1004. if (!p) {
  1005. schedule_timeout_uninterruptible(msecs_to_jiffies(500));
  1006. continue;
  1007. }
  1008. rqstp->rq_argpages[rqstp->rq_arghi++] = p;
  1009. }
  1010. /* Make arg->head point to first page and arg->pages point to rest */
  1011. arg = &rqstp->rq_arg;
  1012. arg->head[0].iov_base = page_address(rqstp->rq_argpages[0]);
  1013. arg->head[0].iov_len = PAGE_SIZE;
  1014. rqstp->rq_argused = 1;
  1015. arg->pages = rqstp->rq_argpages + 1;
  1016. arg->page_base = 0;
  1017. /* save at least one page for response */
  1018. arg->page_len = (pages-2)*PAGE_SIZE;
  1019. arg->len = (pages-1)*PAGE_SIZE;
  1020. arg->tail[0].iov_len = 0;
  1021. try_to_freeze();
  1022. cond_resched();
  1023. if (signalled())
  1024. return -EINTR;
  1025. spin_lock_bh(&serv->sv_lock);
  1026. if (!list_empty(&serv->sv_tempsocks)) {
  1027. svsk = list_entry(serv->sv_tempsocks.next,
  1028. struct svc_sock, sk_list);
  1029. /* apparently the "standard" is that clients close
  1030. * idle connections after 5 minutes, servers after
  1031. * 6 minutes
  1032. * http://www.connectathon.org/talks96/nfstcp.pdf
  1033. */
  1034. if (get_seconds() - svsk->sk_lastrecv < 6*60
  1035. || test_bit(SK_BUSY, &svsk->sk_flags))
  1036. svsk = NULL;
  1037. }
  1038. if (svsk) {
  1039. set_bit(SK_BUSY, &svsk->sk_flags);
  1040. set_bit(SK_CLOSE, &svsk->sk_flags);
  1041. rqstp->rq_sock = svsk;
  1042. svsk->sk_inuse++;
  1043. } else if ((svsk = svc_sock_dequeue(serv)) != NULL) {
  1044. rqstp->rq_sock = svsk;
  1045. svsk->sk_inuse++;
  1046. rqstp->rq_reserved = serv->sv_bufsz;
  1047. svsk->sk_reserved += rqstp->rq_reserved;
  1048. } else {
  1049. /* No data pending. Go to sleep */
  1050. svc_serv_enqueue(serv, rqstp);
  1051. /*
  1052. * We have to be able to interrupt this wait
  1053. * to bring down the daemons ...
  1054. */
  1055. set_current_state(TASK_INTERRUPTIBLE);
  1056. add_wait_queue(&rqstp->rq_wait, &wait);
  1057. spin_unlock_bh(&serv->sv_lock);
  1058. schedule_timeout(timeout);
  1059. try_to_freeze();
  1060. spin_lock_bh(&serv->sv_lock);
  1061. remove_wait_queue(&rqstp->rq_wait, &wait);
  1062. if (!(svsk = rqstp->rq_sock)) {
  1063. svc_serv_dequeue(serv, rqstp);
  1064. spin_unlock_bh(&serv->sv_lock);
  1065. dprintk("svc: server %p, no data yet\n", rqstp);
  1066. return signalled()? -EINTR : -EAGAIN;
  1067. }
  1068. }
  1069. spin_unlock_bh(&serv->sv_lock);
  1070. dprintk("svc: server %p, socket %p, inuse=%d\n",
  1071. rqstp, svsk, svsk->sk_inuse);
  1072. len = svsk->sk_recvfrom(rqstp);
  1073. dprintk("svc: got len=%d\n", len);
  1074. /* No data, incomplete (TCP) read, or accept() */
  1075. if (len == 0 || len == -EAGAIN) {
  1076. rqstp->rq_res.len = 0;
  1077. svc_sock_release(rqstp);
  1078. return -EAGAIN;
  1079. }
  1080. svsk->sk_lastrecv = get_seconds();
  1081. if (test_bit(SK_TEMP, &svsk->sk_flags)) {
  1082. /* push active sockets to end of list */
  1083. spin_lock_bh(&serv->sv_lock);
  1084. if (!list_empty(&svsk->sk_list))
  1085. list_move_tail(&svsk->sk_list, &serv->sv_tempsocks);
  1086. spin_unlock_bh(&serv->sv_lock);
  1087. }
  1088. rqstp->rq_secure = ntohs(rqstp->rq_addr.sin_port) < 1024;
  1089. rqstp->rq_chandle.defer = svc_defer;
  1090. if (serv->sv_stats)
  1091. serv->sv_stats->netcnt++;
  1092. return len;
  1093. }
  1094. /*
  1095. * Drop request
  1096. */
  1097. void
  1098. svc_drop(struct svc_rqst *rqstp)
  1099. {
  1100. dprintk("svc: socket %p dropped request\n", rqstp->rq_sock);
  1101. svc_sock_release(rqstp);
  1102. }
  1103. /*
  1104. * Return reply to client.
  1105. */
  1106. int
  1107. svc_send(struct svc_rqst *rqstp)
  1108. {
  1109. struct svc_sock *svsk;
  1110. int len;
  1111. struct xdr_buf *xb;
  1112. if ((svsk = rqstp->rq_sock) == NULL) {
  1113. printk(KERN_WARNING "NULL socket pointer in %s:%d\n",
  1114. __FILE__, __LINE__);
  1115. return -EFAULT;
  1116. }
  1117. /* release the receive skb before sending the reply */
  1118. svc_release_skb(rqstp);
  1119. /* calculate over-all length */
  1120. xb = & rqstp->rq_res;
  1121. xb->len = xb->head[0].iov_len +
  1122. xb->page_len +
  1123. xb->tail[0].iov_len;
  1124. /* Grab svsk->sk_sem to serialize outgoing data. */
  1125. down(&svsk->sk_sem);
  1126. if (test_bit(SK_DEAD, &svsk->sk_flags))
  1127. len = -ENOTCONN;
  1128. else
  1129. len = svsk->sk_sendto(rqstp);
  1130. up(&svsk->sk_sem);
  1131. svc_sock_release(rqstp);
  1132. if (len == -ECONNREFUSED || len == -ENOTCONN || len == -EAGAIN)
  1133. return 0;
  1134. return len;
  1135. }
  1136. /*
  1137. * Initialize socket for RPC use and create svc_sock struct
  1138. * XXX: May want to setsockopt SO_SNDBUF and SO_RCVBUF.
  1139. */
  1140. static struct svc_sock *
  1141. svc_setup_socket(struct svc_serv *serv, struct socket *sock,
  1142. int *errp, int pmap_register)
  1143. {
  1144. struct svc_sock *svsk;
  1145. struct sock *inet;
  1146. dprintk("svc: svc_setup_socket %p\n", sock);
  1147. if (!(svsk = kmalloc(sizeof(*svsk), GFP_KERNEL))) {
  1148. *errp = -ENOMEM;
  1149. return NULL;
  1150. }
  1151. memset(svsk, 0, sizeof(*svsk));
  1152. inet = sock->sk;
  1153. /* Register socket with portmapper */
  1154. if (*errp >= 0 && pmap_register)
  1155. *errp = svc_register(serv, inet->sk_protocol,
  1156. ntohs(inet_sk(inet)->sport));
  1157. if (*errp < 0) {
  1158. kfree(svsk);
  1159. return NULL;
  1160. }
  1161. set_bit(SK_BUSY, &svsk->sk_flags);
  1162. inet->sk_user_data = svsk;
  1163. svsk->sk_sock = sock;
  1164. svsk->sk_sk = inet;
  1165. svsk->sk_ostate = inet->sk_state_change;
  1166. svsk->sk_odata = inet->sk_data_ready;
  1167. svsk->sk_owspace = inet->sk_write_space;
  1168. svsk->sk_server = serv;
  1169. svsk->sk_lastrecv = get_seconds();
  1170. INIT_LIST_HEAD(&svsk->sk_deferred);
  1171. INIT_LIST_HEAD(&svsk->sk_ready);
  1172. sema_init(&svsk->sk_sem, 1);
  1173. /* Initialize the socket */
  1174. if (sock->type == SOCK_DGRAM)
  1175. svc_udp_init(svsk);
  1176. else
  1177. svc_tcp_init(svsk);
  1178. spin_lock_bh(&serv->sv_lock);
  1179. if (!pmap_register) {
  1180. set_bit(SK_TEMP, &svsk->sk_flags);
  1181. list_add(&svsk->sk_list, &serv->sv_tempsocks);
  1182. serv->sv_tmpcnt++;
  1183. } else {
  1184. clear_bit(SK_TEMP, &svsk->sk_flags);
  1185. list_add(&svsk->sk_list, &serv->sv_permsocks);
  1186. }
  1187. spin_unlock_bh(&serv->sv_lock);
  1188. dprintk("svc: svc_setup_socket created %p (inet %p)\n",
  1189. svsk, svsk->sk_sk);
  1190. clear_bit(SK_BUSY, &svsk->sk_flags);
  1191. svc_sock_enqueue(svsk);
  1192. return svsk;
  1193. }
  1194. /*
  1195. * Create socket for RPC service.
  1196. */
  1197. static int
  1198. svc_create_socket(struct svc_serv *serv, int protocol, struct sockaddr_in *sin)
  1199. {
  1200. struct svc_sock *svsk;
  1201. struct socket *sock;
  1202. int error;
  1203. int type;
  1204. dprintk("svc: svc_create_socket(%s, %d, %u.%u.%u.%u:%d)\n",
  1205. serv->sv_program->pg_name, protocol,
  1206. NIPQUAD(sin->sin_addr.s_addr),
  1207. ntohs(sin->sin_port));
  1208. if (protocol != IPPROTO_UDP && protocol != IPPROTO_TCP) {
  1209. printk(KERN_WARNING "svc: only UDP and TCP "
  1210. "sockets supported\n");
  1211. return -EINVAL;
  1212. }
  1213. type = (protocol == IPPROTO_UDP)? SOCK_DGRAM : SOCK_STREAM;
  1214. if ((error = sock_create_kern(PF_INET, type, protocol, &sock)) < 0)
  1215. return error;
  1216. if (sin != NULL) {
  1217. if (type == SOCK_STREAM)
  1218. sock->sk->sk_reuse = 1; /* allow address reuse */
  1219. error = sock->ops->bind(sock, (struct sockaddr *) sin,
  1220. sizeof(*sin));
  1221. if (error < 0)
  1222. goto bummer;
  1223. }
  1224. if (protocol == IPPROTO_TCP) {
  1225. if ((error = sock->ops->listen(sock, 64)) < 0)
  1226. goto bummer;
  1227. }
  1228. if ((svsk = svc_setup_socket(serv, sock, &error, 1)) != NULL)
  1229. return 0;
  1230. bummer:
  1231. dprintk("svc: svc_create_socket error = %d\n", -error);
  1232. sock_release(sock);
  1233. return error;
  1234. }
  1235. /*
  1236. * Remove a dead socket
  1237. */
  1238. void
  1239. svc_delete_socket(struct svc_sock *svsk)
  1240. {
  1241. struct svc_serv *serv;
  1242. struct sock *sk;
  1243. dprintk("svc: svc_delete_socket(%p)\n", svsk);
  1244. serv = svsk->sk_server;
  1245. sk = svsk->sk_sk;
  1246. sk->sk_state_change = svsk->sk_ostate;
  1247. sk->sk_data_ready = svsk->sk_odata;
  1248. sk->sk_write_space = svsk->sk_owspace;
  1249. spin_lock_bh(&serv->sv_lock);
  1250. list_del_init(&svsk->sk_list);
  1251. list_del_init(&svsk->sk_ready);
  1252. if (!test_and_set_bit(SK_DEAD, &svsk->sk_flags))
  1253. if (test_bit(SK_TEMP, &svsk->sk_flags))
  1254. serv->sv_tmpcnt--;
  1255. if (!svsk->sk_inuse) {
  1256. spin_unlock_bh(&serv->sv_lock);
  1257. sock_release(svsk->sk_sock);
  1258. kfree(svsk);
  1259. } else {
  1260. spin_unlock_bh(&serv->sv_lock);
  1261. dprintk(KERN_NOTICE "svc: server socket destroy delayed\n");
  1262. /* svsk->sk_server = NULL; */
  1263. }
  1264. }
  1265. /*
  1266. * Make a socket for nfsd and lockd
  1267. */
  1268. int
  1269. svc_makesock(struct svc_serv *serv, int protocol, unsigned short port)
  1270. {
  1271. struct sockaddr_in sin;
  1272. dprintk("svc: creating socket proto = %d\n", protocol);
  1273. sin.sin_family = AF_INET;
  1274. sin.sin_addr.s_addr = INADDR_ANY;
  1275. sin.sin_port = htons(port);
  1276. return svc_create_socket(serv, protocol, &sin);
  1277. }
  1278. /*
  1279. * Handle defer and revisit of requests
  1280. */
  1281. static void svc_revisit(struct cache_deferred_req *dreq, int too_many)
  1282. {
  1283. struct svc_deferred_req *dr = container_of(dreq, struct svc_deferred_req, handle);
  1284. struct svc_serv *serv = dreq->owner;
  1285. struct svc_sock *svsk;
  1286. if (too_many) {
  1287. svc_sock_put(dr->svsk);
  1288. kfree(dr);
  1289. return;
  1290. }
  1291. dprintk("revisit queued\n");
  1292. svsk = dr->svsk;
  1293. dr->svsk = NULL;
  1294. spin_lock_bh(&serv->sv_lock);
  1295. list_add(&dr->handle.recent, &svsk->sk_deferred);
  1296. spin_unlock_bh(&serv->sv_lock);
  1297. set_bit(SK_DEFERRED, &svsk->sk_flags);
  1298. svc_sock_enqueue(svsk);
  1299. svc_sock_put(svsk);
  1300. }
  1301. static struct cache_deferred_req *
  1302. svc_defer(struct cache_req *req)
  1303. {
  1304. struct svc_rqst *rqstp = container_of(req, struct svc_rqst, rq_chandle);
  1305. int size = sizeof(struct svc_deferred_req) + (rqstp->rq_arg.len);
  1306. struct svc_deferred_req *dr;
  1307. if (rqstp->rq_arg.page_len)
  1308. return NULL; /* if more than a page, give up FIXME */
  1309. if (rqstp->rq_deferred) {
  1310. dr = rqstp->rq_deferred;
  1311. rqstp->rq_deferred = NULL;
  1312. } else {
  1313. int skip = rqstp->rq_arg.len - rqstp->rq_arg.head[0].iov_len;
  1314. /* FIXME maybe discard if size too large */
  1315. dr = kmalloc(size, GFP_KERNEL);
  1316. if (dr == NULL)
  1317. return NULL;
  1318. dr->handle.owner = rqstp->rq_server;
  1319. dr->prot = rqstp->rq_prot;
  1320. dr->addr = rqstp->rq_addr;
  1321. dr->daddr = rqstp->rq_daddr;
  1322. dr->argslen = rqstp->rq_arg.len >> 2;
  1323. memcpy(dr->args, rqstp->rq_arg.head[0].iov_base-skip, dr->argslen<<2);
  1324. }
  1325. spin_lock_bh(&rqstp->rq_server->sv_lock);
  1326. rqstp->rq_sock->sk_inuse++;
  1327. dr->svsk = rqstp->rq_sock;
  1328. spin_unlock_bh(&rqstp->rq_server->sv_lock);
  1329. dr->handle.revisit = svc_revisit;
  1330. return &dr->handle;
  1331. }
  1332. /*
  1333. * recv data from a deferred request into an active one
  1334. */
  1335. static int svc_deferred_recv(struct svc_rqst *rqstp)
  1336. {
  1337. struct svc_deferred_req *dr = rqstp->rq_deferred;
  1338. rqstp->rq_arg.head[0].iov_base = dr->args;
  1339. rqstp->rq_arg.head[0].iov_len = dr->argslen<<2;
  1340. rqstp->rq_arg.page_len = 0;
  1341. rqstp->rq_arg.len = dr->argslen<<2;
  1342. rqstp->rq_prot = dr->prot;
  1343. rqstp->rq_addr = dr->addr;
  1344. rqstp->rq_daddr = dr->daddr;
  1345. return dr->argslen<<2;
  1346. }
  1347. static struct svc_deferred_req *svc_deferred_dequeue(struct svc_sock *svsk)
  1348. {
  1349. struct svc_deferred_req *dr = NULL;
  1350. struct svc_serv *serv = svsk->sk_server;
  1351. if (!test_bit(SK_DEFERRED, &svsk->sk_flags))
  1352. return NULL;
  1353. spin_lock_bh(&serv->sv_lock);
  1354. clear_bit(SK_DEFERRED, &svsk->sk_flags);
  1355. if (!list_empty(&svsk->sk_deferred)) {
  1356. dr = list_entry(svsk->sk_deferred.next,
  1357. struct svc_deferred_req,
  1358. handle.recent);
  1359. list_del_init(&dr->handle.recent);
  1360. set_bit(SK_DEFERRED, &svsk->sk_flags);
  1361. }
  1362. spin_unlock_bh(&serv->sv_lock);
  1363. return dr;
  1364. }