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 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302
|
/*----------------------------------------------------------------------------
libtunepimp -- The MusicBrainz tagging library.
Let a thousand taggers bloom!
Copyright (C) Robert Kaye 2003
This file is part of libtunepimp.
libtunepimp is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
libtunepimp is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with libtunepimp; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
$Id: dirsearch.cpp 1461 2006-01-16 15:08:55Z luks $
----------------------------------------------------------------------------*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "../config.h"
#include "dirsearch.h"
#include "tunepimp.h"
#include "utf8/utf8util.h"
#ifdef _WIN32
#include <windows.h>
#else
#include <sys/stat.h>
#include <unistd.h>
#include <sys/types.h>
#include <dirent.h>
#endif
DirSearch::DirSearch(TunePimp *pimp, const vector<string> &extList)
{
this->extList = extList;
this->pimp = pimp;
}
DirSearch::~DirSearch(void)
{
}
#ifdef WIN32
FileType DirSearch::checkFileType(const char *path, bool wide)
{
unsigned type = (unsigned)-1;
if (wide)
{
string fileName = string("\\\\?\\") + string(path);
LPWSTR wFileName = new WCHAR[fileName.size() + 1];
MultiByteToWideChar(CP_UTF8, 0, fileName.c_str(), -1, wFileName, fileName.size() + 1);
type = (int)GetFileAttributesW(wFileName);
delete [] wFileName;
}
else
{
LPSTR fileName = NULL;
if (!utf8_decode(path, &fileName))
{
type = (int)GetFileAttributesA(fileName);
free(fileName);
}
}
if ((int)type < 0)
return ePathNotFound;
if (type & FILE_ATTRIBUTE_DIRECTORY)
return eDir;
if ((type & FILE_ATTRIBUTE_HIDDEN) ||
(type & FILE_ATTRIBUTE_OFFLINE) ||
(type & FILE_ATTRIBUTE_TEMPORARY))
return eOther;
return eFile;
}
int DirSearch::recurseDir(const char *path)
{
union {
WIN32_FIND_DATAW w;
WIN32_FIND_DATAA a;
} find;
HANDLE hFind = INVALID_HANDLE_VALUE;
int count = 0, j;
char newPath[MAX_PATH], savedPath[MAX_PATH];
FileType type;
static bool wide = GetVersion() < 0x80000000;
pimp->setStatus(string("Searching ") + string(path));
strcpy(newPath, path);
if (newPath[strlen(newPath) - 1] == '\\')
newPath[strlen(newPath) - 1] = 0;
strcpy(savedPath, newPath);
type = checkFileType(newPath, wide);
/* if a path was specified, then add a \*.* */
if (type == eDir)
strcat(newPath, "\\*.*");
if (wide)
{
string fileName = string("\\\\?\\") + string(newPath);
LPWSTR wFileName = new WCHAR[fileName.size() + 1];
MultiByteToWideChar(CP_UTF8, 0, fileName.c_str(), -1, wFileName, fileName.size() + 1);
hFind = FindFirstFileW(wFileName, &find.w);
delete [] wFileName;
}
else
{
LPSTR fileName = NULL;
if (!utf8_decode(newPath, &fileName))
{
hFind = FindFirstFileA(fileName, &find.a);
free(fileName);
}
}
if (hFind == INVALID_HANDLE_VALUE)
return -1;
/* If its not a directory, then remove everything after the last slash */
if (type != eDir)
{
char *ptr;
ptr = strrchr(savedPath, '\\');
if (ptr)
*ptr = 0;
}
for(j = 0;; j++)
{
LPSTR fileName = NULL;
if (wide)
{
if (j > 0)
if (!FindNextFileW(hFind, &find.w))
break;
/* get file name in utf8 */
fileName = new CHAR[MAX_PATH];
WideCharToMultiByte(CP_UTF8, 0, find.w.cFileName, -1, fileName, MAX_PATH, NULL, NULL);
}
else
{
if (j > 0)
if (!FindNextFileA(hFind, &find.a))
break;
if (utf8_encode(find.a.cFileName, &fileName))
continue;
}
/* Skip the . and .. dirs */
if (strcmp(fileName, ".") == 0 ||
strcmp(fileName, "..") == 0)
continue;
sprintf(newPath, "%s\\%s", savedPath, fileName);
type = checkFileType(newPath, wide);
if (type == eDir)
count += recurseDir(newPath);
if (type == eFile)
{
vector<string>::iterator i;
char *ptr;
ptr = strrchr(newPath, '.');
if (ptr == NULL)
continue;
for(i = extList.begin(); i != extList.end(); i++)
{
if (strcasecmp((*i).c_str(), ptr) == 0)
{
fileList.push_back(string(newPath));
count++;
break;
}
}
}
if (wide)
delete [] fileName;
else
free(fileName);
}
FindClose(hFind);
return count;
}
#else
// check the type and do the long name lookup on the file
FileType DirSearch::checkFileType(const char *path)
{
struct stat sbuf;
if (lstat(path, &sbuf) == 0)
{
if (S_ISCHR(sbuf.st_mode) || S_ISBLK(sbuf.st_mode) ||
S_ISFIFO(sbuf.st_mode) || S_ISSOCK(sbuf.st_mode))
return eOther;
if (S_ISREG(sbuf.st_mode))
return eFile;
else
if (S_ISDIR(sbuf.st_mode) && !S_ISLNK(sbuf.st_mode))
return eDir;
else
return eOther;
}
else
return ePathNotFound;
}
int DirSearch::recurseDir(const char *path)
{
DIR *dir;
struct dirent *entry;
char newPath[1024];
struct stat sbuf;
string encoding;
encoding = pimp->context.getFileNameEncoding();
pimp->setStatus(string("Searching ") + string(path));
dir = opendir(path);
if (dir == NULL)
{
return 0;
}
for(;;)
{
entry = readdir(dir);
if (!entry)
break;
/* Skip the . and .. dirs */
if (strcmp(entry->d_name, ".") == 0 ||
strcmp(entry->d_name, "..") == 0)
continue;
sprintf(newPath, "%s/%s", path, entry->d_name);
if (lstat(newPath, &sbuf) == 0)
{
if (S_ISDIR(sbuf.st_mode) && !S_ISLNK(sbuf.st_mode))
{
recurseDir(newPath);
}
else
if (S_ISREG(sbuf.st_mode))
{
vector<string>::iterator i;
char *ptr;
ptr = strrchr(entry->d_name, '.');
if (ptr == NULL)
continue;
for(i = extList.begin(); i != extList.end(); i++)
{
if (strcasecmp((*i).c_str(), ptr) == 0)
{
fileList.push_back(utf8FromEncoding(string(newPath), encoding));
break;
}
}
}
}
}
closedir(dir);
return fileList.size();
}
#endif
|