1 /* Project 16 Source Code~
2 * Copyright (C) 2012-2015 sparky4 & pngwen & andrius4669
4 * This file is part of Project 16.
6 * Project 16 is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 3 of the License, or
9 * (at your option) any later version.
11 * Project 16 is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>, or
18 * write to the Free Software Foundation, Inc., 51 Franklin Street,
19 * Fifth Floor, Boston, MA 02110-1301 USA.
26 #include "src/lib/16_hc.h"
31 void * LargestFreeBlock(size_t* Size)
34 void __near* LargestFreeBlock(size_t* Size)
45 s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
47 while (s0 && (p = malloc(s0)) == NULL)
50 while (s0 && (p = _nmalloc(s0)) == NULL)
66 if ((p = malloc(s0 + s1)) != NULL)
69 if ((p = _nmalloc(s0 + s1)) != NULL)
83 while (s0 && (p = malloc(s0)) == NULL)
86 while (s0 && (p = _nmalloc(s0)) == NULL)
94 size_t _coreleft(void)
97 void __near* pFirst = NULL;
98 void __near* pLast = NULL;
102 void __near* p = (void __near *)LargestFreeBlock(&largest);
103 if (largest < sizeof(void __near*))
114 *(void __near* __near*)p = NULL;
120 *(void __near* __near*)pLast = p;
124 while (pFirst != NULL)
126 void __near* p = *(void __near* __near*)pFirst;
138 void far* LargestFarFreeBlock(size_t* Size)
143 s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
144 while (s0 && (p = _fmalloc(s0)) == NULL)
153 if ((p = _fmalloc(s0 + s1)) != NULL)
160 while (s0 && (p = _fmalloc(s0)) == NULL)
167 size_t _farcoreleft(void)
170 void far* pFirst = NULL;
171 void far* pLast = NULL;
175 void far* p = LargestFarFreeBlock(&largest);
176 if (largest < sizeof(void far*))
182 *(void far* far*)p = NULL;
188 *(void far* far*)pLast = p;
192 while (pFirst != NULL)
194 void far* p = *(void far* far*)pFirst;
202 void huge* LargestHugeFreeBlock(size_t* Size)
207 s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
208 while (s0 && (p = halloc((dword)s0, 1)) == NULL)
217 if ((p = halloc((dword)(s0 + s1), 1)) != NULL)
224 while (s0 && (p = halloc((dword)s0, 1)) == NULL)
231 size_t _hugecoreleft(void)
234 void huge* pFirst = NULL;
235 void huge* pLast = NULL;
239 void huge* p = LargestHugeFreeBlock(&largest);
240 if (largest < sizeof(void huge*))
246 *(void huge* huge*)p = NULL;
252 *(void huge* huge*)pLast = p;
256 while (pFirst != NULL)
258 void huge* p = *(void huge* huge*)pFirst;
265 /*void __based(__self)* LargestBasedFreeBlock(size_t* Size)
269 void __based(__self)* p;
271 s0 = ~(size_t)0 ^ (~(size_t)0 >> 1);
272 while (s0 && (p = _bmalloc(segu, s0)) == NULL)
281 if ((p = _bmalloc(segu, s0 + s1)) != NULL)
288 while (s0 && (p = _bmalloc(segu, s0)) == NULL)
295 size_t _basedcoreleft(void)
299 void __based(segu)* pFirst = NULL;
300 void __based(segu)* pLast = NULL;
301 // allocate based heap
302 segu = _bheapseg( 1024 );
303 if( segu == _NULLSEG ) {
304 printf( "Unable to allocate based heap\n" );
313 void __based(segu)* p = LargestBasedFreeBlock(&largest);
314 if (largest < sizeof(void far*))
320 *(void far* far*)p = NULL;
326 *(void far* far*)pLast = p;
330 while (pFirst != NULL)
332 void far* p = *(void far* far*)pFirst;
339 size_t GetFreeSize(void)
341 struct _heapinfo h_info;
343 size_t h_free=0, h_total=0, h_used=0;
345 h_info._pentry = NULL;
347 heap_status = _heapwalk( &h_info );
348 if( heap_status != _HEAPOK ) break;
349 if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") h_free += h_info._size;
350 if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") h_used += h_info._size;
351 h_total += h_info._size;
353 heapstat0(heap_status);
357 size_t GetFarFreeSize(void)
359 struct _heapinfo fh_info;
361 size_t fh_free=0, fh_total=0, fh_used=0;
363 fh_info._pentry = NULL;
365 heap_status = _fheapwalk( &fh_info );
366 if( heap_status != _HEAPOK ) break;
367 if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") fh_free += fh_info._size;
368 if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") fh_used += fh_info._size;
369 fh_total += fh_info._size;
371 heapstat0(heap_status);
375 size_t GetNearFreeSize(void)
377 struct _heapinfo nh_info;
379 size_t nh_free=0, nh_total=0, nh_used=0;
381 nh_info._pentry = NULL;
383 heap_status = _nheapwalk( &nh_info );
384 if( heap_status != _HEAPOK ) break;
385 if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") nh_free += nh_info._size;
386 if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") nh_used += nh_info._size;
387 nh_total += nh_info._size;
389 heapstat0(heap_status);
395 struct _heapinfo fh_info, nh_info, h_info;
397 size_t h_free, nh_free, fh_free, h_total, nh_total, fh_total, h_used, nh_used, fh_used;
398 byte scratch[1024],str[16];
402 strcpy(scratch,"\n == default ==\n\n");
403 write(heaphandle,scratch,strlen(scratch));
404 h_info._pentry = NULL;
405 h_free=0; h_total=0; h_used=0;
407 heap_status = _heapwalk( &h_info );
408 if( heap_status != _HEAPOK ) break;
409 strcpy(scratch," "); strcat(scratch,(h_info._useflag == _USEDENTRY ? "USED" : "FREE")); strcat(scratch," block at "); ultoa((dword)h_info._pentry,str,16); strcat(scratch,str); strcat(scratch," of size "); ultoa(h_info._size,str,10); strcat(scratch,str); strcat(scratch,"\n");
410 if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") h_free += h_info._size;
411 if((h_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") h_used += h_info._size;
412 h_total += h_info._size;
413 write(heaphandle,scratch,strlen(scratch));
415 heapstat(heap_status, &scratch);
418 strcpy(scratch,"\n == near ==\n\n");
419 write(heaphandle,scratch,strlen(scratch));
420 nh_info._pentry = NULL;
421 nh_free=0; nh_total=0; nh_used=0;
423 heap_status = _nheapwalk( &nh_info );
424 if( heap_status != _HEAPOK ) break;
425 strcpy(scratch," "); strcat(scratch,(h_info._useflag == _USEDENTRY ? "USED" : "FREE")); strcat(scratch," block at "); ultoa((dword)h_info._pentry,str,16); strcat(scratch,str); strcat(scratch," of size "); ultoa(h_info._size,str,10); strcat(scratch,str); strcat(scratch,"\n");
426 /* printf( " %s block at %Fp of size %4.4X\n",
427 (nh_info._useflag == _USEDENTRY ? "USED" : "FREE"),
428 nh_info._pentry, nh_info._size );*/
429 if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") nh_free += nh_info._size;
430 if((nh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") nh_used += nh_info._size;
431 nh_total += nh_info._size;
432 write(heaphandle,scratch,strlen(scratch));
434 heapstat(heap_status, &scratch);
437 strcpy(scratch,"\n == far ==\n\n");
438 write(heaphandle,scratch,strlen(scratch));
439 fh_info._pentry = NULL;
440 fh_free=0; fh_total=0; fh_used=0;
442 heap_status = _fheapwalk( &fh_info );
443 if( heap_status != _HEAPOK ) break;
444 strcpy(scratch," "); strcat(scratch,(h_info._useflag == _USEDENTRY ? "USED" : "FREE")); strcat(scratch," block at "); ultoa((dword)h_info._pentry,str,16); strcat(scratch,str); strcat(scratch," of size "); ultoa(h_info._size,str,10); strcat(scratch,str); strcat(scratch,"\n");
445 /*printf( " %s block at %Fp of size %4.4X\n",
446 (fh_info._useflag == _USEDENTRY ? "USED" : "FREE"),
447 fh_info._pentry, fh_info._size );*/
448 if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="FREE") fh_free += fh_info._size;
449 if((fh_info._useflag == _USEDENTRY ? "USED" : "FREE")=="USED") fh_used += fh_info._size;
450 fh_total += fh_info._size;
451 write(heaphandle,scratch,strlen(scratch));
453 heapstat(heap_status, &scratch);
455 strcpy(scratch,"\n");
456 strcat(scratch,kittengets(2,0,"Memory Type Total Used Free\n"));
457 strcat(scratch,"---------------- -------- -------- --------\n");
458 printmeminfoline(&scratch, "Default", h_total, h_used, h_free);
459 printmeminfoline(&scratch, "Near", nh_total, nh_used, nh_free);
460 printmeminfoline(&scratch, "Far", fh_total, fh_used, fh_free);
461 strcat(scratch,"---------------- -------- -------- --------\n");
462 strcat(scratch,"coreleft = "); ultoa((dword)_coreleft(),str,10); strcat(scratch,str); strcat(scratch,"\n");
463 strcat(scratch,"farcoreleft = "); ultoa((dword)_farcoreleft(),str,10); strcat(scratch,str); strcat(scratch,"\n");
464 strcat(scratch,"GetFreeSize = "); ultoa((dword)GetFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");
465 strcat(scratch,"GetNearFreeSize = "); ultoa((dword)GetNearFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");
466 strcat(scratch,"GetFarFreeSize = "); ultoa((dword)GetFarFreeSize(),str,10); strcat(scratch,str); strcat(scratch,"\n");
467 strcat(scratch,"memavl = "); ultoa((dword)_memavl(),str,10); strcat(scratch,str); strcat(scratch,"\n");
468 strcat(scratch,"stackavail = "); ultoa((dword)stackavail(),str,10); strcat(scratch,str); strcat(scratch,"\n");
469 write(heaphandle,scratch,strlen(scratch));
473 void heapstat(int heap_status, byte *str)
475 switch( heap_status ) {
477 strcpy((str),"OK - end of heap\n");
480 strcpy((str),"OK - heap is empty\n");
484 strcpy((str),"ERROR - heap is damaged\n");
487 strcpy((str),"ERROR - bad pointer to heap\n");
490 strcpy((str),"ERROR - bad node in heap\n");
492 write(heaphandle,(str),strlen((str)));
495 void heapstat0(int heap_status)
497 switch( heap_status ) {
499 //printf("OK - end of heap\n");
502 //printf("OK - heap is empty\n");
506 printf("ERROR - heap is damaged\n");
509 printf("ERROR - bad pointer to heap\n");
512 printf("ERROR - bad node in heap\n");
517 ============================
519 = HC_OpenDebug / HC_CloseDebug
521 = Opens a binary file with the handle "heaphandle"
523 ============================
528 heaphandle = open("heap.16", O_CREAT | O_WRONLY | O_TEXT);