X-Git-Url: http://4ch.mooo.com/gitweb/?a=blobdiff_plain;f=src%2Flib%2F16_hc.c;h=271f4c1a059d94fa835b78e460a1eea5073542b3;hb=6021fc3f27b895d382fbd30488ead35657e39196;hp=3bd47bb8801d6acb10e7ed848ade71f0c440a16e;hpb=25dd42920069d35d6ae44c21b1222e63143c84e8;p=16.git

diff --git a/src/lib/16_hc.c b/src/lib/16_hc.c
index 3bd47bb8..271f4c1a 100755
--- a/src/lib/16_hc.c
+++ b/src/lib/16_hc.c
@@ -1,5 +1,5 @@
 /* Project 16 Source Code~
- * Copyright (C) 2012-2017 sparky4 & pngwen & andrius4669 & joncampbell123 & yakui-lover
+ * Copyright (C) 2012-2018 sparky4 & pngwen & andrius4669 & joncampbell123 & yakui-lover
  *
  * This file is part of Project 16.
  *
@@ -20,7 +20,7 @@
  *
  */
 /*
-	heap test stuff
+	heap check
 */
 
 #include "src/lib/16_hc.h"
@@ -51,72 +51,37 @@ long HC_Newfarcoreleft()
 }
 #endif
 
-void
-#ifdef __BORLANDC__
- *
-#endif
-#ifdef __WATCOMC__
- __near*
-#endif
-HC_LargestFreeBlock(size_t* Size)
+//from: https://stackoverflow.com/questions/14386856/c-check-available-ram
+void NPTR* HC_LargestFreeBlock(size_t* Size)
 {
 	size_t s0, s1;
-#ifdef __BORLANDC__
-	void * p;
-#endif
-#ifdef __WATCOMC__
-	void __near* p;
-#endif
+	void NPTR* p;
 
 	s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
-#ifdef __BORLANDC__
-	while (s0 && (p = malloc(s0)) == NULL)
-#endif
-#ifdef __WATCOMC__
 	while (s0 && (p = _nmalloc(s0)) == NULL)
-#endif
 		s0 >>= 1;
 
 	if (p)
-#ifdef __BORLANDC__
-		free(p);
-#endif
-#ifdef __WATCOMC__
 		_nfree(p);
-#endif
 
 	s1 = s0 >> 1;
 	while (s1)
 	{
-#ifdef __BORLANDC__
-		if ((p = malloc(s0 + s1)) != NULL)
-#endif
-#ifdef __WATCOMC__
 		if ((p = _nmalloc(s0 + s1)) != NULL)
-#endif
 		{
 			s0 += s1;
-#ifdef __BORLANDC__
-			free(p);
-#endif
-#ifdef __WATCOMC__
 			_nfree(p);
-#endif
 		}
 	s1 >>= 1;
 	}
-#ifdef __BORLANDC__
-	while (s0 && (p = malloc(s0)) == NULL)
-#endif
-#ifdef __WATCOMC__
 	while (s0 && (p = _nmalloc(s0)) == NULL)
-#endif
 		s0 ^= s0 & -s0;
 
 	*Size = s0;
 	return p;
 }
 
+//from: https://stackoverflow.com/questions/14386856/c-check-available-ram
 size_t HC_coreleft(void)
 {
 	size_t total = 0;
@@ -129,12 +94,7 @@ size_t HC_coreleft(void)
 		if (largest < sizeof(void __near*))
 		{
 			if (p != NULL)
-#ifdef __BORLANDC__
-			free(p);
-#endif
-#ifdef __WATCOMC__
 			_nfree(p);
-#endif
 			break;
 		}
 		*(void __near* __near*)p = NULL;
@@ -150,23 +110,19 @@ size_t HC_coreleft(void)
 	while (pFirst != NULL)
 	{
 		void __near* p = *(void __near* __near*)pFirst;
-#ifdef __BORLANDC__
-		free(pFirst);
-#endif
-#ifdef __WATCOMC__
 		_nfree(pFirst);
-#endif
 		pFirst = p;
 	}
 	return total;
 }
 
