code/recurse.c

Download code/recurse.c
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
/*
For information on this software or to report bugs please visit http://www.ranton.org
or email ranton@ranton.org

For custom software development and consulting please visit http://www.madlogic.com .

Copyright (c) 2003, Richard Neal Anton
All rights reserved.

Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:

*	Redistributions of source code must retain the above copyright notice, this list
	of conditions and the following disclaimer. 

*	Redistributions in binary form must reproduce the above copyright notice, this list
	of conditions and the following disclaimer in the documentation and/or other materials
	provided with the distribution. 

*	The name of the copyright holder may not be used to endorse or promote products 
	derived from this software without specific prior written permission. 

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT
OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/

#include <stdio.h>
#include <stdlib.h>
#include <sys/stat.h>
#include <errno.h>
#include <string.h>
#include <dirent.h>

// this returns true if the path is a dir,
// 0 if it isn't, and -1 and sets errno
// if there was an error.
int path_is_dir( char *inPath );

// this returns true if the path exists
// false if it doesn't, and -1 and sets errno if there
// was an error other than ENOENT
int path_exists( char *inPath );

// recurse through a directory tree, printing it out
void print_dir_tree( char *inPath, int depth )
{
	int ret = path_exists(inPath);
	if( ret == -1 )
		fprintf(stderr,"Error accessing %s: %s\n",inPath,strerror(errno));
	else if( ret == 0 )
		fprintf(stderr,"No such path: %s\n",inPath);
	else
	{
		int c = depth;
		while(c--)
			printf("\t");
		printf("%s\n",inPath);

		if( path_is_dir( inPath ) )
		{
			// opendir
			DIR *dir = opendir( inPath );
			if( !dir )
				fprintf(stderr,"Error opening %s: %s\n",inPath,strerror(errno));
			else
			{
				char *name;
				struct dirent *de;
				while( (de=readdir(dir)) != NULL )
				{
					if( !strcmp(".",de->d_name) || !strcmp("..",de->d_name) )
						continue;

					// recurse
					name = malloc(strlen(inPath) + strlen(de->d_name) + 2);
					if( !name )
						fprintf(stderr,"Not enough memory\n");
					else
					{
						strcpy(name,inPath);
						strcat(name,"/");
						strcat(name,de->d_name);

						print_dir_tree(name,depth+1);

						// free the memory we allocated
						free(name);
					}
				}
				
				if( closedir(dir) )
					fprintf(stderr,"Error closing %s: %s\n",inPath,strerror(errno));
			}
		}
	}
}

int main(int argc, char **argv)
{
	int i;
	if( argc < 2 )
	{
		fprintf(stderr,"Usage: %s <path1> <path2> ... <pathN>\n",argv[0]);
		return 2;
	}

	for(i=1;i<argc;i++)
		print_dir_tree(argv[i],0);

	return 0;
}



// this returns true if the path is a dir,
// 0 if it isn't, and -1 and sets errno
// if there was an error.
int path_is_dir( char *inPath ) 
{
	struct stat st_buf;

	if( stat( inPath, &st_buf ) )
		return -1;

	return S_ISDIR( st_buf.st_mode );
}

// this returns true if the path exists
// false if it doesn't, and -1 and sets errno if there
// was an error other than ENOENT
int path_exists( char *inPath )
{
	struct stat st_buf;
	int ret;

	ret = stat( inPath, &st_buf );
	if( ret == 0 )
		return 1;
	else if( errno == ENOENT )
	{
		return 0;
		errno = 0; // to avoid confusing things
	}
	else
		return -1;
}