/* * Copyright (C) 2000-2006 Erik Andersen * * Licensed under the LGPL v2.1, see the file COPYING.LIB in this tarball. */ #include #include #include #include #include #include #include "dirstream.h" int scandir(const char *dir, struct dirent ***namelist, int (*selector) (const struct dirent *), int (*compar) (const struct dirent **, const struct dirent **)) { DIR *dp = opendir (dir); struct dirent *current; struct dirent **names = NULL; size_t names_size = 0, pos; int save; if (dp == NULL) return -1; save = errno; __set_errno (0); pos = 0; while ((current = readdir (dp)) != NULL) { int use_it = selector == NULL; if (! use_it) { use_it = (*selector) (current); /* The selector function might have changed errno. * It was zero before and it need to be again to make * the latter tests work. */ if (! use_it) __set_errno (0); } if (use_it) { struct dirent *vnew; size_t dsize; /* Ignore errors from selector or readdir */ __set_errno (0); if (unlikely(pos == names_size)) { struct dirent **new; if (names_size == 0) names_size = 10; else names_size *= 2; new = (struct dirent **) realloc (names, names_size * sizeof (struct dirent *)); if (new == NULL) break; names = new; } dsize = ¤t->d_name[_D_ALLOC_NAMLEN(current)] - (char*)current; vnew = (struct dirent *) malloc (dsize); if (vnew == NULL) break; names[pos++] = (struct dirent *) memcpy (vnew, current, dsize); } } if (unlikely(errno != 0)) { save = errno; closedir (dp); while (pos > 0) free (names[--pos]); free (names); __set_errno (save); return -1; } closedir (dp); __set_errno (save); /* Sort the list if we have a comparison function to sort with. */ if (compar != NULL) qsort (names, pos, sizeof (struct dirent *), (comparison_fn_t) compar); *namelist = names; return pos; }