CH> It's basicly a recursive file find function that 
 CH> populates an array with all the files found in and 
 CH> under a given path.  Space for each file name is 
 CH> seperatly malloc()ed and a pointer to the name is 
 CH> stored in the array.

Another idea you might try -- because it is more flexable and uses a lot
less memory,  is to have your "tree walker" callback a supplied
function (via function pointer) for each file and/or dir;  you would never
have to allocate for more than one name at a time --- and if the user of
the tree-walker still wants to build an array,  he still can.


--- Maximus/2 3.00