svcsock.c 43 KB

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