-void far* HC_LargestFarFreeBlock(unsigned long* Size)
+//far version of above
+void __far* HC_LargestFarFreeBlock(dword* Size)
 {
-	unsigned long s0, s1;
-	void far* p;
+	dword s0, s1;
+	void __far* p;
 
-	s0 = ~(unsigned long)0 ^ (~(unsigned long)0 >> 1);
+	s0 = ~(dword)0 ^ (~(dword)0 >> 1);
 	while (s0 && (p = _fmalloc(s0)) == NULL)
 		s0 >>= 1;
 
@@ -190,41 +146,44 @@ void far* HC_LargestFarFreeBlock(unsigned long* Size)
 	return p;
 }
 
-unsigned long HC_farcoreleft(void)
+//far version of above
+dword HC_farcoreleft(void)
 {
-	unsigned long total = 0UL;
-	void far* pFirst = NULL;
-	void far* pLast = NULL;
+	dword total = 0UL;
+	void __far* pFirst = NULL;
+	void __far* pLast = NULL;
 	for(;;)
 	{
-		unsigned long largest;
-		void far* p = HC_LargestFarFreeBlock(&largest);
-		if (largest < sizeof(void far*))
+		dword largest;
+		void __far* p = HC_LargestFarFreeBlock(&largest);
+		if (largest < sizeof(void __far*))
 		{
 			if (p != NULL)
 			_ffree(p);
 			break;
 		}
-		*(void far* far*)p = NULL;
+		*(void __far* __far*)p = NULL;
 		total += largest;
 		if (pFirst == NULL)
 			pFirst = p;
 
 		if (pLast != NULL)
-			*(void far* far*)pLast = p;
+			*(void __far* __far*)pLast = p;
 		pLast = p;
 	}
 
 	while (pFirst != NULL)
 	{
-		void far* p = *(void far* far*)pFirst;
+		void __far* p = *(void __far* __far*)pFirst;
 		_ffree(pFirst);
 		pFirst = p;
 	}
+
+	//if(total>16) total+=16;	total &= 0xfffffff0UL;
 	return total;
 }
 
-#ifdef __WATCOMC__
+//==#ifdef __WATCOMC__
 /*void huge* LargestHugeFreeBlock(size_t* Size)
 {
 	size_t s0, s1;
@@ -337,31 +296,31 @@ size_t _basedcoreleft(void)
 	{
 		size_t largest;
 		void __based(segu)* p = LargestBasedFreeBlock(&largest);
-		if (largest < sizeof(void far*))
+		if (largest < sizeof(void __far*))
 		{
 			if (p != NULL)
 			_ffree(p);
 			break;
 		}
-		*(void far* far*)p = NULL;
+		*(void __far* __far*)p = NULL;
 		total += largest;
 		if (pFirst == NULL)
 			pFirst = p;
 
 		if (pLast != NULL)
-			*(void far* far*)pLast = p;
+			*(void __far* __far*)pLast = p;
 		pLast = p;
 	}
 
 	while (pFirst != NULL)
 	{
-		void far* p = *(void far* far*)pFirst;
+		void __far* p = *(void __far* __far*)pFirst;
 		_ffree(pFirst);
 		pFirst = p;
 	}
 	return total;
-}*/
-#if 0
+}
+
 size_t HC_GetFreeSize(void)
 {
 	struct _heapinfo h_info;
@@ -376,16 +335,37 @@ size_t HC_GetFreeSize(void)
 		if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") h_used += h_info._size;
 		h_total += h_info._size;
 	}
-	HCL_heapstat0(heap_status);
+	HCL_heapstat(heap_status);
 	return h_free;
 }
-#endif
+*/
 
