-
Notifications
You must be signed in to change notification settings - Fork 16
/
ramsearch.cpp
2014 lines (1808 loc) · 65.5 KB
/
ramsearch.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
//RamSearch dialog was copied and adapted from GENS11: http://code.google.com/p/gens-rerecording/
//Authors: Upthorn, Nitsuja, adelikat
// A few notes about this implementation of a RAM search window:
//
// Speed of update was one of the highest priories.
// This is because I wanted the RAM search window to be able to
// update every single value in RAM every single frame, and
// keep track of the exact number of frames across which each value has changed,
// without causing the emulation to run noticeably slower than normal.
//
// The data representation was changed from one entry per valid address
// to one entry per contiguous range of uneliminated addresses
// which references uniform pools of per-address properties.
// - This saves time when there are many items because
// it minimizes the amount of data that needs to be stored and processed per address.
// - It also saves time when there are few items because
// it ensures that no time is wasted in iterating through
// addresses that have already been eliminated from the search.
//
// The worst-case scenario is when every other item has been
// eliminated from the search, maximizing the number of regions.
// This implementation manages to handle even that pathological case
// acceptably well. In fact, it still updates faster than the previous implementation.
// The time spent setting up or clearing such a large number of regions
// is somewhat horrendous, but it seems reasonable to have poor worst-case speed
// during these sporadic "setup" steps to achieve an all-around faster per-update speed.
// (You can test this case by performing the search: Modulo 2 Is Specific Address 0)
#include "resource.h"
//#include "common.h"
//#include "main.h"
//#include "NDSSystem.h"
#include "ramwatch.h"
//#include "inttypes.h"
#include "prefix.h"
#include "ramsearch.h"
#include <assert.h>
#include <commctrl.h>
#include "ramwatch.h"
#include <list>
#include <vector>
#ifdef _WIN32
#include "BaseTsd.h"
typedef INT_PTR intptr_t;
#else
#include "stdint.h"
#endif
HWND RamSearchHWnd = NULL;
extern HWND g_hWnd;
extern HWND RamWatchHWnd;
extern char Str_Tmp[1024];
int Rom_Size; //TODO
unsigned char* Rom_Data; //TODO
struct MemoryRegion
{
unsigned int hardwareAddress; // hardware address of the start of this region
unsigned int size; // number of bytes to the end of this region
unsigned char* softwareAddress; // pointer to the start of the live emulator source values for this region
BOOL byteSwapped; // true if this is a byte-swapped region of memory
unsigned int virtualIndex; // index into s_prevValues, s_curValues, and s_numChanges, valid after being initialized in ResetMemoryRegions()
unsigned int itemIndex; // index into listbox items, valid when s_itemIndicesInvalid is false
};
static struct Buffers {
unsigned char s_prevValues [MAX_RAM_SIZE+4]; // values at last search or reset
unsigned char s_curValues [MAX_RAM_SIZE+4]; // values at last frame update
unsigned short s_numChanges [MAX_RAM_SIZE+4]; // number of changes of the item starting at this virtual index address
MemoryRegion* s_itemIndexToRegionPointer [MAX_RAM_SIZE+4]; // used for random access into the memory list (trading memory size to get speed here, too bad it's so much memory), only valid when s_itemIndicesInvalid is false
} *buffers = NULL;
static BOOL s_itemIndicesInvalid = true; // if true, the link from listbox items to memory regions (s_itemIndexToRegionPointer) and the link from memory regions to list box items (MemoryRegion::itemIndex) both need to be recalculated
static BOOL s_prevValuesNeedUpdate = true; // if true, the "prev" values should be updated using the "cur" values on the next frame update signaled
static unsigned int s_maxItemIndex = 0; // max currently valid item index, the listbox sometimes tries to update things past the end of the list so we need to know this to ignore those attempts
//NEWTODO
#include "vb.h"
uint8 BaseRAM[32768];
//uint8 *CDRAM; //262144;
//uint8 *ACRAM; //0x200000
//static const MemoryRegion s_prgRegion = { 0x1F0000, 0x20000, (unsigned char*)getDRAM(), false};//ARM9Mem.MAIN_MEM//should be 0x01F0000
//static MemoryRegion CDRAMRegion;
static MemoryRegion WRAMRegion;
static MemoryRegion DRAMRegion;
// list of contiguous uneliminated memory regions
typedef std::list<MemoryRegion> MemoryList;
static MemoryList s_activeMemoryRegions;
// for undo support (could be better, but this way was really easy)
static MemoryList s_activeMemoryRegionsBackup;
static int s_undoType = 0; // 0 means can't undo, 1 means can undo, 2 means can redo
void RamSearchSaveUndoStateIfNotTooBig(HWND hDlg);
static const int tooManyRegionsForUndo = 10000;
void InitRamSearch(bool soft)
{
if(buffers == NULL)
{
buffers = new Buffers;
memset(buffers,0,sizeof(Buffers));
/*
CDRAMRegion.byteSwapped=false;
CDRAMRegion.hardwareAddress=0xD0000;
CDRAMRegion.size=262144;
CDRAMRegion.softwareAddress=CDRAM;
*/
WRAMRegion.byteSwapped=false;
WRAMRegion.hardwareAddress=0x5000000;
WRAMRegion.size=65536;
WRAMRegion.softwareAddress=MDFN_IEN_VB::getWRAM();
DRAMRegion.byteSwapped=false;
DRAMRegion.hardwareAddress=0x200000;
DRAMRegion.size=0x20000;
DRAMRegion.softwareAddress=MDFN_IEN_VB::getDRAM();
}
if (soft) {
WRAMRegion.softwareAddress=MDFN_IEN_VB::getWRAM();
DRAMRegion.softwareAddress=MDFN_IEN_VB::getDRAM();
}
}
void ResetMemoryRegions()
{
// Clear_Sound_Buffer();
s_activeMemoryRegions.clear();
//Prevents memory from becoming unsearchable.
//Should probably be done at other points in the program too,
//such as game resets.
InitRamSearch(true);
// s_activeMemoryRegions.push_back(DRAMRegion);
s_activeMemoryRegions.push_back(WRAMRegion);
// if(CDRAM)
// s_activeMemoryRegions.push_back(CDRAMRegion);
// if(ACRAM)
// s_activeMemoryRegions.push_back(ACRAMRegion);
/*if(Genesis_Started || _32X_Started || SegaCD_Started)
{
s_activeMemoryRegions.push_back(s_68kRegion);
s_activeMemoryRegions.push_back(s_z80Region);
if(SegaCD_Started)
{
s_activeMemoryRegions.push_back(s_prgRegion);
s_activeMemoryRegions.push_back((Ram_Word_State & 0x2) ? s_word1MRegion : s_word2MRegion);
}
if(_32X_Started)
{
s_activeMemoryRegions.push_back(s_32xRegion);
}
}*/
int nextVirtualIndex = 0;
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); ++iter)
{
MemoryRegion& region = *iter;
region.virtualIndex = nextVirtualIndex;
assert(((intptr_t)region.softwareAddress & 1) == 0 && "somebody need to reimplement ReadValueAtSoftwareAddress()");
nextVirtualIndex = region.virtualIndex + region.size;
}
// assert(nextVirtualIndex <= MAX_RAM_SIZE); TODO
}
// eliminates a range of hardware addresses from the search results
// returns 2 if it changed the region and moved the iterator to another region
// returns 1 if it changed the region but didn't move the iterator
// returns 0 if it had no effect
// warning: don't call anything that takes an itemIndex in a loop that calls DeactivateRegion...
// doing so would be tremendously slow because DeactivateRegion invalidates the index cache
int DeactivateRegion(MemoryRegion& region, MemoryList::iterator& iter, unsigned int hardwareAddress, unsigned int size)
{
if(hardwareAddress + size <= region.hardwareAddress || hardwareAddress >= region.hardwareAddress + region.size)
{
// region is unaffected
return 0;
}
else if(hardwareAddress > region.hardwareAddress && hardwareAddress + size >= region.hardwareAddress + region.size)
{
// erase end of region
region.size = hardwareAddress - region.hardwareAddress;
return 1;
}
else if(hardwareAddress <= region.hardwareAddress && hardwareAddress + size < region.hardwareAddress + region.size)
{
// erase start of region
int eraseSize = (hardwareAddress + size) - region.hardwareAddress;
region.hardwareAddress += eraseSize;
region.size -= eraseSize;
region.softwareAddress += eraseSize;
region.virtualIndex += eraseSize;
return 1;
}
else if(hardwareAddress <= region.hardwareAddress && hardwareAddress + size >= region.hardwareAddress + region.size)
{
// erase entire region
iter = s_activeMemoryRegions.erase(iter);
s_itemIndicesInvalid = TRUE;
return 2;
}
else //if(hardwareAddress > region.hardwareAddress && hardwareAddress + size < region.hardwareAddress + region.size)
{
// split region
int eraseSize = (hardwareAddress + size) - region.hardwareAddress;
MemoryRegion region2 = {region.hardwareAddress + eraseSize, region.size - eraseSize, region.softwareAddress + eraseSize, region.byteSwapped, region.virtualIndex + eraseSize};
region.size = hardwareAddress - region.hardwareAddress;
iter = s_activeMemoryRegions.insert(++iter, region2);
s_itemIndicesInvalid = TRUE;
return 2;
}
}
/*
// eliminates a range of hardware addresses from the search results
// this is a simpler but usually slower interface for the above function
void DeactivateRegion(unsigned int hardwareAddress, unsigned int size)
{
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); )
{
MemoryRegion& region = *iter;
if(2 != DeactivateRegion(region, iter, hardwareAddress, size))
++iter;
}
}
*/
// warning: can be slow
void CalculateItemIndices(int itemSize)
{
unsigned int itemIndex = 0;
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); ++iter)
{
MemoryRegion& region = *iter;
region.itemIndex = itemIndex;
int startSkipSize = ((unsigned int)(itemSize - region.hardwareAddress)) % itemSize;
unsigned int start = startSkipSize;
unsigned int end = region.size;
for(unsigned int i = start; i < end; i += itemSize)
buffers->s_itemIndexToRegionPointer[itemIndex++] = ®ion;
}
s_maxItemIndex = itemIndex;
s_itemIndicesInvalid = FALSE;
}
template<typename stepType, typename compareType, int swapXOR>
void UpdateRegionT(const MemoryRegion& region, const MemoryRegion* nextRegionPtr)
{
if(s_prevValuesNeedUpdate)
memcpy(buffers->s_prevValues + region.virtualIndex, buffers->s_curValues + region.virtualIndex, region.size + sizeof(compareType) - sizeof(stepType));
unsigned int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
unsigned char* sourceAddr = region.softwareAddress - region.virtualIndex;
unsigned int indexStart = region.virtualIndex + startSkipSize;
unsigned int indexEnd = region.virtualIndex + region.size;
if(sizeof(compareType) == 1)
{
for(unsigned int i = indexStart; i < indexEnd; i++)
{
if(buffers->s_curValues[i] != sourceAddr[i^swapXOR]) // if value changed
{
buffers->s_curValues[i] = sourceAddr[i^swapXOR]; // update value
//if(s_numChanges[i] != 0xFFFF)
buffers->s_numChanges[i]++; // increase change count
}
}
}
else // it's more complicated for non-byte sizes because:
{ // - more than one byte can affect a given change count entry
// - when more than one of those bytes changes simultaneously the entry's change count should only increase by 1
// - a few of those bytes can be outside the region
unsigned int endSkipSize = ((unsigned int)(startSkipSize - region.size)) % sizeof(stepType);
unsigned int lastIndexToRead = indexEnd + endSkipSize + sizeof(compareType) - sizeof(stepType);
unsigned int lastIndexToCopy = lastIndexToRead;
if(nextRegionPtr)
{
const MemoryRegion& nextRegion = *nextRegionPtr;
int nextStartSkipSize = ((unsigned int)(sizeof(stepType) - nextRegion.hardwareAddress)) % sizeof(stepType);
unsigned int nextIndexStart = nextRegion.virtualIndex + nextStartSkipSize;
if(lastIndexToCopy > nextIndexStart)
lastIndexToCopy = nextIndexStart;
}
unsigned int nextValidChange [sizeof(compareType)];
for(unsigned int i = 0; i < sizeof(compareType); i++)
nextValidChange[i] = indexStart + i;
for(unsigned int i = indexStart, j = 0; i < lastIndexToRead; i++, j++)
{
if(buffers->s_curValues[i] != sourceAddr[i^swapXOR]) // if value of this byte changed
{
if(i < lastIndexToCopy)
buffers->s_curValues[i] = sourceAddr[i^swapXOR]; // update value
for(int k = 0; k < sizeof(compareType); k++) // loop through the previous entries that contain this byte
{
if(i >= indexEnd+k)
continue;
int m = (j-k+sizeof(compareType)) & (sizeof(compareType)-1);
if(nextValidChange[m] <= i) // if we didn't already increase the change count for this entry
{
//if(s_numChanges[i-k] != 0xFFFF)
buffers->s_numChanges[i-k]++; // increase the change count for this entry
nextValidChange[m] = i-k+sizeof(compareType); // and remember not to increase it again
}
}
}
}
}
}
template<typename stepType, typename compareType>
void UpdateRegionsT()
{
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end();)
{
const MemoryRegion& region = *iter;
++iter;
const MemoryRegion* nextRegion = (iter == s_activeMemoryRegions.end()) ? NULL : &*iter;
if(region.byteSwapped)
UpdateRegionT<stepType, compareType, 1>(region, nextRegion);
else
UpdateRegionT<stepType, compareType, 0>(region, nextRegion);
}
s_prevValuesNeedUpdate = false;
}
template<typename stepType, typename compareType>
int CountRegionItemsT()
{
if(sizeof(stepType) == 1)
{
if(s_activeMemoryRegions.empty())
return 0;
if(s_itemIndicesInvalid)
CalculateItemIndices(sizeof(stepType));
MemoryRegion& lastRegion = s_activeMemoryRegions.back();
return lastRegion.itemIndex + lastRegion.size;
}
else // the branch above is faster but won't work if the step size isn't 1
{
int total = 0;
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); ++iter)
{
MemoryRegion& region = *iter;
int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
total += (region.size - startSkipSize + (sizeof(stepType)-1)) / sizeof(stepType);
}
return total;
}
}
// returns information about the item in the form of a "fake" region
// that has the item in it and nothing else
template<typename stepType, typename compareType>
void ItemIndexToVirtualRegion(unsigned int itemIndex, MemoryRegion& virtualRegion)
{
if(s_itemIndicesInvalid)
CalculateItemIndices(sizeof(stepType));
if(itemIndex >= s_maxItemIndex)
{
memset(&virtualRegion, 0, sizeof(MemoryRegion));
return;
}
const MemoryRegion* regionPtr = buffers->s_itemIndexToRegionPointer[itemIndex];
const MemoryRegion& region = *regionPtr;
int bytesWithinRegion = (itemIndex - region.itemIndex) * sizeof(stepType);
int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
bytesWithinRegion += startSkipSize;
virtualRegion.size = sizeof(compareType);
virtualRegion.hardwareAddress = region.hardwareAddress + bytesWithinRegion;
virtualRegion.softwareAddress = region.softwareAddress + bytesWithinRegion;
virtualRegion.virtualIndex = region.virtualIndex + bytesWithinRegion;
virtualRegion.byteSwapped = region.byteSwapped;
virtualRegion.itemIndex = itemIndex;
return;
}
template<typename stepType, typename compareType>
unsigned int ItemIndexToVirtualIndex(unsigned int itemIndex)
{
MemoryRegion virtualRegion;
ItemIndexToVirtualRegion<stepType,compareType>(itemIndex, virtualRegion);
return virtualRegion.virtualIndex;
}
template<typename T>
T ReadBigEndian(const unsigned char* data)
{
T rv = 0;
for(int i = 0; i < sizeof(T); i++)
{
rv <<= 8;
rv |= *data++;
}
return rv;
}
template<> signed char ReadBigEndian(const unsigned char* data) { return *data; }
template<> unsigned char ReadBigEndian(const unsigned char* data) { return *data; }
template<typename stepType, typename compareType>
compareType GetPrevValueFromVirtualIndex(unsigned int virtualIndex)
{
// return ReadBigEndian<compareType>(buffers->s_prevValues + virtualIndex);
return *(compareType*)(buffers->s_prevValues+virtualIndex);
}
template<typename stepType, typename compareType>
compareType GetCurValueFromVirtualIndex(unsigned int virtualIndex)
{
// return ReadBigEndian<compareType>(buffers->s_curValues + virtualIndex);
return *(compareType*)(buffers->s_curValues+virtualIndex);
}
template<typename stepType, typename compareType>
unsigned short GetNumChangesFromVirtualIndex(unsigned int virtualIndex)
{
unsigned short num = buffers->s_numChanges[virtualIndex];
//for(unsigned int i = 1; i < sizeof(stepType); i++)
// if(num < s_numChanges[virtualIndex+i])
// num = s_numChanges[virtualIndex+i];
return num;
}
template<typename stepType, typename compareType>
compareType GetPrevValueFromItemIndex(unsigned int itemIndex)
{
int virtualIndex = ItemIndexToVirtualIndex<stepType,compareType>(itemIndex);
return GetPrevValueFromVirtualIndex<stepType,compareType>(virtualIndex);
}
template<typename stepType, typename compareType>
compareType GetCurValueFromItemIndex(unsigned int itemIndex)
{
int virtualIndex = ItemIndexToVirtualIndex<stepType,compareType>(itemIndex);
return GetCurValueFromVirtualIndex<stepType,compareType>(virtualIndex);
}
template<typename stepType, typename compareType>
unsigned short GetNumChangesFromItemIndex(unsigned int itemIndex)
{
int virtualIndex = ItemIndexToVirtualIndex<stepType,compareType>(itemIndex);
return GetNumChangesFromVirtualIndex<stepType,compareType>(virtualIndex);
}
template<typename stepType, typename compareType>
unsigned int GetHardwareAddressFromItemIndex(unsigned int itemIndex)
{
MemoryRegion virtualRegion;
ItemIndexToVirtualRegion<stepType,compareType>(itemIndex, virtualRegion);
return virtualRegion.hardwareAddress;
}
// this one might be unreliable, haven't used it much
template<typename stepType, typename compareType>
unsigned int HardwareAddressToItemIndex(unsigned int hardwareAddress)
{
if(s_itemIndicesInvalid)
CalculateItemIndices(sizeof(stepType));
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); ++iter)
{
MemoryRegion& region = *iter;
if(hardwareAddress >= region.hardwareAddress && hardwareAddress < region.hardwareAddress + region.size)
{
int indexWithinRegion = (hardwareAddress - region.hardwareAddress) / sizeof(stepType);
return region.itemIndex + indexWithinRegion;
}
}
return -1;
}
// workaround for a parser error in MSVC that sometimes deletes a comma preceeding a macro
// this macro takes a type and a signed/unsigned modifier, and returns the same type with that modifier whether or not the compiler decides to delete the comma between them
template<typename T, typename ignored=void>
struct DummyType { typedef T t; };
#define COMMAHACK(sign, type) DummyType<sign type, sign>::t
#ifdef _MSC_VER
#pragma warning(disable : 4114) // disable "same modifier used twice" warning that otherwise would get issued when the compiler bug happens
#endif
// it's ugly but I can't think of a better way to call these functions that isn't also slower, since
// I need the current values of these arguments to determine which primitive types are used within the function
#define CALL_WITH_T_SIZE_TYPES(functionName, sizeTypeID, isSigned, requireAligned, ...) \
(sizeTypeID == 'b' \
? (isSigned \
? functionName<char, COMMAHACK(signed,char)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(unsigned,char)>(__VA_ARGS__)) \
: sizeTypeID == 'w' \
? (isSigned \
? (requireAligned \
? functionName<short, COMMAHACK(signed,short)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(signed,short)>(__VA_ARGS__)) \
: (requireAligned \
? functionName<short, COMMAHACK(unsigned,short)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(unsigned,short)>(__VA_ARGS__))) \
: sizeTypeID == 'd' \
? (isSigned \
? (requireAligned \
? functionName<short, COMMAHACK(signed,long)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(signed,long)>(__VA_ARGS__)) \
: (requireAligned \
? functionName<short, COMMAHACK(unsigned,long)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(unsigned,long)>(__VA_ARGS__))) \
: functionName<char, COMMAHACK(signed,char)>(__VA_ARGS__))
// version that takes a forced comparison type
#define CALL_WITH_T_STEP(functionName, sizeTypeID, sign,type, requireAligned, ...) \
(sizeTypeID == 'b' \
? functionName<char, COMMAHACK(sign,type)>(__VA_ARGS__) \
: sizeTypeID == 'w' \
? (requireAligned \
? functionName<short, COMMAHACK(sign,type)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(sign,type)>(__VA_ARGS__)) \
: sizeTypeID == 'd' \
? (requireAligned \
? functionName<short, COMMAHACK(sign,type)>(__VA_ARGS__) \
: functionName<char, COMMAHACK(sign,type)>(__VA_ARGS__)) \
: functionName<char, COMMAHACK(sign,type)>(__VA_ARGS__))
// basic comparison functions:
template <typename T> inline bool LessCmp (T x, T y, T i) { return x < y; }
template <typename T> inline bool MoreCmp (T x, T y, T i) { return x > y; }
template <typename T> inline bool LessEqualCmp (T x, T y, T i) { return x <= y; }
template <typename T> inline bool MoreEqualCmp (T x, T y, T i) { return x >= y; }
template <typename T> inline bool EqualCmp (T x, T y, T i) { return x == y; }
template <typename T> inline bool UnequalCmp (T x, T y, T i) { return x != y; }
template <typename T> inline bool DiffByCmp (T x, T y, T p) { return x - y == p || y - x == p; }
template <typename T> inline bool ModIsCmp (T x, T y, T p) { return p && x % p == y; }
// compare-to type functions:
template<typename stepType, typename T>
void SearchRelative (bool(*cmpFun)(T,T,T), T ignored, T param)
{
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); )
{
MemoryRegion& region = *iter;
int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
unsigned int start = region.virtualIndex + startSkipSize;
unsigned int end = region.virtualIndex + region.size;
for(unsigned int i = start, hwaddr = region.hardwareAddress; i < end; i += sizeof(stepType), hwaddr += sizeof(stepType))
if(!cmpFun(GetCurValueFromVirtualIndex<stepType,T>(i), GetPrevValueFromVirtualIndex<stepType,T>(i), param))
if(2 == DeactivateRegion(region, iter, hwaddr, sizeof(stepType)))
goto outerContinue;
++iter;
outerContinue:
continue;
}
}
template<typename stepType, typename T>
void SearchSpecific (bool(*cmpFun)(T,T,T), T value, T param)
{
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); )
{
MemoryRegion& region = *iter;
int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
unsigned int start = region.virtualIndex + startSkipSize;
unsigned int end = region.virtualIndex + region.size;
for(unsigned int i = start, hwaddr = region.hardwareAddress; i < end; i += sizeof(stepType), hwaddr += sizeof(stepType))
if(!cmpFun(GetCurValueFromVirtualIndex<stepType,T>(i), value, param))
if(2 == DeactivateRegion(region, iter, hwaddr, sizeof(stepType)))
goto outerContinue;
++iter;
outerContinue:
continue;
}
}
template<typename stepType, typename T>
void SearchAddress (bool(*cmpFun)(T,T,T), T address, T param)
{
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); )
{
MemoryRegion& region = *iter;
int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
unsigned int start = region.virtualIndex + startSkipSize;
unsigned int end = region.virtualIndex + region.size;
for(unsigned int i = start, hwaddr = region.hardwareAddress; i < end; i += sizeof(stepType), hwaddr += sizeof(stepType))
if(!cmpFun(hwaddr, address, param))
if(2 == DeactivateRegion(region, iter, hwaddr, sizeof(stepType)))
goto outerContinue;
++iter;
outerContinue:
continue;
}
}
template<typename stepType, typename T>
void SearchChanges (bool(*cmpFun)(T,T,T), T changes, T param)
{
for(MemoryList::iterator iter = s_activeMemoryRegions.begin(); iter != s_activeMemoryRegions.end(); )
{
MemoryRegion& region = *iter;
int startSkipSize = ((unsigned int)(sizeof(stepType) - region.hardwareAddress)) % sizeof(stepType);
unsigned int start = region.virtualIndex + startSkipSize;
unsigned int end = region.virtualIndex + region.size;
for(unsigned int i = start, hwaddr = region.hardwareAddress; i < end; i += sizeof(stepType), hwaddr += sizeof(stepType))
if(!cmpFun(GetNumChangesFromVirtualIndex<stepType,T>(i), changes, param))
if(2 == DeactivateRegion(region, iter, hwaddr, sizeof(stepType)))
goto outerContinue;
++iter;
outerContinue:
continue;
}
}
char rs_c='s';
char rs_o='=';
char rs_t='s';
int rs_param=0, rs_val=0, rs_val_valid=0;
char rs_type_size = 'b', rs_last_type_size = rs_type_size;
bool noMisalign = true, rs_last_no_misalign = noMisalign;
bool littleEndian = false;
int last_rs_possible = -1;
int last_rs_regions = -1;
void prune(char c,char o,char t,int v,int p)
{
// repetition-reducing macros
#define DO_SEARCH(sf) \
switch (o) \
{ \
case '<': DO_SEARCH_2(LessCmp,sf); break; \
case '>': DO_SEARCH_2(MoreCmp,sf); break; \
case '=': DO_SEARCH_2(EqualCmp,sf); break; \
case '!': DO_SEARCH_2(UnequalCmp,sf); break; \
case 'l': DO_SEARCH_2(LessEqualCmp,sf); break; \
case 'm': DO_SEARCH_2(MoreEqualCmp,sf); break; \
case 'd': DO_SEARCH_2(DiffByCmp,sf); break; \
case '%': DO_SEARCH_2(ModIsCmp,sf); break; \
default: assert(!"Invalid operator for this search type."); break; \
}
// perform the search, eliminating nonmatching values
switch (c)
{
#define DO_SEARCH_2(CmpFun,sf) CALL_WITH_T_SIZE_TYPES(sf, rs_type_size, t, noMisalign, CmpFun,v,p)
case 'r': DO_SEARCH(SearchRelative); break;
case 's': DO_SEARCH(SearchSpecific); break;
#undef DO_SEARCH_2
#define DO_SEARCH_2(CmpFun,sf) CALL_WITH_T_STEP(sf, rs_type_size, unsigned,int, noMisalign, CmpFun,v,p);
case 'a': DO_SEARCH(SearchAddress); break;
#undef DO_SEARCH_2
#define DO_SEARCH_2(CmpFun,sf) CALL_WITH_T_STEP(sf, rs_type_size, unsigned,short, noMisalign, CmpFun,v,p);
case 'n': DO_SEARCH(SearchChanges); break;
default: assert(!"Invalid search comparison type."); break;
}
s_prevValuesNeedUpdate = true;
int prevNumItems = last_rs_possible;
CompactAddrs();
if(prevNumItems == last_rs_possible)
{
SetRamSearchUndoType(RamSearchHWnd, 0); // nothing to undo
}
}
template<typename stepType, typename T>
bool CompareRelativeAtItem (bool(*cmpFun)(T,T,T), int itemIndex, T ignored, T param)
{
return cmpFun(GetCurValueFromItemIndex<stepType,T>(itemIndex), GetPrevValueFromItemIndex<stepType,T>(itemIndex), param);
}
template<typename stepType, typename T>
bool CompareSpecificAtItem (bool(*cmpFun)(T,T,T), int itemIndex, T value, T param)
{
return cmpFun(GetCurValueFromItemIndex<stepType,T>(itemIndex), value, param);
}
template<typename stepType, typename T>
bool CompareAddressAtItem (bool(*cmpFun)(T,T,T), int itemIndex, T address, T param)
{
return cmpFun(GetHardwareAddressFromItemIndex<stepType,T>(itemIndex), address, param);
}
template<typename stepType, typename T>
bool CompareChangesAtItem (bool(*cmpFun)(T,T,T), int itemIndex, T changes, T param)
{
return cmpFun(GetNumChangesFromItemIndex<stepType,T>(itemIndex), changes, param);
}
int ReadControlInt(int controlID, bool forceHex, BOOL& success)
{
int rv = 0;
BOOL ok = false;
if(!forceHex)
{
rv = GetDlgItemInt(RamSearchHWnd,controlID,&ok,(rs_t == 's'));
}
if(!ok)
{
if(GetDlgItemText(RamSearchHWnd,controlID,Str_Tmp,16))
{
for(int i = 0; Str_Tmp[i]; i++) {if(toupper(Str_Tmp[i]) == 'O') Str_Tmp[i] = '0';}
const char* strPtr = Str_Tmp;
bool negate = false;
while(strPtr[0] == '-')
strPtr++, negate = !negate;
if(strPtr[0] == '+')
strPtr++;
if(strPtr[0] == '0' && tolower(strPtr[1]) == 'x')
strPtr += 2, forceHex = true;
if(strPtr[0] == '$')
strPtr++, forceHex = true;
if(!forceHex)
{
const char* strSearchPtr = strPtr;
while(*strSearchPtr)
{
int c = tolower(*strSearchPtr++);
if(c >= 'a' && c <= 'f')
forceHex = true;
}
}
const char* formatString = forceHex ? "%X" : ((rs_t=='s') ? "%d" : "%u");
if(sscanf(strPtr, formatString, &rv) > 0)
ok = true;
if(negate)
rv = -rv;
}
}
success = ok;
return rv;
}
bool Set_RS_Val()
{
BOOL success;
// update rs_val
switch(rs_c)
{
case 'r':
default:
rs_val = 0;
break;
case 's':
rs_val = ReadControlInt(IDC_EDIT_COMPAREVALUE, rs_t == 'h', success);
if(!success)
return false;
if((rs_type_size == 'b' && rs_t == 's' && (rs_val < -128 || rs_val > 127)) ||
(rs_type_size == 'b' && rs_t != 's' && (rs_val < 0 || rs_val > 255)) ||
(rs_type_size == 'w' && rs_t == 's' && (rs_val < -32768 || rs_val > 32767)) ||
(rs_type_size == 'w' && rs_t != 's' && (rs_val < 0 || rs_val > 65535)))
return false;
break;
case 'a':
rs_val = ReadControlInt(IDC_EDIT_COMPAREADDRESS, true, success);
if(!success || rs_val < 0 || rs_val > 0x06040000)
return false;
break;
case 'n': {
rs_val = ReadControlInt(IDC_EDIT_COMPARECHANGES, false, success);
if(!success || rs_val < 0 || rs_val > 0xFFFF)
return false;
} break;
}
// also update rs_param
switch(rs_o)
{
default:
rs_param = 0;
break;
case 'd':
rs_param = ReadControlInt(IDC_EDIT_DIFFBY, false, success);
if(!success)
return false;
if(rs_param < 0)
rs_param = -rs_param;
break;
case '%':
rs_param = ReadControlInt(IDC_EDIT_MODBY, false, success);
if(!success || rs_param == 0)
return false;
break;
}
// validate that rs_param fits in the comparison data type
{
int appliedSize = rs_type_size;
int appliedSign = rs_t;
if(rs_c == 'n')
appliedSize = 'w', appliedSign = 'u';
if(rs_c == 'a')
appliedSize = 'd', appliedSign = 'u';
if((appliedSize == 'b' && appliedSize == 's' && (rs_param < -128 || rs_param > 127)) ||
(appliedSize == 'b' && appliedSize != 's' && (rs_param < 0 || rs_param > 255)) ||
(appliedSize == 'w' && appliedSize == 's' && (rs_param < -32768 || rs_param > 32767)) ||
(appliedSize == 'w' && appliedSize != 's' && (rs_param < 0 || rs_param > 65535)))
return false;
}
return true;
}
bool IsSatisfied(int itemIndex)
{
if(!rs_val_valid)
return true;
int o = rs_o;
switch (rs_c)
{
#undef DO_SEARCH_2
#define DO_SEARCH_2(CmpFun,sf) return CALL_WITH_T_SIZE_TYPES(sf, rs_type_size,(rs_t=='s'),noMisalign, CmpFun,itemIndex,rs_val,rs_param);
case 'r': DO_SEARCH(CompareRelativeAtItem); break;
case 's': DO_SEARCH(CompareSpecificAtItem); break;
#undef DO_SEARCH_2
#define DO_SEARCH_2(CmpFun,sf) return CALL_WITH_T_STEP(sf, rs_type_size, unsigned,int, noMisalign, CmpFun,itemIndex,rs_val,rs_param);
case 'a': DO_SEARCH(CompareAddressAtItem); break;
#undef DO_SEARCH_2
#define DO_SEARCH_2(CmpFun,sf) return CALL_WITH_T_STEP(sf, rs_type_size, unsigned,short, noMisalign, CmpFun,itemIndex,rs_val,rs_param);
case 'n': DO_SEARCH(CompareChangesAtItem); break;
}
return false;
}
// this is mainly for the RAM watch window
unsigned int ReadValueAtSoftwareAddress(const unsigned char* address, unsigned int size, int byteSwapped = false)
{
unsigned int value = 0;
if(!byteSwapped)
{
// convert to current endianness
for(unsigned int i = 0; i < size; i++)
{
value <<= 8;
value |= *address++;
}
}
else
{
// byte-swap and convert to current endianness at the same time
for(unsigned int i = 0; i < size; i++)
{
value <<= 8;
value |= *((unsigned char*)((intptr_t)address++^1));
}
}
return value;
}
void WriteValueAtSoftwareAddress(unsigned char* address, unsigned int value, unsigned int size, int byteSwapped = false)
{
if(!byteSwapped)
{
// write as big endian
for(int i = size-1; i >= 0; i--)
{
address[i] = value & 0xFF;
value >>= 8;
}
}
else
{
// byte-swap and write as big endian at the same time
for(int i = size-1; i >= 0; i--)
{
*((unsigned char*)((intptr_t)(address+i)^1)) = value & 0xFF;
value >>= 8;
}
}
}
inline bool IsInRange(unsigned int x, unsigned int min, unsigned int size)
{
x -= min;
return x < size;
}
unsigned int ReadValueAtHardwareAddress(unsigned int address, unsigned int size)
{
if((address & ~0xFFFFFF) == ~0xFFFFFF)
address &= 0xFFFFFF;
//char buf[4];
/* MMU_DumpMemBlock(0, address, 4, (u8*)buf);
u32 val_u32 = *(u32*)buf;
u16 val_u16 = *(u16*)buf;
u8 val_u8 = *(u8*)buf;*/
// switch (size)
// {
// case 1: return val_u8;
// case 2: return val_u16;
// case 4: return val_u32;
// }
// if(IsInRange(address, 0xFF0000, _68K_RAM_SIZE))
// return ReadValueAtSoftwareAddress(Ram_68k + address - 0xFF0000, size, true);
/* if(IsInRange(address, 0xFF0000, _68K_RAM_SIZE)) TODO
return ReadValueAtSoftwareAddress(Ram_68k + address - 0xFF0000, size, true);
if(IsInRange(address, 0xA00000, Z80_RAM_SIZE))
return ReadValueAtSoftwareAddress(Ram_Z80 + address - 0xA00000, size, true);
if(SegaCD_Started && IsInRange(address, 0x020000, SEGACD_RAM_PRG_SIZE))
return ReadValueAtSoftwareAddress(Ram_Prg + address - 0x020000, size, true);
if(SegaCD_Started && IsInRange(address, 0x200000, SEGACD_1M_RAM_SIZE))
return ReadValueAtSoftwareAddress(((Ram_Word_State & 0x2) ? Ram_Word_1M : Ram_Word_2M) + address - 0x200000, size, true);
if(IsInRange(address, 0x0, Rom_Size))
return ReadValueAtSoftwareAddress(Rom_Data + address, size, true);
if(_32X_Started && IsInRange(address, 0x06000000, _32X_RAM_SIZE))
return ReadValueAtSoftwareAddress(_32X_Ram + address - 0x06000000, size, false);*/
return 0;
}
bool WriteValueAtHardwareRAMAddress(unsigned int address, unsigned int value, unsigned int size, bool hookless)
{
if((address & ~0xFFFFFF) == ~0xFFFFFF)
address &= 0xFFFFFF;
/* if(IsInRange(address, 0xFF0000, _68K_RAM_SIZE)) TODO
WriteValueAtSoftwareAddress(Ram_68k + address - 0xFF0000, value, size, true);
else if(IsInRange(address, 0xA00000, Z80_RAM_SIZE))
WriteValueAtSoftwareAddress(Ram_Z80 + address - 0xA00000, value, size, true);
else if(SegaCD_Started && IsInRange(address, 0x020000, SEGACD_RAM_PRG_SIZE))
WriteValueAtSoftwareAddress(Ram_Prg + address - 0x020000, value, size, true);
else if(SegaCD_Started && IsInRange(address, 0x200000, SEGACD_1M_RAM_SIZE))
WriteValueAtSoftwareAddress(((Ram_Word_State & 0x2) ? Ram_Word_1M : Ram_Word_2M) + address - 0x200000, value, size, true);
else if(_32X_Started && IsInRange(address, 0x06000000, _32X_RAM_SIZE))
WriteValueAtSoftwareAddress(_32X_Ram + address - 0x06000000, value, size, false);*/
// else return false;
// if(!hookless) // a script that calls e.g. memory.writebyte() should trigger write hooks
// CallRegisteredLuaMemHook(address, size, value, LUAMEMHOOK_WRITE);
return true;
}
bool WriteValueAtHardwareROMAddress(unsigned int address, unsigned int value, unsigned int size)
{
if(IsInRange(address, 0x0, Rom_Size))
WriteValueAtSoftwareAddress(Rom_Data + address, value, size, true);
else return false;
return true;
}
bool WriteValueAtHardwareAddress(unsigned int address, unsigned int value, unsigned int size, bool hookless=false)
{
return WriteValueAtHardwareRAMAddress(address, value, size, hookless) ||
WriteValueAtHardwareROMAddress(address, value, size);
}
bool IsHardwareRAMAddressValid(unsigned int address)
{
if((address & ~0xFFFFFF) == ~0xFFFFFF)
address &= 0xFFFFFF;
// if(IsInRange(address, 0xFF0000, _68K_RAM_SIZE))
// return true;
// if(IsInRange(address, 0xA00000, Z80_RAM_SIZE))
// return true;
return true; //TODO
/* if(SegaCD_Started && IsInRange(address, 0x020000, SEGACD_RAM_PRG_SIZE)) TODO
return true;
if(SegaCD_Started && IsInRange(address, 0x200000, SEGACD_1M_RAM_SIZE))
return true;
if(_32X_Started && IsInRange(address, 0x06000000, _32X_RAM_SIZE))
return true;*/
return false;
}
bool IsHardwareROMAddressValid(unsigned int address)
{
return IsInRange(address, 0x0, Rom_Size);
}
bool IsHardwareAddressValid(unsigned int address)
{
return IsHardwareROMAddressValid(address) || IsHardwareRAMAddressValid(address);
}