forked from Vicshann/Common
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathUtils.cpp
3192 lines (3092 loc) · 119 KB
/
Utils.cpp
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) 2018 Victor Sheinmann, Vicshann@gmail.com
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
#include "ThirdParty\NTDLL\ntdll.h"
#include "Utils.h"
#include "Common.hpp"
#include <Wbemidl.h>
//====================================================================================
// sprintf: hex, bits
HANDLE hLogFile = NULL;
HANDLE hConsOut = NULL;
wchar_t LogFilePath[MAX_PATH];
int LogMode = lmNone;
void _cdecl DummyLogProc(LPSTR, UINT){}
void (_cdecl *pLogProc)(LPSTR, UINT) = DummyLogProc;
//---------------------------------------------------------------------------
#ifndef __BORLANDC__
#pragma function(memcmp, memset, memcpy, memmove)
//---------------------------------------------------------------------------
void* __cdecl memmove(void* _Dst, const void* _Src, size_t _Size)
{
if((char*)_Dst <= (char*)_Src)return memcpy(_Dst,_Src,_Size);
size_t ALen = _Size/sizeof(size_t);
size_t BLen = _Size%sizeof(size_t);
for(size_t ctr=_Size-1;BLen > 0;ctr--,BLen--)((char*)_Dst)[ctr] = ((char*)_Src)[ctr];
for(size_t ctr=ALen-1;ALen > 0;ctr--,ALen--) ((size_t*)_Dst)[ctr] = ((size_t*)_Src)[ctr];
return _Dst;
}
//---------------------------------------------------------------------------
void* __cdecl memcpy(void* _Dst, const void* _Src, size_t _Size)
{
size_t ALen = _Size/sizeof(size_t);
size_t BLen = _Size%sizeof(size_t);
for(size_t ctr=0;ctr < ALen;ctr++)((size_t*)_Dst)[ctr] = ((size_t*)_Src)[ctr];
for(size_t ctr=(ALen*sizeof(size_t));ctr < _Size;ctr++)((char*)_Dst)[ctr] = ((char*)_Src)[ctr];
return _Dst;
}
//---------------------------------------------------------------------------
void* __cdecl memset(void* _Dst, int _Val, size_t _Size) // TODO: Aligned, SSE by MACRO
{
size_t ALen = _Size/sizeof(size_t);
size_t BLen = _Size%sizeof(size_t);
size_t DVal =_Val & 0xFF; // Bad and incorrect For x32: '(size_t)_Val * 0x0101010101010101;' // Multiply by 0x0101010101010101 to copy the lowest byte into all other bytes
if(DVal)
{
DVal = _Val | (_Val << 8) | (_Val << 16) | (_Val << 24);
#ifdef _AMD64_
DVal |= DVal << 32;
#endif
}
for(size_t ctr=0;ctr < ALen;ctr++)((size_t*)_Dst)[ctr] = DVal;
for(size_t ctr=(ALen*sizeof(size_t));ctr < _Size;ctr++)((char*)_Dst)[ctr] = DVal;
return _Dst;
}
//---------------------------------------------------------------------------
int __cdecl memcmp(const void* _Buf1, const void* _Buf2, size_t _Size) // '(*((ULONG**)&_Buf1))++;'
{
unsigned char* BufA = (unsigned char*)_Buf1;
unsigned char* BufB = (unsigned char*)_Buf2;
for(;_Size >= sizeof(size_t); _Size-=sizeof(size_t), BufA+=sizeof(size_t), BufB+=sizeof(size_t)) // Enters here only if Size >= sizeof(ULONG)
{
if(*((size_t*)BufA) != *((size_t*)BufB))break; // Have to break and continue as bytes because return value must be INT // return (*((intptr_t*)BufA) - *((intptr_t*)BufB)); // // TODO: Move everything to multiplatform FRAMEWORK
}
for(;_Size > 0; _Size--, BufA++, BufB++) // Enters here only if Size > 0
{
if(*((unsigned char*)BufA) != *((unsigned char*)BufB)){return ((int)*BufA - (int)*BufB);}
}
return 0;
}
//---------------------------------------------------------------------------
int __cdecl stricmp(char const* String1,char const* String2)
{
return lstrcmpiA(String1,String2);
}
//---------------------------------------------------------------------------
char* __cdecl strncpy(char* _Destination, char const* _Source, size_t _Count)
{
return lstrcpynA(_Destination, _Source, _Count);
}
//---------------------------------------------------------------------------
extern "C" void* __cdecl malloc(size_t _Size)
{
return HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,_Size);
}
//---------------------------------------------------------------------------
extern "C" void* __cdecl calloc(size_t _Count, size_t _Size)
{
return HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,_Size*_Count);
}
//---------------------------------------------------------------------------
extern "C" void* __cdecl realloc(void* _Block, size_t _Size)
{
return HeapReAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,_Block,_Size);
}
//---------------------------------------------------------------------------
extern "C" void __cdecl free(void* _Block)
{
HeapFree(GetProcessHeap(),0,_Block);
}
//---------------------------------------------------------------------------
extern "C" __time64_t __cdecl _mktime64(_Inout_ struct tm* _Tm)
{
return 0; // No support for now // We have to use some ancient third party code // TODO: Integrate everything useful in a lightweight header-only framework
}
//---------------------------------------------------------------------------
extern "C" void __cdecl tzset(void) // It is not even for for Windows :)
{
}
//---------------------------------------------------------------------------
void* __cdecl operator new(size_t n)
{
return HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,n);
}
//---------------------------------------------------------------------------
void* __cdecl operator new[](size_t n)
{
return HeapAlloc(GetProcessHeap(),HEAP_ZERO_MEMORY,n);
}
//---------------------------------------------------------------------------
void __cdecl operator delete(void* p)
{
#ifndef _NODESTR
HeapFree(GetProcessHeap(),0,p);
#endif
}
//---------------------------------------------------------------------------
void __cdecl operator delete(void* p, size_t n)
{
#ifndef _NODESTR
HeapFree(GetProcessHeap(),0,p);
#endif
}
//---------------------------------------------------------------------------
void __cdecl operator delete[](void* p)
{
#ifndef _NODESTR
HeapFree(GetProcessHeap(),0,p);
#endif
}
//---------------------------------------------------------------------------
void __cdecl operator delete[](void* p, size_t n)
{
#ifndef _NODESTR
HeapFree(GetProcessHeap(),0,p);
#endif
}
//---------------------------------------------------------------------------
#ifndef NOMINIRTL
extern "C" int _fltused = 0;
extern "C" int __cdecl _purecall(void) { return 0; }
extern "C" int __cdecl atexit( void (__cdecl *func )( void ) ) // MINIRTL ?
{
if(func)func();
return 0;
}
/*extern "C" const DWORD_PTR __security_cookie = 0xE64EBB40;
extern "C" void __fastcall __security_check_cookie(DWORD_PTR cookie)
{
} */
//---------------------------------------------------------------------------
#ifndef _M_X64
extern "C" __declspec(naked) float _cdecl _CIsqrt(float &Value)
{
__asm FSQRT
__asm RET
}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) long _cdecl _ftol2(float &Value) // What is FPU rounding mode? Should be TRUNCATE
{
__asm PUSH EAX
__asm PUSH EAX
__asm FISTP QWORD PTR [ESP] // SSE3: FISTTP converts the value in ST into a signed integer using truncation (chop) as rounding mode,
__asm POP EAX
__asm POP EDX
__asm RET
}
//---------------------------------------------------------------------------
static const unsigned long long _Int32ToUInt32[] = {0ULL, 0x41F0000000000000ULL};
extern "C" __declspec(naked) double _cdecl _ultod3(unsigned long long val) // needed for SSE code for 32-bit arch // SSE2
{
__asm
{
xorps xmm0, xmm0
cvtsi2sd xmm0, ecx
shr ecx, 31
addsd xmm0, ds:_Int32ToUInt32[ecx*8]
test edx, edx
jz short _ultod3_uint32
xorps xmm1, xmm1
cvtsi2sd xmm1, edx
shr edx, 31
addsd xmm1, ds:_Int32ToUInt32[edx*8]
mulsd xmm1, ds:_Int32ToUInt32[8] // _DP2to32
addsd xmm0, xmm1
_ultod3_uint32:
retn
}
}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) double _cdecl _ltod3(long long val) // needed for SSE code for 32-bit arch // SSE2
{
__asm
{
xorps xmm1, xmm1
cvtsi2sd xmm1, edx
xorps xmm0, xmm0
cvtsi2sd xmm0, ecx
shr ecx, 31
mulsd xmm1, ds:_Int32ToUInt32[8] //_DP2to32
addsd xmm0, ds:_Int32ToUInt32[ecx*8]
addsd xmm0, xmm1
retn
}
}
//---------------------------------------------------------------------------
// Only works for inputs in the range: [0, 2^52) // SSE2
unsigned long long double_to_uint64(__m128d x) // Generated a bad optimized code! // NOTE: Incorrect for a negative x. Good only for ftoa_simple
{
// x = _mm_sub_pd(x, _mm_set_sd(0.5)); // Remove rounding effect
x = _mm_add_pd(x, _mm_set1_pd(0x0010000000000000-0.5)); // No rounding now!
__m128i res = _mm_xor_si128(_mm_castpd_si128(x), _mm_castpd_si128(_mm_set1_pd(0x0010000000000000)));
return *(unsigned long long*)&res;
}
extern "C" __declspec(naked) unsigned long long _cdecl _dtoul3(double val) // needed for SSE code for 32-bit arch // double passed in xmm0 and not retrievable by C++ code! // // Truncating
{
__asm jmp double_to_uint64
}
//---------------------------------------------------------------------------
/*extern "C" __declspec(naked) unsigned __int64 _cdecl _aullshr(unsigned __int64 Value, unsigned int Shift) // MS calls this function as _fastcall here!!!!
{
__asm {
CMP CL,64
JNB SHORT RETZERO
CMP CL,32
JNB SHORT MORE32
SHRD EAX,EDX,CL
SHR EDX,CL
RETN
MORE32:
MOV EAX,EDX
XOR EDX,EDX
AND CL,0x1F
SHR EAX,CL
RETN
RETZERO:
XOR EAX,EAX
XOR EDX,EDX
RETN
}
/*
if(Shift >= 64)return 0;
if(Shift >= 32)return ((unsigned int*)&Value)[0] >> (Shift & 0x1F);
unsigned int Lo = ((unsigned int*)&Value)[0];
unsigned int Hi = ((unsigned int*)&Value)[1];
Lo >>= Shift;
Lo |= (Hi << (32-Shift));
Hi >>= Shift;
((unsigned int*)&Value)[0] = Lo;
((unsigned int*)&Value)[1] = Hi;
return Value;*/
/*}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) unsigned __int64 _cdecl _allmul(unsigned __int64 multiplicand, unsigned __int64 multiplier)
{
__asm {
MOV EAX,DWORD PTR [ESP+0x08]
MOV ECX,DWORD PTR [ESP+0x10]
OR ECX,EAX
MOV ECX,DWORD PTR [ESP+0x0C]
JNZ SHORT Part2
MOV EAX,DWORD PTR [ESP+0x04]
MUL ECX
RETN
Part2:
PUSH EBX
MUL ECX
MOV EBX,EAX
MOV EAX,DWORD PTR [ESP+0x08]
MUL DWORD PTR [ESP+0x14]
ADD EBX,EAX
MOV EAX,DWORD PTR [ESP+0x08]
MUL ECX
ADD EDX,EBX
POP EBX
RETN
}
}
//---------------------------------------------------------------------------
*/
//---------------------------------------------------------------------------
extern "C" __declspec(naked) unsigned __int64 _cdecl _aullshr(unsigned __int64 Value, unsigned int Shift) // MS calls this function as _fastcall !!!! EDX:EAX, ECX // ret
{
__asm
{
push ECX
push EDX
push EAX
call ShrULL
retn
}
//return ShrULL(Value, Shift);
}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) unsigned __int64 _cdecl _allshl(unsigned __int64 Value, unsigned int Shift) // MS calls this function as _fastcall !!!! EDX:EAX, ECX // ret
{
__asm
{
push ECX
push EDX
push EAX
call ShlULL
retn
}
//return ShlULL(Value, Shift);
}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) unsigned __int64 _cdecl _allmul(unsigned __int64 multiplicand, unsigned __int64 multiplier) // MS calls this function as _stdcall !!!! // ret 16
{
__asm jmp BinLongUMul
//return BinLongUMul(multiplicand, multiplier); // No sign? !!!!!!
}
//---------------------------------------------------------------------------
/*ULONGLONG __stdcall BinLongUDivStub(ULONGLONG Dividend, ULONGLONG Divisor)
{
return BinLongUDiv(Dividend, Divisor);
}
*/
extern "C" __declspec(naked) unsigned __int64 _cdecl _aulldiv(unsigned __int64 dividend, unsigned __int64 divisor) // MS calls this function as _stdcall !!!! // ret 16
{
__asm
{
PUSH EBX
PUSH ESI
MOV EAX,DWORD PTR [ESP+0x18]
OR EAX,EAX
JNZ Lbl_77CA4682
MOV ECX,DWORD PTR [ESP+0x14]
MOV EAX,DWORD PTR [ESP+0x10]
XOR EDX,EDX
DIV ECX
MOV EBX,EAX
MOV EAX,DWORD PTR [ESP+0x0C]
DIV ECX
MOV EDX,EBX
JMP Lbl_77CA46C3
Lbl_77CA4682:
MOV ECX,EAX
MOV EBX,DWORD PTR [ESP+0x14]
MOV EDX,DWORD PTR [ESP+0x10]
MOV EAX,DWORD PTR [ESP+0x0C]
Lbl_77CA4690:
SHR ECX,1
RCR EBX,1
SHR EDX,1
RCR EAX,1
OR ECX,ECX
JNZ Lbl_77CA4690
DIV EBX
MOV ESI,EAX
MUL DWORD PTR [ESP+0x18]
MOV ECX,EAX
MOV EAX,DWORD PTR[ESP+0x14]
MUL ESI
ADD EDX,ECX
JB Lbl_77CA46BE
CMP EDX,DWORD PTR [ESP+0x10]
JA Lbl_77CA46BE
JB Lbl_77CA46BF
CMP EAX,DWORD PTR [ESP+0x0C]
JBE Lbl_77CA46BF
Lbl_77CA46BE:
DEC ESI
Lbl_77CA46BF:
XOR EDX,EDX
MOV EAX,ESI
Lbl_77CA46C3:
POP ESI
POP EBX
RETN 16
}
}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) int _cdecl _aulldvrm(unsigned __int64 dividend, unsigned __int64 divisor)
{
__asm
{
PUSH ESI
MOV EAX, [ESP+0x14]
OR EAX, EAX
JNZ SHORT LOC_4B2EC641
MOV ECX, [ESP+0x10]
MOV EAX, [ESP+0x0C]
XOR EDX, EDX
DIV ECX
MOV EBX, EAX
MOV EAX, [ESP+8]
DIV ECX
MOV ESI, EAX
MOV EAX, EBX
MUL DWORD PTR [ESP+0x10]
MOV ECX, EAX
MOV EAX, ESI
MUL DWORD PTR [ESP+0x10]
ADD EDX, ECX
JMP SHORT LOC_4B2EC688
LOC_4B2EC641:
MOV ECX, EAX
MOV EBX, [ESP+0x10]
MOV EDX, [ESP+0x0C]
MOV EAX, [ESP+8]
LOC_4B2EC64F:
SHR ECX, 1
RCR EBX, 1
SHR EDX, 1
RCR EAX, 1
OR ECX, ECX
JNZ SHORT LOC_4B2EC64F
DIV EBX
MOV ESI, EAX
MUL DWORD PTR [ESP+0x14]
MOV ECX, EAX
MOV EAX, [ESP+0x10]
MUL ESI
ADD EDX, ECX
JB SHORT LOC_4B2EC67D
CMP EDX, [ESP+0x0C]
JA SHORT LOC_4B2EC67D
JB SHORT LOC_4B2EC686
CMP EAX, [ESP+8]
JBE SHORT LOC_4B2EC686
LOC_4B2EC67D:
DEC ESI
SUB EAX, [ESP+0x10]
SBB EDX, [ESP+0x14]
LOC_4B2EC686:
XOR EBX, EBX
LOC_4B2EC688:
SUB EAX, [ESP+8]
SBB EDX, [ESP+0x0C]
NEG EDX
NEG EAX
SBB EDX, 0
MOV ECX, EDX // Unusual return format (2 results, 128 bit)
MOV EDX, EBX
MOV EBX, ECX
MOV ECX, EAX
MOV EAX, ESI
POP ESI
RETN 16
}
}
//---------------------------------------------------------------------------
extern "C" __declspec(naked) int _cdecl _aullrem(unsigned __int64 dividend, unsigned __int64 divisor)
{
__asm
{
PUSH EBX
MOV EAX, [ESP+0x14]
OR EAX, EAX
JNZ SHORT LOC_4B2EC6D1
MOV ECX, [ESP+0x10]
MOV EAX, [ESP+0x0C]
XOR EDX, EDX
DIV ECX
MOV EAX, [ESP+8]
DIV ECX
MOV EAX, EDX
XOR EDX, EDX
JMP SHORT LOC_4B2EC721
LOC_4B2EC6D1:
MOV ECX, EAX
MOV EBX, [ESP+0x10]
MOV EDX, [ESP+0x0C]
MOV EAX, [ESP+8]
LOC_4B2EC6DF:
SHR ECX, 1
RCR EBX, 1
SHR EDX, 1
RCR EAX, 1
OR ECX, ECX
JNZ SHORT LOC_4B2EC6DF
DIV EBX
MOV ECX, EAX
MUL DWORD PTR [ESP+0x14]
XCHG EAX, ECX
MUL DWORD PTR [ESP+0x10]
ADD EDX, ECX
JB SHORT LOC_4B2EC70A
CMP EDX, [ESP+0x0C]
JA SHORT LOC_4B2EC70A
JB SHORT LOC_4B2EC712
CMP EAX, [ESP+8]
JBE SHORT LOC_4B2EC712
LOC_4B2EC70A:
SUB EAX, [ESP+0x10]
SBB EDX, [ESP+0x14]
LOC_4B2EC712:
SUB EAX, [ESP+8]
SBB EDX, [ESP+0x0C]
NEG EDX
NEG EAX
SBB EDX, 0
LOC_4B2EC721:
POP EBX
RETN 16
}
}
//---------------------------------------------------------------------------
// __asm jmp BinLongUDivStub
//return BinLongUDiv(dividend, divisor);
#endif
#endif
#else // __BORLANDC__
//---------------------------------------------------------------------------
__declspec(naked) void _stdcall fix__fpreset(void) // Fix conflict of BDS and TTS in FPU
{
__asm // Must be naked - compiler is VERY stupid
{
push 0x027F // Normal FPU status
fldcw [ESP]
pop EAX
retn
}
}
#endif
//---------------------------------------------------------------------------
__declspec(noinline) PVOID _fastcall FixExportRedir(PVOID ThisLibBase, PVOID ExpProcAddr, PWSTR LibPath)
{
LPSTR ProcName = NPEFMT::TGetProcedureInfoByAddr<NPEFMT::PECURRENT>((PBYTE)ThisLibBase, ExpProcAddr);
HMODULE hOrig = LoadLibraryW(LibPath); // Not GetModuleHandle since both have the same name
DBGMSG("ThisLibBase=%p, OrigLibBase=%p, ExpProcAddr=%p, ExpProcName=%s = %ls",ThisLibBase, hOrig, ExpProcAddr, ProcName, LibPath);
return GetProcAddress(hOrig, ProcName);
}
//---------------------------------------------------------------------------
bool _stdcall IsLogHandle(HANDLE Hnd)
{
return ((Hnd == hLogFile)||(Hnd == hConsOut));
}
//---------------------------------------------------------------------------
// !!! -0.177166 is incorrectly printed with %f!!!
// OPt: InterprocSync, Reopen/Update log // Depth // Fastcall, Max 3 constant args
// float pushed as double, char pushed as a signed size_t
//
void _cdecl LogProc(int Flags, char* ProcName, char* Message, ...)
{
va_list args;
static volatile ULONG MsgIdx = 0;
static volatile UINT64 PrvTime = 0;
NTSTATUS Status;
UINT MSize = 0;
char* MPtr = NULL;
char TmpBuf[1024*4]; // avoid chkstk
if(!Message || !LogMode)return; // NULL text string
va_start(args,Message);
ULONG MIndex = _InterlockedIncrement((long*)&MsgIdx);
if(!(Flags & lfRawTextMsg)) // Format a normal message
{
MPtr = TmpBuf;
UINT Len = 0;
if(Flags & lfLogTime)
{
NNTDLL::GetAbstractTimeStamp(&PrvTime); // NNTDLL::GetTicks();
ConvertToHexStr(PrvTime, 16, TmpBuf, true, &Len); // Ticks time
MSize += Len;
TmpBuf[MSize++] = 0x20;
}
if(Flags & lfLogMsgIdx)
{
ConvertToHexStr(MIndex, 8, &TmpBuf[MSize], true, &Len); // Message Index (For message order detection)
MSize += Len;
TmpBuf[MSize++] = 0x20;
}
if(Flags & lfLogThID)
{
ConvertToHexStr(NtCurrentThreadId(), 6, &TmpBuf[MSize], true, &Len); // Thread ID
MSize += Len;
TmpBuf[MSize++] = 0x20;
}
if(ProcName && (Flags & lfLogName))
{
for(;*ProcName;ProcName++,MSize++)TmpBuf[MSize] = *ProcName;
TmpBuf[MSize++] = 0x20;
}
if(MSize) // Have some logger info
{
TmpBuf[MSize++] = '-';
TmpBuf[MSize++] = '>';
TmpBuf[MSize++] = 0x20;
}
MSize += FormatToBuffer(Message, &TmpBuf[MSize], (sizeof(TmpBuf)-3)-MSize, args);
if(Flags & lfLineBreak)
{
TmpBuf[MSize++] = '\r';
TmpBuf[MSize++] = '\n';
}
TmpBuf[MSize] = 0; // User`s LogProc may want this
}
else // Log raw text (No line break supported)
{
MSize = ProcName?((UINT)ProcName):(NSTR::StrLen(Message)); // ProcName is message size
MPtr = Message;
}
va_end(args);
if(LogMode & lmProc)pLogProc(MPtr, MSize);
if(LogMode & lmFile)
{
if(!hLogFile) // NOTE: Without FILE_APPEND_DATA offsets must be specified to NtWriteFile
{ // (LogMode & lmFileUpd)?FILE_APPEND_DATA:FILE_WRITE_DATA // // LogMode |= lmFileUpd;
Status = NCMN::NNTDLL::FileCreateSync(LogFilePath, FILE_APPEND_DATA, FILE_ATTRIBUTE_NORMAL, FILE_SHARE_READ|FILE_SHARE_WRITE, (LogMode & lmFileUpd)?FILE_OPEN_IF:FILE_OVERWRITE_IF, FILE_NON_DIRECTORY_FILE, &hLogFile);
}
else Status = 0;
if(!Status)
{
LARGE_INTEGER offset = {};
IO_STATUS_BLOCK iosb = {};
Status = NtWriteFile(hLogFile, NULL, NULL, NULL, &iosb, MPtr, MSize, &offset, NULL);
}
}
if(LogMode & lmCons)
{
IO_STATUS_BLOCK iosb = {};
if(!hConsOut)hConsOut = NtCurrentPeb()->ProcessParameters->StandardOutput; // Not a real file handle on Windows 7!
if((UINT)hConsOut != 7)Status = NtWriteFile(hConsOut, NULL, NULL, NULL, &iosb, MPtr, MSize, NULL, NULL); // Will not work until Windows 8
}
}
//---------------------------------------------------------------------------
enum EFlags {
FLAGS_ZEROPAD = (1U << 0U),
FLAGS_LEFT = (1U << 1U),
FLAGS_PLUS = (1U << 2U),
FLAGS_SPACE = (1U << 3U),
FLAGS_HASH = (1U << 4U),
FLAGS_UPPERCASE = (1U << 5U),
FLAGS_CHAR = (1U << 6U),
FLAGS_SHORT = (1U << 7U),
FLAGS_LONG = (1U << 8U),
FLAGS_LONG_LONG = (1U << 9U),
FLAGS_PRECISION = (1U << 10U),
FLAGS_ADAPT_EXP = (1U << 11U)
};
inline bool _is_digit(char ch)
{
return (ch >= '0') && (ch <= '9');
}
//---------------------------------------------------------------------------
// internal ASCII string to unsigned int conversion
inline unsigned int _atoi(char** Str)
{
unsigned int x = 0;
for(unsigned char ch;(ch=*(*Str) - '0') <= 9;(*Str)++)x = (x*10) + ch; // Can use a different base?
return x;
}
//---------------------------------------------------------------------------
template<typename T> inline unsigned int _strnlen_s(T str, size_t maxsize)
{
if(!str)return 0;
T s = str;
for (; *s && maxsize--; ++s);
return (unsigned int)(s - str);
}
//---------------------------------------------------------------------------
template<typename T> size_t _ntoa(char* buffer, size_t idx, size_t maxlen, T value, bool negative, T base, unsigned int prec, unsigned int width, unsigned int flags)
{
char buf[32];
size_t len = 0U;
if (!value)flags &= ~FLAGS_HASH; // no hash for 0 values
// write if precision != 0 and value is != 0
if (!(flags & FLAGS_PRECISION) || value) {
do {
const char digit = (char)(value % base); // Not cheap!!!
buf[len++] = digit < 10 ? '0' + digit : (flags & FLAGS_UPPERCASE ? 'A' : 'a') + digit - 10;
value /= base;
} while (value && (len < sizeof(buf)));
}
// pad leading zeros
if (!(flags & FLAGS_LEFT)) {
if (width && (flags & FLAGS_ZEROPAD) && (negative || (flags & (FLAGS_PLUS | FLAGS_SPACE))))width--;
while ((len < prec) && (len < sizeof(buf)))buf[len++] = '0';
while ((flags & FLAGS_ZEROPAD) && (len < width) && (len < sizeof(buf)))buf[len++] = '0';
}
// handle hash
if (flags & FLAGS_HASH) {
if (!(flags & FLAGS_PRECISION) && len && ((len == prec) || (len == width)) && (--len && (base == 16U)))len--;
if ((base == 16U) && !(flags & FLAGS_UPPERCASE) && (len < sizeof(buf)))buf[len++] = 'x';
else if ((base == 16U) && (flags & FLAGS_UPPERCASE) && (len < sizeof(buf)))buf[len++] = 'X';
else if ((base == 2U) && (len < sizeof(buf)))buf[len++] = 'b';
if(len < sizeof(buf))buf[len++] = '0';
}
if (len < sizeof(buf)) {
if (negative)buf[len++] = '-';
else if (flags & FLAGS_PLUS)buf[len++] = '+'; // ignore the space if the '+' exists
else if (flags & FLAGS_SPACE)buf[len++] = ' ';
}
const size_t start_idx = idx;
// pad spaces up to given width
if (!(flags & FLAGS_LEFT) && !(flags & FLAGS_ZEROPAD)) {
for (size_t i = len; i < width; i++)buffer[idx++] = ' '; // out(' ', buffer, idx++, maxlen);
}
// reverse string
if((idx+len) > maxlen)return idx; // ???
while (len)buffer[idx++] = buf[--len];
// append pad spaces up to given width
if (flags & FLAGS_LEFT){while (idx - start_idx < width)buffer[idx++] = ' ';} // out(' ', buffer, idx++, maxlen); // if(((width - (idx - start_idx)) + idx) > maxlen) // Too costlly to check
return idx;
}
//---------------------------------------------------------------------------
// TODO: Put this and all num-to-str/str-to-num functions into Format.hpp (mamespace NFMT)
// TODO: Use a template to generate a type validation string from all passed arguments
// TODO: Repeated chars
// TODO: Indexed arg reuse
//
int _stdcall FormatToBuffer(char* format, char* buffer, UINT maxlen, va_list va)
{
size_t idx = 0U;
while(*format && (idx < (size_t)maxlen)) // format specifier? %[flags][width][.precision][length]
{
// Check if the next 4 bytes contain %(0x25) or end of string. Using the 'hasless' trick: https://graphics.stanford.edu/~seander/bithacks.html#HasLessInWord
// v = *(stbsp__uint32 *)f;
// c = (~v) & 0x80808080;
// if (((v ^ 0x25252525) - 0x01010101) & c)goto schk1;
// if ((v - 0x01010101) & c)goto schk2;
if(*format != '%'){buffer[idx++]=*(format++); continue;}
format++;
// evaluate flags
unsigned int n;
unsigned int flags = 0U;
do { switch(*format) {
case '0': flags |= FLAGS_ZEROPAD; format++; n = 1U; break;
case '-': flags |= FLAGS_LEFT; format++; n = 1U; break;
case '+': flags |= FLAGS_PLUS; format++; n = 1U; break;
case ' ': flags |= FLAGS_SPACE; format++; n = 1U; break;
case '#': flags |= FLAGS_HASH; format++; n = 1U; break;
default : n = 0U; break;
} } while (n);
// evaluate width field
unsigned int width = 0U;
if (_is_digit(*format))width = _atoi(&format);
else if (*format == '*') {
const int w = va_arg(va, int);
if (w < 0) {flags |= FLAGS_LEFT; width = (unsigned int)-w;} // reverse padding
else width = (unsigned int)w;
format++;
}
// evaluate precision field
unsigned int precision = 0U;
if (*format == '.') {
flags |= FLAGS_PRECISION;
format++;
if (_is_digit(*format))precision = _atoi(&format);
else if (*format == '*') {
const int prec = (int)va_arg(va, int);
precision = prec > 0 ? (unsigned int)prec : 0U;
format++;
}
}
// evaluate length field
switch (*format) {
case 'l' :
if(*(++format) == 'l'){flags |= FLAGS_LONG_LONG; format++;}
else flags |= FLAGS_LONG;
break;
case 'h':
if(*(++format) == 'h'){flags |= FLAGS_CHAR; format++;}
else flags |= FLAGS_SHORT;
break;
/* case 't' :
flags |= (sizeof(ptrdiff_t) == sizeof(long) ? FLAGS_LONG : FLAGS_LONG_LONG);
format++;
break;
case 'j' :
flags |= (sizeof(intmax_t) == sizeof(long) ? FLAGS_LONG : FLAGS_LONG_LONG);
format++;
break; */
case 'z' :
flags |= (sizeof(size_t) == sizeof(long) ? FLAGS_LONG : FLAGS_LONG_LONG);
format++;
break;
default :
break;
}
switch (*format) { // evaluate specifier
// case 'd' :
case 'i' :
case 'u' :
case 'x' :
case 'X' :
case 'o' :
case 'b' : {
// set the base
unsigned int base;
if (*format == 'x' || *format == 'X')base = 16U;
else if (*format == 'o')base = 8U;
else if (*format == 'b')base = 2U;
else {base = 10U; flags &= ~FLAGS_HASH;} // no hash for dec format
if (*format == 'X')flags |= FLAGS_UPPERCASE; // uppercase
if (*format != 'i')flags &= ~(FLAGS_PLUS | FLAGS_SPACE); // no plus or space flag for u, x, X, o, b // && (*format != 'd')
// ignore '0' flag when precision is given
if (flags & FLAGS_PRECISION)flags &= ~FLAGS_ZEROPAD;
// convert the integer
if (*format == 'i') { // signed // || (*format == 'd')
if (flags & FLAGS_LONG_LONG) {
const long long value = va_arg(va, long long);
idx = _ntoa<unsigned long long>(buffer, idx, maxlen, (unsigned long long)(value > 0 ? value : 0 - value), value < 0, base, precision, width, flags);
}
else if (flags & FLAGS_LONG) {
const long value = va_arg(va, long);
idx = _ntoa<unsigned long>(buffer, idx, maxlen, (unsigned long)(value > 0 ? value : 0 - value), value < 0, base, precision, width, flags);
}
else {
const int value = (flags & FLAGS_CHAR) ? (char)va_arg(va, int) : (flags & FLAGS_SHORT) ? (short int)va_arg(va, int) : va_arg(va, int);
idx = _ntoa<unsigned long>(buffer, idx, maxlen, (unsigned int)(value > 0 ? value : 0 - value), value < 0, base, precision, width, flags);
}
}
else { // unsigned
if (flags & FLAGS_LONG_LONG)idx = _ntoa<unsigned long long>(buffer, idx, maxlen, va_arg(va, unsigned long long), false, base, precision, width, flags);
else if (flags & FLAGS_LONG)idx = _ntoa<unsigned long>(buffer, idx, maxlen, va_arg(va, unsigned long), false, base, precision, width, flags);
else {
const unsigned int value = (flags & FLAGS_CHAR) ? (unsigned char)va_arg(va, unsigned int) : (flags & FLAGS_SHORT) ? (unsigned short int)va_arg(va, unsigned int) : va_arg(va, unsigned int);
idx = _ntoa<unsigned long>(buffer, idx, maxlen, value, false, base, precision, width, flags);
}
}
format++;
break;
}
case 'f' :
case 'F' : {
size_t prec = (flags & FLAGS_PRECISION)?precision:14; // Is 14 optimal?
if(*format == 'F') {flags |= FLAGS_UPPERCASE; prec |= 0x1000;} // ffUpperCase
if(flags & FLAGS_HASH)prec |= 0x8000; // ffZeroPad // ffCommaSep // Or may be ffZeroPad 0x8000?
size_t len = 0;
char buf[52];
char* ptr = ftoa_simple(va_arg(va, double), prec, buf, sizeof(buf), &len); // After this we have some space at beginning of the buffer
bool negative = (*ptr == '-');
if (!(flags & FLAGS_LEFT) && (flags & FLAGS_ZEROPAD)) {
if (width && (negative || (flags & (FLAGS_PLUS | FLAGS_SPACE)))) width--;
while ((len < width) && (len < sizeof(buf))){*(--ptr) = '0'; len++;} // Width adds zeroes BEFORE
}
if ((len < sizeof(buf)) && !negative) {
if (flags & FLAGS_PLUS){*(--ptr) = '+'; len++;} // ignore the space if the '+' exists
else if (flags & FLAGS_SPACE){*(--ptr) = ' '; len++;}
}
const size_t start_idx = idx;
if (!(flags & FLAGS_LEFT) && !(flags & FLAGS_ZEROPAD)) { // pad spaces up to given width // TODO: CopyPadded inline function
for (size_t i = len; i < width; i++)buffer[idx++] = ' '; } // out(' ', buffer, idx++, maxlen);
while(len--)buffer[idx++] = *(ptr++); //out(buf[--len], buffer, idx++, maxlen); // reverse string
if (flags & FLAGS_LEFT) { // append pad spaces up to given width
while (idx - start_idx < width)buffer[idx++] = ' '; } // out(' ', buffer, idx++, maxlen);
format++; }
break;
#if defined(PRINTF_SUPPORT_EXPONENTIAL)
case 'e':
case 'E':
case 'g':
case 'G':
if ((*format == 'g')||(*format == 'G')) flags |= FLAGS_ADAPT_EXP;
if ((*format == 'E')||(*format == 'G')) flags |= FLAGS_UPPERCASE;
idx = _etoa(out, buffer, idx, maxlen, va_arg(va, double), precision, width, flags);
format++;
break;
#endif // PRINTF_SUPPORT_EXPONENTIAL
case 'c' : {
unsigned int l = 1U;
if (!(flags & FLAGS_LEFT)){while (l++ < width)buffer[idx++] = ' ';} // pre padding // TODO: Buffer limit
buffer[idx++] = (char)va_arg(va, int); // char output // out((char)va_arg(va, int), buffer, idx++, maxlen);
if (flags & FLAGS_LEFT){while (l++ < width)buffer[idx++] = ' ';} // post padding
format++;
break;
}
case 's' : {
char* cp;
wchar_t* wp;
unsigned int l;
if(flags & FLAGS_LONG)
{
wp = va_arg(va, wchar_t*);
l = _strnlen_s(wp, precision ? precision : (size_t)-1); // precision or a full size
}
else
{
cp = va_arg(va, char*);
l = _strnlen_s(cp, precision ? precision : (size_t)-1); // precision or a full size
}
unsigned int f = l; // Full len of the string
if(flags & FLAGS_PRECISION) f = l = (l < precision ? l : precision); // Not greater than precision or 0
if(!(flags & FLAGS_LEFT)){while (l++ < width)buffer[idx++] = ' ';} // pre padding
if(flags & FLAGS_LONG)idx += NUTF::Utf16To8(buffer, wp, f, idx, 0);
else {for (;f;f--)buffer[idx++] = *(cp++);} // string output // out(*(p++), buffer, idx++, maxlen); // while ((*p != 0) && (!(flags & FLAGS_PRECISION) || precision--))buffer[idx++] = *(p++);
if(flags & FLAGS_LEFT){while (l++ < width)buffer[idx++] = ' ';} // post padding
format++;
break;
}
case 'd' : // LOGMSG("\r\n%#*.32D",Size,Src);
case 'D' : { // Width is data block size, precision is line size(single line if not specified) // '%*D' counted dump
if(*format == 'D')flags |= FLAGS_UPPERCASE;
unsigned char* DPtr = va_arg(va, unsigned char*);
unsigned int RLen = precision?precision:width; // If no precision is specified then write everything in one line
unsigned int DelMult = (flags & FLAGS_SPACE)?3:2;
for(unsigned int offs=0,roffs=0,rpos=0;idx < maxlen;offs++,roffs++)
{
bool HaveMore = offs < width;
if(!HaveMore || (roffs >= RLen))
{
if(flags & FLAGS_HASH) // Include char dump
{
unsigned int IndCnt = (flags & FLAGS_SPACE)?1:2;
IndCnt += (RLen - roffs) * DelMult; // Indent missing HEX space //if(!SingleLine)
if((idx+IndCnt) > maxlen)goto Exit; // No more space
memset(&buffer[idx], ' ', IndCnt);
idx += IndCnt;
for(unsigned int ctr=0;(ctr < roffs)&&(idx < maxlen);ctr++) // Create Text string
{
unsigned char Val = DPtr[rpos+ctr];
if(Val < 0x20)Val = '.';
buffer[idx++] = Val;
}
}
if(!HaveMore || ((idx+4) > maxlen))break;
buffer[idx++] = '\r'; // Add only if there is another line follows
buffer[idx++] = '\n';
rpos = offs;
roffs = 0;
}
unsigned short Val = HexToChar(DPtr[offs]);
buffer[idx++] = Val;
buffer[idx++] = Val >> 8;
if(flags & FLAGS_SPACE)buffer[idx++] = ' ';
}
format++;
break; }
case 'p' : {
// width = sizeof(void*) * 2U;
flags |= FLAGS_ZEROPAD | FLAGS_UPPERCASE;
const bool is_ll = (sizeof(void*) == sizeof(long long)) || (flags & FLAGS_LONG);
if (is_ll)idx = _ntoa<unsigned long long>(buffer, idx, maxlen, (unsigned long long)va_arg(va, unsigned long long), false, 16U, precision, width=sizeof(long long)*2, flags);
else idx = _ntoa<unsigned long>(buffer, idx, maxlen, (unsigned long)va_arg(va, unsigned long), false, 16U, precision, width=sizeof(long)*2, flags);
format++;
break;
}
case 'n': { // Nothing printed. The number of characters written so far is stored in the pointed location.
int* p = va_arg(va, int*);
*p = idx; }
break;
default:
buffer[idx++] = *(format++); //out(*format, buffer, idx++, maxlen); format++;
break;
}
}