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->initialized = INIT_NEW;
96 pp->sg_id.host_no = -1;
97 pp->sg_id.channel = -1;
98 pp->sg_id.scsi_id = -1;
100 pp->sg_id.proto_id = SCSI_PROTOCOL_UNSPEC;
102 pp->tpgs = TPGS_UNDEF;
103 pp->priority = PRIO_UNDEF;
104 pp->checkint = CHECKINT_UNDEF;
105 checker_clear(&pp->checker);
106 dm_path_to_gen(pp)->ops = &dm_gen_path_ops;
107 pp->hwe = vector_alloc();
108 if (pp->hwe == NULL) {
117 uninitialize_path(struct path *pp)
122 pp->dmstate = PSTATE_UNDEF;
123 pp->uid_attribute = NULL;
126 if (checker_selected(&pp->checker))
127 checker_put(&pp->checker);
129 if (prio_selected(&pp->prio))
139 free_path (struct path * pp)
144 uninitialize_path(pp);
147 udev_device_unref(pp->udev);
153 vector_free(pp->hwe);
159 free_pathvec (vector vec, enum free_path_mode free_paths)
167 if (free_paths == FREE_PATHS)
168 vector_foreach_slot(vec, pp, i)
175 alloc_pathgroup (void)
177 struct pathgroup * pgp;
179 pgp = (struct pathgroup *)MALLOC(sizeof(struct pathgroup));
184 pgp->paths = vector_alloc();
191 dm_pathgroup_to_gen(pgp)->ops = &dm_gen_pathgroup_ops;
196 free_pathgroup (struct pathgroup * pgp, enum free_path_mode free_paths)
201 free_pathvec(pgp->paths, free_paths);
206 free_pgvec (vector pgvec, enum free_path_mode free_paths)
209 struct pathgroup * pgp;
214 vector_foreach_slot(pgvec, pgp, i)
215 free_pathgroup(pgp, free_paths);
221 alloc_multipath (void)
223 struct multipath * mpp;
225 mpp = (struct multipath *)MALLOC(sizeof(struct multipath));
229 mpp->mpcontext = NULL;
230 mpp->no_path_retry = NO_PATH_RETRY_UNDEF;
231 mpp->fast_io_fail = MP_FAST_IO_FAIL_UNSET;
232 dm_multipath_to_gen(mpp)->ops = &dm_gen_multipath_ops;
237 void free_multipath_attributes(struct multipath *mpp)
244 mpp->selector = NULL;
249 mpp->features = NULL;
252 if (mpp->hwhandler) {
253 FREE(mpp->hwhandler);
254 mpp->hwhandler = NULL;
259 free_multipath (struct multipath * mpp, enum free_path_mode free_paths)
264 free_multipath_attributes(mpp);
276 if (!free_paths && mpp->pg) {
277 struct pathgroup *pgp;
282 * Make sure paths carry no reference to this mpp any more
284 vector_foreach_slot(mpp->pg, pgp, i) {
285 vector_foreach_slot(pgp->paths, pp, j)
291 free_pathvec(mpp->paths, free_paths);
292 free_pgvec(mpp->pg, free_paths);
293 FREE_PTR(mpp->mpcontext);
298 drop_multipath (vector mpvec, char * wwid, enum free_path_mode free_paths)
301 struct multipath * mpp;
306 vector_foreach_slot (mpvec, mpp, i) {
307 if (!strncmp(mpp->wwid, wwid, WWID_SIZE)) {
308 free_multipath(mpp, free_paths);
309 vector_del_slot(mpvec, i);
316 free_multipathvec (vector mpvec, enum free_path_mode free_paths)
319 struct multipath * mpp;
324 vector_foreach_slot (mpvec, mpp, i)
325 free_multipath(mpp, free_paths);
331 store_path (vector pathvec, struct path * pp)
335 if (!strlen(pp->dev_t)) {
336 condlog(2, "%s: Empty device number", pp->dev);
339 if (!strlen(pp->dev)) {
340 condlog(3, "%s: Empty device name", pp->dev_t);
347 if (!vector_alloc_slot(pathvec))
350 vector_set_slot(pathvec, pp);
355 int add_pathgroup(struct multipath *mpp, struct pathgroup *pgp)
357 if (!vector_alloc_slot(mpp->pg))
360 vector_set_slot(mpp->pg, pgp);
367 store_hostgroup(vector hostgroupvec, struct host_group * hgp)
369 if (!vector_alloc_slot(hostgroupvec))
372 vector_set_slot(hostgroupvec, hgp);
377 store_adaptergroup(vector adapters, struct adapter_group * agp)
379 if (!vector_alloc_slot(adapters))
382 vector_set_slot(adapters, agp);
387 find_mp_by_minor (const struct _vector *mpvec, unsigned int minor)
390 struct multipath * mpp;
395 vector_foreach_slot (mpvec, mpp, i) {
399 if (mpp->dmi->minor == minor)
406 find_mp_by_wwid (const struct _vector *mpvec, const char * wwid)
409 struct multipath * mpp;
414 vector_foreach_slot (mpvec, mpp, i)
415 if (!strncmp(mpp->wwid, wwid, WWID_SIZE))
422 find_mp_by_alias (const struct _vector *mpvec, const char * alias)
426 struct multipath * mpp;
436 vector_foreach_slot (mpvec, mpp, i) {
437 if (strlen(mpp->alias) == len &&
438 !strncmp(mpp->alias, alias, len))
445 find_mp_by_str (const struct _vector *mpvec, const char * str)
449 if (sscanf(str, "dm-%d", &minor) == 1)
450 return find_mp_by_minor(mpvec, minor);
452 return find_mp_by_alias(mpvec, str);
456 find_path_by_dev (const struct _vector *pathvec, const char * dev)
464 vector_foreach_slot (pathvec, pp, i)
465 if (!strcmp(pp->dev, dev))
468 condlog(4, "%s: dev not found in pathvec", dev);
473 find_path_by_devt (const struct _vector *pathvec, const char * dev_t)
481 vector_foreach_slot (pathvec, pp, i)
482 if (!strcmp(pp->dev_t, dev_t))
485 condlog(4, "%s: dev_t not found in pathvec", dev_t);
489 static int do_pathcount(const struct multipath *mpp, const int *states,
490 unsigned int nr_states)
492 struct pathgroup *pgp;
495 unsigned int i, j, k;
497 if (!mpp->pg || !nr_states)
500 vector_foreach_slot (mpp->pg, pgp, i) {
501 vector_foreach_slot (pgp->paths, pp, j) {
502 for (k = 0; k < nr_states; k++) {
503 if (pp->state == states[k]) {
513 int pathcount(const struct multipath *mpp, int state)
515 return do_pathcount(mpp, &state, 1);
518 int count_active_paths(const struct multipath *mpp)
520 struct pathgroup *pgp;
528 vector_foreach_slot (mpp->pg, pgp, i) {
529 vector_foreach_slot (pgp->paths, pp, j) {
530 if (pp->state == PATH_UP || pp->state == PATH_GHOST)
537 int count_active_pending_paths(const struct multipath *mpp)
539 int states[] = {PATH_UP, PATH_GHOST, PATH_PENDING};
541 return do_pathcount(mpp, states, 3);
544 int pathcmp(const struct pathgroup *pgp, const struct pathgroup *cpgp)
547 struct path *pp, *cpp;
548 int pnum = 0, found = 0;
550 vector_foreach_slot(pgp->paths, pp, i) {
552 vector_foreach_slot(cpgp->paths, cpp, j) {
553 if ((long)pp == (long)cpp) {
564 first_path (const struct multipath * mpp)
566 struct pathgroup * pgp;
569 pgp = VECTOR_SLOT(mpp->pg, 0);
571 return pgp?VECTOR_SLOT(pgp->paths, 0):NULL;
574 int add_feature(char **f, const char *n)
586 if (strchr(n, ' ') != NULL) {
587 condlog(0, "internal error: feature \"%s\" contains spaces", n);
591 /* default feature is null */
594 l = asprintf(&t, "1 %s", n);
602 /* Check if feature is already present */
606 /* Get feature count */
607 c = strtoul(*f, &e, 10);
608 if (*f == e || (*e != ' ' && *e != '\0')) {
609 condlog(0, "parse error in feature string \"%s\"", *f);
613 /* Add 1 digit and 1 space */
614 l = strlen(e) + strlen(n) + 2;
617 /* Check if we need more digits for feature count */
618 for (d = c; d >= 10; d /= 10)
625 /* e: old feature string with leading space, or "" */
627 while (*(e + 1) == ' ')
630 snprintf(t, l + 1, "%0d%s %s", c, e, n);
638 int remove_feature(char **f, const char *o)
648 if (!o || *o == '\0')
651 /* Check if not present */
655 /* Get feature count */
656 c = strtoul(*f, &e, 10);
661 /* Normalize features */
665 /* Just spaces, return */
673 /* Update feature count */
676 while (q[0] != '\0') {
677 if (q[0] == ' ' && q[1] != ' ' && q[1] != '\0')
682 /* Quick exit if all features have been removed */
691 /* Search feature to be removed */
694 /* Not found, return */
697 /* Update feature count space */
703 /* Copy the feature count */
704 sprintf(n, "%0d", c);
706 * Copy existing features up to the feature
707 * about to be removed
711 /* Internal error, feature string inconsistent */
724 strncat(n, p, (size_t)(e - p));
725 p += (size_t)(e - p);
727 /* Skip feature to be removed */
730 /* Copy remaining features */