svc.h 13 KB

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