scandir.c 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. /* Copyright (C) 1992-1998, 2000 Free Software Foundation, Inc.
  2. This file is part of the GNU C Library.
  3. The GNU C Library is free software; you can redistribute it and/or
  4. modify it under the terms of the GNU Lesser General Public
  5. License as published by the Free Software Foundation; either
  6. version 2.1 of the License, or (at your option) any later version.
  7. The GNU C Library is distributed in the hope that it will be useful,
  8. but WITHOUT ANY WARRANTY; without even the implied warranty of
  9. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  10. Lesser General Public License for more details.
  11. You should have received a copy of the GNU Lesser General Public
  12. License along with the GNU C Library; if not, write to the Free
  13. Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
  14. 02111-1307 USA.
  15. */
  16. /* Modified for uClibc by Erik Andersen
  17. */
  18. #include <dirent.h>
  19. #include <stdio.h>
  20. #include <string.h>
  21. #include <stdlib.h>
  22. #include <errno.h>
  23. #include <sys/types.h>
  24. #include "dirstream.h"
  25. int scandir(const char *dir, struct dirent ***namelist,
  26. int (*selector) (const struct dirent *),
  27. int (*compar) (const void *, const void *))
  28. {
  29. DIR *dp = opendir (dir);
  30. struct dirent *current;
  31. struct dirent **names = NULL;
  32. size_t names_size = 0, pos;
  33. int save;
  34. if (dp == NULL)
  35. return -1;
  36. save = errno;
  37. __set_errno (0);
  38. pos = 0;
  39. while ((current = readdir (dp)) != NULL)
  40. if (selector == NULL || (*selector) (current))
  41. {
  42. struct dirent *vnew;
  43. size_t dsize;
  44. /* Ignore errors from selector or readdir */
  45. __set_errno (0);
  46. if (unlikely(pos == names_size))
  47. {
  48. struct dirent **new;
  49. if (names_size == 0)
  50. names_size = 10;
  51. else
  52. names_size *= 2;
  53. new = (struct dirent **) realloc (names, names_size * sizeof (struct dirent *));
  54. if (new == NULL)
  55. break;
  56. names = new;
  57. }
  58. dsize = &current->d_name[_D_ALLOC_NAMLEN (current)] - (char *) current;
  59. vnew = (struct dirent *) malloc (dsize);
  60. if (vnew == NULL)
  61. break;
  62. names[pos++] = (struct dirent *) memcpy (vnew, current, dsize);
  63. }
  64. if (unlikely(errno != 0))
  65. {
  66. save = errno;
  67. closedir (dp);
  68. while (pos > 0)
  69. free (names[--pos]);
  70. free (names);
  71. __set_errno (save);
  72. return -1;
  73. }
  74. closedir (dp);
  75. __set_errno (save);
  76. /* Sort the list if we have a comparison function to sort with. */
  77. if (compar != NULL)
  78. qsort (names, pos, sizeof (struct dirent *), compar);
  79. *namelist = names;
  80. return pos;
  81. }