1 .\" Copyright (c) 1983, 1991, 1993
2 .\" The Regents of the University of California. All rights reserved.
4 .\" Redistribution and use in source and binary forms, with or without
5 .\" modification, are permitted provided that the following conditions
7 .\" 1. Redistributions of source code must retain the above copyright
8 .\" notice, this list of conditions and the following disclaimer.
9 .\" 2. Redistributions in binary form must reproduce the above copyright
10 .\" notice, this list of conditions and the following disclaimer in the
11 .\" documentation and/or other materials provided with the distribution.
12 .\" 4. Neither the name of the University nor the names of its contributors
13 .\" may be used to endorse or promote products derived from this software
14 .\" without specific prior written permission.
16 .\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
17 .\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18 .\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19 .\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
20 .\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 .\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 .\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 .\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 .\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 .\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 .\" @(#)scandir.3 8.1 (Berkeley) 6/4/93
29 .\" $FreeBSD: src/lib/libc/gen/scandir.3,v 1.9 2007/01/09 00:27:55 imp Exp $
45 .Fn scandir "const char *dirname" "struct dirent ***namelist" "int \\*(lp*select\\*(rp\\*(lpstruct dirent *\\*(rp" "int \\*(lp*compar\\*(rp\\*(lpconst void *, const void *\\*(rp"
47 .Fn alphasort "const void *d1" "const void *d2"
50 .Fn scandir_b "const char *dirname" "struct dirent ***namelist" "int \\*(lp^select\\*(rp\\*(lpstruct dirent *\\*(rp" "int \\*(lp^compar\\*(rp\\*(lpconst void *, const void *\\*(rp"
58 and builds an array of pointers to directory
61 It returns the number of entries in the array.
62 A pointer to the array of directory entries is stored in the location
68 argument is a pointer to a user supplied subroutine which is called by
70 to select which entries are to be included in the array.
71 The select routine is passed a
72 pointer to a directory entry and should return a non-zero
73 value if the directory entry is to be included in the array.
76 is null, then all the directory entries will be included.
80 argument is a pointer to a user supplied subroutine which is passed to
82 to sort the completed array.
83 If this pointer is null, the array is not sorted.
84 Note that from within the
86 subroutine, the two arguments are of type
87 .Ft const struct dirent ** ,
88 so that a double-dereference is needed to access the fields in the
95 is a routine which can be used for the
97 argument to sort the array alphabetically.
99 The memory allocated for the array can be deallocated with
101 by freeing each pointer in the array and then the array itself.
102 #ifdef UNIFDEF_BLOCKS
106 function works the same way as the
108 function, except that
112 are blocks instead of subroutines.
115 Returns \-1 if the directory cannot be opened for reading or if
117 cannot allocate enough memory to hold all the data structures.
128 functions appeared in
130 #ifdef UNIFDEF_BLOCKS
133 function appeared in Mac OS X 10.6.