svc.c 32 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358
  1. /*
  2. * linux/net/sunrpc/svc.c
  3. *
  4. * High-level RPC service routines
  5. *
  6. * Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
  7. *
  8. * Multiple threads pools and NUMAisation
  9. * Copyright (c) 2006 Silicon Graphics, Inc.
  10. * by Greg Banks <gnb@melbourne.sgi.com>
  11. */
  12. #include <linux/linkage.h>
  13. #include <linux/sched.h>
  14. #include <linux/errno.h>
  15. #include <linux/net.h>
  16. #include <linux/in.h>
  17. #include <linux/mm.h>
  18. #include <linux/interrupt.h>
  19. #include <linux/module.h>
  20. #include <linux/kthread.h>
  21. #include <linux/slab.h>
  22. #include <linux/sunrpc/types.h>
  23. #include <linux/sunrpc/xdr.h>
  24. #include <linux/sunrpc/stats.h>
  25. #include <linux/sunrpc/svcsock.h>
  26. #include <linux/sunrpc/clnt.h>
  27. #include <linux/sunrpc/bc_xprt.h>
  28. #define RPCDBG_FACILITY RPCDBG_SVCDSP
  29. static void svc_unregister(const struct svc_serv *serv);
  30. #define svc_serv_is_pooled(serv) ((serv)->sv_function)
  31. /*
  32. * Mode for mapping cpus to pools.
  33. */
  34. enum {
  35. SVC_POOL_AUTO = -1, /* choose one of the others */
  36. SVC_POOL_GLOBAL, /* no mapping, just a single global pool
  37. * (legacy & UP mode) */
  38. SVC_POOL_PERCPU, /* one pool per cpu */
  39. SVC_POOL_PERNODE /* one pool per numa node */
  40. };
  41. #define SVC_POOL_DEFAULT SVC_POOL_GLOBAL
  42. /*
  43. * Structure for mapping cpus to pools and vice versa.
  44. * Setup once during sunrpc initialisation.
  45. */
  46. static struct svc_pool_map {
  47. int count; /* How many svc_servs use us */
  48. int mode; /* Note: int not enum to avoid
  49. * warnings about "enumeration value
  50. * not handled in switch" */
  51. unsigned int npools;
  52. unsigned int *pool_to; /* maps pool id to cpu or node */
  53. unsigned int *to_pool; /* maps cpu or node to pool id */
  54. } svc_pool_map = {
  55. .count = 0,
  56. .mode = SVC_POOL_DEFAULT
  57. };
  58. static DEFINE_MUTEX(svc_pool_map_mutex);/* protects svc_pool_map.count only */
  59. static int
  60. param_set_pool_mode(const char *val, struct kernel_param *kp)
  61. {
  62. int *ip = (int *)kp->arg;
  63. struct svc_pool_map *m = &svc_pool_map;
  64. int err;
  65. mutex_lock(&svc_pool_map_mutex);
  66. err = -EBUSY;
  67. if (m->count)
  68. goto out;
  69. err = 0;
  70. if (!strncmp(val, "auto", 4))
  71. *ip = SVC_POOL_AUTO;
  72. else if (!strncmp(val, "global", 6))
  73. *ip = SVC_POOL_GLOBAL;
  74. else if (!strncmp(val, "percpu", 6))
  75. *ip = SVC_POOL_PERCPU;
  76. else if (!strncmp(val, "pernode", 7))
  77. *ip = SVC_POOL_PERNODE;
  78. else
  79. err = -EINVAL;
  80. out:
  81. mutex_unlock(&svc_pool_map_mutex);
  82. return err;
  83. }
  84. static int
  85. param_get_pool_mode(char *buf, struct kernel_param *kp)
  86. {
  87. int *ip = (int *)kp->arg;
  88. switch (*ip)
  89. {
  90. case SVC_POOL_AUTO:
  91. return strlcpy(buf, "auto", 20);
  92. case SVC_POOL_GLOBAL:
  93. return strlcpy(buf, "global", 20);
  94. case SVC_POOL_PERCPU:
  95. return strlcpy(buf, "percpu", 20);
  96. case SVC_POOL_PERNODE:
  97. return strlcpy(buf, "pernode", 20);
  98. default:
  99. return sprintf(buf, "%d", *ip);
  100. }
  101. }
  102. module_param_call(pool_mode, param_set_pool_mode, param_get_pool_mode,
  103. &svc_pool_map.mode, 0644);
  104. /*
  105. * Detect best pool mapping mode heuristically,
  106. * according to the machine's topology.
  107. */
  108. static int
  109. svc_pool_map_choose_mode(void)
  110. {
  111. unsigned int node;
  112. if (nr_online_nodes > 1) {
  113. /*
  114. * Actually have multiple NUMA nodes,
  115. * so split pools on NUMA node boundaries
  116. */
  117. return SVC_POOL_PERNODE;
  118. }
  119. node = first_online_node;
  120. if (nr_cpus_node(node) > 2) {
  121. /*
  122. * Non-trivial SMP, or CONFIG_NUMA on
  123. * non-NUMA hardware, e.g. with a generic
  124. * x86_64 kernel on Xeons. In this case we
  125. * want to divide the pools on cpu boundaries.
  126. */
  127. return SVC_POOL_PERCPU;
  128. }
  129. /* default: one global pool */
  130. return SVC_POOL_GLOBAL;
  131. }
  132. /*
  133. * Allocate the to_pool[] and pool_to[] arrays.
  134. * Returns 0 on success or an errno.
  135. */
  136. static int
  137. svc_pool_map_alloc_arrays(struct svc_pool_map *m, unsigned int maxpools)
  138. {
  139. m->to_pool = kcalloc(maxpools, sizeof(unsigned int), GFP_KERNEL);
  140. if (!m->to_pool)
  141. goto fail;
  142. m->pool_to = kcalloc(maxpools, sizeof(unsigned int), GFP_KERNEL);
  143. if (!m->pool_to)
  144. goto fail_free;
  145. return 0;
  146. fail_free:
  147. kfree(m->to_pool);
  148. fail:
  149. return -ENOMEM;
  150. }
  151. /*
  152. * Initialise the pool map for SVC_POOL_PERCPU mode.
  153. * Returns number of pools or <0 on error.
  154. */
  155. static int
  156. svc_pool_map_init_percpu(struct svc_pool_map *m)
  157. {
  158. unsigned int maxpools = nr_cpu_ids;
  159. unsigned int pidx = 0;
  160. unsigned int cpu;
  161. int err;
  162. err = svc_pool_map_alloc_arrays(m, maxpools);
  163. if (err)
  164. return err;
  165. for_each_online_cpu(cpu) {
  166. BUG_ON(pidx > maxpools);
  167. m->to_pool[cpu] = pidx;
  168. m->pool_to[pidx] = cpu;
  169. pidx++;
  170. }
  171. /* cpus brought online later all get mapped to pool0, sorry */
  172. return pidx;
  173. };
  174. /*
  175. * Initialise the pool map for SVC_POOL_PERNODE mode.
  176. * Returns number of pools or <0 on error.
  177. */
  178. static int
  179. svc_pool_map_init_pernode(struct svc_pool_map *m)
  180. {
  181. unsigned int maxpools = nr_node_ids;
  182. unsigned int pidx = 0;
  183. unsigned int node;
  184. int err;
  185. err = svc_pool_map_alloc_arrays(m, maxpools);
  186. if (err)
  187. return err;
  188. for_each_node_with_cpus(node) {
  189. /* some architectures (e.g. SN2) have cpuless nodes */
  190. BUG_ON(pidx > maxpools);
  191. m->to_pool[node] = pidx;
  192. m->pool_to[pidx] = node;
  193. pidx++;
  194. }
  195. /* nodes brought online later all get mapped to pool0, sorry */
  196. return pidx;
  197. }
  198. /*
  199. * Add a reference to the global map of cpus to pools (and
  200. * vice versa). Initialise the map if we're the first user.
  201. * Returns the number of pools.
  202. */
  203. static unsigned int
  204. svc_pool_map_get(void)
  205. {
  206. struct svc_pool_map *m = &svc_pool_map;
  207. int npools = -1;
  208. mutex_lock(&svc_pool_map_mutex);
  209. if (m->count++) {
  210. mutex_unlock(&svc_pool_map_mutex);
  211. return m->npools;
  212. }
  213. if (m->mode == SVC_POOL_AUTO)
  214. m->mode = svc_pool_map_choose_mode();
  215. switch (m->mode) {
  216. case SVC_POOL_PERCPU:
  217. npools = svc_pool_map_init_percpu(m);
  218. break;
  219. case SVC_POOL_PERNODE:
  220. npools = svc_pool_map_init_pernode(m);
  221. break;
  222. }
  223. if (npools < 0) {
  224. /* default, or memory allocation failure */
  225. npools = 1;
  226. m->mode = SVC_POOL_GLOBAL;
  227. }
  228. m->npools = npools;
  229. mutex_unlock(&svc_pool_map_mutex);
  230. return m->npools;
  231. }
  232. /*
  233. * Drop a reference to the global map of cpus to pools.
  234. * When the last reference is dropped, the map data is
  235. * freed; this allows the sysadmin to change the pool
  236. * mode using the pool_mode module option without
  237. * rebooting or re-loading sunrpc.ko.
  238. */
  239. static void
  240. svc_pool_map_put(void)
  241. {
  242. struct svc_pool_map *m = &svc_pool_map;
  243. mutex_lock(&svc_pool_map_mutex);
  244. if (!--m->count) {
  245. m->mode = SVC_POOL_DEFAULT;
  246. kfree(m->to_pool);
  247. kfree(m->pool_to);
  248. m->npools = 0;
  249. }
  250. mutex_unlock(&svc_pool_map_mutex);
  251. }
  252. /*
  253. * Set the given thread's cpus_allowed mask so that it
  254. * will only run on cpus in the given pool.
  255. */
  256. static inline void
  257. svc_pool_map_set_cpumask(struct task_struct *task, unsigned int pidx)
  258. {
  259. struct svc_pool_map *m = &svc_pool_map;
  260. unsigned int node = m->pool_to[pidx];
  261. /*
  262. * The caller checks for sv_nrpools > 1, which
  263. * implies that we've been initialized.
  264. */
  265. BUG_ON(m->count == 0);
  266. switch (m->mode) {
  267. case SVC_POOL_PERCPU:
  268. {
  269. set_cpus_allowed_ptr(task, cpumask_of(node));
  270. break;
  271. }
  272. case SVC_POOL_PERNODE:
  273. {
  274. set_cpus_allowed_ptr(task, cpumask_of_node(node));
  275. break;
  276. }
  277. }
  278. }
  279. /*
  280. * Use the mapping mode to choose a pool for a given CPU.
  281. * Used when enqueueing an incoming RPC. Always returns
  282. * a non-NULL pool pointer.
  283. */
  284. struct svc_pool *
  285. svc_pool_for_cpu(struct svc_serv *serv, int cpu)
  286. {
  287. struct svc_pool_map *m = &svc_pool_map;
  288. unsigned int pidx = 0;
  289. /*
  290. * An uninitialised map happens in a pure client when
  291. * lockd is brought up, so silently treat it the
  292. * same as SVC_POOL_GLOBAL.
  293. */
  294. if (svc_serv_is_pooled(serv)) {
  295. switch (m->mode) {
  296. case SVC_POOL_PERCPU:
  297. pidx = m->to_pool[cpu];
  298. break;
  299. case SVC_POOL_PERNODE:
  300. pidx = m->to_pool[cpu_to_node(cpu)];
  301. break;
  302. }
  303. }
  304. return &serv->sv_pools[pidx % serv->sv_nrpools];
  305. }
  306. static int svc_rpcb_setup(struct svc_serv *serv)
  307. {
  308. int err;
  309. err = rpcb_create_local();
  310. if (err)
  311. return err;
  312. /* Remove any stale portmap registrations */
  313. svc_unregister(serv);
  314. return 0;
  315. }
  316. static void svc_rpcb_cleanup(struct svc_serv *serv)
  317. {
  318. svc_unregister(serv);
  319. rpcb_put_local();
  320. }
  321. static int svc_uses_rpcbind(struct svc_serv *serv)
  322. {
  323. struct svc_program *progp;
  324. unsigned int i;
  325. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  326. for (i = 0; i < progp->pg_nvers; i++) {
  327. if (progp->pg_vers[i] == NULL)
  328. continue;
  329. if (progp->pg_vers[i]->vs_hidden == 0)
  330. return 1;
  331. }
  332. }
  333. return 0;
  334. }
  335. /*
  336. * Create an RPC service
  337. */
  338. static struct svc_serv *
  339. __svc_create(struct svc_program *prog, unsigned int bufsize, int npools,
  340. void (*shutdown)(struct svc_serv *serv))
  341. {
  342. struct svc_serv *serv;
  343. unsigned int vers;
  344. unsigned int xdrsize;
  345. unsigned int i;
  346. if (!(serv = kzalloc(sizeof(*serv), GFP_KERNEL)))
  347. return NULL;
  348. serv->sv_name = prog->pg_name;
  349. serv->sv_program = prog;
  350. serv->sv_nrthreads = 1;
  351. serv->sv_stats = prog->pg_stats;
  352. if (bufsize > RPCSVC_MAXPAYLOAD)
  353. bufsize = RPCSVC_MAXPAYLOAD;
  354. serv->sv_max_payload = bufsize? bufsize : 4096;
  355. serv->sv_max_mesg = roundup(serv->sv_max_payload + PAGE_SIZE, PAGE_SIZE);
  356. serv->sv_shutdown = shutdown;
  357. xdrsize = 0;
  358. while (prog) {
  359. prog->pg_lovers = prog->pg_nvers-1;
  360. for (vers=0; vers<prog->pg_nvers ; vers++)
  361. if (prog->pg_vers[vers]) {
  362. prog->pg_hivers = vers;
  363. if (prog->pg_lovers > vers)
  364. prog->pg_lovers = vers;
  365. if (prog->pg_vers[vers]->vs_xdrsize > xdrsize)
  366. xdrsize = prog->pg_vers[vers]->vs_xdrsize;
  367. }
  368. prog = prog->pg_next;
  369. }
  370. serv->sv_xdrsize = xdrsize;
  371. INIT_LIST_HEAD(&serv->sv_tempsocks);
  372. INIT_LIST_HEAD(&serv->sv_permsocks);
  373. init_timer(&serv->sv_temptimer);
  374. spin_lock_init(&serv->sv_lock);
  375. serv->sv_nrpools = npools;
  376. serv->sv_pools =
  377. kcalloc(serv->sv_nrpools, sizeof(struct svc_pool),
  378. GFP_KERNEL);
  379. if (!serv->sv_pools) {
  380. kfree(serv);
  381. return NULL;
  382. }
  383. for (i = 0; i < serv->sv_nrpools; i++) {
  384. struct svc_pool *pool = &serv->sv_pools[i];
  385. dprintk("svc: initialising pool %u for %s\n",
  386. i, serv->sv_name);
  387. pool->sp_id = i;
  388. INIT_LIST_HEAD(&pool->sp_threads);
  389. INIT_LIST_HEAD(&pool->sp_sockets);
  390. INIT_LIST_HEAD(&pool->sp_all_threads);
  391. spin_lock_init(&pool->sp_lock);
  392. }
  393. if (svc_uses_rpcbind(serv)) {
  394. if (svc_rpcb_setup(serv) < 0) {
  395. kfree(serv->sv_pools);
  396. kfree(serv);
  397. return NULL;
  398. }
  399. if (!serv->sv_shutdown)
  400. serv->sv_shutdown = svc_rpcb_cleanup;
  401. }
  402. return serv;
  403. }
  404. struct svc_serv *
  405. svc_create(struct svc_program *prog, unsigned int bufsize,
  406. void (*shutdown)(struct svc_serv *serv))
  407. {
  408. return __svc_create(prog, bufsize, /*npools*/1, shutdown);
  409. }
  410. EXPORT_SYMBOL_GPL(svc_create);
  411. struct svc_serv *
  412. svc_create_pooled(struct svc_program *prog, unsigned int bufsize,
  413. void (*shutdown)(struct svc_serv *serv),
  414. svc_thread_fn func, struct module *mod)
  415. {
  416. struct svc_serv *serv;
  417. unsigned int npools = svc_pool_map_get();
  418. serv = __svc_create(prog, bufsize, npools, shutdown);
  419. if (serv != NULL) {
  420. serv->sv_function = func;
  421. serv->sv_module = mod;
  422. }
  423. return serv;
  424. }
  425. EXPORT_SYMBOL_GPL(svc_create_pooled);
  426. /*
  427. * Destroy an RPC service. Should be called with appropriate locking to
  428. * protect the sv_nrthreads, sv_permsocks and sv_tempsocks.
  429. */
  430. void
  431. svc_destroy(struct svc_serv *serv)
  432. {
  433. dprintk("svc: svc_destroy(%s, %d)\n",
  434. serv->sv_program->pg_name,
  435. serv->sv_nrthreads);
  436. if (serv->sv_nrthreads) {
  437. if (--(serv->sv_nrthreads) != 0) {
  438. svc_sock_update_bufs(serv);
  439. return;
  440. }
  441. } else
  442. printk("svc_destroy: no threads for serv=%p!\n", serv);
  443. del_timer_sync(&serv->sv_temptimer);
  444. svc_close_all(&serv->sv_tempsocks);
  445. if (serv->sv_shutdown)
  446. serv->sv_shutdown(serv);
  447. svc_close_all(&serv->sv_permsocks);
  448. BUG_ON(!list_empty(&serv->sv_permsocks));
  449. BUG_ON(!list_empty(&serv->sv_tempsocks));
  450. cache_clean_deferred(serv);
  451. if (svc_serv_is_pooled(serv))
  452. svc_pool_map_put();
  453. kfree(serv->sv_pools);
  454. kfree(serv);
  455. }
  456. EXPORT_SYMBOL_GPL(svc_destroy);
  457. /*
  458. * Allocate an RPC server's buffer space.
  459. * We allocate pages and place them in rq_argpages.
  460. */
  461. static int
  462. svc_init_buffer(struct svc_rqst *rqstp, unsigned int size)
  463. {
  464. unsigned int pages, arghi;
  465. /* bc_xprt uses fore channel allocated buffers */
  466. if (svc_is_backchannel(rqstp))
  467. return 1;
  468. pages = size / PAGE_SIZE + 1; /* extra page as we hold both request and reply.
  469. * We assume one is at most one page
  470. */
  471. arghi = 0;
  472. BUG_ON(pages > RPCSVC_MAXPAGES);
  473. while (pages) {
  474. struct page *p = alloc_page(GFP_KERNEL);
  475. if (!p)
  476. break;
  477. rqstp->rq_pages[arghi++] = p;
  478. pages--;
  479. }
  480. return pages == 0;
  481. }
  482. /*
  483. * Release an RPC server buffer
  484. */
  485. static void
  486. svc_release_buffer(struct svc_rqst *rqstp)
  487. {
  488. unsigned int i;
  489. for (i = 0; i < ARRAY_SIZE(rqstp->rq_pages); i++)
  490. if (rqstp->rq_pages[i])
  491. put_page(rqstp->rq_pages[i]);
  492. }
  493. struct svc_rqst *
  494. svc_prepare_thread(struct svc_serv *serv, struct svc_pool *pool)
  495. {
  496. struct svc_rqst *rqstp;
  497. rqstp = kzalloc(sizeof(*rqstp), GFP_KERNEL);
  498. if (!rqstp)
  499. goto out_enomem;
  500. init_waitqueue_head(&rqstp->rq_wait);
  501. serv->sv_nrthreads++;
  502. spin_lock_bh(&pool->sp_lock);
  503. pool->sp_nrthreads++;
  504. list_add(&rqstp->rq_all, &pool->sp_all_threads);
  505. spin_unlock_bh(&pool->sp_lock);
  506. rqstp->rq_server = serv;
  507. rqstp->rq_pool = pool;
  508. rqstp->rq_argp = kmalloc(serv->sv_xdrsize, GFP_KERNEL);
  509. if (!rqstp->rq_argp)
  510. goto out_thread;
  511. rqstp->rq_resp = kmalloc(serv->sv_xdrsize, GFP_KERNEL);
  512. if (!rqstp->rq_resp)
  513. goto out_thread;
  514. if (!svc_init_buffer(rqstp, serv->sv_max_mesg))
  515. goto out_thread;
  516. return rqstp;
  517. out_thread:
  518. svc_exit_thread(rqstp);
  519. out_enomem:
  520. return ERR_PTR(-ENOMEM);
  521. }
  522. EXPORT_SYMBOL_GPL(svc_prepare_thread);
  523. /*
  524. * Choose a pool in which to create a new thread, for svc_set_num_threads
  525. */
  526. static inline struct svc_pool *
  527. choose_pool(struct svc_serv *serv, struct svc_pool *pool, unsigned int *state)
  528. {
  529. if (pool != NULL)
  530. return pool;
  531. return &serv->sv_pools[(*state)++ % serv->sv_nrpools];
  532. }
  533. /*
  534. * Choose a thread to kill, for svc_set_num_threads
  535. */
  536. static inline struct task_struct *
  537. choose_victim(struct svc_serv *serv, struct svc_pool *pool, unsigned int *state)
  538. {
  539. unsigned int i;
  540. struct task_struct *task = NULL;
  541. if (pool != NULL) {
  542. spin_lock_bh(&pool->sp_lock);
  543. } else {
  544. /* choose a pool in round-robin fashion */
  545. for (i = 0; i < serv->sv_nrpools; i++) {
  546. pool = &serv->sv_pools[--(*state) % serv->sv_nrpools];
  547. spin_lock_bh(&pool->sp_lock);
  548. if (!list_empty(&pool->sp_all_threads))
  549. goto found_pool;
  550. spin_unlock_bh(&pool->sp_lock);
  551. }
  552. return NULL;
  553. }
  554. found_pool:
  555. if (!list_empty(&pool->sp_all_threads)) {
  556. struct svc_rqst *rqstp;
  557. /*
  558. * Remove from the pool->sp_all_threads list
  559. * so we don't try to kill it again.
  560. */
  561. rqstp = list_entry(pool->sp_all_threads.next, struct svc_rqst, rq_all);
  562. list_del_init(&rqstp->rq_all);
  563. task = rqstp->rq_task;
  564. }
  565. spin_unlock_bh(&pool->sp_lock);
  566. return task;
  567. }
  568. /*
  569. * Create or destroy enough new threads to make the number
  570. * of threads the given number. If `pool' is non-NULL, applies
  571. * only to threads in that pool, otherwise round-robins between
  572. * all pools. Must be called with a svc_get() reference and
  573. * the BKL or another lock to protect access to svc_serv fields.
  574. *
  575. * Destroying threads relies on the service threads filling in
  576. * rqstp->rq_task, which only the nfs ones do. Assumes the serv
  577. * has been created using svc_create_pooled().
  578. *
  579. * Based on code that used to be in nfsd_svc() but tweaked
  580. * to be pool-aware.
  581. */
  582. int
  583. svc_set_num_threads(struct svc_serv *serv, struct svc_pool *pool, int nrservs)
  584. {
  585. struct svc_rqst *rqstp;
  586. struct task_struct *task;
  587. struct svc_pool *chosen_pool;
  588. int error = 0;
  589. unsigned int state = serv->sv_nrthreads-1;
  590. if (pool == NULL) {
  591. /* The -1 assumes caller has done a svc_get() */
  592. nrservs -= (serv->sv_nrthreads-1);
  593. } else {
  594. spin_lock_bh(&pool->sp_lock);
  595. nrservs -= pool->sp_nrthreads;
  596. spin_unlock_bh(&pool->sp_lock);
  597. }
  598. /* create new threads */
  599. while (nrservs > 0) {
  600. nrservs--;
  601. chosen_pool = choose_pool(serv, pool, &state);
  602. rqstp = svc_prepare_thread(serv, chosen_pool);
  603. if (IS_ERR(rqstp)) {
  604. error = PTR_ERR(rqstp);
  605. break;
  606. }
  607. __module_get(serv->sv_module);
  608. task = kthread_create(serv->sv_function, rqstp, serv->sv_name);
  609. if (IS_ERR(task)) {
  610. error = PTR_ERR(task);
  611. module_put(serv->sv_module);
  612. svc_exit_thread(rqstp);
  613. break;
  614. }
  615. rqstp->rq_task = task;
  616. if (serv->sv_nrpools > 1)
  617. svc_pool_map_set_cpumask(task, chosen_pool->sp_id);
  618. svc_sock_update_bufs(serv);
  619. wake_up_process(task);
  620. }
  621. /* destroy old threads */
  622. while (nrservs < 0 &&
  623. (task = choose_victim(serv, pool, &state)) != NULL) {
  624. send_sig(SIGINT, task, 1);
  625. nrservs++;
  626. }
  627. return error;
  628. }
  629. EXPORT_SYMBOL_GPL(svc_set_num_threads);
  630. /*
  631. * Called from a server thread as it's exiting. Caller must hold the BKL or
  632. * the "service mutex", whichever is appropriate for the service.
  633. */
  634. void
  635. svc_exit_thread(struct svc_rqst *rqstp)
  636. {
  637. struct svc_serv *serv = rqstp->rq_server;
  638. struct svc_pool *pool = rqstp->rq_pool;
  639. svc_release_buffer(rqstp);
  640. kfree(rqstp->rq_resp);
  641. kfree(rqstp->rq_argp);
  642. kfree(rqstp->rq_auth_data);
  643. spin_lock_bh(&pool->sp_lock);
  644. pool->sp_nrthreads--;
  645. list_del(&rqstp->rq_all);
  646. spin_unlock_bh(&pool->sp_lock);
  647. kfree(rqstp);
  648. /* Release the server */
  649. if (serv)
  650. svc_destroy(serv);
  651. }
  652. EXPORT_SYMBOL_GPL(svc_exit_thread);
  653. /*
  654. * Register an "inet" protocol family netid with the local
  655. * rpcbind daemon via an rpcbind v4 SET request.
  656. *
  657. * No netconfig infrastructure is available in the kernel, so
  658. * we map IP_ protocol numbers to netids by hand.
  659. *
  660. * Returns zero on success; a negative errno value is returned
  661. * if any error occurs.
  662. */
  663. static int __svc_rpcb_register4(const u32 program, const u32 version,
  664. const unsigned short protocol,
  665. const unsigned short port)
  666. {
  667. const struct sockaddr_in sin = {
  668. .sin_family = AF_INET,
  669. .sin_addr.s_addr = htonl(INADDR_ANY),
  670. .sin_port = htons(port),
  671. };
  672. const char *netid;
  673. int error;
  674. switch (protocol) {
  675. case IPPROTO_UDP:
  676. netid = RPCBIND_NETID_UDP;
  677. break;
  678. case IPPROTO_TCP:
  679. netid = RPCBIND_NETID_TCP;
  680. break;
  681. default:
  682. return -ENOPROTOOPT;
  683. }
  684. error = rpcb_v4_register(program, version,
  685. (const struct sockaddr *)&sin, netid);
  686. /*
  687. * User space didn't support rpcbind v4, so retry this
  688. * registration request with the legacy rpcbind v2 protocol.
  689. */
  690. if (error == -EPROTONOSUPPORT)
  691. error = rpcb_register(program, version, protocol, port);
  692. return error;
  693. }
  694. #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
  695. /*
  696. * Register an "inet6" protocol family netid with the local
  697. * rpcbind daemon via an rpcbind v4 SET request.
  698. *
  699. * No netconfig infrastructure is available in the kernel, so
  700. * we map IP_ protocol numbers to netids by hand.
  701. *
  702. * Returns zero on success; a negative errno value is returned
  703. * if any error occurs.
  704. */
  705. static int __svc_rpcb_register6(const u32 program, const u32 version,
  706. const unsigned short protocol,
  707. const unsigned short port)
  708. {
  709. const struct sockaddr_in6 sin6 = {
  710. .sin6_family = AF_INET6,
  711. .sin6_addr = IN6ADDR_ANY_INIT,
  712. .sin6_port = htons(port),
  713. };
  714. const char *netid;
  715. int error;
  716. switch (protocol) {
  717. case IPPROTO_UDP:
  718. netid = RPCBIND_NETID_UDP6;
  719. break;
  720. case IPPROTO_TCP:
  721. netid = RPCBIND_NETID_TCP6;
  722. break;
  723. default:
  724. return -ENOPROTOOPT;
  725. }
  726. error = rpcb_v4_register(program, version,
  727. (const struct sockaddr *)&sin6, netid);
  728. /*
  729. * User space didn't support rpcbind version 4, so we won't
  730. * use a PF_INET6 listener.
  731. */
  732. if (error == -EPROTONOSUPPORT)
  733. error = -EAFNOSUPPORT;
  734. return error;
  735. }
  736. #endif /* defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE) */
  737. /*
  738. * Register a kernel RPC service via rpcbind version 4.
  739. *
  740. * Returns zero on success; a negative errno value is returned
  741. * if any error occurs.
  742. */
  743. static int __svc_register(const char *progname,
  744. const u32 program, const u32 version,
  745. const int family,
  746. const unsigned short protocol,
  747. const unsigned short port)
  748. {
  749. int error = -EAFNOSUPPORT;
  750. switch (family) {
  751. case PF_INET:
  752. error = __svc_rpcb_register4(program, version,
  753. protocol, port);
  754. break;
  755. #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
  756. case PF_INET6:
  757. error = __svc_rpcb_register6(program, version,
  758. protocol, port);
  759. #endif /* defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE) */
  760. }
  761. if (error < 0)
  762. printk(KERN_WARNING "svc: failed to register %sv%u RPC "
  763. "service (errno %d).\n", progname, version, -error);
  764. return error;
  765. }
  766. /**
  767. * svc_register - register an RPC service with the local portmapper
  768. * @serv: svc_serv struct for the service to register
  769. * @family: protocol family of service's listener socket
  770. * @proto: transport protocol number to advertise
  771. * @port: port to advertise
  772. *
  773. * Service is registered for any address in the passed-in protocol family
  774. */
  775. int svc_register(const struct svc_serv *serv, const int family,
  776. const unsigned short proto, const unsigned short port)
  777. {
  778. struct svc_program *progp;
  779. unsigned int i;
  780. int error = 0;
  781. BUG_ON(proto == 0 && port == 0);
  782. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  783. for (i = 0; i < progp->pg_nvers; i++) {
  784. if (progp->pg_vers[i] == NULL)
  785. continue;
  786. dprintk("svc: svc_register(%sv%d, %s, %u, %u)%s\n",
  787. progp->pg_name,
  788. i,
  789. proto == IPPROTO_UDP? "udp" : "tcp",
  790. port,
  791. family,
  792. progp->pg_vers[i]->vs_hidden?
  793. " (but not telling portmap)" : "");
  794. if (progp->pg_vers[i]->vs_hidden)
  795. continue;
  796. error = __svc_register(progp->pg_name, progp->pg_prog,
  797. i, family, proto, port);
  798. if (error < 0)
  799. break;
  800. }
  801. }
  802. return error;
  803. }
  804. /*
  805. * If user space is running rpcbind, it should take the v4 UNSET
  806. * and clear everything for this [program, version]. If user space
  807. * is running portmap, it will reject the v4 UNSET, but won't have
  808. * any "inet6" entries anyway. So a PMAP_UNSET should be sufficient
  809. * in this case to clear all existing entries for [program, version].
  810. */
  811. static void __svc_unregister(const u32 program, const u32 version,
  812. const char *progname)
  813. {
  814. int error;
  815. error = rpcb_v4_register(program, version, NULL, "");
  816. /*
  817. * User space didn't support rpcbind v4, so retry this
  818. * request with the legacy rpcbind v2 protocol.
  819. */
  820. if (error == -EPROTONOSUPPORT)
  821. error = rpcb_register(program, version, 0, 0);
  822. dprintk("svc: %s(%sv%u), error %d\n",
  823. __func__, progname, version, error);
  824. }
  825. /*
  826. * All netids, bind addresses and ports registered for [program, version]
  827. * are removed from the local rpcbind database (if the service is not
  828. * hidden) to make way for a new instance of the service.
  829. *
  830. * The result of unregistration is reported via dprintk for those who want
  831. * verification of the result, but is otherwise not important.
  832. */
  833. static void svc_unregister(const struct svc_serv *serv)
  834. {
  835. struct svc_program *progp;
  836. unsigned long flags;
  837. unsigned int i;
  838. clear_thread_flag(TIF_SIGPENDING);
  839. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  840. for (i = 0; i < progp->pg_nvers; i++) {
  841. if (progp->pg_vers[i] == NULL)
  842. continue;
  843. if (progp->pg_vers[i]->vs_hidden)
  844. continue;
  845. dprintk("svc: attempting to unregister %sv%u\n",
  846. progp->pg_name, i);
  847. __svc_unregister(progp->pg_prog, i, progp->pg_name);
  848. }
  849. }
  850. spin_lock_irqsave(&current->sighand->siglock, flags);
  851. recalc_sigpending();
  852. spin_unlock_irqrestore(&current->sighand->siglock, flags);
  853. }
  854. /*
  855. * Printk the given error with the address of the client that caused it.
  856. */
  857. static int
  858. __attribute__ ((format (printf, 2, 3)))
  859. svc_printk(struct svc_rqst *rqstp, const char *fmt, ...)
  860. {
  861. va_list args;
  862. int r;
  863. char buf[RPC_MAX_ADDRBUFLEN];
  864. if (!net_ratelimit())
  865. return 0;
  866. printk(KERN_WARNING "svc: %s: ",
  867. svc_print_addr(rqstp, buf, sizeof(buf)));
  868. va_start(args, fmt);
  869. r = vprintk(fmt, args);
  870. va_end(args);
  871. return r;
  872. }
  873. /*
  874. * Common routine for processing the RPC request.
  875. */
  876. static int
  877. svc_process_common(struct svc_rqst *rqstp, struct kvec *argv, struct kvec *resv)
  878. {
  879. struct svc_program *progp;
  880. struct svc_version *versp = NULL; /* compiler food */
  881. struct svc_procedure *procp = NULL;
  882. struct svc_serv *serv = rqstp->rq_server;
  883. kxdrproc_t xdr;
  884. __be32 *statp;
  885. u32 prog, vers, proc;
  886. __be32 auth_stat, rpc_stat;
  887. int auth_res;
  888. __be32 *reply_statp;
  889. rpc_stat = rpc_success;
  890. if (argv->iov_len < 6*4)
  891. goto err_short_len;
  892. /* Will be turned off only in gss privacy case: */
  893. rqstp->rq_splice_ok = 1;
  894. /* Will be turned off only when NFSv4 Sessions are used */
  895. rqstp->rq_usedeferral = 1;
  896. rqstp->rq_dropme = false;
  897. /* Setup reply header */
  898. rqstp->rq_xprt->xpt_ops->xpo_prep_reply_hdr(rqstp);
  899. svc_putu32(resv, rqstp->rq_xid);
  900. vers = svc_getnl(argv);
  901. /* First words of reply: */
  902. svc_putnl(resv, 1); /* REPLY */
  903. if (vers != 2) /* RPC version number */
  904. goto err_bad_rpc;
  905. /* Save position in case we later decide to reject: */
  906. reply_statp = resv->iov_base + resv->iov_len;
  907. svc_putnl(resv, 0); /* ACCEPT */
  908. rqstp->rq_prog = prog = svc_getnl(argv); /* program number */
  909. rqstp->rq_vers = vers = svc_getnl(argv); /* version number */
  910. rqstp->rq_proc = proc = svc_getnl(argv); /* procedure number */
  911. progp = serv->sv_program;
  912. for (progp = serv->sv_program; progp; progp = progp->pg_next)
  913. if (prog == progp->pg_prog)
  914. break;
  915. /*
  916. * Decode auth data, and add verifier to reply buffer.
  917. * We do this before anything else in order to get a decent
  918. * auth verifier.
  919. */
  920. auth_res = svc_authenticate(rqstp, &auth_stat);
  921. /* Also give the program a chance to reject this call: */
  922. if (auth_res == SVC_OK && progp) {
  923. auth_stat = rpc_autherr_badcred;
  924. auth_res = progp->pg_authenticate(rqstp);
  925. }
  926. switch (auth_res) {
  927. case SVC_OK:
  928. break;
  929. case SVC_GARBAGE:
  930. goto err_garbage;
  931. case SVC_SYSERR:
  932. rpc_stat = rpc_system_err;
  933. goto err_bad;
  934. case SVC_DENIED:
  935. goto err_bad_auth;
  936. case SVC_CLOSE:
  937. if (test_bit(XPT_TEMP, &rqstp->rq_xprt->xpt_flags))
  938. svc_close_xprt(rqstp->rq_xprt);
  939. case SVC_DROP:
  940. goto dropit;
  941. case SVC_COMPLETE:
  942. goto sendit;
  943. }
  944. if (progp == NULL)
  945. goto err_bad_prog;
  946. if (vers >= progp->pg_nvers ||
  947. !(versp = progp->pg_vers[vers]))
  948. goto err_bad_vers;
  949. procp = versp->vs_proc + proc;
  950. if (proc >= versp->vs_nproc || !procp->pc_func)
  951. goto err_bad_proc;
  952. rqstp->rq_procinfo = procp;
  953. /* Syntactic check complete */
  954. serv->sv_stats->rpccnt++;
  955. /* Build the reply header. */
  956. statp = resv->iov_base +resv->iov_len;
  957. svc_putnl(resv, RPC_SUCCESS);
  958. /* Bump per-procedure stats counter */
  959. procp->pc_count++;
  960. /* Initialize storage for argp and resp */
  961. memset(rqstp->rq_argp, 0, procp->pc_argsize);
  962. memset(rqstp->rq_resp, 0, procp->pc_ressize);
  963. /* un-reserve some of the out-queue now that we have a
  964. * better idea of reply size
  965. */
  966. if (procp->pc_xdrressize)
  967. svc_reserve_auth(rqstp, procp->pc_xdrressize<<2);
  968. /* Call the function that processes the request. */
  969. if (!versp->vs_dispatch) {
  970. /* Decode arguments */
  971. xdr = procp->pc_decode;
  972. if (xdr && !xdr(rqstp, argv->iov_base, rqstp->rq_argp))
  973. goto err_garbage;
  974. *statp = procp->pc_func(rqstp, rqstp->rq_argp, rqstp->rq_resp);
  975. /* Encode reply */
  976. if (rqstp->rq_dropme) {
  977. if (procp->pc_release)
  978. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  979. goto dropit;
  980. }
  981. if (*statp == rpc_success &&
  982. (xdr = procp->pc_encode) &&
  983. !xdr(rqstp, resv->iov_base+resv->iov_len, rqstp->rq_resp)) {
  984. dprintk("svc: failed to encode reply\n");
  985. /* serv->sv_stats->rpcsystemerr++; */
  986. *statp = rpc_system_err;
  987. }
  988. } else {
  989. dprintk("svc: calling dispatcher\n");
  990. if (!versp->vs_dispatch(rqstp, statp)) {
  991. /* Release reply info */
  992. if (procp->pc_release)
  993. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  994. goto dropit;
  995. }
  996. }
  997. /* Check RPC status result */
  998. if (*statp != rpc_success)
  999. resv->iov_len = ((void*)statp) - resv->iov_base + 4;
  1000. /* Release reply info */
  1001. if (procp->pc_release)
  1002. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  1003. if (procp->pc_encode == NULL)
  1004. goto dropit;
  1005. sendit:
  1006. if (svc_authorise(rqstp))
  1007. goto dropit;
  1008. return 1; /* Caller can now send it */
  1009. dropit:
  1010. svc_authorise(rqstp); /* doesn't hurt to call this twice */
  1011. dprintk("svc: svc_process dropit\n");
  1012. return 0;
  1013. err_short_len:
  1014. svc_printk(rqstp, "short len %Zd, dropping request\n",
  1015. argv->iov_len);
  1016. goto dropit; /* drop request */
  1017. err_bad_rpc:
  1018. serv->sv_stats->rpcbadfmt++;
  1019. svc_putnl(resv, 1); /* REJECT */
  1020. svc_putnl(resv, 0); /* RPC_MISMATCH */
  1021. svc_putnl(resv, 2); /* Only RPCv2 supported */
  1022. svc_putnl(resv, 2);
  1023. goto sendit;
  1024. err_bad_auth:
  1025. dprintk("svc: authentication failed (%d)\n", ntohl(auth_stat));
  1026. serv->sv_stats->rpcbadauth++;
  1027. /* Restore write pointer to location of accept status: */
  1028. xdr_ressize_check(rqstp, reply_statp);
  1029. svc_putnl(resv, 1); /* REJECT */
  1030. svc_putnl(resv, 1); /* AUTH_ERROR */
  1031. svc_putnl(resv, ntohl(auth_stat)); /* status */
  1032. goto sendit;
  1033. err_bad_prog:
  1034. dprintk("svc: unknown program %d\n", prog);
  1035. serv->sv_stats->rpcbadfmt++;
  1036. svc_putnl(resv, RPC_PROG_UNAVAIL);
  1037. goto sendit;
  1038. err_bad_vers:
  1039. svc_printk(rqstp, "unknown version (%d for prog %d, %s)\n",
  1040. vers, prog, progp->pg_name);
  1041. serv->sv_stats->rpcbadfmt++;
  1042. svc_putnl(resv, RPC_PROG_MISMATCH);
  1043. svc_putnl(resv, progp->pg_lovers);
  1044. svc_putnl(resv, progp->pg_hivers);
  1045. goto sendit;
  1046. err_bad_proc:
  1047. svc_printk(rqstp, "unknown procedure (%d)\n", proc);
  1048. serv->sv_stats->rpcbadfmt++;
  1049. svc_putnl(resv, RPC_PROC_UNAVAIL);
  1050. goto sendit;
  1051. err_garbage:
  1052. svc_printk(rqstp, "failed to decode args\n");
  1053. rpc_stat = rpc_garbage_args;
  1054. err_bad:
  1055. serv->sv_stats->rpcbadfmt++;
  1056. svc_putnl(resv, ntohl(rpc_stat));
  1057. goto sendit;
  1058. }
  1059. EXPORT_SYMBOL_GPL(svc_process);
  1060. /*
  1061. * Process the RPC request.
  1062. */
  1063. int
  1064. svc_process(struct svc_rqst *rqstp)
  1065. {
  1066. struct kvec *argv = &rqstp->rq_arg.head[0];
  1067. struct kvec *resv = &rqstp->rq_res.head[0];
  1068. struct svc_serv *serv = rqstp->rq_server;
  1069. u32 dir;
  1070. /*
  1071. * Setup response xdr_buf.
  1072. * Initially it has just one page
  1073. */
  1074. rqstp->rq_resused = 1;
  1075. resv->iov_base = page_address(rqstp->rq_respages[0]);
  1076. resv->iov_len = 0;
  1077. rqstp->rq_res.pages = rqstp->rq_respages + 1;
  1078. rqstp->rq_res.len = 0;
  1079. rqstp->rq_res.page_base = 0;
  1080. rqstp->rq_res.page_len = 0;
  1081. rqstp->rq_res.buflen = PAGE_SIZE;
  1082. rqstp->rq_res.tail[0].iov_base = NULL;
  1083. rqstp->rq_res.tail[0].iov_len = 0;
  1084. rqstp->rq_xid = svc_getu32(argv);
  1085. dir = svc_getnl(argv);
  1086. if (dir != 0) {
  1087. /* direction != CALL */
  1088. svc_printk(rqstp, "bad direction %d, dropping request\n", dir);
  1089. serv->sv_stats->rpcbadfmt++;
  1090. svc_drop(rqstp);
  1091. return 0;
  1092. }
  1093. /* Returns 1 for send, 0 for drop */
  1094. if (svc_process_common(rqstp, argv, resv))
  1095. return svc_send(rqstp);
  1096. else {
  1097. svc_drop(rqstp);
  1098. return 0;
  1099. }
  1100. }
  1101. #if defined(CONFIG_SUNRPC_BACKCHANNEL)
  1102. /*
  1103. * Process a backchannel RPC request that arrived over an existing
  1104. * outbound connection
  1105. */
  1106. int
  1107. bc_svc_process(struct svc_serv *serv, struct rpc_rqst *req,
  1108. struct svc_rqst *rqstp)
  1109. {
  1110. struct kvec *argv = &rqstp->rq_arg.head[0];
  1111. struct kvec *resv = &rqstp->rq_res.head[0];
  1112. /* Build the svc_rqst used by the common processing routine */
  1113. rqstp->rq_xprt = serv->sv_bc_xprt;
  1114. rqstp->rq_xid = req->rq_xid;
  1115. rqstp->rq_prot = req->rq_xprt->prot;
  1116. rqstp->rq_server = serv;
  1117. rqstp->rq_addrlen = sizeof(req->rq_xprt->addr);
  1118. memcpy(&rqstp->rq_addr, &req->rq_xprt->addr, rqstp->rq_addrlen);
  1119. memcpy(&rqstp->rq_arg, &req->rq_rcv_buf, sizeof(rqstp->rq_arg));
  1120. memcpy(&rqstp->rq_res, &req->rq_snd_buf, sizeof(rqstp->rq_res));
  1121. /* reset result send buffer "put" position */
  1122. resv->iov_len = 0;
  1123. if (rqstp->rq_prot != IPPROTO_TCP) {
  1124. printk(KERN_ERR "No support for Non-TCP transports!\n");
  1125. BUG();
  1126. }
  1127. /*
  1128. * Skip the next two words because they've already been
  1129. * processed in the trasport
  1130. */
  1131. svc_getu32(argv); /* XID */
  1132. svc_getnl(argv); /* CALLDIR */
  1133. /* Returns 1 for send, 0 for drop */
  1134. if (svc_process_common(rqstp, argv, resv)) {
  1135. memcpy(&req->rq_snd_buf, &rqstp->rq_res,
  1136. sizeof(req->rq_snd_buf));
  1137. return bc_send(req);
  1138. } else {
  1139. /* Nothing to do to drop request */
  1140. return 0;
  1141. }
  1142. }
  1143. EXPORT_SYMBOL_GPL(bc_svc_process);
  1144. #endif /* CONFIG_SUNRPC_BACKCHANNEL */
  1145. /*
  1146. * Return (transport-specific) limit on the rpc payload.
  1147. */
  1148. u32 svc_max_payload(const struct svc_rqst *rqstp)
  1149. {
  1150. u32 max = rqstp->rq_xprt->xpt_class->xcl_max_payload;
  1151. if (rqstp->rq_server->sv_max_payload < max)
  1152. max = rqstp->rq_server->sv_max_payload;
  1153. return max;
  1154. }
  1155. EXPORT_SYMBOL_GPL(svc_max_payload);