svc.c 32 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373
  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. static int svc_pool_map_get_node(unsigned int pidx)
  253. {
  254. const struct svc_pool_map *m = &svc_pool_map;
  255. if (m->count) {
  256. if (m->mode == SVC_POOL_PERCPU)
  257. return cpu_to_node(m->pool_to[pidx]);
  258. if (m->mode == SVC_POOL_PERNODE)
  259. return m->pool_to[pidx];
  260. }
  261. return NUMA_NO_NODE;
  262. }
  263. /*
  264. * Set the given thread's cpus_allowed mask so that it
  265. * will only run on cpus in the given pool.
  266. */
  267. static inline void
  268. svc_pool_map_set_cpumask(struct task_struct *task, unsigned int pidx)
  269. {
  270. struct svc_pool_map *m = &svc_pool_map;
  271. unsigned int node = m->pool_to[pidx];
  272. /*
  273. * The caller checks for sv_nrpools > 1, which
  274. * implies that we've been initialized.
  275. */
  276. BUG_ON(m->count == 0);
  277. switch (m->mode) {
  278. case SVC_POOL_PERCPU:
  279. {
  280. set_cpus_allowed_ptr(task, cpumask_of(node));
  281. break;
  282. }
  283. case SVC_POOL_PERNODE:
  284. {
  285. set_cpus_allowed_ptr(task, cpumask_of_node(node));
  286. break;
  287. }
  288. }
  289. }
  290. /*
  291. * Use the mapping mode to choose a pool for a given CPU.
  292. * Used when enqueueing an incoming RPC. Always returns
  293. * a non-NULL pool pointer.
  294. */
  295. struct svc_pool *
  296. svc_pool_for_cpu(struct svc_serv *serv, int cpu)
  297. {
  298. struct svc_pool_map *m = &svc_pool_map;
  299. unsigned int pidx = 0;
  300. /*
  301. * An uninitialised map happens in a pure client when
  302. * lockd is brought up, so silently treat it the
  303. * same as SVC_POOL_GLOBAL.
  304. */
  305. if (svc_serv_is_pooled(serv)) {
  306. switch (m->mode) {
  307. case SVC_POOL_PERCPU:
  308. pidx = m->to_pool[cpu];
  309. break;
  310. case SVC_POOL_PERNODE:
  311. pidx = m->to_pool[cpu_to_node(cpu)];
  312. break;
  313. }
  314. }
  315. return &serv->sv_pools[pidx % serv->sv_nrpools];
  316. }
  317. static int svc_rpcb_setup(struct svc_serv *serv)
  318. {
  319. int err;
  320. err = rpcb_create_local();
  321. if (err)
  322. return err;
  323. /* Remove any stale portmap registrations */
  324. svc_unregister(serv);
  325. return 0;
  326. }
  327. void svc_rpcb_cleanup(struct svc_serv *serv)
  328. {
  329. svc_unregister(serv);
  330. rpcb_put_local();
  331. }
  332. EXPORT_SYMBOL_GPL(svc_rpcb_cleanup);
  333. static int svc_uses_rpcbind(struct svc_serv *serv)
  334. {
  335. struct svc_program *progp;
  336. unsigned int i;
  337. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  338. for (i = 0; i < progp->pg_nvers; i++) {
  339. if (progp->pg_vers[i] == NULL)
  340. continue;
  341. if (progp->pg_vers[i]->vs_hidden == 0)
  342. return 1;
  343. }
  344. }
  345. return 0;
  346. }
  347. /*
  348. * Create an RPC service
  349. */
  350. static struct svc_serv *
  351. __svc_create(struct svc_program *prog, unsigned int bufsize, int npools,
  352. void (*shutdown)(struct svc_serv *serv))
  353. {
  354. struct svc_serv *serv;
  355. unsigned int vers;
  356. unsigned int xdrsize;
  357. unsigned int i;
  358. if (!(serv = kzalloc(sizeof(*serv), GFP_KERNEL)))
  359. return NULL;
  360. serv->sv_name = prog->pg_name;
  361. serv->sv_program = prog;
  362. serv->sv_nrthreads = 1;
  363. serv->sv_stats = prog->pg_stats;
  364. if (bufsize > RPCSVC_MAXPAYLOAD)
  365. bufsize = RPCSVC_MAXPAYLOAD;
  366. serv->sv_max_payload = bufsize? bufsize : 4096;
  367. serv->sv_max_mesg = roundup(serv->sv_max_payload + PAGE_SIZE, PAGE_SIZE);
  368. serv->sv_shutdown = shutdown;
  369. xdrsize = 0;
  370. while (prog) {
  371. prog->pg_lovers = prog->pg_nvers-1;
  372. for (vers=0; vers<prog->pg_nvers ; vers++)
  373. if (prog->pg_vers[vers]) {
  374. prog->pg_hivers = vers;
  375. if (prog->pg_lovers > vers)
  376. prog->pg_lovers = vers;
  377. if (prog->pg_vers[vers]->vs_xdrsize > xdrsize)
  378. xdrsize = prog->pg_vers[vers]->vs_xdrsize;
  379. }
  380. prog = prog->pg_next;
  381. }
  382. serv->sv_xdrsize = xdrsize;
  383. INIT_LIST_HEAD(&serv->sv_tempsocks);
  384. INIT_LIST_HEAD(&serv->sv_permsocks);
  385. init_timer(&serv->sv_temptimer);
  386. spin_lock_init(&serv->sv_lock);
  387. serv->sv_nrpools = npools;
  388. serv->sv_pools =
  389. kcalloc(serv->sv_nrpools, sizeof(struct svc_pool),
  390. GFP_KERNEL);
  391. if (!serv->sv_pools) {
  392. kfree(serv);
  393. return NULL;
  394. }
  395. for (i = 0; i < serv->sv_nrpools; i++) {
  396. struct svc_pool *pool = &serv->sv_pools[i];
  397. dprintk("svc: initialising pool %u for %s\n",
  398. i, serv->sv_name);
  399. pool->sp_id = i;
  400. INIT_LIST_HEAD(&pool->sp_threads);
  401. INIT_LIST_HEAD(&pool->sp_sockets);
  402. INIT_LIST_HEAD(&pool->sp_all_threads);
  403. spin_lock_init(&pool->sp_lock);
  404. }
  405. if (svc_uses_rpcbind(serv)) {
  406. if (svc_rpcb_setup(serv) < 0) {
  407. kfree(serv->sv_pools);
  408. kfree(serv);
  409. return NULL;
  410. }
  411. if (!serv->sv_shutdown)
  412. serv->sv_shutdown = svc_rpcb_cleanup;
  413. }
  414. return serv;
  415. }
  416. struct svc_serv *
  417. svc_create(struct svc_program *prog, unsigned int bufsize,
  418. void (*shutdown)(struct svc_serv *serv))
  419. {
  420. return __svc_create(prog, bufsize, /*npools*/1, shutdown);
  421. }
  422. EXPORT_SYMBOL_GPL(svc_create);
  423. struct svc_serv *
  424. svc_create_pooled(struct svc_program *prog, unsigned int bufsize,
  425. void (*shutdown)(struct svc_serv *serv),
  426. svc_thread_fn func, struct module *mod)
  427. {
  428. struct svc_serv *serv;
  429. unsigned int npools = svc_pool_map_get();
  430. serv = __svc_create(prog, bufsize, npools, shutdown);
  431. if (serv != NULL) {
  432. serv->sv_function = func;
  433. serv->sv_module = mod;
  434. }
  435. return serv;
  436. }
  437. EXPORT_SYMBOL_GPL(svc_create_pooled);
  438. /*
  439. * Destroy an RPC service. Should be called with appropriate locking to
  440. * protect the sv_nrthreads, sv_permsocks and sv_tempsocks.
  441. */
  442. void
  443. svc_destroy(struct svc_serv *serv)
  444. {
  445. dprintk("svc: svc_destroy(%s, %d)\n",
  446. serv->sv_program->pg_name,
  447. serv->sv_nrthreads);
  448. if (serv->sv_nrthreads) {
  449. if (--(serv->sv_nrthreads) != 0) {
  450. svc_sock_update_bufs(serv);
  451. return;
  452. }
  453. } else
  454. printk("svc_destroy: no threads for serv=%p!\n", serv);
  455. del_timer_sync(&serv->sv_temptimer);
  456. svc_close_all(&serv->sv_tempsocks);
  457. if (serv->sv_shutdown)
  458. serv->sv_shutdown(serv);
  459. svc_close_all(&serv->sv_permsocks);
  460. BUG_ON(!list_empty(&serv->sv_permsocks));
  461. BUG_ON(!list_empty(&serv->sv_tempsocks));
  462. cache_clean_deferred(serv);
  463. if (svc_serv_is_pooled(serv))
  464. svc_pool_map_put();
  465. kfree(serv->sv_pools);
  466. kfree(serv);
  467. }
  468. EXPORT_SYMBOL_GPL(svc_destroy);
  469. /*
  470. * Allocate an RPC server's buffer space.
  471. * We allocate pages and place them in rq_argpages.
  472. */
  473. static int
  474. svc_init_buffer(struct svc_rqst *rqstp, unsigned int size, int node)
  475. {
  476. unsigned int pages, arghi;
  477. /* bc_xprt uses fore channel allocated buffers */
  478. if (svc_is_backchannel(rqstp))
  479. return 1;
  480. pages = size / PAGE_SIZE + 1; /* extra page as we hold both request and reply.
  481. * We assume one is at most one page
  482. */
  483. arghi = 0;
  484. BUG_ON(pages > RPCSVC_MAXPAGES);
  485. while (pages) {
  486. struct page *p = alloc_pages_node(node, GFP_KERNEL, 0);
  487. if (!p)
  488. break;
  489. rqstp->rq_pages[arghi++] = p;
  490. pages--;
  491. }
  492. return pages == 0;
  493. }
  494. /*
  495. * Release an RPC server buffer
  496. */
  497. static void
  498. svc_release_buffer(struct svc_rqst *rqstp)
  499. {
  500. unsigned int i;
  501. for (i = 0; i < ARRAY_SIZE(rqstp->rq_pages); i++)
  502. if (rqstp->rq_pages[i])
  503. put_page(rqstp->rq_pages[i]);
  504. }
  505. struct svc_rqst *
  506. svc_prepare_thread(struct svc_serv *serv, struct svc_pool *pool, int node)
  507. {
  508. struct svc_rqst *rqstp;
  509. rqstp = kzalloc_node(sizeof(*rqstp), GFP_KERNEL, node);
  510. if (!rqstp)
  511. goto out_enomem;
  512. init_waitqueue_head(&rqstp->rq_wait);
  513. serv->sv_nrthreads++;
  514. spin_lock_bh(&pool->sp_lock);
  515. pool->sp_nrthreads++;
  516. list_add(&rqstp->rq_all, &pool->sp_all_threads);
  517. spin_unlock_bh(&pool->sp_lock);
  518. rqstp->rq_server = serv;
  519. rqstp->rq_pool = pool;
  520. rqstp->rq_argp = kmalloc_node(serv->sv_xdrsize, GFP_KERNEL, node);
  521. if (!rqstp->rq_argp)
  522. goto out_thread;
  523. rqstp->rq_resp = kmalloc_node(serv->sv_xdrsize, GFP_KERNEL, node);
  524. if (!rqstp->rq_resp)
  525. goto out_thread;
  526. if (!svc_init_buffer(rqstp, serv->sv_max_mesg, node))
  527. goto out_thread;
  528. return rqstp;
  529. out_thread:
  530. svc_exit_thread(rqstp);
  531. out_enomem:
  532. return ERR_PTR(-ENOMEM);
  533. }
  534. EXPORT_SYMBOL_GPL(svc_prepare_thread);
  535. /*
  536. * Choose a pool in which to create a new thread, for svc_set_num_threads
  537. */
  538. static inline struct svc_pool *
  539. choose_pool(struct svc_serv *serv, struct svc_pool *pool, unsigned int *state)
  540. {
  541. if (pool != NULL)
  542. return pool;
  543. return &serv->sv_pools[(*state)++ % serv->sv_nrpools];
  544. }
  545. /*
  546. * Choose a thread to kill, for svc_set_num_threads
  547. */
  548. static inline struct task_struct *
  549. choose_victim(struct svc_serv *serv, struct svc_pool *pool, unsigned int *state)
  550. {
  551. unsigned int i;
  552. struct task_struct *task = NULL;
  553. if (pool != NULL) {
  554. spin_lock_bh(&pool->sp_lock);
  555. } else {
  556. /* choose a pool in round-robin fashion */
  557. for (i = 0; i < serv->sv_nrpools; i++) {
  558. pool = &serv->sv_pools[--(*state) % serv->sv_nrpools];
  559. spin_lock_bh(&pool->sp_lock);
  560. if (!list_empty(&pool->sp_all_threads))
  561. goto found_pool;
  562. spin_unlock_bh(&pool->sp_lock);
  563. }
  564. return NULL;
  565. }
  566. found_pool:
  567. if (!list_empty(&pool->sp_all_threads)) {
  568. struct svc_rqst *rqstp;
  569. /*
  570. * Remove from the pool->sp_all_threads list
  571. * so we don't try to kill it again.
  572. */
  573. rqstp = list_entry(pool->sp_all_threads.next, struct svc_rqst, rq_all);
  574. list_del_init(&rqstp->rq_all);
  575. task = rqstp->rq_task;
  576. }
  577. spin_unlock_bh(&pool->sp_lock);
  578. return task;
  579. }
  580. /*
  581. * Create or destroy enough new threads to make the number
  582. * of threads the given number. If `pool' is non-NULL, applies
  583. * only to threads in that pool, otherwise round-robins between
  584. * all pools. Must be called with a svc_get() reference and
  585. * the BKL or another lock to protect access to svc_serv fields.
  586. *
  587. * Destroying threads relies on the service threads filling in
  588. * rqstp->rq_task, which only the nfs ones do. Assumes the serv
  589. * has been created using svc_create_pooled().
  590. *
  591. * Based on code that used to be in nfsd_svc() but tweaked
  592. * to be pool-aware.
  593. */
  594. int
  595. svc_set_num_threads(struct svc_serv *serv, struct svc_pool *pool, int nrservs)
  596. {
  597. struct svc_rqst *rqstp;
  598. struct task_struct *task;
  599. struct svc_pool *chosen_pool;
  600. int error = 0;
  601. unsigned int state = serv->sv_nrthreads-1;
  602. int node;
  603. if (pool == NULL) {
  604. /* The -1 assumes caller has done a svc_get() */
  605. nrservs -= (serv->sv_nrthreads-1);
  606. } else {
  607. spin_lock_bh(&pool->sp_lock);
  608. nrservs -= pool->sp_nrthreads;
  609. spin_unlock_bh(&pool->sp_lock);
  610. }
  611. /* create new threads */
  612. while (nrservs > 0) {
  613. nrservs--;
  614. chosen_pool = choose_pool(serv, pool, &state);
  615. node = svc_pool_map_get_node(chosen_pool->sp_id);
  616. rqstp = svc_prepare_thread(serv, chosen_pool, node);
  617. if (IS_ERR(rqstp)) {
  618. error = PTR_ERR(rqstp);
  619. break;
  620. }
  621. __module_get(serv->sv_module);
  622. task = kthread_create_on_node(serv->sv_function, rqstp,
  623. node, serv->sv_name);
  624. if (IS_ERR(task)) {
  625. error = PTR_ERR(task);
  626. module_put(serv->sv_module);
  627. svc_exit_thread(rqstp);
  628. break;
  629. }
  630. rqstp->rq_task = task;
  631. if (serv->sv_nrpools > 1)
  632. svc_pool_map_set_cpumask(task, chosen_pool->sp_id);
  633. svc_sock_update_bufs(serv);
  634. wake_up_process(task);
  635. }
  636. /* destroy old threads */
  637. while (nrservs < 0 &&
  638. (task = choose_victim(serv, pool, &state)) != NULL) {
  639. send_sig(SIGINT, task, 1);
  640. nrservs++;
  641. }
  642. return error;
  643. }
  644. EXPORT_SYMBOL_GPL(svc_set_num_threads);
  645. /*
  646. * Called from a server thread as it's exiting. Caller must hold the BKL or
  647. * the "service mutex", whichever is appropriate for the service.
  648. */
  649. void
  650. svc_exit_thread(struct svc_rqst *rqstp)
  651. {
  652. struct svc_serv *serv = rqstp->rq_server;
  653. struct svc_pool *pool = rqstp->rq_pool;
  654. svc_release_buffer(rqstp);
  655. kfree(rqstp->rq_resp);
  656. kfree(rqstp->rq_argp);
  657. kfree(rqstp->rq_auth_data);
  658. spin_lock_bh(&pool->sp_lock);
  659. pool->sp_nrthreads--;
  660. list_del(&rqstp->rq_all);
  661. spin_unlock_bh(&pool->sp_lock);
  662. kfree(rqstp);
  663. /* Release the server */
  664. if (serv)
  665. svc_destroy(serv);
  666. }
  667. EXPORT_SYMBOL_GPL(svc_exit_thread);
  668. /*
  669. * Register an "inet" protocol family netid with the local
  670. * rpcbind daemon via an rpcbind v4 SET request.
  671. *
  672. * No netconfig infrastructure is available in the kernel, so
  673. * we map IP_ protocol numbers to netids by hand.
  674. *
  675. * Returns zero on success; a negative errno value is returned
  676. * if any error occurs.
  677. */
  678. static int __svc_rpcb_register4(const u32 program, const u32 version,
  679. const unsigned short protocol,
  680. const unsigned short port)
  681. {
  682. const struct sockaddr_in sin = {
  683. .sin_family = AF_INET,
  684. .sin_addr.s_addr = htonl(INADDR_ANY),
  685. .sin_port = htons(port),
  686. };
  687. const char *netid;
  688. int error;
  689. switch (protocol) {
  690. case IPPROTO_UDP:
  691. netid = RPCBIND_NETID_UDP;
  692. break;
  693. case IPPROTO_TCP:
  694. netid = RPCBIND_NETID_TCP;
  695. break;
  696. default:
  697. return -ENOPROTOOPT;
  698. }
  699. error = rpcb_v4_register(program, version,
  700. (const struct sockaddr *)&sin, netid);
  701. /*
  702. * User space didn't support rpcbind v4, so retry this
  703. * registration request with the legacy rpcbind v2 protocol.
  704. */
  705. if (error == -EPROTONOSUPPORT)
  706. error = rpcb_register(program, version, protocol, port);
  707. return error;
  708. }
  709. #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
  710. /*
  711. * Register an "inet6" protocol family netid with the local
  712. * rpcbind daemon via an rpcbind v4 SET request.
  713. *
  714. * No netconfig infrastructure is available in the kernel, so
  715. * we map IP_ protocol numbers to netids by hand.
  716. *
  717. * Returns zero on success; a negative errno value is returned
  718. * if any error occurs.
  719. */
  720. static int __svc_rpcb_register6(const u32 program, const u32 version,
  721. const unsigned short protocol,
  722. const unsigned short port)
  723. {
  724. const struct sockaddr_in6 sin6 = {
  725. .sin6_family = AF_INET6,
  726. .sin6_addr = IN6ADDR_ANY_INIT,
  727. .sin6_port = htons(port),
  728. };
  729. const char *netid;
  730. int error;
  731. switch (protocol) {
  732. case IPPROTO_UDP:
  733. netid = RPCBIND_NETID_UDP6;
  734. break;
  735. case IPPROTO_TCP:
  736. netid = RPCBIND_NETID_TCP6;
  737. break;
  738. default:
  739. return -ENOPROTOOPT;
  740. }
  741. error = rpcb_v4_register(program, version,
  742. (const struct sockaddr *)&sin6, netid);
  743. /*
  744. * User space didn't support rpcbind version 4, so we won't
  745. * use a PF_INET6 listener.
  746. */
  747. if (error == -EPROTONOSUPPORT)
  748. error = -EAFNOSUPPORT;
  749. return error;
  750. }
  751. #endif /* defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE) */
  752. /*
  753. * Register a kernel RPC service via rpcbind version 4.
  754. *
  755. * Returns zero on success; a negative errno value is returned
  756. * if any error occurs.
  757. */
  758. static int __svc_register(const char *progname,
  759. const u32 program, const u32 version,
  760. const int family,
  761. const unsigned short protocol,
  762. const unsigned short port)
  763. {
  764. int error = -EAFNOSUPPORT;
  765. switch (family) {
  766. case PF_INET:
  767. error = __svc_rpcb_register4(program, version,
  768. protocol, port);
  769. break;
  770. #if defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE)
  771. case PF_INET6:
  772. error = __svc_rpcb_register6(program, version,
  773. protocol, port);
  774. #endif /* defined(CONFIG_IPV6) || defined(CONFIG_IPV6_MODULE) */
  775. }
  776. if (error < 0)
  777. printk(KERN_WARNING "svc: failed to register %sv%u RPC "
  778. "service (errno %d).\n", progname, version, -error);
  779. return error;
  780. }
  781. /**
  782. * svc_register - register an RPC service with the local portmapper
  783. * @serv: svc_serv struct for the service to register
  784. * @family: protocol family of service's listener socket
  785. * @proto: transport protocol number to advertise
  786. * @port: port to advertise
  787. *
  788. * Service is registered for any address in the passed-in protocol family
  789. */
  790. int svc_register(const struct svc_serv *serv, const int family,
  791. const unsigned short proto, const unsigned short port)
  792. {
  793. struct svc_program *progp;
  794. unsigned int i;
  795. int error = 0;
  796. BUG_ON(proto == 0 && port == 0);
  797. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  798. for (i = 0; i < progp->pg_nvers; i++) {
  799. if (progp->pg_vers[i] == NULL)
  800. continue;
  801. dprintk("svc: svc_register(%sv%d, %s, %u, %u)%s\n",
  802. progp->pg_name,
  803. i,
  804. proto == IPPROTO_UDP? "udp" : "tcp",
  805. port,
  806. family,
  807. progp->pg_vers[i]->vs_hidden?
  808. " (but not telling portmap)" : "");
  809. if (progp->pg_vers[i]->vs_hidden)
  810. continue;
  811. error = __svc_register(progp->pg_name, progp->pg_prog,
  812. i, family, proto, port);
  813. if (error < 0)
  814. break;
  815. }
  816. }
  817. return error;
  818. }
  819. /*
  820. * If user space is running rpcbind, it should take the v4 UNSET
  821. * and clear everything for this [program, version]. If user space
  822. * is running portmap, it will reject the v4 UNSET, but won't have
  823. * any "inet6" entries anyway. So a PMAP_UNSET should be sufficient
  824. * in this case to clear all existing entries for [program, version].
  825. */
  826. static void __svc_unregister(const u32 program, const u32 version,
  827. const char *progname)
  828. {
  829. int error;
  830. error = rpcb_v4_register(program, version, NULL, "");
  831. /*
  832. * User space didn't support rpcbind v4, so retry this
  833. * request with the legacy rpcbind v2 protocol.
  834. */
  835. if (error == -EPROTONOSUPPORT)
  836. error = rpcb_register(program, version, 0, 0);
  837. dprintk("svc: %s(%sv%u), error %d\n",
  838. __func__, progname, version, error);
  839. }
  840. /*
  841. * All netids, bind addresses and ports registered for [program, version]
  842. * are removed from the local rpcbind database (if the service is not
  843. * hidden) to make way for a new instance of the service.
  844. *
  845. * The result of unregistration is reported via dprintk for those who want
  846. * verification of the result, but is otherwise not important.
  847. */
  848. static void svc_unregister(const struct svc_serv *serv)
  849. {
  850. struct svc_program *progp;
  851. unsigned long flags;
  852. unsigned int i;
  853. clear_thread_flag(TIF_SIGPENDING);
  854. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  855. for (i = 0; i < progp->pg_nvers; i++) {
  856. if (progp->pg_vers[i] == NULL)
  857. continue;
  858. if (progp->pg_vers[i]->vs_hidden)
  859. continue;
  860. dprintk("svc: attempting to unregister %sv%u\n",
  861. progp->pg_name, i);
  862. __svc_unregister(progp->pg_prog, i, progp->pg_name);
  863. }
  864. }
  865. spin_lock_irqsave(&current->sighand->siglock, flags);
  866. recalc_sigpending();
  867. spin_unlock_irqrestore(&current->sighand->siglock, flags);
  868. }
  869. /*
  870. * Printk the given error with the address of the client that caused it.
  871. */
  872. static __printf(2, 3)
  873. int svc_printk(struct svc_rqst *rqstp, const char *fmt, ...)
  874. {
  875. va_list args;
  876. int r;
  877. char buf[RPC_MAX_ADDRBUFLEN];
  878. if (!net_ratelimit())
  879. return 0;
  880. printk(KERN_WARNING "svc: %s: ",
  881. svc_print_addr(rqstp, buf, sizeof(buf)));
  882. va_start(args, fmt);
  883. r = vprintk(fmt, args);
  884. va_end(args);
  885. return r;
  886. }
  887. /*
  888. * Common routine for processing the RPC request.
  889. */
  890. static int
  891. svc_process_common(struct svc_rqst *rqstp, struct kvec *argv, struct kvec *resv)
  892. {
  893. struct svc_program *progp;
  894. struct svc_version *versp = NULL; /* compiler food */
  895. struct svc_procedure *procp = NULL;
  896. struct svc_serv *serv = rqstp->rq_server;
  897. kxdrproc_t xdr;
  898. __be32 *statp;
  899. u32 prog, vers, proc;
  900. __be32 auth_stat, rpc_stat;
  901. int auth_res;
  902. __be32 *reply_statp;
  903. rpc_stat = rpc_success;
  904. if (argv->iov_len < 6*4)
  905. goto err_short_len;
  906. /* Will be turned off only in gss privacy case: */
  907. rqstp->rq_splice_ok = 1;
  908. /* Will be turned off only when NFSv4 Sessions are used */
  909. rqstp->rq_usedeferral = 1;
  910. rqstp->rq_dropme = false;
  911. /* Setup reply header */
  912. rqstp->rq_xprt->xpt_ops->xpo_prep_reply_hdr(rqstp);
  913. svc_putu32(resv, rqstp->rq_xid);
  914. vers = svc_getnl(argv);
  915. /* First words of reply: */
  916. svc_putnl(resv, 1); /* REPLY */
  917. if (vers != 2) /* RPC version number */
  918. goto err_bad_rpc;
  919. /* Save position in case we later decide to reject: */
  920. reply_statp = resv->iov_base + resv->iov_len;
  921. svc_putnl(resv, 0); /* ACCEPT */
  922. rqstp->rq_prog = prog = svc_getnl(argv); /* program number */
  923. rqstp->rq_vers = vers = svc_getnl(argv); /* version number */
  924. rqstp->rq_proc = proc = svc_getnl(argv); /* procedure number */
  925. progp = serv->sv_program;
  926. for (progp = serv->sv_program; progp; progp = progp->pg_next)
  927. if (prog == progp->pg_prog)
  928. break;
  929. /*
  930. * Decode auth data, and add verifier to reply buffer.
  931. * We do this before anything else in order to get a decent
  932. * auth verifier.
  933. */
  934. auth_res = svc_authenticate(rqstp, &auth_stat);
  935. /* Also give the program a chance to reject this call: */
  936. if (auth_res == SVC_OK && progp) {
  937. auth_stat = rpc_autherr_badcred;
  938. auth_res = progp->pg_authenticate(rqstp);
  939. }
  940. switch (auth_res) {
  941. case SVC_OK:
  942. break;
  943. case SVC_GARBAGE:
  944. goto err_garbage;
  945. case SVC_SYSERR:
  946. rpc_stat = rpc_system_err;
  947. goto err_bad;
  948. case SVC_DENIED:
  949. goto err_bad_auth;
  950. case SVC_CLOSE:
  951. if (test_bit(XPT_TEMP, &rqstp->rq_xprt->xpt_flags))
  952. svc_close_xprt(rqstp->rq_xprt);
  953. case SVC_DROP:
  954. goto dropit;
  955. case SVC_COMPLETE:
  956. goto sendit;
  957. }
  958. if (progp == NULL)
  959. goto err_bad_prog;
  960. if (vers >= progp->pg_nvers ||
  961. !(versp = progp->pg_vers[vers]))
  962. goto err_bad_vers;
  963. procp = versp->vs_proc + proc;
  964. if (proc >= versp->vs_nproc || !procp->pc_func)
  965. goto err_bad_proc;
  966. rqstp->rq_procinfo = procp;
  967. /* Syntactic check complete */
  968. serv->sv_stats->rpccnt++;
  969. /* Build the reply header. */
  970. statp = resv->iov_base +resv->iov_len;
  971. svc_putnl(resv, RPC_SUCCESS);
  972. /* Bump per-procedure stats counter */
  973. procp->pc_count++;
  974. /* Initialize storage for argp and resp */
  975. memset(rqstp->rq_argp, 0, procp->pc_argsize);
  976. memset(rqstp->rq_resp, 0, procp->pc_ressize);
  977. /* un-reserve some of the out-queue now that we have a
  978. * better idea of reply size
  979. */
  980. if (procp->pc_xdrressize)
  981. svc_reserve_auth(rqstp, procp->pc_xdrressize<<2);
  982. /* Call the function that processes the request. */
  983. if (!versp->vs_dispatch) {
  984. /* Decode arguments */
  985. xdr = procp->pc_decode;
  986. if (xdr && !xdr(rqstp, argv->iov_base, rqstp->rq_argp))
  987. goto err_garbage;
  988. *statp = procp->pc_func(rqstp, rqstp->rq_argp, rqstp->rq_resp);
  989. /* Encode reply */
  990. if (rqstp->rq_dropme) {
  991. if (procp->pc_release)
  992. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  993. goto dropit;
  994. }
  995. if (*statp == rpc_success &&
  996. (xdr = procp->pc_encode) &&
  997. !xdr(rqstp, resv->iov_base+resv->iov_len, rqstp->rq_resp)) {
  998. dprintk("svc: failed to encode reply\n");
  999. /* serv->sv_stats->rpcsystemerr++; */
  1000. *statp = rpc_system_err;
  1001. }
  1002. } else {
  1003. dprintk("svc: calling dispatcher\n");
  1004. if (!versp->vs_dispatch(rqstp, statp)) {
  1005. /* Release reply info */
  1006. if (procp->pc_release)
  1007. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  1008. goto dropit;
  1009. }
  1010. }
  1011. /* Check RPC status result */
  1012. if (*statp != rpc_success)
  1013. resv->iov_len = ((void*)statp) - resv->iov_base + 4;
  1014. /* Release reply info */
  1015. if (procp->pc_release)
  1016. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  1017. if (procp->pc_encode == NULL)
  1018. goto dropit;
  1019. sendit:
  1020. if (svc_authorise(rqstp))
  1021. goto dropit;
  1022. return 1; /* Caller can now send it */
  1023. dropit:
  1024. svc_authorise(rqstp); /* doesn't hurt to call this twice */
  1025. dprintk("svc: svc_process dropit\n");
  1026. return 0;
  1027. err_short_len:
  1028. svc_printk(rqstp, "short len %Zd, dropping request\n",
  1029. argv->iov_len);
  1030. goto dropit; /* drop request */
  1031. err_bad_rpc:
  1032. serv->sv_stats->rpcbadfmt++;
  1033. svc_putnl(resv, 1); /* REJECT */
  1034. svc_putnl(resv, 0); /* RPC_MISMATCH */
  1035. svc_putnl(resv, 2); /* Only RPCv2 supported */
  1036. svc_putnl(resv, 2);
  1037. goto sendit;
  1038. err_bad_auth:
  1039. dprintk("svc: authentication failed (%d)\n", ntohl(auth_stat));
  1040. serv->sv_stats->rpcbadauth++;
  1041. /* Restore write pointer to location of accept status: */
  1042. xdr_ressize_check(rqstp, reply_statp);
  1043. svc_putnl(resv, 1); /* REJECT */
  1044. svc_putnl(resv, 1); /* AUTH_ERROR */
  1045. svc_putnl(resv, ntohl(auth_stat)); /* status */
  1046. goto sendit;
  1047. err_bad_prog:
  1048. dprintk("svc: unknown program %d\n", prog);
  1049. serv->sv_stats->rpcbadfmt++;
  1050. svc_putnl(resv, RPC_PROG_UNAVAIL);
  1051. goto sendit;
  1052. err_bad_vers:
  1053. svc_printk(rqstp, "unknown version (%d for prog %d, %s)\n",
  1054. vers, prog, progp->pg_name);
  1055. serv->sv_stats->rpcbadfmt++;
  1056. svc_putnl(resv, RPC_PROG_MISMATCH);
  1057. svc_putnl(resv, progp->pg_lovers);
  1058. svc_putnl(resv, progp->pg_hivers);
  1059. goto sendit;
  1060. err_bad_proc:
  1061. svc_printk(rqstp, "unknown procedure (%d)\n", proc);
  1062. serv->sv_stats->rpcbadfmt++;
  1063. svc_putnl(resv, RPC_PROC_UNAVAIL);
  1064. goto sendit;
  1065. err_garbage:
  1066. svc_printk(rqstp, "failed to decode args\n");
  1067. rpc_stat = rpc_garbage_args;
  1068. err_bad:
  1069. serv->sv_stats->rpcbadfmt++;
  1070. svc_putnl(resv, ntohl(rpc_stat));
  1071. goto sendit;
  1072. }
  1073. EXPORT_SYMBOL_GPL(svc_process);
  1074. /*
  1075. * Process the RPC request.
  1076. */
  1077. int
  1078. svc_process(struct svc_rqst *rqstp)
  1079. {
  1080. struct kvec *argv = &rqstp->rq_arg.head[0];
  1081. struct kvec *resv = &rqstp->rq_res.head[0];
  1082. struct svc_serv *serv = rqstp->rq_server;
  1083. u32 dir;
  1084. /*
  1085. * Setup response xdr_buf.
  1086. * Initially it has just one page
  1087. */
  1088. rqstp->rq_resused = 1;
  1089. resv->iov_base = page_address(rqstp->rq_respages[0]);
  1090. resv->iov_len = 0;
  1091. rqstp->rq_res.pages = rqstp->rq_respages + 1;
  1092. rqstp->rq_res.len = 0;
  1093. rqstp->rq_res.page_base = 0;
  1094. rqstp->rq_res.page_len = 0;
  1095. rqstp->rq_res.buflen = PAGE_SIZE;
  1096. rqstp->rq_res.tail[0].iov_base = NULL;
  1097. rqstp->rq_res.tail[0].iov_len = 0;
  1098. rqstp->rq_xid = svc_getu32(argv);
  1099. dir = svc_getnl(argv);
  1100. if (dir != 0) {
  1101. /* direction != CALL */
  1102. svc_printk(rqstp, "bad direction %d, dropping request\n", dir);
  1103. serv->sv_stats->rpcbadfmt++;
  1104. svc_drop(rqstp);
  1105. return 0;
  1106. }
  1107. /* Returns 1 for send, 0 for drop */
  1108. if (svc_process_common(rqstp, argv, resv))
  1109. return svc_send(rqstp);
  1110. else {
  1111. svc_drop(rqstp);
  1112. return 0;
  1113. }
  1114. }
  1115. #if defined(CONFIG_SUNRPC_BACKCHANNEL)
  1116. /*
  1117. * Process a backchannel RPC request that arrived over an existing
  1118. * outbound connection
  1119. */
  1120. int
  1121. bc_svc_process(struct svc_serv *serv, struct rpc_rqst *req,
  1122. struct svc_rqst *rqstp)
  1123. {
  1124. struct kvec *argv = &rqstp->rq_arg.head[0];
  1125. struct kvec *resv = &rqstp->rq_res.head[0];
  1126. /* Build the svc_rqst used by the common processing routine */
  1127. rqstp->rq_xprt = serv->sv_bc_xprt;
  1128. rqstp->rq_xid = req->rq_xid;
  1129. rqstp->rq_prot = req->rq_xprt->prot;
  1130. rqstp->rq_server = serv;
  1131. rqstp->rq_addrlen = sizeof(req->rq_xprt->addr);
  1132. memcpy(&rqstp->rq_addr, &req->rq_xprt->addr, rqstp->rq_addrlen);
  1133. memcpy(&rqstp->rq_arg, &req->rq_rcv_buf, sizeof(rqstp->rq_arg));
  1134. memcpy(&rqstp->rq_res, &req->rq_snd_buf, sizeof(rqstp->rq_res));
  1135. /* reset result send buffer "put" position */
  1136. resv->iov_len = 0;
  1137. if (rqstp->rq_prot != IPPROTO_TCP) {
  1138. printk(KERN_ERR "No support for Non-TCP transports!\n");
  1139. BUG();
  1140. }
  1141. /*
  1142. * Skip the next two words because they've already been
  1143. * processed in the trasport
  1144. */
  1145. svc_getu32(argv); /* XID */
  1146. svc_getnl(argv); /* CALLDIR */
  1147. /* Returns 1 for send, 0 for drop */
  1148. if (svc_process_common(rqstp, argv, resv)) {
  1149. memcpy(&req->rq_snd_buf, &rqstp->rq_res,
  1150. sizeof(req->rq_snd_buf));
  1151. return bc_send(req);
  1152. } else {
  1153. /* Nothing to do to drop request */
  1154. return 0;
  1155. }
  1156. }
  1157. EXPORT_SYMBOL_GPL(bc_svc_process);
  1158. #endif /* CONFIG_SUNRPC_BACKCHANNEL */
  1159. /*
  1160. * Return (transport-specific) limit on the rpc payload.
  1161. */
  1162. u32 svc_max_payload(const struct svc_rqst *rqstp)
  1163. {
  1164. u32 max = rqstp->rq_xprt->xpt_class->xcl_max_payload;
  1165. if (rqstp->rq_server->sv_max_payload < max)
  1166. max = rqstp->rq_server->sv_max_payload;
  1167. return max;
  1168. }
  1169. EXPORT_SYMBOL_GPL(svc_max_payload);