///////////////////////////////////////////////////////////////
// Memory Management
//
typedef struct { void* addr;  long size; } T_BLOCK;
T_BLOCK* t_alloc_index=0;   long t_alloc_length=0;   long t_alloc_size=0;
//
void* t_malloc(long);            // malloc()  replacement (identical usage)
void* t_mrealloc(void*,long);    // realloc() replacement (identical usage)
long   t_msize(void*);           // _msize()  replacement (identical usage)
void   t_mfree(void*);           // free()    replacement (identical usage)
void   t_mflush();               // free() ALL entires in table
void   t_mdiag(char*);           // send list of ALL entries to acklog.txt
//

...

//
//
void* t_malloc(long size)
{   if(t_alloc_index==NULL)   t_alloc_index=malloc((long)sizeof(T_BLOCK));
   long idx;
   for(idx=0; idx<t_alloc_length; idx++)   
      if(t_alloc_index[idx].addr==NULL)   
      break;   //look for unused index
   if(idx>=t_alloc_length)               //any unused ?
   {   t_alloc_index = realloc(t_alloc_index,t_alloc_size+(long)sizeof(T_BLOCK));         //append unused index 
       t_alloc_length++;      t_alloc_size += (long)sizeof(T_BLOCK);                  }      // if none empty
   t_alloc_index[idx].addr = (void*)malloc(size);      //create 
   t_alloc_index[idx].size = size;                     // memory block
   return(t_alloc_index[idx].addr);      //return pointer to block
}
//
//
long   t_msize(void* block)
{  if(t_alloc_index==NULL)   return(0);   //no allocated blocks, so nothing to find.
   long idx;
   for(idx=0; idx<t_alloc_length; idx++)   if(t_alloc_index[idx].addr==block)   break;   //look for matching index
   if(t_alloc_index[idx].addr!=block)   return(0);   //no matching block
   return(t_alloc_index[idx].size);         //return block size
}
//
//
void* t_mrealloc(void* block,long size)
{   if(t_alloc_index==NULL)   {   block=t_malloc(size);    return(block);   }
   long idx;
   for(idx=0; idx<t_alloc_length; idx++)   if(t_alloc_index[idx].addr==block)   break;   //look for matching index
   if(t_alloc_index[idx].addr!=block)   {   block=t_malloc(size);    return(block);   }   //no matching block
   t_alloc_index[idx].addr = realloc(t_alloc_index[idx].addr,size);   //re-create 
   t_alloc_index[idx].size = size;                                    // memory block
   return(t_alloc_index[idx].addr);      //return pointer to block
}
//
//
void   t_mfree(void* block)
{   if(t_alloc_index==NULL)   return;   //no allocated blocks, so nothing to free.
   long idx;
   for(idx=0; idx<t_alloc_length; idx++)   if(t_alloc_index[idx].addr==block)   break;   //look for matching index
   if(t_alloc_index[idx].addr!=block)   return;   //no matching block
   free(t_alloc_index[idx].addr);   //free block
   t_alloc_index[idx].addr   = 0;   // and clear index
   t_alloc_index[idx].size   = 0;   // *
   return;         //return, block freed
}
//
//
void   t_mdiag(char* header)
{   diag(header);   //'print' user supplied test heading
   if(t_alloc_index==NULL)   {   diag("Table Empty\n\n");   return;   }   //very empty
   long idx;   long count=0;
   for(idx=0; idx<t_alloc_length; idx++)   
   {   if(t_alloc_index[idx].addr!=NULL)      //Only print valid entries
      {   diag_var("\nAddress = %-10.0f,\t",    (unsigned long)t_alloc_index[idx].addr);
         diag_var("Size = %6.0f",              (long)t_alloc_index[idx].size);
         count++;         }   }         // count valid entries
   diag_var("\nCounted %.0f valid entries ", count);
   diag_var("out of %.0f slots\n\n", t_alloc_length);
   return;   
}
//
//
void   t_mflush()
{   if(t_alloc_index==NULL)   return;   //no allocated blocks, so nothing to free.
   long idx;
   for(idx=0; idx<t_alloc_length; idx++)   
      if(t_alloc_index[idx].addr!=NULL)      
         free(t_alloc_index[idx].addr);   //free valid block
   t_alloc_length=0;      //all blocks freed
   t_alloc_size=0;      // so reset counters
   free(t_alloc_index);      //and free 
   t_alloc_index=0;         // empty table
   return;         
}
//
//