mod/maxgui.mod/fltkmaxgui.mod/src/filename_list.cxx
int fl_filename_list(const char *d, dirent ***list,
                     Fl_File_Sort_F *sort) {
#ifndef HAVE_SCANDIR
  int n = scandir(d, list, 0, sort);
#elif defined(HAVE_SCANDIR_POSIX) && !defined(__APPLE__)
  // POSIX (2008) defines the comparison function like this:
  int n = scandir(d, list, 0, (int(*)(const dirent **, const dirent **))sort);
#elif defined(__osf__)
  // OSF, DU 4.0x
  int n = scandir(d, list, 0, (int(*)(dirent **, dirent **))sort);
#elif defined(_AIX)
  // AIX is almost standard...
  int n = scandir(d, list, 0, (int(*)(void*, void*))sort);
#elif !defined(__sgi)
  // The vast majority of UNIX systems want the sort function to have this
  // prototype, most likely so that it can be passed to qsort without any
  // changes:
  int n = scandir(d, list, 0, (int(*)(const void*,const void*))sort);
#else
  // This version is when we define our own scandir (WIN32 and perhaps
  // some Unix systems) and apparently on IRIX:
  int n = scandir(d, list, 0, sort);
#endif

#if defined(WIN32) && !defined(__CYGWIN__)
  // we did this already during fl_scandir/win32
#else
  // append a '/' to all filenames that are directories
  int i, dirlen = strlen(d);
  char *fullname = (char*)malloc(dirlen+FL_PATH_MAX+3); // Add enough extra for two /'s and a nul
  // Use memcpy for speed since we already know the length of the string...
  memcpy(fullname, d, dirlen+1);
  char *name = fullname + dirlen;
  if (name!=fullname && name[-1]!='/') *name++ = '/';
  for (i=0; i<n; i++) {
    dirent *de = (*list)[i];
    int len = strlen(de->d_name);
    if (de->d_name[len-1]=='/' || len>FL_PATH_MAX) continue;
    // Use memcpy for speed since we already know the length of the string...
    memcpy(name, de->d_name, len+1);
    if (fl_filename_isdir(fullname)) {
      (*list)[i] = de = (dirent*)realloc(de, de->d_name - (char*)de + len + 2);
      char *dst = de->d_name + len;
      *dst++ = '/';
      *dst = 0;
    }
  }
  free(fullname);
#endif
  return n;
}
/**
   Portable and const-correct wrapper for the scandir() function. 
   For each file in that directory a "dirent" structure is created. 
   The only portable thing about a dirent is that dirent.d_name is the nul-terminated file name. 
   An pointers array to these dirent's is created and a pointer to the array is returned in *list.
   The number of entries is given as a return value. 
   If there is an error reading the directory a number less than zero is returned, 
   and errno has the reason; errno does not work under WIN32. 

   \b Include:
   \code
   #include <FL/filename.H>
   \endcode

   \param[in] d the name of the directory to list.  It does not matter if it has a trailing slash.
   \param[out] list table containing the resulting directory listing
   \param[in] sort sorting functor:
    - fl_alphasort: The files are sorted in ascending alphabetical order; 
        upper and lowercase letters are compared according to their ASCII ordering  uppercase before lowercase.
    - fl_casealphasort: The files are sorted in ascending alphabetical order; 
        upper and lowercase letters are compared equally case is not significant.
    - fl_casenumericsort: The files are sorted in ascending "alphanumeric" order, where an attempt is made 
        to put unpadded numbers in consecutive order; upper and lowercase letters 
        are compared equally case is not significant.
    - fl_numericsort: The files are sorted in ascending "alphanumeric" order, where an attempt is made 
        to put unpadded numbers in consecutive order; upper and lowercase letters are compared 
        according to their ASCII ordering - uppercase before lowercase. 
   \return the number of entries if no error, a negative value otherwise.
*/
Portable and const-correct wrapper for the scandir() function.
For each file in that directory a "dirent" structure is created.
The only portable thing about a dirent is that dirent.d_name is the nul-terminated file name.
An pointers array to these dirent's is created and a pointer to the array is returned in *list.
The number of entries is given as a return value.
If there is an error reading the directory a number less than zero is returned,
and errno has the reason; errno does not work under WIN32.

\b Include:
\code
include 
\endcode

