src/filesys.cpp

   1 /*
   2 Minetest-c55
   3 Copyright (C) 2010 celeron55, Perttu Ahola <celeron55@gmail.com>
   4
   5 This program is free software; you can redistribute it and/or modify
   6 it under the terms of the GNU General Public License as published by
   7 the Free Software Foundation; either version 2 of the License, or
   8 (at your option) any later version.
   9
  10 This program is distributed in the hope that it will be useful,
  11 but WITHOUT ANY WARRANTY; without even the implied warranty of
  12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13 GNU General Public License for more details.
  14
  15 You should have received a copy of the GNU General Public License along
  16 with this program; if not, write to the Free Software Foundation, Inc.,
  17 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18 */
  19
  20 #include "filesys.h"
  21 #include "strfnd.h"
  22 #include <iostream>
  23 #include <string.h>
  24
  25 namespace fs
  26 {
  27
  28 #ifdef _WIN32 // WINDOWS
  29
  30 #define _WIN32_WINNT 0x0501
  31 #include <windows.h>
  32 #include <stdio.h>
  33 #include <malloc.h>
  34 #include <tchar.h>
  35 #include <wchar.h>
  36 #include <stdio.h>
  37
  38 #define BUFSIZE MAX_PATH
  39
  40 std::vector<DirListNode> GetDirListing(std::string pathstring)
  41 {
  42         std::vector<DirListNode> listing;
  43
  44         WIN32_FIND_DATA FindFileData;
  45         HANDLE hFind = INVALID_HANDLE_VALUE;
  46         DWORD dwError;
  47         LPTSTR DirSpec;
  48         INT retval;
  49
  50         DirSpec = (LPTSTR) malloc (BUFSIZE);
  51
  52         if( DirSpec == NULL )
  53         {
  54           printf( "Insufficient memory available\n" );
  55           retval = 1;
  56           goto Cleanup;
  57         }
  58
  59         // Check that the input is not larger than allowed.
  60         if (pathstring.size() > (BUFSIZE - 2))
  61         {
  62           _tprintf(TEXT("Input directory is too large.\n"));
  63           retval = 3;
  64           goto Cleanup;
  65         }
  66
  67         //_tprintf (TEXT("Target directory is %s.\n"), pathstring.c_str());
  68
  69         sprintf(DirSpec, "%s", (pathstring + "\\*").c_str());
  70
  71         // Find the first file in the directory.
  72         hFind = FindFirstFile(DirSpec, &FindFileData);
  73
  74         if (hFind == INVALID_HANDLE_VALUE)
  75         {
  76           _tprintf (TEXT("Invalid file handle. Error is %u.\n"),
  77                                 GetLastError());
  78           retval = (-1);
  79         }
  80         else
  81         {
  82                 // NOTE:
  83                 // Be very sure to not include '..' in the results, it will
  84                 // result in an epic failure when deleting stuff.
  85
  86                 DirListNode node;
  87                 node.name = FindFileData.cFileName;
  88                 node.dir = FindFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY;
  89                 if(node.name != "." && node.name != "..")
  90                         listing.push_back(node);
  91
  92                 // List all the other files in the directory.
  93                 while (FindNextFile(hFind, &FindFileData) != 0)
  94                 {
  95                         DirListNode node;
  96                         node.name = FindFileData.cFileName;
  97                         node.dir = FindFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY;
  98                         if(node.name != "." && node.name != "..")
  99                                 listing.push_back(node);
 100                 }
 101
 102                 dwError = GetLastError();
 103                 FindClose(hFind);
 104                 if (dwError != ERROR_NO_MORE_FILES)
 105                 {
 106                  _tprintf (TEXT("FindNextFile error. Error is %u.\n"),
 107                                    dwError);
 108                 retval = (-1);
 109                 goto Cleanup;
 110                 }
 111         }
 112         retval  = 0;
 113
 114 Cleanup:
 115         free(DirSpec);
 116
 117         if(retval != 0) listing.clear();
 118
 119         //for(unsigned int i=0; i<listing.size(); i++){
 120         //      std::cout<<listing[i].name<<(listing[i].dir?" (dir)":" (file)")<<std::endl;
 121         //}
 122
 123         return listing;
 124 }
 125
 126 bool CreateDir(std::string path)
 127 {
 128         bool r = CreateDirectory(path.c_str(), NULL);
 129         if(r == true)
 130                 return true;
 131         if(GetLastError() == ERROR_ALREADY_EXISTS)
 132                 return true;
 133         return false;
 134 }
 135
 136 bool PathExists(std::string path)
 137 {
 138         return (GetFileAttributes(path.c_str()) != INVALID_FILE_ATTRIBUTES);
 139 }
 140
 141 bool RecursiveDelete(std::string path)
 142 {
 143         std::cerr<<"Removing \""<<path<<"\""<<std::endl;
 144
 145         //return false;
 146
 147         // This silly function needs a double-null terminated string...
 148         // Well, we'll just make sure it has at least two, then.
 149         path += "\0\0";
 150
 151         SHFILEOPSTRUCT sfo;
 152         sfo.hwnd = NULL;
 153         sfo.wFunc = FO_DELETE;
 154         sfo.pFrom = path.c_str();
 155         sfo.pTo = NULL;
 156         sfo.fFlags = FOF_SILENT | FOF_NOCONFIRMATION | FOF_NOCONFIRMMKDIR;
 157
 158         int r = SHFileOperation(&sfo);
 159
 160         if(r != 0)
 161                 std::cerr<<"SHFileOperation returned "<<r<<std::endl;
 162
 163         //return (r == 0);
 164         return true;
 165 }
 166
 167 #else // POSIX
 168
 169 #include <sys/types.h>
 170 #include <dirent.h>
 171 #include <errno.h>
 172 #include <sys/stat.h>
 173 #include <sys/wait.h>
 174
 175 std::vector<DirListNode> GetDirListing(std::string pathstring)
 176 {
 177         std::vector<DirListNode> listing;
 178
 179     DIR *dp;
 180     struct dirent *dirp;
 181     if((dp  = opendir(pathstring.c_str())) == NULL) {
 182                 //std::cout<<"Error("<<errno<<") opening "<<pathstring<<std::endl;
 183         return listing;
 184     }
 185
 186     while ((dirp = readdir(dp)) != NULL) {
 187                 // NOTE:
 188                 // Be very sure to not include '..' in the results, it will
 189                 // result in an epic failure when deleting stuff.
 190                 if(dirp->d_name[0]!='.'){
 191                         DirListNode node;
 192                         node.name = dirp->d_name;
 193                         if(node.name == "." || node.name == "..")
 194                                 continue;
 195
 196                         int isdir = -1; // -1 means unknown
 197
 198                         /*
 199                                 POSIX doesn't define d_type member of
 200                                 struct dirent and certain filesystems on
 201                                 glibc/Linux will only return DT_UNKNOWN for
 202                                 the d_type member.
 203                         */
 204 #ifdef _DIRENT_HAVE_D_TYPE
 205                         if(dirp->d_type != DT_UNKNOWN)
 206                                 isdir = (dirp->d_type == DT_DIR);
 207 #endif /* _DIRENT_HAVE_D_TYPE */
 208
 209                         /*
 210                                 Was d_type DT_UNKNOWN (or nonexistent)?
 211                                 If so, try stat().
 212                         */
 213                         if(isdir == -1)
 214                         {
 215                                 struct stat statbuf;
 216                                 if (stat((pathstring + "/" + node.name).c_str(), &statbuf))
 217                                         continue;
 218                                 isdir = ((statbuf.st_mode & S_IFDIR) == S_IFDIR);
 219                         }
 220                         node.dir = isdir;
 221                         listing.push_back(node);
 222                 }
 223     }
 224     closedir(dp);
 225
 226         return listing;
 227 }
 228
 229 bool CreateDir(std::string path)
 230 {
 231         int r = mkdir(path.c_str(), S_IRWXU | S_IRWXG | S_IROTH | S_IXOTH);
 232         if(r == 0)
 233         {
 234                 return true;
 235         }
 236         else
 237         {
 238                 // If already exists, return true
 239                 if(errno == EEXIST)
 240                         return true;
 241                 return false;
 242         }
 243 }
 244
 245 bool PathExists(std::string path)
 246 {
 247         struct stat st;
 248         return (stat(path.c_str(),&st) == 0);
 249 }
 250
 251 bool RecursiveDelete(std::string path)
 252 {
 253         /*
 254                 Execute the 'rm' command directly, by fork() and execve()
 255         */
 256
 257         std::cerr<<"Removing \""<<path<<"\""<<std::endl;
 258
 259         //return false;
 260
 261         pid_t child_pid = fork();
 262
 263         if(child_pid == 0)
 264         {
 265                 // Child
 266                 char argv_data[3][10000];
 267                 strcpy(argv_data[0], "/bin/rm");
 268                 strcpy(argv_data[1], "-rf");
 269                 strncpy(argv_data[2], path.c_str(), 10000);
 270                 char *argv[4];
 271                 argv[0] = argv_data[0];
 272                 argv[1] = argv_data[1];
 273                 argv[2] = argv_data[2];
 274                 argv[3] = NULL;
 275
 276                 std::cerr<<"Executing '"<<argv[0]<<"' '"<<argv[1]<<"' '"
 277                                 <<argv[2]<<"'"<<std::endl;
 278
 279                 execv(argv[0], argv);
 280
 281                 // Execv shouldn't return. Failed.
 282                 _exit(1);
 283         }
 284         else
 285         {
 286                 // Parent
 287                 int child_status;
 288                 pid_t tpid;
 289                 do{
 290                         tpid = wait(&child_status);
 291                         //if(tpid != child_pid) process_terminated(tpid);
 292                 }while(tpid != child_pid);
 293                 return (child_status == 0);
 294         }
 295 }
 296
 297 #endif
 298
 299 bool RecursiveDeleteContent(std::string path)
 300 {
 301         std::cerr<<"Removing content of \""<<path<<"\""<<std::endl;
 302         std::vector<DirListNode> list = GetDirListing(path);
 303         for(unsigned int i=0; i<list.size(); i++)
 304         {
 305                 if(trim(list[i].name) == "." || trim(list[i].name) == "..")
 306                         continue;
 307                 std::string childpath = path + DIR_DELIM + list[i].name;
 308                 bool r = RecursiveDelete(childpath);
 309                 if(r == false)
 310                 {
 311                         std::cerr<<"Removing \""<<childpath<<"\" failed"<<std::endl;
 312                         return false;
 313                 }
 314         }
 315         return true;
 316 }
 317
 318 bool CreateAllDirs(std::string path)
 319 {
 320
 321         size_t pos;
 322         std::vector<std::string> tocreate;
 323         std::string basepath = path;
 324         while(!PathExists(basepath))
 325         {
 326                 tocreate.push_back(basepath);
 327                 pos = basepath.rfind(DIR_DELIM_C);
 328                 if(pos == std::string::npos)
 329                         return false;
 330                 basepath = basepath.substr(0,pos);
 331         }
 332         for(int i=tocreate.size()-1;i>=0;i--)
 333                 CreateDir(tocreate[i]);
 334         return true;
 335 }
 336
 337 } // namespace fs
 338