svc.c 32 KB

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