svc.c 31 KB

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