-
Notifications
You must be signed in to change notification settings - Fork 1.5k
/
yara.c
1744 lines (1387 loc) · 40.3 KB
/
yara.c
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
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright (c) 2007-2021. The YARA Authors. All Rights Reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation and/or
other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#if !defined(_WIN32) && !defined(__CYGWIN__)
// for getline(3)
#define _POSIX_C_SOURCE 200809L
#include <dirent.h>
#include <fcntl.h>
#include <inttypes.h>
#include <sys/stat.h>
#include <unistd.h>
#else
#include <fcntl.h>
#include <io.h>
#include <windows.h>
#define PRIx64 "I64x"
#define PRId64 "I64d"
#endif
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <yara.h>
#include "args.h"
#include "common.h"
#include "threading.h"
#include "unicode.h"
#define ERROR_COULD_NOT_CREATE_THREAD 100
#ifndef MAX_PATH
#define MAX_PATH 256
#endif
#ifndef min
#define min(x, y) ((x < y) ? (x) : (y))
#endif
#define MAX_ARGS_TAG 32
#define MAX_ARGS_IDENTIFIER 32
#define MAX_ARGS_EXT_VAR 32
#define MAX_ARGS_MODULE_DATA 32
#define MAX_QUEUED_FILES 64
#define exit_with_code(code) \
{ \
result = code; \
goto _exit; \
}
typedef struct _MODULE_DATA
{
const char* module_name;
YR_MAPPED_FILE mapped_file;
struct _MODULE_DATA* next;
} MODULE_DATA;
typedef struct _CALLBACK_ARGS
{
const char_t* file_path;
int current_count;
} CALLBACK_ARGS;
typedef struct _THREAD_ARGS
{
YR_SCANNER* scanner;
CALLBACK_ARGS callback_args;
time_t deadline;
int current_count;
} THREAD_ARGS;
typedef struct _QUEUED_FILE
{
char_t* path;
} QUEUED_FILE;
typedef struct COMPILER_RESULTS
{
int errors;
int warnings;
} COMPILER_RESULTS;
typedef struct SCAN_OPTIONS
{
bool follow_symlinks;
bool recursive_search;
time_t deadline;
} SCAN_OPTIONS;
#define MAX_ARGS_TAG 32
#define MAX_ARGS_IDENTIFIER 32
#define MAX_ARGS_EXT_VAR 32
#define MAX_ARGS_MODULE_DATA 32
static char* atom_quality_table;
static char* tags[MAX_ARGS_TAG + 1];
static char* identifiers[MAX_ARGS_IDENTIFIER + 1];
static char* ext_vars[MAX_ARGS_EXT_VAR + 1];
static char* modules_data[MAX_ARGS_MODULE_DATA + 1];
static bool follow_symlinks = true;
static bool recursive_search = false;
static bool scan_list_search = false;
static bool show_module_data = false;
static bool show_tags = false;
static bool show_stats = false;
static bool show_strings = false;
static bool show_string_length = false;
static bool show_xor_key = false;
static bool show_meta = false;
static bool show_module_names = false;
static bool show_namespace = false;
static bool show_version = false;
static bool show_help = false;
static bool ignore_warnings = false;
static bool fast_scan = false;
static bool negate = false;
static bool print_count_only = false;
static bool strict_escape = false;
static bool fail_on_warnings = false;
static bool rules_are_compiled = false;
static bool disable_console_logs = false;
static long total_count = 0;
static long limit = 0;
static long timeout = 1000000;
static long stack_size = DEFAULT_STACK_SIZE;
static long threads = YR_MAX_THREADS;
static long max_strings_per_rule = DEFAULT_MAX_STRINGS_PER_RULE;
static long max_process_memory_chunk = DEFAULT_MAX_PROCESS_MEMORY_CHUNK;
static long long skip_larger = 0;
#define USAGE_STRING \
"Usage: yara [OPTION]... [NAMESPACE:]RULES_FILE... FILE | DIR | PID"
args_option_t options[] = {
OPT_STRING(
0,
_T("atom-quality-table"),
&atom_quality_table,
_T("path to a file with the atom quality table"),
_T("FILE")),
OPT_BOOLEAN(
'C',
_T("compiled-rules"),
&rules_are_compiled,
_T("load compiled rules")),
OPT_BOOLEAN(
'c',
_T("count"),
&print_count_only,
_T("print only number of matches")),
OPT_BOOLEAN(
'E',
_T("strict-escape"),
&strict_escape,
_T("warn on unknown escape sequences")),
OPT_STRING_MULTI(
'd',
_T("define"),
&ext_vars,
MAX_ARGS_EXT_VAR,
_T("define external variable"),
_T("VAR=VALUE")),
OPT_BOOLEAN(
'q',
_T("disable-console-logs"),
&disable_console_logs,
_T("disable printing console log messages")),
OPT_BOOLEAN(
0,
_T("fail-on-warnings"),
&fail_on_warnings,
_T("fail on warnings")),
OPT_BOOLEAN('f', _T("fast-scan"), &fast_scan, _T("fast matching mode")),
OPT_BOOLEAN('h', _T("help"), &show_help, _T("show this help and exit")),
OPT_STRING_MULTI(
'i',
_T("identifier"),
&identifiers,
MAX_ARGS_IDENTIFIER,
_T("print only rules named IDENTIFIER"),
_T("IDENTIFIER")),
OPT_LONG(
0,
_T("max-process-memory-chunk"),
&max_process_memory_chunk,
_T("set maximum chunk size while reading process memory")
_T(" (default=1073741824)"),
_T("NUMBER")),
OPT_LONG(
'l',
_T("max-rules"),
&limit,
_T("abort scanning after matching a NUMBER of rules"),
_T("NUMBER")),
OPT_LONG(
0,
_T("max-strings-per-rule"),
&max_strings_per_rule,
_T("set maximum number of strings per rule (default=10000)"),
_T("NUMBER")),
OPT_STRING_MULTI(
'x',
_T("module-data"),
&modules_data,
MAX_ARGS_MODULE_DATA,
_T("pass FILE's content as extra data to MODULE"),
_T("MODULE=FILE")),
OPT_BOOLEAN(
'n',
_T("negate"),
&negate,
_T("print only not satisfied rules (negate)"),
NULL),
OPT_BOOLEAN(
'N',
_T("no-follow-symlinks"),
&follow_symlinks,
_T("do not follow symlinks when scanning")),
OPT_BOOLEAN(
'w',
_T("no-warnings"),
&ignore_warnings,
_T("disable warnings")),
OPT_BOOLEAN('m', _T("print-meta"), &show_meta, _T("print metadata")),
OPT_BOOLEAN(
'D',
_T("print-module-data"),
&show_module_data,
_T("print module data")),
OPT_BOOLEAN(
'M',
_T("module-names"),
&show_module_names,
_T("show module names")),
OPT_BOOLEAN(
'e',
_T("print-namespace"),
&show_namespace,
_T("print rules' namespace")),
OPT_BOOLEAN(
'S',
_T("print-stats"),
&show_stats,
_T("print rules' statistics")),
OPT_BOOLEAN(
's',
_T("print-strings"),
&show_strings,
_T("print matching strings")),
OPT_BOOLEAN(
'L',
_T("print-string-length"),
&show_string_length,
_T("print length of matched strings")),
OPT_BOOLEAN(
'X',
_T("print-xor-key"),
&show_xor_key,
_T("print xor key and plaintext of matched strings")),
OPT_BOOLEAN('g', _T("print-tags"), &show_tags, _T("print tags")),
OPT_BOOLEAN(
'r',
_T("recursive"),
&recursive_search,
_T("recursively search directories")),
OPT_BOOLEAN(
0,
_T("scan-list"),
&scan_list_search,
_T("scan files listed in FILE, one per line")),
OPT_LONG_LONG(
'z',
_T("skip-larger"),
&skip_larger,
_T("skip files larger than the given size when scanning a directory"),
_T("NUMBER")),
OPT_LONG(
'k',
_T("stack-size"),
&stack_size,
_T("set maximum stack size (default=16384)"),
_T("SLOTS")),
OPT_STRING_MULTI(
't',
_T("tag"),
&tags,
MAX_ARGS_TAG,
_T("print only rules tagged as TAG"),
_T("TAG")),
OPT_LONG(
'p',
_T("threads"),
&threads,
_T("use the specified NUMBER of threads to scan a directory"),
_T("NUMBER")),
OPT_LONG(
'a',
_T("timeout"),
&timeout,
_T("abort scanning after the given number of SECONDS"),
_T("SECONDS")),
OPT_BOOLEAN(
'v',
_T("version"),
&show_version,
_T("show version information")),
OPT_END(),
};
// file_queue is size-limited queue stored as a circular array, files are
// removed from queue_head position and new files are added at queue_tail
// position. The array has room for one extra element to avoid queue_head
// being equal to queue_tail in a full queue. The only situation where
// queue_head == queue_tail is when queue is empty.
QUEUED_FILE file_queue[MAX_QUEUED_FILES + 1];
int queue_head;
int queue_tail;
SEMAPHORE used_slots;
SEMAPHORE unused_slots;
MUTEX queue_mutex;
MUTEX output_mutex;
MODULE_DATA* modules_data_list = NULL;
static int file_queue_init()
{
int result;
queue_tail = 0;
queue_head = 0;
result = cli_mutex_init(&queue_mutex);
if (result != 0)
return result;
result = cli_semaphore_init(&used_slots, 0);
if (result != 0)
return result;
return cli_semaphore_init(&unused_slots, MAX_QUEUED_FILES);
}
static void file_queue_destroy()
{
cli_mutex_destroy(&queue_mutex);
cli_semaphore_destroy(&unused_slots);
cli_semaphore_destroy(&used_slots);
}
static void file_queue_finish()
{
for (int i = 0; i < YR_MAX_THREADS; i++) cli_semaphore_release(&used_slots);
}
static int file_queue_put(const char_t* file_path, time_t deadline)
{
if (cli_semaphore_wait(&unused_slots, deadline) == ERROR_SCAN_TIMEOUT)
return ERROR_SCAN_TIMEOUT;
cli_mutex_lock(&queue_mutex);
file_queue[queue_tail].path = _tcsdup(file_path);
queue_tail = (queue_tail + 1) % (MAX_QUEUED_FILES + 1);
cli_mutex_unlock(&queue_mutex);
cli_semaphore_release(&used_slots);
return ERROR_SUCCESS;
}
static char_t* file_queue_get(time_t deadline)
{
char_t* result;
if (cli_semaphore_wait(&used_slots, deadline) == ERROR_SCAN_TIMEOUT)
return NULL;
cli_mutex_lock(&queue_mutex);
if (queue_head == queue_tail) // queue is empty
{
result = NULL;
}
else
{
result = file_queue[queue_head].path;
queue_head = (queue_head + 1) % (MAX_QUEUED_FILES + 1);
}
cli_mutex_unlock(&queue_mutex);
cli_semaphore_release(&unused_slots);
return result;
}
#if defined(_WIN32) || defined(__CYGWIN__)
static bool is_directory(const char_t* path)
{
DWORD attributes = GetFileAttributes(path);
if (attributes != INVALID_FILE_ATTRIBUTES &&
attributes & FILE_ATTRIBUTE_DIRECTORY)
return true;
else
return false;
}
static int scan_dir(const char_t* dir, SCAN_OPTIONS* scan_opts)
{
int result = ERROR_SUCCESS;
char_t path[MAX_PATH];
_sntprintf(path, MAX_PATH, _T("%s\\*"), dir);
WIN32_FIND_DATA FindFileData;
HANDLE hFind = FindFirstFile(path, &FindFileData);
if (hFind != INVALID_HANDLE_VALUE)
{
do
{
_sntprintf(path, MAX_PATH, _T("%s\\%s"), dir, FindFileData.cFileName);
if (!(FindFileData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY))
{
LARGE_INTEGER file_size;
file_size.HighPart = FindFileData.nFileSizeHigh;
file_size.LowPart = FindFileData.nFileSizeLow;
if (skip_larger > file_size.QuadPart || skip_larger <= 0)
{
result = file_queue_put(path, scan_opts->deadline);
}
else
{
_ftprintf(
stderr,
_T("skipping %s (%" PRIu64
" bytes) because it's larger than %lld bytes.\n"),
path,
file_size.QuadPart,
skip_larger);
}
}
else if (
scan_opts->recursive_search &&
_tcscmp(FindFileData.cFileName, _T(".")) != 0 &&
_tcscmp(FindFileData.cFileName, _T("..")) != 0)
{
result = scan_dir(path, scan_opts);
}
} while (result != ERROR_SCAN_TIMEOUT &&
FindNextFile(hFind, &FindFileData));
FindClose(hFind);
}
return result;
}
static int scan_file(YR_SCANNER* scanner, const char_t* filename)
{
YR_FILE_DESCRIPTOR fd = CreateFile(
filename,
GENERIC_READ,
FILE_SHARE_READ | FILE_SHARE_WRITE,
NULL,
OPEN_EXISTING,
FILE_FLAG_SEQUENTIAL_SCAN,
NULL);
if (fd == INVALID_HANDLE_VALUE)
return ERROR_COULD_NOT_OPEN_FILE;
int result = yr_scanner_scan_fd(scanner, fd);
CloseHandle(fd);
return result;
}
static int populate_scan_list(const char_t* filename, SCAN_OPTIONS* scan_opts)
{
char_t* context;
DWORD nread;
int result = ERROR_SUCCESS;
HANDLE hFile = CreateFile(
filename,
GENERIC_READ,
FILE_SHARE_READ,
NULL,
OPEN_EXISTING,
FILE_ATTRIBUTE_NORMAL,
NULL);
if (hFile == INVALID_HANDLE_VALUE)
{
_ftprintf(stderr, _T("error: could not open file \"%s\".\n"), filename);
return ERROR_COULD_NOT_OPEN_FILE;
}
DWORD fileSize = GetFileSize(hFile, NULL);
if (fileSize == INVALID_FILE_SIZE)
{
_ftprintf(
stderr,
_T("error: could not determine size of file \"%s\".\n"),
filename);
CloseHandle(hFile);
return ERROR_COULD_NOT_READ_FILE;
}
// INVALID_FILE_SIZE is 0xFFFFFFFF, so (+1) will not overflow
char_t* buf = (char_t*) VirtualAlloc(
NULL, fileSize + 1, MEM_COMMIT, PAGE_READWRITE);
if (buf == NULL)
{
_ftprintf(
stderr,
_T("error: could not allocate memory for file \"%s\".\n"),
filename);
CloseHandle(hFile);
return ERROR_INSUFFICIENT_MEMORY;
}
DWORD total = 0;
while (total < fileSize)
{
if (!ReadFile(hFile, buf + total, fileSize - total, &nread, NULL))
{
_ftprintf(stderr, _T("error: could not read file \"%s\".\n"), filename);
CloseHandle(hFile);
return ERROR_COULD_NOT_READ_FILE;
}
total += nread;
}
char_t* path = _tcstok_s(buf, _T("\n"), &context);
while (result != ERROR_SCAN_TIMEOUT && path != NULL)
{
// Remove trailing carriage return, if present.
if (*path != '\0')
{
char_t* final = path + _tcslen(path) - 1;
if (*final == '\r')
*final = '\0';
}
if (is_directory(path))
result = scan_dir(path, scan_opts);
else
result = file_queue_put(path, scan_opts->deadline);
path = _tcstok_s(NULL, _T("\n"), &context);
}
CloseHandle(hFile);
return result;
}
#else
static bool is_directory(const char* path)
{
struct stat st;
if (stat(path, &st) == 0)
return S_ISDIR(st.st_mode);
return 0;
}
static int scan_dir(const char* dir, SCAN_OPTIONS* scan_opts)
{
int result = ERROR_SUCCESS;
DIR* dp = opendir(dir);
if (dp)
{
struct dirent* de = readdir(dp);
while (de && result != ERROR_SCAN_TIMEOUT)
{
char full_path[MAX_PATH];
struct stat st;
snprintf(full_path, sizeof(full_path), "%s/%s", dir, de->d_name);
int err = lstat(full_path, &st);
// If lstat returned error, or this directory entry is a symlink and the
// user doesn't want to follow symlinks, skip the entry and continue with
// the next one.
if (err != 0 || (S_ISLNK(st.st_mode) && !scan_opts->follow_symlinks))
{
de = readdir(dp);
continue;
}
// If the directory entry is a symlink, check if it points to . or .. and
// skip it in those cases.
else if (S_ISLNK(st.st_mode))
{
char buf[2];
int len = readlink(full_path, buf, sizeof(buf));
if ((len == 1 && buf[0] == '.') ||
(len == 2 && buf[0] == '.' && buf[1] == '.'))
{
de = readdir(dp);
continue;
}
}
err = stat(full_path, &st);
if (err == 0)
{
if (S_ISREG(st.st_mode))
{
if (skip_larger > st.st_size || skip_larger <= 0)
{
result = file_queue_put(full_path, scan_opts->deadline);
}
else
{
fprintf(
stderr,
"skipping %s (%" PRId64 " bytes) because it's larger than %lld"
" bytes.\n",
full_path,
st.st_size,
skip_larger);
}
}
else if (
scan_opts->recursive_search && S_ISDIR(st.st_mode) &&
strcmp(de->d_name, ".") != 0 && strcmp(de->d_name, "..") != 0)
{
result = scan_dir(full_path, scan_opts);
}
}
de = readdir(dp);
}
closedir(dp);
}
return result;
}
static int scan_file(YR_SCANNER* scanner, const char_t* filename)
{
YR_FILE_DESCRIPTOR fd = open(filename, O_RDONLY);
if (fd == -1)
return ERROR_COULD_NOT_OPEN_FILE;
int result = yr_scanner_scan_fd(scanner, fd);
close(fd);
return result;
}
static int populate_scan_list(const char* filename, SCAN_OPTIONS* scan_opts)
{
size_t nsize = 0;
ssize_t nread;
char* path = NULL;
int result = ERROR_SUCCESS;
FILE* fh_scan_list = fopen(filename, "r");
if (fh_scan_list == NULL)
{
fprintf(stderr, "error: could not open file \"%s\".\n", filename);
return ERROR_COULD_NOT_OPEN_FILE;
}
while (result != ERROR_SCAN_TIMEOUT &&
(nread = getline(&path, &nsize, fh_scan_list)) != -1)
{
// remove trailing newline
if (nread && path[nread - 1] == '\n')
{
path[nread - 1] = '\0';
nread--;
}
if (is_directory(path))
result = scan_dir(path, scan_opts);
else
result = file_queue_put(path, scan_opts->deadline);
}
free(path);
fclose(fh_scan_list);
return result;
}
#endif
static void print_string(const uint8_t* data, int length, uint8_t xor_key)
{
for (int i = 0; i < length; i++)
{
uint8_t c = data[i] ^ xor_key;
if (c >= 32 && c <= 126)
_tprintf(_T("%c"), c);
else
_tprintf(_T("\\x%02X"), c);
}
}
static char cescapes[] = {
0, 0, 0, 0, 0, 0, 0, 'a', 'b', 't', 'n', 'v', 'f', 'r', 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
};
static void print_escaped(const uint8_t* data, size_t length)
{
for (size_t i = 0; i < length; i++)
{
switch (data[i])
{
case '\"':
case '\'':
case '\\':
_tprintf(_T("\\%" PF_C), data[i]);
break;
default:
if (data[i] >= 127)
_tprintf(_T("\\%03o"), data[i]);
else if (data[i] >= 32)
_tprintf(_T("%" PF_C), data[i]);
else if (cescapes[data[i]] != 0)
_tprintf(_T("\\%" PF_C), cescapes[data[i]]);
else
_tprintf(_T("\\%03o"), data[i]);
}
}
}
static void print_hex_string(const uint8_t* data, int length)
{
for (int i = 0; i < min(64, length); i++)
_tprintf(_T("%s%02X"), (i == 0 ? _T("") : _T(" ")), data[i]);
if (length > 64)
_tprintf(_T(" ..."));
}
static void print_error(int error)
{
switch (error)
{
case ERROR_SUCCESS:
break;
case ERROR_COULD_NOT_ATTACH_TO_PROCESS:
fprintf(stderr, "can not attach to process (try running as root)\n");
break;
case ERROR_INSUFFICIENT_MEMORY:
fprintf(stderr, "not enough memory\n");
break;
case ERROR_SCAN_TIMEOUT:
fprintf(stderr, "scanning timed out\n");
break;
case ERROR_COULD_NOT_OPEN_FILE:
fprintf(stderr, "could not open file\n");
break;
case ERROR_UNSUPPORTED_FILE_VERSION:
fprintf(stderr, "rules were compiled with a different version of YARA\n");
break;
case ERROR_INVALID_FILE:
fprintf(stderr, "invalid compiled rules file.\n");
break;
case ERROR_CORRUPT_FILE:
fprintf(stderr, "corrupt compiled rules file.\n");
break;
case ERROR_EXEC_STACK_OVERFLOW:
fprintf(
stderr,
"stack overflow while evaluating condition "
"(see --stack-size argument) \n");
break;
case ERROR_INVALID_EXTERNAL_VARIABLE_TYPE:
fprintf(stderr, "invalid type for external variable\n");
break;
case ERROR_TOO_MANY_MATCHES:
fprintf(stderr, "too many matches\n");
break;
default:
fprintf(stderr, "error: %d\n", error);
break;
}
}
static void print_scanner_error(YR_SCANNER* scanner, int error)
{
YR_RULE* rule = yr_scanner_last_error_rule(scanner);
YR_STRING* string = yr_scanner_last_error_string(scanner);
if (rule != NULL && string != NULL)
{
fprintf(
stderr,
"string \"%s\" in rule \"%s\" caused ",
string->identifier,
rule->identifier);
}
else if (rule != NULL)
{
fprintf(stderr, "rule \"%s\" caused ", rule->identifier);
}
print_error(error);
}
static void print_compiler_error(
int error_level,
const char* file_name,
int line_number,
const YR_RULE* rule,
const char* message,
void* user_data)
{
char* msg_type;
if (error_level == YARA_ERROR_LEVEL_ERROR)
{
msg_type = "error";
}
else if (!ignore_warnings)
{
COMPILER_RESULTS* compiler_results = (COMPILER_RESULTS*) user_data;
compiler_results->warnings++;
msg_type = "warning";
}
else
{
return;
}
if (rule != NULL)
{
fprintf(
stderr,
"%s: rule \"%s\" in %s(%d): %s\n",
msg_type,
rule->identifier,
file_name,
line_number,
message);
}
else
{
fprintf(
stderr, "%s(%d): %s: %s\n", file_name, line_number, msg_type, message);
}
}
static void print_rules_stats(YR_RULES* rules)
{
YR_RULES_STATS stats;
int t = sizeof(stats.top_ac_match_list_lengths) /
sizeof(stats.top_ac_match_list_lengths[0]);
int result = yr_rules_get_stats(rules, &stats);
if (result != ERROR_SUCCESS)
{
print_error(result);
return;
}
_tprintf(
_T("size of AC transition table : %d\n"), stats.ac_tables_size);
_tprintf(
_T("average length of AC matches lists : %f\n"),
stats.ac_average_match_list_length);
_tprintf(_T("number of rules : %d\n"), stats.num_rules);
_tprintf(_T("number of strings : %d\n"), stats.num_strings);
_tprintf(_T("number of AC matches : %d\n"), stats.ac_matches);
_tprintf(
_T("number of AC matches in root node : %d\n"),
stats.ac_root_match_list_length);
_tprintf(_T("number of AC matches in top %d longest lists\n"), t);
for (int i = 0; i < t; i++)
_tprintf(_T(" %3d: %d\n"), i + 1, stats.top_ac_match_list_lengths[i]);
_tprintf(_T("match list length percentiles\n"));
for (int i = 100; i >= 0; i--)
_tprintf(_T(" %3d: %d\n"), i, stats.ac_match_list_length_pctls[i]);
}
static int handle_message(