Searched refs:nfiles (Results 1 – 3 of 3) sorted by relevance
637 static void display_files(struct dnode **dn, unsigned nfiles) in display_files() argument662 nrows = nfiles / ncols; in display_files()663 if (nrows * ncols < nfiles) in display_files()666 nrows = nfiles; in display_files()679 if (i < nfiles) { in display_files()906 static void sort_and_display_files(struct dnode **dn, unsigned nfiles) in sort_and_display_files() argument908 dnsort(dn, nfiles); in sort_and_display_files()909 display_files(dn, nfiles); in sort_and_display_files()913 # define sort_and_display_files(dn, nfiles) display_files(dn, nfiles) argument922 unsigned i, nfiles; in scan_one_dir() local[all …]
123 unsigned nfiles; in tail_main() local178 nfiles = i = 0; in tail_main()185 fds[nfiles] = fd; in tail_main()186 argv[nfiles++] = argv[i]; in tail_main()189 if (!nfiles) in tail_main()219 if (nfiles > header_threshold) { in tail_main()334 } while (++i < nfiles); in tail_main()380 if (nfiles > header_threshold) { in tail_main()413 } while (++i < nfiles); in tail_main()
1128 int nfiles = num_matches; in showfiles() local1129 int nrows = nfiles; in showfiles()1143 if (nfiles % ncols) in showfiles()1152 for (nc = 1; nc < ncols && n+nrows < nfiles; n += nrows, nc++) { in showfiles()