-
-
Notifications
You must be signed in to change notification settings - Fork 7
/
Copy pathevgen_b_MOD.c
1905 lines (1649 loc) · 46.6 KB
/
evgen_b_MOD.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
#include <ph.h>
#include <imagehlp.h>
#define ARG_OUTPUT 1
#define ARG_TYPE 2
#define TYPE_KERNEL 1
#define TYPE_LOADER 2
#define TYPE_HAL 3
typedef VOID (NTAPI *PPATCH_FUNCTION)(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
);
const PWSTR appver=L"0.0.0.39";
PPH_STRING ArgInput;
PPH_STRING ArgOutput;
PPH_STRING ArgType;
ULONG ArgTypeInteger;
VOID Fail(
__in PWSTR Message,
__in ULONG Win32Result
)
{
if (Win32Result == 0)
wprintf(L"%s\n", Message);
else
wprintf(L"%s: %s\n", Message, PhGetWin32Message(Win32Result)->Buffer);
RtlExitUserProcess(STATUS_UNSUCCESSFUL);
}
ULONG GetBuildNumber(
__in PWSTR FileName
)
{
ULONG buildNumber = 0;
PVOID versionInfo;
VS_FIXEDFILEINFO *rootBlock;
ULONG rootBlockLength;
versionInfo = PhGetFileVersionInfo(FileName);
if (!versionInfo)
return 0;
if (VerQueryValue(versionInfo, L"\\", &rootBlock, &rootBlockLength) && rootBlockLength != 0)
buildNumber = rootBlock->dwFileVersionLS >> 16;
PhFree(versionInfo);
return buildNumber;
}
VOID Patch(
__in PPH_STRING FileName,
__in PPATCH_FUNCTION Action
)
{
BOOLEAN success;
PPH_ANSI_STRING ansiFileName;
LOADED_IMAGE loadedImage;
ansiFileName = PhCreateAnsiStringFromUnicodeEx(FileName->Buffer, FileName->Length);
if (!MapAndLoad(ansiFileName->Buffer, NULL, &loadedImage, FALSE, FALSE))
Fail(L"Unable to map and load image", GetLastError());
success = FALSE;
Action(&loadedImage, &success);
// This will unload the image and fix the checksum.
UnMapAndLoad(&loadedImage);
PhDereferenceObject(ansiFileName);
if (success)
wprintf(L"Patched.\n");
else
Fail(L"Failed.", 0);
}
VOID PatchKernel2600Part1_v1(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// reversing XP64G.EXE (evgen_b)
{
// China patch
UCHAR target[] =
{
// cmp ebx,ecx
0x3B, 0xFB,
// jnc 0005754EC
0x73, 0xD9,
// push 7
0x6A, 0x07,
// call ExVerifySuite
0xE8 //0x**, 0x**, 0x**, 0x**
// cmp *l,1
// 0x**, 0x01
// jnz *
// 0x75, 0x07
// ...
};
ULONG movOffset = 13;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// jnz 000575523 -> jz 000575523
ptr[movOffset] = 0x74;
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel2600Part1_v2(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// reversing XP64G.EXE (evgen_b)
{
// China patch
UCHAR target[] =
{
// cmp ebx,ecx
0x3B, 0xD9,
// jnc 0005754EC
0x73, 0xDB,
// push 7
0x6A, 0x07,
// call ExVerifySuite
0xE8 //0x18, 0xC0, 0xEE, 0xFF
// cmp al,1
// 0x3C, 0x01
// jnz 000575523
// 0x75, 0x07
// ...
};
ULONG movOffset = 13;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// jnz 000575523 -> jz 000575523
ptr[movOffset] = 0x74;
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel2600Part2(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// reversing XP64G.EXE (evgen_b)
{
// China patch
UCHAR target[] =
{
// push 7
0x6A, 0x07,
// mov esi,eax
0x8B, 0xF0,
// mov [ebp][-4],ebx
0x89, 0x5D, 0xFC,
// mov [ebp][-8],edi
0x89, 0x7D, 0xF8,
// call ExVerifySuite
0xE8 //0xE1, 0xFC, 0xE8, 0xFF
// cmp al,1
// 0x3C, 0x01
// jnz 0005D186E
// 0x75, 0x1B
// ...
};
ULONG movOffset = 17;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// jnz 0005D186E -> jz 0005D186E
ptr[movOffset] = 0x74;
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel2600(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
BOOLEAN success1 = FALSE;
BOOLEAN success2 = FALSE;
PatchKernel2600Part1_v1(LoadedImage, &success1);
if (!success1)
{
PatchKernel2600Part1_v2(LoadedImage, &success1);
}
PatchKernel2600Part2(LoadedImage, &success2);
*Success = success1 && success2;
}
VOID PatchKernel3790Part1(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// Yet another method by Oliver/Remko
// Searchpattern : BF 00 00 00 02 6A 0A C7 45 FC 00 00 10 00
// Replacepattern : ?? ?? ?? ?? 10 ?? ?? ?? ?? ?? ?? ?? 00 10
{
UCHAR target[] =
{
// mov edi, 02.00.00.00 -> mov edi, 10.00.00.00
0xBF, 0x00, 0x00, 0x00, 0x02,
// push 0A
0x6A, 0x0A,
// mov [ebp][-4], 00.10.00.00 -> mov [ebp][-4], 10.00.00.00
0xC7, 0x45, 0xFC, 0x00, 0x00, 0x10, 0x00
// mov [ebp][-8],edi
// 0x89, 0x7D, 0xF8,
// call ExVerifySuite
// 0xE8, 0xCC, 0xD3, 0xE6, 0xFF
// cmp al,1
// 0x3C, 0x01
// jnz ...
};
ULONG movOffset = 0;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
ptr[movOffset + 3] = 0x00;
ptr[movOffset + 4] = 0x10;
ptr[movOffset + 12] = 0x00;
ptr[movOffset + 13] = 0x10;
//wprintf(L"part1\n");
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel3790Part2(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// Yet another method by Oliver/Remko (pattern fix by evgen_b)
// Searchpattern : 75 09 C7 45 FC 00 00 08 00 EB 69 6A 07 E8
// Replacepattern : ?? ?? ?? ?? ?? ?? ?? 00 10 ?? ?? ?? ?? ??
{
UCHAR target[] =
{
// jnz 000612D97
0x75, 0x09,
// mov [ebp][-4], 00.08.00.00 -> mov [ ebp][-4], 10.00.00.00
0xC7, 0x45, 0xFC, 0x00, 0x00, 0x08, 0x00,
// jmps 000612E00
0xEB, 0x69,
// push 07
0x6A, 0x07,
// call ExVerifySuite
0xE8 // 0xB8, 0xD3, 0xE6, 0xFF
// cmp al,1
// 0x3C, 0x01
// jnz ...
};
ULONG movOffset = 7;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
ptr[movOffset] = 0x00;
ptr[movOffset+1] = 0x10;
//wprintf(L"part2\n");
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel3790Part3(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// Yet another method by Oliver/Remko
// Searchpattern : C7 45 FC 00 00 00 01 74 33 B8 00 00 40 00
// Replacepattern : ?? ?? ?? ?? ?? ?? 10 ?? ?? ?? ?? ?? 00 10
{
UCHAR target[] =
{
// mov [ebp][-4], 01.00.00.00 -> mov [ebp][-4], 10.00.00.00
0xC7, 0x45, 0xFC, 0x00, 0x00, 0x00, 0x01,
// jz 00612E00
0x74, 0x33,
// mov eax, 00.40.00.00 -> mov eax, 10.00.00.00
0xB8, 0x00, 0x00, 0x40, 0x00
// mov [ebp][-4],eax
// 0x89, 0x45, 0xFC,
// mov [ebp][-8],eax
// 0x89, 0x45, 0xF8,
// jmps 000612E00
// 0xEB, 0x26
};
ULONG movOffset = 0;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
ptr[movOffset + 5] = 0x00;
ptr[movOffset + 6] = 0x10;
ptr[movOffset + 12] = 0x00;
ptr[movOffset + 13] = 0x10;
//wprintf(L"part3\n");
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel3790Part4(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// Yet another method by Oliver/Remko
// Searchpattern : C7 45 FC 00 00 10 00 74 10 C7 45 F8 00 00 40 00
// Replacepattern : ?? ?? ?? ?? ?? 00 10 ?? ?? ?? ?? ?? ?? ?? 00 10
{
UCHAR target[] =
{
// mov [ebp][-4], 00.10.00.00 -> mov [ebp][-4], 10.00.00.00
0xC7, 0x45, 0xFC, 0x00, 0x00, 0x10, 0x00,
// jz 00612E00
0x74, 0x10,
// mov [ebp][-8], 00.40.00.00 -> mov [ebp][-8], 10.00.00.00
0xC7, 0x45, 0xF8, 0x00, 0x00, 0x40, 0x00
// jmps 00612E00
// 0xEB, 0x07
};
ULONG movOffset = 0;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
ptr[movOffset + 5] = 0x00;
ptr[movOffset + 6] = 0x10;
ptr[movOffset + 14] = 0x00;
ptr[movOffset + 15] = 0x10;
//wprintf(L"part4\n");
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel3790Part5(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// Yet another method by Oliver/Remko
// Searchpattern : C7 45 F8 00 00 10 00 33 F6 83 C3 08 8B 03
// Replacepattern : ?? ?? ?? ?? ?? 00 10 ?? ?? ?? ?? ?? ?? ??
{
UCHAR target[] =
{
// mov [ebp][-8], 00.10.00.00 -> mov [ebp][-4], 10.00.00.00
0xC7, 0x45, 0xF8, 0x00, 0x00, 0x10, 0x00,
// xor esi,esi
0x33, 0xF6,
// add ebx,8
0x83, 0xC3, 0x08,
// mov eax,[ebx]
0x8B, 0x03
};
ULONG movOffset = 0;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
ptr[movOffset + 5] = 0x00;
ptr[movOffset + 6] = 0x10;
//wprintf(L"part5\n");
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchKernel3790(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
BOOLEAN success1 = FALSE;
BOOLEAN success2 = FALSE;
BOOLEAN success3 = FALSE;
BOOLEAN success4 = FALSE;
BOOLEAN success5 = FALSE;
PatchKernel3790Part1(LoadedImage, &success1);
PatchKernel3790Part2(LoadedImage, &success2);
PatchKernel3790Part3(LoadedImage, &success3);
PatchKernel3790Part4(LoadedImage, &success4);
PatchKernel3790Part5(LoadedImage, &success5);
*Success = success1 && success2 && success3 && success4 && success5;
}
VOID PatchKernel(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
// MxMemoryLicense
// Basically, the portion of code we are going to patch
// queries the NT license value for the allowed memory.
// If there is a limit, it sets MiTotalPagesAllowed to
// that limit times 256. If there is no specified limit,
// it sets MiTotalPagesAllowed to 0x80000 (2 GB).
//
// We will patch the limit to be 0x20000 << 8 pages (128 GB).
UCHAR target[] =
{
// test eax, eax ; did ZwQueryLicenseValue succeed?
0x85, 0xc0,
// jl short loc_75644b ; if it didn't go to the default case
0x7c, 0x11,
// mov eax, [ebp+var_4] ; get the returned memory limit
0x8b, 0x45, 0xfc,
// test eax, eax ; is it non-zero?
0x85, 0xc0,
// jz short loc_75644b ; if it's zero, go to the default case
0x74, 0x0a,
// shl eax, 8 ; multiply by 256
0xc1, 0xe0, 0x08
// mov ds:_MiTotalPagesAllowed, eax ; store in MiTotalPagesAllowed
// 0xa3, 0x2c, 0x76, 0x53, 0x00
// jmp short loc_756455 ; go to the next bit
// 0xeb, 0x0a
// loc_75644b: mov ds:_MiTotalPagesAllowed, 0x80000
// 0xc7, 0x05, 0x2c, 0x76, 0x53, 0x00, 0x00, 0x00, 0x08, 0x00
};
ULONG movOffset = 4;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j, k;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// mov eax, [ebp+var_4] -> mov eax, 0x20000
ptr[movOffset] = 0xb8;
*(PULONG)&ptr[movOffset + 1] = 0x20000;
// nop out the jz
ptr[movOffset + 5] = 0x90;
ptr[movOffset + 6] = 0x90;
// Do the same thing to the next mov eax, [ebp+var_4]
// occurence.
for (k = 0; k < 100; k++)
{
if (
ptr[k] == 0x8b &&
ptr[k + 1] == 0x45 &&
ptr[k + 2] == 0xfc &&
ptr[k + 3] == 0x85 &&
ptr[k + 4] == 0xc0
)
{
// mov eax, [ebp+var_4] -> mov eax, 0x20000
ptr[k] = 0xb8;
*(PULONG)&ptr[k + 1] = 0x20000;
// nop out the jz
ptr[k + 5] = 0x90;
ptr[k + 6] = 0x90;
*Success = TRUE;
break;
}
}
break;
}
ptr++;
}
}
VOID PatchKernel9200(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
// MxMemoryLicense
// Basically, the portion of code we are going to patch
// queries the NT license value for the allowed memory.
// If there is a limit, it sets MiTotalPagesAllowed to
// that limit times 256. If there is no specified limit,
// it sets MiTotalPagesAllowed to 0x80000 (2 GB).
//
// We will patch the limit to be 0x20000 << 8 pages (128 GB).
UCHAR target[] =
{
// test eax, eax ; did NtQueryLicenseValue succeed?
0x85, 0xc0,
// js short loc_914314 ; if it didn't go to the default case
0x78, 0x4c,
// mov eax, [ebp+var_4] ; get the returned memory limit
0x8b, 0x45, 0xfc,
// test eax, eax ; is it non-zero?
0x85, 0xc0,
// jz short loc_914314 ; if it's zero, go to the default case
0x74, 0x45,
// shl eax, 8 ; multiply by 256
0xc1, 0xe0, 0x08
// mov ds:_MiTotalPagesAllowed, eax ; store in MiTotalPagesAllowed
// ...
};
ULONG movOffset = 4;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j, k;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j] && j != 3 && j != 10) // ignore jump offsets
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// mov eax, [ebp+var_4] -> mov eax, 0x20000
ptr[movOffset] = 0xb8;
*(PULONG)&ptr[movOffset + 1] = 0x20000;
// nop out the jz
ptr[movOffset + 5] = 0x90;
ptr[movOffset + 6] = 0x90;
// Do the same thing to the next mov eax, [ebp+var_4]
// occurence.
for (k = 0; k < 100; k++)
{
if (
ptr[k] == 0x8b &&
ptr[k + 1] == 0x45 &&
ptr[k + 2] == 0xfc &&
ptr[k + 3] == 0x85 &&
ptr[k + 4] == 0xc0
)
{
// mov eax, [ebp+var_4] -> mov eax, 0x20000
ptr[k] = 0xb8;
*(PULONG)&ptr[k + 1] = 0x20000;
// nop out the jz
ptr[k + 5] = 0x90;
ptr[k + 6] = 0x90;
*Success = TRUE;
break;
}
}
break;
}
ptr++;
}
}
VOID PatchKernel9600(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
// MxMemoryLicense
// Basically, the portion of code we are going to patch
// queries the NT license value for the allowed memory.
// If there is a limit, it sets MiTotalPagesAllowed to
// that limit times 256. If there is no specified limit,
// it sets MiTotalPagesAllowed to 0x80000 (2 GB).
//
// We will patch the limit to be 0x20000 << 8 pages (128 GB).
UCHAR target[] =
{
// test eax, eax ; did NtQueryLicenseValue succeed?
0x85, 0xc0,
// js short loc_923593 ; if it didn't go to the default case
0x78, 0x50,
// mov eax, [ebp+var_4] ; get the returned memory limit
0x8b, 0x45, 0xfc,
// test eax, eax ; is it non-zero?
0x85, 0xc0,
// jz short loc_923593 ; if it's zero, go to the default case
0x74, 0x49,
// shl eax, 8 ; multiply by 256
0xc1, 0xe0, 0x08
// mov ds:_MiTotalPagesAllowed, eax ; store in MiTotalPagesAllowed
// ...
};
ULONG movOffset = 4;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j, k;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j] && j != 3 && j != 10) // ignore jump offsets
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// mov eax, [ebp+var_4] -> mov eax, 0x20000
ptr[movOffset] = 0xb8;
*(PULONG)&ptr[movOffset + 1] = 0x20000;
// nop out the jz
ptr[movOffset + 5] = 0x90;
ptr[movOffset + 6] = 0x90;
// Do the same thing to the next mov eax, [ebp+var_4]
// occurence.
for (k = 0; k < 100; k++)
{
if (
ptr[k] == 0x8b &&
ptr[k + 1] == 0x45 &&
ptr[k + 2] == 0xfc &&
ptr[k + 3] == 0x85 &&
ptr[k + 4] == 0xc0
)
{
// mov eax, [ebp+var_4] -> mov eax, 0x20000
ptr[k] = 0xb8;
*(PULONG)&ptr[k + 1] = 0x20000;
// nop out the jz
ptr[k + 5] = 0x90;
ptr[k + 6] = 0x90;
*Success = TRUE;
break;
}
}
break;
}
ptr++;
}
}
VOID PatchKernel10240(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
// 10240 - win10 RTM (evgen_b)
{
// MxMemoryLicense
// Basically, the portion of code we are going to patch
// queries the NT license value for the allowed memory.
// If there is a limit, it sets MiTotalPagesAllowed to
// that limit times 256. If there is no specified limit,
// it sets MiTotalPagesAllowed to 0x80000 (2 GB).
//
// We will patch the limit to be 0x20000 << 8 pages (128 GB).
UCHAR target1[] =
{
// test eax, eax ; did NtQueryLicenseValue succeed?
0x85, 0xc0,
// js short loc_009BCC3B ; if it didn't go to the default case
0x78, 0x46,
// mov esi, [ebp-4] ; get the returned memory limit
0x8b, 0x75, 0xfc,
// test esi, esi ; is it non-zero?
0x85, 0xf6,
// jz short loc_009BCC3B ; if it's zero, go to the default case
0x74, 0x3f,
// shl esi, 8 ; multiply by 256
0xc1, 0xe6, 0x08
// mov ds:_MiTotalPagesAllowed, esi ; store in MiTotalPagesAllowed
// ...
};
UCHAR target2[] =
{
// test eax, eax ; did NtQueryLicenseValue succeed?
0x85, 0xc0,
// js short loc_009BCC32 ; if it didn't go to the default case
0x78, 0x0d,
// mov ecx, [ebp-4] ; get the returned memory limit
0x8b, 0x4d, 0xfc,
// test ecx, ecx ; is it non-zero?
0x85, 0xc9,
// jz short loc_009BCC32 ; if it's zero, go to the default case
0x74, 0x06,
// shl ecx, 8 ; multiply by 256
0xc1, 0xe1, 0x08
// mov ds:_MiTotalPagesAllowed, ecx ; store in MiTotalPagesAllowed
// ...
};
ULONG movOffset1 = 4;
ULONG movOffset2 = 4;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j, m, n;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target1); i++)
{
for (j = 0; j < sizeof(target1); j++)
{
if (ptr[j] != target1[j] && j != 3 && j != 10) // ignore jump offsets
break;
}
if (j == sizeof(target1))
{
// Found it. Patch the code.
// mov esi, [ebp+var_4] -> mov esi, 0x020000
ptr[movOffset1] = 0xbe;
*(PULONG)&ptr[movOffset1 + 1] = 0x20000;
// nop out the jz
ptr[movOffset1 + 5] = 0x90;
ptr[movOffset1 + 6] = 0x90;
// Do the same thing to the next mov ecx, [ebp+var_4]
// occurence.
for (m = 0; m < 100; m++)
{
for (n = 0; n < sizeof(target2); n++)
{
if (ptr[n] != target2[n] && n != 3 && n != 10) // ignore jump offsets
break;
}
if (n == sizeof(target2))
{
// mov ecx, [ebp+var_4] -> mov ecx, 0x020000
ptr[movOffset2] = 0xb9;
*(PULONG)&ptr[movOffset2 + 1] = 0x20000;
// nop out the jz
ptr[movOffset2 + 5] = 0x90;
ptr[movOffset2 + 6] = 0x90;
*Success = TRUE;
break;
}
ptr++;
}
break;
}
ptr++;
}
}
VOID PatchLoader(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
// BlImgLoadPEImageEx
// There is a function called ImgpValidateImageHash. We are
// going to patch BlImgLoadPEImageEx so that it doesn't care
// what the result of the function is.
UCHAR target[] =
{
// sub esi, [ebx+4]
0x2b, 0x73, 0x04,
// push eax
0x50,
// add esi, [ebp+var_18]
0x03, 0x75, 0xe8,
// lea eax, [ebp+Source1]
0x8d, 0x45, 0x8c,
// push eax
0x50,
// push esi
0x56,
// mov eax, ebx
0x8b, 0xc3
// call _ImgpValidateImageHash@16
// 0xe8, 0x59, 0x0b, 0x00, 0x00
// mov ecx, eax ; copy return status into ecx
// test ecx, ecx ; did ImgpValidateImageHash succeed?
// mov [ebp+arg_0], ecx ; store the NT status into a variable
// jge short loc_42109f ; if the function succeeded, go there
};
ULONG movOffset = 19;
PUCHAR ptr = LoadedImage->MappedAddress;
ULONG i, j;
for (i = 0; i < LoadedImage->SizeOfImage - sizeof(target); i++)
{
for (j = 0; j < sizeof(target); j++)
{
if (ptr[j] != target[j])
break;
}
if (j == sizeof(target))
{
// Found it. Patch the code.
// mov ecx, eax -> mov [ebp+arg_0], 0
// 0x8b, 0xc8 -> 0xc7, 0x45, 0x08, 0x00, 0x00, 0x00, 0x00
ptr[movOffset] = 0xc7;
ptr[movOffset + 1] = 0x45;
ptr[movOffset + 2] = 0x08;
ptr[movOffset + 3] = 0x00;
ptr[movOffset + 4] = 0x00;
ptr[movOffset + 5] = 0x00;
ptr[movOffset + 6] = 0x00;
// jge short loc_42109f -> jmp short loc_42109f
// 0x85, 0xc9 -> 0xeb, 0xc9
ptr[movOffset + 7] = 0xeb;
*Success = TRUE;
break;
}
ptr++;
}
}
VOID PatchLoader7600(
__in PLOADED_IMAGE LoadedImage,
__out PBOOLEAN Success
)
{
// BlImgLoadPEImage
// There is a function called ImgpValidateImageHash. We are
// going to patch BlImgLoadPEImage so that it doesn't care
// what the result of the function is.
UCHAR target[] =
{
// push eax
0x50,
// lea eax, [ebp+Source1]
0x8d, 0x85, 0x94, 0xfe, 0xff, 0xff,
// push eax
0x50,
// push [ebp+var_12c]
0xff, 0xb5, 0xd4, 0xfe, 0xff, 0xff,