1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421
|
/**************************************************************************
**
** Copyright (C) 1993 David E. Steward & Zbigniew Leyk, all rights reserved.
**
** Meschach Library
**
** This Meschach Library is provided "as is" without any express
** or implied warranty of any kind with respect to this software.
** In particular the authors shall not be liable for any direct,
** indirect, special, incidental or consequential damages arising
** in any way from use of the software.
**
** Everyone is granted permission to copy, modify and redistribute this
** Meschach Library, provided:
** 1. All copies contain this copyright notice.
** 2. All modified copies shall carry a notice stating who
** made the last modification and the date of such modification.
** 3. No charge is made for this software or works derived from it.
** This clause shall not be construed as constraining other software
** distributed on the same medium as this software, nor is a
** distribution fee considered a charge.
**
***************************************************************************/
/* mem_stat.c 6/09/93 */
/* Deallocation of static arrays */
#include <stdio.h>
#include "matrix.h"
#include "meminfo.h"
#ifdef COMPLEX
#include "zmatrix.h"
#endif
#ifdef SPARSE
#include "sparse.h"
#include "iter.h"
#endif
static char rcsid[] = "$Id: memstat.c,v 1.1 1994/01/13 05:32:44 des Exp $";
/* global variable */
extern MEM_CONNECT mem_connect[MEM_CONNECT_MAX_LISTS];
/* local type */
typedef struct {
void **var; /* for &A, where A is a pointer */
int type; /* type of A */
int mark; /* what mark is chosen */
char *fname; /* source file name where last registered */
int line; /* line # of file where last registered */
} MEM_STAT_STRUCT;
/* local variables */
/* how many marks are used */
static int mem_stat_mark_many = 0;
/* current mark */
static int mem_stat_mark_curr = 0;
static MEM_STAT_STRUCT mem_stat_var[MEM_HASHSIZE];
/* array of indices (+1) to mem_stat_var */
static unsigned int mem_hash_idx[MEM_HASHSIZE];
/* points to the first unused element in mem_hash_idx */
static unsigned int mem_hash_idx_end = 0;
/* hashing function */
#ifndef ANSI_C
static unsigned int mem_hash(ptr)
void **ptr;
#else
static unsigned int mem_hash(void **ptr)
#endif
{
unsigned long lp = (unsigned long)ptr;
return (lp % MEM_HASHSIZE);
}
/* look for a place in mem_stat_var */
#ifndef ANSI_C
static int mem_lookup(var)
void **var;
#else
static int mem_lookup(void **var)
#endif
{
int k, j;
k = mem_hash(var);
if (mem_stat_var[k].var == var) {
return -1;
}
else if (mem_stat_var[k].var == NULL) {
return k;
}
else { /* look for an empty place */
j = k;
while (mem_stat_var[j].var != var && j < MEM_HASHSIZE
&& mem_stat_var[j].var != NULL)
j++;
if (mem_stat_var[j].var == NULL) return j;
else if (mem_stat_var[j].var == var) return -1;
else { /* if (j == MEM_HASHSIZE) */
j = 0;
while (mem_stat_var[j].var != var && j < k
&& mem_stat_var[j].var != NULL)
j++;
if (mem_stat_var[j].var == NULL) return j;
else if (mem_stat_var[j].var == var) return -1;
else { /* if (j == k) */
fprintf(stderr,
"\n WARNING !!! static memory: mem_stat_var is too small\n");
fprintf(stderr,
" Increase MEM_HASHSIZE in file: %s (currently = %d)\n\n",
MEM_HASHSIZE_FILE, MEM_HASHSIZE);
if ( !isatty(fileno(stdout)) ) {
fprintf(stdout,
"\n WARNING !!! static memory: mem_stat_var is too small\n");
fprintf(stdout,
" Increase MEM_HASHSIZE in file: %s (currently = %d)\n\n",
MEM_HASHSIZE_FILE, MEM_HASHSIZE);
}
error(E_MEM,"mem_lookup");
}
}
}
return -1;
}
/* register static variables;
Input arguments:
var - variable to be registered,
type - type of this variable;
list - list of types
fname - source file name where last registered
line - line number of source file
returned value < 0 --> error,
returned value == 0 --> not registered,
returned value >= 0 --> registered with this mark;
*/
#ifndef ANSI_C
int mem_stat_reg_list(var,type,list,fname,line)
void **var;
int type,list;
char *fname;
int line;
#else
int mem_stat_reg_list(void **var, int type, int list,
char *fname, int line)
#endif
{
int n;
if ( list < 0 || list >= MEM_CONNECT_MAX_LISTS )
return -1;
if (mem_stat_mark_curr == 0) return 0; /* not registered */
if (var == NULL) return -1; /* error */
if ( type < 0 || type >= mem_connect[list].ntypes ||
mem_connect[list].free_funcs[type] == NULL )
{
warning(WARN_WRONG_TYPE,"mem_stat_reg_list");
return -1;
}
if ((n = mem_lookup(var)) >= 0) {
mem_stat_var[n].var = var;
mem_stat_var[n].mark = mem_stat_mark_curr;
mem_stat_var[n].type = type;
mem_stat_var[n].fname = fname;
mem_stat_var[n].line = line;
/* save n+1, not n */
mem_hash_idx[mem_hash_idx_end++] = n+1;
}
return mem_stat_mark_curr;
}
/* set a mark;
Input argument:
mark - positive number denoting a mark;
returned:
mark if mark > 0,
0 if mark == 0,
-1 if mark is negative.
*/
#ifndef ANSI_C
int mem_stat_mark(mark)
int mark;
#else
int mem_stat_mark(int mark)
#endif
{
if (mark < 0) {
mem_stat_mark_curr = 0;
return -1; /* error */
}
else if (mark == 0) {
mem_stat_mark_curr = 0;
return 0;
}
mem_stat_mark_curr = mark;
mem_stat_mark_many++;
return mark;
}
/* deallocate static variables;
Input argument:
mark - a positive number denoting the mark;
Returned:
-1 if mark < 0 (error);
0 if mark == 0;
*/
#ifndef ANSI_C
int mem_stat_free_list(mark,list)
int mark,list;
#else
int mem_stat_free_list(int mark, int list)
#endif
{
unsigned int i,j;
int (*free_fn)();
if ( list < 0 || list >= MEM_CONNECT_MAX_LISTS
|| mem_connect[list].free_funcs == NULL )
return -1;
if (mark < 0) {
mem_stat_mark_curr = 0;
return -1;
}
else if (mark == 0) {
mem_stat_mark_curr = 0;
return 0;
}
if (mem_stat_mark_many <= 0) {
warning(WARN_NO_MARK,"mem_stat_free");
return -1;
}
#ifdef DEBUG
printf("mem_stat_free: Freeing variables registered for mark %d\n", mark);
#endif /* DEBUG */
/* deallocate the marked variables */
for (i=0; i < mem_hash_idx_end; i++) {
j = mem_hash_idx[i];
if (j == 0) continue;
else {
j--;
if (mem_stat_var[j].mark == mark) {
free_fn = mem_connect[list].free_funcs[mem_stat_var[j].type];
#ifdef DEBUG
printf("# Freeing variable(s) registered in file \"%s\", line %d\n",
mem_stat_var[j].fname, mem_stat_var[j].line);
#endif /* DEBUG */
if ( free_fn != NULL )
(*free_fn)(*mem_stat_var[j].var);
else
warning(WARN_WRONG_TYPE,"mem_stat_free");
*(mem_stat_var[j].var) = NULL;
mem_stat_var[j].var = NULL;
mem_stat_var[j].mark = 0;
mem_stat_var[j].fname = NULL;
mem_stat_var[j].line = 0;
mem_hash_idx[i] = 0;
}
}
}
while (mem_hash_idx_end > 0 && mem_hash_idx[mem_hash_idx_end-1] == 0)
mem_hash_idx_end--;
mem_stat_mark_curr = 0;
mem_stat_mark_many--;
return 0;
}
/* only for diagnostic purposes */
#ifndef ANSI_C
void mem_stat_dump(fp,list)
FILE *fp;
int list;
#else
void mem_stat_dump(FILE *fp, int list)
#endif
{
unsigned int i,j,k=1;
if ( list < 0 || list >= MEM_CONNECT_MAX_LISTS
|| mem_connect[list].free_funcs == NULL )
return;
fprintf(fp," Array mem_stat_var (list no. %d):\n",list);
for (i=0; i < mem_hash_idx_end; i++) {
j = mem_hash_idx[i];
if (j == 0) continue;
else {
j--;
fprintf(fp," %d. var = 0x%p, type = %s, mark = %d\n",
k,mem_stat_var[j].var,
mem_stat_var[j].type < mem_connect[list].ntypes &&
mem_connect[list].free_funcs[mem_stat_var[j].type] != NULL ?
mem_connect[list].type_names[(int)mem_stat_var[j].type] :
"???",
mem_stat_var[j].mark);
k++;
}
}
fprintf(fp,"\n");
}
/* query function about the current mark */
#ifdef ANSI_C
int mem_stat_show_mark(void)
#else
int mem_stat_show_mark()
#endif
{
return mem_stat_mark_curr;
}
/* Varying number of arguments */
#ifdef ANSI_C
/* To allocate memory to many arguments.
The function should be called:
mem_stat_vars(list,type,&v1,&v2,&v3,...,VNULL);
where
int list,type;
void **v1, **v2, **v3,...;
The last argument should be VNULL !
type is the type of variables v1,v2,v3,...
(of course they must be of the same type)
*/
int mem_stat_reg_vars(int list,int type,char *fname,int line, ...)
{
va_list ap;
int i=0;
void **par;
/* va_start(ap, type); */
va_start(ap,line); /* Changed for Linux 7th Oct, 2003 */
while (par = va_arg(ap,void **)) { /* NULL ends the list*/
mem_stat_reg_list(par,type,list,fname,line);
i++;
}
va_end(ap);
return i;
}
#elif VARARGS
/* old varargs is used */
/* To allocate memory to many arguments.
The function should be called:
mem_stat_vars(list,type,&v1,&v2,&v3,...,VNULL);
where
int list,type;
void **v1, **v2, **v3,...;
The last argument should be VNULL !
type is the type of variables v1,v2,v3,...
(of course they must be of the same type)
*/
int mem_stat_reg_vars(va_alist) va_dcl
{
va_list ap;
int type,list,i=0;
void **par;
va_start(ap);
list = va_arg(ap,int);
type = va_arg(ap,int);
while (par = va_arg(ap,void **)) { /* NULL ends the list*/
mem_stat_reg_list(par,type,list);
i++;
}
va_end(ap);
return i;
}
#endif
|