findfile.c 8.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299
  1. #include <windows.h>
  2. #include <stdio.h>
  3. #include <stdbool.h>
  4. #include "findfile.h"
  5. #include "beacon.h"
  6. //https://github.com/outflanknl/C2-Tool-Collection/blob/main/BOF/Psx/SOURCE/Psx.c
  7. HRESULT BeaconPrintToStreamW(_In_z_ LPCWSTR lpwFormat, ...) {
  8. HRESULT hr = S_FALSE;
  9. va_list argList;
  10. DWORD dwWritten = 0;
  11. if (g_lpStream <= (LPSTREAM)1) {
  12. hr = OLE32$CreateStreamOnHGlobal(NULL, TRUE, &g_lpStream);
  13. if (FAILED(hr)) {
  14. return hr;
  15. }
  16. }
  17. if (g_lpwPrintBuffer <= (LPWSTR)1) {
  18. g_lpwPrintBuffer = (LPWSTR)MSVCRT$calloc(MAX_STRING, sizeof(WCHAR));
  19. if (g_lpwPrintBuffer == NULL) {
  20. hr = E_FAIL;
  21. goto CleanUp;
  22. }
  23. }
  24. va_start(argList, lpwFormat);
  25. if (!MSVCRT$_vsnwprintf_s(g_lpwPrintBuffer, MAX_STRING, MAX_STRING -1, lpwFormat, argList)) {
  26. hr = E_FAIL;
  27. goto CleanUp;
  28. }
  29. if (g_lpStream != NULL) {
  30. if (FAILED(hr = g_lpStream->lpVtbl->Write(g_lpStream, g_lpwPrintBuffer, (ULONG)MSVCRT$wcslen(g_lpwPrintBuffer) * sizeof(WCHAR), &dwWritten))) {
  31. goto CleanUp;
  32. }
  33. }
  34. hr = S_OK;
  35. CleanUp:
  36. if (g_lpwPrintBuffer != NULL) {
  37. MSVCRT$memset(g_lpwPrintBuffer, 0, MAX_STRING * sizeof(WCHAR)); // Clear print buffer.
  38. }
  39. va_end(argList);
  40. return hr;
  41. }
  42. //https://github.com/outflanknl/C2-Tool-Collection/blob/main/BOF/Psx/SOURCE/Psx.c
  43. VOID BeaconOutputStreamW() {
  44. STATSTG ssStreamData = { 0 };
  45. SIZE_T cbSize = 0;
  46. ULONG cbRead = 0;
  47. LARGE_INTEGER pos;
  48. LPWSTR lpwOutput = NULL;
  49. if (FAILED(g_lpStream->lpVtbl->Stat(g_lpStream, &ssStreamData, STATFLAG_NONAME))) {
  50. return;
  51. }
  52. cbSize = ssStreamData.cbSize.LowPart;
  53. lpwOutput = KERNEL32$HeapAlloc(KERNEL32$GetProcessHeap(), HEAP_ZERO_MEMORY, cbSize + 1);
  54. if (lpwOutput != NULL) {
  55. pos.QuadPart = 0;
  56. if (FAILED(g_lpStream->lpVtbl->Seek(g_lpStream, pos, STREAM_SEEK_SET, NULL))) {
  57. goto CleanUp;
  58. }
  59. if (FAILED(g_lpStream->lpVtbl->Read(g_lpStream, lpwOutput, (ULONG)cbSize, &cbRead))) {
  60. goto CleanUp;
  61. }
  62. BeaconPrintf(CALLBACK_OUTPUT, "%ls", lpwOutput);
  63. }
  64. CleanUp:
  65. if (g_lpStream != NULL) {
  66. g_lpStream->lpVtbl->Release(g_lpStream);
  67. g_lpStream = NULL;
  68. }
  69. if (g_lpwPrintBuffer != NULL) {
  70. MSVCRT$free(g_lpwPrintBuffer);
  71. g_lpwPrintBuffer = NULL;
  72. }
  73. if (lpwOutput != NULL) {
  74. KERNEL32$HeapFree(KERNEL32$GetProcessHeap(), 0, lpwOutput);
  75. }
  76. return;
  77. }
  78. bool keywordMatches(const char* content, const char* keyword) {
  79. size_t keywordLen = MSVCRT$strlen(keyword);
  80. // If keyword is "*example*"
  81. if (keyword[0] == '*' && keyword[keywordLen - 1] == '*') {
  82. char tempKeyword[MAX_PATH];
  83. MSVCRT$strncpy(tempKeyword, keyword + 1, keywordLen - 2);
  84. tempKeyword[keywordLen - 2] = '\0';
  85. if (MSVCRT$strstr(content, tempKeyword)) {
  86. return true;
  87. }
  88. }
  89. // If keyword is "example*"
  90. else if (keyword[keywordLen - 1] == '*') {
  91. char tempKeyword[MAX_PATH];
  92. MSVCRT$strncpy(tempKeyword, keyword, keywordLen - 1);
  93. tempKeyword[keywordLen - 1] = '\0';
  94. if (MSVCRT$strncmp(content, tempKeyword, keywordLen - 1) == 0) {
  95. return true;
  96. }
  97. }
  98. // If keyword is "*example"
  99. else if (keyword[0] == '*') {
  100. if (MSVCRT$strlen(content) >= keywordLen - 1 &&
  101. MSVCRT$strcmp(content + MSVCRT$strlen(content) - (keywordLen - 1), keyword + 1) == 0) {
  102. return true;
  103. }
  104. }
  105. // If keyword is "example"
  106. else if (MSVCRT$strstr(content, keyword)) {
  107. return true;
  108. }
  109. return false;
  110. }
  111. bool SearchFileForKeyword(const char* filePath, const char* keyword) {
  112. FILE *file = MSVCRT$fopen(filePath, "rb");
  113. if (!file) {
  114. BeaconPrintf(CALLBACK_ERROR, "Failed to open file: %s\n", filePath);
  115. return false;
  116. }
  117. MSVCRT$fseek(file, 0, SEEK_END);
  118. long fileSize = MSVCRT$ftell(file);
  119. MSVCRT$fseek(file, 0, SEEK_SET);
  120. char* fileContents = (char*)MSVCRT$malloc(fileSize + 1);
  121. if(!fileContents) {
  122. BeaconPrintf(CALLBACK_ERROR, "Failed to allocate memory for file: %s\n", filePath);
  123. MSVCRT$fclose(file);
  124. return false;
  125. }
  126. MSVCRT$fread(fileContents, 1, fileSize, file);
  127. fileContents[fileSize] = '\0';
  128. MSVCRT$fclose(file);
  129. // Convert file contents to lowercase
  130. for (long i = 0; i < fileSize; i++) {
  131. fileContents[i] = MSVCRT$tolower(fileContents[i]);
  132. }
  133. // Convert keyword to lowercase
  134. char* lowerKeyword = MSVCRT$_strdup(keyword);
  135. if (!lowerKeyword) {
  136. MSVCRT$free(fileContents);
  137. return false;
  138. }
  139. for (int i = 0; lowerKeyword[i]; i++) {
  140. lowerKeyword[i] = MSVCRT$tolower(lowerKeyword[i]);
  141. }
  142. //match line with keyword and return pattern if true
  143. wchar_t wideFullPath[MAX_PATH];
  144. wchar_t wideKeyword[MAX_PATH];
  145. wchar_t wideLine[MAX_PATH];
  146. KERNEL32$MultiByteToWideChar(CP_ACP, 0, filePath, -1, wideFullPath, MAX_PATH);
  147. KERNEL32$MultiByteToWideChar(CP_ACP, 0, keyword, -1, wideKeyword, MAX_PATH);
  148. char* line = MSVCRT$strtok(fileContents, "\n");
  149. bool found = false;
  150. bool firstPrint = true;
  151. while (line) {
  152. if (keywordMatches(line, lowerKeyword)) {
  153. found = true;
  154. KERNEL32$MultiByteToWideChar(CP_ACP, 0, line, -1, wideLine, MAX_PATH);
  155. if (firstPrint) {
  156. BeaconPrintToStreamW(L"\n[+] Keyword '%ls' found in file: %ls\n", wideKeyword, wideFullPath);
  157. firstPrint = false;
  158. }
  159. BeaconPrintToStreamW(L"\t- Matched on pattern: %ls\n", wideLine);
  160. // break; //stop after first match
  161. }
  162. line = MSVCRT$strtok(NULL, "\n");
  163. }
  164. MSVCRT$free(fileContents);
  165. MSVCRT$free(lowerKeyword);
  166. return found;
  167. }
  168. void SearchFilesRecursive(const char* lpFolder, const char* lpSearchPattern, const char* keyword) {
  169. WIN32_FIND_DATAA findFileData;
  170. HANDLE hFind = INVALID_HANDLE_VALUE;
  171. char szDir[MAX_PATH];
  172. DWORD dwError;
  173. // Build search path for files in the current directory
  174. MSVCRT$strcpy(szDir, lpFolder);
  175. MSVCRT$strcat(szDir, "\\");
  176. MSVCRT$strcat(szDir, lpSearchPattern);
  177. // Search for files
  178. hFind = KERNEL32$FindFirstFileA(szDir, &findFileData);
  179. if (hFind != INVALID_HANDLE_VALUE) {
  180. do {
  181. if (!(findFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)) {
  182. char fullPath[MAX_PATH];
  183. MSVCRT$sprintf(fullPath, "%s\\%s", lpFolder, findFileData.cFileName);
  184. wchar_t wideFullPath[MAX_PATH];
  185. KERNEL32$MultiByteToWideChar(CP_ACP, 0, fullPath, -1, wideFullPath, MAX_PATH);
  186. if (*keyword) {
  187. SearchFileForKeyword(fullPath, keyword);
  188. } else if (!*keyword) {
  189. BeaconPrintToStreamW(L"[+] File found: %ls\n", wideFullPath);
  190. }
  191. }
  192. } while (KERNEL32$FindNextFileA(hFind, &findFileData) != 0);
  193. dwError = KERNEL32$GetLastError();
  194. if (dwError != ERROR_NO_MORE_FILES) {
  195. BeaconPrintf(CALLBACK_ERROR, "Error searching for next file: %d\n", dwError);
  196. }
  197. KERNEL32$FindClose(hFind);
  198. }
  199. //search for subdirectories and recurse into them
  200. MSVCRT$strcpy(szDir, lpFolder);
  201. MSVCRT$strcat(szDir, "\\*");
  202. hFind = KERNEL32$FindFirstFileA(szDir, &findFileData);
  203. if (hFind != INVALID_HANDLE_VALUE) {
  204. do {
  205. if (findFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY &&
  206. MSVCRT$strcmp(findFileData.cFileName, ".") != 0 &&
  207. MSVCRT$strcmp(findFileData.cFileName, "..") != 0) {
  208. // Build path for the subdirectory
  209. char subDir[MAX_PATH];
  210. MSVCRT$strcpy(subDir, lpFolder);
  211. MSVCRT$strcat(subDir, "\\");
  212. MSVCRT$strcat(subDir, findFileData.cFileName);
  213. SearchFilesRecursive(subDir, lpSearchPattern, keyword);
  214. }
  215. } while (KERNEL32$FindNextFileA(hFind, &findFileData) != 0);
  216. dwError = KERNEL32$GetLastError();
  217. if (dwError != ERROR_NO_MORE_FILES) {
  218. BeaconPrintf(CALLBACK_ERROR, "Error searching for next file: %d\n", dwError);
  219. }
  220. KERNEL32$FindClose(hFind);
  221. }
  222. }
  223. int go(char *args, int len) {
  224. datap parser;
  225. CHAR *lpDirectory = "";
  226. CHAR *lpSearchPattern = "";
  227. CHAR *keyword = ""; // If not empty, SearchFileForKeyword is called to verify if the keyword is in the text file
  228. BeaconDataParse(&parser, args, len);
  229. lpDirectory = BeaconDataExtract(&parser, NULL);
  230. lpSearchPattern = BeaconDataExtract(&parser, NULL);
  231. keyword = BeaconDataExtract(&parser, NULL);
  232. BeaconPrintToStreamW(L"==========FILE SEARCH RESULTS==========\n");
  233. SearchFilesRecursive(lpDirectory, lpSearchPattern, keyword);
  234. BeaconOutputStreamW();
  235. BeaconPrintf(CALLBACK_OUTPUT, "[+] Finished searching!\n");
  236. return 0;
  237. }