2 * Copyright (c) 2004, 2005 Christophe Varoqui
3 * Copyright (c) 2004 Stefan Bader, IBM
7 #include <libdevmapper.h>
16 #include "structs_vec.h"
17 #include "blacklist.h"
26 pp = (struct path *)MALLOC(sizeof(struct path));
29 pp->sg_id.host_no = -1;
30 pp->sg_id.channel = -1;
31 pp->sg_id.scsi_id = -1;
34 pp->priority = PRIO_UNDEF;
40 free_path (struct path * pp)
45 if (checker_selected(&pp->checker))
46 checker_put(&pp->checker);
55 free_pathvec (vector vec, int free_paths)
64 vector_foreach_slot(vec, pp, i)
71 alloc_pathgroup (void)
73 struct pathgroup * pgp;
75 pgp = (struct pathgroup *)MALLOC(sizeof(struct pathgroup));
80 pgp->paths = vector_alloc();
91 free_pathgroup (struct pathgroup * pgp, int free_paths)
96 free_pathvec(pgp->paths, free_paths);
101 free_pgvec (vector pgvec, int free_paths)
104 struct pathgroup * pgp;
109 vector_foreach_slot(pgvec, pgp, i)
110 free_pathgroup(pgp, free_paths);
116 alloc_multipath (void)
118 struct multipath * mpp;
120 mpp = (struct multipath *)MALLOC(sizeof(struct multipath));
124 mpp->mpcontext = NULL;
125 mpp->no_path_retry = NO_PATH_RETRY_UNDEF;
131 free_multipath_attributes (struct multipath * mpp)
137 mpp->selector != conf->selector &&
138 (!mpp->mpe || (mpp->mpe && mpp->selector != mpp->mpe->selector)) &&
139 (!mpp->hwe || (mpp->hwe && mpp->selector != mpp->hwe->selector))) {
141 mpp->selector = NULL;
146 mpp->features = NULL;
149 if (mpp->hwhandler &&
150 mpp->hwhandler != conf->hwhandler &&
151 (!mpp->hwe || (mpp->hwe && mpp->hwhandler != mpp->hwe->hwhandler))) {
152 FREE(mpp->hwhandler);
153 mpp->hwhandler = NULL;
158 free_multipath (struct multipath * mpp, int free_paths)
163 free_multipath_attributes(mpp);
176 * better own vecs->lock here
179 ((struct event_thread *)mpp->waiter)->mpp = NULL;
181 free_pathvec(mpp->paths, free_paths);
182 free_pgvec(mpp->pg, free_paths);
183 FREE_PTR(mpp->mpcontext);
188 drop_multipath (vector mpvec, char * wwid, int free_paths)
191 struct multipath * mpp;
196 vector_foreach_slot (mpvec, mpp, i) {
197 if (!strncmp(mpp->wwid, wwid, WWID_SIZE)) {
198 free_multipath(mpp, free_paths);
199 vector_del_slot(mpvec, i);
206 free_multipathvec (vector mpvec, int free_paths)
209 struct multipath * mpp;
214 vector_foreach_slot (mpvec, mpp, i)
215 free_multipath(mpp, free_paths);
221 store_path (vector pathvec, struct path * pp)
223 if (!vector_alloc_slot(pathvec))
226 vector_set_slot(pathvec, pp);
232 store_pathgroup (vector pgvec, struct pathgroup * pgp)
234 if (!vector_alloc_slot(pgvec))
237 vector_set_slot(pgvec, pgp);
243 find_mp_by_minor (vector mpvec, int minor)
246 struct multipath * mpp;
251 vector_foreach_slot (mpvec, mpp, i) {
255 if (mpp->dmi->minor == minor)
262 find_mp_by_wwid (vector mpvec, char * wwid)
265 struct multipath * mpp;
270 vector_foreach_slot (mpvec, mpp, i)
271 if (!strncmp(mpp->wwid, wwid, WWID_SIZE))
278 find_mp_by_alias (vector mpvec, char * alias)
282 struct multipath * mpp;
292 vector_foreach_slot (mpvec, mpp, i) {
293 if (strlen(mpp->alias) == len &&
294 !strncmp(mpp->alias, alias, len))
301 find_mp_by_str (vector mpvec, char * str)
305 if (sscanf(str, "dm-%d", &minor) == 1)
306 return find_mp_by_minor(mpvec, minor);
308 return find_mp_by_alias(mpvec, str);
312 find_path_by_dev (vector pathvec, char * dev)
320 vector_foreach_slot (pathvec, pp, i)
321 if (!strcmp(pp->dev, dev))
324 condlog(3, "%s: not found in pathvec", dev);
329 find_path_by_devt (vector pathvec, char * dev_t)
337 vector_foreach_slot (pathvec, pp, i)
338 if (!strcmp(pp->dev_t, dev_t))
341 condlog(3, "%s: not found in pathvec", dev_t);
346 pathcountgr (struct pathgroup * pgp, int state)
352 vector_foreach_slot (pgp->paths, pp, i)
353 if ((pp->state == state) || (state == PATH_WILD))
360 pathcount (struct multipath * mpp, int state)
362 struct pathgroup *pgp;
367 vector_foreach_slot (mpp->pg, pgp, i)
368 count += pathcountgr(pgp, state);
374 pathcmp (struct pathgroup *pgp, struct pathgroup *cpgp)
377 struct path *pp, *cpp;
378 int pnum = 0, found = 0;
380 vector_foreach_slot(pgp->paths, pp, i) {
382 vector_foreach_slot(cpgp->paths, cpp, j) {
383 if ((long)pp == (long)cpp) {
394 first_path (struct multipath * mpp)
396 struct pathgroup * pgp;
399 pgp = VECTOR_SLOT(mpp->pg, 0);
401 return pgp?VECTOR_SLOT(pgp->paths, 0):NULL;
405 setup_feature(struct multipath * mpp, char *feature)
407 if (!strncmp(feature, "queue_if_no_path", 16)) {
408 if (mpp->no_path_retry <= NO_PATH_RETRY_UNDEF)
409 mpp->no_path_retry = NO_PATH_RETRY_QUEUE;
414 add_feature (char **f, char *n)
426 /* Check if feature is already present */
430 /* Get feature count */
431 c = strtoul(*f, &e, 10);
436 /* Check if we need to increase feature count space */
437 l = strlen(*f) + strlen(n) + 1;
439 /* Count new features */
445 if (*p == ' ' && p[1] != '\0' && p[1] != ' ') {
459 /* Update feature count */
467 snprintf(p, l + 2, "%0d ", c);
469 /* Copy the feature string */
488 remove_feature(char **f, char *o)
497 if (!o || *o == '\0')
500 /* Check if not present */
504 /* Get feature count */
505 c = strtoul(*f, &e, 10);
510 /* Normalize features */
514 /* Just spaces, return */
522 /* Update feature count */
525 while (p[0] != '\0') {
526 if (p[0] == ' ' && p[1] != ' ' && p[1] != '\0')
531 /* Quick exit if all features have been removed */
540 /* Search feature to be removed */
543 /* Not found, return */
546 /* Update feature count space */
552 /* Copy the feature count */
553 sprintf(n, "%0d", c);
555 * Copy existing features up to the feature
556 * about to be removed
568 strncat(n, p, (size_t)(e - p));
569 p += (size_t)(e - p);
571 /* Skip feature to be removed */
574 /* Copy remaining features */