-unsigned long HC_GetFarFreeSize(void)
+void HCL_HeapWalking (struct _heapinfo *h_info, hc_use_t *hu, unsigned nearfarswitch)
 {
+	hu->h_free=0; hu->h_total=0; hu->h_used=0;
+
+	h_info->_pentry = NULL;
+	for(;;) {
+		if(nearfarswitch==0) hu->heap_status = _nheapwalk( h_info );
+		else if(nearfarswitch==1) hu->heap_status = _fheapwalk( h_info );
+		if( hu->heap_status != _HEAPOK ) break;
+		if((h_info->_useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") hu->h_free += h_info->_size;
+		if((h_info->_useflag == _USEDENTRY ? "USED" : "FREE")=="USED") hu->h_used += h_info->_size;
+		hu->h_total += h_info->_size;
+	}
+	HCL_heapstat(hu->heap_status);
+}
+
+dword HC_GetFarFreeSize(void)
+{
+	struct _heapinfo h_info;
+	hc_use_t hu;
+	HCL_HeapWalking (&h_info, &hu, 1);
+	return hu.h_free;
+#if 0
 	struct _heapinfo fh_info;
 	int heap_status;
-	unsigned long fh_free=0, fh_total=0, fh_used=0;
+	dword fh_free=0, fh_total=0, fh_used=0;
 
 	fh_info._pentry = NULL;
 	for(;;) {
@@ -395,12 +375,18 @@ unsigned long HC_GetFarFreeSize(void)
 		if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") fh_used += fh_info._size;
 		fh_total += fh_info._size;
 	}
-	HCL_heapstat0(heap_status);
+	HCL_heapstat(heap_status);
 	return fh_free;
+#endif
 }
 
 size_t HC_GetNearFreeSize(void)
 {
+	struct _heapinfo h_info;
+	hc_use_t hu;
+	HCL_HeapWalking (&h_info, &hu, 0);
+	return hu.h_free;
+#if 0
 	struct _heapinfo nh_info;
 	int heap_status;
 	size_t nh_free=0, nh_total=0, nh_used=0;
@@ -413,8 +399,9 @@ size_t HC_GetNearFreeSize(void)
 		if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") nh_used += nh_info._size;
 		nh_total += nh_info._size;
 	}
-	HCL_heapstat0(heap_status);
+	HCL_heapstat(heap_status);
 	return nh_free;
+#endif
 }
 
 void HC_heapdump(global_game_variables_t *gvar)
@@ -442,7 +429,7 @@ void HC_heapdump(global_game_variables_t *gvar)
 		h_total += h_info._size;
 		write(gvar->handle.heaphandle,scratch,strlen(scratch));
 	}
-	HCL_heapstat(gvar, heap_status, &scratch);
+	HCL_heapstatLogWrite(gvar, heap_status, scratch);
 #endif
 
 	//near
@@ -464,7 +451,7 @@ nh_info._pentry, nh_info._size );*/
 		nh_total += nh_info._size;
 		write(gvar->handle.heaphandle,scratch,strlen(scratch));
 	}
-	HCL_heapstat(gvar, heap_status, &scratch);
+	HCL_heapstatLogWrite(gvar, heap_status, scratch);
 
 	//far
 	strcpy(scratch,"\n	== far ==\n\n");
@@ -485,21 +472,23 @@ fh_info._pentry, fh_info._size );*/
 		fh_total += fh_info._size;
 		write(gvar->handle.heaphandle,scratch,strlen(scratch));
 	}
-	HCL_heapstat(gvar, heap_status, &scratch);
+	HCL_heapstatLogWrite(gvar, heap_status, scratch);
 
 	strcpy(scratch,"\n");
 	strcat(scratch,kittengets(2,0,"Memory Type         Total      Used       Free\n"));
 	strcat(scratch,"----------------  --------   --------   --------\n");
-//	printmeminfoline(&scratch, "Default", h_total, h_used, h_free);
-	printmeminfoline(&scratch, "Near", nh_total, nh_used, nh_free);
-	printmeminfoline(&scratch, "Far", fh_total, fh_used, fh_free);
+//--	printmeminfoline(&scratch, "Default", h_total, h_used, h_free);
+	printmeminfoline(scratch, "Near", nh_total, nh_used, nh_free);
+	printmeminfoline(scratch, "Far", fh_total, fh_used, fh_free);
 	strcat(scratch,"----------------  --------   --------   --------\n");
+#if defined(__LARGE__) || defined(__COMPACT__) || defined(__HUGE__)
 	strcat(scratch,"HC_coreleft = ");			ultoa((dword)HC_coreleft(),str,10);			strcat(scratch,str);	strcat(scratch,"\n");
 	strcat(scratch,"HC_farcoreleft = ");			ultoa((dword)HC_farcoreleft(),str,10);		strcat(scratch,str);	strcat(scratch,"\n");
