Lines Matching defs:path
10 * num_paths. If a path is stale and unused, we will send a single
11 * request to probe in case the path has improved. This situation
12 * generally arises if the path is so much worse than others that it
14 * multipath device is unused. If a path is stale and in use, limit the
15 * number of requests it can receive with the assumption that the path
25 #include "dm-path-selector.h"
56 struct dm_path *path;
188 * be considered different. That is, a path is
190 * is the path with higher service time. A threshold
237 static int hst_status(struct path_selector *ps, struct dm_path *path,
243 if (!path) {
248 pi = path->pscontext;
267 static int hst_add_path(struct path_selector *ps, struct dm_path *path,
278 * <repeat_count>: The number of I/Os before switching path.
291 /* allocate the path */
294 *error = "historical-service-time ps: Error allocating path context";
298 pi->path = path;
309 path->pscontext = pi;
319 static void hst_fail_path(struct path_selector *ps, struct dm_path *path)
322 struct path_info *pi = path->pscontext;
331 static int hst_reinstate_path(struct path_selector *ps, struct dm_path *path)
334 struct path_info *pi = path->pscontext;
392 * If an unloaded path is stale, choose it. If both paths are unloaded,
393 * choose path that is the most stale.
394 * (If one path is loaded, choose the other)
451 /* Move last used path to end (least preferred in case of ties) */
454 ret = best->path;
461 static int hst_start_io(struct path_selector *ps, struct dm_path *path,
464 struct path_info *pi = path->pscontext;
492 static int hst_end_io(struct path_selector *ps, struct dm_path *path,
495 struct path_info *pi = path->pscontext;
510 * On request end, mark path as fresh. If a path hasn't
513 * maximum requests on that path.
563 MODULE_DESCRIPTION(DM_NAME " measured service time oriented path selector");