svc.h 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440
  1. /*
  2. * linux/include/linux/sunrpc/svc.h
  3. *
  4. * RPC server declarations.
  5. *
  6. * Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
  7. */
  8. #ifndef SUNRPC_SVC_H
  9. #define SUNRPC_SVC_H
  10. #include <linux/in.h>
  11. #include <linux/in6.h>
  12. #include <linux/sunrpc/types.h>
  13. #include <linux/sunrpc/xdr.h>
  14. #include <linux/sunrpc/auth.h>
  15. #include <linux/sunrpc/svcauth.h>
  16. #include <linux/wait.h>
  17. #include <linux/mm.h>
  18. /*
  19. * This is the RPC server thread function prototype
  20. */
  21. typedef int (*svc_thread_fn)(void *);
  22. /* statistics for svc_pool structures */
  23. struct svc_pool_stats {
  24. unsigned long packets;
  25. unsigned long sockets_queued;
  26. unsigned long threads_woken;
  27. unsigned long overloads_avoided;
  28. unsigned long threads_timedout;
  29. };
  30. /*
  31. *
  32. * RPC service thread pool.
  33. *
  34. * Pool of threads and temporary sockets. Generally there is only
  35. * a single one of these per RPC service, but on NUMA machines those
  36. * services that can benefit from it (i.e. nfs but not lockd) will
  37. * have one pool per NUMA node. This optimisation reduces cross-
  38. * node traffic on multi-node NUMA NFS servers.
  39. */
  40. struct svc_pool {
  41. unsigned int sp_id; /* pool id; also node id on NUMA */
  42. spinlock_t sp_lock; /* protects all fields */
  43. struct list_head sp_threads; /* idle server threads */
  44. struct list_head sp_sockets; /* pending sockets */
  45. unsigned int sp_nrthreads; /* # of threads in pool */
  46. struct list_head sp_all_threads; /* all server threads */
  47. int sp_nwaking; /* number of threads woken but not yet active */
  48. struct svc_pool_stats sp_stats; /* statistics on pool operation */
  49. } ____cacheline_aligned_in_smp;
  50. /*
  51. * RPC service.
  52. *
  53. * An RPC service is a ``daemon,'' possibly multithreaded, which
  54. * receives and processes incoming RPC messages.
  55. * It has one or more transport sockets associated with it, and maintains
  56. * a list of idle threads waiting for input.
  57. *
  58. * We currently do not support more than one RPC program per daemon.
  59. */
  60. struct svc_serv {
  61. struct svc_program * sv_program; /* RPC program */
  62. struct svc_stat * sv_stats; /* RPC statistics */
  63. spinlock_t sv_lock;
  64. unsigned int sv_nrthreads; /* # of server threads */
  65. unsigned int sv_maxconn; /* max connections allowed or
  66. * '0' causing max to be based
  67. * on number of threads. */
  68. unsigned int sv_max_payload; /* datagram payload size */
  69. unsigned int sv_max_mesg; /* max_payload + 1 page for overheads */
  70. unsigned int sv_xdrsize; /* XDR buffer size */
  71. struct list_head sv_permsocks; /* all permanent sockets */
  72. struct list_head sv_tempsocks; /* all temporary sockets */
  73. int sv_tmpcnt; /* count of temporary sockets */
  74. struct timer_list sv_temptimer; /* timer for aging temporary sockets */
  75. char * sv_name; /* service name */
  76. unsigned int sv_nrpools; /* number of thread pools */
  77. struct svc_pool * sv_pools; /* array of thread pools */
  78. void (*sv_shutdown)(struct svc_serv *serv);
  79. /* Callback to use when last thread
  80. * exits.
  81. */
  82. struct module * sv_module; /* optional module to count when
  83. * adding threads */
  84. svc_thread_fn sv_function; /* main function for threads */
  85. unsigned int sv_drc_max_pages; /* Total pages for DRC */
  86. unsigned int sv_drc_pages_used;/* DRC pages used */
  87. };
  88. /*
  89. * We use sv_nrthreads as a reference count. svc_destroy() drops
  90. * this refcount, so we need to bump it up around operations that
  91. * change the number of threads. Horrible, but there it is.
  92. * Should be called with the BKL held.
  93. */
  94. static inline void svc_get(struct svc_serv *serv)
  95. {
  96. serv->sv_nrthreads++;
  97. }
  98. /*
  99. * Maximum payload size supported by a kernel RPC server.
  100. * This is use to determine the max number of pages nfsd is
  101. * willing to return in a single READ operation.
  102. *
  103. * These happen to all be powers of 2, which is not strictly
  104. * necessary but helps enforce the real limitation, which is
  105. * that they should be multiples of PAGE_CACHE_SIZE.
  106. *
  107. * For UDP transports, a block plus NFS,RPC, and UDP headers
  108. * has to fit into the IP datagram limit of 64K. The largest
  109. * feasible number for all known page sizes is probably 48K,
  110. * but we choose 32K here. This is the same as the historical
  111. * Linux limit; someone who cares more about NFS/UDP performance
  112. * can test a larger number.
  113. *
  114. * For TCP transports we have more freedom. A size of 1MB is
  115. * chosen to match the client limit. Other OSes are known to
  116. * have larger limits, but those numbers are probably beyond
  117. * the point of diminishing returns.
  118. */
  119. #define RPCSVC_MAXPAYLOAD (1*1024*1024u)
  120. #define RPCSVC_MAXPAYLOAD_TCP RPCSVC_MAXPAYLOAD
  121. #define RPCSVC_MAXPAYLOAD_UDP (32*1024u)
  122. extern u32 svc_max_payload(const struct svc_rqst *rqstp);
  123. /*
  124. * RPC Requsts and replies are stored in one or more pages.
  125. * We maintain an array of pages for each server thread.
  126. * Requests are copied into these pages as they arrive. Remaining
  127. * pages are available to write the reply into.
  128. *
  129. * Pages are sent using ->sendpage so each server thread needs to
  130. * allocate more to replace those used in sending. To help keep track
  131. * of these pages we have a receive list where all pages initialy live,
  132. * and a send list where pages are moved to when there are to be part
  133. * of a reply.
  134. *
  135. * We use xdr_buf for holding responses as it fits well with NFS
  136. * read responses (that have a header, and some data pages, and possibly
  137. * a tail) and means we can share some client side routines.
  138. *
  139. * The xdr_buf.head kvec always points to the first page in the rq_*pages
  140. * list. The xdr_buf.pages pointer points to the second page on that
  141. * list. xdr_buf.tail points to the end of the first page.
  142. * This assumes that the non-page part of an rpc reply will fit
  143. * in a page - NFSd ensures this. lockd also has no trouble.
  144. *
  145. * Each request/reply pair can have at most one "payload", plus two pages,
  146. * one for the request, and one for the reply.
  147. * We using ->sendfile to return read data, we might need one extra page
  148. * if the request is not page-aligned. So add another '1'.
  149. */
  150. #define RPCSVC_MAXPAGES ((RPCSVC_MAXPAYLOAD+PAGE_SIZE-1)/PAGE_SIZE \
  151. + 2 + 1)
  152. static inline u32 svc_getnl(struct kvec *iov)
  153. {
  154. __be32 val, *vp;
  155. vp = iov->iov_base;
  156. val = *vp++;
  157. iov->iov_base = (void*)vp;
  158. iov->iov_len -= sizeof(__be32);
  159. return ntohl(val);
  160. }
  161. static inline void svc_putnl(struct kvec *iov, u32 val)
  162. {
  163. __be32 *vp = iov->iov_base + iov->iov_len;
  164. *vp = htonl(val);
  165. iov->iov_len += sizeof(__be32);
  166. }
  167. static inline __be32 svc_getu32(struct kvec *iov)
  168. {
  169. __be32 val, *vp;
  170. vp = iov->iov_base;
  171. val = *vp++;
  172. iov->iov_base = (void*)vp;
  173. iov->iov_len -= sizeof(__be32);
  174. return val;
  175. }
  176. static inline void svc_ungetu32(struct kvec *iov)
  177. {
  178. __be32 *vp = (__be32 *)iov->iov_base;
  179. iov->iov_base = (void *)(vp - 1);
  180. iov->iov_len += sizeof(*vp);
  181. }
  182. static inline void svc_putu32(struct kvec *iov, __be32 val)
  183. {
  184. __be32 *vp = iov->iov_base + iov->iov_len;
  185. *vp = val;
  186. iov->iov_len += sizeof(__be32);
  187. }
  188. union svc_addr_u {
  189. struct in_addr addr;
  190. struct in6_addr addr6;
  191. };
  192. /*
  193. * The context of a single thread, including the request currently being
  194. * processed.
  195. */
  196. struct svc_rqst {
  197. struct list_head rq_list; /* idle list */
  198. struct list_head rq_all; /* all threads list */
  199. struct svc_xprt * rq_xprt; /* transport ptr */
  200. struct sockaddr_storage rq_addr; /* peer address */
  201. size_t rq_addrlen;
  202. struct svc_serv * rq_server; /* RPC service definition */
  203. struct svc_pool * rq_pool; /* thread pool */
  204. struct svc_procedure * rq_procinfo; /* procedure info */
  205. struct auth_ops * rq_authop; /* authentication flavour */
  206. u32 rq_flavor; /* pseudoflavor */
  207. struct svc_cred rq_cred; /* auth info */
  208. void * rq_xprt_ctxt; /* transport specific context ptr */
  209. struct svc_deferred_req*rq_deferred; /* deferred request we are replaying */
  210. int rq_usedeferral; /* use deferral */
  211. size_t rq_xprt_hlen; /* xprt header len */
  212. struct xdr_buf rq_arg;
  213. struct xdr_buf rq_res;
  214. struct page * rq_pages[RPCSVC_MAXPAGES];
  215. struct page * *rq_respages; /* points into rq_pages */
  216. int rq_resused; /* number of pages used for result */
  217. struct kvec rq_vec[RPCSVC_MAXPAGES]; /* generally useful.. */
  218. __be32 rq_xid; /* transmission id */
  219. u32 rq_prog; /* program number */
  220. u32 rq_vers; /* program version */
  221. u32 rq_proc; /* procedure number */
  222. u32 rq_prot; /* IP protocol */
  223. unsigned short
  224. rq_secure : 1; /* secure port */
  225. union svc_addr_u rq_daddr; /* dest addr of request
  226. * - reply from here */
  227. void * rq_argp; /* decoded arguments */
  228. void * rq_resp; /* xdr'd results */
  229. void * rq_auth_data; /* flavor-specific data */
  230. int rq_reserved; /* space on socket outq
  231. * reserved for this request
  232. */
  233. struct cache_req rq_chandle; /* handle passed to caches for
  234. * request delaying
  235. */
  236. /* Catering to nfsd */
  237. struct auth_domain * rq_client; /* RPC peer info */
  238. struct auth_domain * rq_gssclient; /* "gss/"-style peer info */
  239. struct svc_cacherep * rq_cacherep; /* cache info */
  240. struct knfsd_fh * rq_reffh; /* Referrence filehandle, used to
  241. * determine what device number
  242. * to report (real or virtual)
  243. */
  244. int rq_splice_ok; /* turned off in gss privacy
  245. * to prevent encrypting page
  246. * cache pages */
  247. wait_queue_head_t rq_wait; /* synchronization */
  248. struct task_struct *rq_task; /* service thread */
  249. int rq_waking; /* 1 if thread is being woken */
  250. };
  251. /*
  252. * Rigorous type checking on sockaddr type conversions
  253. */
  254. static inline struct sockaddr_in *svc_addr_in(const struct svc_rqst *rqst)
  255. {
  256. return (struct sockaddr_in *) &rqst->rq_addr;
  257. }
  258. static inline struct sockaddr_in6 *svc_addr_in6(const struct svc_rqst *rqst)
  259. {
  260. return (struct sockaddr_in6 *) &rqst->rq_addr;
  261. }
  262. static inline struct sockaddr *svc_addr(const struct svc_rqst *rqst)
  263. {
  264. return (struct sockaddr *) &rqst->rq_addr;
  265. }
  266. /*
  267. * Check buffer bounds after decoding arguments
  268. */
  269. static inline int
  270. xdr_argsize_check(struct svc_rqst *rqstp, __be32 *p)
  271. {
  272. char *cp = (char *)p;
  273. struct kvec *vec = &rqstp->rq_arg.head[0];
  274. return cp >= (char*)vec->iov_base
  275. && cp <= (char*)vec->iov_base + vec->iov_len;
  276. }
  277. static inline int
  278. xdr_ressize_check(struct svc_rqst *rqstp, __be32 *p)
  279. {
  280. struct kvec *vec = &rqstp->rq_res.head[0];
  281. char *cp = (char*)p;
  282. vec->iov_len = cp - (char*)vec->iov_base;
  283. return vec->iov_len <= PAGE_SIZE;
  284. }
  285. static inline void svc_free_res_pages(struct svc_rqst *rqstp)
  286. {
  287. while (rqstp->rq_resused) {
  288. struct page **pp = (rqstp->rq_respages +
  289. --rqstp->rq_resused);
  290. if (*pp) {
  291. put_page(*pp);
  292. *pp = NULL;
  293. }
  294. }
  295. }
  296. struct svc_deferred_req {
  297. u32 prot; /* protocol (UDP or TCP) */
  298. struct svc_xprt *xprt;
  299. struct sockaddr_storage addr; /* where reply must go */
  300. size_t addrlen;
  301. union svc_addr_u daddr; /* where reply must come from */
  302. struct cache_deferred_req handle;
  303. size_t xprt_hlen;
  304. int argslen;
  305. __be32 args[0];
  306. };
  307. /*
  308. * List of RPC programs on the same transport endpoint
  309. */
  310. struct svc_program {
  311. struct svc_program * pg_next; /* other programs (same xprt) */
  312. u32 pg_prog; /* program number */
  313. unsigned int pg_lovers; /* lowest version */
  314. unsigned int pg_hivers; /* lowest version */
  315. unsigned int pg_nvers; /* number of versions */
  316. struct svc_version ** pg_vers; /* version array */
  317. char * pg_name; /* service name */
  318. char * pg_class; /* class name: services sharing authentication */
  319. struct svc_stat * pg_stats; /* rpc statistics */
  320. int (*pg_authenticate)(struct svc_rqst *);
  321. };
  322. /*
  323. * RPC program version
  324. */
  325. struct svc_version {
  326. u32 vs_vers; /* version number */
  327. u32 vs_nproc; /* number of procedures */
  328. struct svc_procedure * vs_proc; /* per-procedure info */
  329. u32 vs_xdrsize; /* xdrsize needed for this version */
  330. unsigned int vs_hidden : 1; /* Don't register with portmapper.
  331. * Only used for nfsacl so far. */
  332. /* Override dispatch function (e.g. when caching replies).
  333. * A return value of 0 means drop the request.
  334. * vs_dispatch == NULL means use default dispatcher.
  335. */
  336. int (*vs_dispatch)(struct svc_rqst *, __be32 *);
  337. };
  338. /*
  339. * RPC procedure info
  340. */
  341. typedef __be32 (*svc_procfunc)(struct svc_rqst *, void *argp, void *resp);
  342. struct svc_procedure {
  343. svc_procfunc pc_func; /* process the request */
  344. kxdrproc_t pc_decode; /* XDR decode args */
  345. kxdrproc_t pc_encode; /* XDR encode result */
  346. kxdrproc_t pc_release; /* XDR free result */
  347. unsigned int pc_argsize; /* argument struct size */
  348. unsigned int pc_ressize; /* result struct size */
  349. unsigned int pc_count; /* call count */
  350. unsigned int pc_cachetype; /* cache info (NFS) */
  351. unsigned int pc_xdrressize; /* maximum size of XDR reply */
  352. };
  353. /*
  354. * Function prototypes.
  355. */
  356. struct svc_serv *svc_create(struct svc_program *, unsigned int,
  357. void (*shutdown)(struct svc_serv *));
  358. struct svc_rqst *svc_prepare_thread(struct svc_serv *serv,
  359. struct svc_pool *pool);
  360. void svc_exit_thread(struct svc_rqst *);
  361. struct svc_serv * svc_create_pooled(struct svc_program *, unsigned int,
  362. void (*shutdown)(struct svc_serv *),
  363. svc_thread_fn, struct module *);
  364. int svc_set_num_threads(struct svc_serv *, struct svc_pool *, int);
  365. int svc_pool_stats_open(struct svc_serv *serv, struct file *file);
  366. void svc_destroy(struct svc_serv *);
  367. int svc_process(struct svc_rqst *);
  368. int svc_register(const struct svc_serv *, const int,
  369. const unsigned short, const unsigned short);
  370. void svc_wake_up(struct svc_serv *);
  371. void svc_reserve(struct svc_rqst *rqstp, int space);
  372. struct svc_pool * svc_pool_for_cpu(struct svc_serv *serv, int cpu);
  373. char * svc_print_addr(struct svc_rqst *, char *, size_t);
  374. #define RPC_MAX_ADDRBUFLEN (63U)
  375. /*
  376. * When we want to reduce the size of the reserved space in the response
  377. * buffer, we need to take into account the size of any checksum data that
  378. * may be at the end of the packet. This is difficult to determine exactly
  379. * for all cases without actually generating the checksum, so we just use a
  380. * static value.
  381. */
  382. static inline void svc_reserve_auth(struct svc_rqst *rqstp, int space)
  383. {
  384. int added_space = 0;
  385. if (rqstp->rq_authop->flavour)
  386. added_space = RPC_MAX_AUTH_SIZE;
  387. svc_reserve(rqstp, space + added_space);
  388. }
  389. #endif /* SUNRPC_SVC_H */