forked from Battelle/sandsifter
-
Notifications
You must be signed in to change notification settings - Fork 350
/
injector.c
1518 lines (1371 loc) · 34.9 KB
/
injector.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
/* x86 instruction injector */
/* domas // @xoreaxeaxeax */
/* some logic in the fault handler requires compiling without optimizations */
#define _GNU_SOURCE
#include <stdio.h>
#include <unistd.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>
#include <signal.h>
#include <time.h>
#include <execinfo.h>
#include <limits.h>
#include <ucontext.h>
#include <sys/types.h>
#include <stdint.h>
#include <stdbool.h>
#include <inttypes.h>
#include <sys/mman.h>
#include <assert.h>
#include <sched.h>
#include <pthread.h>
#include <sys/wait.h>
/* configuration */
struct {
/* main limit on search is # of prefixes to explore */
bool allow_dup_prefix;
int max_prefix;
int brute_depth;
long seed;
int range_bytes;
bool show_tick;
int jobs;
bool force_core;
int core;
/* run as root to allow access to [0]. this will allow most memory accesses
* generated by the injector to succeed rather than fault, which permits
* improved fault analysis (e.g. sigsegv will preempt sigfpe; eliminating
* the initial sigsegv will allow reception of the more descriptive signals) */
bool enable_null_access;
bool nx_support;
} config={
.allow_dup_prefix=false,
.max_prefix=0,
.brute_depth=4,
.seed=0,
.range_bytes=0,
.show_tick=false,
.jobs=1,
.force_core=false,
.core=0,
.enable_null_access=false,
.nx_support=true,
};
/* capstone */
#define USE_CAPSTONE true /* sifter offloads some capstone work to injector */
#if USE_CAPSTONE
#include <capstone/capstone.h>
#if __x86_64__
#define CS_MODE CS_MODE_64
#else
#define CS_MODE CS_MODE_32
#endif
#endif
#if USE_CAPSTONE
csh capstone_handle;
cs_insn *capstone_insn;
#endif
/* 32 vs 64 */
#if __x86_64__
#define IP REG_RIP
#else
#define IP REG_EIP
#endif
/* leave state as 0 */
/* : encourages instructions to access a consistent address (0) */
/* : avoids crashing the injector (e.g. incidental write to .data) */
/* only change when necessary for synthesizing specific instructions */
#if __x86_64__
typedef struct {
uint64_t rax;
uint64_t rbx;
uint64_t rcx;
uint64_t rdx;
uint64_t rsi;
uint64_t rdi;
uint64_t r8;
uint64_t r9;
uint64_t r10;
uint64_t r11;
uint64_t r12;
uint64_t r13;
uint64_t r14;
uint64_t r15;
uint64_t rbp;
uint64_t rsp;
} state_t;
state_t inject_state={
.rax=0,
.rbx=0,
.rcx=0,
.rdx=0,
.rsi=0,
.rdi=0,
.r8=0,
.r9=0,
.r10=0,
.r11=0,
.r12=0,
.r13=0,
.r14=0,
.r15=0,
.rbp=0,
.rsp=0,
};
#else
typedef struct {
uint32_t eax;
uint32_t ebx;
uint32_t ecx;
uint32_t edx;
uint32_t esi;
uint32_t edi;
uint32_t ebp;
uint32_t esp;
} state_t;
state_t inject_state={
.eax=0,
.ebx=0,
.ecx=0,
.edx=0,
.esi=0,
.edi=0,
.ebp=0,
.esp=0,
};
#endif
/* helpers */
#define STR(x) #x
#define XSTR(x) STR(x)
/* x86/64 */
#define UD2_SIZE 2
#define PAGE_SIZE 4096
#define TF 0x100
/* injection */
#define USE_TF true /* leave true, except when synthesizing some specific instructions */
typedef enum { BRUTE, RAND, TUNNEL, DRIVEN } search_mode_t;
search_mode_t mode=TUNNEL;
void* packet_buffer;
char* packet;
static char stack[SIGSTKSZ];
stack_t ss = { .ss_size = SIGSTKSZ, .ss_sp = stack, };
struct {
uint64_t dummy_stack_hi[256];
uint64_t dummy_stack_lo[256];
} dummy_stack __attribute__ ((aligned(PAGE_SIZE)));
#define MAX_INSN_LENGTH 15 /* actually 15 */
/* fault handler tries to use fault address to make an initial guess of
* instruction length; but length of jump instructions can't be determined from
* trap alone */
/* set to this if something seems wrong */
#define JMP_LENGTH 16
typedef struct {
uint8_t bytes[MAX_INSN_LENGTH];
int len; /* the number of specified bytes in the instruction */
} insn_t;
typedef struct {
insn_t i;
int index;
int last_len;
} inj_t;
inj_t inj;
static const insn_t null_insn={};
mcontext_t fault_context;
/* feedback */
typedef enum { TEXT, RAW } output_t;
output_t output=TEXT;
#define TICK_MASK 0xffff
#define RAW_REPORT_INSN_BYTES 16
#define RAW_REPORT_DISAS_MNE false /* sifter assumes false */
#define RAW_REPORT_DISAS_MNE_BYTES 16
#define RAW_REPORT_DISAS_OPS false /* sifter assumes false */
#define RAW_REPORT_DISAS_OPS_BYTES 32
#define RAW_REPORT_DISAS_LEN true /* sifter assumes true */
#define RAW_REPORT_DISAS_VAL true /* sifter assumes true */
typedef struct __attribute__ ((packed)) {
uint32_t valid;
uint32_t length;
uint32_t signum;
uint32_t si_code;
uint32_t addr;
} result_t;
result_t result;
typedef struct __attribute__ ((packed)) {
#if RAW_REPORT_DISAS_MNE
char mne[RAW_REPORT_DISAS_MNE_BYTES];
#endif
#if RAW_REPORT_DISAS_OPS
char ops[RAW_REPORT_DISAS_OPS_BYTES];
#endif
#if RAW_REPORT_DISAS_LEN
int len;
#endif
#if RAW_REPORT_DISAS_VAL
int val;
#endif
} disas_t;
disas_t disas;
/* blacklists */
#define MAX_BLACKLIST 128
typedef struct {
char* opcode;
char* reason;
} ignore_op_t;
ignore_op_t opcode_blacklist[MAX_BLACKLIST]={
{ "\x0f\x34", "sysenter" },
{ "\x0f\xa1", "pop fs" },
{ "\x0f\xa9", "pop gs" },
{ "\x8e", "mov seg" },
{ "\xc8", "enter" },
#if !__x86_64__
/* vex in 64 (though still can be vex in 32...) */
{ "\xc5", "lds" },
{ "\xc4", "les" },
#endif
{ "\x0f\xb2", "lss" },
{ "\x0f\xb4", "lfs" },
{ "\x0f\xb5", "lgs" },
#if __x86_64__
/* 64 bit only - intel "discourages" using this without a rex* prefix, and
* so capstone doesn't parse it */
{ "\x63", "movsxd" },
#endif
/* segfaulting with various "mov sp" (always sp) in random synthesizing, too
* tired to figure out why: 66 bc7453 */
{ "\xbc", "mov sp" },
/* segfaulting with "shr sp, 1" (always sp) in random synthesizing, too tired to
* figure out why: 66 d1ec */
/* haven't observed but assuming "shl sp, 1" and "sar sp, 1" fault as well */
{ "\xd1\xec", "shr sp, 1" },
{ "\xd1\xe4", "shl sp, 1" },
{ "\xd1\xfc", "sar sp, 1" },
/* same with "rcr sp, 1", assuming same for rcl, ror, rol */
{ "\xd1\xdc", "rcr sp, 1" },
{ "\xd1\xd4", "rcl sp, 1" },
{ "\xd1\xcc", "ror sp, 1" },
{ "\xd1\xc4", "rol sp, 1" },
/* same with lea sp */
{ "\x8d\xa2", "lea sp" },
/* i guess these are because if you shift esp, you wind up way outside your
* address space; if you shift sp, just a little, you stay in and crash */
/* unable to resolve a constant length for xbegin, causes tunnel to stall */
{ "\xc7\xf8", "xbegin" },
/* int 80 will obviously cause issues */
{ "\xcd\x80", "int 0x80" },
/* as will syscall */
{ "\x0f\x05", "syscall" },
/* ud2 is an undefined opcode, and messes up a length differential search
* b/c of the fault it throws */
{ "\x0f\xb9", "ud2" },
{ NULL, NULL }
};
typedef struct {
char* prefix;
char* reason;
} ignore_pre_t;
ignore_pre_t prefix_blacklist[]={
#if !__x86_64__
/* avoid overwriting tls or something in 32 bit code */
{ "\x65", "gs" },
#endif
{ NULL, NULL }
};
/* search ranges */
typedef struct { insn_t start; insn_t end; bool started; } range_t;
insn_t* range_marker=NULL;
range_t search_range={};
range_t total_range={
.start={.bytes={0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00}, .len=0},
.end={.bytes={0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff,0xff}, .len=0},
.started=false
};
/* processes */
pthread_mutex_t* pool_mutex=NULL;
pthread_mutex_t* output_mutex=NULL;
pthread_mutexattr_t mutex_attr;
/* syncronized output */
#define LINE_BUFFER_SIZE 256
#define BUFFER_LINES 16
#define SYNC_LINES_STDOUT BUFFER_LINES /* must be <= BUFFER_LINES */
#define SYNC_LINES_STDERR BUFFER_LINES /* must be <= BUFFER_LINES */
char stdout_buffer[LINE_BUFFER_SIZE*BUFFER_LINES];
char* stdout_buffer_pos=stdout_buffer;
int stdout_sync_counter=0;
char stderr_buffer[LINE_BUFFER_SIZE*BUFFER_LINES];
char* stderr_buffer_pos=stderr_buffer;
int stderr_sync_counter=0;
/* functions */
#if USE_CAPSTONE
int print_asm(FILE* f);
#endif
void print_mc(FILE*, int);
bool is_prefix(uint8_t);
int prefix_count(void);
bool has_dup_prefix(void);
bool has_opcode(uint8_t*);
bool has_prefix(uint8_t*);
void preamble(void);
void inject(int);
void state_handler(int, siginfo_t*, void*);
void fault_handler(int, siginfo_t*, void*);
void configure_sig_handler(void (*)(int, siginfo_t*, void*));
void give_result(FILE*);
void usage(void);
bool move_next_instruction(void);
bool move_next_range(void);
extern char debug, resume, preamble_start, preamble_end;
static int expected_length;
void sync_fprintf(FILE* f, const char *format, ...)
{
va_list args;
va_start(args, format);
if (f==stdout) {
stdout_buffer_pos+=vsprintf(stdout_buffer_pos, format, args);
}
else if (f==stderr) {
stderr_buffer_pos+=vsprintf(stderr_buffer_pos, format, args);
}
else {
assert(0);
}
va_end(args);
}
void sync_fwrite(const void* ptr, size_t size, size_t count, FILE* f)
{
if (f==stdout) {
memcpy(stdout_buffer_pos, ptr, size*count);
stdout_buffer_pos+=size*count;
}
else if (f==stderr) {
memcpy(stderr_buffer_pos, ptr, size*count);
stderr_buffer_pos+=size*count;
}
else {
assert(0);
}
}
void sync_fflush(FILE* f, bool force)
{
if (f==stdout) {
stdout_sync_counter++;
if (stdout_sync_counter==SYNC_LINES_STDOUT || force) {
stdout_sync_counter=0;
pthread_mutex_lock(output_mutex);
fwrite(stdout_buffer, stdout_buffer_pos-stdout_buffer, 1, f);
fflush(f);
pthread_mutex_unlock(output_mutex);
stdout_buffer_pos=stdout_buffer;
}
}
else if (f==stderr) {
stderr_sync_counter++;
if (stderr_sync_counter==SYNC_LINES_STDERR || force) {
stderr_sync_counter=0;
pthread_mutex_lock(output_mutex);
fwrite(stderr_buffer, stderr_buffer_pos-stderr_buffer, 1, f);
fflush(f);
pthread_mutex_unlock(output_mutex);
stderr_buffer_pos=stderr_buffer;
}
}
else {
assert(0);
}
}
void zero_insn_end(insn_t* insn, int marker)
{
int i;
for (i=marker; i<MAX_INSN_LENGTH; i++) {
insn->bytes[i]=0;
}
}
bool increment_range(insn_t* insn, int marker)
{
int i=marker-1;
zero_insn_end(insn, marker);
if (i>=0) {
insn->bytes[i]++;
while (insn->bytes[i]==0) {
i--;
if (i<0) {
break;
}
insn->bytes[i]++;
}
}
insn->len=marker;
return i>=0;
}
void print_insn(FILE* f, insn_t* insn)
{
int i;
for (i=0; i<sizeof(insn->bytes); i++) {
sync_fprintf(f, "%02x", insn->bytes[i]);
}
}
void print_range(FILE* f, range_t* range)
{
print_insn(f, &range->start);
sync_fprintf(f, ";");
print_insn(f, &range->end);
}
/* must call before forking */
void initialize_ranges(void)
{
if (range_marker==NULL) {
range_marker=mmap(NULL, sizeof *range_marker,
PROT_READ|PROT_WRITE, MAP_SHARED|MAP_ANONYMOUS, -1, 0);
*range_marker=total_range.start;
}
}
void free_ranges(void)
{
if (range_marker!=NULL) {
munmap(range_marker, sizeof *range_marker);
}
}
bool move_next_range(void)
{
bool result=true;
switch (mode) {
case RAND:
case DRIVEN:
if (search_range.started) {
result=false;
}
else {
search_range=total_range;
}
break;
case BRUTE:
case TUNNEL:
pthread_mutex_lock(pool_mutex);
search_range.started=false;
if (memcmp(range_marker->bytes, total_range.end.bytes,
sizeof(range_marker->bytes))==0) {
/* reached end of range */
result=false;
}
else {
search_range.start=*range_marker;
search_range.end=*range_marker;
//TODO: there are search bugs here
//#error make sure you don't skip over the first instruction (e.g. 000000...)
//#error there's another error here somewhere...
//somehow take start range from end range..
//len can mostly be taken from range_bytes WHEN YOU MOVE TO A NEW RANGE but
//needs to be from total_range.start/end.len when you are deriving from that
//right now len is set in total_range, and in increment_range for range.end
if (!increment_range(&search_range.end, config.range_bytes)) {
/* if increment rolled over, set to end */
search_range.end=total_range.end;
}
else if (memcmp(search_range.end.bytes,
total_range.end.bytes, sizeof(search_range.end.bytes))>0) {
/* if increment moved past end, set to end */
search_range.end=total_range.end;
}
*range_marker=search_range.end;
}
pthread_mutex_unlock(pool_mutex);
break;
default:
assert(0);
}
return result;
}
#if USE_CAPSTONE
int print_asm(FILE* f)
{
if (output==TEXT) {
uint8_t* code=inj.i.bytes;
size_t code_size=MAX_INSN_LENGTH;
uint64_t address=(uintptr_t)packet_buffer;
if (cs_disasm_iter(
capstone_handle,
(const uint8_t**)&code,
&code_size,
&address,
capstone_insn)
) {
sync_fprintf(
f,
"%10s %-45s (%2d)",
capstone_insn[0].mnemonic,
capstone_insn[0].op_str,
(int)(address-(uintptr_t)packet_buffer)
);
}
else {
sync_fprintf(
f,
"%10s %-45s (%2d)",
"(unk)",
" ",
(int)(address-(uintptr_t)packet_buffer)
);
}
expected_length=(int)(address-(uintptr_t)packet_buffer);
}
return 0;
}
#endif
void print_mc(FILE* f, int length)
{
int i;
bool p=false;
if (!is_prefix(inj.i.bytes[0])) {
sync_fprintf(f, " ");
p=true;
}
for (i=0; i<length && i<MAX_INSN_LENGTH; i++) {
sync_fprintf(f, "%02x", inj.i.bytes[i]);
if (
!p &&
i<MAX_INSN_LENGTH-1 &&
is_prefix(inj.i.bytes[i]) &&
!is_prefix(inj.i.bytes[i+1])
) {
sync_fprintf(f, " ");
p=true;
}
}
}
/* this becomes hairy with "mandatory prefix" instructions */
bool is_prefix(uint8_t x)
{
return
x==0xf0 || /* lock */
x==0xf2 || /* repne / bound */
x==0xf3 || /* rep */
x==0x2e || /* cs / branch taken */
x==0x36 || /* ss / branch not taken */
x==0x3e || /* ds */
x==0x26 || /* es */
x==0x64 || /* fs */
x==0x65 || /* gs */
x==0x66 || /* data */
x==0x67 /* addr */
#if __x86_64__
|| (x>=0x40 && x<=0x4f) /* rex */
#endif
;
}
int prefix_count(void)
{
int i;
for (i=0; i<MAX_INSN_LENGTH; i++) {
if (!is_prefix(inj.i.bytes[i])) {
return i;
}
}
return i;
}
bool has_dup_prefix(void)
{
int i;
int byte_count[256];
memset(byte_count, 0, 256*sizeof(int));
for (i=0; i<MAX_INSN_LENGTH; i++) {
if (is_prefix(inj.i.bytes[i])) {
byte_count[inj.i.bytes[i]]++;
}
else {
break;
}
}
for (i=0; i<256; i++) {
if (byte_count[i]>1) {
return true;
}
}
return false;
}
//TODO: can't blacklist 00
bool has_opcode(uint8_t* op)
{
int i, j;
for (i=0; i<MAX_INSN_LENGTH; i++) {
if (!is_prefix(inj.i.bytes[i])) {
j=0;
do {
if (i+j>=MAX_INSN_LENGTH || op[j]!=inj.i.bytes[i+j]) {
return false;
}
j++;
} while (op[j]);
return true;
}
}
return false;
}
//TODO: can't blacklist 00
bool has_prefix(uint8_t* pre)
{
int i, j;
for (i=0; i<MAX_INSN_LENGTH; i++) {
if (is_prefix(inj.i.bytes[i])) {
j=0;
do {
if (inj.i.bytes[i]==pre[j]) {
return true;
}
j++;
} while (pre[j]);
}
else {
return false;
}
}
return false;
}
/* gcc doesn't allow naked inline, i hate it */
void preamble(void)
{
#if __x86_64__
__asm__ __volatile__ ("\
.global preamble_start \n\
preamble_start: \n\
pushfq \n\
orq %0, (%%rsp) \n\
popfq \n\
.global preamble_end \n\
preamble_end: \n\
"
:
:"i"(TF)
);
#else
__asm__ __volatile__ ("\
.global preamble_start \n\
preamble_start: \n\
pushfl \n\
orl %0, (%%esp) \n\
popfl \n\
.global preamble_end \n\
preamble_end: \n\
"
:
:"i"(TF)
);
#endif
}
void inject(int insn_size)
{
/* could probably fork here to avoid risk of destroying the controlling process */
/* only really comes up in random injection, just roll the dice for now */
int i;
int preamble_length=(&preamble_end-&preamble_start);
static bool have_state=false;
if (!USE_TF) { preamble_length=0; }
packet=packet_buffer+PAGE_SIZE-insn_size-preamble_length;
/* optimization - don't bother to write protect page */
// assert(!mprotect(packet_buffer,PAGE_SIZE,PROT_READ|PROT_WRITE|PROT_EXEC));
for (i=0; i<preamble_length; i++) {
((char*)packet)[i]=((char*)&preamble_start)[i];
}
for (i=0; i<MAX_INSN_LENGTH && i<insn_size; i++) {
((char*)packet)[i+preamble_length]=inj.i.bytes[i];
}
// assert(!mprotect(packet_buffer,PAGE_SIZE,PROT_READ|PROT_EXEC));
if (config.enable_null_access) {
/* without this we need to blacklist any instruction that modifies esp */
void* p=NULL; /* suppress warning */
memset(p, 0, PAGE_SIZE);
}
dummy_stack.dummy_stack_lo[0]=0;
if (!have_state) {
/* optimization: only get state first time */
have_state=true;
configure_sig_handler(state_handler);
__asm__ __volatile__ ("ud2\n");
}
configure_sig_handler(fault_handler);
#if __x86_64__
__asm__ __volatile__ ("\
mov %[rax], %%rax \n\
mov %[rbx], %%rbx \n\
mov %[rcx], %%rcx \n\
mov %[rdx], %%rdx \n\
mov %[rsi], %%rsi \n\
mov %[rdi], %%rdi \n\
mov %[r8], %%r8 \n\
mov %[r9], %%r9 \n\
mov %[r10], %%r10 \n\
mov %[r11], %%r11 \n\
mov %[r12], %%r12 \n\
mov %[r13], %%r13 \n\
mov %[r14], %%r14 \n\
mov %[r15], %%r15 \n\
mov %[rbp], %%rbp \n\
mov %[rsp], %%rsp \n\
jmp *%[packet] \n\
"
: /* no output */
: [rax]"m"(inject_state.rax),
[rbx]"m"(inject_state.rbx),
[rcx]"m"(inject_state.rcx),
[rdx]"m"(inject_state.rdx),
[rsi]"m"(inject_state.rsi),
[rdi]"m"(inject_state.rdi),
[r8]"m"(inject_state.r8),
[r9]"m"(inject_state.r9),
[r10]"m"(inject_state.r10),
[r11]"m"(inject_state.r11),
[r12]"m"(inject_state.r12),
[r13]"m"(inject_state.r13),
[r14]"m"(inject_state.r14),
[r15]"m"(inject_state.r15),
[rbp]"m"(inject_state.rbp),
[rsp]"i"(&dummy_stack.dummy_stack_lo),
[packet]"m"(packet)
);
#else
__asm__ __volatile__ ("\
mov %[eax], %%eax \n\
mov %[ebx], %%ebx \n\
mov %[ecx], %%ecx \n\
mov %[edx], %%edx \n\
mov %[esi], %%esi \n\
mov %[edi], %%edi \n\
mov %[ebp], %%ebp \n\
mov %[esp], %%esp \n\
jmp *%[packet] \n\
"
:
:
[eax]"m"(inject_state.eax),
[ebx]"m"(inject_state.ebx),
[ecx]"m"(inject_state.ecx),
[edx]"m"(inject_state.edx),
[esi]"m"(inject_state.esi),
[edi]"m"(inject_state.edi),
[ebp]"m"(inject_state.ebp),
[esp]"i"(&dummy_stack.dummy_stack_lo),
[packet]"m"(packet)
);
#endif
__asm__ __volatile__ ("\
.global resume \n\
resume: \n\
"
);
;
}
void state_handler(int signum, siginfo_t* si, void* p)
{
fault_context=((ucontext_t*)p)->uc_mcontext;
((ucontext_t*)p)->uc_mcontext.gregs[IP]+=UD2_SIZE;
}
void fault_handler(int signum, siginfo_t* si, void* p)
{
int insn_length;
ucontext_t* uc=(ucontext_t*)p;
int preamble_length=(&preamble_end-&preamble_start);
if (!USE_TF) { preamble_length=0; }
/* make an initial estimate on the instruction length from the fault address */
insn_length=
(uintptr_t)uc->uc_mcontext.gregs[IP]-(uintptr_t)packet-preamble_length;
if (insn_length<0) {
insn_length=JMP_LENGTH;
}
else if (insn_length>MAX_INSN_LENGTH) {
insn_length=JMP_LENGTH;
}
result=(result_t){
1,
insn_length,
signum,
si->si_code,
(signum==SIGSEGV||signum==SIGBUS)?(uint32_t)(uintptr_t)si->si_addr:(uint32_t)-1
};
memcpy(uc->uc_mcontext.gregs, fault_context.gregs, sizeof(fault_context.gregs));
uc->uc_mcontext.gregs[IP]=(uintptr_t)&resume;
uc->uc_mcontext.gregs[REG_EFL]&=~TF;
}
void configure_sig_handler(void (*handler)(int, siginfo_t*, void*))
{
struct sigaction s;
s.sa_sigaction=handler;
s.sa_flags=SA_SIGINFO|SA_ONSTACK;
sigfillset(&s.sa_mask);
sigaction(SIGILL, &s, NULL);
sigaction(SIGSEGV, &s, NULL);
sigaction(SIGFPE, &s, NULL);
sigaction(SIGBUS, &s, NULL);
sigaction(SIGTRAP, &s, NULL);
}
/* note: this does not provide an even distribution */
void get_rand_insn_in_range(range_t* r)
{
static uint8_t inclusive_end[MAX_INSN_LENGTH];
int i;
bool all_max=true;
bool all_min=true;
memcpy(inclusive_end, &r->end.bytes, MAX_INSN_LENGTH);
i=MAX_INSN_LENGTH-1;
while (i>=0) {
inclusive_end[i]--;
if (inclusive_end[i]!=0xff) {
break;
}
i--;
}
for (i=0; i<MAX_INSN_LENGTH; i++) {
if (all_max && all_min) {
inj.i.bytes[i]=
rand()%(inclusive_end[i]-r->start.bytes[i]+1)+r->start.bytes[i];
}
else if (all_max) {
inj.i.bytes[i]=
rand()%(inclusive_end[i]+1);
}
else if (all_min) {
inj.i.bytes[i]=
rand()%(256-r->start.bytes[i])+r->start.bytes[i];
}
else {
inj.i.bytes[i]=
rand()%256;
}
all_max=all_max&&(inj.i.bytes[i]==inclusive_end[i]);
all_min=all_min&&(inj.i.bytes[i]==r->start.bytes[i]);
}
}
void init_inj(const insn_t* new_insn)
{
inj.i=*new_insn;
inj.index=-1;
inj.last_len=-1;
}
bool move_next_instruction(void)
{
int i;
switch (mode) {
case RAND:
if (!search_range.started) {
init_inj(&null_insn);
get_rand_insn_in_range(&search_range);
}
else {
get_rand_insn_in_range(&search_range);
}
break;
case BRUTE:
if (!search_range.started) {
init_inj(&search_range.start);
inj.index=config.brute_depth-1;
}
else {
for (inj.index=config.brute_depth-1; inj.index>=0; inj.index--) {
inj.i.bytes[inj.index]++;
if (inj.i.bytes[inj.index]) {
break;
}
}
}
break;
case TUNNEL:
if (!search_range.started) {
init_inj(&search_range.start);
inj.index=search_range.start.len;
}
else {
/* not a perfect algorithm; should really look at length
* patterns of oher bytes at current index, not "last" length;
* also situations in which this may not dig deep enough, should
* really be looking at no length changes for n bytes, not just
* last byte. but it's good enough for now. */
/* if the last iteration changed the instruction length, go deeper */
/* but not if we're already as deep as the instruction goes */
//TODO: should also count a change in the signal as a reason to
//go deeper
if (result.length!=inj.last_len && inj.index<result.length-1) {
inj.index++;
}
inj.last_len=result.length;
inj.i.bytes[inj.index]++;