/* Copyright (C) 2010 Elestel This program 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. This program 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 this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */ #include "FolderInfo.h" #include #include #include "../API/RainmeterAPI.h" #define UPDATE_TIME_MIN_MS 10000 CFolderInfo::CFolderInfo(void* ownerSkin) : m_InstanceCount(1), m_Skin(ownerSkin), m_IncludeSubFolders(false), m_IncludeHiddenFiles(false), m_IncludeSystemFiles(false), m_Size(), m_FileCount(), m_FolderCount(), m_RegExpFilter(), m_LastUpdateTime() { } CFolderInfo::~CFolderInfo() { FreePcre(); } void CFolderInfo::AddInstance() { ++m_InstanceCount; } void CFolderInfo::RemoveInstance() { --m_InstanceCount; if (m_InstanceCount == 0) { delete this; } } void CFolderInfo::Clear() { m_Size = 0; m_FileCount = 0; m_FolderCount = 0; } void CFolderInfo::FreePcre() { if (m_RegExpFilter) { pcre_free(m_RegExpFilter); m_RegExpFilter = nullptr; } } void CFolderInfo::Update() { DWORD now = GetTickCount(); if (now - m_LastUpdateTime > UPDATE_TIME_MIN_MS) { Clear(); if (!m_Path.empty()) { CalculateSize(); } m_LastUpdateTime = now; } } void CFolderInfo::CalculateSize() { std::list folderQueue; folderQueue.push_back(m_Path.c_str()); WCHAR searchPattern[MAX_PATH + 10]; WCHAR buffer[MAX_PATH]; char utf8Buf[MAX_PATH * 3]; WIN32_FIND_DATA findData; HANDLE findHandle; while (!folderQueue.empty()) { const RawString& ref = folderQueue.front(); wsprintf(searchPattern, L"%s%s", ref.c_str(), L"\\*.*"); findHandle = FindFirstFile(searchPattern, &findData); if (INVALID_HANDLE_VALUE == findHandle) { folderQueue.pop_front(); continue; } do { // special case for "." and ".." if (wcscmp(findData.cFileName, L".") == 0 || wcscmp(findData.cFileName, L"..") == 0) { continue; } bool isFolder = (findData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) > 0; if (!m_IncludeHiddenFiles && (findData.dwFileAttributes & FILE_ATTRIBUTE_HIDDEN)) { continue; } else if (!m_IncludeSystemFiles && (findData.dwFileAttributes & FILE_ATTRIBUTE_SYSTEM)) { continue; } else if (!isFolder && m_RegExpFilter) { const int utf8BufLen = WideCharToMultiByte( CP_UTF8, 0, findData.cFileName, (int)wcslen(findData.cFileName) + 1, utf8Buf, MAX_PATH * 3, nullptr, nullptr); if (0 != pcre_exec(m_RegExpFilter, nullptr, utf8Buf, utf8BufLen, 0, 0, nullptr, 0)) { continue; } } if (isFolder) { m_FolderCount++; if (m_IncludeSubFolders) { wsprintf(buffer, L"%s\\%s", ref.c_str(), findData.cFileName); folderQueue.push_back(buffer); } } else { m_FileCount++; m_Size += ((UINT64)findData.nFileSizeHigh << 32) + findData.nFileSizeLow; } } while (FindNextFile(findHandle, &findData)); FindClose(findHandle); folderQueue.pop_front(); } } void CFolderInfo::SetPath(LPCWSTR path) { if (wcscmp(m_Path.c_str(), path) != 0) { m_Path = path; // Force update next time m_LastUpdateTime = 0; } } void CFolderInfo::SetRegExpFilter(LPCWSTR filter) { FreePcre(); if (*filter) { const int filterLen = (int)wcslen(filter) + 1; int bufLen = WideCharToMultiByte(CP_UTF8, 0, filter, filterLen, nullptr, 0, nullptr, nullptr); char* buf = new char[bufLen]; WideCharToMultiByte(CP_UTF8, 0, filter, filterLen, buf, bufLen, nullptr, nullptr); const char* error; int erroffset; m_RegExpFilter = pcre_compile(buf, PCRE_UTF8, &error, &erroffset, nullptr); delete [] buf; } }