#include "src/lib/16_hc.h"\r
#include <malloc.h>\r
\r
-#ifdef __BORLANDC__\r
-void * LargestFreeBlock(size_t* Size)\r
-#endif\r
-#ifdef __WATCOMC__\r
-void __near* LargestFreeBlock(size_t* Size)\r
-#endif\r
+//functions\r
+void CHIKAKU* HC_LargestFreeBlock(size_t* Size)\r
{\r
size_t s0, s1;\r
-#ifdef __BORLANDC__\r
- void * p;\r
-#endif\r
-#ifdef __WATCOMC__\r
- void __near* p;\r
-#endif\r
+ void CHIKAKU* p;\r
\r
s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);\r
-#ifdef __BORLANDC__\r
- while (s0 && (p = malloc(s0)) == NULL)\r
-#endif\r
-#ifdef __WATCOMC__\r
while (s0 && (p = _nmalloc(s0)) == NULL)\r
-#endif\r
s0 >>= 1;\r
\r
if (p)\r
-#ifdef __BORLANDC__\r
- free(p);\r
-#endif\r
-#ifdef __WATCOMC__\r
_nfree(p);\r
-#endif\r
\r
s1 = s0 >> 1;\r
while (s1)\r
{\r
-#ifdef __BORLANDC__\r
- if ((p = malloc(s0 + s1)) != NULL)\r
-#endif\r
-#ifdef __WATCOMC__\r
if ((p = _nmalloc(s0 + s1)) != NULL)\r
-#endif\r
{\r
s0 += s1;\r
-#ifdef __BORLANDC__\r
- free(p);\r
-#endif\r
-#ifdef __WATCOMC__\r
_nfree(p);\r
-#endif\r
}\r
s1 >>= 1;\r
}\r
-#ifdef __BORLANDC__\r
- while (s0 && (p = malloc(s0)) == NULL)\r
-#endif\r
-#ifdef __WATCOMC__\r
while (s0 && (p = _nmalloc(s0)) == NULL)\r
-#endif\r
s0 ^= s0 & -s0;\r
\r
*Size = s0;\r
return p;\r
}\r
\r
-size_t _coreleft(void)\r
+size_t HC_coreleft(void)\r
{\r
size_t total = 0;\r
- void __near* pFirst = NULL;\r
- void __near* pLast = NULL;\r
+ void CHIKAKU* pFirst = NULL;\r
+ void CHIKAKU* pLast = NULL;\r
for(;;)\r
{\r
size_t largest;\r
- void __near* p = (void __near *)LargestFreeBlock(&largest);\r
- if (largest < sizeof(void __near*))\r
+ void CHIKAKU* p = (void CHIKAKU *)HC_LargestFreeBlock(&largest);\r
+ if (largest < sizeof(void CHIKAKU*))\r
{\r
if (p != NULL)\r
-#ifdef __BORLANDC__\r
- free(p);\r
-#endif\r
-#ifdef __WATCOMC__\r
_nfree(p);\r
-#endif\r
+\r
break;\r
}\r
- *(void __near* __near*)p = NULL;\r
+ *(void CHIKAKU* CHIKAKU*)p = NULL;\r
total += largest;\r
if (pFirst == NULL)\r
pFirst = p;\r
\r
if (pLast != NULL)\r
- *(void __near* __near*)pLast = p;\r
+ *(void CHIKAKU* CHIKAKU*)pLast = p;\r
pLast = p;\r
}\r
\r
while (pFirst != NULL)\r
{\r
- void __near* p = *(void __near* __near*)pFirst;\r
-#ifdef __BORLANDC__\r
- free(pFirst);\r
-#endif\r
-#ifdef __WATCOMC__\r
+ void CHIKAKU* p = *(void CHIKAKU* CHIKAKU*)pFirst;\r
_nfree(pFirst);\r
-#endif\r
+\r
pFirst = p;\r
}\r
return total;\r
}\r
\r
-void far* LargestFarFreeBlock(size_t* Size)\r
+void far* HC_LargestFarFreeBlock(size_t* Size)\r
{\r
size_t s0, s1;\r
void far* p;\r
return p;\r
}\r
\r
-size_t _farcoreleft(void)\r
+size_t HC_farcoreleft(void)\r
{\r
size_t total = 0;\r
void far* pFirst = NULL;\r
for(;;)\r
{\r
size_t largest;\r
- void far* p = LargestFarFreeBlock(&largest);\r
+ void far* p = HC_LargestFarFreeBlock(&largest);\r
if (largest < sizeof(void far*))\r
{\r
if (p != NULL)\r
}\r
\r
#ifdef __WATCOMC__\r
-void huge* LargestHugeFreeBlock(size_t* Size)\r
+/*\r
+void huge* HC_LargestHugeFreeBlock(size_t* Size)\r
{\r
size_t s0, s1;\r
void huge* p;\r
return p;\r
}\r
\r
-size_t _hugecoreleft(void)\r
+size_t HC_hugecoreleft(void)\r
{\r
size_t total = 0;\r
void huge* pFirst = NULL;\r
for(;;)\r
{\r
size_t largest;\r
- void huge* p = LargestHugeFreeBlock(&largest);\r
+ void huge* p = HC_LargestHugeFreeBlock(&largest);\r
if (largest < sizeof(void huge*))\r
{\r
if (p != NULL)\r
return total;\r
}\r
\r
-/*void __based(__self)* LargestBasedFreeBlock(size_t* Size)\r
+void __based(__self)* LargestBasedFreeBlock(size_t* Size)\r
{\r
__segment segu;\r
size_t s0, s1;\r
return total;\r
}*/\r
\r
-size_t GetFreeSize(void)\r
+size_t HC_GetFreeSize(void)\r
{\r
struct _heapinfo h_info;\r
int heap_status;\r
if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") h_used += h_info._size;\r
h_total += h_info._size;\r
}\r
- heapstat0(heap_status);\r
+ HC_heapstat0(heap_status);\r
return h_free;\r
}\r
\r
-size_t GetFarFreeSize(void)\r
+size_t HC_GetFarFreeSize(void)\r
{\r
struct _heapinfo fh_info;\r
int heap_status;\r
if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") fh_used += fh_info._size;\r
fh_total += fh_info._size;\r
}\r
- heapstat0(heap_status);\r
+ HC_heapstat0(heap_status);\r
return fh_free;\r
}\r
\r
-size_t GetNearFreeSize(void)\r
+size_t HC_GetNearFreeSize(void)\r
{\r
struct _heapinfo nh_info;\r
int heap_status;\r
if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") nh_used += nh_info._size;\r
nh_total += nh_info._size;\r
}\r
- heapstat0(heap_status);\r
+ HC_heapstat0(heap_status);\r
return nh_free;\r
}\r
\r
-void heapdump(global_game_variables_t *gvar)\r
+void HC_heapdump(global_game_variables_t *gvar)\r
{\r
struct _heapinfo fh_info, nh_info, h_info;\r
int heap_status;\r
h_total += h_info._size;\r
write(gvar->handle.heaphandle,scratch,strlen(scratch));\r
}\r
- heapstat(gvar, heap_status, &scratch);\r
+ HC_heapstat(gvar, heap_status, &scratch);\r
\r
//near\r
strcpy(scratch,"\n == near ==\n\n");\r
nh_total += nh_info._size;\r
write(gvar->handle.heaphandle,scratch,strlen(scratch));\r
}\r
- heapstat(gvar, heap_status, &scratch);\r
+ HC_heapstat(gvar, heap_status, &scratch);\r
\r
//far\r
strcpy(scratch,"\n == far ==\n\n");\r
fh_total += fh_info._size;\r
write(gvar->handle.heaphandle,scratch,strlen(scratch));\r
}\r
- heapstat(gvar, heap_status, &scratch);\r
+ HC_heapstat(gvar, heap_status, &scratch);\r
\r
strcpy(scratch,"\n");\r
strcat(scratch,kittengets(2,0,"Memory Type Total Used Free\n"));\r
printmeminfoline(&scratch, "Near", nh_total, nh_used, nh_free);\r
printmeminfoline(&scratch, "Far", fh_total, fh_used, fh_free);\r
strcat(scratch,"---------------- -------- -------- --------\n");\r
- strcat(scratch,"coreleft = "); ultoa((dword)_coreleft(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
- strcat(scratch,"farcoreleft = "); ultoa((dword)_farcoreleft(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
- strcat(scratch,"GetFreeSize = "); ultoa((dword)GetFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
- strcat(scratch,"GetNearFreeSize = "); ultoa((dword)GetNearFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
- strcat(scratch,"GetFarFreeSize = "); ultoa((dword)GetFarFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
+ strcat(scratch,"coreleft = "); ultoa((dword)HC_coreleft(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
+ strcat(scratch,"farcoreleft = "); ultoa((dword)HC_farcoreleft(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
+ strcat(scratch,"GetFreeSize = "); ultoa((dword)HC_GetFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
+ strcat(scratch,"GetNearFreeSize = "); ultoa((dword)HC_GetNearFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
+ strcat(scratch,"GetFarFreeSize = "); ultoa((dword)HC_GetFarFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
strcat(scratch,"memavl = "); ultoa((dword)_memavl(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
strcat(scratch,"stackavail = "); ultoa((dword)stackavail(),str,10); strcat(scratch,str); strcat(scratch,"\n");\r
write(gvar->handle.heaphandle,scratch,strlen(scratch));\r
HC_CloseDebug(gvar);\r
}\r
\r
-void heapstat(global_game_variables_t *gvar, int heap_status, byte *str)\r
+void HC_heapstat(global_game_variables_t *gvar, int heap_status, byte *str)\r
{\r
switch( heap_status ) {\r
case _HEAPEND:\r
write(gvar->handle.heaphandle,(str),strlen((str)));\r
}\r
\r
-void heapstat0(int heap_status)\r
+void HC_heapstat0(int heap_status)\r
{\r
switch( heap_status ) {\r
case _HEAPEND:\r