diff --git a/CMakeLists.txt b/CMakeLists.txt
index e726bfbd..4a734e33 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -197,8 +197,11 @@ endif(ENABLE_FFMPEG)
SET(SRC_GBA
src/gba/agbprint.cpp
src/gba/bios.cpp
+ src/gba/BreakpointStructures.cpp
src/gba/Cheats.cpp
src/gba/CheatSearch.cpp
+ src/gba/debugger-expr-lex.cpp
+ src/gba/debugger-expr-yacc.cpp
src/gba/EEprom.cpp
src/gba/ereader.cpp
src/gba/Flash.cpp
@@ -243,7 +246,6 @@ SET(SRC_APU
)
SET(SRC_SDL
- src/sdl/debugger.cpp
src/sdl/SDL.cpp
src/sdl/filters.cpp
src/sdl/text.cpp
diff --git a/project/vc2008_mfc/VBA2008.vcproj b/project/vc2008_mfc/VBA2008.vcproj
index f7200b0d..69028815 100644
--- a/project/vc2008_mfc/VBA2008.vcproj
+++ b/project/vc2008_mfc/VBA2008.vcproj
@@ -446,6 +446,26 @@
RelativePath="..\..\src\gba\bios.h"
>
+
+
+
+
+
+
+
+
+
+
diff --git a/project/vs2010_mfc/VBA2010.vcxproj b/project/vs2010_mfc/VBA2010.vcxproj
index 16733b6b..e4afd7c7 100644
--- a/project/vs2010_mfc/VBA2010.vcxproj
+++ b/project/vs2010_mfc/VBA2010.vcxproj
@@ -110,7 +110,7 @@
AnySuitable
Speed
..\..\src;..\..\fex;..\..\..\dependencies\libpng;..\..\..\dependencies\msvc;..\..\..\dependencies\SFML\include;..\..\..\dependencies\SubWCRev;..\..\..\dependencies\zlib;%(AdditionalIncludeDirectories)
- WIN32;_WINDOWS;NO_OAL;NDEBUG;GBA_LOGGING;OEMRESOURCE;MMX;ASM;FINAL_VERSION;BKPT_SUPPORT;_CRT_SECURE_NO_DEPRECATE;HAS_FILE_EXTRACTOR;%(PreprocessorDefinitions)
+ WIN32;_WINDOWS;NDEBUG;GBA_LOGGING;OEMRESOURCE;MMX;ASM;FINAL_VERSION;BKPT_SUPPORT;_CRT_SECURE_NO_DEPRECATE;HAS_FILE_EXTRACTOR;%(PreprocessorDefinitions)
MultiThreaded
StreamingSIMDExtensions
Fast
@@ -167,7 +167,9 @@
+
+
@@ -295,6 +297,9 @@
+
+
+
diff --git a/project/vs2010_mfc/VBA2010.vcxproj.filters b/project/vs2010_mfc/VBA2010.vcxproj.filters
index 42e79aec..7c50887e 100644
--- a/project/vs2010_mfc/VBA2010.vcxproj.filters
+++ b/project/vs2010_mfc/VBA2010.vcxproj.filters
@@ -115,6 +115,12 @@
Core\GBA
+
+ Core\GBA
+
+
+ Core\GBA
+
Core\GBA
@@ -484,6 +490,15 @@
Core\GBA
+
+ Core\GBA
+
+
+ Core\GBA
+
+
+ Core\GBA
+
Core\GBA
diff --git a/project/vs2013_mfc/VBA2013.vcxproj b/project/vs2013_mfc/VBA2013.vcxproj
index fa2ffe80..f791178b 100644
--- a/project/vs2013_mfc/VBA2013.vcxproj
+++ b/project/vs2013_mfc/VBA2013.vcxproj
@@ -174,6 +174,8 @@
+
+
@@ -302,6 +304,9 @@
+
+
+
diff --git a/project/vs2013_mfc/VBA2013.vcxproj.filters b/project/vs2013_mfc/VBA2013.vcxproj.filters
index d4a40f95..9c9dab05 100644
--- a/project/vs2013_mfc/VBA2013.vcxproj.filters
+++ b/project/vs2013_mfc/VBA2013.vcxproj.filters
@@ -112,6 +112,12 @@
Core\GBA
+
+ Core\GBA
+
+
+ Core\GBA
+
Core\GBA
@@ -484,6 +490,15 @@
Core\GBA
+
+ Core\GBA
+
+
+ Core\GBA
+
+
+ Core\GBA
+
Core\GBA
diff --git a/src/gba/BreakpointStructures.cpp b/src/gba/BreakpointStructures.cpp
new file mode 100644
index 00000000..0b74c92d
--- /dev/null
+++ b/src/gba/BreakpointStructures.cpp
@@ -0,0 +1,856 @@
+/*New code made for the new breakpoint system.
+
+Each breakpoint is now marked by a halfword in an array on map,
+breakpoint array. Each bit means one different type of breakpoint.
+Bit Value
+0 - write
+1 - read
+2 - ARM
+3 - THUMB
+4 - Always on Write
+5 - Always on Read
+6 - Always on ARM
+7 - Always on THUMB
+
+Each flag is independant, and can be used as such, as well as together.
+You can define a break on access (0xf), break on IO (0x3), break on
+execution(0xc) or any other combination you need. 0xf0 will always break on
+any passage through the address
+
+This structure is accompanied by two other structures for the accesses.
+One of them is the Conditional structure. It's available for all types.
+
+The breaking address header is placed at ConditionalBreak. The type_flags
+indicate the type of break, in the format indicated above.
+Then, it links to the several conditions needed for the break to take place.
+
+Those conditions are then sequentially executed, and if all are true, the
+break takes place.
+They are composed of an address to test, a value to test against, the value's
+type, the flag conditons to test and a link to the next condition to test if
+that was true. Address and value are stored as Evaluatable expressions,
+according to the already defined eval from expr.c
+However, be reminded that sometimes registers and memory positions may contain
+values that are not addresses at some times. If such is the case, the program
+will show garbage results or crash.
+
+The flags are bit-based
+Bit Value
+0 - equal
+1 - greater
+2 - lesser
+3 - force Signed comparison
+
+Bit Value
+0,1 - addr is: 00 - byte, 01 - halfword, 10 - word, 11 - undefined, assume word
+2 - addr_is_signed
+3 - addr_is_array of values (not implemented yet)
+4,5 - 00 is byte, 01 is halfword, 10 is word, 11 undefined
+6 - val_is_signed
+7 - val_is_array (also not implemented)
+Usage:
+Instructions that accept this kind of implementation will follow this pattern
+if [<;>OR<||>OR<&&> [repeat]
+if indicates that the following there is a condition. no If counts as always break
+ is the first value expression, that unlike what the name implies, may be
+anything.
+ is one of the comparation Operands. Full list bellow
+ is the value to compare to.
+Following can be a ||(or), that adds a second, independant break condition, or
+a &&(and), that specifies that the next condition is a conjoined requisite to the break.
+EX: [0x03005000] == 0x77777777 && 0x50 == [0x03005000]
+ Would be impossible, but tested anyway, and make it never break due to this condition.
+ [0x03005000] == 0x77777777 || 0x50 == [0x03005000]
+ Would make it break when the contents of 0x03005000 were either 0x77777777 or 0x50
+
+Ex: to implement stop only when r2 is 0xf, use
+ if r2 == 0xf
+ to implement stop when PC is above 0x08005000 and 0x03005000 is signed halfword 0x2500
+ if pc > 0x08005000 && 0x03005000 == +0x2500
+*/
+
+/*
+Full Operands lists
+Op1, op2, ...,opN --> Meaning
+
+== , =, eq --> equal
+
+<, lt --> lesser than
+
+<=, le --> less or equal to
+
+> gt --> greater than
+
+>=, ge --> greater or equal to
+
+!=, <>, ne --> not equal to
+
+
+valid content types
+b, byte, u8 --> byte
+sb, sbyte, s8 --> signed byte
+h,hw, halfword, u16, ushort --> halfword
+sh, shw, shalfword, s16 short --> signed halfword
+w, word, u32 --> word
+sw, sword, s32, int --> signed word
+*/
+
+#include
+#include
+#include
+#include
+
+#include "BreakpointStructures.h"
+#include "remote.h"
+
+extern bool dexp_eval(char *, u32*);
+
+//struct intToString{
+// int value;
+// char mapping[20];
+//};
+
+struct ConditionalBreak* conditionals[16] = {0,0,0,0, 0,0,0,0, 0,0,0,0, 0,0,0,0};
+
+//struct intToString breakFlagMapping[] = {
+// {0x80,"Thumb"},
+// {0x40,"ARM"},
+// {0x20,"Read"},
+// {0x10,"Write"},
+// {0x8,"Thumb"},
+// {0x4,"ARM"},
+// {0x2,"Read"},
+// {0x1,"Write"},
+// {0x0,"None"}
+//};
+/*
+struct intToString compareFlagMapping[] = {
+ {0x7,"Always"},
+ {0x6,"!="},
+ {0x5,"<="},
+ {0x4,"<"},
+ {0x3,">="},
+ {0x2,">"},
+ {0x1,"=="},
+ {0x0,"Never"}
+};*/
+
+//char* typeMapping[] = {"'u8","'u16","'u32","'u32","'s8","'s16","'s32","'s32"};
+//
+//char* compareFlagMapping[] = {"Never","==",">",">=","<","<=","!=","<=>"};
+
+
+
+
+//Constructors
+ //case '*': flag = 0xf; break;
+ //case 't': flag = 0x8; break; // thumb
+ //case 'a': flag = 0x4; break; // arm
+ //case 'x': flag = 0xC; break;
+ //case 'r': flag = 0x2; break; // mem read
+ //case 'w': flag = 0x1; break; // mem write
+ //case 'i': flag = 0x3; break;
+struct ConditionalBreak* addConditionalBreak(u32 address, u8 flag){
+ u8 condIndex = address>>24;
+ struct ConditionalBreak* cond = NULL;
+ BreakSet((&map[condIndex])->breakPoints,address & (&map[condIndex])->mask,((flag&0xf)|(flag>>4)));
+ if(flag & 0xf0){
+ struct ConditionalBreak* base = conditionals[condIndex];
+ struct ConditionalBreak* prev = conditionals[condIndex];
+ if(conditionals[condIndex]){
+ while((base) && (address >= base->break_address)){
+ if(base->break_address == address){
+ if(base->type_flags & 0xf0){
+ base->type_flags |= (flag&0xf0);
+ flag &= 0xf;
+ cond = base;
+ goto addCB_nextHandle;
+ }else{
+ goto condCreateForFlagAlways;
+ }
+ }else{
+ prev = base;
+ base = base->next;
+ }
+ }
+ }
+condCreateForFlagAlways:
+ cond = (struct ConditionalBreak*)malloc(sizeof(struct ConditionalBreak));
+ cond->break_address = address;
+ cond->type_flags = flag&0xf0;
+ cond->next = base;
+ cond->firstCond = NULL;
+ if(prev == conditionals[condIndex])
+ conditionals[condIndex] = cond;
+ else
+ prev->next = cond;
+ }
+ flag &= 0xf;
+
+addCB_nextHandle:
+ if(flag == 0)
+ return cond;
+
+ cond = (struct ConditionalBreak*)malloc(sizeof(struct ConditionalBreak));
+ cond->break_address = address;
+ cond->type_flags = flag;
+ cond->next = NULL;
+ cond->firstCond = NULL;
+ if(conditionals[condIndex] == NULL){
+ conditionals[condIndex] = cond;
+ return cond;
+ }else{
+ struct ConditionalBreak *curr, *prev;
+ curr = conditionals[condIndex];
+ prev = conditionals[condIndex];
+ while(curr){
+ if(curr->break_address > address){
+ if(prev == curr){
+ conditionals[condIndex] = cond;
+ }else{
+ prev->next = cond;
+ }
+ cond->next = curr;
+ return cond;
+ }
+ prev = curr;
+ curr = prev->next;
+ }
+ prev->next = cond;
+ return cond;
+ }
+}
+
+
+void addCondition(struct ConditionalBreak* base, struct ConditionalBreakNode* toAdd){
+ if(base->firstCond){
+ struct ConditionalBreakNode* curr, *prev;
+ curr = base->firstCond;
+ prev = base->firstCond;
+ while(curr){
+ prev = curr;
+ curr = curr->next;
+ }
+ prev->next = toAdd;
+ }else{
+ base->firstCond = toAdd;
+ }
+}
+
+//destructors
+void freeConditionalBreak(struct ConditionalBreak* toFree){
+ struct ConditionalBreakNode* freeMe;
+ while(toFree->firstCond){
+ freeMe = toFree->firstCond;
+ toFree->firstCond = toFree->firstCond->next;
+ free(freeMe);
+ }
+ free(toFree);
+}
+
+void freeConditionalNode(struct ConditionalBreakNode* toDel){
+ if(toDel->next)
+ freeConditionalNode(toDel->next);
+ if(toDel->address)
+ free(toDel->address);
+ if(toDel->value)
+ free(toDel->value);
+ free(toDel);
+}
+
+void freeAllConditionals(){
+ for(int i = 0; i<16; i++){
+ while(conditionals[i]){
+ struct ConditionalBreak* tmp = conditionals[i];
+ conditionals[i] = conditionals[i]->next;
+ freeConditionalBreak(tmp);
+ }
+ }
+ }
+
+int removeConditionalBreak(struct ConditionalBreak* toDelete){
+ if(toDelete){
+ u8 condIndex = toDelete->break_address>>24;
+ struct ConditionalBreak* base = conditionals[condIndex];
+ struct ConditionalBreak* prev = conditionals[condIndex];
+ while(base){
+ if(base == toDelete){
+ if(base == prev){
+ conditionals[condIndex] = base->next;
+ }else{
+ prev->next = base->next;
+ }
+ freeConditionalBreak(toDelete);
+ return 0;
+ }
+ prev = base;
+ base = base->next;
+ }
+ return -1; //failed to remove
+ }
+ return -2; //delete failed because container was not there
+}
+
+/*
+int removeConditionalBreak(u32 address, u8 num, u8 flag){
+ u8 condIndex = address>>24;
+ struct ConditionalBreak* base = conditionals[condIndex];
+ struct ConditionalBreak* prev = conditionals[condIndex];
+ u8 counter = 0;
+ while(base){
+ if(base->break_address > address)
+ return -2; //failed to remove
+ if(base->break_address == address){
+ counter++;
+ }
+ if(counter == num){
+ base->type_flags &= ~flag;
+ if(base->type_flags == 0){
+ if(prev == base){
+ conditionals[condIndex] = base->next;
+ }else{
+ prev->next = base->next;
+ }
+ freeConditionalBreak(base);
+ return 0;
+ }
+ return 1;
+ }
+ prev = base;
+ base = base->next;
+ }
+ return -2;
+}
+
+bool removeCondition(struct ConditionalBreak* base, struct ConditionalBreakNode* toDel){
+ if(base->firstCond){
+ if(toDel == base->firstCond){
+ base->firstCond = toDel->next;
+ freeConditionalNode(toDel);
+ return true;
+ }
+ struct ConditionalBreakNode* curr, *prev;
+ curr = base->firstCond;
+ prev = base->firstCond;
+ while(curr){
+ if(curr == toDel){
+ prev->next = curr->next;
+ freeConditionalNode(toDel);
+ return true;
+ }
+ prev = curr;
+ curr = curr->next;
+ }
+ }
+ freeConditionalNode(toDel);
+ return false;
+}
+
+bool removeCondition(u32 address, u8 flags, u8 num){
+ struct ConditionalBreak* base = conditionals[address>>24];
+ while(base && base->break_address < address){
+ base = base->next;
+ }
+ if(base && base->break_address == address){
+ struct ConditionalBreakNode* curr = base->firstCond;
+ for(int i = 0; i < num; i++){
+ if(!curr && ((!base) || (!base->next))){
+ return false;
+ }if(!curr){
+ while(!curr){
+ base = base->next;
+ if(base->break_address > address)
+ return false;
+
+ curr = base->firstCond;
+ }
+ }
+ }
+ }
+}*/
+
+/*
+int removeAllConditions(u32 address, u8 flags){
+ struct ConditionalBreak* base = conditionals[address>>24];
+ while(base && base->break_address < address){
+ base = base->next;
+ }
+ struct ConditionalBreak* curr = base;
+ while(base && base->break_address == address){
+ base->type_flags &= ~flags;
+ if(!base->type_flags){
+ curr = base;
+ base = base->next;
+ removeCondition(base);
+ }
+ }
+ return true;
+}*/
+
+void recountFlagsForAddress(u32 address){
+ struct ConditionalBreak* base = conditionals[address>>24];
+ u8 flags = 0;
+ while(base){
+ if(base->break_address < address){
+ base = base->next;
+ }else{
+ if(base->break_address == address){
+ flags |= base->type_flags;
+ }else{
+ BreakClear((&map[address>>24])->breakPoints,address & (&map[address>>24])->mask,0xff);
+ BreakSet((&map[address>>24])->breakPoints,address & (&map[address>>24])->mask,((flags>>4) | (flags&0x8)));
+ return;
+ }
+ base = base->next;
+ }
+ }
+ BreakClear((&map[address>>24])->breakPoints,address & (&map[address>>24])->mask,0xff);
+ BreakSet((&map[address>>24])->breakPoints,address & (&map[address>>24])->mask,((flags>>4) | (flags&0x8)));
+}
+
+
+//Removers
+int removeConditionalBreakNo(u32 addrNo, u8 number){
+if(conditionals[addrNo>>24]){
+ struct ConditionalBreak* base = conditionals[addrNo>>24];
+ struct ConditionalBreak* curr = conditionals[addrNo>>24];
+ u8 count = 1;
+ while (curr->break_address < addrNo){
+ base = curr;
+ curr = curr->next;
+ }
+ if(curr->break_address == addrNo){
+ if(number == 1){
+ if(base == curr){
+ conditionals[addrNo>>24] = curr->next;
+ freeConditionalBreak(curr);
+ }else{
+ base->next = curr->next;
+ freeConditionalBreak(curr);
+ }
+ recountFlagsForAddress(addrNo);
+ return 0;
+ }else{
+ int count = 1;
+ while(curr && (curr->break_address == addrNo)){
+ if(count == number){
+ base->next = curr->next;
+ freeConditionalBreak(curr);
+ recountFlagsForAddress(addrNo);
+ return 1;
+ }
+ count++;
+ base = curr;
+ curr = curr->next;
+ }
+ return -1;
+ }
+ }
+ }
+ return -2;
+}
+
+int removeFlagFromConditionalBreakNo(u32 addrNo, u8 number, u8 flag){
+ if(conditionals[addrNo>>24]){
+ struct ConditionalBreak* base = conditionals[addrNo>>24];
+ struct ConditionalBreak* curr = conditionals[addrNo>>24];
+ u8 count = 1;
+ while (curr->break_address < addrNo){
+ base = curr;
+ curr = curr->next;
+ }
+ if(curr->break_address == addrNo){
+ if(number == 1){
+ curr->type_flags &= ~flag;
+ if(curr->type_flags == 0){
+ if(base == curr){
+ conditionals[addrNo>>24] = curr->next;
+ freeConditionalBreak(curr);
+ }else{
+ base->next = curr->next;
+ freeConditionalBreak(curr);
+ }
+ }
+ recountFlagsForAddress(addrNo);
+ return 0;
+ }else{
+ int count = 1;
+ while(curr && (curr->break_address == addrNo)){
+ if(count == number){
+ curr->type_flags &= ~flag;
+ if(!curr->type_flags){
+ base->next = curr->next;
+ freeConditionalBreak(curr);
+ recountFlagsForAddress(addrNo);
+ return 1;
+ }
+ recountFlagsForAddress(addrNo);
+ return 0;
+ }
+ count++;
+ base = curr;
+ curr = curr->next;
+ }
+ return -1;
+ }
+ }
+ }
+ return -2;
+}
+
+int removeConditionalWithAddress(u32 address){
+ u8 addrNo = address>>24;
+ if(conditionals[addrNo] != NULL){
+ struct ConditionalBreak* base = conditionals[addrNo];
+ struct ConditionalBreak* curr = conditionals[addrNo];
+ u8 count = 0;
+ u8 flags = 0;
+ while(curr && address >= curr->break_address){
+ if(curr->break_address == address){
+ base->next = curr->next;
+ flags |= curr->type_flags;
+ freeConditionalBreak(curr);
+ curr = base->next;
+ count++;
+ }else{
+ base = curr;
+ curr = curr->next;
+ }
+ }
+ BreakClear((&map[address>>24])->breakPoints,address & (&map[address>>24])->mask,((flags&0xf)|(flags>>4)));
+ return count;
+ }
+ return -2;
+}
+
+int removeConditionalWithFlag(u8 flag, bool orMode){
+ for(u8 addrNo = 0; addrNo < 16;addrNo++){
+ if(conditionals[addrNo] != NULL){
+ struct ConditionalBreak* base = conditionals[addrNo];
+ struct ConditionalBreak* curr = conditionals[addrNo];
+ u8 count = 0;
+ while(curr){
+ if(((curr->type_flags & flag) == curr->type_flags) || (orMode && (curr->type_flags & flag))){
+ curr->type_flags &= ~flag;
+ BreakClear((&map[addrNo])->breakPoints,curr->break_address & (&map[addrNo])->mask,((flag&0xf)|(flag>>4)));
+ if(curr->type_flags == 0){
+ if(base == conditionals[addrNo]){
+ conditionals[addrNo]= curr->next;
+ base = curr->next;
+ curr = base;
+ }
+ else{
+ base->next = curr->next;
+ freeConditionalBreak(curr);
+ curr = base->next;
+ }
+ count++;
+ }else{
+ base = curr;
+ curr = curr->next;
+ }
+ }else{
+ base = curr;
+ curr = curr->next;
+ }
+ }
+ return count;
+ }
+ }
+ return -2;
+}
+
+int removeConditionalWithAddressAndFlag(u32 address, u8 flag, bool orMode){
+ u8 addrNo = address>>24;
+ if(conditionals[addrNo] != NULL){
+ struct ConditionalBreak* base = conditionals[addrNo];
+ struct ConditionalBreak* curr = conditionals[addrNo];
+ u8 count = 0;
+ while(curr && address >= curr->break_address){
+ if((curr->break_address == address) &&
+ (((curr->type_flags & flag) == curr->type_flags) || (orMode && (curr->type_flags & flag)))){
+ curr->type_flags &= ~flag;
+ BreakClear((&map[address>>24])->breakPoints,curr->break_address & (&map[address>>24])->mask,((flag&0xf)|(flag>>4)));
+ if(curr->type_flags == 0){
+ if(curr == conditionals[addrNo]){
+ conditionals[addrNo] = curr->next;
+ freeConditionalBreak(curr);
+ curr = conditionals[addrNo];
+ }
+ else{
+ base->next = curr->next;
+ freeConditionalBreak(curr);
+ curr = base->next;
+ }
+ count++;
+ }else{
+ base = curr;
+ curr = curr->next;
+ }
+ }else{
+ base = curr;
+ curr = curr->next;
+ }
+ }
+ return count;
+ }
+ return -2;
+}
+
+
+
+//true creating code for a given expression.
+//It assumes an if was found, and that all up to the if was removed.
+//receives an array of chars following the pattern:
+//{',,,',,, (repeats)
+//next = 0;
+ now->exp_type_flags = 0;
+ if(exp[i][0] == '\''){
+ now->exp_type_flags |= parseExpressionType(&exp[i][1]);
+ i++;
+ if(i >= n) goto fail;
+ }else{
+ now->exp_type_flags |= 6; //assume signed word
+ }
+ now->address = strdup(exp[i]);
+ i++;
+ if(i >= n) goto fail;
+ char* operandName = exp[i];
+ now->cond_flags = parseConditionOperand(exp[i]);
+ i++;
+ if(i >= n) goto fail;
+
+ if(exp[i][0] == '\''){
+ now->exp_type_flags |= (parseExpressionType(&exp[i][1])<<4);
+ i++;
+ if(i >= n) goto fail;
+ }else{
+ now->exp_type_flags |= 0x60; //assume signed word
+ }
+ now->value = strdup(exp[i]);
+ i++;
+ u32 val;
+ if(!dexp_eval(now->value, &val) || !dexp_eval(now->address, &val)){
+ printf("Invalid expression.\n");
+ if(workBreak)
+ removeConditionalBreak(workBreak);
+ return;
+ }
+ if(i < n){
+ if(strcmp(exp[i], "&&") == 0){
+ now = (struct ConditionalBreakNode*)malloc(sizeof(struct ConditionalBreakNode));
+ toAdd->next = now;
+ }else if (strcmp(exp[i], "||") == 0){
+ addCondition(workBreak,toAdd);
+ printf("Added break on address %08x, with condition:\n%s %s %s\n", address, now->address, operandName,now->value);
+ workBreak = addConditionalBreak(address, flags);
+ now = (struct ConditionalBreakNode*)malloc(sizeof(struct ConditionalBreakNode));
+ toAdd = now;
+ }
+ }else{
+ addCondition(workBreak,toAdd);
+ printf("Added break on address %08x, ending with condition: \n%s %s %s\n", address, now->address, operandName,now->value);
+ return;
+ }
+ }
+ return;
+
+ fail:
+ printf("Not enough material (expressions) to work with.");
+ removeConditionalBreak(workBreak);
+ return;
+}
+
+//aux
+u8 parseExpressionType(char* given_type){
+ u8 flags = 0;
+ //for such a small string, pays off to convert first
+ char* type = strdup(given_type);
+ for(int i = 0; type[i] != '\0'; i++){
+ type[i] = toupper(type[i]);
+ }
+ if((type[0] == 'S') || type[0] == 'U'){
+ flags |= (4 - ((type[0]-'S')<<1));
+ type++;
+ if(type[0] == 'H'){
+ type[0] = '1';
+ type[1] = '6';
+ type[2] = '\0';
+ }else if(type[0] == 'W'){
+ type[0] = '3';
+ type[1] = '2';
+ type[2] = '\0';
+ }else if(type[0] == 'B'){
+ type[0] = '8';
+ type[1] = '\0';
+ }
+ int size;
+ sscanf(type, "%d",&size);
+ size = (size>>3) - 1;
+ flags |= (size >= 2 ? 2: ((u8)size));
+ free(type);
+ return flags;
+ }
+ if(strcmp(type, "INT")==0){
+ flags = 6;
+ }
+ if(type[0] == 'H'){
+ flags = 1;
+ }else if(type[0] == 'W'){
+ flags = 2;
+ }else if(type[0] == 'B'){
+ flags = 0;
+ }else{
+ flags = 6;
+ }
+ free(type);
+ return flags;
+}
+
+u8 parseConditionOperand(char* type){
+ u8 flag = 0;
+ if(toupper(type[0]) == 'S'){
+ flag = 8;
+ type++;
+ }
+ switch(type[0]){
+ case '!': if(type[1] == '=' || type[1] == '\0')
+ return flag | 0x6;
+ break;
+ case '=': if(type[1] == '=' || type[1] == '\0')
+ return flag | 0x1;
+ break;
+ case '<': if(type[1] == '>')
+ return flag | 0x6;
+ if(type[1] == '=')
+ return flag | 0x5;
+ if(type[1] == '\0')
+ return flag | 0x4;
+ break;
+ case '>': if(type[1] == '<')
+ return flag | 0x6;
+ if(type[1] == '=')
+ return flag | 0x3;
+ if(type[1] == '\0')
+ return flag | 0x2;
+ break;
+ default: ;
+ }
+ switch(tolower(type[0])){
+ case 'l': if(tolower(type[1]) == 'e')
+ return flag | 0x5;
+ if(tolower(type[1]) == 't')
+ return flag | 0x4;
+ break;
+ case 'g': if(tolower(type[1]) == 'e')
+ return flag | 0x3;
+ if(tolower(type[1]) == 't')
+ return flag | 0x2;
+
+ case 'e': if(tolower(type[1]) == 'q')
+ return flag | 0x1;
+ if(type[1] == '\0')
+ return flag | 0x1;
+ case 'n': if(tolower(type[1]) == 'e')
+ return flag | 0x6;
+ default:;
+ }
+ return flag;
+}
+
+u32 calculateFinalValue(char* expToEval, u8 type_of_flags){
+ u32 val;
+ if(!dexp_eval(expToEval, &val)){
+ printf("Invalid expression.\n");
+ return 0;
+ }
+ if(type_of_flags&0x4){
+ switch(type_of_flags&0x3){
+ case 0: return (s8)(val&0xff);
+ case 1: return (s16)(val&0xffff);
+ default: return (int)val;
+ }
+ }else{
+ switch(type_of_flags&0x3){
+ case 0: return (u8)(val&0xff);
+ case 1: return (u16)(val&0xffff);
+ default: return val;
+ }
+ }
+}
+
+//check for execution
+bool isCorrectBreak(struct ConditionalBreak* toTest, u8 accessType){
+
+ return (toTest->type_flags & accessType);
+}
+
+
+bool doBreak(struct ConditionalBreak* toTest){
+ struct ConditionalBreakNode* toExamine = toTest->firstCond;
+
+ bool globalVeredict = true;
+ bool veredict = false;
+ while(toExamine && globalVeredict){
+ u32 address = calculateFinalValue(toExamine->address, toExamine->exp_type_flags&0xf);
+ u32 value = calculateFinalValue(toExamine->value, toExamine->exp_type_flags>>4);
+ if((toExamine->cond_flags &0x7) != 0){
+ veredict = veredict || ((toExamine->cond_flags&1)? (address == value):false);
+ veredict = veredict || ((toExamine->cond_flags&4)? ((toExamine->cond_flags&8)? ((int)address < (int)value) : (address < value)) : false);
+ veredict = veredict || ((toExamine->cond_flags&2)? ((toExamine->cond_flags&8)? ((int)address > (int)value) : (address > value)) : false);
+ }
+ toExamine = toExamine->next;
+ globalVeredict = veredict && globalVeredict;
+
+ }
+ return globalVeredict;
+}
+
+bool doesBreak(u32 address, u8 allowedFlags){
+ u8 addrNo = address>>24;
+ if(conditionals[addrNo]){
+ struct ConditionalBreak* base = conditionals[addrNo];
+ while(base && base->break_address < address){
+ base = base->next;
+ }
+ while(base && base->break_address == address){
+ if(base->type_flags & allowedFlags &0xf0){
+ return true;
+ }
+ if(isCorrectBreak(base,allowedFlags) && doBreak(base)){
+ return true;
+ }
+ base = base->next;
+ }
+ }
+ return false;
+}
+
+/*
+//Test main
+int main (int argc, char** args){
+ char* argv[] = {"r7","s==","0", "||","'byte","0x25","ge","'hword","0x0001"};
+ parseAndCreateConditionalBreaks(0x0203fd00, 0x1f, argv, 9);
+ parseAndCreateConditionalBreaks(0x0203fd00, 0x10, argv, 9);
+ parseAndCreateConditionalBreaks(0x0203fd00, 0x40, argv, 9);
+ parseAndCreateConditionalBreaks(0x0203fd04, 0x04, argv, 9);
+ printAllFlagConditionals(0xff, true);
+ removeFlagFromConditionalBreakNo(0x0203fd00, 0x3,0xff);
+ printf("after\n");
+ printAllFlagConditionals(0xff, true);
+
+ getchar();
+}
+*/
diff --git a/src/gba/BreakpointStructures.h b/src/gba/BreakpointStructures.h
new file mode 100644
index 00000000..32203ace
--- /dev/null
+++ b/src/gba/BreakpointStructures.h
@@ -0,0 +1,73 @@
+#ifndef VBA_BKS_H
+#define VBA_BKS_H
+
+#include "../common/Types.h"
+
+#define readWord(addr) \
+ ((map[(addr)>>24].address[(addr) & map[(addr)>>24].mask])+\
+ ((map[(addr+1)>>24].address[(addr+1) & map[(addr+1)>>24].mask])<<8)+\
+ ((map[(addr+2)>>24].address[(addr+2) & map[(addr+2)>>24].mask])<<16)+\
+ ((map[(addr+3)>>24].address[(addr+3) & map[(addr+3)>>24].mask])<<24))
+
+#define readHalfWord(addr) \
+ ((&map[(addr)>>24].address[(addr) & map[(addr)>>24].mask])+\
+ ((&map[(addr+1)>>24].address[(addr+1) & map[(addr+1)>>24].mask])<<8))
+
+#define readByte(addr) \
+ map[(addr)>>24].address[(addr) & map[(addr)>>24].mask]
+
+
+struct ConditionalBreakNode{
+ char* address;
+ char* value;
+ u8 cond_flags;
+ u8 exp_type_flags;
+ struct ConditionalBreakNode* next;
+};
+
+struct ConditionalBreak{
+ u32 break_address;
+ u8 type_flags;
+ struct ConditionalBreakNode* firstCond;
+ struct ConditionalBreak* next;
+};
+
+extern struct ConditionalBreak* conditionals[16];
+
+//conditional break manipulators
+//case '*': flag = 0xf; break;
+//case 't': flag = 0x8; break; // thumb
+//case 'a': flag = 0x4; break; // arm
+//case 'x': flag = 0xC; break;
+//case 'r': flag = 0x2; break; // mem read
+//case 'w': flag = 0x1; break; // mem write
+//case 'i': flag = 0x3; break;
+struct ConditionalBreak* addConditionalBreak(u32 address, u8 flag);
+
+int removeConditionalBreakNo(u32 address, u8 number);
+int removeFlagFromConditionalBreakNo(u32 address, u8 number, u8 flag);
+int removeConditionalWithAddress(u32 address);
+int removeConditionalWithFlag(u8 flag, bool orMode);
+int removeConditionalWithAddressAndFlag(u32 address, u8 flag, bool orMode);
+//void freeConditionalBreak(struct ConditionalBreak* toFree);
+
+void addCondition(struct ConditionalBreak* base, struct ConditionalBreakNode* toAdd);
+//bool removeCondition(struct ConditionalBreak* base, struct ConditionalBreakNode* toDel);
+//bool removeCondition(u32 address, u8 flags, u8 num);
+
+void freeConditionalNode(struct ConditionalBreakNode* toDel);
+
+
+void parseAndCreateConditionalBreaks(u32 address, u8 flags, char** exp, int n);
+
+bool isCorrectBreak(struct ConditionalBreak* toTest, u8 accessType);
+bool doesBreak(u32 address, u8 allowedFlags);
+bool doBreak(struct ConditionalBreak* toTest);
+
+//printing the structure(AKA list Breaks)
+//void printConditionalBreak(struct ConditionalBreak* toPrint, bool printAddress);
+//void printAllConditionals();
+//u8 printConditionalsFromAddress(u32 address);
+//void printAllFlagConditionals(u8 flag, bool orMode);
+//void printAllFlagConditionalsWithAddress(u32 address, u8 flag, bool orMode);
+#endif
\ No newline at end of file
diff --git a/src/gba/Cheats.cpp b/src/gba/Cheats.cpp
index 0288800b..834d279c 100644
--- a/src/gba/Cheats.cpp
+++ b/src/gba/Cheats.cpp
@@ -2846,7 +2846,6 @@ static u8 cheatsGetType(u32 address)
void cheatsWriteMemory(u32 address, u32 value)
{
#ifdef BKPT_SUPPORT
-#ifdef SDL
if(cheatsNumber == 0) {
int type = cheatsGetType(address);
u32 oldValue = debuggerReadMemory(address);
@@ -2857,13 +2856,11 @@ void cheatsWriteMemory(u32 address, u32 value)
debuggerWriteMemory(address, value);
}
#endif
-#endif
}
void cheatsWriteHalfWord(u32 address, u16 value)
{
#ifdef BKPT_SUPPORT
-#ifdef SDL
if(cheatsNumber == 0) {
int type = cheatsGetType(address);
u16 oldValue = debuggerReadHalfWord(address);
@@ -2874,17 +2871,11 @@ void cheatsWriteHalfWord(u32 address, u16 value)
debuggerWriteHalfWord(address, value);
}
#endif
-#endif
}
-#if defined BKPT_SUPPORT && defined SDL
void cheatsWriteByte(u32 address, u8 value)
-#else
-void cheatsWriteByte(u32, u8)
-#endif
{
#ifdef BKPT_SUPPORT
-#ifdef SDL
if(cheatsNumber == 0) {
int type = cheatsGetType(address);
u8 oldValue = debuggerReadByte(address);
@@ -2895,6 +2886,5 @@ void cheatsWriteByte(u32, u8)
debuggerWriteByte(address, value);
}
#endif
-#endif
}
#endif
diff --git a/src/gba/GBA-arm.cpp b/src/gba/GBA-arm.cpp
index 732f4474..b0633ca7 100644
--- a/src/gba/GBA-arm.cpp
+++ b/src/gba/GBA-arm.cpp
@@ -19,6 +19,8 @@
#include "../Util.h"
#include "../System.h"
#include "agbprint.h"
+#include "remote.h"
+
#ifdef PROFILING
#include "prof/prof.h"
#endif
@@ -2890,8 +2892,20 @@ int armExecute()
#endif
armNextPC = reg[15].I;
- reg[15].I += 4;
- ARM_PREFETCH_NEXT;
+ reg[15].I += 4;
+ ARM_PREFETCH_NEXT;
+
+#ifdef BKPT_SUPPORT
+ u32 memAddr = armNextPC;
+ memoryMap *m = &map[memAddr >> 24];
+ if (m->breakPoints && BreakARMCheck(m->breakPoints, memAddr & m->mask)) {
+ if (debuggerBreakOnExecution(memAddr, armState)){
+ // Revert tickcount?
+ debugger = true;
+ return 0;
+ }
+ }
+#endif
int cond = opcode >> 28;
bool cond_res = true;
@@ -2955,13 +2969,50 @@ int armExecute()
#ifdef INSN_COUNTER
count(opcode, cond_res);
#endif
+
+#ifdef BKPT_SUPPORT
+ if (enableRegBreak){
+ if (lowRegBreakCounter[0])
+ breakReg_check(0);
+ if (lowRegBreakCounter[1])
+ breakReg_check(1);
+ if (lowRegBreakCounter[2])
+ breakReg_check(2);
+ if (lowRegBreakCounter[3])
+ breakReg_check(3);
+ if (medRegBreakCounter[0])
+ breakReg_check(4);
+ if (medRegBreakCounter[1])
+ breakReg_check(5);
+ if (medRegBreakCounter[2])
+ breakReg_check(6);
+ if (medRegBreakCounter[3])
+ breakReg_check(7);
+ if (highRegBreakCounter[0])
+ breakReg_check(8);
+ if (highRegBreakCounter[1])
+ breakReg_check(9);
+ if (highRegBreakCounter[2])
+ breakReg_check(10);
+ if (highRegBreakCounter[3])
+ breakReg_check(11);
+ if (statusRegBreakCounter[0])
+ breakReg_check(12);
+ if (statusRegBreakCounter[1])
+ breakReg_check(13);
+ if (statusRegBreakCounter[2])
+ breakReg_check(14);
+ if (statusRegBreakCounter[3])
+ breakReg_check(15);
+ }
+#endif
if (clockTicks < 0)
return 0;
if (clockTicks == 0)
clockTicks = 1 + codeTicksAccessSeq32(oldArmNextPC);
cpuTotalTicks += clockTicks;
- } while (cpuTotalTicks> 24];
+ if (m->breakPoints && BreakThumbCheck(m->breakPoints, memAddr & m->mask)) {
+ if (debuggerBreakOnExecution(memAddr, armState)){
+ // Revert tickcount?
+ debugger = true;
+ return 0 ;
+ }
+ }
+#endif
+
(*thumbInsnTable[opcode>>6])(opcode);
+
+#ifdef BKPT_SUPPORT
+ if (enableRegBreak){
+ if (lowRegBreakCounter[0])
+ breakReg_check(0);
+ if (lowRegBreakCounter[1])
+ breakReg_check(1);
+ if (lowRegBreakCounter[2])
+ breakReg_check(2);
+ if (lowRegBreakCounter[3])
+ breakReg_check(3);
+ if (medRegBreakCounter[0])
+ breakReg_check(4);
+ if (medRegBreakCounter[1])
+ breakReg_check(5);
+ if (medRegBreakCounter[2])
+ breakReg_check(6);
+ if (medRegBreakCounter[3])
+ breakReg_check(7);
+ if (highRegBreakCounter[0])
+ breakReg_check(8);
+ if (highRegBreakCounter[1])
+ breakReg_check(9);
+ if (highRegBreakCounter[2])
+ breakReg_check(10);
+ if (highRegBreakCounter[3])
+ breakReg_check(11);
+ if (statusRegBreakCounter[0])
+ breakReg_check(12);
+ if (statusRegBreakCounter[1])
+ breakReg_check(13);
+ if (statusRegBreakCounter[2])
+ breakReg_check(14);
+ if (statusRegBreakCounter[3])
+ breakReg_check(15);
+ }
+#endif
+
if (clockTicks < 0)
return 0;
if (clockTicks==0)
clockTicks = codeTicksAccessSeq16(oldArmNextPC) + 1;
cpuTotalTicks += clockTicks;
- } while (cpuTotalTicks < cpuNextEvent && !armState && !holdState && !SWITicks);
+ } while (cpuTotalTicks < cpuNextEvent && !armState && !holdState && !SWITicks && !debugger);
return 1;
}
diff --git a/src/gba/GBA.cpp b/src/gba/GBA.cpp
index 6009dbbf..775e87c8 100644
--- a/src/gba/GBA.cpp
+++ b/src/gba/GBA.cpp
@@ -32,6 +32,7 @@
#endif
extern int emulating;
+bool debugger;
int SWITicks = 0;
int IRQTicks = 0;
@@ -1600,6 +1601,40 @@ int CPULoadRom(const char *szFile)
CPUUpdateRenderBuffers(true);
+#ifdef BKPT_SUPPORT
+ map[0].size = 0x4000;
+ map[1].size = 0x0;
+ map[2].size = 0x40000;
+ map[3].size = 0x8000;
+ map[4].size = 0x400;
+ map[5].size = 0x400;
+ map[6].size = 0x18000;
+ map[7].size = 0x400;
+ map[8].size = 0x01000000;
+ map[9].size = 0x01000000;
+ map[14].size = 0x10000;
+
+ for (int i = 0; i < 16; i++) {
+ if (map[i].size > 0) {
+ map[i].trace = (u8 *)calloc(map[i].size >> 3, sizeof(u8));
+
+ map[i].breakPoints = (u8 *)calloc(map[i].size >> 1, sizeof(u8)); //\\
+
+ if (map[i].trace == NULL || map[i].breakPoints == NULL) {
+ systemMessage(MSG_OUT_OF_MEMORY, N_("Failed to allocate memory for %s"),
+ "TRACE");
+ }
+ }
+ else {
+ map[i].trace = NULL;
+ map[i].breakPoints = NULL; //\\
+
+ }
+ }
+ clearBreakRegList();
+
+#endif
+
return romSize;
}
@@ -3644,6 +3679,7 @@ void CPULoop(int ticks)
{
int clockTicks;
int timerOverflow = 0;
+ u32 memAddr = 0;
// variable used by the CPU core
cpuTotalTicks = 0;
@@ -3690,10 +3726,14 @@ void CPULoop(int ticks)
armOpcodeCount++;
if (!armExecute())
return;
+ if (debugger)
+ return;
} else {
thumbOpcodeCount++;
if (!thumbExecute())
return;
+ if (debugger)
+ return;
}
clockTicks = 0;
} else
diff --git a/src/gba/GBA.h b/src/gba/GBA.h
index 5feca67c..5a94c757 100644
--- a/src/gba/GBA.h
+++ b/src/gba/GBA.h
@@ -18,6 +18,12 @@
typedef struct {
u8 *address;
u32 mask;
+#ifdef BKPT_SUPPORT
+ u8 *breakPoints;
+ u8 *searchMatch;
+ u8* trace;
+ u32 size;
+#endif
} memoryMap;
typedef union {
@@ -54,16 +60,8 @@ typedef union {
extern memoryMap map[256];
#endif
-extern reg_pair reg[45];
extern u8 biosProtected[4];
-extern bool N_FLAG;
-extern bool Z_FLAG;
-extern bool C_FLAG;
-extern bool V_FLAG;
-extern bool armIrqEnable;
-extern bool armState;
-extern int armMode;
extern void (*cpuSaveGameFunc)(u32,u8);
#ifdef BKPT_SUPPORT
@@ -75,6 +73,7 @@ extern u8 freezePRAM[0x400];
extern bool debugger_last;
extern int oldreg[18];
extern char oldbuffer[10];
+extern bool debugger;
#endif
extern bool CPUReadGSASnapshot(const char *);
diff --git a/src/gba/GBAinline.h b/src/gba/GBAinline.h
index 5fc97928..5bfced85 100644
--- a/src/gba/GBAinline.h
+++ b/src/gba/GBAinline.h
@@ -8,6 +8,7 @@
#include "agbprint.h"
#include "GBAcpu.h"
#include "GBALink.h"
+#include "remote.h"
extern const u32 objTilesAddress[3];
@@ -44,8 +45,18 @@ extern int cpuTotalTicks;
#define CPUReadMemoryQuick(addr) \
READ32LE(((u32*)&map[(addr)>>24].address[(addr) & map[(addr)>>24].mask]))
+extern u32 myROM[];
+
static inline u32 CPUReadMemory(u32 address)
{
+#ifdef BKPT_SUPPORT
+ memoryMap *m = &map[address >> 24];
+ if (m->breakPoints && BreakReadCheck(m->breakPoints, address & m->mask)) {
+ if (debuggerBreakOnRead(address, 2)){
+ //CPU_BREAK_LOOP_2;
+ }
+ }
+#endif
u32 value;
u32 oldAddress = address;
@@ -184,10 +195,17 @@ unreadable:
return value;
}
-extern u32 myROM[];
-
static inline u32 CPUReadHalfWord(u32 address)
{
+#ifdef BKPT_SUPPORT
+ memoryMap *m = &map[address >> 24];
+ if (m->breakPoints && BreakReadCheck(m->breakPoints, address & m->mask)) {
+ if (debuggerBreakOnRead(address, 1)){
+ //CPU_BREAK_LOOP_2;
+ }
+ }
+#endif
+
u32 value;
u32 oldAddress = address;
@@ -334,6 +352,15 @@ static inline s16 CPUReadHalfWordSigned(u32 address)
static inline u8 CPUReadByte(u32 address)
{
+#ifdef BKPT_SUPPORT
+ memoryMap *m = &map[address >> 24];
+ if (m->breakPoints && BreakReadCheck(m->breakPoints, address & m->mask)) {
+ if (debuggerBreakOnRead(address, 0)){
+ //CPU_BREAK_LOOP_2;
+ }
+ }
+#endif
+
switch(address >> 24) {
case 0:
if (reg[15].I >> 24) {
@@ -428,6 +455,15 @@ static inline void CPUWriteMemory(u32 address, u32 value)
}
#endif
+#ifdef BKPT_SUPPORT
+ memoryMap *m = &map[address >> 24];
+ if (m->breakPoints && BreakWriteCheck(m->breakPoints, address & m->mask)) {
+ if (debuggerBreakOnWrite(address, value, 1)){
+ //CPU_BREAK_LOOP_2;
+ }
+ }
+#endif
+
address &= 0xFFFFFFFC;
switch(address >> 24) {
@@ -528,6 +564,15 @@ static inline void CPUWriteHalfWord(u32 address, u16 value)
}
#endif
+#ifdef BKPT_SUPPORT
+ memoryMap *m = &map[address >> 24];
+ if (m->breakPoints && BreakWriteCheck(m->breakPoints, address & m->mask)) {
+ if (debuggerBreakOnWrite(address, value, 1)){
+ //CPU_BREAK_LOOP_2;
+ }
+ }
+#endif
+
address &= 0xFFFFFFFE;
switch(address >> 24) {
@@ -622,6 +667,15 @@ unwritable:
static inline void CPUWriteByte(u32 address, u8 b)
{
+#ifdef BKPT_SUPPORT
+ memoryMap *m = &map[address >> 24];
+ if (m->breakPoints && BreakWriteCheck(m->breakPoints, address & m->mask)) {
+ if (debuggerBreakOnWrite(address, b, 1)){
+ //CPU_BREAK_LOOP_2;
+ }
+ }
+#endif
+
switch(address >> 24) {
case 2:
#ifdef BKPT_SUPPORT
diff --git a/src/gba/debugger-expr-lex.c b/src/gba/debugger-expr-lex.c
new file mode 100644
index 00000000..6df02371
--- /dev/null
+++ b/src/gba/debugger-expr-lex.c
@@ -0,0 +1 @@
+#include "debugger-expr-lex.cpp"
\ No newline at end of file
diff --git a/src/gba/debugger-expr-lex.cpp b/src/gba/debugger-expr-lex.cpp
new file mode 100644
index 00000000..70cba369
--- /dev/null
+++ b/src/gba/debugger-expr-lex.cpp
@@ -0,0 +1,1970 @@
+#line 2 "debugger-expr-lex.cpp"
+
+#line 4 "debugger-expr-lex.cpp"
+
+#define YY_INT_ALIGNED short int
+
+/* A lexical scanner generated by flex */
+
+#define yy_create_buffer dexp__create_buffer
+#define yy_delete_buffer dexp__delete_buffer
+#define yy_flex_debug dexp__flex_debug
+#define yy_init_buffer dexp__init_buffer
+#define yy_flush_buffer dexp__flush_buffer
+#define yy_load_buffer_state dexp__load_buffer_state
+#define yy_switch_to_buffer dexp__switch_to_buffer
+#define yyin dexp_in
+#define yyleng dexp_leng
+#define yylex dexp_lex
+#define yylineno dexp_lineno
+#define yyout dexp_out
+#define yyrestart dexp_restart
+#define yytext dexp_text
+#define yywrap dexp_wrap
+#define yyalloc dexp_alloc
+#define yyrealloc dexp_realloc
+#define yyfree dexp_free
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_FLEX_SUBMINOR_VERSION 35
+#if YY_FLEX_SUBMINOR_VERSION > 0
+#define FLEX_BETA
+#endif
+
+/* First, we deal with platform-specific or compiler-specific issues. */
+
+/* begin standard C headers. */
+#include
+#include
+#include
+#include
+
+/* end standard C headers. */
+
+/* flex integer type definitions */
+
+#ifndef FLEXINT_H
+#define FLEXINT_H
+
+/* C99 systems have . Non-C99 systems may or may not. */
+
+#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L
+
+/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h,
+ * if you want the limit (max/min) macros for int types.
+ */
+#ifndef __STDC_LIMIT_MACROS
+#define __STDC_LIMIT_MACROS 1
+#endif
+
+#include
+typedef int8_t flex_int8_t;
+typedef uint8_t flex_uint8_t;
+typedef int16_t flex_int16_t;
+typedef uint16_t flex_uint16_t;
+typedef int32_t flex_int32_t;
+typedef uint32_t flex_uint32_t;
+#else
+typedef signed char flex_int8_t;
+typedef short int flex_int16_t;
+typedef int flex_int32_t;
+typedef unsigned char flex_uint8_t;
+typedef unsigned short int flex_uint16_t;
+typedef unsigned int flex_uint32_t;
+
+/* Limits of integral types. */
+#ifndef INT8_MIN
+#define INT8_MIN (-128)
+#endif
+#ifndef INT16_MIN
+#define INT16_MIN (-32767-1)
+#endif
+#ifndef INT32_MIN
+#define INT32_MIN (-2147483647-1)
+#endif
+#ifndef INT8_MAX
+#define INT8_MAX (127)
+#endif
+#ifndef INT16_MAX
+#define INT16_MAX (32767)
+#endif
+#ifndef INT32_MAX
+#define INT32_MAX (2147483647)
+#endif
+#ifndef UINT8_MAX
+#define UINT8_MAX (255U)
+#endif
+#ifndef UINT16_MAX
+#define UINT16_MAX (65535U)
+#endif
+#ifndef UINT32_MAX
+#define UINT32_MAX (4294967295U)
+#endif
+
+#endif /* ! C99 */
+
+#endif /* ! FLEXINT_H */
+
+#ifdef __cplusplus
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else /* ! __cplusplus */
+
+/* C99 requires __STDC__ to be defined as 1. */
+#if defined (__STDC__)
+
+#define YY_USE_CONST
+
+#endif /* defined (__STDC__) */
+#endif /* ! __cplusplus */
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index. If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* Enter a start condition. This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN (yy_start) = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state. The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START (((yy_start) - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE dexp_restart(dexp_in )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#ifndef YY_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k.
+ * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case.
+ * Ditto for the __ia64__ case accordingly.
+ */
+#define YY_BUF_SIZE 32768
+#else
+#define YY_BUF_SIZE 16384
+#endif /* __ia64__ */
+#endif
+
+/* The state buf must be large enough to hold one state per character in the main buffer.
+ */
+#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type))
+
+#ifndef YY_TYPEDEF_YY_BUFFER_STATE
+#define YY_TYPEDEF_YY_BUFFER_STATE
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+#endif
+
+extern int dexp_leng;
+
+extern FILE *dexp_in, *dexp_out;
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+ #define YY_LESS_LINENO(n)
+
+/* Return all but the first "n" matched characters back to the input stream. */
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up dexp_text. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ *yy_cp = (yy_hold_char); \
+ YY_RESTORE_YY_MORE_OFFSET \
+ (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \
+ YY_DO_BEFORE_ACTION; /* set up dexp_text again */ \
+ } \
+ while ( 0 )
+
+#define unput(c) yyunput( c, (yytext_ptr) )
+
+#ifndef YY_TYPEDEF_YY_SIZE_T
+#define YY_TYPEDEF_YY_SIZE_T
+typedef size_t yy_size_t;
+#endif
+
+#ifndef YY_STRUCT_YY_BUFFER_STATE
+#define YY_STRUCT_YY_BUFFER_STATE
+struct yy_buffer_state
+ {
+ FILE *yy_input_file;
+
+ char *yy_ch_buf; /* input buffer */
+ char *yy_buf_pos; /* current position in input buffer */
+
+ /* Size of input buffer in bytes, not including room for EOB
+ * characters.
+ */
+ yy_size_t yy_buf_size;
+
+ /* Number of characters read into yy_ch_buf, not including EOB
+ * characters.
+ */
+ int yy_n_chars;
+
+ /* Whether we "own" the buffer - i.e., we know we created it,
+ * and can realloc() it to grow it, and should free() it to
+ * delete it.
+ */
+ int yy_is_our_buffer;
+
+ /* Whether this is an "interactive" input source; if so, and
+ * if we're using stdio for input, then we want to use getc()
+ * instead of fread(), to make sure we stop fetching input after
+ * each newline.
+ */
+ int yy_is_interactive;
+
+ /* Whether we're considered to be at the beginning of a line.
+ * If so, '^' rules will be active on the next match, otherwise
+ * not.
+ */
+ int yy_at_bol;
+
+ int yy_bs_lineno; /**< The line count. */
+ int yy_bs_column; /**< The column count. */
+
+ /* Whether to try to fill the input buffer when we reach the
+ * end of it.
+ */
+ int yy_fill_buffer;
+
+ int yy_buffer_status;
+
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+ /* When an EOF's been seen but there's still some text to process
+ * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+ * shouldn't try reading from the input source any more. We might
+ * still have a bunch of tokens to match, though, because of
+ * possible backing-up.
+ *
+ * When we actually see the EOF, we change the status to "new"
+ * (via dexp_restart()), so that the user can continue scanning by
+ * just pointing dexp_in at a new input file.
+ */
+#define YY_BUFFER_EOF_PENDING 2
+
+ };
+#endif /* !YY_STRUCT_YY_BUFFER_STATE */
+
+/* Stack of input buffers. */
+static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */
+static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */
+static YY_BUFFER_STATE * yy_buffer_stack = 0; /**< Stack as an array. */
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ *
+ * Returns the top of the stack, or NULL.
+ */
+#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \
+ ? (yy_buffer_stack)[(yy_buffer_stack_top)] \
+ : NULL)
+
+/* Same as previous macro, but useful when we know that the buffer stack is not
+ * NULL or when we need an lvalue. For internal use only.
+ */
+#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)]
+
+/* yy_hold_char holds the character lost when dexp_text is formed. */
+static char yy_hold_char;
+static int yy_n_chars; /* number of characters read into yy_ch_buf */
+int dexp_leng;
+
+/* Points to current character in buffer. */
+static char *yy_c_buf_p = (char *) 0;
+static int yy_init = 0; /* whether we need to initialize */
+static int yy_start = 0; /* start state number */
+
+/* Flag which is used to allow dexp_wrap()'s to do buffer switches
+ * instead of setting up a fresh dexp_in. A bit of a hack ...
+ */
+static int yy_did_buffer_switch_on_eof;
+
+void dexp_restart (FILE *input_file );
+void dexp__switch_to_buffer (YY_BUFFER_STATE new_buffer );
+YY_BUFFER_STATE dexp__create_buffer (FILE *file,int size );
+void dexp__delete_buffer (YY_BUFFER_STATE b );
+void dexp__flush_buffer (YY_BUFFER_STATE b );
+void dexp_push_buffer_state (YY_BUFFER_STATE new_buffer );
+void dexp_pop_buffer_state (void );
+
+static void dexp_ensure_buffer_stack (void );
+static void dexp__load_buffer_state (void );
+static void dexp__init_buffer (YY_BUFFER_STATE b,FILE *file );
+
+#define YY_FLUSH_BUFFER dexp__flush_buffer(YY_CURRENT_BUFFER )
+
+YY_BUFFER_STATE dexp__scan_buffer (char *base,yy_size_t size );
+YY_BUFFER_STATE dexp__scan_string (yyconst char *yy_str );
+YY_BUFFER_STATE dexp__scan_bytes (yyconst char *bytes,int len );
+
+void *dexp_alloc (yy_size_t );
+void *dexp_realloc (void *,yy_size_t );
+void dexp_free (void * );
+
+#define yy_new_buffer dexp__create_buffer
+
+#define yy_set_interactive(is_interactive) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){ \
+ dexp_ensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ dexp__create_buffer(dexp_in,YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \
+ }
+
+#define yy_set_bol(at_bol) \
+ { \
+ if ( ! YY_CURRENT_BUFFER ){\
+ dexp_ensure_buffer_stack (); \
+ YY_CURRENT_BUFFER_LVALUE = \
+ dexp__create_buffer(dexp_in,YY_BUF_SIZE ); \
+ } \
+ YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \
+ }
+
+#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol)
+
+/* Begin user sect3 */
+
+#define dexp_wrap(n) 1
+#define YY_SKIP_YYWRAP
+
+typedef unsigned char YY_CHAR;
+
+FILE *dexp_in = (FILE *) 0, *dexp_out = (FILE *) 0;
+
+typedef int yy_state_type;
+
+extern int dexp_lineno;
+
+int dexp_lineno = 1;
+
+extern char *dexp_text;
+#define yytext_ptr dexp_text
+
+static yy_state_type yy_get_previous_state (void );
+static yy_state_type yy_try_NUL_trans (yy_state_type current_state );
+static int yy_get_next_buffer (void );
+static void yy_fatal_error (yyconst char msg[] );
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up dexp_text.
+ */
+#define YY_DO_BEFORE_ACTION \
+ (yytext_ptr) = yy_bp; \
+ dexp_leng = (size_t) (yy_cp - yy_bp); \
+ (yy_hold_char) = *yy_cp; \
+ *yy_cp = '\0'; \
+ (yy_c_buf_p) = yy_cp;
+
+#define YY_NUM_RULES 30
+#define YY_END_OF_BUFFER 31
+/* This struct is not used in this scanner,
+ but its presence is necessary. */
+struct yy_trans_info
+ {
+ flex_int32_t yy_verify;
+ flex_int32_t yy_nxt;
+ };
+static yyconst flex_int16_t yy_accept[51] =
+ { 0,
+ 0, 0, 31, 28, 30, 27, 25, 28, 23, 20,
+ 21, 17, 14, 15, 16, 11, 10, 28, 28, 28,
+ 28, 28, 28, 28, 28, 28, 9, 8, 24, 28,
+ 22, 26, 13, 11, 0, 10, 18, 19, 29, 5,
+ 6, 3, 4, 2, 7, 1, 1, 1, 12, 0
+ } ;
+
+static yyconst flex_int32_t yy_ec[256] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 2,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 3, 4, 1, 1, 5, 1, 6, 1, 7,
+ 8, 9, 10, 1, 11, 1, 12, 13, 14, 15,
+ 15, 15, 15, 16, 16, 16, 16, 1, 1, 17,
+ 1, 18, 1, 1, 19, 20, 21, 19, 19, 19,
+ 22, 23, 22, 22, 22, 24, 22, 22, 22, 25,
+ 22, 26, 27, 22, 22, 22, 28, 29, 22, 22,
+ 30, 1, 31, 32, 22, 1, 19, 20, 21, 19,
+
+ 19, 19, 22, 23, 22, 22, 22, 24, 22, 22,
+ 22, 25, 22, 33, 27, 22, 22, 22, 28, 29,
+ 22, 22, 1, 34, 1, 35, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1
+ } ;
+
+static yyconst flex_int32_t yy_meta[36] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 2, 2, 2, 2, 1, 1, 2, 2,
+ 2, 3, 3, 3, 3, 3, 3, 3, 4, 1,
+ 1, 1, 3, 1, 1
+ } ;
+
+static yyconst flex_int16_t yy_base[55] =
+ { 0,
+ 0, 0, 71, 72, 72, 72, 72, 0, 72, 72,
+ 72, 72, 72, 72, 72, 41, 23, 52, 50, 0,
+ 37, 36, 14, 44, 39, 33, 72, 72, 72, 28,
+ 72, 72, 0, 33, 0, 35, 72, 72, 0, 72,
+ 72, 0, 0, 0, 72, 32, 39, 0, 0, 72,
+ 55, 54, 57, 52
+ } ;
+
+static yyconst flex_int16_t yy_def[55] =
+ { 0,
+ 50, 1, 50, 50, 50, 50, 50, 51, 50, 50,
+ 50, 50, 50, 50, 50, 52, 50, 50, 50, 53,
+ 53, 53, 53, 53, 53, 53, 50, 50, 50, 53,
+ 50, 50, 51, 52, 54, 50, 50, 50, 53, 50,
+ 50, 53, 53, 53, 50, 30, 30, 53, 54, 0,
+ 50, 50, 50, 50
+ } ;
+
+static yyconst flex_int16_t yy_nxt[108] =
+ { 0,
+ 4, 5, 6, 7, 8, 9, 10, 11, 12, 13,
+ 14, 15, 16, 17, 17, 17, 18, 19, 20, 21,
+ 20, 20, 22, 23, 24, 20, 25, 26, 20, 27,
+ 28, 29, 30, 31, 32, 36, 36, 36, 36, 42,
+ 46, 47, 48, 48, 48, 48, 42, 36, 36, 36,
+ 36, 48, 48, 49, 39, 34, 33, 34, 39, 39,
+ 39, 50, 45, 44, 43, 41, 40, 38, 37, 35,
+ 50, 3, 50, 50, 50, 50, 50, 50, 50, 50,
+ 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
+ 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
+
+ 50, 50, 50, 50, 50, 50, 50
+ } ;
+
+static yyconst flex_int16_t yy_chk[108] =
+ { 0,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+ 1, 1, 1, 1, 1, 17, 17, 17, 17, 23,
+ 30, 30, 30, 30, 46, 46, 23, 36, 36, 36,
+ 36, 47, 47, 54, 47, 52, 51, 52, 53, 53,
+ 53, 34, 26, 25, 24, 22, 21, 19, 18, 16,
+ 3, 50, 50, 50, 50, 50, 50, 50, 50, 50,
+ 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
+ 50, 50, 50, 50, 50, 50, 50, 50, 50, 50,
+
+ 50, 50, 50, 50, 50, 50, 50
+ } ;
+
+static yy_state_type yy_last_accepting_state;
+static char *yy_last_accepting_cpos;
+
+extern int dexp__flex_debug;
+int dexp__flex_debug = 0;
+
+/* The intent behind this definition is that it'll catch
+ * any uses of REJECT which flex missed.
+ */
+#define REJECT reject_used_but_not_detected
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+#define YY_RESTORE_YY_MORE_OFFSET
+char *dexp_text;
+#line 1 "debugger-expr.l"
+#line 2 "debugger-expr.l"
+#include
+#include
+#include "debugger-expr-yacc.hpp"
+
+#ifdef _MSC_VER
+#define YY_NO_UNISTD_H
+#include
+#define isatty _isatty
+#endif
+
+extern YYSTYPE dexp_lval;
+
+char *dexprString;
+int dexprCol;
+
+#define YY_INPUT(buf,result,max_size) \
+ { \
+ int c = *dexprString++; \
+ dexprCol++;\
+ result = (c == 0) ? YY_NULL : (buf[0] = c, 1); \
+ }
+
+#line 543 "debugger-expr-lex.cpp"
+
+#define INITIAL 0
+
+#ifndef YY_NO_UNISTD_H
+/* Special case for "unistd.h", since it is non-ANSI. We include it way
+ * down here because we want the user's section 1 to have been scanned first.
+ * The user has a chance to override it with an option.
+ */
+#include
+#endif
+
+#ifndef YY_EXTRA_TYPE
+#define YY_EXTRA_TYPE void *
+#endif
+
+static int yy_init_globals (void );
+
+/* Accessor methods to globals.
+ These are made visible to non-reentrant scanners for convenience. */
+
+int dexp_lex_destroy (void );
+
+int dexp_get_debug (void );
+
+void dexp_set_debug (int debug_flag );
+
+YY_EXTRA_TYPE dexp_get_extra (void );
+
+void dexp_set_extra (YY_EXTRA_TYPE user_defined );
+
+FILE *dexp_get_in (void );
+
+void dexp_set_in (FILE * in_str );
+
+FILE *dexp_get_out (void );
+
+void dexp_set_out (FILE * out_str );
+
+int dexp_get_leng (void );
+
+char *dexp_get_text (void );
+
+int dexp_get_lineno (void );
+
+void dexp_set_lineno (int line_number );
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int dexp_wrap (void );
+#else
+extern int dexp_wrap (void );
+#endif
+#endif
+
+ static void yyunput (int c,char *buf_ptr );
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char *,yyconst char *,int );
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * );
+#endif
+
+#ifndef YY_NO_INPUT
+
+#ifdef __cplusplus
+static int yyinput (void );
+#else
+static int input (void );
+#endif
+
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#ifdef __ia64__
+/* On IA-64, the buffer size is 16k, not 8k */
+#define YY_READ_BUF_SIZE 16384
+#else
+#define YY_READ_BUF_SIZE 8192
+#endif /* __ia64__ */
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO do { if (fwrite( dexp_text, dexp_leng, 1, dexp_out )) {} } while (0)
+#endif
+
+/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \
+ { \
+ int c = '*'; \
+ size_t n; \
+ for ( n = 0; n < max_size && \
+ (c = getc( dexp_in )) != EOF && c != '\n'; ++n ) \
+ buf[n] = (char) c; \
+ if ( c == '\n' ) \
+ buf[n++] = (char) c; \
+ if ( c == EOF && ferror( dexp_in ) ) \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ result = n; \
+ } \
+ else \
+ { \
+ errno=0; \
+ while ( (result = fread(buf, 1, max_size, dexp_in))==0 && ferror(dexp_in)) \
+ { \
+ if( errno != EINTR) \
+ { \
+ YY_FATAL_ERROR( "input in flex scanner failed" ); \
+ break; \
+ } \
+ errno=0; \
+ clearerr(dexp_in); \
+ } \
+ }\
+\
+
+#endif
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
+#endif
+
+/* end tables serialization structures and prototypes */
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL_IS_OURS 1
+
+extern int dexp_lex (void);
+
+#define YY_DECL int dexp_lex (void)
+#endif /* !YY_DECL */
+
+/* Code executed at the beginning of each rule, after dexp_text and dexp_leng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+ YY_USER_ACTION
+
+/** The main scanner function which does all the work.
+ */
+YY_DECL
+{
+ register yy_state_type yy_current_state;
+ register char *yy_cp, *yy_bp;
+ register int yy_act;
+
+#line 31 "debugger-expr.l"
+
+#line 732 "debugger-expr-lex.cpp"
+
+ if ( !(yy_init) )
+ {
+ (yy_init) = 1;
+
+#ifdef YY_USER_INIT
+ YY_USER_INIT;
+#endif
+
+ if ( ! (yy_start) )
+ (yy_start) = 1; /* first start state */
+
+ if ( ! dexp_in )
+ dexp_in = stdin;
+
+ if ( ! dexp_out )
+ dexp_out = stdout;
+
+ if ( ! YY_CURRENT_BUFFER ) {
+ dexp_ensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ dexp__create_buffer(dexp_in,YY_BUF_SIZE );
+ }
+
+ dexp__load_buffer_state( );
+ }
+
+ while ( 1 ) /* loops until end-of-file is reached */
+ {
+ yy_cp = (yy_c_buf_p);
+
+ /* Support of dexp_text. */
+ *yy_cp = (yy_hold_char);
+
+ /* yy_bp points to the position in yy_ch_buf of the start of
+ * the current run.
+ */
+ yy_bp = yy_cp;
+
+ yy_current_state = (yy_start);
+yy_match:
+ do
+ {
+ register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 51 )
+ yy_c = yy_meta[(unsigned int) yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+ ++yy_cp;
+ }
+ while ( yy_base[yy_current_state] != 72 );
+
+yy_find_action:
+ yy_act = yy_accept[yy_current_state];
+ if ( yy_act == 0 )
+ { /* have to back up */
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
+ yy_act = yy_accept[yy_current_state];
+ }
+
+ YY_DO_BEFORE_ACTION;
+
+do_action: /* This label is used only to access EOF actions. */
+
+ switch ( yy_act )
+ { /* beginning of action switch */
+ case 0: /* must back up */
+ /* undo the effects of YY_DO_BEFORE_ACTION */
+ *yy_cp = (yy_hold_char);
+ yy_cp = (yy_last_accepting_cpos);
+ yy_current_state = (yy_last_accepting_state);
+ goto yy_find_action;
+
+case 1:
+YY_RULE_SETUP
+#line 32 "debugger-expr.l"
+dexp_lval.number=atoi((char *)(dexp_text+1)); return TOK_REGISTER;
+ YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 33 "debugger-expr.l"
+dexp_lval.number = 13; return TOK_REGISTER;
+ YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 34 "debugger-expr.l"
+dexp_lval.number = 14; return TOK_REGISTER;
+ YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 35 "debugger-expr.l"
+dexp_lval.number = 15; return TOK_REGISTER;
+ YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 36 "debugger-expr.l"
+return TOK_BBRACKET;
+ YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 37 "debugger-expr.l"
+return TOK_HBRACKET;
+ YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 38 "debugger-expr.l"
+return TOK_WBRACKET;
+ YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 39 "debugger-expr.l"
+return TOK_RBRACKET;
+ YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 40 "debugger-expr.l"
+return TOK_LBRACKET;
+ YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 41 "debugger-expr.l"
+dexp_lval.number=atoi(dexp_text); return TOK_NUMBER;
+ YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 42 "debugger-expr.l"
+sscanf(dexp_text, "%x", &dexp_lval.number); return TOK_NUMBER;
+ YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 43 "debugger-expr.l"
+sscanf((char *)(dexp_text + 2), "%x", &dexp_lval.number); return TOK_NUMBER;
+ YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 44 "debugger-expr.l"
+sscanf((char *)(dexp_text + 1), "%x", &dexp_lval.number); return TOK_NUMBER;
+ YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 45 "debugger-expr.l"
+return TOK_PLUS;
+ YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 46 "debugger-expr.l"
+return TOK_MINUS;
+ YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 47 "debugger-expr.l"
+return TOK_DIVIDE;
+ YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 48 "debugger-expr.l"
+return TOK_MULTIPLY;
+ YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 49 "debugger-expr.l"
+return TOK_LSHIFT;
+ YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 50 "debugger-expr.l"
+return TOK_RSHIFT;
+ YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 51 "debugger-expr.l"
+return TOK_LPAREN;
+ YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 52 "debugger-expr.l"
+return TOK_RPAREN;
+ YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 53 "debugger-expr.l"
+return TOK_OR;
+ YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 54 "debugger-expr.l"
+return TOK_AND;
+ YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 55 "debugger-expr.l"
+return TOK_XOR;
+ YY_BREAK
+case 25:
+YY_RULE_SETUP
+#line 56 "debugger-expr.l"
+return TOK_NEGATE;
+ YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 57 "debugger-expr.l"
+return TOK_NEGATE;
+ YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 58 "debugger-expr.l"
+;
+ YY_BREAK
+case 28:
+YY_RULE_SETUP
+#line 59 "debugger-expr.l"
+printf("Unrecognised token: %s\n", dexp_text);
+ YY_BREAK
+case 29:
+YY_RULE_SETUP
+#line 60 "debugger-expr.l"
+dexp_lval.string=dexp_text; return TOK_ID;
+ YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 62 "debugger-expr.l"
+ECHO;
+ YY_BREAK
+#line 965 "debugger-expr-lex.cpp"
+case YY_STATE_EOF(INITIAL):
+ yyterminate();
+
+ case YY_END_OF_BUFFER:
+ {
+ /* Amount of text matched not including the EOB char. */
+ int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1;
+
+ /* Undo the effects of YY_DO_BEFORE_ACTION. */
+ *yy_cp = (yy_hold_char);
+ YY_RESTORE_YY_MORE_OFFSET
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW )
+ {
+ /* We're scanning a new file or input source. It's
+ * possible that this happened because the user
+ * just pointed dexp_in at a new source and called
+ * dexp_lex(). If so, then we have to assure
+ * consistency between YY_CURRENT_BUFFER and our
+ * globals. Here is the right place to do so, because
+ * this is the first action (other than possibly a
+ * back-up) that will match for the new input source.
+ */
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ YY_CURRENT_BUFFER_LVALUE->yy_input_file = dexp_in;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL;
+ }
+
+ /* Note that here we test for yy_c_buf_p "<=" to the position
+ * of the first EOB in the buffer, since yy_c_buf_p will
+ * already have been incremented past the NUL character
+ * (since all states make transitions on EOB to the
+ * end-of-buffer state). Contrast this with the test
+ * in input().
+ */
+ if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
+ { /* This was really a NUL. */
+ yy_state_type yy_next_state;
+
+ (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( );
+
+ /* Okay, we're now positioned to make the NUL
+ * transition. We couldn't have
+ * yy_get_previous_state() go ahead and do it
+ * for us because it doesn't know how to deal
+ * with the possibility of jamming (and we don't
+ * want to build jamming into it because then it
+ * will run more slowly).
+ */
+
+ yy_next_state = yy_try_NUL_trans( yy_current_state );
+
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+
+ if ( yy_next_state )
+ {
+ /* Consume the NUL. */
+ yy_cp = ++(yy_c_buf_p);
+ yy_current_state = yy_next_state;
+ goto yy_match;
+ }
+
+ else
+ {
+ yy_cp = (yy_c_buf_p);
+ goto yy_find_action;
+ }
+ }
+
+ else switch ( yy_get_next_buffer( ) )
+ {
+ case EOB_ACT_END_OF_FILE:
+ {
+ (yy_did_buffer_switch_on_eof) = 0;
+
+ if ( dexp_wrap( ) )
+ {
+ /* Note: because we've taken care in
+ * yy_get_next_buffer() to have set up
+ * dexp_text, we can now set up
+ * yy_c_buf_p so that if some total
+ * hoser (like flex itself) wants to
+ * call the scanner after we return the
+ * YY_NULL, it'll still work - another
+ * YY_NULL will get returned.
+ */
+ (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ;
+
+ yy_act = YY_STATE_EOF(YY_START);
+ goto do_action;
+ }
+
+ else
+ {
+ if ( ! (yy_did_buffer_switch_on_eof) )
+ YY_NEW_FILE;
+ }
+ break;
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ (yy_c_buf_p) =
+ (yytext_ptr) + yy_amount_of_matched_text;
+
+ yy_current_state = yy_get_previous_state( );
+
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+ goto yy_match;
+
+ case EOB_ACT_LAST_MATCH:
+ (yy_c_buf_p) =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)];
+
+ yy_current_state = yy_get_previous_state( );
+
+ yy_cp = (yy_c_buf_p);
+ yy_bp = (yytext_ptr) + YY_MORE_ADJ;
+ goto yy_find_action;
+ }
+ break;
+ }
+
+ default:
+ YY_FATAL_ERROR(
+ "fatal flex scanner internal error--no action found" );
+ } /* end of action switch */
+ } /* end of scanning one token */
+} /* end of dexp_lex */
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ * EOB_ACT_LAST_MATCH -
+ * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ * EOB_ACT_END_OF_FILE - end of file
+ */
+static int yy_get_next_buffer (void)
+{
+ register char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf;
+ register char *source = (yytext_ptr);
+ register int number_to_move, i;
+ int ret_val;
+
+ if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] )
+ YY_FATAL_ERROR(
+ "fatal flex scanner internal error--end of buffer missed" );
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 )
+ { /* Don't try to fill the buffer, so this is an EOF. */
+ if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 )
+ {
+ /* We matched a single character, the EOB, so
+ * treat this as a final EOF.
+ */
+ return EOB_ACT_END_OF_FILE;
+ }
+
+ else
+ {
+ /* We matched some text prior to the EOB, first
+ * process it.
+ */
+ return EOB_ACT_LAST_MATCH;
+ }
+ }
+
+ /* Try to read more data. */
+
+ /* First move last chars to start of buffer. */
+ number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr)) - 1;
+
+ for ( i = 0; i < number_to_move; ++i )
+ *(dest++) = *(source++);
+
+ if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+ /* don't do the read, it's not guaranteed to return an EOF,
+ * just force an EOF
+ */
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0;
+
+ else
+ {
+ int num_to_read =
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1;
+
+ while ( num_to_read <= 0 )
+ { /* Not enough room in the buffer - grow it. */
+
+ /* just a shorter name for the current buffer */
+ YY_BUFFER_STATE b = YY_CURRENT_BUFFER;
+
+ int yy_c_buf_p_offset =
+ (int) ((yy_c_buf_p) - b->yy_ch_buf);
+
+ if ( b->yy_is_our_buffer )
+ {
+ int new_size = b->yy_buf_size * 2;
+
+ if ( new_size <= 0 )
+ b->yy_buf_size += b->yy_buf_size / 8;
+ else
+ b->yy_buf_size *= 2;
+
+ b->yy_ch_buf = (char *)
+ /* Include room in for 2 EOB chars. */
+ dexp_realloc((void *) b->yy_ch_buf,b->yy_buf_size + 2 );
+ }
+ else
+ /* Can't grow it, we don't own it. */
+ b->yy_ch_buf = 0;
+
+ if ( ! b->yy_ch_buf )
+ YY_FATAL_ERROR(
+ "fatal error - scanner input buffer overflow" );
+
+ (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+ num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size -
+ number_to_move - 1;
+
+ }
+
+ if ( num_to_read > YY_READ_BUF_SIZE )
+ num_to_read = YY_READ_BUF_SIZE;
+
+ /* Read in more data. */
+ YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]),
+ (yy_n_chars), (size_t) num_to_read );
+
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ if ( (yy_n_chars) == 0 )
+ {
+ if ( number_to_move == YY_MORE_ADJ )
+ {
+ ret_val = EOB_ACT_END_OF_FILE;
+ dexp_restart(dexp_in );
+ }
+
+ else
+ {
+ ret_val = EOB_ACT_LAST_MATCH;
+ YY_CURRENT_BUFFER_LVALUE->yy_buffer_status =
+ YY_BUFFER_EOF_PENDING;
+ }
+ }
+
+ else
+ ret_val = EOB_ACT_CONTINUE_SCAN;
+
+ if ((yy_size_t) ((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) {
+ /* Extend the array by 50%, plus the number we really need. */
+ yy_size_t new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1);
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) dexp_realloc((void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf,new_size );
+ if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+ YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" );
+ }
+
+ (yy_n_chars) += number_to_move;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR;
+ YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR;
+
+ (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0];
+
+ return ret_val;
+}
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+ static yy_state_type yy_get_previous_state (void)
+{
+ register yy_state_type yy_current_state;
+ register char *yy_cp;
+
+ yy_current_state = (yy_start);
+
+ for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp )
+ {
+ register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 51 )
+ yy_c = yy_meta[(unsigned int) yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+ }
+
+ return yy_current_state;
+}
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ * next_state = yy_try_NUL_trans( current_state );
+ */
+ static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state )
+{
+ register int yy_is_jam;
+ register char *yy_cp = (yy_c_buf_p);
+
+ register YY_CHAR yy_c = 1;
+ if ( yy_accept[yy_current_state] )
+ {
+ (yy_last_accepting_state) = yy_current_state;
+ (yy_last_accepting_cpos) = yy_cp;
+ }
+ while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+ {
+ yy_current_state = (int) yy_def[yy_current_state];
+ if ( yy_current_state >= 51 )
+ yy_c = yy_meta[(unsigned int) yy_c];
+ }
+ yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+ yy_is_jam = (yy_current_state == 50);
+
+ return yy_is_jam ? 0 : yy_current_state;
+}
+
+ static void yyunput (int c, register char * yy_bp )
+{
+ register char *yy_cp;
+
+ yy_cp = (yy_c_buf_p);
+
+ /* undo effects of setting up dexp_text */
+ *yy_cp = (yy_hold_char);
+
+ if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
+ { /* need to shift things up to make room */
+ /* +2 for EOB chars. */
+ register int number_to_move = (yy_n_chars) + 2;
+ register char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2];
+ register char *source =
+ &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move];
+
+ while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf )
+ *--dest = *--source;
+
+ yy_cp += (int) (dest - source);
+ yy_bp += (int) (dest - source);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars =
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_buf_size;
+
+ if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 )
+ YY_FATAL_ERROR( "flex scanner push-back overflow" );
+ }
+
+ *--yy_cp = (char) c;
+
+ (yytext_ptr) = yy_bp;
+ (yy_hold_char) = *yy_cp;
+ (yy_c_buf_p) = yy_cp;
+}
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+ static int yyinput (void)
+#else
+ static int input (void)
+#endif
+
+{
+ int c;
+
+ *(yy_c_buf_p) = (yy_hold_char);
+
+ if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR )
+ {
+ /* yy_c_buf_p now points to the character we want to return.
+ * If this occurs *before* the EOB characters, then it's a
+ * valid NUL; if not, then we've hit the end of the buffer.
+ */
+ if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] )
+ /* This was really a NUL. */
+ *(yy_c_buf_p) = '\0';
+
+ else
+ { /* need more input */
+ int offset = (yy_c_buf_p) - (yytext_ptr);
+ ++(yy_c_buf_p);
+
+ switch ( yy_get_next_buffer( ) )
+ {
+ case EOB_ACT_LAST_MATCH:
+ /* This happens because yy_g_n_b()
+ * sees that we've accumulated a
+ * token and flags that we need to
+ * try matching the token before
+ * proceeding. But for input(),
+ * there's no matching to consider.
+ * So convert the EOB_ACT_LAST_MATCH
+ * to EOB_ACT_END_OF_FILE.
+ */
+
+ /* Reset buffer status. */
+ dexp_restart(dexp_in );
+
+ /*FALLTHROUGH*/
+
+ case EOB_ACT_END_OF_FILE:
+ {
+ if ( dexp_wrap( ) )
+ return EOF;
+
+ if ( ! (yy_did_buffer_switch_on_eof) )
+ YY_NEW_FILE;
+#ifdef __cplusplus
+ return yyinput();
+#else
+ return input();
+#endif
+ }
+
+ case EOB_ACT_CONTINUE_SCAN:
+ (yy_c_buf_p) = (yytext_ptr) + offset;
+ break;
+ }
+ }
+ }
+
+ c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */
+ *(yy_c_buf_p) = '\0'; /* preserve dexp_text */
+ (yy_hold_char) = *++(yy_c_buf_p);
+
+ return c;
+}
+#endif /* ifndef YY_NO_INPUT */
+
+/** Immediately switch to a different input stream.
+ * @param input_file A readable stream.
+ *
+ * @note This function does not reset the start condition to @c INITIAL .
+ */
+ void dexp_restart (FILE * input_file )
+{
+
+ if ( ! YY_CURRENT_BUFFER ){
+ dexp_ensure_buffer_stack ();
+ YY_CURRENT_BUFFER_LVALUE =
+ dexp__create_buffer(dexp_in,YY_BUF_SIZE );
+ }
+
+ dexp__init_buffer(YY_CURRENT_BUFFER,input_file );
+ dexp__load_buffer_state( );
+}
+
+/** Switch to a different input buffer.
+ * @param new_buffer The new input buffer.
+ *
+ */
+ void dexp__switch_to_buffer (YY_BUFFER_STATE new_buffer )
+{
+
+ /* TODO. We should be able to replace this entire function body
+ * with
+ * dexp_pop_buffer_state();
+ * dexp_push_buffer_state(new_buffer);
+ */
+ dexp_ensure_buffer_stack ();
+ if ( YY_CURRENT_BUFFER == new_buffer )
+ return;
+
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+ dexp__load_buffer_state( );
+
+ /* We don't actually know whether we did this switch during
+ * EOF (dexp_wrap()) processing, but the only time this flag
+ * is looked at is after dexp_wrap() is called, so it's safe
+ * to go ahead and always set it.
+ */
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+
+static void dexp__load_buffer_state (void)
+{
+ (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars;
+ (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos;
+ dexp_in = YY_CURRENT_BUFFER_LVALUE->yy_input_file;
+ (yy_hold_char) = *(yy_c_buf_p);
+}
+
+/** Allocate and initialize an input buffer state.
+ * @param file A readable stream.
+ * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE.
+ *
+ * @return the allocated buffer state.
+ */
+ YY_BUFFER_STATE dexp__create_buffer (FILE * file, int size )
+{
+ YY_BUFFER_STATE b;
+
+ b = (YY_BUFFER_STATE) dexp_alloc(sizeof( struct yy_buffer_state ) );
+ if ( ! b )
+ YY_FATAL_ERROR( "out of dynamic memory in dexp__create_buffer()" );
+
+ b->yy_buf_size = size;
+
+ /* yy_ch_buf has to be 2 characters longer than the size given because
+ * we need to put in 2 end-of-buffer characters.
+ */
+ b->yy_ch_buf = (char *) dexp_alloc(b->yy_buf_size + 2 );
+ if ( ! b->yy_ch_buf )
+ YY_FATAL_ERROR( "out of dynamic memory in dexp__create_buffer()" );
+
+ b->yy_is_our_buffer = 1;
+
+ dexp__init_buffer(b,file );
+
+ return b;
+}
+
+/** Destroy the buffer.
+ * @param b a buffer created with dexp__create_buffer()
+ *
+ */
+ void dexp__delete_buffer (YY_BUFFER_STATE b )
+{
+
+ if ( ! b )
+ return;
+
+ if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */
+ YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0;
+
+ if ( b->yy_is_our_buffer )
+ dexp_free((void *) b->yy_ch_buf );
+
+ dexp_free((void *) b );
+}
+
+#ifndef __cplusplus
+extern int isatty (int );
+#endif /* __cplusplus */
+
+/* Initializes or reinitializes a buffer.
+ * This function is sometimes called more than once on the same buffer,
+ * such as during a dexp_restart() or at EOF.
+ */
+ static void dexp__init_buffer (YY_BUFFER_STATE b, FILE * file )
+
+{
+ int oerrno = errno;
+
+ dexp__flush_buffer(b );
+
+ b->yy_input_file = file;
+ b->yy_fill_buffer = 1;
+
+ /* If b is the current buffer, then dexp__init_buffer was _probably_
+ * called from dexp_restart() or through yy_get_next_buffer.
+ * In that case, we don't want to reset the lineno or column.
+ */
+ if (b != YY_CURRENT_BUFFER){
+ b->yy_bs_lineno = 1;
+ b->yy_bs_column = 0;
+ }
+
+ b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+
+ errno = oerrno;
+}
+
+/** Discard all buffered characters. On the next scan, YY_INPUT will be called.
+ * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER.
+ *
+ */
+ void dexp__flush_buffer (YY_BUFFER_STATE b )
+{
+ if ( ! b )
+ return;
+
+ b->yy_n_chars = 0;
+
+ /* We always need two end-of-buffer characters. The first causes
+ * a transition to the end-of-buffer state. The second causes
+ * a jam in that state.
+ */
+ b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+ b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+ b->yy_buf_pos = &b->yy_ch_buf[0];
+
+ b->yy_at_bol = 1;
+ b->yy_buffer_status = YY_BUFFER_NEW;
+
+ if ( b == YY_CURRENT_BUFFER )
+ dexp__load_buffer_state( );
+}
+
+/** Pushes the new state onto the stack. The new state becomes
+ * the current state. This function will allocate the stack
+ * if necessary.
+ * @param new_buffer The new state.
+ *
+ */
+void dexp_push_buffer_state (YY_BUFFER_STATE new_buffer )
+{
+ if (new_buffer == NULL)
+ return;
+
+ dexp_ensure_buffer_stack();
+
+ /* This block is copied from dexp__switch_to_buffer. */
+ if ( YY_CURRENT_BUFFER )
+ {
+ /* Flush out information for old buffer. */
+ *(yy_c_buf_p) = (yy_hold_char);
+ YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p);
+ YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars);
+ }
+
+ /* Only push if top exists. Otherwise, replace top. */
+ if (YY_CURRENT_BUFFER)
+ (yy_buffer_stack_top)++;
+ YY_CURRENT_BUFFER_LVALUE = new_buffer;
+
+ /* copied from dexp__switch_to_buffer. */
+ dexp__load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+}
+
+/** Removes and deletes the top of the stack, if present.
+ * The next element becomes the new top.
+ *
+ */
+void dexp_pop_buffer_state (void)
+{
+ if (!YY_CURRENT_BUFFER)
+ return;
+
+ dexp__delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ if ((yy_buffer_stack_top) > 0)
+ --(yy_buffer_stack_top);
+
+ if (YY_CURRENT_BUFFER) {
+ dexp__load_buffer_state( );
+ (yy_did_buffer_switch_on_eof) = 1;
+ }
+}
+
+/* Allocates the stack if it does not exist.
+ * Guarantees space for at least one push.
+ */
+static void dexp_ensure_buffer_stack (void)
+{
+ int num_to_alloc;
+
+ if (!(yy_buffer_stack)) {
+
+ /* First allocation is just for 2 elements, since we don't know if this
+ * scanner will even need a stack. We use 2 instead of 1 to avoid an
+ * immediate realloc on the next call.
+ */
+ num_to_alloc = 1;
+ (yy_buffer_stack) = (struct yy_buffer_state**)dexp_alloc
+ (num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+ if ( ! (yy_buffer_stack) )
+ YY_FATAL_ERROR( "out of dynamic memory in dexp_ensure_buffer_stack()" );
+
+ memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*));
+
+ (yy_buffer_stack_max) = num_to_alloc;
+ (yy_buffer_stack_top) = 0;
+ return;
+ }
+
+ if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){
+
+ /* Increase the buffer to prepare for a possible push. */
+ int grow_size = 8 /* arbitrary grow size */;
+
+ num_to_alloc = (yy_buffer_stack_max) + grow_size;
+ (yy_buffer_stack) = (struct yy_buffer_state**)dexp_realloc
+ ((yy_buffer_stack),
+ num_to_alloc * sizeof(struct yy_buffer_state*)
+ );
+ if ( ! (yy_buffer_stack) )
+ YY_FATAL_ERROR( "out of dynamic memory in dexp_ensure_buffer_stack()" );
+
+ /* zero only the new slots.*/
+ memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*));
+ (yy_buffer_stack_max) = num_to_alloc;
+ }
+}
+
+/** Setup the input buffer state to scan directly from a user-specified character buffer.
+ * @param base the character buffer
+ * @param size the size in bytes of the character buffer
+ *
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE dexp__scan_buffer (char * base, yy_size_t size )
+{
+ YY_BUFFER_STATE b;
+
+ if ( size < 2 ||
+ base[size-2] != YY_END_OF_BUFFER_CHAR ||
+ base[size-1] != YY_END_OF_BUFFER_CHAR )
+ /* They forgot to leave room for the EOB's. */
+ return 0;
+
+ b = (YY_BUFFER_STATE) dexp_alloc(sizeof( struct yy_buffer_state ) );
+ if ( ! b )
+ YY_FATAL_ERROR( "out of dynamic memory in dexp__scan_buffer()" );
+
+ b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
+ b->yy_buf_pos = b->yy_ch_buf = base;
+ b->yy_is_our_buffer = 0;
+ b->yy_input_file = 0;
+ b->yy_n_chars = b->yy_buf_size;
+ b->yy_is_interactive = 0;
+ b->yy_at_bol = 1;
+ b->yy_fill_buffer = 0;
+ b->yy_buffer_status = YY_BUFFER_NEW;
+
+ dexp__switch_to_buffer(b );
+
+ return b;
+}
+
+/** Setup the input buffer state to scan a string. The next call to dexp_lex() will
+ * scan from a @e copy of @a str.
+ * @param yystr a NUL-terminated string to scan
+ *
+ * @return the newly allocated buffer state object.
+ * @note If you want to scan bytes that may contain NUL values, then use
+ * dexp__scan_bytes() instead.
+ */
+YY_BUFFER_STATE dexp__scan_string (yyconst char * yystr )
+{
+
+ return dexp__scan_bytes(yystr,strlen(yystr) );
+}
+
+/** Setup the input buffer state to scan the given bytes. The next call to dexp_lex() will
+ * scan from a @e copy of @a bytes.
+ * @param yybytes the byte buffer to scan
+ * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes.
+ *
+ * @return the newly allocated buffer state object.
+ */
+YY_BUFFER_STATE dexp__scan_bytes (yyconst char * yybytes, int _yybytes_len )
+{
+ YY_BUFFER_STATE b;
+ char *buf;
+ yy_size_t n;
+ int i;
+
+ /* Get memory for full buffer, including space for trailing EOB's. */
+ n = _yybytes_len + 2;
+ buf = (char *) dexp_alloc(n );
+ if ( ! buf )
+ YY_FATAL_ERROR( "out of dynamic memory in dexp__scan_bytes()" );
+
+ for ( i = 0; i < _yybytes_len; ++i )
+ buf[i] = yybytes[i];
+
+ buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR;
+
+ b = dexp__scan_buffer(buf,n );
+ if ( ! b )
+ YY_FATAL_ERROR( "bad buffer in dexp__scan_bytes()" );
+
+ /* It's okay to grow etc. this buffer, and we should throw it
+ * away when we're done.
+ */
+ b->yy_is_our_buffer = 1;
+
+ return b;
+}
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+static void yy_fatal_error (yyconst char* msg )
+{
+ (void) fprintf( stderr, "%s\n", msg );
+ exit( YY_EXIT_FAILURE );
+}
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+ do \
+ { \
+ /* Undo effects of setting up dexp_text. */ \
+ int yyless_macro_arg = (n); \
+ YY_LESS_LINENO(yyless_macro_arg);\
+ dexp_text[dexp_leng] = (yy_hold_char); \
+ (yy_c_buf_p) = dexp_text + yyless_macro_arg; \
+ (yy_hold_char) = *(yy_c_buf_p); \
+ *(yy_c_buf_p) = '\0'; \
+ dexp_leng = yyless_macro_arg; \
+ } \
+ while ( 0 )
+
+/* Accessor methods (get/set functions) to struct members. */
+
+/** Get the current line number.
+ *
+ */
+int dexp_get_lineno (void)
+{
+
+ return dexp_lineno;
+}
+
+/** Get the input stream.
+ *
+ */
+FILE *dexp_get_in (void)
+{
+ return dexp_in;
+}
+
+/** Get the output stream.
+ *
+ */
+FILE *dexp_get_out (void)
+{
+ return dexp_out;
+}
+
+/** Get the length of the current token.
+ *
+ */
+int dexp_get_leng (void)
+{
+ return dexp_leng;
+}
+
+/** Get the current token.
+ *
+ */
+
+char *dexp_get_text (void)
+{
+ return dexp_text;
+}
+
+/** Set the current line number.
+ * @param line_number
+ *
+ */
+void dexp_set_lineno (int line_number )
+{
+
+ dexp_lineno = line_number;
+}
+
+/** Set the input stream. This does not discard the current
+ * input buffer.
+ * @param in_str A readable stream.
+ *
+ * @see dexp__switch_to_buffer
+ */
+void dexp_set_in (FILE * in_str )
+{
+ dexp_in = in_str ;
+}
+
+void dexp_set_out (FILE * out_str )
+{
+ dexp_out = out_str ;
+}
+
+int dexp_get_debug (void)
+{
+ return dexp__flex_debug;
+}
+
+void dexp_set_debug (int bdebug )
+{
+ dexp__flex_debug = bdebug ;
+}
+
+static int yy_init_globals (void)
+{
+ /* Initialization is the same as for the non-reentrant scanner.
+ * This function is called from dexp_lex_destroy(), so don't allocate here.
+ */
+
+ (yy_buffer_stack) = 0;
+ (yy_buffer_stack_top) = 0;
+ (yy_buffer_stack_max) = 0;
+ (yy_c_buf_p) = (char *) 0;
+ (yy_init) = 0;
+ (yy_start) = 0;
+
+/* Defined in main.c */
+#ifdef YY_STDINIT
+ dexp_in = stdin;
+ dexp_out = stdout;
+#else
+ dexp_in = (FILE *) 0;
+ dexp_out = (FILE *) 0;
+#endif
+
+ /* For future reference: Set errno on error, since we are called by
+ * dexp_lex_init()
+ */
+ return 0;
+}
+
+/* dexp_lex_destroy is for both reentrant and non-reentrant scanners. */
+int dexp_lex_destroy (void)
+{
+
+ /* Pop the buffer stack, destroying each element. */
+ while(YY_CURRENT_BUFFER){
+ dexp__delete_buffer(YY_CURRENT_BUFFER );
+ YY_CURRENT_BUFFER_LVALUE = NULL;
+ dexp_pop_buffer_state();
+ }
+
+ /* Destroy the stack itself. */
+ dexp_free((yy_buffer_stack) );
+ (yy_buffer_stack) = NULL;
+
+ /* Reset the globals. This is important in a non-reentrant scanner so the next time
+ * dexp_lex() is called, initialization will occur. */
+ yy_init_globals( );
+
+ return 0;
+}
+
+/*
+ * Internal utility routines.
+ */
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
+{
+ register int i;
+ for ( i = 0; i < n; ++i )
+ s1[i] = s2[i];
+}
+#endif
+
+#ifdef YY_NEED_STRLEN
+static int yy_flex_strlen (yyconst char * s )
+{
+ register int n;
+ for ( n = 0; s[n]; ++n )
+ ;
+
+ return n;
+}
+#endif
+
+void *dexp_alloc (yy_size_t size )
+{
+ return (void *) malloc( size );
+}
+
+void *dexp_realloc (void * ptr, yy_size_t size )
+{
+ /* The cast to (char *) in the following accommodates both
+ * implementations that use char* generic pointers, and those
+ * that use void* generic pointers. It works with the latter
+ * because both ANSI C and C++ allow castless assignment from
+ * any pointer type to void*, and deal with argument conversions
+ * as though doing an assignment.
+ */
+ return (void *) realloc( (char *) ptr, size );
+}
+
+void dexp_free (void * ptr )
+{
+ free( (char *) ptr ); /* see dexp_realloc() for (char *) cast */
+}
+
+#define YYTABLES_NAME "yytables"
+
+#line 62 "debugger-expr.l"
+
+
+
+void dexp_flush()
+{
+ dexp__flush_buffer(YY_CURRENT_BUFFER);
+}
+
diff --git a/src/gba/debugger-expr-yacc.cpp b/src/gba/debugger-expr-yacc.cpp
new file mode 100644
index 00000000..c3a1840d
--- /dev/null
+++ b/src/gba/debugger-expr-yacc.cpp
@@ -0,0 +1,1830 @@
+/* A Bison parser, made by GNU Bison 2.3. */
+
+/* Skeleton implementation for Bison's Yacc-like parsers in C
+
+ Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006
+ Free Software Foundation, Inc.
+
+ This program is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2, or (at your option)
+ any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor,
+ Boston, MA 02110-1301, USA. */
+
+/* As a special exception, you may create a larger work that contains
+ part or all of the Bison parser skeleton and distribute that work
+ under terms of your choice, so long as that work isn't itself a
+ parser generator using the skeleton or a modified version thereof
+ as a parser skeleton. Alternatively, if you modify or redistribute
+ the parser skeleton itself, you may (at your option) remove this
+ special exception, which will cause the skeleton and the resulting
+ Bison output files to be licensed under the GNU General Public
+ License without this special exception.
+
+ This special exception was added by the Free Software Foundation in
+ version 2.2 of Bison. */
+
+/* C LALR(1) parser skeleton written by Richard Stallman, by
+ simplifying the original so-called "semantic" parser. */
+
+/* All symbols defined below should begin with yy or YY, to avoid
+ infringing on user name space. This should be done even for local
+ variables, as they might otherwise be expanded by user macros.
+ There are some unavoidable exceptions within include files to
+ define necessary library symbols; they are noted "INFRINGES ON
+ USER NAME SPACE" below. */
+
+/* Identify Bison output. */
+#define YYBISON 1
+
+/* Bison version. */
+#define YYBISON_VERSION "2.3"
+
+/* Skeleton name. */
+#define YYSKELETON_NAME "yacc.c"
+
+/* Pure parsers. */
+#define YYPURE 0
+
+/* Using locations. */
+#define YYLSP_NEEDED 0
+
+#define yyparse dexp_parse
+#define yylex dexp_lex
+#define yyerror dexp_error
+#define yylval dexp_lval
+#define yychar dexp_char
+#define yydebug dexp_debug
+#define yynerrs dexp_nerrs
+
+/* Tokens. */
+#ifndef YYTOKENTYPE
+# define YYTOKENTYPE
+ /* Put the tokens into the symbol table, so that GDB and other debuggers
+ know about them. */
+ enum yytokentype {
+ TOK_PLUS = 258,
+ TOK_MINUS = 259,
+ TOK_DIVIDE = 260,
+ TOK_MULTIPLY = 261,
+ TOK_LSHIFT = 262,
+ TOK_RSHIFT = 263,
+ TOK_LPAREN = 264,
+ TOK_RPAREN = 265,
+ TOK_OR = 266,
+ TOK_AND = 267,
+ TOK_XOR = 268,
+ TOK_NEGATE = 269,
+ TOK_BBRACKET = 270,
+ TOK_HBRACKET = 271,
+ TOK_WBRACKET = 272,
+ TOK_LBRACKET = 273,
+ TOK_RBRACKET = 274,
+ TOK_REGISTER = 275,
+ TOK_NUMBER = 276,
+ TOK_ID = 277
+ };
+#endif
+/* Tokens. */
+#define TOK_PLUS 258
+#define TOK_MINUS 259
+#define TOK_DIVIDE 260
+#define TOK_MULTIPLY 261
+#define TOK_LSHIFT 262
+#define TOK_RSHIFT 263
+#define TOK_LPAREN 264
+#define TOK_RPAREN 265
+#define TOK_OR 266
+#define TOK_AND 267
+#define TOK_XOR 268
+#define TOK_NEGATE 269
+#define TOK_BBRACKET 270
+#define TOK_HBRACKET 271
+#define TOK_WBRACKET 272
+#define TOK_LBRACKET 273
+#define TOK_RBRACKET 274
+#define TOK_REGISTER 275
+#define TOK_NUMBER 276
+#define TOK_ID 277
+
+
+
+
+/* Copy the first part of user declarations. */
+#line 1 "src/sdl/debugger-expr.y"
+
+#include
+
+#include "../System.h"
+#include "GBA.h"
+#include "../Common/Port.h"
+
+#include
+#include