scandir.c 2.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899
  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. #define qsort __qsort
  19. #include <dirent.h>
  20. #include <stdio.h>
  21. #include <string.h>
  22. #include <stdlib.h>
  23. #include <errno.h>
  24. #include <sys/types.h>
  25. #include "dirstream.h"
  26. int scandir(const char *dir, struct dirent ***namelist,
  27. int (*selector) (const struct dirent *),
  28. int (*compar) (const void *, const void *))
  29. {
  30. DIR *dp = opendir (dir);
  31. struct dirent *current;
  32. struct dirent **names = NULL;
  33. size_t names_size = 0, pos;
  34. int save;
  35. if (dp == NULL)
  36. return -1;
  37. save = errno;
  38. __set_errno (0);
  39. pos = 0;
  40. while ((current = readdir (dp)) != NULL)
  41. if (selector == NULL || (*selector) (current))
  42. {
  43. struct dirent *vnew;
  44. size_t dsize;
  45. /* Ignore errors from selector or readdir */
  46. __set_errno (0);
  47. if (unlikely(pos == names_size))
  48. {
  49. struct dirent **new;
  50. if (names_size == 0)
  51. names_size = 10;
  52. else
  53. names_size *= 2;
  54. new = (struct dirent **) realloc (names, names_size * sizeof (struct dirent *));
  55. if (new == NULL)
  56. break;
  57. names = new;
  58. }
  59. dsize = &current->d_name[_D_ALLOC_NAMLEN (current)] - (char *) current;
  60. vnew = (struct dirent *) malloc (dsize);
  61. if (vnew == NULL)
  62. break;
  63. names[pos++] = (struct dirent *) __memcpy (vnew, current, dsize);
  64. }
  65. if (unlikely(errno != 0))
  66. {
  67. save = errno;
  68. closedir (dp);
  69. while (pos > 0)
  70. free (names[--pos]);
  71. free (names);
  72. __set_errno (save);
  73. return -1;
  74. }
  75. closedir (dp);
  76. __set_errno (save);
  77. /* Sort the list if we have a comparison function to sort with. */
  78. if (compar != NULL)
  79. qsort (names, pos, sizeof (struct dirent *), compar);
  80. *namelist = names;
  81. return pos;
  82. }