svc.c 25 KB

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