Eric Andersen | aad1a88 | 2001-03-16 22:47:14 +0000 | [diff] [blame] | 1 | /* vi: set sw=4 ts=4: */ |
| 2 | /* |
| 3 | * Utility routines. |
| 4 | * |
| 5 | * Copyright (C) tons of folks. Tracking down who wrote what |
| 6 | * isn't something I'm going to worry about... If you wrote something |
| 7 | * here, please feel free to acknowledge your work. |
| 8 | * |
| 9 | * This program is free software; you can redistribute it and/or modify |
| 10 | * it under the terms of the GNU General Public License as published by |
| 11 | * the Free Software Foundation; either version 2 of the License, or |
| 12 | * (at your option) any later version. |
| 13 | * |
| 14 | * This program is distributed in the hope that it will be useful, |
| 15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| 17 | * General Public License for more details. |
| 18 | * |
| 19 | * You should have received a copy of the GNU General Public License |
| 20 | * along with this program; if not, write to the Free Software |
| 21 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
| 22 | * |
| 23 | * Based in part on code from sash, Copyright (c) 1999 by David I. Bell |
| 24 | * Permission has been granted to redistribute this code under the GPL. |
| 25 | * |
| 26 | */ |
| 27 | |
| 28 | #include <stdio.h> |
Eric Andersen | 1ca20a7 | 2001-03-21 07:34:27 +0000 | [diff] [blame] | 29 | #include <string.h> |
Eric Andersen | aad1a88 | 2001-03-16 22:47:14 +0000 | [diff] [blame] | 30 | #include <dirent.h> |
| 31 | #include <sys/stat.h> |
| 32 | #include "libbb.h" |
| 33 | |
| 34 | /* same conditions as recursive_action */ |
| 35 | #define bb_need_name_too_long |
| 36 | #define BB_DECLARE_EXTERN |
| 37 | #include "../messages.c" |
| 38 | |
| 39 | #undef DEBUG_RECURS_ACTION |
| 40 | |
| 41 | |
| 42 | /* |
| 43 | * Walk down all the directories under the specified |
| 44 | * location, and do something (something specified |
| 45 | * by the fileAction and dirAction function pointers). |
| 46 | * |
| 47 | * Unfortunately, while nftw(3) could replace this and reduce |
| 48 | * code size a bit, nftw() wasn't supported before GNU libc 2.1, |
| 49 | * and so isn't sufficiently portable to take over since glibc2.1 |
| 50 | * is so stinking huge. |
| 51 | */ |
| 52 | int recursive_action(const char *fileName, |
| 53 | int recurse, int followLinks, int depthFirst, |
| 54 | int (*fileAction) (const char *fileName, |
| 55 | struct stat * statbuf, |
| 56 | void* userData), |
| 57 | int (*dirAction) (const char *fileName, |
| 58 | struct stat * statbuf, |
| 59 | void* userData), |
| 60 | void* userData) |
| 61 | { |
| 62 | int status; |
| 63 | struct stat statbuf; |
| 64 | struct dirent *next; |
| 65 | |
| 66 | if (followLinks == TRUE) |
| 67 | status = stat(fileName, &statbuf); |
| 68 | else |
| 69 | status = lstat(fileName, &statbuf); |
| 70 | |
| 71 | if (status < 0) { |
| 72 | #ifdef DEBUG_RECURS_ACTION |
| 73 | fprintf(stderr, |
| 74 | "status=%d followLinks=%d TRUE=%d\n", |
| 75 | status, followLinks, TRUE); |
| 76 | #endif |
| 77 | perror_msg("%s", fileName); |
| 78 | return FALSE; |
| 79 | } |
| 80 | |
| 81 | if ((followLinks == FALSE) && (S_ISLNK(statbuf.st_mode))) { |
| 82 | if (fileAction == NULL) |
| 83 | return TRUE; |
| 84 | else |
| 85 | return fileAction(fileName, &statbuf, userData); |
| 86 | } |
| 87 | |
| 88 | if (recurse == FALSE) { |
| 89 | if (S_ISDIR(statbuf.st_mode)) { |
| 90 | if (dirAction != NULL) |
| 91 | return (dirAction(fileName, &statbuf, userData)); |
| 92 | else |
| 93 | return TRUE; |
| 94 | } |
| 95 | } |
| 96 | |
| 97 | if (S_ISDIR(statbuf.st_mode)) { |
| 98 | DIR *dir; |
| 99 | |
| 100 | if (dirAction != NULL && depthFirst == FALSE) { |
| 101 | status = dirAction(fileName, &statbuf, userData); |
| 102 | if (status == FALSE) { |
| 103 | perror_msg("%s", fileName); |
| 104 | return FALSE; |
| 105 | } else if (status == SKIP) |
| 106 | return TRUE; |
| 107 | } |
| 108 | dir = opendir(fileName); |
| 109 | if (!dir) { |
| 110 | perror_msg("%s", fileName); |
| 111 | return FALSE; |
| 112 | } |
| 113 | status = TRUE; |
| 114 | while ((next = readdir(dir)) != NULL) { |
| 115 | char nextFile[PATH_MAX]; |
| 116 | |
| 117 | if ((strcmp(next->d_name, "..") == 0) |
| 118 | || (strcmp(next->d_name, ".") == 0)) { |
| 119 | continue; |
| 120 | } |
| 121 | if (strlen(fileName) + strlen(next->d_name) + 1 > PATH_MAX) { |
| 122 | error_msg(name_too_long); |
| 123 | return FALSE; |
| 124 | } |
| 125 | memset(nextFile, 0, sizeof(nextFile)); |
| 126 | if (fileName[strlen(fileName)-1] == '/') |
| 127 | sprintf(nextFile, "%s%s", fileName, next->d_name); |
| 128 | else |
| 129 | sprintf(nextFile, "%s/%s", fileName, next->d_name); |
| 130 | if (recursive_action(nextFile, TRUE, followLinks, depthFirst, |
| 131 | fileAction, dirAction, userData) == FALSE) { |
| 132 | status = FALSE; |
| 133 | } |
| 134 | } |
| 135 | closedir(dir); |
| 136 | if (dirAction != NULL && depthFirst == TRUE) { |
| 137 | if (dirAction(fileName, &statbuf, userData) == FALSE) { |
| 138 | perror_msg("%s", fileName); |
| 139 | return FALSE; |
| 140 | } |
| 141 | } |
| 142 | if (status == FALSE) |
| 143 | return FALSE; |
| 144 | } else { |
| 145 | if (fileAction == NULL) |
| 146 | return TRUE; |
| 147 | else |
| 148 | return fileAction(fileName, &statbuf, userData); |
| 149 | } |
| 150 | return TRUE; |
| 151 | } |
| 152 | |
| 153 | |
| 154 | /* END CODE */ |
| 155 | /* |
| 156 | Local Variables: |
| 157 | c-file-style: "linux" |
| 158 | c-basic-offset: 4 |
| 159 | tab-width: 4 |
| 160 | End: |
| 161 | */ |