Lines Matching refs:list

10  * This utility will list a directory's files.
53 #include "list.h"
65 struct list_head list;
80 struct list_head list;
84 /* The list of sub-dirs is like a "horizontal" tree. The root of
85 * the tree is opts.path, but it is not part of the list because
86 * that's not necessary. The rules of the list are (in order of
96 * then the list will be:
100 * into the list.
154 * usage - Print a list of the parameters to the program
156 * Print a list of the parameters and options for the program.
170 " -p, --path PATH Directory whose contents to list\n"
172 " -R, --recursive Recursively list subdirectories\n"
342 * free_dirs - walk the list of dir's and free each of them
343 * @dir_list: the list_head of any entry in the list
355 tofree = list_entry(walker, struct dir, list);
363 * readdir_recursive - list a directory and sub-directories encountered
364 * @ni: ntfs inode of the directory to list
369 * then list each of its sub-directories.
378 /* list of dirs to "ls" recursively */
380 .list = LIST_HEAD_INIT(dirs.list),
387 .list = LIST_HEAD_INIT(paths.list),
403 if (list_empty(&dirs.list)) {
405 list_add(&base_comp.list, &paths.list);
406 dir_list_insert_pos = &dirs.list;
415 list_add_tail(&comp.list, &paths.list);
417 /* for each of ni's sub-dirs: list in this iteration, then
419 list_for_each(dir_walker, &dirs.list) {
424 subdir = list_entry(dir_walker, struct dir, list);
431 dir_list_insert_pos = &dirs.list;
449 list_for_each(comp_walker, &paths.list) {
452 struct path_component, list);
471 list_del(&comp.list);
479 free_dirs(&dirs.list);
615 list_add(&dir->list, dir_list_insert_pos);
616 dir_list_insert_pos = &dir->list;
671 * list it. If it is a directory, list its contents.