svc.h 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503
  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. /* statistics for svc_pool structures */
  19. struct svc_pool_stats {
  20. atomic_long_t packets;
  21. unsigned long sockets_queued;
  22. atomic_long_t threads_woken;
  23. atomic_long_t threads_timedout;
  24. };
  25. /*
  26. *
  27. * RPC service thread pool.
  28. *
  29. * Pool of threads and temporary sockets. Generally there is only
  30. * a single one of these per RPC service, but on NUMA machines those
  31. * services that can benefit from it (i.e. nfs but not lockd) will
  32. * have one pool per NUMA node. This optimisation reduces cross-
  33. * node traffic on multi-node NUMA NFS servers.
  34. */
  35. struct svc_pool {
  36. unsigned int sp_id; /* pool id; also node id on NUMA */
  37. spinlock_t sp_lock; /* protects all fields */
  38. struct list_head sp_sockets; /* pending sockets */
  39. unsigned int sp_nrthreads; /* # of threads in pool */
  40. struct list_head sp_all_threads; /* all server threads */
  41. struct svc_pool_stats sp_stats; /* statistics on pool operation */
  42. #define SP_TASK_PENDING (0) /* still work to do even if no
  43. * xprt is queued. */
  44. unsigned long sp_flags;
  45. } ____cacheline_aligned_in_smp;
  46. struct svc_serv;
  47. struct svc_serv_ops {
  48. /* Callback to use when last thread exits. */
  49. void (*svo_shutdown)(struct svc_serv *, struct net *);
  50. /* function for service threads to run */
  51. int (*svo_function)(void *);
  52. /* queue up a transport for servicing */
  53. void (*svo_enqueue_xprt)(struct svc_xprt *);
  54. /* set up thread (or whatever) execution context */
  55. int (*svo_setup)(struct svc_serv *, struct svc_pool *, int);
  56. /* optional module to count when adding threads (pooled svcs only) */
  57. struct module *svo_module;
  58. };
  59. /*
  60. * RPC service.
  61. *
  62. * An RPC service is a ``daemon,'' possibly multithreaded, which
  63. * receives and processes incoming RPC messages.
  64. * It has one or more transport sockets associated with it, and maintains
  65. * a list of idle threads waiting for input.
  66. *
  67. * We currently do not support more than one RPC program per daemon.
  68. */
  69. struct svc_serv {
  70. struct svc_program * sv_program; /* RPC program */
  71. struct svc_stat * sv_stats; /* RPC statistics */
  72. spinlock_t sv_lock;
  73. unsigned int sv_nrthreads; /* # of server threads */
  74. unsigned int sv_maxconn; /* max connections allowed or
  75. * '0' causing max to be based
  76. * on number of threads. */
  77. unsigned int sv_max_payload; /* datagram payload size */
  78. unsigned int sv_max_mesg; /* max_payload + 1 page for overheads */
  79. unsigned int sv_xdrsize; /* XDR buffer size */
  80. struct list_head sv_permsocks; /* all permanent sockets */
  81. struct list_head sv_tempsocks; /* all temporary sockets */
  82. int sv_tmpcnt; /* count of temporary sockets */
  83. struct timer_list sv_temptimer; /* timer for aging temporary sockets */
  84. char * sv_name; /* service name */
  85. unsigned int sv_nrpools; /* number of thread pools */
  86. struct svc_pool * sv_pools; /* array of thread pools */
  87. struct svc_serv_ops *sv_ops; /* server operations */
  88. #if defined(CONFIG_SUNRPC_BACKCHANNEL)
  89. struct list_head sv_cb_list; /* queue for callback requests
  90. * that arrive over the same
  91. * connection */
  92. spinlock_t sv_cb_lock; /* protects the svc_cb_list */
  93. wait_queue_head_t sv_cb_waitq; /* sleep here if there are no
  94. * entries in the svc_cb_list */
  95. struct svc_xprt *sv_bc_xprt; /* callback on fore channel */
  96. #endif /* CONFIG_SUNRPC_BACKCHANNEL */
  97. };
  98. /*
  99. * We use sv_nrthreads as a reference count. svc_destroy() drops
  100. * this refcount, so we need to bump it up around operations that
  101. * change the number of threads. Horrible, but there it is.
  102. * Should be called with the "service mutex" held.
  103. */
  104. static inline void svc_get(struct svc_serv *serv)
  105. {
  106. serv->sv_nrthreads++;
  107. }
  108. /*
  109. * Maximum payload size supported by a kernel RPC server.
  110. * This is use to determine the max number of pages nfsd is
  111. * willing to return in a single READ operation.
  112. *
  113. * These happen to all be powers of 2, which is not strictly
  114. * necessary but helps enforce the real limitation, which is
  115. * that they should be multiples of PAGE_SIZE.
  116. *
  117. * For UDP transports, a block plus NFS,RPC, and UDP headers
  118. * has to fit into the IP datagram limit of 64K. The largest
  119. * feasible number for all known page sizes is probably 48K,
  120. * but we choose 32K here. This is the same as the historical
  121. * Linux limit; someone who cares more about NFS/UDP performance
  122. * can test a larger number.
  123. *
  124. * For TCP transports we have more freedom. A size of 1MB is
  125. * chosen to match the client limit. Other OSes are known to
  126. * have larger limits, but those numbers are probably beyond
  127. * the point of diminishing returns.
  128. */
  129. #define RPCSVC_MAXPAYLOAD (1*1024*1024u)
  130. #define RPCSVC_MAXPAYLOAD_TCP RPCSVC_MAXPAYLOAD
  131. #define RPCSVC_MAXPAYLOAD_UDP (32*1024u)
  132. extern u32 svc_max_payload(const struct svc_rqst *rqstp);
  133. /*
  134. * RPC Requsts and replies are stored in one or more pages.
  135. * We maintain an array of pages for each server thread.
  136. * Requests are copied into these pages as they arrive. Remaining
  137. * pages are available to write the reply into.
  138. *
  139. * Pages are sent using ->sendpage so each server thread needs to
  140. * allocate more to replace those used in sending. To help keep track
  141. * of these pages we have a receive list where all pages initialy live,
  142. * and a send list where pages are moved to when there are to be part
  143. * of a reply.
  144. *
  145. * We use xdr_buf for holding responses as it fits well with NFS
  146. * read responses (that have a header, and some data pages, and possibly
  147. * a tail) and means we can share some client side routines.
  148. *
  149. * The xdr_buf.head kvec always points to the first page in the rq_*pages
  150. * list. The xdr_buf.pages pointer points to the second page on that
  151. * list. xdr_buf.tail points to the end of the first page.
  152. * This assumes that the non-page part of an rpc reply will fit
  153. * in a page - NFSd ensures this. lockd also has no trouble.
  154. *
  155. * Each request/reply pair can have at most one "payload", plus two pages,
  156. * one for the request, and one for the reply.
  157. * We using ->sendfile to return read data, we might need one extra page
  158. * if the request is not page-aligned. So add another '1'.
  159. */
  160. #define RPCSVC_MAXPAGES ((RPCSVC_MAXPAYLOAD+PAGE_SIZE-1)/PAGE_SIZE \
  161. + 2 + 1)
  162. static inline u32 svc_getnl(struct kvec *iov)
  163. {
  164. __be32 val, *vp;
  165. vp = iov->iov_base;
  166. val = *vp++;
  167. iov->iov_base = (void*)vp;
  168. iov->iov_len -= sizeof(__be32);
  169. return ntohl(val);
  170. }
  171. static inline void svc_putnl(struct kvec *iov, u32 val)
  172. {
  173. __be32 *vp = iov->iov_base + iov->iov_len;
  174. *vp = htonl(val);
  175. iov->iov_len += sizeof(__be32);
  176. }
  177. static inline __be32 svc_getu32(struct kvec *iov)
  178. {
  179. __be32 val, *vp;
  180. vp = iov->iov_base;
  181. val = *vp++;
  182. iov->iov_base = (void*)vp;
  183. iov->iov_len -= sizeof(__be32);
  184. return val;
  185. }
  186. static inline void svc_ungetu32(struct kvec *iov)
  187. {
  188. __be32 *vp = (__be32 *)iov->iov_base;
  189. iov->iov_base = (void *)(vp - 1);
  190. iov->iov_len += sizeof(*vp);
  191. }
  192. static inline void svc_putu32(struct kvec *iov, __be32 val)
  193. {
  194. __be32 *vp = iov->iov_base + iov->iov_len;
  195. *vp = val;
  196. iov->iov_len += sizeof(__be32);
  197. }
  198. /*
  199. * The context of a single thread, including the request currently being
  200. * processed.
  201. */
  202. struct svc_rqst {
  203. struct list_head rq_all; /* all threads list */
  204. struct rcu_head rq_rcu_head; /* for RCU deferred kfree */
  205. struct svc_xprt * rq_xprt; /* transport ptr */
  206. struct sockaddr_storage rq_addr; /* peer address */
  207. size_t rq_addrlen;
  208. struct sockaddr_storage rq_daddr; /* dest addr of request
  209. * - reply from here */
  210. size_t rq_daddrlen;
  211. struct svc_serv * rq_server; /* RPC service definition */
  212. struct svc_pool * rq_pool; /* thread pool */
  213. struct svc_procedure * rq_procinfo; /* procedure info */
  214. struct auth_ops * rq_authop; /* authentication flavour */
  215. struct svc_cred rq_cred; /* auth info */
  216. void * rq_xprt_ctxt; /* transport specific context ptr */
  217. struct svc_deferred_req*rq_deferred; /* deferred request we are replaying */
  218. size_t rq_xprt_hlen; /* xprt header len */
  219. struct xdr_buf rq_arg;
  220. struct xdr_buf rq_res;
  221. struct page * rq_pages[RPCSVC_MAXPAGES];
  222. struct page * *rq_respages; /* points into rq_pages */
  223. struct page * *rq_next_page; /* next reply page to use */
  224. struct page * *rq_page_end; /* one past the last page */
  225. struct kvec rq_vec[RPCSVC_MAXPAGES]; /* generally useful.. */
  226. __be32 rq_xid; /* transmission id */
  227. u32 rq_prog; /* program number */
  228. u32 rq_vers; /* program version */
  229. u32 rq_proc; /* procedure number */
  230. u32 rq_prot; /* IP protocol */
  231. int rq_cachetype; /* catering to nfsd */
  232. #define RQ_SECURE (0) /* secure port */
  233. #define RQ_LOCAL (1) /* local request */
  234. #define RQ_USEDEFERRAL (2) /* use deferral */
  235. #define RQ_DROPME (3) /* drop current reply */
  236. #define RQ_SPLICE_OK (4) /* turned off in gss privacy
  237. * to prevent encrypting page
  238. * cache pages */
  239. #define RQ_VICTIM (5) /* about to be shut down */
  240. #define RQ_BUSY (6) /* request is busy */
  241. #define RQ_DATA (7) /* request has data */
  242. unsigned long rq_flags; /* flags field */
  243. void * rq_argp; /* decoded arguments */
  244. void * rq_resp; /* xdr'd results */
  245. void * rq_auth_data; /* flavor-specific data */
  246. int rq_auth_slack; /* extra space xdr code
  247. * should leave in head
  248. * for krb5i, krb5p.
  249. */
  250. int rq_reserved; /* space on socket outq
  251. * reserved for this request
  252. */
  253. struct cache_req rq_chandle; /* handle passed to caches for
  254. * request delaying
  255. */
  256. /* Catering to nfsd */
  257. struct auth_domain * rq_client; /* RPC peer info */
  258. struct auth_domain * rq_gssclient; /* "gss/"-style peer info */
  259. struct svc_cacherep * rq_cacherep; /* cache info */
  260. struct task_struct *rq_task; /* service thread */
  261. spinlock_t rq_lock; /* per-request lock */
  262. };
  263. #define SVC_NET(svc_rqst) (svc_rqst->rq_xprt->xpt_net)
  264. /*
  265. * Rigorous type checking on sockaddr type conversions
  266. */
  267. static inline struct sockaddr_in *svc_addr_in(const struct svc_rqst *rqst)
  268. {
  269. return (struct sockaddr_in *) &rqst->rq_addr;
  270. }
  271. static inline struct sockaddr_in6 *svc_addr_in6(const struct svc_rqst *rqst)
  272. {
  273. return (struct sockaddr_in6 *) &rqst->rq_addr;
  274. }
  275. static inline struct sockaddr *svc_addr(const struct svc_rqst *rqst)
  276. {
  277. return (struct sockaddr *) &rqst->rq_addr;
  278. }
  279. static inline struct sockaddr_in *svc_daddr_in(const struct svc_rqst *rqst)
  280. {
  281. return (struct sockaddr_in *) &rqst->rq_daddr;
  282. }
  283. static inline struct sockaddr_in6 *svc_daddr_in6(const struct svc_rqst *rqst)
  284. {
  285. return (struct sockaddr_in6 *) &rqst->rq_daddr;
  286. }
  287. static inline struct sockaddr *svc_daddr(const struct svc_rqst *rqst)
  288. {
  289. return (struct sockaddr *) &rqst->rq_daddr;
  290. }
  291. /*
  292. * Check buffer bounds after decoding arguments
  293. */
  294. static inline int
  295. xdr_argsize_check(struct svc_rqst *rqstp, __be32 *p)
  296. {
  297. char *cp = (char *)p;
  298. struct kvec *vec = &rqstp->rq_arg.head[0];
  299. return cp >= (char*)vec->iov_base
  300. && cp <= (char*)vec->iov_base + vec->iov_len;
  301. }
  302. static inline int
  303. xdr_ressize_check(struct svc_rqst *rqstp, __be32 *p)
  304. {
  305. struct kvec *vec = &rqstp->rq_res.head[0];
  306. char *cp = (char*)p;
  307. vec->iov_len = cp - (char*)vec->iov_base;
  308. return vec->iov_len <= PAGE_SIZE;
  309. }
  310. static inline void svc_free_res_pages(struct svc_rqst *rqstp)
  311. {
  312. while (rqstp->rq_next_page != rqstp->rq_respages) {
  313. struct page **pp = --rqstp->rq_next_page;
  314. if (*pp) {
  315. put_page(*pp);
  316. *pp = NULL;
  317. }
  318. }
  319. }
  320. struct svc_deferred_req {
  321. u32 prot; /* protocol (UDP or TCP) */
  322. struct svc_xprt *xprt;
  323. struct sockaddr_storage addr; /* where reply must go */
  324. size_t addrlen;
  325. struct sockaddr_storage daddr; /* where reply must come from */
  326. size_t daddrlen;
  327. struct cache_deferred_req handle;
  328. size_t xprt_hlen;
  329. int argslen;
  330. __be32 args[0];
  331. };
  332. /*
  333. * List of RPC programs on the same transport endpoint
  334. */
  335. struct svc_program {
  336. struct svc_program * pg_next; /* other programs (same xprt) */
  337. u32 pg_prog; /* program number */
  338. unsigned int pg_lovers; /* lowest version */
  339. unsigned int pg_hivers; /* highest version */
  340. unsigned int pg_nvers; /* number of versions */
  341. struct svc_version ** pg_vers; /* version array */
  342. char * pg_name; /* service name */
  343. char * pg_class; /* class name: services sharing authentication */
  344. struct svc_stat * pg_stats; /* rpc statistics */
  345. int (*pg_authenticate)(struct svc_rqst *);
  346. };
  347. /*
  348. * RPC program version
  349. */
  350. struct svc_version {
  351. u32 vs_vers; /* version number */
  352. u32 vs_nproc; /* number of procedures */
  353. struct svc_procedure * vs_proc; /* per-procedure info */
  354. u32 vs_xdrsize; /* xdrsize needed for this version */
  355. unsigned int vs_hidden : 1, /* Don't register with portmapper.
  356. * Only used for nfsacl so far. */
  357. vs_rpcb_optnl:1;/* Don't care the result of register.
  358. * Only used for nfsv4. */
  359. /* Override dispatch function (e.g. when caching replies).
  360. * A return value of 0 means drop the request.
  361. * vs_dispatch == NULL means use default dispatcher.
  362. */
  363. int (*vs_dispatch)(struct svc_rqst *, __be32 *);
  364. };
  365. /*
  366. * RPC procedure info
  367. */
  368. typedef __be32 (*svc_procfunc)(struct svc_rqst *, void *argp, void *resp);
  369. struct svc_procedure {
  370. svc_procfunc pc_func; /* process the request */
  371. kxdrproc_t pc_decode; /* XDR decode args */
  372. kxdrproc_t pc_encode; /* XDR encode result */
  373. kxdrproc_t pc_release; /* XDR free result */
  374. unsigned int pc_argsize; /* argument struct size */
  375. unsigned int pc_ressize; /* result struct size */
  376. unsigned int pc_count; /* call count */
  377. unsigned int pc_cachetype; /* cache info (NFS) */
  378. unsigned int pc_xdrressize; /* maximum size of XDR reply */
  379. };
  380. /*
  381. * Mode for mapping cpus to pools.
  382. */
  383. enum {
  384. SVC_POOL_AUTO = -1, /* choose one of the others */
  385. SVC_POOL_GLOBAL, /* no mapping, just a single global pool
  386. * (legacy & UP mode) */
  387. SVC_POOL_PERCPU, /* one pool per cpu */
  388. SVC_POOL_PERNODE /* one pool per numa node */
  389. };
  390. struct svc_pool_map {
  391. int count; /* How many svc_servs use us */
  392. int mode; /* Note: int not enum to avoid
  393. * warnings about "enumeration value
  394. * not handled in switch" */
  395. unsigned int npools;
  396. unsigned int *pool_to; /* maps pool id to cpu or node */
  397. unsigned int *to_pool; /* maps cpu or node to pool id */
  398. };
  399. extern struct svc_pool_map svc_pool_map;
  400. /*
  401. * Function prototypes.
  402. */
  403. int svc_rpcb_setup(struct svc_serv *serv, struct net *net);
  404. void svc_rpcb_cleanup(struct svc_serv *serv, struct net *net);
  405. int svc_bind(struct svc_serv *serv, struct net *net);
  406. struct svc_serv *svc_create(struct svc_program *, unsigned int,
  407. struct svc_serv_ops *);
  408. struct svc_rqst *svc_rqst_alloc(struct svc_serv *serv,
  409. struct svc_pool *pool, int node);
  410. struct svc_rqst *svc_prepare_thread(struct svc_serv *serv,
  411. struct svc_pool *pool, int node);
  412. void svc_rqst_free(struct svc_rqst *);
  413. void svc_exit_thread(struct svc_rqst *);
  414. unsigned int svc_pool_map_get(void);
  415. void svc_pool_map_put(void);
  416. struct svc_serv * svc_create_pooled(struct svc_program *, unsigned int,
  417. struct svc_serv_ops *);
  418. int svc_set_num_threads(struct svc_serv *, struct svc_pool *, int);
  419. int svc_set_num_threads_sync(struct svc_serv *, struct svc_pool *, int);
  420. int svc_pool_stats_open(struct svc_serv *serv, struct file *file);
  421. void svc_destroy(struct svc_serv *);
  422. void svc_shutdown_net(struct svc_serv *, struct net *);
  423. int svc_process(struct svc_rqst *);
  424. int bc_svc_process(struct svc_serv *, struct rpc_rqst *,
  425. struct svc_rqst *);
  426. int svc_register(const struct svc_serv *, struct net *, const int,
  427. const unsigned short, const unsigned short);
  428. void svc_wake_up(struct svc_serv *);
  429. void svc_reserve(struct svc_rqst *rqstp, int space);
  430. struct svc_pool * svc_pool_for_cpu(struct svc_serv *serv, int cpu);
  431. char * svc_print_addr(struct svc_rqst *, char *, size_t);
  432. #define RPC_MAX_ADDRBUFLEN (63U)
  433. /*
  434. * When we want to reduce the size of the reserved space in the response
  435. * buffer, we need to take into account the size of any checksum data that
  436. * may be at the end of the packet. This is difficult to determine exactly
  437. * for all cases without actually generating the checksum, so we just use a
  438. * static value.
  439. */
  440. static inline void svc_reserve_auth(struct svc_rqst *rqstp, int space)
  441. {
  442. svc_reserve(rqstp, space + rqstp->rq_auth_slack);
  443. }
  444. #endif /* SUNRPC_SVC_H */