Home
last modified time | relevance | path

Searched refs:valid_paths (Results 1 – 6 of 6) sorted by relevance

/openbmc/linux/scripts/
H A Drustdoc_test_gen.rs48 fn find_real_path<'a>(srctree: &Path, valid_paths: &'a mut Vec<PathBuf>, file: &str) -> &'a str { in find_real_path()
49 valid_paths.clear(); in find_real_path()
53 find_candidates(srctree, valid_paths, Path::new(""), &potential_components); in find_real_path()
56 valid_paths: &mut Vec<PathBuf>, in find_real_path()
70 valid_paths.push( in find_real_path()
83 find_candidates(srctree, valid_paths, &prefix, components_rest); in find_real_path()
89 valid_paths.len() > 0, in find_real_path()
94 if valid_paths.len() > 1 { in find_real_path()
96 for path in valid_paths { in find_real_path()
105 valid_paths[0].to_str().unwrap() in find_real_path()
[all …]
/openbmc/linux/drivers/md/
H A Ddm-ps-round-robin.c51 struct list_head valid_paths; member
61 INIT_LIST_HEAD(&s->valid_paths); in alloc_selector()
85 free_paths(&s->valid_paths); in rr_destroy()
159 list_add_tail(&pi->list, &s->valid_paths); in rr_add_path()
183 list_move(&pi->list, &s->valid_paths); in rr_reinstate_path()
196 if (!list_empty(&s->valid_paths)) { in rr_select_path()
197 pi = list_entry(s->valid_paths.next, struct path_info, list); in rr_select_path()
198 list_move_tail(&pi->list, &s->valid_paths); in rr_select_path()
H A Ddm-ps-queue-length.c31 struct list_head valid_paths; member
48 INIT_LIST_HEAD(&s->valid_paths); in alloc_selector()
81 ql_free_paths(&s->valid_paths); in ql_destroy()
158 list_add_tail(&pi->list, &s->valid_paths); in ql_add_path()
182 list_move_tail(&pi->list, &s->valid_paths); in ql_reinstate_path()
199 if (list_empty(&s->valid_paths)) in ql_select_path()
202 list_for_each_entry(pi, &s->valid_paths, list) { in ql_select_path()
215 list_move_tail(&best->list, &s->valid_paths); in ql_select_path()
H A Ddm-ps-service-time.c26 struct list_head valid_paths; member
44 INIT_LIST_HEAD(&s->valid_paths); in alloc_selector()
77 free_paths(&s->valid_paths); in st_destroy()
170 list_add_tail(&pi->list, &s->valid_paths); in st_add_path()
194 list_move_tail(&pi->list, &s->valid_paths); in st_reinstate_path()
285 if (list_empty(&s->valid_paths)) in st_select_path()
288 list_for_each_entry(pi, &s->valid_paths, list) in st_select_path()
296 list_move_tail(&best->list, &s->valid_paths); in st_select_path()
H A Ddm-ps-historical-service-time.c45 struct list_head valid_paths; member
135 INIT_LIST_HEAD(&s->valid_paths); in alloc_selector()
231 free_paths(&s->valid_paths); in hst_destroy()
312 list_add_tail(&pi->list, &s->valid_paths); in hst_add_path()
338 list_move_tail(&pi->list, &s->valid_paths); in hst_reinstate_path()
440 if (list_empty(&s->valid_paths)) in hst_select_path()
443 list_for_each_entry(pi, &s->valid_paths, list) { in hst_select_path()
452 list_move_tail(&best->list, &s->valid_paths); in hst_select_path()
/openbmc/openbmc/poky/scripts/
H A Dsstate-cache-management.py171 valid_paths = [p for p in paths if p.bb_task != "populate_lic"]
175 for p in valid_paths: