dm-mpath.c 37 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645
  1. /*
  2. * Copyright (C) 2003 Sistina Software Limited.
  3. * Copyright (C) 2004-2005 Red Hat, Inc. All rights reserved.
  4. *
  5. * This file is released under the GPL.
  6. */
  7. #include <linux/device-mapper.h>
  8. #include "dm-path-selector.h"
  9. #include "dm-uevent.h"
  10. #include <linux/ctype.h>
  11. #include <linux/init.h>
  12. #include <linux/mempool.h>
  13. #include <linux/module.h>
  14. #include <linux/pagemap.h>
  15. #include <linux/slab.h>
  16. #include <linux/time.h>
  17. #include <linux/workqueue.h>
  18. #include <scsi/scsi_dh.h>
  19. #include <asm/atomic.h>
  20. #define DM_MSG_PREFIX "multipath"
  21. #define MESG_STR(x) x, sizeof(x)
  22. /* Path properties */
  23. struct pgpath {
  24. struct list_head list;
  25. struct priority_group *pg; /* Owning PG */
  26. unsigned is_active; /* Path status */
  27. unsigned fail_count; /* Cumulative failure count */
  28. struct dm_path path;
  29. struct work_struct deactivate_path;
  30. struct work_struct activate_path;
  31. };
  32. #define path_to_pgpath(__pgp) container_of((__pgp), struct pgpath, path)
  33. /*
  34. * Paths are grouped into Priority Groups and numbered from 1 upwards.
  35. * Each has a path selector which controls which path gets used.
  36. */
  37. struct priority_group {
  38. struct list_head list;
  39. struct multipath *m; /* Owning multipath instance */
  40. struct path_selector ps;
  41. unsigned pg_num; /* Reference number */
  42. unsigned bypassed; /* Temporarily bypass this PG? */
  43. unsigned nr_pgpaths; /* Number of paths in PG */
  44. struct list_head pgpaths;
  45. };
  46. /* Multipath context */
  47. struct multipath {
  48. struct list_head list;
  49. struct dm_target *ti;
  50. spinlock_t lock;
  51. const char *hw_handler_name;
  52. char *hw_handler_params;
  53. unsigned nr_priority_groups;
  54. struct list_head priority_groups;
  55. unsigned pg_init_required; /* pg_init needs calling? */
  56. unsigned pg_init_in_progress; /* Only one pg_init allowed at once */
  57. unsigned nr_valid_paths; /* Total number of usable paths */
  58. struct pgpath *current_pgpath;
  59. struct priority_group *current_pg;
  60. struct priority_group *next_pg; /* Switch to this PG if set */
  61. unsigned repeat_count; /* I/Os left before calling PS again */
  62. unsigned queue_io; /* Must we queue all I/O? */
  63. unsigned queue_if_no_path; /* Queue I/O if last path fails? */
  64. unsigned saved_queue_if_no_path;/* Saved state during suspension */
  65. unsigned pg_init_retries; /* Number of times to retry pg_init */
  66. unsigned pg_init_count; /* Number of times pg_init called */
  67. struct work_struct process_queued_ios;
  68. struct list_head queued_ios;
  69. unsigned queue_size;
  70. struct work_struct trigger_event;
  71. /*
  72. * We must use a mempool of dm_mpath_io structs so that we
  73. * can resubmit bios on error.
  74. */
  75. mempool_t *mpio_pool;
  76. };
  77. /*
  78. * Context information attached to each bio we process.
  79. */
  80. struct dm_mpath_io {
  81. struct pgpath *pgpath;
  82. size_t nr_bytes;
  83. };
  84. typedef int (*action_fn) (struct pgpath *pgpath);
  85. #define MIN_IOS 256 /* Mempool size */
  86. static struct kmem_cache *_mpio_cache;
  87. static struct workqueue_struct *kmultipathd, *kmpath_handlerd;
  88. static void process_queued_ios(struct work_struct *work);
  89. static void trigger_event(struct work_struct *work);
  90. static void activate_path(struct work_struct *work);
  91. static void deactivate_path(struct work_struct *work);
  92. /*-----------------------------------------------
  93. * Allocation routines
  94. *-----------------------------------------------*/
  95. static struct pgpath *alloc_pgpath(void)
  96. {
  97. struct pgpath *pgpath = kzalloc(sizeof(*pgpath), GFP_KERNEL);
  98. if (pgpath) {
  99. pgpath->is_active = 1;
  100. INIT_WORK(&pgpath->deactivate_path, deactivate_path);
  101. INIT_WORK(&pgpath->activate_path, activate_path);
  102. }
  103. return pgpath;
  104. }
  105. static void free_pgpath(struct pgpath *pgpath)
  106. {
  107. kfree(pgpath);
  108. }
  109. static void deactivate_path(struct work_struct *work)
  110. {
  111. struct pgpath *pgpath =
  112. container_of(work, struct pgpath, deactivate_path);
  113. blk_abort_queue(pgpath->path.dev->bdev->bd_disk->queue);
  114. }
  115. static struct priority_group *alloc_priority_group(void)
  116. {
  117. struct priority_group *pg;
  118. pg = kzalloc(sizeof(*pg), GFP_KERNEL);
  119. if (pg)
  120. INIT_LIST_HEAD(&pg->pgpaths);
  121. return pg;
  122. }
  123. static void free_pgpaths(struct list_head *pgpaths, struct dm_target *ti)
  124. {
  125. struct pgpath *pgpath, *tmp;
  126. struct multipath *m = ti->private;
  127. list_for_each_entry_safe(pgpath, tmp, pgpaths, list) {
  128. list_del(&pgpath->list);
  129. if (m->hw_handler_name)
  130. scsi_dh_detach(bdev_get_queue(pgpath->path.dev->bdev));
  131. dm_put_device(ti, pgpath->path.dev);
  132. free_pgpath(pgpath);
  133. }
  134. }
  135. static void free_priority_group(struct priority_group *pg,
  136. struct dm_target *ti)
  137. {
  138. struct path_selector *ps = &pg->ps;
  139. if (ps->type) {
  140. ps->type->destroy(ps);
  141. dm_put_path_selector(ps->type);
  142. }
  143. free_pgpaths(&pg->pgpaths, ti);
  144. kfree(pg);
  145. }
  146. static struct multipath *alloc_multipath(struct dm_target *ti)
  147. {
  148. struct multipath *m;
  149. m = kzalloc(sizeof(*m), GFP_KERNEL);
  150. if (m) {
  151. INIT_LIST_HEAD(&m->priority_groups);
  152. INIT_LIST_HEAD(&m->queued_ios);
  153. spin_lock_init(&m->lock);
  154. m->queue_io = 1;
  155. INIT_WORK(&m->process_queued_ios, process_queued_ios);
  156. INIT_WORK(&m->trigger_event, trigger_event);
  157. m->mpio_pool = mempool_create_slab_pool(MIN_IOS, _mpio_cache);
  158. if (!m->mpio_pool) {
  159. kfree(m);
  160. return NULL;
  161. }
  162. m->ti = ti;
  163. ti->private = m;
  164. }
  165. return m;
  166. }
  167. static void free_multipath(struct multipath *m)
  168. {
  169. struct priority_group *pg, *tmp;
  170. list_for_each_entry_safe(pg, tmp, &m->priority_groups, list) {
  171. list_del(&pg->list);
  172. free_priority_group(pg, m->ti);
  173. }
  174. kfree(m->hw_handler_name);
  175. kfree(m->hw_handler_params);
  176. mempool_destroy(m->mpio_pool);
  177. kfree(m);
  178. }
  179. /*-----------------------------------------------
  180. * Path selection
  181. *-----------------------------------------------*/
  182. static void __switch_pg(struct multipath *m, struct pgpath *pgpath)
  183. {
  184. m->current_pg = pgpath->pg;
  185. /* Must we initialise the PG first, and queue I/O till it's ready? */
  186. if (m->hw_handler_name) {
  187. m->pg_init_required = 1;
  188. m->queue_io = 1;
  189. } else {
  190. m->pg_init_required = 0;
  191. m->queue_io = 0;
  192. }
  193. m->pg_init_count = 0;
  194. }
  195. static int __choose_path_in_pg(struct multipath *m, struct priority_group *pg,
  196. size_t nr_bytes)
  197. {
  198. struct dm_path *path;
  199. path = pg->ps.type->select_path(&pg->ps, &m->repeat_count, nr_bytes);
  200. if (!path)
  201. return -ENXIO;
  202. m->current_pgpath = path_to_pgpath(path);
  203. if (m->current_pg != pg)
  204. __switch_pg(m, m->current_pgpath);
  205. return 0;
  206. }
  207. static void __choose_pgpath(struct multipath *m, size_t nr_bytes)
  208. {
  209. struct priority_group *pg;
  210. unsigned bypassed = 1;
  211. if (!m->nr_valid_paths)
  212. goto failed;
  213. /* Were we instructed to switch PG? */
  214. if (m->next_pg) {
  215. pg = m->next_pg;
  216. m->next_pg = NULL;
  217. if (!__choose_path_in_pg(m, pg, nr_bytes))
  218. return;
  219. }
  220. /* Don't change PG until it has no remaining paths */
  221. if (m->current_pg && !__choose_path_in_pg(m, m->current_pg, nr_bytes))
  222. return;
  223. /*
  224. * Loop through priority groups until we find a valid path.
  225. * First time we skip PGs marked 'bypassed'.
  226. * Second time we only try the ones we skipped.
  227. */
  228. do {
  229. list_for_each_entry(pg, &m->priority_groups, list) {
  230. if (pg->bypassed == bypassed)
  231. continue;
  232. if (!__choose_path_in_pg(m, pg, nr_bytes))
  233. return;
  234. }
  235. } while (bypassed--);
  236. failed:
  237. m->current_pgpath = NULL;
  238. m->current_pg = NULL;
  239. }
  240. /*
  241. * Check whether bios must be queued in the device-mapper core rather
  242. * than here in the target.
  243. *
  244. * m->lock must be held on entry.
  245. *
  246. * If m->queue_if_no_path and m->saved_queue_if_no_path hold the
  247. * same value then we are not between multipath_presuspend()
  248. * and multipath_resume() calls and we have no need to check
  249. * for the DMF_NOFLUSH_SUSPENDING flag.
  250. */
  251. static int __must_push_back(struct multipath *m)
  252. {
  253. return (m->queue_if_no_path != m->saved_queue_if_no_path &&
  254. dm_noflush_suspending(m->ti));
  255. }
  256. static int map_io(struct multipath *m, struct request *clone,
  257. struct dm_mpath_io *mpio, unsigned was_queued)
  258. {
  259. int r = DM_MAPIO_REMAPPED;
  260. size_t nr_bytes = blk_rq_bytes(clone);
  261. unsigned long flags;
  262. struct pgpath *pgpath;
  263. struct block_device *bdev;
  264. spin_lock_irqsave(&m->lock, flags);
  265. /* Do we need to select a new pgpath? */
  266. if (!m->current_pgpath ||
  267. (!m->queue_io && (m->repeat_count && --m->repeat_count == 0)))
  268. __choose_pgpath(m, nr_bytes);
  269. pgpath = m->current_pgpath;
  270. if (was_queued)
  271. m->queue_size--;
  272. if ((pgpath && m->queue_io) ||
  273. (!pgpath && m->queue_if_no_path)) {
  274. /* Queue for the daemon to resubmit */
  275. list_add_tail(&clone->queuelist, &m->queued_ios);
  276. m->queue_size++;
  277. if ((m->pg_init_required && !m->pg_init_in_progress) ||
  278. !m->queue_io)
  279. queue_work(kmultipathd, &m->process_queued_ios);
  280. pgpath = NULL;
  281. r = DM_MAPIO_SUBMITTED;
  282. } else if (pgpath) {
  283. bdev = pgpath->path.dev->bdev;
  284. clone->q = bdev_get_queue(bdev);
  285. clone->rq_disk = bdev->bd_disk;
  286. } else if (__must_push_back(m))
  287. r = DM_MAPIO_REQUEUE;
  288. else
  289. r = -EIO; /* Failed */
  290. mpio->pgpath = pgpath;
  291. mpio->nr_bytes = nr_bytes;
  292. if (r == DM_MAPIO_REMAPPED && pgpath->pg->ps.type->start_io)
  293. pgpath->pg->ps.type->start_io(&pgpath->pg->ps, &pgpath->path,
  294. nr_bytes);
  295. spin_unlock_irqrestore(&m->lock, flags);
  296. return r;
  297. }
  298. /*
  299. * If we run out of usable paths, should we queue I/O or error it?
  300. */
  301. static int queue_if_no_path(struct multipath *m, unsigned queue_if_no_path,
  302. unsigned save_old_value)
  303. {
  304. unsigned long flags;
  305. spin_lock_irqsave(&m->lock, flags);
  306. if (save_old_value)
  307. m->saved_queue_if_no_path = m->queue_if_no_path;
  308. else
  309. m->saved_queue_if_no_path = queue_if_no_path;
  310. m->queue_if_no_path = queue_if_no_path;
  311. if (!m->queue_if_no_path && m->queue_size)
  312. queue_work(kmultipathd, &m->process_queued_ios);
  313. spin_unlock_irqrestore(&m->lock, flags);
  314. return 0;
  315. }
  316. /*-----------------------------------------------------------------
  317. * The multipath daemon is responsible for resubmitting queued ios.
  318. *---------------------------------------------------------------*/
  319. static void dispatch_queued_ios(struct multipath *m)
  320. {
  321. int r;
  322. unsigned long flags;
  323. struct dm_mpath_io *mpio;
  324. union map_info *info;
  325. struct request *clone, *n;
  326. LIST_HEAD(cl);
  327. spin_lock_irqsave(&m->lock, flags);
  328. list_splice_init(&m->queued_ios, &cl);
  329. spin_unlock_irqrestore(&m->lock, flags);
  330. list_for_each_entry_safe(clone, n, &cl, queuelist) {
  331. list_del_init(&clone->queuelist);
  332. info = dm_get_rq_mapinfo(clone);
  333. mpio = info->ptr;
  334. r = map_io(m, clone, mpio, 1);
  335. if (r < 0) {
  336. mempool_free(mpio, m->mpio_pool);
  337. dm_kill_unmapped_request(clone, r);
  338. } else if (r == DM_MAPIO_REMAPPED)
  339. dm_dispatch_request(clone);
  340. else if (r == DM_MAPIO_REQUEUE) {
  341. mempool_free(mpio, m->mpio_pool);
  342. dm_requeue_unmapped_request(clone);
  343. }
  344. }
  345. }
  346. static void process_queued_ios(struct work_struct *work)
  347. {
  348. struct multipath *m =
  349. container_of(work, struct multipath, process_queued_ios);
  350. struct pgpath *pgpath = NULL, *tmp;
  351. unsigned must_queue = 1;
  352. unsigned long flags;
  353. spin_lock_irqsave(&m->lock, flags);
  354. if (!m->queue_size)
  355. goto out;
  356. if (!m->current_pgpath)
  357. __choose_pgpath(m, 0);
  358. pgpath = m->current_pgpath;
  359. if ((pgpath && !m->queue_io) ||
  360. (!pgpath && !m->queue_if_no_path))
  361. must_queue = 0;
  362. if (m->pg_init_required && !m->pg_init_in_progress && pgpath) {
  363. m->pg_init_count++;
  364. m->pg_init_required = 0;
  365. list_for_each_entry(tmp, &pgpath->pg->pgpaths, list) {
  366. if (queue_work(kmpath_handlerd, &tmp->activate_path))
  367. m->pg_init_in_progress++;
  368. }
  369. }
  370. out:
  371. spin_unlock_irqrestore(&m->lock, flags);
  372. if (!must_queue)
  373. dispatch_queued_ios(m);
  374. }
  375. /*
  376. * An event is triggered whenever a path is taken out of use.
  377. * Includes path failure and PG bypass.
  378. */
  379. static void trigger_event(struct work_struct *work)
  380. {
  381. struct multipath *m =
  382. container_of(work, struct multipath, trigger_event);
  383. dm_table_event(m->ti->table);
  384. }
  385. /*-----------------------------------------------------------------
  386. * Constructor/argument parsing:
  387. * <#multipath feature args> [<arg>]*
  388. * <#hw_handler args> [hw_handler [<arg>]*]
  389. * <#priority groups>
  390. * <initial priority group>
  391. * [<selector> <#selector args> [<arg>]*
  392. * <#paths> <#per-path selector args>
  393. * [<path> [<arg>]* ]+ ]+
  394. *---------------------------------------------------------------*/
  395. struct param {
  396. unsigned min;
  397. unsigned max;
  398. char *error;
  399. };
  400. static int read_param(struct param *param, char *str, unsigned *v, char **error)
  401. {
  402. if (!str ||
  403. (sscanf(str, "%u", v) != 1) ||
  404. (*v < param->min) ||
  405. (*v > param->max)) {
  406. *error = param->error;
  407. return -EINVAL;
  408. }
  409. return 0;
  410. }
  411. struct arg_set {
  412. unsigned argc;
  413. char **argv;
  414. };
  415. static char *shift(struct arg_set *as)
  416. {
  417. char *r;
  418. if (as->argc) {
  419. as->argc--;
  420. r = *as->argv;
  421. as->argv++;
  422. return r;
  423. }
  424. return NULL;
  425. }
  426. static void consume(struct arg_set *as, unsigned n)
  427. {
  428. BUG_ON (as->argc < n);
  429. as->argc -= n;
  430. as->argv += n;
  431. }
  432. static int parse_path_selector(struct arg_set *as, struct priority_group *pg,
  433. struct dm_target *ti)
  434. {
  435. int r;
  436. struct path_selector_type *pst;
  437. unsigned ps_argc;
  438. static struct param _params[] = {
  439. {0, 1024, "invalid number of path selector args"},
  440. };
  441. pst = dm_get_path_selector(shift(as));
  442. if (!pst) {
  443. ti->error = "unknown path selector type";
  444. return -EINVAL;
  445. }
  446. r = read_param(_params, shift(as), &ps_argc, &ti->error);
  447. if (r) {
  448. dm_put_path_selector(pst);
  449. return -EINVAL;
  450. }
  451. if (ps_argc > as->argc) {
  452. dm_put_path_selector(pst);
  453. ti->error = "not enough arguments for path selector";
  454. return -EINVAL;
  455. }
  456. r = pst->create(&pg->ps, ps_argc, as->argv);
  457. if (r) {
  458. dm_put_path_selector(pst);
  459. ti->error = "path selector constructor failed";
  460. return r;
  461. }
  462. pg->ps.type = pst;
  463. consume(as, ps_argc);
  464. return 0;
  465. }
  466. static struct pgpath *parse_path(struct arg_set *as, struct path_selector *ps,
  467. struct dm_target *ti)
  468. {
  469. int r;
  470. struct pgpath *p;
  471. struct multipath *m = ti->private;
  472. /* we need at least a path arg */
  473. if (as->argc < 1) {
  474. ti->error = "no device given";
  475. return ERR_PTR(-EINVAL);
  476. }
  477. p = alloc_pgpath();
  478. if (!p)
  479. return ERR_PTR(-ENOMEM);
  480. r = dm_get_device(ti, shift(as), ti->begin, ti->len,
  481. dm_table_get_mode(ti->table), &p->path.dev);
  482. if (r) {
  483. ti->error = "error getting device";
  484. goto bad;
  485. }
  486. if (m->hw_handler_name) {
  487. struct request_queue *q = bdev_get_queue(p->path.dev->bdev);
  488. r = scsi_dh_attach(q, m->hw_handler_name);
  489. if (r == -EBUSY) {
  490. /*
  491. * Already attached to different hw_handler,
  492. * try to reattach with correct one.
  493. */
  494. scsi_dh_detach(q);
  495. r = scsi_dh_attach(q, m->hw_handler_name);
  496. }
  497. if (r < 0) {
  498. ti->error = "error attaching hardware handler";
  499. dm_put_device(ti, p->path.dev);
  500. goto bad;
  501. }
  502. if (m->hw_handler_params) {
  503. r = scsi_dh_set_params(q, m->hw_handler_params);
  504. if (r < 0) {
  505. ti->error = "unable to set hardware "
  506. "handler parameters";
  507. scsi_dh_detach(q);
  508. dm_put_device(ti, p->path.dev);
  509. goto bad;
  510. }
  511. }
  512. }
  513. r = ps->type->add_path(ps, &p->path, as->argc, as->argv, &ti->error);
  514. if (r) {
  515. dm_put_device(ti, p->path.dev);
  516. goto bad;
  517. }
  518. return p;
  519. bad:
  520. free_pgpath(p);
  521. return ERR_PTR(r);
  522. }
  523. static struct priority_group *parse_priority_group(struct arg_set *as,
  524. struct multipath *m)
  525. {
  526. static struct param _params[] = {
  527. {1, 1024, "invalid number of paths"},
  528. {0, 1024, "invalid number of selector args"}
  529. };
  530. int r;
  531. unsigned i, nr_selector_args, nr_params;
  532. struct priority_group *pg;
  533. struct dm_target *ti = m->ti;
  534. if (as->argc < 2) {
  535. as->argc = 0;
  536. ti->error = "not enough priority group arguments";
  537. return ERR_PTR(-EINVAL);
  538. }
  539. pg = alloc_priority_group();
  540. if (!pg) {
  541. ti->error = "couldn't allocate priority group";
  542. return ERR_PTR(-ENOMEM);
  543. }
  544. pg->m = m;
  545. r = parse_path_selector(as, pg, ti);
  546. if (r)
  547. goto bad;
  548. /*
  549. * read the paths
  550. */
  551. r = read_param(_params, shift(as), &pg->nr_pgpaths, &ti->error);
  552. if (r)
  553. goto bad;
  554. r = read_param(_params + 1, shift(as), &nr_selector_args, &ti->error);
  555. if (r)
  556. goto bad;
  557. nr_params = 1 + nr_selector_args;
  558. for (i = 0; i < pg->nr_pgpaths; i++) {
  559. struct pgpath *pgpath;
  560. struct arg_set path_args;
  561. if (as->argc < nr_params) {
  562. ti->error = "not enough path parameters";
  563. goto bad;
  564. }
  565. path_args.argc = nr_params;
  566. path_args.argv = as->argv;
  567. pgpath = parse_path(&path_args, &pg->ps, ti);
  568. if (IS_ERR(pgpath)) {
  569. r = PTR_ERR(pgpath);
  570. goto bad;
  571. }
  572. pgpath->pg = pg;
  573. list_add_tail(&pgpath->list, &pg->pgpaths);
  574. consume(as, nr_params);
  575. }
  576. return pg;
  577. bad:
  578. free_priority_group(pg, ti);
  579. return ERR_PTR(r);
  580. }
  581. static int parse_hw_handler(struct arg_set *as, struct multipath *m)
  582. {
  583. unsigned hw_argc;
  584. int ret;
  585. struct dm_target *ti = m->ti;
  586. static struct param _params[] = {
  587. {0, 1024, "invalid number of hardware handler args"},
  588. };
  589. if (read_param(_params, shift(as), &hw_argc, &ti->error))
  590. return -EINVAL;
  591. if (!hw_argc)
  592. return 0;
  593. if (hw_argc > as->argc) {
  594. ti->error = "not enough arguments for hardware handler";
  595. return -EINVAL;
  596. }
  597. m->hw_handler_name = kstrdup(shift(as), GFP_KERNEL);
  598. request_module("scsi_dh_%s", m->hw_handler_name);
  599. if (scsi_dh_handler_exist(m->hw_handler_name) == 0) {
  600. ti->error = "unknown hardware handler type";
  601. ret = -EINVAL;
  602. goto fail;
  603. }
  604. if (hw_argc > 1) {
  605. char *p;
  606. int i, j, len = 4;
  607. for (i = 0; i <= hw_argc - 2; i++)
  608. len += strlen(as->argv[i]) + 1;
  609. p = m->hw_handler_params = kzalloc(len, GFP_KERNEL);
  610. if (!p) {
  611. ti->error = "memory allocation failed";
  612. ret = -ENOMEM;
  613. goto fail;
  614. }
  615. j = sprintf(p, "%d", hw_argc - 1);
  616. for (i = 0, p+=j+1; i <= hw_argc - 2; i++, p+=j+1)
  617. j = sprintf(p, "%s", as->argv[i]);
  618. }
  619. consume(as, hw_argc - 1);
  620. return 0;
  621. fail:
  622. kfree(m->hw_handler_name);
  623. m->hw_handler_name = NULL;
  624. return ret;
  625. }
  626. static int parse_features(struct arg_set *as, struct multipath *m)
  627. {
  628. int r;
  629. unsigned argc;
  630. struct dm_target *ti = m->ti;
  631. const char *param_name;
  632. static struct param _params[] = {
  633. {0, 3, "invalid number of feature args"},
  634. {1, 50, "pg_init_retries must be between 1 and 50"},
  635. };
  636. r = read_param(_params, shift(as), &argc, &ti->error);
  637. if (r)
  638. return -EINVAL;
  639. if (!argc)
  640. return 0;
  641. do {
  642. param_name = shift(as);
  643. argc--;
  644. if (!strnicmp(param_name, MESG_STR("queue_if_no_path"))) {
  645. r = queue_if_no_path(m, 1, 0);
  646. continue;
  647. }
  648. if (!strnicmp(param_name, MESG_STR("pg_init_retries")) &&
  649. (argc >= 1)) {
  650. r = read_param(_params + 1, shift(as),
  651. &m->pg_init_retries, &ti->error);
  652. argc--;
  653. continue;
  654. }
  655. ti->error = "Unrecognised multipath feature request";
  656. r = -EINVAL;
  657. } while (argc && !r);
  658. return r;
  659. }
  660. static int multipath_ctr(struct dm_target *ti, unsigned int argc,
  661. char **argv)
  662. {
  663. /* target parameters */
  664. static struct param _params[] = {
  665. {1, 1024, "invalid number of priority groups"},
  666. {1, 1024, "invalid initial priority group number"},
  667. };
  668. int r;
  669. struct multipath *m;
  670. struct arg_set as;
  671. unsigned pg_count = 0;
  672. unsigned next_pg_num;
  673. as.argc = argc;
  674. as.argv = argv;
  675. m = alloc_multipath(ti);
  676. if (!m) {
  677. ti->error = "can't allocate multipath";
  678. return -EINVAL;
  679. }
  680. r = parse_features(&as, m);
  681. if (r)
  682. goto bad;
  683. r = parse_hw_handler(&as, m);
  684. if (r)
  685. goto bad;
  686. r = read_param(_params, shift(&as), &m->nr_priority_groups, &ti->error);
  687. if (r)
  688. goto bad;
  689. r = read_param(_params + 1, shift(&as), &next_pg_num, &ti->error);
  690. if (r)
  691. goto bad;
  692. /* parse the priority groups */
  693. while (as.argc) {
  694. struct priority_group *pg;
  695. pg = parse_priority_group(&as, m);
  696. if (IS_ERR(pg)) {
  697. r = PTR_ERR(pg);
  698. goto bad;
  699. }
  700. m->nr_valid_paths += pg->nr_pgpaths;
  701. list_add_tail(&pg->list, &m->priority_groups);
  702. pg_count++;
  703. pg->pg_num = pg_count;
  704. if (!--next_pg_num)
  705. m->next_pg = pg;
  706. }
  707. if (pg_count != m->nr_priority_groups) {
  708. ti->error = "priority group count mismatch";
  709. r = -EINVAL;
  710. goto bad;
  711. }
  712. ti->num_flush_requests = 1;
  713. return 0;
  714. bad:
  715. free_multipath(m);
  716. return r;
  717. }
  718. static void multipath_dtr(struct dm_target *ti)
  719. {
  720. struct multipath *m = (struct multipath *) ti->private;
  721. flush_workqueue(kmpath_handlerd);
  722. flush_workqueue(kmultipathd);
  723. flush_scheduled_work();
  724. free_multipath(m);
  725. }
  726. /*
  727. * Map cloned requests
  728. */
  729. static int multipath_map(struct dm_target *ti, struct request *clone,
  730. union map_info *map_context)
  731. {
  732. int r;
  733. struct dm_mpath_io *mpio;
  734. struct multipath *m = (struct multipath *) ti->private;
  735. mpio = mempool_alloc(m->mpio_pool, GFP_ATOMIC);
  736. if (!mpio)
  737. /* ENOMEM, requeue */
  738. return DM_MAPIO_REQUEUE;
  739. memset(mpio, 0, sizeof(*mpio));
  740. map_context->ptr = mpio;
  741. clone->cmd_flags |= REQ_FAILFAST_TRANSPORT;
  742. r = map_io(m, clone, mpio, 0);
  743. if (r < 0 || r == DM_MAPIO_REQUEUE)
  744. mempool_free(mpio, m->mpio_pool);
  745. return r;
  746. }
  747. /*
  748. * Take a path out of use.
  749. */
  750. static int fail_path(struct pgpath *pgpath)
  751. {
  752. unsigned long flags;
  753. struct multipath *m = pgpath->pg->m;
  754. spin_lock_irqsave(&m->lock, flags);
  755. if (!pgpath->is_active)
  756. goto out;
  757. DMWARN("Failing path %s.", pgpath->path.dev->name);
  758. pgpath->pg->ps.type->fail_path(&pgpath->pg->ps, &pgpath->path);
  759. pgpath->is_active = 0;
  760. pgpath->fail_count++;
  761. m->nr_valid_paths--;
  762. if (pgpath == m->current_pgpath)
  763. m->current_pgpath = NULL;
  764. dm_path_uevent(DM_UEVENT_PATH_FAILED, m->ti,
  765. pgpath->path.dev->name, m->nr_valid_paths);
  766. schedule_work(&m->trigger_event);
  767. queue_work(kmultipathd, &pgpath->deactivate_path);
  768. out:
  769. spin_unlock_irqrestore(&m->lock, flags);
  770. return 0;
  771. }
  772. /*
  773. * Reinstate a previously-failed path
  774. */
  775. static int reinstate_path(struct pgpath *pgpath)
  776. {
  777. int r = 0;
  778. unsigned long flags;
  779. struct multipath *m = pgpath->pg->m;
  780. spin_lock_irqsave(&m->lock, flags);
  781. if (pgpath->is_active)
  782. goto out;
  783. if (!pgpath->pg->ps.type->reinstate_path) {
  784. DMWARN("Reinstate path not supported by path selector %s",
  785. pgpath->pg->ps.type->name);
  786. r = -EINVAL;
  787. goto out;
  788. }
  789. r = pgpath->pg->ps.type->reinstate_path(&pgpath->pg->ps, &pgpath->path);
  790. if (r)
  791. goto out;
  792. pgpath->is_active = 1;
  793. if (!m->nr_valid_paths++ && m->queue_size) {
  794. m->current_pgpath = NULL;
  795. queue_work(kmultipathd, &m->process_queued_ios);
  796. } else if (m->hw_handler_name && (m->current_pg == pgpath->pg)) {
  797. if (queue_work(kmpath_handlerd, &pgpath->activate_path))
  798. m->pg_init_in_progress++;
  799. }
  800. dm_path_uevent(DM_UEVENT_PATH_REINSTATED, m->ti,
  801. pgpath->path.dev->name, m->nr_valid_paths);
  802. schedule_work(&m->trigger_event);
  803. out:
  804. spin_unlock_irqrestore(&m->lock, flags);
  805. return r;
  806. }
  807. /*
  808. * Fail or reinstate all paths that match the provided struct dm_dev.
  809. */
  810. static int action_dev(struct multipath *m, struct dm_dev *dev,
  811. action_fn action)
  812. {
  813. int r = 0;
  814. struct pgpath *pgpath;
  815. struct priority_group *pg;
  816. list_for_each_entry(pg, &m->priority_groups, list) {
  817. list_for_each_entry(pgpath, &pg->pgpaths, list) {
  818. if (pgpath->path.dev == dev)
  819. r = action(pgpath);
  820. }
  821. }
  822. return r;
  823. }
  824. /*
  825. * Temporarily try to avoid having to use the specified PG
  826. */
  827. static void bypass_pg(struct multipath *m, struct priority_group *pg,
  828. int bypassed)
  829. {
  830. unsigned long flags;
  831. spin_lock_irqsave(&m->lock, flags);
  832. pg->bypassed = bypassed;
  833. m->current_pgpath = NULL;
  834. m->current_pg = NULL;
  835. spin_unlock_irqrestore(&m->lock, flags);
  836. schedule_work(&m->trigger_event);
  837. }
  838. /*
  839. * Switch to using the specified PG from the next I/O that gets mapped
  840. */
  841. static int switch_pg_num(struct multipath *m, const char *pgstr)
  842. {
  843. struct priority_group *pg;
  844. unsigned pgnum;
  845. unsigned long flags;
  846. if (!pgstr || (sscanf(pgstr, "%u", &pgnum) != 1) || !pgnum ||
  847. (pgnum > m->nr_priority_groups)) {
  848. DMWARN("invalid PG number supplied to switch_pg_num");
  849. return -EINVAL;
  850. }
  851. spin_lock_irqsave(&m->lock, flags);
  852. list_for_each_entry(pg, &m->priority_groups, list) {
  853. pg->bypassed = 0;
  854. if (--pgnum)
  855. continue;
  856. m->current_pgpath = NULL;
  857. m->current_pg = NULL;
  858. m->next_pg = pg;
  859. }
  860. spin_unlock_irqrestore(&m->lock, flags);
  861. schedule_work(&m->trigger_event);
  862. return 0;
  863. }
  864. /*
  865. * Set/clear bypassed status of a PG.
  866. * PGs are numbered upwards from 1 in the order they were declared.
  867. */
  868. static int bypass_pg_num(struct multipath *m, const char *pgstr, int bypassed)
  869. {
  870. struct priority_group *pg;
  871. unsigned pgnum;
  872. if (!pgstr || (sscanf(pgstr, "%u", &pgnum) != 1) || !pgnum ||
  873. (pgnum > m->nr_priority_groups)) {
  874. DMWARN("invalid PG number supplied to bypass_pg");
  875. return -EINVAL;
  876. }
  877. list_for_each_entry(pg, &m->priority_groups, list) {
  878. if (!--pgnum)
  879. break;
  880. }
  881. bypass_pg(m, pg, bypassed);
  882. return 0;
  883. }
  884. /*
  885. * Should we retry pg_init immediately?
  886. */
  887. static int pg_init_limit_reached(struct multipath *m, struct pgpath *pgpath)
  888. {
  889. unsigned long flags;
  890. int limit_reached = 0;
  891. spin_lock_irqsave(&m->lock, flags);
  892. if (m->pg_init_count <= m->pg_init_retries)
  893. m->pg_init_required = 1;
  894. else
  895. limit_reached = 1;
  896. spin_unlock_irqrestore(&m->lock, flags);
  897. return limit_reached;
  898. }
  899. static void pg_init_done(void *data, int errors)
  900. {
  901. struct dm_path *path = data;
  902. struct pgpath *pgpath = path_to_pgpath(path);
  903. struct priority_group *pg = pgpath->pg;
  904. struct multipath *m = pg->m;
  905. unsigned long flags;
  906. /* device or driver problems */
  907. switch (errors) {
  908. case SCSI_DH_OK:
  909. break;
  910. case SCSI_DH_NOSYS:
  911. if (!m->hw_handler_name) {
  912. errors = 0;
  913. break;
  914. }
  915. DMERR("Cannot failover device because scsi_dh_%s was not "
  916. "loaded.", m->hw_handler_name);
  917. /*
  918. * Fail path for now, so we do not ping pong
  919. */
  920. fail_path(pgpath);
  921. break;
  922. case SCSI_DH_DEV_TEMP_BUSY:
  923. /*
  924. * Probably doing something like FW upgrade on the
  925. * controller so try the other pg.
  926. */
  927. bypass_pg(m, pg, 1);
  928. break;
  929. /* TODO: For SCSI_DH_RETRY we should wait a couple seconds */
  930. case SCSI_DH_RETRY:
  931. case SCSI_DH_IMM_RETRY:
  932. case SCSI_DH_RES_TEMP_UNAVAIL:
  933. if (pg_init_limit_reached(m, pgpath))
  934. fail_path(pgpath);
  935. errors = 0;
  936. break;
  937. default:
  938. /*
  939. * We probably do not want to fail the path for a device
  940. * error, but this is what the old dm did. In future
  941. * patches we can do more advanced handling.
  942. */
  943. fail_path(pgpath);
  944. }
  945. spin_lock_irqsave(&m->lock, flags);
  946. if (errors) {
  947. if (pgpath == m->current_pgpath) {
  948. DMERR("Could not failover device. Error %d.", errors);
  949. m->current_pgpath = NULL;
  950. m->current_pg = NULL;
  951. }
  952. } else if (!m->pg_init_required) {
  953. m->queue_io = 0;
  954. pg->bypassed = 0;
  955. }
  956. m->pg_init_in_progress--;
  957. if (!m->pg_init_in_progress)
  958. queue_work(kmultipathd, &m->process_queued_ios);
  959. spin_unlock_irqrestore(&m->lock, flags);
  960. }
  961. static void activate_path(struct work_struct *work)
  962. {
  963. struct pgpath *pgpath =
  964. container_of(work, struct pgpath, activate_path);
  965. scsi_dh_activate(bdev_get_queue(pgpath->path.dev->bdev),
  966. pg_init_done, &pgpath->path);
  967. }
  968. /*
  969. * end_io handling
  970. */
  971. static int do_end_io(struct multipath *m, struct request *clone,
  972. int error, struct dm_mpath_io *mpio)
  973. {
  974. /*
  975. * We don't queue any clone request inside the multipath target
  976. * during end I/O handling, since those clone requests don't have
  977. * bio clones. If we queue them inside the multipath target,
  978. * we need to make bio clones, that requires memory allocation.
  979. * (See drivers/md/dm.c:end_clone_bio() about why the clone requests
  980. * don't have bio clones.)
  981. * Instead of queueing the clone request here, we queue the original
  982. * request into dm core, which will remake a clone request and
  983. * clone bios for it and resubmit it later.
  984. */
  985. int r = DM_ENDIO_REQUEUE;
  986. unsigned long flags;
  987. if (!error && !clone->errors)
  988. return 0; /* I/O complete */
  989. if (error == -EOPNOTSUPP)
  990. return error;
  991. if (mpio->pgpath)
  992. fail_path(mpio->pgpath);
  993. spin_lock_irqsave(&m->lock, flags);
  994. if (!m->nr_valid_paths && !m->queue_if_no_path && !__must_push_back(m))
  995. r = -EIO;
  996. spin_unlock_irqrestore(&m->lock, flags);
  997. return r;
  998. }
  999. static int multipath_end_io(struct dm_target *ti, struct request *clone,
  1000. int error, union map_info *map_context)
  1001. {
  1002. struct multipath *m = ti->private;
  1003. struct dm_mpath_io *mpio = map_context->ptr;
  1004. struct pgpath *pgpath = mpio->pgpath;
  1005. struct path_selector *ps;
  1006. int r;
  1007. r = do_end_io(m, clone, error, mpio);
  1008. if (pgpath) {
  1009. ps = &pgpath->pg->ps;
  1010. if (ps->type->end_io)
  1011. ps->type->end_io(ps, &pgpath->path, mpio->nr_bytes);
  1012. }
  1013. mempool_free(mpio, m->mpio_pool);
  1014. return r;
  1015. }
  1016. /*
  1017. * Suspend can't complete until all the I/O is processed so if
  1018. * the last path fails we must error any remaining I/O.
  1019. * Note that if the freeze_bdev fails while suspending, the
  1020. * queue_if_no_path state is lost - userspace should reset it.
  1021. */
  1022. static void multipath_presuspend(struct dm_target *ti)
  1023. {
  1024. struct multipath *m = (struct multipath *) ti->private;
  1025. queue_if_no_path(m, 0, 1);
  1026. }
  1027. /*
  1028. * Restore the queue_if_no_path setting.
  1029. */
  1030. static void multipath_resume(struct dm_target *ti)
  1031. {
  1032. struct multipath *m = (struct multipath *) ti->private;
  1033. unsigned long flags;
  1034. spin_lock_irqsave(&m->lock, flags);
  1035. m->queue_if_no_path = m->saved_queue_if_no_path;
  1036. spin_unlock_irqrestore(&m->lock, flags);
  1037. }
  1038. /*
  1039. * Info output has the following format:
  1040. * num_multipath_feature_args [multipath_feature_args]*
  1041. * num_handler_status_args [handler_status_args]*
  1042. * num_groups init_group_number
  1043. * [A|D|E num_ps_status_args [ps_status_args]*
  1044. * num_paths num_selector_args
  1045. * [path_dev A|F fail_count [selector_args]* ]+ ]+
  1046. *
  1047. * Table output has the following format (identical to the constructor string):
  1048. * num_feature_args [features_args]*
  1049. * num_handler_args hw_handler [hw_handler_args]*
  1050. * num_groups init_group_number
  1051. * [priority selector-name num_ps_args [ps_args]*
  1052. * num_paths num_selector_args [path_dev [selector_args]* ]+ ]+
  1053. */
  1054. static int multipath_status(struct dm_target *ti, status_type_t type,
  1055. char *result, unsigned int maxlen)
  1056. {
  1057. int sz = 0;
  1058. unsigned long flags;
  1059. struct multipath *m = (struct multipath *) ti->private;
  1060. struct priority_group *pg;
  1061. struct pgpath *p;
  1062. unsigned pg_num;
  1063. char state;
  1064. spin_lock_irqsave(&m->lock, flags);
  1065. /* Features */
  1066. if (type == STATUSTYPE_INFO)
  1067. DMEMIT("2 %u %u ", m->queue_size, m->pg_init_count);
  1068. else {
  1069. DMEMIT("%u ", m->queue_if_no_path +
  1070. (m->pg_init_retries > 0) * 2);
  1071. if (m->queue_if_no_path)
  1072. DMEMIT("queue_if_no_path ");
  1073. if (m->pg_init_retries)
  1074. DMEMIT("pg_init_retries %u ", m->pg_init_retries);
  1075. }
  1076. if (!m->hw_handler_name || type == STATUSTYPE_INFO)
  1077. DMEMIT("0 ");
  1078. else
  1079. DMEMIT("1 %s ", m->hw_handler_name);
  1080. DMEMIT("%u ", m->nr_priority_groups);
  1081. if (m->next_pg)
  1082. pg_num = m->next_pg->pg_num;
  1083. else if (m->current_pg)
  1084. pg_num = m->current_pg->pg_num;
  1085. else
  1086. pg_num = 1;
  1087. DMEMIT("%u ", pg_num);
  1088. switch (type) {
  1089. case STATUSTYPE_INFO:
  1090. list_for_each_entry(pg, &m->priority_groups, list) {
  1091. if (pg->bypassed)
  1092. state = 'D'; /* Disabled */
  1093. else if (pg == m->current_pg)
  1094. state = 'A'; /* Currently Active */
  1095. else
  1096. state = 'E'; /* Enabled */
  1097. DMEMIT("%c ", state);
  1098. if (pg->ps.type->status)
  1099. sz += pg->ps.type->status(&pg->ps, NULL, type,
  1100. result + sz,
  1101. maxlen - sz);
  1102. else
  1103. DMEMIT("0 ");
  1104. DMEMIT("%u %u ", pg->nr_pgpaths,
  1105. pg->ps.type->info_args);
  1106. list_for_each_entry(p, &pg->pgpaths, list) {
  1107. DMEMIT("%s %s %u ", p->path.dev->name,
  1108. p->is_active ? "A" : "F",
  1109. p->fail_count);
  1110. if (pg->ps.type->status)
  1111. sz += pg->ps.type->status(&pg->ps,
  1112. &p->path, type, result + sz,
  1113. maxlen - sz);
  1114. }
  1115. }
  1116. break;
  1117. case STATUSTYPE_TABLE:
  1118. list_for_each_entry(pg, &m->priority_groups, list) {
  1119. DMEMIT("%s ", pg->ps.type->name);
  1120. if (pg->ps.type->status)
  1121. sz += pg->ps.type->status(&pg->ps, NULL, type,
  1122. result + sz,
  1123. maxlen - sz);
  1124. else
  1125. DMEMIT("0 ");
  1126. DMEMIT("%u %u ", pg->nr_pgpaths,
  1127. pg->ps.type->table_args);
  1128. list_for_each_entry(p, &pg->pgpaths, list) {
  1129. DMEMIT("%s ", p->path.dev->name);
  1130. if (pg->ps.type->status)
  1131. sz += pg->ps.type->status(&pg->ps,
  1132. &p->path, type, result + sz,
  1133. maxlen - sz);
  1134. }
  1135. }
  1136. break;
  1137. }
  1138. spin_unlock_irqrestore(&m->lock, flags);
  1139. return 0;
  1140. }
  1141. static int multipath_message(struct dm_target *ti, unsigned argc, char **argv)
  1142. {
  1143. int r;
  1144. struct dm_dev *dev;
  1145. struct multipath *m = (struct multipath *) ti->private;
  1146. action_fn action;
  1147. if (argc == 1) {
  1148. if (!strnicmp(argv[0], MESG_STR("queue_if_no_path")))
  1149. return queue_if_no_path(m, 1, 0);
  1150. else if (!strnicmp(argv[0], MESG_STR("fail_if_no_path")))
  1151. return queue_if_no_path(m, 0, 0);
  1152. }
  1153. if (argc != 2)
  1154. goto error;
  1155. if (!strnicmp(argv[0], MESG_STR("disable_group")))
  1156. return bypass_pg_num(m, argv[1], 1);
  1157. else if (!strnicmp(argv[0], MESG_STR("enable_group")))
  1158. return bypass_pg_num(m, argv[1], 0);
  1159. else if (!strnicmp(argv[0], MESG_STR("switch_group")))
  1160. return switch_pg_num(m, argv[1]);
  1161. else if (!strnicmp(argv[0], MESG_STR("reinstate_path")))
  1162. action = reinstate_path;
  1163. else if (!strnicmp(argv[0], MESG_STR("fail_path")))
  1164. action = fail_path;
  1165. else
  1166. goto error;
  1167. r = dm_get_device(ti, argv[1], ti->begin, ti->len,
  1168. dm_table_get_mode(ti->table), &dev);
  1169. if (r) {
  1170. DMWARN("message: error getting device %s",
  1171. argv[1]);
  1172. return -EINVAL;
  1173. }
  1174. r = action_dev(m, dev, action);
  1175. dm_put_device(ti, dev);
  1176. return r;
  1177. error:
  1178. DMWARN("Unrecognised multipath message received.");
  1179. return -EINVAL;
  1180. }
  1181. static int multipath_ioctl(struct dm_target *ti, unsigned int cmd,
  1182. unsigned long arg)
  1183. {
  1184. struct multipath *m = (struct multipath *) ti->private;
  1185. struct block_device *bdev = NULL;
  1186. fmode_t mode = 0;
  1187. unsigned long flags;
  1188. int r = 0;
  1189. spin_lock_irqsave(&m->lock, flags);
  1190. if (!m->current_pgpath)
  1191. __choose_pgpath(m, 0);
  1192. if (m->current_pgpath) {
  1193. bdev = m->current_pgpath->path.dev->bdev;
  1194. mode = m->current_pgpath->path.dev->mode;
  1195. }
  1196. if (m->queue_io)
  1197. r = -EAGAIN;
  1198. else if (!bdev)
  1199. r = -EIO;
  1200. spin_unlock_irqrestore(&m->lock, flags);
  1201. return r ? : __blkdev_driver_ioctl(bdev, mode, cmd, arg);
  1202. }
  1203. static int multipath_iterate_devices(struct dm_target *ti,
  1204. iterate_devices_callout_fn fn, void *data)
  1205. {
  1206. struct multipath *m = ti->private;
  1207. struct priority_group *pg;
  1208. struct pgpath *p;
  1209. int ret = 0;
  1210. list_for_each_entry(pg, &m->priority_groups, list) {
  1211. list_for_each_entry(p, &pg->pgpaths, list) {
  1212. ret = fn(ti, p->path.dev, ti->begin, ti->len, data);
  1213. if (ret)
  1214. goto out;
  1215. }
  1216. }
  1217. out:
  1218. return ret;
  1219. }
  1220. static int __pgpath_busy(struct pgpath *pgpath)
  1221. {
  1222. struct request_queue *q = bdev_get_queue(pgpath->path.dev->bdev);
  1223. return dm_underlying_device_busy(q);
  1224. }
  1225. /*
  1226. * We return "busy", only when we can map I/Os but underlying devices
  1227. * are busy (so even if we map I/Os now, the I/Os will wait on
  1228. * the underlying queue).
  1229. * In other words, if we want to kill I/Os or queue them inside us
  1230. * due to map unavailability, we don't return "busy". Otherwise,
  1231. * dm core won't give us the I/Os and we can't do what we want.
  1232. */
  1233. static int multipath_busy(struct dm_target *ti)
  1234. {
  1235. int busy = 0, has_active = 0;
  1236. struct multipath *m = ti->private;
  1237. struct priority_group *pg;
  1238. struct pgpath *pgpath;
  1239. unsigned long flags;
  1240. spin_lock_irqsave(&m->lock, flags);
  1241. /* Guess which priority_group will be used at next mapping time */
  1242. if (unlikely(!m->current_pgpath && m->next_pg))
  1243. pg = m->next_pg;
  1244. else if (likely(m->current_pg))
  1245. pg = m->current_pg;
  1246. else
  1247. /*
  1248. * We don't know which pg will be used at next mapping time.
  1249. * We don't call __choose_pgpath() here to avoid to trigger
  1250. * pg_init just by busy checking.
  1251. * So we don't know whether underlying devices we will be using
  1252. * at next mapping time are busy or not. Just try mapping.
  1253. */
  1254. goto out;
  1255. /*
  1256. * If there is one non-busy active path at least, the path selector
  1257. * will be able to select it. So we consider such a pg as not busy.
  1258. */
  1259. busy = 1;
  1260. list_for_each_entry(pgpath, &pg->pgpaths, list)
  1261. if (pgpath->is_active) {
  1262. has_active = 1;
  1263. if (!__pgpath_busy(pgpath)) {
  1264. busy = 0;
  1265. break;
  1266. }
  1267. }
  1268. if (!has_active)
  1269. /*
  1270. * No active path in this pg, so this pg won't be used and
  1271. * the current_pg will be changed at next mapping time.
  1272. * We need to try mapping to determine it.
  1273. */
  1274. busy = 0;
  1275. out:
  1276. spin_unlock_irqrestore(&m->lock, flags);
  1277. return busy;
  1278. }
  1279. /*-----------------------------------------------------------------
  1280. * Module setup
  1281. *---------------------------------------------------------------*/
  1282. static struct target_type multipath_target = {
  1283. .name = "multipath",
  1284. .version = {1, 1, 0},
  1285. .module = THIS_MODULE,
  1286. .ctr = multipath_ctr,
  1287. .dtr = multipath_dtr,
  1288. .map_rq = multipath_map,
  1289. .rq_end_io = multipath_end_io,
  1290. .presuspend = multipath_presuspend,
  1291. .resume = multipath_resume,
  1292. .status = multipath_status,
  1293. .message = multipath_message,
  1294. .ioctl = multipath_ioctl,
  1295. .iterate_devices = multipath_iterate_devices,
  1296. .busy = multipath_busy,
  1297. };
  1298. static int __init dm_multipath_init(void)
  1299. {
  1300. int r;
  1301. /* allocate a slab for the dm_ios */
  1302. _mpio_cache = KMEM_CACHE(dm_mpath_io, 0);
  1303. if (!_mpio_cache)
  1304. return -ENOMEM;
  1305. r = dm_register_target(&multipath_target);
  1306. if (r < 0) {
  1307. DMERR("register failed %d", r);
  1308. kmem_cache_destroy(_mpio_cache);
  1309. return -EINVAL;
  1310. }
  1311. kmultipathd = create_workqueue("kmpathd");
  1312. if (!kmultipathd) {
  1313. DMERR("failed to create workqueue kmpathd");
  1314. dm_unregister_target(&multipath_target);
  1315. kmem_cache_destroy(_mpio_cache);
  1316. return -ENOMEM;
  1317. }
  1318. /*
  1319. * A separate workqueue is used to handle the device handlers
  1320. * to avoid overloading existing workqueue. Overloading the
  1321. * old workqueue would also create a bottleneck in the
  1322. * path of the storage hardware device activation.
  1323. */
  1324. kmpath_handlerd = create_singlethread_workqueue("kmpath_handlerd");
  1325. if (!kmpath_handlerd) {
  1326. DMERR("failed to create workqueue kmpath_handlerd");
  1327. destroy_workqueue(kmultipathd);
  1328. dm_unregister_target(&multipath_target);
  1329. kmem_cache_destroy(_mpio_cache);
  1330. return -ENOMEM;
  1331. }
  1332. DMINFO("version %u.%u.%u loaded",
  1333. multipath_target.version[0], multipath_target.version[1],
  1334. multipath_target.version[2]);
  1335. return r;
  1336. }
  1337. static void __exit dm_multipath_exit(void)
  1338. {
  1339. destroy_workqueue(kmpath_handlerd);
  1340. destroy_workqueue(kmultipathd);
  1341. dm_unregister_target(&multipath_target);
  1342. kmem_cache_destroy(_mpio_cache);
  1343. }
  1344. module_init(dm_multipath_init);
  1345. module_exit(dm_multipath_exit);
  1346. MODULE_DESCRIPTION(DM_NAME " multipath target");
  1347. MODULE_AUTHOR("Sistina Software <dm-devel@redhat.com>");
  1348. MODULE_LICENSE("GPL");