svc.h 16 KB

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