svc.c 38 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628
  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/signal.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. #include <trace/events/sunrpc.h>
  29. #define RPCDBG_FACILITY RPCDBG_SVCDSP
  30. static void svc_unregister(const struct svc_serv *serv, struct net *net);
  31. #define svc_serv_is_pooled(serv) ((serv)->sv_ops->svo_function)
  32. #define SVC_POOL_DEFAULT SVC_POOL_GLOBAL
  33. /*
  34. * Structure for mapping cpus to pools and vice versa.
  35. * Setup once during sunrpc initialisation.
  36. */
  37. struct svc_pool_map svc_pool_map = {
  38. .mode = SVC_POOL_DEFAULT
  39. };
  40. EXPORT_SYMBOL_GPL(svc_pool_map);
  41. static DEFINE_MUTEX(svc_pool_map_mutex);/* protects svc_pool_map.count only */
  42. static int
  43. param_set_pool_mode(const char *val, const struct kernel_param *kp)
  44. {
  45. int *ip = (int *)kp->arg;
  46. struct svc_pool_map *m = &svc_pool_map;
  47. int err;
  48. mutex_lock(&svc_pool_map_mutex);
  49. err = -EBUSY;
  50. if (m->count)
  51. goto out;
  52. err = 0;
  53. if (!strncmp(val, "auto", 4))
  54. *ip = SVC_POOL_AUTO;
  55. else if (!strncmp(val, "global", 6))
  56. *ip = SVC_POOL_GLOBAL;
  57. else if (!strncmp(val, "percpu", 6))
  58. *ip = SVC_POOL_PERCPU;
  59. else if (!strncmp(val, "pernode", 7))
  60. *ip = SVC_POOL_PERNODE;
  61. else
  62. err = -EINVAL;
  63. out:
  64. mutex_unlock(&svc_pool_map_mutex);
  65. return err;
  66. }
  67. static int
  68. param_get_pool_mode(char *buf, const struct kernel_param *kp)
  69. {
  70. int *ip = (int *)kp->arg;
  71. switch (*ip)
  72. {
  73. case SVC_POOL_AUTO:
  74. return strlcpy(buf, "auto", 20);
  75. case SVC_POOL_GLOBAL:
  76. return strlcpy(buf, "global", 20);
  77. case SVC_POOL_PERCPU:
  78. return strlcpy(buf, "percpu", 20);
  79. case SVC_POOL_PERNODE:
  80. return strlcpy(buf, "pernode", 20);
  81. default:
  82. return sprintf(buf, "%d", *ip);
  83. }
  84. }
  85. module_param_call(pool_mode, param_set_pool_mode, param_get_pool_mode,
  86. &svc_pool_map.mode, 0644);
  87. /*
  88. * Detect best pool mapping mode heuristically,
  89. * according to the machine's topology.
  90. */
  91. static int
  92. svc_pool_map_choose_mode(void)
  93. {
  94. unsigned int node;
  95. if (nr_online_nodes > 1) {
  96. /*
  97. * Actually have multiple NUMA nodes,
  98. * so split pools on NUMA node boundaries
  99. */
  100. return SVC_POOL_PERNODE;
  101. }
  102. node = first_online_node;
  103. if (nr_cpus_node(node) > 2) {
  104. /*
  105. * Non-trivial SMP, or CONFIG_NUMA on
  106. * non-NUMA hardware, e.g. with a generic
  107. * x86_64 kernel on Xeons. In this case we
  108. * want to divide the pools on cpu boundaries.
  109. */
  110. return SVC_POOL_PERCPU;
  111. }
  112. /* default: one global pool */
  113. return SVC_POOL_GLOBAL;
  114. }
  115. /*
  116. * Allocate the to_pool[] and pool_to[] arrays.
  117. * Returns 0 on success or an errno.
  118. */
  119. static int
  120. svc_pool_map_alloc_arrays(struct svc_pool_map *m, unsigned int maxpools)
  121. {
  122. m->to_pool = kcalloc(maxpools, sizeof(unsigned int), GFP_KERNEL);
  123. if (!m->to_pool)
  124. goto fail;
  125. m->pool_to = kcalloc(maxpools, sizeof(unsigned int), GFP_KERNEL);
  126. if (!m->pool_to)
  127. goto fail_free;
  128. return 0;
  129. fail_free:
  130. kfree(m->to_pool);
  131. m->to_pool = NULL;
  132. fail:
  133. return -ENOMEM;
  134. }
  135. /*
  136. * Initialise the pool map for SVC_POOL_PERCPU mode.
  137. * Returns number of pools or <0 on error.
  138. */
  139. static int
  140. svc_pool_map_init_percpu(struct svc_pool_map *m)
  141. {
  142. unsigned int maxpools = nr_cpu_ids;
  143. unsigned int pidx = 0;
  144. unsigned int cpu;
  145. int err;
  146. err = svc_pool_map_alloc_arrays(m, maxpools);
  147. if (err)
  148. return err;
  149. for_each_online_cpu(cpu) {
  150. BUG_ON(pidx >= maxpools);
  151. m->to_pool[cpu] = pidx;
  152. m->pool_to[pidx] = cpu;
  153. pidx++;
  154. }
  155. /* cpus brought online later all get mapped to pool0, sorry */
  156. return pidx;
  157. };
  158. /*
  159. * Initialise the pool map for SVC_POOL_PERNODE mode.
  160. * Returns number of pools or <0 on error.
  161. */
  162. static int
  163. svc_pool_map_init_pernode(struct svc_pool_map *m)
  164. {
  165. unsigned int maxpools = nr_node_ids;
  166. unsigned int pidx = 0;
  167. unsigned int node;
  168. int err;
  169. err = svc_pool_map_alloc_arrays(m, maxpools);
  170. if (err)
  171. return err;
  172. for_each_node_with_cpus(node) {
  173. /* some architectures (e.g. SN2) have cpuless nodes */
  174. BUG_ON(pidx > maxpools);
  175. m->to_pool[node] = pidx;
  176. m->pool_to[pidx] = node;
  177. pidx++;
  178. }
  179. /* nodes brought online later all get mapped to pool0, sorry */
  180. return pidx;
  181. }
  182. /*
  183. * Add a reference to the global map of cpus to pools (and
  184. * vice versa). Initialise the map if we're the first user.
  185. * Returns the number of pools.
  186. */
  187. unsigned int
  188. svc_pool_map_get(void)
  189. {
  190. struct svc_pool_map *m = &svc_pool_map;
  191. int npools = -1;
  192. mutex_lock(&svc_pool_map_mutex);
  193. if (m->count++) {
  194. mutex_unlock(&svc_pool_map_mutex);
  195. return m->npools;
  196. }
  197. if (m->mode == SVC_POOL_AUTO)
  198. m->mode = svc_pool_map_choose_mode();
  199. switch (m->mode) {
  200. case SVC_POOL_PERCPU:
  201. npools = svc_pool_map_init_percpu(m);
  202. break;
  203. case SVC_POOL_PERNODE:
  204. npools = svc_pool_map_init_pernode(m);
  205. break;
  206. }
  207. if (npools < 0) {
  208. /* default, or memory allocation failure */
  209. npools = 1;
  210. m->mode = SVC_POOL_GLOBAL;
  211. }
  212. m->npools = npools;
  213. mutex_unlock(&svc_pool_map_mutex);
  214. return m->npools;
  215. }
  216. EXPORT_SYMBOL_GPL(svc_pool_map_get);
  217. /*
  218. * Drop a reference to the global map of cpus to pools.
  219. * When the last reference is dropped, the map data is
  220. * freed; this allows the sysadmin to change the pool
  221. * mode using the pool_mode module option without
  222. * rebooting or re-loading sunrpc.ko.
  223. */
  224. void
  225. svc_pool_map_put(void)
  226. {
  227. struct svc_pool_map *m = &svc_pool_map;
  228. mutex_lock(&svc_pool_map_mutex);
  229. if (!--m->count) {
  230. kfree(m->to_pool);
  231. m->to_pool = NULL;
  232. kfree(m->pool_to);
  233. m->pool_to = NULL;
  234. m->npools = 0;
  235. }
  236. mutex_unlock(&svc_pool_map_mutex);
  237. }
  238. EXPORT_SYMBOL_GPL(svc_pool_map_put);
  239. static int svc_pool_map_get_node(unsigned int pidx)
  240. {
  241. const struct svc_pool_map *m = &svc_pool_map;
  242. if (m->count) {
  243. if (m->mode == SVC_POOL_PERCPU)
  244. return cpu_to_node(m->pool_to[pidx]);
  245. if (m->mode == SVC_POOL_PERNODE)
  246. return m->pool_to[pidx];
  247. }
  248. return NUMA_NO_NODE;
  249. }
  250. /*
  251. * Set the given thread's cpus_allowed mask so that it
  252. * will only run on cpus in the given pool.
  253. */
  254. static inline void
  255. svc_pool_map_set_cpumask(struct task_struct *task, unsigned int pidx)
  256. {
  257. struct svc_pool_map *m = &svc_pool_map;
  258. unsigned int node = m->pool_to[pidx];
  259. /*
  260. * The caller checks for sv_nrpools > 1, which
  261. * implies that we've been initialized.
  262. */
  263. WARN_ON_ONCE(m->count == 0);
  264. if (m->count == 0)
  265. return;
  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. int svc_rpcb_setup(struct svc_serv *serv, struct net *net)
  307. {
  308. int err;
  309. err = rpcb_create_local(net);
  310. if (err)
  311. return err;
  312. /* Remove any stale portmap registrations */
  313. svc_unregister(serv, net);
  314. return 0;
  315. }
  316. EXPORT_SYMBOL_GPL(svc_rpcb_setup);
  317. void svc_rpcb_cleanup(struct svc_serv *serv, struct net *net)
  318. {
  319. svc_unregister(serv, net);
  320. rpcb_put_local(net);
  321. }
  322. EXPORT_SYMBOL_GPL(svc_rpcb_cleanup);
  323. static int svc_uses_rpcbind(struct svc_serv *serv)
  324. {
  325. struct svc_program *progp;
  326. unsigned int i;
  327. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  328. for (i = 0; i < progp->pg_nvers; i++) {
  329. if (progp->pg_vers[i] == NULL)
  330. continue;
  331. if (!progp->pg_vers[i]->vs_hidden)
  332. return 1;
  333. }
  334. }
  335. return 0;
  336. }
  337. int svc_bind(struct svc_serv *serv, struct net *net)
  338. {
  339. if (!svc_uses_rpcbind(serv))
  340. return 0;
  341. return svc_rpcb_setup(serv, net);
  342. }
  343. EXPORT_SYMBOL_GPL(svc_bind);
  344. #if defined(CONFIG_SUNRPC_BACKCHANNEL)
  345. static void
  346. __svc_init_bc(struct svc_serv *serv)
  347. {
  348. INIT_LIST_HEAD(&serv->sv_cb_list);
  349. spin_lock_init(&serv->sv_cb_lock);
  350. init_waitqueue_head(&serv->sv_cb_waitq);
  351. }
  352. #else
  353. static void
  354. __svc_init_bc(struct svc_serv *serv)
  355. {
  356. }
  357. #endif
  358. /*
  359. * Create an RPC service
  360. */
  361. static struct svc_serv *
  362. __svc_create(struct svc_program *prog, unsigned int bufsize, int npools,
  363. const struct svc_serv_ops *ops)
  364. {
  365. struct svc_serv *serv;
  366. unsigned int vers;
  367. unsigned int xdrsize;
  368. unsigned int i;
  369. if (!(serv = kzalloc(sizeof(*serv), GFP_KERNEL)))
  370. return NULL;
  371. serv->sv_name = prog->pg_name;
  372. serv->sv_program = prog;
  373. serv->sv_nrthreads = 1;
  374. serv->sv_stats = prog->pg_stats;
  375. if (bufsize > RPCSVC_MAXPAYLOAD)
  376. bufsize = RPCSVC_MAXPAYLOAD;
  377. serv->sv_max_payload = bufsize? bufsize : 4096;
  378. serv->sv_max_mesg = roundup(serv->sv_max_payload + PAGE_SIZE, PAGE_SIZE);
  379. serv->sv_ops = ops;
  380. xdrsize = 0;
  381. while (prog) {
  382. prog->pg_lovers = prog->pg_nvers-1;
  383. for (vers=0; vers<prog->pg_nvers ; vers++)
  384. if (prog->pg_vers[vers]) {
  385. prog->pg_hivers = vers;
  386. if (prog->pg_lovers > vers)
  387. prog->pg_lovers = vers;
  388. if (prog->pg_vers[vers]->vs_xdrsize > xdrsize)
  389. xdrsize = prog->pg_vers[vers]->vs_xdrsize;
  390. }
  391. prog = prog->pg_next;
  392. }
  393. serv->sv_xdrsize = xdrsize;
  394. INIT_LIST_HEAD(&serv->sv_tempsocks);
  395. INIT_LIST_HEAD(&serv->sv_permsocks);
  396. timer_setup(&serv->sv_temptimer, NULL, 0);
  397. spin_lock_init(&serv->sv_lock);
  398. __svc_init_bc(serv);
  399. serv->sv_nrpools = npools;
  400. serv->sv_pools =
  401. kcalloc(serv->sv_nrpools, sizeof(struct svc_pool),
  402. GFP_KERNEL);
  403. if (!serv->sv_pools) {
  404. kfree(serv);
  405. return NULL;
  406. }
  407. for (i = 0; i < serv->sv_nrpools; i++) {
  408. struct svc_pool *pool = &serv->sv_pools[i];
  409. dprintk("svc: initialising pool %u for %s\n",
  410. i, serv->sv_name);
  411. pool->sp_id = i;
  412. INIT_LIST_HEAD(&pool->sp_sockets);
  413. INIT_LIST_HEAD(&pool->sp_all_threads);
  414. spin_lock_init(&pool->sp_lock);
  415. }
  416. return serv;
  417. }
  418. struct svc_serv *
  419. svc_create(struct svc_program *prog, unsigned int bufsize,
  420. const struct svc_serv_ops *ops)
  421. {
  422. return __svc_create(prog, bufsize, /*npools*/1, ops);
  423. }
  424. EXPORT_SYMBOL_GPL(svc_create);
  425. struct svc_serv *
  426. svc_create_pooled(struct svc_program *prog, unsigned int bufsize,
  427. const struct svc_serv_ops *ops)
  428. {
  429. struct svc_serv *serv;
  430. unsigned int npools = svc_pool_map_get();
  431. serv = __svc_create(prog, bufsize, npools, ops);
  432. if (!serv)
  433. goto out_err;
  434. return serv;
  435. out_err:
  436. svc_pool_map_put();
  437. return NULL;
  438. }
  439. EXPORT_SYMBOL_GPL(svc_create_pooled);
  440. void svc_shutdown_net(struct svc_serv *serv, struct net *net)
  441. {
  442. svc_close_net(serv, net);
  443. if (serv->sv_ops->svo_shutdown)
  444. serv->sv_ops->svo_shutdown(serv, net);
  445. }
  446. EXPORT_SYMBOL_GPL(svc_shutdown_net);
  447. /*
  448. * Destroy an RPC service. Should be called with appropriate locking to
  449. * protect the sv_nrthreads, sv_permsocks and sv_tempsocks.
  450. */
  451. void
  452. svc_destroy(struct svc_serv *serv)
  453. {
  454. dprintk("svc: svc_destroy(%s, %d)\n",
  455. serv->sv_program->pg_name,
  456. serv->sv_nrthreads);
  457. if (serv->sv_nrthreads) {
  458. if (--(serv->sv_nrthreads) != 0) {
  459. svc_sock_update_bufs(serv);
  460. return;
  461. }
  462. } else
  463. printk("svc_destroy: no threads for serv=%p!\n", serv);
  464. del_timer_sync(&serv->sv_temptimer);
  465. /*
  466. * The last user is gone and thus all sockets have to be destroyed to
  467. * the point. Check this.
  468. */
  469. BUG_ON(!list_empty(&serv->sv_permsocks));
  470. BUG_ON(!list_empty(&serv->sv_tempsocks));
  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. WARN_ON_ONCE(pages > RPCSVC_MAXPAGES);
  494. if (pages > RPCSVC_MAXPAGES)
  495. pages = RPCSVC_MAXPAGES;
  496. while (pages) {
  497. struct page *p = alloc_pages_node(node, GFP_KERNEL, 0);
  498. if (!p)
  499. break;
  500. rqstp->rq_pages[arghi++] = p;
  501. pages--;
  502. }
  503. return pages == 0;
  504. }
  505. /*
  506. * Release an RPC server buffer
  507. */
  508. static void
  509. svc_release_buffer(struct svc_rqst *rqstp)
  510. {
  511. unsigned int i;
  512. for (i = 0; i < ARRAY_SIZE(rqstp->rq_pages); i++)
  513. if (rqstp->rq_pages[i])
  514. put_page(rqstp->rq_pages[i]);
  515. }
  516. struct svc_rqst *
  517. svc_rqst_alloc(struct svc_serv *serv, struct svc_pool *pool, int node)
  518. {
  519. struct svc_rqst *rqstp;
  520. rqstp = kzalloc_node(sizeof(*rqstp), GFP_KERNEL, node);
  521. if (!rqstp)
  522. return rqstp;
  523. __set_bit(RQ_BUSY, &rqstp->rq_flags);
  524. spin_lock_init(&rqstp->rq_lock);
  525. rqstp->rq_server = serv;
  526. rqstp->rq_pool = pool;
  527. rqstp->rq_argp = kmalloc_node(serv->sv_xdrsize, GFP_KERNEL, node);
  528. if (!rqstp->rq_argp)
  529. goto out_enomem;
  530. rqstp->rq_resp = kmalloc_node(serv->sv_xdrsize, GFP_KERNEL, node);
  531. if (!rqstp->rq_resp)
  532. goto out_enomem;
  533. if (!svc_init_buffer(rqstp, serv->sv_max_mesg, node))
  534. goto out_enomem;
  535. return rqstp;
  536. out_enomem:
  537. svc_rqst_free(rqstp);
  538. return NULL;
  539. }
  540. EXPORT_SYMBOL_GPL(svc_rqst_alloc);
  541. struct svc_rqst *
  542. svc_prepare_thread(struct svc_serv *serv, struct svc_pool *pool, int node)
  543. {
  544. struct svc_rqst *rqstp;
  545. rqstp = svc_rqst_alloc(serv, pool, node);
  546. if (!rqstp)
  547. return ERR_PTR(-ENOMEM);
  548. serv->sv_nrthreads++;
  549. spin_lock_bh(&pool->sp_lock);
  550. pool->sp_nrthreads++;
  551. list_add_rcu(&rqstp->rq_all, &pool->sp_all_threads);
  552. spin_unlock_bh(&pool->sp_lock);
  553. return rqstp;
  554. }
  555. EXPORT_SYMBOL_GPL(svc_prepare_thread);
  556. /*
  557. * Choose a pool in which to create a new thread, for svc_set_num_threads
  558. */
  559. static inline struct svc_pool *
  560. choose_pool(struct svc_serv *serv, struct svc_pool *pool, unsigned int *state)
  561. {
  562. if (pool != NULL)
  563. return pool;
  564. return &serv->sv_pools[(*state)++ % serv->sv_nrpools];
  565. }
  566. /*
  567. * Choose a thread to kill, for svc_set_num_threads
  568. */
  569. static inline struct task_struct *
  570. choose_victim(struct svc_serv *serv, struct svc_pool *pool, unsigned int *state)
  571. {
  572. unsigned int i;
  573. struct task_struct *task = NULL;
  574. if (pool != NULL) {
  575. spin_lock_bh(&pool->sp_lock);
  576. } else {
  577. /* choose a pool in round-robin fashion */
  578. for (i = 0; i < serv->sv_nrpools; i++) {
  579. pool = &serv->sv_pools[--(*state) % serv->sv_nrpools];
  580. spin_lock_bh(&pool->sp_lock);
  581. if (!list_empty(&pool->sp_all_threads))
  582. goto found_pool;
  583. spin_unlock_bh(&pool->sp_lock);
  584. }
  585. return NULL;
  586. }
  587. found_pool:
  588. if (!list_empty(&pool->sp_all_threads)) {
  589. struct svc_rqst *rqstp;
  590. /*
  591. * Remove from the pool->sp_all_threads list
  592. * so we don't try to kill it again.
  593. */
  594. rqstp = list_entry(pool->sp_all_threads.next, struct svc_rqst, rq_all);
  595. set_bit(RQ_VICTIM, &rqstp->rq_flags);
  596. list_del_rcu(&rqstp->rq_all);
  597. task = rqstp->rq_task;
  598. }
  599. spin_unlock_bh(&pool->sp_lock);
  600. return task;
  601. }
  602. /* create new threads */
  603. static int
  604. svc_start_kthreads(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. unsigned int state = serv->sv_nrthreads-1;
  610. int node;
  611. do {
  612. nrservs--;
  613. chosen_pool = choose_pool(serv, pool, &state);
  614. node = svc_pool_map_get_node(chosen_pool->sp_id);
  615. rqstp = svc_prepare_thread(serv, chosen_pool, node);
  616. if (IS_ERR(rqstp))
  617. return PTR_ERR(rqstp);
  618. __module_get(serv->sv_ops->svo_module);
  619. task = kthread_create_on_node(serv->sv_ops->svo_function, rqstp,
  620. node, "%s", serv->sv_name);
  621. if (IS_ERR(task)) {
  622. module_put(serv->sv_ops->svo_module);
  623. svc_exit_thread(rqstp);
  624. return PTR_ERR(task);
  625. }
  626. rqstp->rq_task = task;
  627. if (serv->sv_nrpools > 1)
  628. svc_pool_map_set_cpumask(task, chosen_pool->sp_id);
  629. svc_sock_update_bufs(serv);
  630. wake_up_process(task);
  631. } while (nrservs > 0);
  632. return 0;
  633. }
  634. /* destroy old threads */
  635. static int
  636. svc_signal_kthreads(struct svc_serv *serv, struct svc_pool *pool, int nrservs)
  637. {
  638. struct task_struct *task;
  639. unsigned int state = serv->sv_nrthreads-1;
  640. /* destroy old threads */
  641. do {
  642. task = choose_victim(serv, pool, &state);
  643. if (task == NULL)
  644. break;
  645. send_sig(SIGINT, task, 1);
  646. nrservs++;
  647. } while (nrservs < 0);
  648. return 0;
  649. }
  650. /*
  651. * Create or destroy enough new threads to make the number
  652. * of threads the given number. If `pool' is non-NULL, applies
  653. * only to threads in that pool, otherwise round-robins between
  654. * all pools. Caller must ensure that mutual exclusion between this and
  655. * server startup or shutdown.
  656. *
  657. * Destroying threads relies on the service threads filling in
  658. * rqstp->rq_task, which only the nfs ones do. Assumes the serv
  659. * has been created using svc_create_pooled().
  660. *
  661. * Based on code that used to be in nfsd_svc() but tweaked
  662. * to be pool-aware.
  663. */
  664. int
  665. svc_set_num_threads(struct svc_serv *serv, struct svc_pool *pool, int nrservs)
  666. {
  667. if (pool == NULL) {
  668. /* The -1 assumes caller has done a svc_get() */
  669. nrservs -= (serv->sv_nrthreads-1);
  670. } else {
  671. spin_lock_bh(&pool->sp_lock);
  672. nrservs -= pool->sp_nrthreads;
  673. spin_unlock_bh(&pool->sp_lock);
  674. }
  675. if (nrservs > 0)
  676. return svc_start_kthreads(serv, pool, nrservs);
  677. if (nrservs < 0)
  678. return svc_signal_kthreads(serv, pool, nrservs);
  679. return 0;
  680. }
  681. EXPORT_SYMBOL_GPL(svc_set_num_threads);
  682. /* destroy old threads */
  683. static int
  684. svc_stop_kthreads(struct svc_serv *serv, struct svc_pool *pool, int nrservs)
  685. {
  686. struct task_struct *task;
  687. unsigned int state = serv->sv_nrthreads-1;
  688. /* destroy old threads */
  689. do {
  690. task = choose_victim(serv, pool, &state);
  691. if (task == NULL)
  692. break;
  693. kthread_stop(task);
  694. nrservs++;
  695. } while (nrservs < 0);
  696. return 0;
  697. }
  698. int
  699. svc_set_num_threads_sync(struct svc_serv *serv, struct svc_pool *pool, int nrservs)
  700. {
  701. if (pool == NULL) {
  702. /* The -1 assumes caller has done a svc_get() */
  703. nrservs -= (serv->sv_nrthreads-1);
  704. } else {
  705. spin_lock_bh(&pool->sp_lock);
  706. nrservs -= pool->sp_nrthreads;
  707. spin_unlock_bh(&pool->sp_lock);
  708. }
  709. if (nrservs > 0)
  710. return svc_start_kthreads(serv, pool, nrservs);
  711. if (nrservs < 0)
  712. return svc_stop_kthreads(serv, pool, nrservs);
  713. return 0;
  714. }
  715. EXPORT_SYMBOL_GPL(svc_set_num_threads_sync);
  716. /*
  717. * Called from a server thread as it's exiting. Caller must hold the "service
  718. * mutex" for the service.
  719. */
  720. void
  721. svc_rqst_free(struct svc_rqst *rqstp)
  722. {
  723. svc_release_buffer(rqstp);
  724. kfree(rqstp->rq_resp);
  725. kfree(rqstp->rq_argp);
  726. kfree(rqstp->rq_auth_data);
  727. kfree_rcu(rqstp, rq_rcu_head);
  728. }
  729. EXPORT_SYMBOL_GPL(svc_rqst_free);
  730. void
  731. svc_exit_thread(struct svc_rqst *rqstp)
  732. {
  733. struct svc_serv *serv = rqstp->rq_server;
  734. struct svc_pool *pool = rqstp->rq_pool;
  735. spin_lock_bh(&pool->sp_lock);
  736. pool->sp_nrthreads--;
  737. if (!test_and_set_bit(RQ_VICTIM, &rqstp->rq_flags))
  738. list_del_rcu(&rqstp->rq_all);
  739. spin_unlock_bh(&pool->sp_lock);
  740. svc_rqst_free(rqstp);
  741. /* Release the server */
  742. if (serv)
  743. svc_destroy(serv);
  744. }
  745. EXPORT_SYMBOL_GPL(svc_exit_thread);
  746. /*
  747. * Register an "inet" protocol family netid with the local
  748. * rpcbind daemon via an rpcbind v4 SET request.
  749. *
  750. * No netconfig infrastructure is available in the kernel, so
  751. * we map IP_ protocol numbers to netids by hand.
  752. *
  753. * Returns zero on success; a negative errno value is returned
  754. * if any error occurs.
  755. */
  756. static int __svc_rpcb_register4(struct net *net, const u32 program,
  757. const u32 version,
  758. const unsigned short protocol,
  759. const unsigned short port)
  760. {
  761. const struct sockaddr_in sin = {
  762. .sin_family = AF_INET,
  763. .sin_addr.s_addr = htonl(INADDR_ANY),
  764. .sin_port = htons(port),
  765. };
  766. const char *netid;
  767. int error;
  768. switch (protocol) {
  769. case IPPROTO_UDP:
  770. netid = RPCBIND_NETID_UDP;
  771. break;
  772. case IPPROTO_TCP:
  773. netid = RPCBIND_NETID_TCP;
  774. break;
  775. default:
  776. return -ENOPROTOOPT;
  777. }
  778. error = rpcb_v4_register(net, program, version,
  779. (const struct sockaddr *)&sin, netid);
  780. /*
  781. * User space didn't support rpcbind v4, so retry this
  782. * registration request with the legacy rpcbind v2 protocol.
  783. */
  784. if (error == -EPROTONOSUPPORT)
  785. error = rpcb_register(net, program, version, protocol, port);
  786. return error;
  787. }
  788. #if IS_ENABLED(CONFIG_IPV6)
  789. /*
  790. * Register an "inet6" protocol family netid with the local
  791. * rpcbind daemon via an rpcbind v4 SET request.
  792. *
  793. * No netconfig infrastructure is available in the kernel, so
  794. * we map IP_ protocol numbers to netids by hand.
  795. *
  796. * Returns zero on success; a negative errno value is returned
  797. * if any error occurs.
  798. */
  799. static int __svc_rpcb_register6(struct net *net, const u32 program,
  800. const u32 version,
  801. const unsigned short protocol,
  802. const unsigned short port)
  803. {
  804. const struct sockaddr_in6 sin6 = {
  805. .sin6_family = AF_INET6,
  806. .sin6_addr = IN6ADDR_ANY_INIT,
  807. .sin6_port = htons(port),
  808. };
  809. const char *netid;
  810. int error;
  811. switch (protocol) {
  812. case IPPROTO_UDP:
  813. netid = RPCBIND_NETID_UDP6;
  814. break;
  815. case IPPROTO_TCP:
  816. netid = RPCBIND_NETID_TCP6;
  817. break;
  818. default:
  819. return -ENOPROTOOPT;
  820. }
  821. error = rpcb_v4_register(net, program, version,
  822. (const struct sockaddr *)&sin6, netid);
  823. /*
  824. * User space didn't support rpcbind version 4, so we won't
  825. * use a PF_INET6 listener.
  826. */
  827. if (error == -EPROTONOSUPPORT)
  828. error = -EAFNOSUPPORT;
  829. return error;
  830. }
  831. #endif /* IS_ENABLED(CONFIG_IPV6) */
  832. /*
  833. * Register a kernel RPC service via rpcbind version 4.
  834. *
  835. * Returns zero on success; a negative errno value is returned
  836. * if any error occurs.
  837. */
  838. static int __svc_register(struct net *net, const char *progname,
  839. const u32 program, const u32 version,
  840. const int family,
  841. const unsigned short protocol,
  842. const unsigned short port)
  843. {
  844. int error = -EAFNOSUPPORT;
  845. switch (family) {
  846. case PF_INET:
  847. error = __svc_rpcb_register4(net, program, version,
  848. protocol, port);
  849. break;
  850. #if IS_ENABLED(CONFIG_IPV6)
  851. case PF_INET6:
  852. error = __svc_rpcb_register6(net, program, version,
  853. protocol, port);
  854. #endif
  855. }
  856. return error;
  857. }
  858. /**
  859. * svc_register - register an RPC service with the local portmapper
  860. * @serv: svc_serv struct for the service to register
  861. * @net: net namespace for the service to register
  862. * @family: protocol family of service's listener socket
  863. * @proto: transport protocol number to advertise
  864. * @port: port to advertise
  865. *
  866. * Service is registered for any address in the passed-in protocol family
  867. */
  868. int svc_register(const struct svc_serv *serv, struct net *net,
  869. const int family, const unsigned short proto,
  870. const unsigned short port)
  871. {
  872. struct svc_program *progp;
  873. const struct svc_version *vers;
  874. unsigned int i;
  875. int error = 0;
  876. WARN_ON_ONCE(proto == 0 && port == 0);
  877. if (proto == 0 && port == 0)
  878. return -EINVAL;
  879. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  880. for (i = 0; i < progp->pg_nvers; i++) {
  881. vers = progp->pg_vers[i];
  882. if (vers == NULL)
  883. continue;
  884. dprintk("svc: svc_register(%sv%d, %s, %u, %u)%s\n",
  885. progp->pg_name,
  886. i,
  887. proto == IPPROTO_UDP? "udp" : "tcp",
  888. port,
  889. family,
  890. vers->vs_hidden ?
  891. " (but not telling portmap)" : "");
  892. if (vers->vs_hidden)
  893. continue;
  894. /*
  895. * Don't register a UDP port if we need congestion
  896. * control.
  897. */
  898. if (vers->vs_need_cong_ctrl && proto == IPPROTO_UDP)
  899. continue;
  900. error = __svc_register(net, progp->pg_name, progp->pg_prog,
  901. i, family, proto, port);
  902. if (vers->vs_rpcb_optnl) {
  903. error = 0;
  904. continue;
  905. }
  906. if (error < 0) {
  907. printk(KERN_WARNING "svc: failed to register "
  908. "%sv%u RPC service (errno %d).\n",
  909. progp->pg_name, i, -error);
  910. break;
  911. }
  912. }
  913. }
  914. return error;
  915. }
  916. /*
  917. * If user space is running rpcbind, it should take the v4 UNSET
  918. * and clear everything for this [program, version]. If user space
  919. * is running portmap, it will reject the v4 UNSET, but won't have
  920. * any "inet6" entries anyway. So a PMAP_UNSET should be sufficient
  921. * in this case to clear all existing entries for [program, version].
  922. */
  923. static void __svc_unregister(struct net *net, const u32 program, const u32 version,
  924. const char *progname)
  925. {
  926. int error;
  927. error = rpcb_v4_register(net, program, version, NULL, "");
  928. /*
  929. * User space didn't support rpcbind v4, so retry this
  930. * request with the legacy rpcbind v2 protocol.
  931. */
  932. if (error == -EPROTONOSUPPORT)
  933. error = rpcb_register(net, program, version, 0, 0);
  934. dprintk("svc: %s(%sv%u), error %d\n",
  935. __func__, progname, version, error);
  936. }
  937. /*
  938. * All netids, bind addresses and ports registered for [program, version]
  939. * are removed from the local rpcbind database (if the service is not
  940. * hidden) to make way for a new instance of the service.
  941. *
  942. * The result of unregistration is reported via dprintk for those who want
  943. * verification of the result, but is otherwise not important.
  944. */
  945. static void svc_unregister(const struct svc_serv *serv, struct net *net)
  946. {
  947. struct svc_program *progp;
  948. unsigned long flags;
  949. unsigned int i;
  950. clear_thread_flag(TIF_SIGPENDING);
  951. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  952. for (i = 0; i < progp->pg_nvers; i++) {
  953. if (progp->pg_vers[i] == NULL)
  954. continue;
  955. if (progp->pg_vers[i]->vs_hidden)
  956. continue;
  957. dprintk("svc: attempting to unregister %sv%u\n",
  958. progp->pg_name, i);
  959. __svc_unregister(net, progp->pg_prog, i, progp->pg_name);
  960. }
  961. }
  962. spin_lock_irqsave(&current->sighand->siglock, flags);
  963. recalc_sigpending();
  964. spin_unlock_irqrestore(&current->sighand->siglock, flags);
  965. }
  966. /*
  967. * dprintk the given error with the address of the client that caused it.
  968. */
  969. #if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
  970. static __printf(2, 3)
  971. void svc_printk(struct svc_rqst *rqstp, const char *fmt, ...)
  972. {
  973. struct va_format vaf;
  974. va_list args;
  975. char buf[RPC_MAX_ADDRBUFLEN];
  976. va_start(args, fmt);
  977. vaf.fmt = fmt;
  978. vaf.va = &args;
  979. dprintk("svc: %s: %pV", svc_print_addr(rqstp, buf, sizeof(buf)), &vaf);
  980. va_end(args);
  981. }
  982. #else
  983. static __printf(2,3) void svc_printk(struct svc_rqst *rqstp, const char *fmt, ...) {}
  984. #endif
  985. extern void svc_tcp_prep_reply_hdr(struct svc_rqst *);
  986. /*
  987. * Common routine for processing the RPC request.
  988. */
  989. static int
  990. svc_process_common(struct svc_rqst *rqstp, struct kvec *argv, struct kvec *resv)
  991. {
  992. struct svc_program *progp;
  993. const struct svc_version *versp = NULL; /* compiler food */
  994. const struct svc_procedure *procp = NULL;
  995. struct svc_serv *serv = rqstp->rq_server;
  996. __be32 *statp;
  997. u32 prog, vers, proc;
  998. __be32 auth_stat, rpc_stat;
  999. int auth_res;
  1000. __be32 *reply_statp;
  1001. rpc_stat = rpc_success;
  1002. if (argv->iov_len < 6*4)
  1003. goto err_short_len;
  1004. /* Will be turned off by GSS integrity and privacy services */
  1005. set_bit(RQ_SPLICE_OK, &rqstp->rq_flags);
  1006. /* Will be turned off only when NFSv4 Sessions are used */
  1007. set_bit(RQ_USEDEFERRAL, &rqstp->rq_flags);
  1008. clear_bit(RQ_DROPME, &rqstp->rq_flags);
  1009. /* Setup reply header */
  1010. if (rqstp->rq_prot == IPPROTO_TCP)
  1011. svc_tcp_prep_reply_hdr(rqstp);
  1012. svc_putu32(resv, rqstp->rq_xid);
  1013. vers = svc_getnl(argv);
  1014. /* First words of reply: */
  1015. svc_putnl(resv, 1); /* REPLY */
  1016. if (vers != 2) /* RPC version number */
  1017. goto err_bad_rpc;
  1018. /* Save position in case we later decide to reject: */
  1019. reply_statp = resv->iov_base + resv->iov_len;
  1020. svc_putnl(resv, 0); /* ACCEPT */
  1021. rqstp->rq_prog = prog = svc_getnl(argv); /* program number */
  1022. rqstp->rq_vers = vers = svc_getnl(argv); /* version number */
  1023. rqstp->rq_proc = proc = svc_getnl(argv); /* procedure number */
  1024. for (progp = serv->sv_program; progp; progp = progp->pg_next)
  1025. if (prog == progp->pg_prog)
  1026. break;
  1027. /*
  1028. * Decode auth data, and add verifier to reply buffer.
  1029. * We do this before anything else in order to get a decent
  1030. * auth verifier.
  1031. */
  1032. auth_res = svc_authenticate(rqstp, &auth_stat);
  1033. /* Also give the program a chance to reject this call: */
  1034. if (auth_res == SVC_OK && progp) {
  1035. auth_stat = rpc_autherr_badcred;
  1036. auth_res = progp->pg_authenticate(rqstp);
  1037. }
  1038. switch (auth_res) {
  1039. case SVC_OK:
  1040. break;
  1041. case SVC_GARBAGE:
  1042. goto err_garbage;
  1043. case SVC_SYSERR:
  1044. rpc_stat = rpc_system_err;
  1045. goto err_bad;
  1046. case SVC_DENIED:
  1047. goto err_bad_auth;
  1048. case SVC_CLOSE:
  1049. goto close;
  1050. case SVC_DROP:
  1051. goto dropit;
  1052. case SVC_COMPLETE:
  1053. goto sendit;
  1054. }
  1055. if (progp == NULL)
  1056. goto err_bad_prog;
  1057. if (vers >= progp->pg_nvers ||
  1058. !(versp = progp->pg_vers[vers]))
  1059. goto err_bad_vers;
  1060. /*
  1061. * Some protocol versions (namely NFSv4) require some form of
  1062. * congestion control. (See RFC 7530 section 3.1 paragraph 2)
  1063. * In other words, UDP is not allowed. We mark those when setting
  1064. * up the svc_xprt, and verify that here.
  1065. *
  1066. * The spec is not very clear about what error should be returned
  1067. * when someone tries to access a server that is listening on UDP
  1068. * for lower versions. RPC_PROG_MISMATCH seems to be the closest
  1069. * fit.
  1070. */
  1071. if (versp->vs_need_cong_ctrl && rqstp->rq_xprt &&
  1072. !test_bit(XPT_CONG_CTRL, &rqstp->rq_xprt->xpt_flags))
  1073. goto err_bad_vers;
  1074. procp = versp->vs_proc + proc;
  1075. if (proc >= versp->vs_nproc || !procp->pc_func)
  1076. goto err_bad_proc;
  1077. rqstp->rq_procinfo = procp;
  1078. /* Syntactic check complete */
  1079. serv->sv_stats->rpccnt++;
  1080. trace_svc_process(rqstp, progp->pg_name);
  1081. /* Build the reply header. */
  1082. statp = resv->iov_base +resv->iov_len;
  1083. svc_putnl(resv, RPC_SUCCESS);
  1084. /* Bump per-procedure stats counter */
  1085. versp->vs_count[proc]++;
  1086. /* Initialize storage for argp and resp */
  1087. memset(rqstp->rq_argp, 0, procp->pc_argsize);
  1088. memset(rqstp->rq_resp, 0, procp->pc_ressize);
  1089. /* un-reserve some of the out-queue now that we have a
  1090. * better idea of reply size
  1091. */
  1092. if (procp->pc_xdrressize)
  1093. svc_reserve_auth(rqstp, procp->pc_xdrressize<<2);
  1094. /* Call the function that processes the request. */
  1095. if (!versp->vs_dispatch) {
  1096. /*
  1097. * Decode arguments
  1098. * XXX: why do we ignore the return value?
  1099. */
  1100. if (procp->pc_decode &&
  1101. !procp->pc_decode(rqstp, argv->iov_base))
  1102. goto err_garbage;
  1103. *statp = procp->pc_func(rqstp);
  1104. /* Encode reply */
  1105. if (*statp == rpc_drop_reply ||
  1106. test_bit(RQ_DROPME, &rqstp->rq_flags)) {
  1107. if (procp->pc_release)
  1108. procp->pc_release(rqstp);
  1109. goto dropit;
  1110. }
  1111. if (*statp == rpc_autherr_badcred) {
  1112. if (procp->pc_release)
  1113. procp->pc_release(rqstp);
  1114. goto err_bad_auth;
  1115. }
  1116. if (*statp == rpc_success && procp->pc_encode &&
  1117. !procp->pc_encode(rqstp, resv->iov_base + resv->iov_len)) {
  1118. dprintk("svc: failed to encode reply\n");
  1119. /* serv->sv_stats->rpcsystemerr++; */
  1120. *statp = rpc_system_err;
  1121. }
  1122. } else {
  1123. dprintk("svc: calling dispatcher\n");
  1124. if (!versp->vs_dispatch(rqstp, statp)) {
  1125. /* Release reply info */
  1126. if (procp->pc_release)
  1127. procp->pc_release(rqstp);
  1128. goto dropit;
  1129. }
  1130. }
  1131. /* Check RPC status result */
  1132. if (*statp != rpc_success)
  1133. resv->iov_len = ((void*)statp) - resv->iov_base + 4;
  1134. /* Release reply info */
  1135. if (procp->pc_release)
  1136. procp->pc_release(rqstp);
  1137. if (procp->pc_encode == NULL)
  1138. goto dropit;
  1139. sendit:
  1140. if (svc_authorise(rqstp))
  1141. goto close;
  1142. return 1; /* Caller can now send it */
  1143. dropit:
  1144. svc_authorise(rqstp); /* doesn't hurt to call this twice */
  1145. dprintk("svc: svc_process dropit\n");
  1146. return 0;
  1147. close:
  1148. if (rqstp->rq_xprt && test_bit(XPT_TEMP, &rqstp->rq_xprt->xpt_flags))
  1149. svc_close_xprt(rqstp->rq_xprt);
  1150. dprintk("svc: svc_process close\n");
  1151. return 0;
  1152. err_short_len:
  1153. svc_printk(rqstp, "short len %zd, dropping request\n",
  1154. argv->iov_len);
  1155. goto close;
  1156. err_bad_rpc:
  1157. serv->sv_stats->rpcbadfmt++;
  1158. svc_putnl(resv, 1); /* REJECT */
  1159. svc_putnl(resv, 0); /* RPC_MISMATCH */
  1160. svc_putnl(resv, 2); /* Only RPCv2 supported */
  1161. svc_putnl(resv, 2);
  1162. goto sendit;
  1163. err_bad_auth:
  1164. dprintk("svc: authentication failed (%d)\n", ntohl(auth_stat));
  1165. serv->sv_stats->rpcbadauth++;
  1166. /* Restore write pointer to location of accept status: */
  1167. xdr_ressize_check(rqstp, reply_statp);
  1168. svc_putnl(resv, 1); /* REJECT */
  1169. svc_putnl(resv, 1); /* AUTH_ERROR */
  1170. svc_putnl(resv, ntohl(auth_stat)); /* status */
  1171. goto sendit;
  1172. err_bad_prog:
  1173. dprintk("svc: unknown program %d\n", prog);
  1174. serv->sv_stats->rpcbadfmt++;
  1175. svc_putnl(resv, RPC_PROG_UNAVAIL);
  1176. goto sendit;
  1177. err_bad_vers:
  1178. svc_printk(rqstp, "unknown version (%d for prog %d, %s)\n",
  1179. vers, prog, progp->pg_name);
  1180. serv->sv_stats->rpcbadfmt++;
  1181. svc_putnl(resv, RPC_PROG_MISMATCH);
  1182. svc_putnl(resv, progp->pg_lovers);
  1183. svc_putnl(resv, progp->pg_hivers);
  1184. goto sendit;
  1185. err_bad_proc:
  1186. svc_printk(rqstp, "unknown procedure (%d)\n", proc);
  1187. serv->sv_stats->rpcbadfmt++;
  1188. svc_putnl(resv, RPC_PROC_UNAVAIL);
  1189. goto sendit;
  1190. err_garbage:
  1191. svc_printk(rqstp, "failed to decode args\n");
  1192. rpc_stat = rpc_garbage_args;
  1193. err_bad:
  1194. serv->sv_stats->rpcbadfmt++;
  1195. svc_putnl(resv, ntohl(rpc_stat));
  1196. goto sendit;
  1197. }
  1198. /*
  1199. * Process the RPC request.
  1200. */
  1201. int
  1202. svc_process(struct svc_rqst *rqstp)
  1203. {
  1204. struct kvec *argv = &rqstp->rq_arg.head[0];
  1205. struct kvec *resv = &rqstp->rq_res.head[0];
  1206. struct svc_serv *serv = rqstp->rq_server;
  1207. u32 dir;
  1208. /*
  1209. * Setup response xdr_buf.
  1210. * Initially it has just one page
  1211. */
  1212. rqstp->rq_next_page = &rqstp->rq_respages[1];
  1213. resv->iov_base = page_address(rqstp->rq_respages[0]);
  1214. resv->iov_len = 0;
  1215. rqstp->rq_res.pages = rqstp->rq_respages + 1;
  1216. rqstp->rq_res.len = 0;
  1217. rqstp->rq_res.page_base = 0;
  1218. rqstp->rq_res.page_len = 0;
  1219. rqstp->rq_res.buflen = PAGE_SIZE;
  1220. rqstp->rq_res.tail[0].iov_base = NULL;
  1221. rqstp->rq_res.tail[0].iov_len = 0;
  1222. dir = svc_getnl(argv);
  1223. if (dir != 0) {
  1224. /* direction != CALL */
  1225. svc_printk(rqstp, "bad direction %d, dropping request\n", dir);
  1226. serv->sv_stats->rpcbadfmt++;
  1227. goto out_drop;
  1228. }
  1229. /* Returns 1 for send, 0 for drop */
  1230. if (likely(svc_process_common(rqstp, argv, resv)))
  1231. return svc_send(rqstp);
  1232. out_drop:
  1233. svc_drop(rqstp);
  1234. return 0;
  1235. }
  1236. EXPORT_SYMBOL_GPL(svc_process);
  1237. #if defined(CONFIG_SUNRPC_BACKCHANNEL)
  1238. /*
  1239. * Process a backchannel RPC request that arrived over an existing
  1240. * outbound connection
  1241. */
  1242. int
  1243. bc_svc_process(struct svc_serv *serv, struct rpc_rqst *req,
  1244. struct svc_rqst *rqstp)
  1245. {
  1246. struct kvec *argv = &rqstp->rq_arg.head[0];
  1247. struct kvec *resv = &rqstp->rq_res.head[0];
  1248. struct rpc_task *task;
  1249. int proc_error;
  1250. int error;
  1251. dprintk("svc: %s(%p)\n", __func__, req);
  1252. /* Build the svc_rqst used by the common processing routine */
  1253. rqstp->rq_xid = req->rq_xid;
  1254. rqstp->rq_prot = req->rq_xprt->prot;
  1255. rqstp->rq_server = serv;
  1256. rqstp->rq_bc_net = req->rq_xprt->xprt_net;
  1257. rqstp->rq_addrlen = sizeof(req->rq_xprt->addr);
  1258. memcpy(&rqstp->rq_addr, &req->rq_xprt->addr, rqstp->rq_addrlen);
  1259. memcpy(&rqstp->rq_arg, &req->rq_rcv_buf, sizeof(rqstp->rq_arg));
  1260. memcpy(&rqstp->rq_res, &req->rq_snd_buf, sizeof(rqstp->rq_res));
  1261. /* Adjust the argument buffer length */
  1262. rqstp->rq_arg.len = req->rq_private_buf.len;
  1263. if (rqstp->rq_arg.len <= rqstp->rq_arg.head[0].iov_len) {
  1264. rqstp->rq_arg.head[0].iov_len = rqstp->rq_arg.len;
  1265. rqstp->rq_arg.page_len = 0;
  1266. } else if (rqstp->rq_arg.len <= rqstp->rq_arg.head[0].iov_len +
  1267. rqstp->rq_arg.page_len)
  1268. rqstp->rq_arg.page_len = rqstp->rq_arg.len -
  1269. rqstp->rq_arg.head[0].iov_len;
  1270. else
  1271. rqstp->rq_arg.len = rqstp->rq_arg.head[0].iov_len +
  1272. rqstp->rq_arg.page_len;
  1273. /* reset result send buffer "put" position */
  1274. resv->iov_len = 0;
  1275. /*
  1276. * Skip the next two words because they've already been
  1277. * processed in the transport
  1278. */
  1279. svc_getu32(argv); /* XID */
  1280. svc_getnl(argv); /* CALLDIR */
  1281. /* Parse and execute the bc call */
  1282. proc_error = svc_process_common(rqstp, argv, resv);
  1283. atomic_inc(&req->rq_xprt->bc_free_slots);
  1284. if (!proc_error) {
  1285. /* Processing error: drop the request */
  1286. xprt_free_bc_request(req);
  1287. return 0;
  1288. }
  1289. /* Finally, send the reply synchronously */
  1290. memcpy(&req->rq_snd_buf, &rqstp->rq_res, sizeof(req->rq_snd_buf));
  1291. task = rpc_run_bc_task(req);
  1292. if (IS_ERR(task)) {
  1293. error = PTR_ERR(task);
  1294. goto out;
  1295. }
  1296. WARN_ON_ONCE(atomic_read(&task->tk_count) != 1);
  1297. error = task->tk_status;
  1298. rpc_put_task(task);
  1299. out:
  1300. dprintk("svc: %s(), error=%d\n", __func__, error);
  1301. return error;
  1302. }
  1303. EXPORT_SYMBOL_GPL(bc_svc_process);
  1304. #endif /* CONFIG_SUNRPC_BACKCHANNEL */
  1305. /*
  1306. * Return (transport-specific) limit on the rpc payload.
  1307. */
  1308. u32 svc_max_payload(const struct svc_rqst *rqstp)
  1309. {
  1310. u32 max = rqstp->rq_xprt->xpt_class->xcl_max_payload;
  1311. if (rqstp->rq_server->sv_max_payload < max)
  1312. max = rqstp->rq_server->sv_max_payload;
  1313. return max;
  1314. }
  1315. EXPORT_SYMBOL_GPL(svc_max_payload);
  1316. /**
  1317. * svc_fill_write_vector - Construct data argument for VFS write call
  1318. * @rqstp: svc_rqst to operate on
  1319. * @pages: list of pages containing data payload
  1320. * @first: buffer containing first section of write payload
  1321. * @total: total number of bytes of write payload
  1322. *
  1323. * Fills in rqstp::rq_vec, and returns the number of elements.
  1324. */
  1325. unsigned int svc_fill_write_vector(struct svc_rqst *rqstp, struct page **pages,
  1326. struct kvec *first, size_t total)
  1327. {
  1328. struct kvec *vec = rqstp->rq_vec;
  1329. unsigned int i;
  1330. /* Some types of transport can present the write payload
  1331. * entirely in rq_arg.pages. In this case, @first is empty.
  1332. */
  1333. i = 0;
  1334. if (first->iov_len) {
  1335. vec[i].iov_base = first->iov_base;
  1336. vec[i].iov_len = min_t(size_t, total, first->iov_len);
  1337. total -= vec[i].iov_len;
  1338. ++i;
  1339. }
  1340. while (total) {
  1341. vec[i].iov_base = page_address(*pages);
  1342. vec[i].iov_len = min_t(size_t, total, PAGE_SIZE);
  1343. total -= vec[i].iov_len;
  1344. ++i;
  1345. ++pages;
  1346. }
  1347. WARN_ON_ONCE(i > ARRAY_SIZE(rqstp->rq_vec));
  1348. return i;
  1349. }
  1350. EXPORT_SYMBOL_GPL(svc_fill_write_vector);
  1351. /**
  1352. * svc_fill_symlink_pathname - Construct pathname argument for VFS symlink call
  1353. * @rqstp: svc_rqst to operate on
  1354. * @first: buffer containing first section of pathname
  1355. * @p: buffer containing remaining section of pathname
  1356. * @total: total length of the pathname argument
  1357. *
  1358. * The VFS symlink API demands a NUL-terminated pathname in mapped memory.
  1359. * Returns pointer to a NUL-terminated string, or an ERR_PTR. Caller must free
  1360. * the returned string.
  1361. */
  1362. char *svc_fill_symlink_pathname(struct svc_rqst *rqstp, struct kvec *first,
  1363. void *p, size_t total)
  1364. {
  1365. size_t len, remaining;
  1366. char *result, *dst;
  1367. result = kmalloc(total + 1, GFP_KERNEL);
  1368. if (!result)
  1369. return ERR_PTR(-ESERVERFAULT);
  1370. dst = result;
  1371. remaining = total;
  1372. len = min_t(size_t, total, first->iov_len);
  1373. if (len) {
  1374. memcpy(dst, first->iov_base, len);
  1375. dst += len;
  1376. remaining -= len;
  1377. }
  1378. if (remaining) {
  1379. len = min_t(size_t, remaining, PAGE_SIZE);
  1380. memcpy(dst, p, len);
  1381. dst += len;
  1382. }
  1383. *dst = '\0';
  1384. /* Sanity check: Linux doesn't allow the pathname argument to
  1385. * contain a NUL byte.
  1386. */
  1387. if (strlen(result) != total) {
  1388. kfree(result);
  1389. return ERR_PTR(-EINVAL);
  1390. }
  1391. return result;
  1392. }
  1393. EXPORT_SYMBOL_GPL(svc_fill_symlink_pathname);