-//	strcat(scratch,"HC_Newfarcoreleft = ");		ultoa((dword)HC_Newfarcoreleft(),str,10);		strcat(scratch,str);	strcat(scratch,"\n");
-//	strcat(scratch,"HC_GetFreeSize = ");		ultoa((dword)HC_GetFreeSize(),str,10);		strcat(scratch,str);	strcat(scratch,"\n");
-	strcat(scratch,"HC_GetNearFreeSize = ");	ultoa((dword)HC_GetNearFreeSize(),str,10);	strcat(scratch,str);	strcat(scratch,"\n");
-	strcat(scratch,"HC_GetFarFreeSize = "); 	ultoa((dword)HC_GetFarFreeSize(),str,10);	strcat(scratch,str);	strcat(scratch,"\n");
+#endif
+//--	strcat(scratch,"HC_Newfarcoreleft = ");		ultoa((dword)HC_Newfarcoreleft(),str,10);		strcat(scratch,str);	strcat(scratch,"\n");
+//--	strcat(scratch,"HC_GetFreeSize = ");		ultoa((dword)HC_GetFreeSize(),str,10);		strcat(scratch,str);	strcat(scratch,"\n");
+//00	strcat(scratch,"HC_GetNearFreeSize = ");	ultoa((dword)HC_GetNearFreeSize(),str,10);	strcat(scratch,str);	strcat(scratch,"\n");
+//00	strcat(scratch,"HC_GetFarFreeSize = "); 	ultoa((dword)HC_GetFarFreeSize(),str,10);	strcat(scratch,str);	strcat(scratch,"\n");
 	strcat(scratch,"coreleft = ");				ultoa((dword)coreleft(),str,10);				strcat(scratch,str);	strcat(scratch,"\n");
 	strcat(scratch,"farcoreleft = ");			ultoa((dword)farcoreleft(),str,10);			strcat(scratch,str);	strcat(scratch,"\n");
 	strcat(scratch,"stackavail = ");			ultoa((dword)stackavail(),str,10);			strcat(scratch,str);	strcat(scratch,"\n");
@@ -507,7 +496,7 @@ fh_info._pentry, fh_info._size );*/
 	HC_CloseDebug(gvar);
 }
 
-void HCL_heapstat(global_game_variables_t *gvar, int heap_status, byte *str)
+void HCL_heapstatLogWrite(global_game_variables_t *gvar, int heap_status, byte *str)
 {
 	switch( heap_status ) {
 		case _HEAPEND:
@@ -520,16 +509,18 @@ void HCL_heapstat(global_game_variables_t *gvar, int heap_status, byte *str)
 		case _HEAPBADBEGIN:
 			strcpy((str),"ERROR - heap is damaged\n");
 		break;
+#ifdef __WATCOMC__
 		case _HEAPBADPTR:
 			strcpy((str),"ERROR - bad pointer to heap\n");
 		break;
+#endif
 		case _HEAPBADNODE:
 			strcpy((str),"ERROR - bad node in heap\n");
 	}
 	write(gvar->handle.heaphandle,(str),strlen((str)));
 }
 
-void HCL_heapstat0(int heap_status)
+void HCL_heapstat(int heap_status)
 {
 	switch( heap_status ) {
 		case _HEAPEND:
@@ -541,22 +532,37 @@ void HCL_heapstat0(int heap_status)
 		case _HEAPBADBEGIN:
 			printf("ERROR - heap is damaged\n");
 		break;
+#ifdef __WATCOMC__
 		case _HEAPBADPTR:
 			printf("ERROR - bad pointer to heap\n");
 		break;
+#endif
 		case _HEAPBADNODE:
 			printf("ERROR - bad node in heap\n");
 	}
 }
 
-unsigned long farcoreleft()
+//++
+#ifdef __WATCOMC__
+dword farcoreleft()
 {
 //----	_fheapgrow();
+// #ifdef __BORLANDC__
+// 	return 0x90000UL-16UL;
+// #endif
+
+#if !defined(__LARGE__) && !defined(__COMPACT__) && !defined(__HUGE__)
+//----
+	return 0x90000UL+16UL;
+//----	return 589824UL+16UL;
+#else
+//++++
 	return HC_farcoreleft();
 //stack overflows	return HC_GetFarFreeSize();
+#endif
 }
 
-unsigned long coreleft()
+dword coreleft()
 {
 	_nheapgrow();
 	return _memavl();