svc.c 29 KB

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