2 * Copyright (c) 2004, 2005 Christophe Varoqui
3 * Copyright (c) 2004 Stefan Bader, IBM
7 #include <libdevmapper.h>
17 #include "structs_vec.h"
18 #include "blacklist.h"
20 #include "prioritizers/alua_spc3.h"
21 #include "dm-generic.h"
23 struct adapter_group *
24 alloc_adaptergroup(void)
26 struct adapter_group *agp;
28 agp = (struct adapter_group *)MALLOC(sizeof(struct adapter_group));
33 agp->host_groups = vector_alloc();
34 if (!agp->host_groups) {
41 void free_adaptergroup(vector adapters)
44 struct adapter_group *agp;
46 vector_foreach_slot(adapters, agp, i) {
47 free_hostgroup(agp->host_groups);
50 vector_free(adapters);
53 void free_hostgroup(vector hostgroups)
56 struct host_group *hgp;
61 vector_foreach_slot(hostgroups, hgp, i) {
62 vector_free(hgp->paths);
65 vector_free(hostgroups);
71 struct host_group *hgp;
73 hgp = (struct host_group *)MALLOC(sizeof(struct host_group));
78 hgp->paths = vector_alloc();
92 pp = (struct path *)MALLOC(sizeof(struct path));
95 pp->sg_id.host_no = -1;
96 pp->sg_id.channel = -1;
97 pp->sg_id.scsi_id = -1;
99 pp->sg_id.proto_id = SCSI_PROTOCOL_UNSPEC;
101 pp->tpgs = TPGS_UNDEF;
102 pp->priority = PRIO_UNDEF;
103 pp->checkint = CHECKINT_UNDEF;
104 checker_clear(&pp->checker);
105 dm_path_to_gen(pp)->ops = &dm_gen_path_ops;
106 pp->hwe = vector_alloc();
107 if (pp->hwe == NULL) {
116 free_path (struct path * pp)
121 if (checker_selected(&pp->checker))
122 checker_put(&pp->checker);
124 if (prio_selected(&pp->prio))
131 udev_device_unref(pp->udev);
137 vector_free(pp->hwe);
143 free_pathvec (vector vec, enum free_path_mode free_paths)
151 if (free_paths == FREE_PATHS)
152 vector_foreach_slot(vec, pp, i)
159 alloc_pathgroup (void)
161 struct pathgroup * pgp;
163 pgp = (struct pathgroup *)MALLOC(sizeof(struct pathgroup));
168 pgp->paths = vector_alloc();
175 dm_pathgroup_to_gen(pgp)->ops = &dm_gen_pathgroup_ops;
180 free_pathgroup (struct pathgroup * pgp, enum free_path_mode free_paths)
185 free_pathvec(pgp->paths, free_paths);
190 free_pgvec (vector pgvec, enum free_path_mode free_paths)
193 struct pathgroup * pgp;
198 vector_foreach_slot(pgvec, pgp, i)
199 free_pathgroup(pgp, free_paths);
205 alloc_multipath (void)
207 struct multipath * mpp;
209 mpp = (struct multipath *)MALLOC(sizeof(struct multipath));
213 mpp->mpcontext = NULL;
214 mpp->no_path_retry = NO_PATH_RETRY_UNDEF;
215 mpp->fast_io_fail = MP_FAST_IO_FAIL_UNSET;
216 dm_multipath_to_gen(mpp)->ops = &dm_gen_multipath_ops;
221 void free_multipath_attributes(struct multipath *mpp)
228 mpp->selector = NULL;
233 mpp->features = NULL;
236 if (mpp->hwhandler) {
237 FREE(mpp->hwhandler);
238 mpp->hwhandler = NULL;
243 free_multipath (struct multipath * mpp, enum free_path_mode free_paths)
248 free_multipath_attributes(mpp);
260 free_pathvec(mpp->paths, free_paths);
261 free_pgvec(mpp->pg, free_paths);
262 FREE_PTR(mpp->mpcontext);
267 drop_multipath (vector mpvec, char * wwid, enum free_path_mode free_paths)
270 struct multipath * mpp;
275 vector_foreach_slot (mpvec, mpp, i) {
276 if (!strncmp(mpp->wwid, wwid, WWID_SIZE)) {
277 free_multipath(mpp, free_paths);
278 vector_del_slot(mpvec, i);
285 free_multipathvec (vector mpvec, enum free_path_mode free_paths)
288 struct multipath * mpp;
293 vector_foreach_slot (mpvec, mpp, i)
294 free_multipath(mpp, free_paths);
300 store_path (vector pathvec, struct path * pp)
304 if (!strlen(pp->dev_t)) {
305 condlog(2, "%s: Empty device number", pp->dev);
308 if (!strlen(pp->dev)) {
309 condlog(2, "%s: Empty device name", pp->dev_t);
316 if (!vector_alloc_slot(pathvec))
319 vector_set_slot(pathvec, pp);
324 int add_pathgroup(struct multipath *mpp, struct pathgroup *pgp)
326 if (!vector_alloc_slot(mpp->pg))
329 vector_set_slot(mpp->pg, pgp);
336 store_hostgroup(vector hostgroupvec, struct host_group * hgp)
338 if (!vector_alloc_slot(hostgroupvec))
341 vector_set_slot(hostgroupvec, hgp);
346 store_adaptergroup(vector adapters, struct adapter_group * agp)
348 if (!vector_alloc_slot(adapters))
351 vector_set_slot(adapters, agp);
356 find_mp_by_minor (const struct _vector *mpvec, unsigned int minor)
359 struct multipath * mpp;
364 vector_foreach_slot (mpvec, mpp, i) {
368 if (mpp->dmi->minor == minor)
375 find_mp_by_wwid (const struct _vector *mpvec, const char * wwid)
378 struct multipath * mpp;
383 vector_foreach_slot (mpvec, mpp, i)
384 if (!strncmp(mpp->wwid, wwid, WWID_SIZE))
391 find_mp_by_alias (const struct _vector *mpvec, const char * alias)
395 struct multipath * mpp;
405 vector_foreach_slot (mpvec, mpp, i) {
406 if (strlen(mpp->alias) == len &&
407 !strncmp(mpp->alias, alias, len))
414 find_mp_by_str (const struct _vector *mpvec, const char * str)
418 if (sscanf(str, "dm-%d", &minor) == 1)
419 return find_mp_by_minor(mpvec, minor);
421 return find_mp_by_alias(mpvec, str);
425 find_path_by_dev (const struct _vector *pathvec, const char * dev)
433 vector_foreach_slot (pathvec, pp, i)
434 if (!strcmp(pp->dev, dev))
437 condlog(4, "%s: dev not found in pathvec", dev);
442 find_path_by_devt (const struct _vector *pathvec, const char * dev_t)
450 vector_foreach_slot (pathvec, pp, i)
451 if (!strcmp(pp->dev_t, dev_t))
454 condlog(4, "%s: dev_t not found in pathvec", dev_t);
458 int pathcountgr(const struct pathgroup *pgp, int state)
464 vector_foreach_slot (pgp->paths, pp, i)
465 if ((pp->state == state) || (state == PATH_WILD))
471 int pathcount(const struct multipath *mpp, int state)
473 struct pathgroup *pgp;
478 vector_foreach_slot (mpp->pg, pgp, i)
479 count += pathcountgr(pgp, state);
484 int count_active_paths(const struct multipath *mpp)
486 struct pathgroup *pgp;
494 vector_foreach_slot (mpp->pg, pgp, i) {
495 vector_foreach_slot (pgp->paths, pp, j) {
496 if (pp->state == PATH_UP || pp->state == PATH_GHOST)
503 int pathcmp(const struct pathgroup *pgp, const struct pathgroup *cpgp)
506 struct path *pp, *cpp;
507 int pnum = 0, found = 0;
509 vector_foreach_slot(pgp->paths, pp, i) {
511 vector_foreach_slot(cpgp->paths, cpp, j) {
512 if ((long)pp == (long)cpp) {
523 first_path (const struct multipath * mpp)
525 struct pathgroup * pgp;
528 pgp = VECTOR_SLOT(mpp->pg, 0);
530 return pgp?VECTOR_SLOT(pgp->paths, 0):NULL;
533 int add_feature(char **f, const char *n)
545 if (strchr(n, ' ') != NULL) {
546 condlog(0, "internal error: feature \"%s\" contains spaces", n);
550 /* default feature is null */
553 l = asprintf(&t, "1 %s", n);
561 /* Check if feature is already present */
565 /* Get feature count */
566 c = strtoul(*f, &e, 10);
567 if (*f == e || (*e != ' ' && *e != '\0')) {
568 condlog(0, "parse error in feature string \"%s\"", *f);
572 /* Add 1 digit and 1 space */
573 l = strlen(e) + strlen(n) + 2;
576 /* Check if we need more digits for feature count */
577 for (d = c; d >= 10; d /= 10)
584 /* e: old feature string with leading space, or "" */
586 while (*(e + 1) == ' ')
589 snprintf(t, l + 1, "%0d%s %s", c, e, n);
597 int remove_feature(char **f, const char *o)
607 if (!o || *o == '\0')
610 /* Check if not present */
614 /* Get feature count */
615 c = strtoul(*f, &e, 10);
620 /* Normalize features */
624 /* Just spaces, return */
632 /* Update feature count */
635 while (q[0] != '\0') {
636 if (q[0] == ' ' && q[1] != ' ' && q[1] != '\0')
641 /* Quick exit if all features have been removed */
650 /* Search feature to be removed */
653 /* Not found, return */
656 /* Update feature count space */
662 /* Copy the feature count */
663 sprintf(n, "%0d", c);
665 * Copy existing features up to the feature
666 * about to be removed
670 /* Internal error, feature string inconsistent */
683 strncat(n, p, (size_t)(e - p));
684 p += (size_t)(e - p);
686 /* Skip feature to be removed */
689 /* Copy remaining features */