\param[in] d the name of the directory to list.  It does not matter if it has a trailing slash.
\param[out] list table containing the resulting directory listing
\param[in] sort sorting functor:
fl_alphasort: The files are sorted in ascending alphabetical order;
upper and lowercase letters are compared according to their ASCII ordering  uppercase before lowercase.
fl_casealphasort: The files are sorted in ascending alphabetical order;
upper and lowercase letters are compared equally case is not significant.
fl_casenumericsort: The files are sorted in ascending "alphanumeric" order, where an attempt is made
to put unpadded numbers in consecutive order; upper and lowercase letters
are compared equally case is not significant.
fl_numericsort: The files are sorted in ascending "alphanumeric" order, where an attempt is made
to put unpadded numbers in consecutive order; upper and lowercase letters are compared
according to their ASCII ordering - uppercase before lowercase.
\return the number of entries if no error, a negative value otherwise.
Portable and const - correct wrapper for the scandir () function . For each file in that directory a " dirent " structure is created . The only portable thing about a dirent is that dirent . d_name is the nul - terminated file name . An pointers array to these dirent ' s is created and a pointer to the array is returned in * list . The number of entries is given as a return value . If there is an error reading the directory a number less than zero is returned and errno has the reason ; errno does not work under WIN32 . \ b Include : \ code include \ endcode \ param [ in ] d the name of the directory to list . It does not matter if it has a trailing slash . \ param [ out ] list table containing the resulting directory listing \ param [ in ] sort sorting functor : fl_alphasort : The files are sorted in ascending alphabetical order ; upper and lowercase letters are compared according to their ASCII ordering uppercase before lowercase . fl_casealphasort : The files are sorted in ascending alphabetical order ; upper and lowercase letters are compared equally case is not significant . fl_casenumericsort : The files are sorted in ascending " alphanumeric " order where an attempt is made to put unpadded numbers in consecutive order ; upper and lowercase letters are compared equally case is not significant . fl_numericsort : The files are sorted in ascending " alphanumeric " order where an attempt is made to put unpadded numbers in consecutive order ; upper and lowercase letters are compared according to their ASCII ordering - uppercase before lowercase . \ return the number of entries if no error a negative value otherwise .
int fl_filename_list(const char *d, dirent ***list,
                     Fl_File_Sort_F *sort) {
#ifndef HAVE_SCANDIR
  int n = scandir(d, list, 0, sort);
#elif defined(HAVE_SCANDIR_POSIX) && !defined(__APPLE__)
  int n = scandir(d, list, 0, (int(*)(const dirent **, const dirent **))sort);
#elif defined(__osf__)
  int n = scandir(d, list, 0, (int(*)(dirent **, dirent **))sort);
#elif defined(_AIX)
  int n = scandir(d, list, 0, (int(*)(void*, void*))sort);
#elif !defined(__sgi)
  int n = scandir(d, list, 0, (int(*)(const void*,const void*))sort);
#else
  int n = scandir(d, list, 0, sort);
#endif
#if defined(WIN32) && !defined(__CYGWIN__)
#else
  int i, dirlen = strlen(d);
  char *fullname = (char*)malloc(dirlen+FL_PATH_MAX+3); 
  memcpy(fullname, d, dirlen+1);
  char *name = fullname + dirlen;
  if (name!=fullname && name[-1]!='/') *name++ = '/';
  for (i=0; i<n; i++) {
    dirent *de = (*list)[i];
    int len = strlen(de->d_name);
    if (de->d_name[len-1]=='/' || len>FL_PATH_MAX) continue;
    memcpy(name, de->d_name, len+1);
    if (fl_filename_isdir(fullname)) {
      (*list)[i] = de = (dirent*)realloc(de, de->d_name - (char*)de + len + 2);
      char *dst = de->d_name + len;
      *dst++ = '/';
      *dst = 0;
    }
  }
  free(fullname);
#endif
  return n;
}
int fl_filename_list ( const char * d , dirent * * * list , Fl_File_Sort_F * sort ) { #ifndef HAVE_SCANDIR int n = scandir ( d , list , 0 , sort ) ; #elif defined ( HAVE_SCANDIR_POSIX ) && ! defined ( __APPLE__ ) int n = scandir ( d , list , 0 , ( int ( * ) ( const dirent * * , const dirent * * ) ) sort ) ; #elif defined ( __osf__ ) int n = scandir ( d , list , 0 , ( int ( * ) ( dirent * * , dirent * * ) ) sort ) ; #elif defined ( _AIX ) int n = scandir ( d , list , 0 , ( int ( * ) ( void * , void * ) ) sort ) ; #elif ! defined ( __sgi ) int n = scandir ( d , list , 0 , ( int ( * ) ( const void * , const void * ) ) sort ) ; #else int n = scandir ( d , list , 0 , sort ) ; #endif #if defined ( WIN32 ) && ! defined ( __CYGWIN__ ) #else int i , dirlen = strlen ( d ) ; char * fullname = ( char * ) malloc ( dirlen + FL_PATH_MAX + 3 ) ; memcpy ( fullname , d , dirlen + 1 ) ; char * name = fullname + dirlen ; if ( name != fullname && name [ -1 ] != ' ' ) * name ++ = ' ' ; for ( i = 0 ; i < n ; i ++ ) { dirent * de = ( * list ) [ i ] ; int len = strlen ( de -> d_name ) ; if ( de -> d_name [ len - 1 ] == ' ' || len > FL_PATH_MAX ) continue ; memcpy ( name , de -> d_name , len + 1 ) ; if ( fl_filename_isdir ( fullname ) ) { ( * list ) [ i ] = de = ( dirent * ) realloc ( de , de -> d_name - ( char * ) de + len + 2 ) ; char * dst = de -> d_name + len ; * dst ++ = ' ' ; * dst = 0 ; } } free ( fullname ) ; #endif return n ; }
Portable and const-correct wrapper for the scandir() function.
Portable and const - correct wrapper for the scandir () function .
// POSIX (2008) defines the comparison function like this: // OSF, DU 4.0x // AIX is almost standard... // The vast majority of UNIX systems want the sort function to have this // prototype, most likely so that it can be passed to qsort without any // changes: // This version is when we define our own scandir (WIN32 and perhaps // some Unix systems) and apparently on IRIX: // we did this already during fl_scandir/win32 // append a '/' to all filenames that are directories // Add enough extra for two /'s and a nul // Use memcpy for speed since we already know the length of the string... // Use memcpy for speed since we already know the length of the string...