-/* Project 16 Source Code~
- * Copyright (C) 2012-2015 sparky4 & pngwen & andrius4669
- *
- * This file is part of Project 16.
- *
- * Project 16 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 3 of the License, or
- * (at your option) any later version.
- *
- * Project 16 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, see <http://www.gnu.org/licenses/>, or
- * write to the Free Software Foundation, Inc., 51 Franklin Street,
- * Fifth Floor, Boston, MA 02110-1301 USA.
- *
- */
-
-#include "src/lib/16_head.h"
-
-/* Function: Wait **********************************************************\r
-*\r
-* Parameters: wait - time in microseconds\r
-*\r
-* Description: pauses for a specified number of microseconds.\r
-*\r
-*/\r
-void wait(clock_t wait){\r
- clock_t goal;\r
-\r
- if(!wait) return;\r
-\r
- goal = wait + clock();\r
- while((goal > clock()) && !kbhit()) ;\r
-} /* End of wait */
-
-void __near* LargestFreeBlock(size_t* Size)
-{
- size_t s0, s1;
- void __near* p;
-
- s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
- while (s0 && (p = _nmalloc(s0)) == NULL)
- s0 >>= 1;
-
- if (p)
- _nfree(p);
-
- s1 = s0 >> 1;
- while (s1)
- {
- if ((p = _nmalloc(s0 + s1)) != NULL)
- {
- s0 += s1;
- _nfree(p);
- }
- s1 >>= 1;
- }
- while (s0 && (p = _nmalloc(s0)) == NULL)
- s0 ^= s0 & -s0;
-
- *Size = s0;
- return p;
-}
-
-size_t _coreleft(void)
-{
- size_t total = 0;
- void __near* pFirst = NULL;
- void __near* pLast = NULL;
- for(;;)
- {
- size_t largest;
- void __near* p = LargestFreeBlock(&largest);
- if (largest < sizeof(void __near*))
- {
- if (p != NULL)
- _nfree(p);
- break;
- }
- *(void __near* __near*)p = NULL;
- total += largest;
- if (pFirst == NULL)
- pFirst = p;
-
- if (pLast != NULL)
- *(void __near* __near*)pLast = p;
- pLast = p;
- }
-
- while (pFirst != NULL)
- {
- void __near* p = *(void __near* __near*)pFirst;
- _nfree(pFirst);
- pFirst = p;
- }
- return total;
-}
-
-void far* LargestFarFreeBlock(size_t* Size)
-{
- size_t s0, s1;
- void far* p;
-
- s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
- while (s0 && (p = _fmalloc(s0)) == NULL)
- s0 >>= 1;
-
- if (p)
- _ffree(p);
-
- s1 = s0 >> 1;
- while (s1)
- {
- if ((p = _fmalloc(s0 + s1)) != NULL)
- {
- s0 += s1;
- _ffree(p);
- }
- s1 >>= 1;
- }
- while (s0 && (p = _fmalloc(s0)) == NULL)
- s0 ^= s0 & -s0;
-
- *Size = s0;
- return p;
-}
-
-size_t _farcoreleft(void)
-{
- size_t total = 0;
- void far* pFirst = NULL;
- void far* pLast = NULL;
- for(;;)
- {
- size_t largest;
- void far* p = LargestFarFreeBlock(&largest);
- if (largest < sizeof(void far*))
- {
- if (p != NULL)
- _ffree(p);
- break;
- }
- *(void far* far*)p = NULL;
- total += largest;
- if (pFirst == NULL)
- pFirst = p;
-
- if (pLast != NULL)
- *(void far* far*)pLast = p;
- pLast = p;
- }
-
- while (pFirst != NULL)
- {
- void far* p = *(void far* far*)pFirst;
- _ffree(pFirst);
- pFirst = p;
- }
- return total;
-}
-
-void huge* LargestHugeFreeBlock(size_t* Size)
-{
- size_t s0, s1;
- void huge* p;
-
- s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
- while (s0 && (p = halloc((dword)s0, 1)) == NULL)
- s0 >>= 1;
-
- if (p)
- hfree(p);
-
- s1 = s0 >> 1;
- while (s1)
- {
- if ((p = halloc((dword)(s0 + s1), 1)) != NULL)
- {
- s0 += s1;
- hfree(p);
- }
- s1 >>= 1;
- }
- while (s0 && (p = halloc((dword)s0, 1)) == NULL)
- s0 ^= s0 & -s0;
-
- *Size = s0;
- return p;
-}
-
-size_t _hugecoreleft(void)
-{
- size_t total = 0;
- void huge* pFirst = NULL;
- void huge* pLast = NULL;
- for(;;)
- {
- size_t largest;
- void huge* p = LargestHugeFreeBlock(&largest);
- if (largest < sizeof(void huge*))
- {
- if (p != NULL)
- hfree(p);
- break;
- }
- *(void huge* huge*)p = NULL;
- total += largest;
- if (pFirst == NULL)
- pFirst = p;
-
- if (pLast != NULL)
- *(void huge* huge*)pLast = p;
- pLast = p;
- }
-
- while (pFirst != NULL)
- {
- void huge* p = *(void huge* huge*)pFirst;
- hfree(pFirst);
- pFirst = p;
- }
- return total;
-}
-
-/*void __based(__self)* LargestBasedFreeBlock(size_t* Size)
-{
- __segment segu;
- size_t s0, s1;
- void __based(__self)* p;
-
- s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
- while (s0 && (p = _bmalloc(segu, s0)) == NULL)
- s0 >>= 1;
-
- if (p)
- _ffree(p);
-
- s1 = s0 >> 1;
- while (s1)
- {
- if ((p = _bmalloc(segu, s0 + s1)) != NULL)
- {
- s0 += s1;
- _ffree(p);
- }
- s1 >>= 1;
- }
- while (s0 && (p = _bmalloc(segu, s0)) == NULL)
- s0 ^= s0 & -s0;
-
- *Size = s0;
- return p;
-}
-
-size_t _basedcoreleft(void)
-{
- __segment segu;
- size_t total = 0;
- void __based(segu)* pFirst = NULL;
- void __based(segu)* pLast = NULL;
- // allocate based heap\r
- segu = _bheapseg( 1024 );\r
- if( segu == _NULLSEG ) {\r
- printf( "Unable to allocate based heap\n" );
- return 0;\r
- //exit( 1 );\r
- }
- else
-
- for(;;)
- {
- size_t largest;
- void __based(segu)* p = LargestBasedFreeBlock(&largest);
- if (largest < sizeof(void far*))
- {
- if (p != NULL)
- _ffree(p);
- break;
- }
- *(void far* far*)p = NULL;
- total += largest;
- if (pFirst == NULL)
- pFirst = p;
-
- if (pLast != NULL)
- *(void far* far*)pLast = p;
- pLast = p;
- }
-
- while (pFirst != NULL)
- {
- void far* p = *(void far* far*)pFirst;
- _ffree(pFirst);
- pFirst = p;
- }
- return total;
-}*/
-
-size_t GetFreeSize(void)
-{
- struct _heapinfo h_info;
- int heap_status;
- size_t h_free=0, h_total=0, h_used=0;
-
- h_info._pentry = NULL;
- for(;;) {
- heap_status = _heapwalk( &h_info );
- if( heap_status != _HEAPOK ) break;
- if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") h_free += h_info._size;
- if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") h_used += h_info._size;
- h_total += h_info._size;
- }
- heapstat(heap_status);
- return h_free;
-}
-
-size_t GetFarFreeSize(void)
-{
- struct _heapinfo fh_info;
- int heap_status;
- size_t fh_free=0, fh_total=0, fh_used=0;
-
- fh_info._pentry = NULL;
- for(;;) {
- heap_status = _fheapwalk( &fh_info );
- if( heap_status != _HEAPOK ) break;
- if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") fh_free += fh_info._size;
- if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") fh_used += fh_info._size;
- fh_total += fh_info._size;
- }
- heapstat(heap_status);
- return fh_free;
-}
-
-size_t GetNearFreeSize(void)
-{
- struct _heapinfo nh_info;
- int heap_status;
- size_t nh_free=0, nh_total=0, nh_used=0;
-
- nh_info._pentry = NULL;
- for(;;) {
- heap_status = _nheapwalk( &nh_info );
- if( heap_status != _HEAPOK ) break;
- if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") nh_free += nh_info._size;
- if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") nh_used += nh_info._size;
- nh_total += nh_info._size;
- }
- heapstat(heap_status);
- return nh_free;
-}
-
-long int
+/* Project 16 Source Code~\r
+ * Copyright (C) 2012-2018 sparky4 & pngwen & andrius4669 & joncampbell123 & yakui-lover\r
+ *\r
+ * This file is part of Project 16.\r
+ *\r
+ * Project 16 is free software; you can redistribute it and/or modify\r
+ * it under the terms of the GNU General Public License as published by\r
+ * the Free Software Foundation; either version 3 of the License, or\r
+ * (at your option) any later version.\r
+ *\r
+ * Project 16 is distributed in the hope that it will be useful,\r
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
+ * GNU General Public License for more details.\r
+ *\r
+ * You should have received a copy of the GNU General Public License\r
+ * along with this program. If not, see <http://www.gnu.org/licenses/>, or\r
+ * write to the Free Software Foundation, Inc., 51 Franklin Street,\r
+ * Fifth Floor, Boston, MA 02110-1301 USA.\r
+ *\r
+ */\r
+\r
+#include "src/lib/16_head.h"\r
+\r
+//cpu reg stuff for _AX, _BX, _CX, _DX\r
+#ifdef __WATCOMC__\r
+union regs CPURegs;\r
+#endif\r
+\r
+// big global status text buffer\r
+char global_temp_status_text[512];\r
+char global_temp_status_text2[512];\r
+\r
+long int\r
filesize(FILE *fp)\r
{\r
long int save_pos, size_of_file;\r
size_of_file = ftell(fp);\r
fseek(fp, save_pos, SEEK_SET);\r
return(size_of_file);\r
-}
-
-void print_normal_entry(char *text, dword total, dword used, dword free)
-{
- printf("%-17s", text);
- convert("%8sB ", total);
- convert("%9sB ", used);
- convert("%9sB\n", free);
-}
-
-/*
- * As for printf(), but format may only contain a single format specifier,
- * which must be "%s" and is replaced with the string form of num with commas
- * separating groups of three digits.
- *
- * e.g. convert("%s bytes", 1234567) -> "1,234,567 bytes"
- */
-void convert(const char *format, dword num)
-{
- int c, i, j, n;
- char des[4*sizeof(dword)+3];
- union REGS regs;
- struct SREGS sregs;
- char mycountry[48]; /* probably 34 bytes are enough... */
- char ksep = ','; /* or . */
-
- regs.x.ax = 0x3800;
- sregs.ds = FP_SEG(&mycountry);
- regs.x.dx = FP_OFF(&mycountry);
- intdosx(®s,®s,&sregs);
- if (regs.x.cflag == 0) {
- ksep = mycountry[7]; /* 1000's separator */
- /* dsep = mycountry[9]; ** decimal separator */
- }
-
- n = sprintf(des, "%lu", num);
- /* insert commas in the string */
- c = 3;
- for (i = n - 3; i > 0; i--) {
- if (c%3==0) {
- for (j = n; j >= i; j--)
- des[j+1] = des[j];
- des[i]=ksep; /* ',' */
- n++;
- }
- c++;
- }
- printf(format, des);
-}
-
-void heapdump(void)
-{
- struct _heapinfo fh_info, nh_info, h_info;
- int heap_status;
- size_t h_free, nh_free, fh_free, h_total, nh_total, fh_total, h_used, nh_used, fh_used;
-
- printf("\n == default ==\n\n");
- h_info._pentry = NULL;
- h_free=0; h_total=0; h_used=0;
- for(;;) {
- heap_status = _heapwalk( &h_info );
- if( heap_status != _HEAPOK ) break;
- printf( " %s block at %Fp of size %4.4X\n",
-(h_info._useflag == _USEDENTRY ? "USED" : "FREE"),
-h_info._pentry, h_info._size );
- if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") h_free += h_info._size;
- if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") h_used += h_info._size;
- h_total += h_info._size;
- }
- heapstat(heap_status);
-
- //near
- printf("\n == near ==\n\n");
- nh_info._pentry = NULL;
- nh_free=0; nh_total=0; nh_used=0;
- for(;;) {
- heap_status = _nheapwalk( &nh_info );
- if( heap_status != _HEAPOK ) break;
- printf( " %s block at %Fp of size %4.4X\n",
-(nh_info._useflag == _USEDENTRY ? "USED" : "FREE"),
-nh_info._pentry, nh_info._size );
- if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") nh_free += nh_info._size;
- if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") nh_used += nh_info._size;
- nh_total += nh_info._size;
- }
- heapstat(heap_status);
-
- //far
- printf("\n == far ==\n\n");
- fh_info._pentry = NULL;
- fh_free=0; fh_total=0; fh_used=0;
- for(;;) {
- heap_status = _fheapwalk( &fh_info );
- if( heap_status != _HEAPOK ) break;
- printf( " %s block at %Fp of size %4.4X\n",
-(fh_info._useflag == _USEDENTRY ? "USED" : "FREE"),
-fh_info._pentry, fh_info._size );
- if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") fh_free += fh_info._size;
- if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") fh_used += fh_info._size;
- fh_total += fh_info._size;
- }
- heapstat(heap_status);
-
-printf("\n");
-printf(kittengets(2,0,"Memory Type Total Used Free\n"));
-printf( "---------------- -------- -------- --------\n");
-print_normal_entry(kittengets(2,1,"Default"), (dword)h_total, (dword)h_used, (dword)h_free);
-print_normal_entry(kittengets(2,1,"Near"), (dword)nh_total, (dword)nh_used, (dword)nh_free);
-print_normal_entry(kittengets(2,1,"Far"), (dword)fh_total, (dword)fh_used, (dword)fh_free);
-printf( "---------------- -------- -------- --------\n");
-printf("coreleft = %lu\n", (dword)_coreleft());
-printf("farcoreleft = %lu\n", (dword)_farcoreleft());
-printf("GetFreeSize = %lu\n", (dword)GetFreeSize());
-printf("GetNearFreeSize = %lu\n", (dword)GetNearFreeSize());
-printf("GetFarFreeSize = %lu\n", (dword)GetFarFreeSize());
-printf("memavl = %lu\n", (dword)_memavl());
-printf("stackavail = %u\n", stackavail());
-}
-
-void heapstat(int heap_status)
-{
- switch( heap_status ) {
- case _HEAPEND:
- //printf( "OK - end of heap\n" );
- break;
- case _HEAPEMPTY:
- //printf( "OK - heap is empty\n" );
- break;
- case _HEAPBADBEGIN:
- printf( "ERROR - heap is damaged\n" );
- break;
- case _HEAPBADPTR:
- printf( "ERROR - bad pointer to heap\n" );
- break;
- case _HEAPBADNODE:
- printf( "ERROR - bad node in heap\n" );
- }
-}
-
-
+}\r
+\r
+// clrstdin() clear any leftover chars tha may be in stdin stream //\r
+void clrstdin()\r
+{\r
+ int ch = 0;\r
+ while( ( ch = getchar() ) != '\n' && ch != EOF );\r
+}\r
+\r
+//from http://stackoverflow.com/questions/2736753/how-to-remove-extension-from-file-name\r
+// remove_ext: removes the "extension" from a file spec.\r
+// mystr is the string to process.\r
+// dot is the extension separator.\r
+// sep is the path separator (0 means to ignore).\r
+// Returns an allocated string identical to the original but\r
+// with the extension removed. It must be freed when you're\r
+// finished with it.\r
+// If you pass in NULL or the new string can't be allocated,\r
+// it returns NULL.\r
+\r
+char *remove_ext (char* mystr, char dot, char sep) {\r
+ char *retstr, *lastdot, *lastsep;\r
+\r
+ // Error checks and allocate string.\r
+ if (mystr == NULL)\r
+ return NULL;\r
+ if ((retstr = malloc(strlen (mystr) + 1)) == NULL)\r
+ return NULL;\r
+\r
+ // Make a copy and find the relevant characters.\r
+\r
+ strcpy (retstr, mystr);\r
+ lastdot = strrchr (retstr, dot);\r
+ lastsep = (sep == 0) ? NULL : strrchr (retstr, sep);\r
+\r
+ // If it has an extension separator.\r
+\r
+ if (lastdot != NULL) {\r
+ // and it's before the extenstion separator.\r
+\r
+ if (lastsep != NULL) {\r
+ if (lastsep < lastdot) {\r
+ // then remove it.\r
+\r
+ *lastdot = '\0';\r
+ }\r
+ } else {\r
+ // Has extension separator with no path separator.\r
+\r
+ *lastdot = '\0';\r
+ }\r
+ }\r
+\r
+ // Return the modified string.\r
+ free(mystr);\r
+ return retstr;\r
+}\r
+\r
+\r
+//from http://quiz.geeksforgeeks.org/c-program-cyclically-rotate-array-one/\r
+void rotateR(byte *arr, byte n)\r
+{\r
+ byte x = arr[n-1], i;\r
+ for (i = n-1; i > 0; i--)\r
+ arr[i] = arr[i-1];\r
+ arr[0] = x;\r
+}\r
+\r
+void rotateL(byte *arr, byte n)\r
+{\r
+ byte x = arr[n+1], i;\r
+ for (i = n+1; i > 0; i++)\r
+ arr[i] = arr[i+1];\r
+ arr[0] = x;\r
+}\r
+\r
+void printmeminfoline(byte *strc, const byte *pee, size_t h_total, size_t h_used, size_t h_free)\r
+{\r
+ byte str[64];\r
+ strcat(strc,pee); strcat(strc," "); ultoa((dword)h_total,str,10); strcat(strc,str);\r
+ if(strlen(str)<=4) strcat(strc," "); //printf("%u\n", strlen(str));\r
+ strcat(strc," "); ultoa((dword)h_used,str,10); strcat(strc,str); strcat(strc," "); strcat(strc," ");\r
+ ultoa((dword)h_free,str,10); strcat(strc,str);\r
+ strcat(strc,"\n");\r
+}\r
+\r
///////////////////////////////////////////////////////////////////////////\r
//\r
// US_CheckParm() - checks to see if a string matches one of a set of\r
}\r
}\r
return(-1);\r
-}
-
-/*\r
-==========================\r
-=\r
-= Quit\r
-=\r
-==========================\r
-*/\r
-\r
-/*void Quit(char *error, ...)\r
-{\r
- short exit_code=0;\r
- unsigned finscreen;\r
-\r
- va_list ap;\r
+}\r
\r
- va_start(ap,error);\r
+// for input test //\r
+byte dirchar(byte in)\r
+{\r
+ byte out;\r
+ switch(in)\r
+ {\r
+ case 0: //up\r
+ out = 0x1E;\r
+ break;\r
+ case 4: //down\r
+ out = 0x1F;\r
+ break;\r
+ case 1: //left\r
+ out = 0x11;\r
+ break;\r
+ case 3: //right\r
+ out = 0x10;\r
+ break;\r
+ default: //null\r
+ out = 0xB3;\r
+ break;\r
+ }\r
+ return out;\r
+}\r
\r
-#ifndef CATALOG\r
- if (!error)\r
+//from: http://stackoverflow.com/questions/5349896/print-a-struct-in-c\r
+void print_mem(void const *vp, size_t n)\r
+{\r
+ size_t i;\r
+ unsigned char const *p = vp;\r
+ for (i=0; i<n; i++)\r
{\r
- CA_SetAllPurge ();\r
- CA_CacheGrChunk (PIRACY);\r
- finscreen = (unsigned)grsegs[PIRACY];\r
+ printf("%02x", p[i]);\r
+ //printf("%c", p[i]);\r
+ if((!(i%16)) && i) printf("\n");\r
+ else printf(" ");\r
+ //printf("%u%%40=%u\n", i, i%40);\r
}\r
-#endif\r
+ putchar('\n');\r
+ printf("\nstruct size is %zu bytes\n", n);\r
+};\r
\r
- //ShutdownId ();\r
+//from: https://groups.google.com/forum/#!topic/comp.lang.asm.x86/QtuVXl43nDo\r
+void hres (void)\r
+{\r
+ __asm {\r
+ mov ax,3\r
+ int 10h\r
+ mov ax,1112h\r
+ xor bx,bx\r
+ int 10h\r
+ }\r
+}\r
\r
- if (error && *error)\r
- {\r
- vprintf(error,ap);\r
- exit_code = 1;\r
+#define REGIDUMP_HEX\r
+#define REGIDUMP_DUMPFLAGS\r
+//#define REGIDUMP_USE_CAPS //uncomment to use the assembly\r
+//regester dump~\r
+void regidump()\r
+{\r
+ //GENERAL PURPOSE\r
+ unsigned short _ax,_bx,_cx,_dx;\r
+ unsigned short _cflag;\r
+ unsigned char _al,_ah,_bl,_bh,_cl,_ch,_dl,_dh;\r
+\r
+ unsigned short _bp,_si,_di,_sp;\r
+\r
+ unsigned short _cs,_ds,_es,_ss; //SEGMENT\r
+// unsigned short _ip; //SPECIAL PURPOSE\r
+ _ax=_bx=_cx=_dx=_si=_di=_bp=_sp=_cs=_ds=_es=_ss=_cflag=0;\r
+ _ah=_al=_bh=_bl=_ch=_cl=_dh=_dl=0;\r
+\r
+#ifndef REGIDUMP_USE_CAPS\r
+ __asm {\r
+ mov _ax,ax\r
+ mov _bx,bx\r
+ mov _cx,cx\r
+ mov _dx,dx\r
+\r
+ mov _si,si\r
+ mov _di,di\r
+\r
+ /*mov _ip,ip\r
+\r
+ mov _cf,cf\r
+ mov _pf,pf\r
+ mov _af,af\r
+ mov _zf,zf\r
+ mov _sf,sf\r
+ mov _tf,tf\r
+ mov _if,if\r
+ mov _df,df\r
+ mov _of,of*/\r
}\r
-#ifndef CATALOG\r
- else\r
- if (!NoWait)\r
- {\r
- movedata (finscreen,0,0xb800,0,4000);\r
- bioskey (0);\r
+#else\r
+_ax=_AX;\r
+_bx=_BX;\r
+_cx=_CX;\r
+_dx=_DX;\r
+\r
+_si=_SI;\r
+_di=_DI;\r
+\r
+_ah=_AH;\r
+_al=_AL;\r
+_bh=_BH;\r
+_bl=_BL;\r
+_ch=_CH;\r
+_cl=_CL;\r
+_dh=_DH;\r
+_dl=_DL;\r
+#endif\r
+ _cflag=_CFLAG;\r
+ __asm {\r
+ mov _bp,bp\r
+ mov _sp,sp\r
+\r
+ mov _cs,cs\r
+ mov _ds,ds\r
+ mov _es,es\r
+ mov _ss,ss\r
}\r
+// printf("integer values: ax=%04d bx=%04d cx=%04d dx=%04d\n", a, b, c, d);\r
+// printf("unsigned values:ax=%04u bx=%04u cx=%04u dx=%04u\n", a, b, c, d);\r
+ printf("================================================================================");\r
+ printf("16 bit 8088 register values\n");\r
+ printf("================================================================================");\r
+ printf("general purpose:\n");\r
+#ifndef REGIDUMP_HEX\r
+ printf(" ax=%04u\n bx=%04u\n cx=%04u\n dx=%04u\n\n", _ax, _bx, _cx, _dx);\r
+ printf(" si=%04u\n di=%04u\n bp=%04u\n sp=%04u\n", _si, _di, _bp, _sp);\r
+#else\r
+ printf(" ax=%04x\n bx=%04x\n cx=%04x\n dx=%04x\n\n", _ax, _bx, _cx, _dx);\r
+ printf(" si=%04x\n di=%04x\n bp=%04x\n sp=%04x\n", _si, _di, _bp, _sp);\r
#endif\r
+ printf(" ---------------------------------------\n");\r
\r
- va_end(ap);\r
\r
-#ifndef CATALOG\r
- if (!error)\r
- {\r
- _argc = 2;\r
- _argv[1] = "LAST.SHL";\r
- _argv[2] = "ENDSCN.SCN";\r
- _argv[3] = NULL;\r
- if (execv("LOADSCN.EXE", _argv) == -1)\r
- {\r
- clrscr();\r
- puts("Couldn't find executable LOADSCN.EXE.\n");\r
- exit(1);\r
- }\r
- }\r
+\r
+ printf("segment:\n");\r
+#ifndef REGIDUMP_HEX\r
+ printf(" cs=%04u\n ds=%04u\n es=%04u\n ss=%04u\n", _cs, _ds, _es, _ss);\r
+#else\r
+ printf(" cs=%04x\n ds=%04x\n es=%04x\n ss=%04x\n", _cs, _ds, _es, _ss);\r
+#endif\r
+ printf(" ---------------------------------------\n");\r
+\r
+\r
+\r
+ printf("cflags:\n");\r
+/* printf(" ip=%04u\n\n", _ip);\r
+ printf(" cf=%04u\npf=%04u\naf=%04u\nzf=%04u\nsf=%04u\ntf=%04u\nif=%04u\ndf=%04u\nof=%04u\n", _cf, _pf, _af, _zf, _sf, _tf, _if, _df, _of);\r
+ printf(" ---------------------------------------\n");*/\r
+#ifdef REGIDUMP_DUMPFLAGS\r
+#ifndef REGIDUMP_HEX\r
+// printf(" ip=%04u\n\n", _IP);\r
+// printf(" cf=%04u\npf=%04u\naf=%04u\nzf=%04u\nsf=%04u\ntf=%04u\nif=%04u\ndf=%04u\nof=%04u\n", _CF, _PF, _AF, _ZF, _SF, _TF, _IF, _DF, _OF);\r
+#else\r
+// printf(" ip=%04x\n\n", _IP);\r
+// printf(" cf=%04x\npf=%04x\naf=%04x\nzf=%04x\nsf=%04x\ntf=%04x\nif=%04x\ndf=%04x\nof=%04x\n", _CF, _PF, _AF, _ZF, _SF, _TF, _IF, _DF, _OF);\r
+ printf("cflag: "BYTE_TO_BINARY_PATTERN""BYTE_TO_BINARY_PATTERN"\n", BYTE_TO_BINARY(_cflag>>8), BYTE_TO_BINARY(_cflag));\r
+// printf("cflag: %s\n",(_cflag));\r
+ printf("dx: "NIBBLE_TO_BINARY_PATTERN""NIBBLE_TO_BINARY_PATTERN"\n", NIBBLE_TO_BINARY(_dx>>4), NIBBLE_TO_BINARY(_dx));\r
+#endif\r
+ printf("dx: "BYTE_TO_BINARY_PATTERN""BYTE_TO_BINARY_PATTERN"\n", BYTE_TO_BINARY(_dx>>8), BYTE_TO_BINARY(_dx));\r
+ printf(" ---------------------------------------\n");\r
#endif\r
\r
- exit(exit_code);\r
-}*/
+ printf("for more info see\n http://stackoverflow.com/questions/9130349/how-many-registers-are-there-in-8086-8088\n");\r
+ printf("================================================================================");\r
+}\r
projects / 16.git / blobdiff