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 checker_clear(&pp->checker);
104 dm_path_to_gen(pp)->ops = &dm_gen_path_ops;
105 pp->hwe = vector_alloc();
106 if (pp->hwe == NULL) {
115 free_path (struct path * pp)
120 if (checker_selected(&pp->checker))
121 checker_put(&pp->checker);
123 if (prio_selected(&pp->prio))
130 udev_device_unref(pp->udev);
133 vector_free(pp->hwe);
139 free_pathvec (vector vec, enum free_path_mode free_paths)
147 if (free_paths == FREE_PATHS)
148 vector_foreach_slot(vec, pp, i)
155 alloc_pathgroup (void)
157 struct pathgroup * pgp;
159 pgp = (struct pathgroup *)MALLOC(sizeof(struct pathgroup));
164 pgp->paths = vector_alloc();
171 dm_pathgroup_to_gen(pgp)->ops = &dm_gen_pathgroup_ops;
176 free_pathgroup (struct pathgroup * pgp, enum free_path_mode free_paths)
181 free_pathvec(pgp->paths, free_paths);
186 free_pgvec (vector pgvec, enum free_path_mode free_paths)
189 struct pathgroup * pgp;
194 vector_foreach_slot(pgvec, pgp, i)
195 free_pathgroup(pgp, free_paths);
201 alloc_multipath (void)
203 struct multipath * mpp;
205 mpp = (struct multipath *)MALLOC(sizeof(struct multipath));
209 mpp->mpcontext = NULL;
210 mpp->no_path_retry = NO_PATH_RETRY_UNDEF;
211 mpp->fast_io_fail = MP_FAST_IO_FAIL_UNSET;
212 dm_multipath_to_gen(mpp)->ops = &dm_gen_multipath_ops;
217 void free_multipath_attributes(struct multipath *mpp)
224 mpp->selector = NULL;
229 mpp->features = NULL;
232 if (mpp->hwhandler) {
233 FREE(mpp->hwhandler);
234 mpp->hwhandler = NULL;
239 free_multipath (struct multipath * mpp, enum free_path_mode free_paths)
244 free_multipath_attributes(mpp);
256 free_pathvec(mpp->paths, free_paths);
257 free_pgvec(mpp->pg, free_paths);
258 FREE_PTR(mpp->mpcontext);
263 drop_multipath (vector mpvec, char * wwid, enum free_path_mode free_paths)
266 struct multipath * mpp;
271 vector_foreach_slot (mpvec, mpp, i) {
272 if (!strncmp(mpp->wwid, wwid, WWID_SIZE)) {
273 free_multipath(mpp, free_paths);
274 vector_del_slot(mpvec, i);
281 free_multipathvec (vector mpvec, enum free_path_mode free_paths)
284 struct multipath * mpp;
289 vector_foreach_slot (mpvec, mpp, i)
290 free_multipath(mpp, free_paths);
296 store_path (vector pathvec, struct path * pp)
300 if (!strlen(pp->dev_t)) {
301 condlog(2, "%s: Empty device number", pp->dev);
304 if (!strlen(pp->dev)) {
305 condlog(2, "%s: Empty device name", pp->dev_t);
312 if (!vector_alloc_slot(pathvec))
315 vector_set_slot(pathvec, pp);
321 store_pathgroup (vector pgvec, struct pathgroup * pgp)
323 if (!vector_alloc_slot(pgvec))
326 vector_set_slot(pgvec, pgp);
331 int add_pathgroup(struct multipath *mpp, struct pathgroup *pgp)
333 int ret = store_pathgroup(mpp->pg, pgp);
342 store_hostgroup(vector hostgroupvec, struct host_group * hgp)
344 if (!vector_alloc_slot(hostgroupvec))
347 vector_set_slot(hostgroupvec, hgp);
352 store_adaptergroup(vector adapters, struct adapter_group * agp)
354 if (!vector_alloc_slot(adapters))
357 vector_set_slot(adapters, agp);
362 find_mp_by_minor (const struct _vector *mpvec, int minor)
365 struct multipath * mpp;
370 vector_foreach_slot (mpvec, mpp, i) {
374 if (mpp->dmi->minor == minor)
381 find_mp_by_wwid (const struct _vector *mpvec, const char * wwid)
384 struct multipath * mpp;
389 vector_foreach_slot (mpvec, mpp, i)
390 if (!strncmp(mpp->wwid, wwid, WWID_SIZE))
397 find_mp_by_alias (const struct _vector *mpvec, const char * alias)
401 struct multipath * mpp;
411 vector_foreach_slot (mpvec, mpp, i) {
412 if (strlen(mpp->alias) == len &&
413 !strncmp(mpp->alias, alias, len))
420 find_mp_by_str (const struct _vector *mpvec, const char * str)
424 if (sscanf(str, "dm-%d", &minor) == 1)
425 return find_mp_by_minor(mpvec, minor);
427 return find_mp_by_alias(mpvec, str);
431 find_path_by_dev (const struct _vector *pathvec, const char * dev)
439 vector_foreach_slot (pathvec, pp, i)
440 if (!strcmp(pp->dev, dev))
443 condlog(4, "%s: dev not found in pathvec", dev);
448 find_path_by_devt (const struct _vector *pathvec, const char * dev_t)
456 vector_foreach_slot (pathvec, pp, i)
457 if (!strcmp(pp->dev_t, dev_t))
460 condlog(4, "%s: dev_t not found in pathvec", dev_t);
464 int pathcountgr(const struct pathgroup *pgp, int state)
470 vector_foreach_slot (pgp->paths, pp, i)
471 if ((pp->state == state) || (state == PATH_WILD))
477 int pathcount(const struct multipath *mpp, int state)
479 struct pathgroup *pgp;
484 vector_foreach_slot (mpp->pg, pgp, i)
485 count += pathcountgr(pgp, state);
490 int pathcmp(const struct pathgroup *pgp, const struct pathgroup *cpgp)
493 struct path *pp, *cpp;
494 int pnum = 0, found = 0;
496 vector_foreach_slot(pgp->paths, pp, i) {
498 vector_foreach_slot(cpgp->paths, cpp, j) {
499 if ((long)pp == (long)cpp) {
510 first_path (const struct multipath * mpp)
512 struct pathgroup * pgp;
515 pgp = VECTOR_SLOT(mpp->pg, 0);
517 return pgp?VECTOR_SLOT(pgp->paths, 0):NULL;
520 int add_feature(char **f, const char *n)
532 if (strchr(n, ' ') != NULL) {
533 condlog(0, "internal error: feature \"%s\" contains spaces", n);
537 /* default feature is null */
540 l = asprintf(&t, "1 %s", n);
548 /* Check if feature is already present */
552 /* Get feature count */
553 c = strtoul(*f, &e, 10);
554 if (*f == e || (*e != ' ' && *e != '\0')) {
555 condlog(0, "parse error in feature string \"%s\"", *f);
559 /* Add 1 digit and 1 space */
560 l = strlen(e) + strlen(n) + 2;
563 /* Check if we need more digits for feature count */
564 for (d = c; d >= 10; d /= 10)
571 /* e: old feature string with leading space, or "" */
573 while (*(e + 1) == ' ')
576 snprintf(t, l + 1, "%0d%s %s", c, e, n);
584 int remove_feature(char **f, const char *o)
594 if (!o || *o == '\0')
597 /* Check if not present */
601 /* Get feature count */
602 c = strtoul(*f, &e, 10);
607 /* Normalize features */
611 /* Just spaces, return */
619 /* Update feature count */
622 while (q[0] != '\0') {
623 if (q[0] == ' ' && q[1] != ' ' && q[1] != '\0')
628 /* Quick exit if all features have been removed */
637 /* Search feature to be removed */
640 /* Not found, return */
643 /* Update feature count space */
649 /* Copy the feature count */
650 sprintf(n, "%0d", c);
652 * Copy existing features up to the feature
653 * about to be removed
657 /* Internal error, feature string inconsistent */
670 strncat(n, p, (size_t)(e - p));
671 p += (size_t)(e - p);
673 /* Skip feature to be removed */
676 /* Copy remaining features */