Lines Matching defs:node
469 static int skip(struct dirtree *node)
472 char *tmp = NULL, *ptr, *f_path = dirtree_path(node, NULL);
487 static void add_to_list(struct dirtree *node)
494 full_path = dirtree_path(node, NULL);
498 static int list_dir (struct dirtree *node)
502 if (!dirtree_notdotdot(node)) return 0;
504 if (S_ISDIR(node->st.st_mode) && !node->parent) { //add root dirs.
505 add_to_list(node);
509 if (S_ISDIR(node->st.st_mode) && (toys.optflags & FLAG_r)) {
510 if (!(toys.optflags & FLAG_N)) ret = skip(node);
513 add_to_list(node); //only at one side.
517 add_to_list(node);
518 return S_ISDIR(node->st.st_mode) ? 0 : (DIRTREE_RECURSE|DIRTREE_SYMFOLLOW);
882 TT.len[j] = strlen(dir[j].list[0]); //calc root node len