131 static void entrylen(struct dirtree *dt, unsigned *len)  in entrylen()  argument
133   struct stat *st = &(dt->st);  in entrylen()
137   *len = strwidth(dt->name);  in entrylen()
156   len[7] = (flags & FLAG_Z) ? strwidth((char *)dt->extra) : 0;  in entrylen()
307   struct dirtree *dt, **sort;  in listfiles()  local
326     dt = indir->child;  in listfiles()
327     if (dt && S_ISDIR(dt->st.st_mode) && !dt->next && !(flags&(FLAG_d|FLAG_R)))  in listfiles()
329       listfiles(open(dt->name, 0), TT.singledir = dt);  in listfiles()
335     for (;dt; dt = dt->next) filter(dt);  in listfiles()
346     for (dtlen = 0, dt = indir->child; dt; dt = dt->next, dtlen++)  in listfiles()
347       if (sort) sort[dtlen] = dt;  in listfiles()
556   struct dirtree *dt;  in ls_main()  local
592     dt = dirtree_add_node(0, *s, DIRTREE_STATLESS|DIRTREE_SYMFOLLOW*sym);  in ls_main()
595     if (dt) {  in ls_main()
596       if (dt->again&2) {  in ls_main()
598         free(dt);  in ls_main()
599       } else dlist_add_nomalloc((void *)&TT.files->child, (void *)dt);  in ls_main()
605   for (dt = TT.files->child; dt; dt = dt->next) dt->parent = TT.files;  in ls_main()