svc.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056
  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. #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 given thread's cpus_allowed mask so that it
  251. * will only run on cpus in the given pool.
  252. */
  253. static inline void
  254. svc_pool_map_set_cpumask(struct task_struct *task, unsigned int pidx)
  255. {
  256. struct svc_pool_map *m = &svc_pool_map;
  257. unsigned int node = m->pool_to[pidx];
  258. /*
  259. * The caller checks for sv_nrpools > 1, which
  260. * implies that we've been initialized.
  261. */
  262. BUG_ON(m->count == 0);
  263. switch (m->mode) {
  264. case SVC_POOL_PERCPU:
  265. {
  266. set_cpus_allowed_ptr(task, &cpumask_of_cpu(node));
  267. break;
  268. }
  269. case SVC_POOL_PERNODE:
  270. {
  271. node_to_cpumask_ptr(nodecpumask, node);
  272. set_cpus_allowed_ptr(task, nodecpumask);
  273. break;
  274. }
  275. }
  276. }
  277. /*
  278. * Use the mapping mode to choose a pool for a given CPU.
  279. * Used when enqueueing an incoming RPC. Always returns
  280. * a non-NULL pool pointer.
  281. */
  282. struct svc_pool *
  283. svc_pool_for_cpu(struct svc_serv *serv, int cpu)
  284. {
  285. struct svc_pool_map *m = &svc_pool_map;
  286. unsigned int pidx = 0;
  287. /*
  288. * An uninitialised map happens in a pure client when
  289. * lockd is brought up, so silently treat it the
  290. * same as SVC_POOL_GLOBAL.
  291. */
  292. if (svc_serv_is_pooled(serv)) {
  293. switch (m->mode) {
  294. case SVC_POOL_PERCPU:
  295. pidx = m->to_pool[cpu];
  296. break;
  297. case SVC_POOL_PERNODE:
  298. pidx = m->to_pool[cpu_to_node(cpu)];
  299. break;
  300. }
  301. }
  302. return &serv->sv_pools[pidx % serv->sv_nrpools];
  303. }
  304. /*
  305. * Create an RPC service
  306. */
  307. static struct svc_serv *
  308. __svc_create(struct svc_program *prog, unsigned int bufsize, int npools,
  309. void (*shutdown)(struct svc_serv *serv))
  310. {
  311. struct svc_serv *serv;
  312. unsigned int vers;
  313. unsigned int xdrsize;
  314. unsigned int i;
  315. if (!(serv = kzalloc(sizeof(*serv), GFP_KERNEL)))
  316. return NULL;
  317. serv->sv_name = prog->pg_name;
  318. serv->sv_program = prog;
  319. serv->sv_nrthreads = 1;
  320. serv->sv_stats = prog->pg_stats;
  321. if (bufsize > RPCSVC_MAXPAYLOAD)
  322. bufsize = RPCSVC_MAXPAYLOAD;
  323. serv->sv_max_payload = bufsize? bufsize : 4096;
  324. serv->sv_max_mesg = roundup(serv->sv_max_payload + PAGE_SIZE, PAGE_SIZE);
  325. serv->sv_shutdown = shutdown;
  326. xdrsize = 0;
  327. while (prog) {
  328. prog->pg_lovers = prog->pg_nvers-1;
  329. for (vers=0; vers<prog->pg_nvers ; vers++)
  330. if (prog->pg_vers[vers]) {
  331. prog->pg_hivers = vers;
  332. if (prog->pg_lovers > vers)
  333. prog->pg_lovers = vers;
  334. if (prog->pg_vers[vers]->vs_xdrsize > xdrsize)
  335. xdrsize = prog->pg_vers[vers]->vs_xdrsize;
  336. }
  337. prog = prog->pg_next;
  338. }
  339. serv->sv_xdrsize = xdrsize;
  340. INIT_LIST_HEAD(&serv->sv_tempsocks);
  341. INIT_LIST_HEAD(&serv->sv_permsocks);
  342. init_timer(&serv->sv_temptimer);
  343. spin_lock_init(&serv->sv_lock);
  344. serv->sv_nrpools = npools;
  345. serv->sv_pools =
  346. kcalloc(serv->sv_nrpools, sizeof(struct svc_pool),
  347. GFP_KERNEL);
  348. if (!serv->sv_pools) {
  349. kfree(serv);
  350. return NULL;
  351. }
  352. for (i = 0; i < serv->sv_nrpools; i++) {
  353. struct svc_pool *pool = &serv->sv_pools[i];
  354. dprintk("svc: initialising pool %u for %s\n",
  355. i, serv->sv_name);
  356. pool->sp_id = i;
  357. INIT_LIST_HEAD(&pool->sp_threads);
  358. INIT_LIST_HEAD(&pool->sp_sockets);
  359. INIT_LIST_HEAD(&pool->sp_all_threads);
  360. spin_lock_init(&pool->sp_lock);
  361. }
  362. /* Remove any stale portmap registrations */
  363. svc_register(serv, 0, 0);
  364. return serv;
  365. }
  366. struct svc_serv *
  367. svc_create(struct svc_program *prog, unsigned int bufsize,
  368. void (*shutdown)(struct svc_serv *serv))
  369. {
  370. return __svc_create(prog, bufsize, /*npools*/1, shutdown);
  371. }
  372. EXPORT_SYMBOL(svc_create);
  373. struct svc_serv *
  374. svc_create_pooled(struct svc_program *prog, unsigned int bufsize,
  375. void (*shutdown)(struct svc_serv *serv),
  376. svc_thread_fn func, struct module *mod)
  377. {
  378. struct svc_serv *serv;
  379. unsigned int npools = svc_pool_map_get();
  380. serv = __svc_create(prog, bufsize, npools, shutdown);
  381. if (serv != NULL) {
  382. serv->sv_function = func;
  383. serv->sv_module = mod;
  384. }
  385. return serv;
  386. }
  387. EXPORT_SYMBOL(svc_create_pooled);
  388. /*
  389. * Destroy an RPC service. Should be called with appropriate locking to
  390. * protect the sv_nrthreads, sv_permsocks and sv_tempsocks.
  391. */
  392. void
  393. svc_destroy(struct svc_serv *serv)
  394. {
  395. dprintk("svc: svc_destroy(%s, %d)\n",
  396. serv->sv_program->pg_name,
  397. serv->sv_nrthreads);
  398. if (serv->sv_nrthreads) {
  399. if (--(serv->sv_nrthreads) != 0) {
  400. svc_sock_update_bufs(serv);
  401. return;
  402. }
  403. } else
  404. printk("svc_destroy: no threads for serv=%p!\n", serv);
  405. del_timer_sync(&serv->sv_temptimer);
  406. svc_close_all(&serv->sv_tempsocks);
  407. if (serv->sv_shutdown)
  408. serv->sv_shutdown(serv);
  409. svc_close_all(&serv->sv_permsocks);
  410. BUG_ON(!list_empty(&serv->sv_permsocks));
  411. BUG_ON(!list_empty(&serv->sv_tempsocks));
  412. cache_clean_deferred(serv);
  413. if (svc_serv_is_pooled(serv))
  414. svc_pool_map_put();
  415. /* Unregister service with the portmapper */
  416. svc_register(serv, 0, 0);
  417. kfree(serv->sv_pools);
  418. kfree(serv);
  419. }
  420. EXPORT_SYMBOL(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(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(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(svc_exit_thread);
  614. /*
  615. * Register an RPC service with the local portmapper.
  616. * To unregister a service, call this routine with
  617. * proto and port == 0.
  618. */
  619. int
  620. svc_register(struct svc_serv *serv, int proto, unsigned short port)
  621. {
  622. struct svc_program *progp;
  623. unsigned long flags;
  624. unsigned int i;
  625. int error = 0, dummy;
  626. if (!port)
  627. clear_thread_flag(TIF_SIGPENDING);
  628. for (progp = serv->sv_program; progp; progp = progp->pg_next) {
  629. for (i = 0; i < progp->pg_nvers; i++) {
  630. if (progp->pg_vers[i] == NULL)
  631. continue;
  632. dprintk("svc: svc_register(%s, %s, %d, %d)%s\n",
  633. progp->pg_name,
  634. proto == IPPROTO_UDP? "udp" : "tcp",
  635. port,
  636. i,
  637. progp->pg_vers[i]->vs_hidden?
  638. " (but not telling portmap)" : "");
  639. if (progp->pg_vers[i]->vs_hidden)
  640. continue;
  641. error = rpcb_register(progp->pg_prog, i, proto, port, &dummy);
  642. if (error < 0)
  643. break;
  644. if (port && !dummy) {
  645. error = -EACCES;
  646. break;
  647. }
  648. }
  649. }
  650. if (!port) {
  651. spin_lock_irqsave(&current->sighand->siglock, flags);
  652. recalc_sigpending();
  653. spin_unlock_irqrestore(&current->sighand->siglock, flags);
  654. }
  655. return error;
  656. }
  657. /*
  658. * Printk the given error with the address of the client that caused it.
  659. */
  660. static int
  661. __attribute__ ((format (printf, 2, 3)))
  662. svc_printk(struct svc_rqst *rqstp, const char *fmt, ...)
  663. {
  664. va_list args;
  665. int r;
  666. char buf[RPC_MAX_ADDRBUFLEN];
  667. if (!net_ratelimit())
  668. return 0;
  669. printk(KERN_WARNING "svc: %s: ",
  670. svc_print_addr(rqstp, buf, sizeof(buf)));
  671. va_start(args, fmt);
  672. r = vprintk(fmt, args);
  673. va_end(args);
  674. return r;
  675. }
  676. /*
  677. * Process the RPC request.
  678. */
  679. int
  680. svc_process(struct svc_rqst *rqstp)
  681. {
  682. struct svc_program *progp;
  683. struct svc_version *versp = NULL; /* compiler food */
  684. struct svc_procedure *procp = NULL;
  685. struct kvec * argv = &rqstp->rq_arg.head[0];
  686. struct kvec * resv = &rqstp->rq_res.head[0];
  687. struct svc_serv *serv = rqstp->rq_server;
  688. kxdrproc_t xdr;
  689. __be32 *statp;
  690. u32 dir, prog, vers, proc;
  691. __be32 auth_stat, rpc_stat;
  692. int auth_res;
  693. __be32 *reply_statp;
  694. rpc_stat = rpc_success;
  695. if (argv->iov_len < 6*4)
  696. goto err_short_len;
  697. /* setup response xdr_buf.
  698. * Initially it has just one page
  699. */
  700. rqstp->rq_resused = 1;
  701. resv->iov_base = page_address(rqstp->rq_respages[0]);
  702. resv->iov_len = 0;
  703. rqstp->rq_res.pages = rqstp->rq_respages + 1;
  704. rqstp->rq_res.len = 0;
  705. rqstp->rq_res.page_base = 0;
  706. rqstp->rq_res.page_len = 0;
  707. rqstp->rq_res.buflen = PAGE_SIZE;
  708. rqstp->rq_res.tail[0].iov_base = NULL;
  709. rqstp->rq_res.tail[0].iov_len = 0;
  710. /* Will be turned off only in gss privacy case: */
  711. rqstp->rq_splice_ok = 1;
  712. /* Setup reply header */
  713. rqstp->rq_xprt->xpt_ops->xpo_prep_reply_hdr(rqstp);
  714. rqstp->rq_xid = svc_getu32(argv);
  715. svc_putu32(resv, rqstp->rq_xid);
  716. dir = svc_getnl(argv);
  717. vers = svc_getnl(argv);
  718. /* First words of reply: */
  719. svc_putnl(resv, 1); /* REPLY */
  720. if (dir != 0) /* direction != CALL */
  721. goto err_bad_dir;
  722. if (vers != 2) /* RPC version number */
  723. goto err_bad_rpc;
  724. /* Save position in case we later decide to reject: */
  725. reply_statp = resv->iov_base + resv->iov_len;
  726. svc_putnl(resv, 0); /* ACCEPT */
  727. rqstp->rq_prog = prog = svc_getnl(argv); /* program number */
  728. rqstp->rq_vers = vers = svc_getnl(argv); /* version number */
  729. rqstp->rq_proc = proc = svc_getnl(argv); /* procedure number */
  730. progp = serv->sv_program;
  731. for (progp = serv->sv_program; progp; progp = progp->pg_next)
  732. if (prog == progp->pg_prog)
  733. break;
  734. /*
  735. * Decode auth data, and add verifier to reply buffer.
  736. * We do this before anything else in order to get a decent
  737. * auth verifier.
  738. */
  739. auth_res = svc_authenticate(rqstp, &auth_stat);
  740. /* Also give the program a chance to reject this call: */
  741. if (auth_res == SVC_OK && progp) {
  742. auth_stat = rpc_autherr_badcred;
  743. auth_res = progp->pg_authenticate(rqstp);
  744. }
  745. switch (auth_res) {
  746. case SVC_OK:
  747. break;
  748. case SVC_GARBAGE:
  749. goto err_garbage;
  750. case SVC_SYSERR:
  751. rpc_stat = rpc_system_err;
  752. goto err_bad;
  753. case SVC_DENIED:
  754. goto err_bad_auth;
  755. case SVC_DROP:
  756. goto dropit;
  757. case SVC_COMPLETE:
  758. goto sendit;
  759. }
  760. if (progp == NULL)
  761. goto err_bad_prog;
  762. if (vers >= progp->pg_nvers ||
  763. !(versp = progp->pg_vers[vers]))
  764. goto err_bad_vers;
  765. procp = versp->vs_proc + proc;
  766. if (proc >= versp->vs_nproc || !procp->pc_func)
  767. goto err_bad_proc;
  768. rqstp->rq_server = serv;
  769. rqstp->rq_procinfo = procp;
  770. /* Syntactic check complete */
  771. serv->sv_stats->rpccnt++;
  772. /* Build the reply header. */
  773. statp = resv->iov_base +resv->iov_len;
  774. svc_putnl(resv, RPC_SUCCESS);
  775. /* Bump per-procedure stats counter */
  776. procp->pc_count++;
  777. /* Initialize storage for argp and resp */
  778. memset(rqstp->rq_argp, 0, procp->pc_argsize);
  779. memset(rqstp->rq_resp, 0, procp->pc_ressize);
  780. /* un-reserve some of the out-queue now that we have a
  781. * better idea of reply size
  782. */
  783. if (procp->pc_xdrressize)
  784. svc_reserve_auth(rqstp, procp->pc_xdrressize<<2);
  785. /* Call the function that processes the request. */
  786. if (!versp->vs_dispatch) {
  787. /* Decode arguments */
  788. xdr = procp->pc_decode;
  789. if (xdr && !xdr(rqstp, argv->iov_base, rqstp->rq_argp))
  790. goto err_garbage;
  791. *statp = procp->pc_func(rqstp, rqstp->rq_argp, rqstp->rq_resp);
  792. /* Encode reply */
  793. if (*statp == rpc_drop_reply) {
  794. if (procp->pc_release)
  795. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  796. goto dropit;
  797. }
  798. if (*statp == rpc_success && (xdr = procp->pc_encode)
  799. && !xdr(rqstp, resv->iov_base+resv->iov_len, rqstp->rq_resp)) {
  800. dprintk("svc: failed to encode reply\n");
  801. /* serv->sv_stats->rpcsystemerr++; */
  802. *statp = rpc_system_err;
  803. }
  804. } else {
  805. dprintk("svc: calling dispatcher\n");
  806. if (!versp->vs_dispatch(rqstp, statp)) {
  807. /* Release reply info */
  808. if (procp->pc_release)
  809. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  810. goto dropit;
  811. }
  812. }
  813. /* Check RPC status result */
  814. if (*statp != rpc_success)
  815. resv->iov_len = ((void*)statp) - resv->iov_base + 4;
  816. /* Release reply info */
  817. if (procp->pc_release)
  818. procp->pc_release(rqstp, NULL, rqstp->rq_resp);
  819. if (procp->pc_encode == NULL)
  820. goto dropit;
  821. sendit:
  822. if (svc_authorise(rqstp))
  823. goto dropit;
  824. return svc_send(rqstp);
  825. dropit:
  826. svc_authorise(rqstp); /* doesn't hurt to call this twice */
  827. dprintk("svc: svc_process dropit\n");
  828. svc_drop(rqstp);
  829. return 0;
  830. err_short_len:
  831. svc_printk(rqstp, "short len %Zd, dropping request\n",
  832. argv->iov_len);
  833. goto dropit; /* drop request */
  834. err_bad_dir:
  835. svc_printk(rqstp, "bad direction %d, dropping request\n", dir);
  836. serv->sv_stats->rpcbadfmt++;
  837. goto dropit; /* drop request */
  838. err_bad_rpc:
  839. serv->sv_stats->rpcbadfmt++;
  840. svc_putnl(resv, 1); /* REJECT */
  841. svc_putnl(resv, 0); /* RPC_MISMATCH */
  842. svc_putnl(resv, 2); /* Only RPCv2 supported */
  843. svc_putnl(resv, 2);
  844. goto sendit;
  845. err_bad_auth:
  846. dprintk("svc: authentication failed (%d)\n", ntohl(auth_stat));
  847. serv->sv_stats->rpcbadauth++;
  848. /* Restore write pointer to location of accept status: */
  849. xdr_ressize_check(rqstp, reply_statp);
  850. svc_putnl(resv, 1); /* REJECT */
  851. svc_putnl(resv, 1); /* AUTH_ERROR */
  852. svc_putnl(resv, ntohl(auth_stat)); /* status */
  853. goto sendit;
  854. err_bad_prog:
  855. dprintk("svc: unknown program %d\n", prog);
  856. serv->sv_stats->rpcbadfmt++;
  857. svc_putnl(resv, RPC_PROG_UNAVAIL);
  858. goto sendit;
  859. err_bad_vers:
  860. svc_printk(rqstp, "unknown version (%d for prog %d, %s)\n",
  861. vers, prog, progp->pg_name);
  862. serv->sv_stats->rpcbadfmt++;
  863. svc_putnl(resv, RPC_PROG_MISMATCH);
  864. svc_putnl(resv, progp->pg_lovers);
  865. svc_putnl(resv, progp->pg_hivers);
  866. goto sendit;
  867. err_bad_proc:
  868. svc_printk(rqstp, "unknown procedure (%d)\n", proc);
  869. serv->sv_stats->rpcbadfmt++;
  870. svc_putnl(resv, RPC_PROC_UNAVAIL);
  871. goto sendit;
  872. err_garbage:
  873. svc_printk(rqstp, "failed to decode args\n");
  874. rpc_stat = rpc_garbage_args;
  875. err_bad:
  876. serv->sv_stats->rpcbadfmt++;
  877. svc_putnl(resv, ntohl(rpc_stat));
  878. goto sendit;
  879. }
  880. EXPORT_SYMBOL(svc_process);
  881. /*
  882. * Return (transport-specific) limit on the rpc payload.
  883. */
  884. u32 svc_max_payload(const struct svc_rqst *rqstp)
  885. {
  886. u32 max = rqstp->rq_xprt->xpt_class->xcl_max_payload;
  887. if (rqstp->rq_server->sv_max_payload < max)
  888. max = rqstp->rq_server->sv_max_payload;
  889. return max;
  890. }
  891. EXPORT_SYMBOL_GPL(svc_max_payload);