/********** Copyright 1990 Regents of the University of California. All rights reserved. Author: 1985 Wayne A. Christopher, U. C. Berkeley CAD Group $Id$ **********/ /* * Resource-related routines. */ #include "config.h" #include "ngspice.h" #include "cpdefs.h" #include "ftedefs.h" #include "circuits.h" #include "quote.h" #include "resource.h" #include "variable.h" #include "cktdefs.h" #include "src/misc/misc_time.h" /* timediff */ #ifdef XSPICE /* gtri - add - 12/12/90 - wbk - include ipc stuff */ #include "ipctiein.h" /* gtri - end - 12/12/90 */ #endif #ifdef HAVE__MEMAVL #define WIN32_LEAN_AND_MEAN /* * The ngspice.h file included above defines BOOLEAN (via bool.h) and this * clashes with the definition obtained from windows.h (via winnt.h). * However, BOOLEAN is not used by this file so we can work round this problem * by undefining BOOLEAN before including windows.h * SJB - April 2005 */ #undef BOOLEAN #include #endif /* static declarations */ static void printres(char *name); static void fprintmem(FILE* stream, size_t memory); #ifndef HAVE__MEMAVL static RETSIGTYPE fault(void); static void * baseaddr(void); #endif #ifdef HAVE__MEMAVL size_t mem_avail; size_t _memavl(void) { MEMORYSTATUS ms; DWORD sum; ms.dwLength = sizeof(MEMORYSTATUS); GlobalMemoryStatus( &ms); sum = ms.dwAvailPhys + ms.dwAvailPageFile; return (size_t) sum; } #else char *startdata; char *enddata; #endif void init_rlimits(void) { # ifdef HAVE__MEMAVL /* hvogt */ mem_avail = _memavl( ); # else startdata = (char *) baseaddr( ); enddata = sbrk(0); # endif } void init_time(void) { #ifdef HAVE_GETRUSAGE #else # ifdef HAVE_TIMES # else # ifdef HAVE_FTIME ftime(&timebegin); # endif # endif #endif } void com_rusage(wordlist *wl) { char* copyword; /* Fill in the SPICE accounting structure... */ if (wl && (eq(wl->wl_word, "everything") || eq(wl->wl_word, "all"))) { printres((char *) NULL); } else if (wl) { for (; wl; wl = wl->wl_next) { /* printres(cp_unquote(wl->wl_word)); DG: bad, memory leak*/ copyword=cp_unquote(wl->wl_word);/*DG*/ printres(copyword); tfree(copyword); if (wl->wl_next) (void) putc('\n', cp_out); } } else { printres("cputime"); (void) putc('\n', cp_out); printres("totalcputime"); (void) putc('\n', cp_out); printres("space"); } return; } /* Find out if the user is approaching his maximum data size. If usage is withing 90% of total available then a warning message is sent to the error stream (cp_err) */ void ft_ckspace(void) { size_t usage, limit; #ifdef HAVE__MEMAVL size_t mem_avail_now; mem_avail_now = _memavl( ); usage = mem_avail - mem_avail_now; limit = mem_avail; #else /* HAVE__MEMAVL */ static size_t old_usage = 0; char *hi; # ifdef HAVE_GETRLIMIT struct rlimit rld; getrlimit(RLIMIT_DATA, &rld); if (rld.rlim_cur == RLIM_INFINITY) return; limit = rld.rlim_cur - (enddata - startdata); /* rlim_max not used */ # else /* HAVE_GETRLIMIT */ /* SYSVRLIMIT */ limit = ulimit(3, 0L) - (enddata - startdata); # endif /* HAVE_GETRLIMIT */ hi=sbrk(0); usage = (size_t) (hi - enddata); if (limit < 0) return; /* what else do you do? */ if (usage <= old_usage) return; old_usage = usage; #endif /* HAVE__MEMAVL */ if (usage > limit * 0.9) { fprintf(cp_err, "Warning - approaching max data size: "); fprintf(cp_err, "current size = "); fprintmem(cp_err, usage); fprintf(cp_err,", limit = "); fprintmem(cp_err, limit); fprintf(cp_err,"\n"); } return; } /* Print out one piece of resource usage information. */ static void printres(char *name) { #ifdef CIDER char *paramname = NULL; #endif bool yy = FALSE; static long lastsec = 0, lastusec = 0; struct variable *v; char *cpu_elapsed; #ifdef XSPICE /* gtri - add - 12/12/90 - wbk - a temp for testing purposes */ double ipc_test; /* gtri - end - 12/12/90 - wbk - */ #endif if (!name || eq(name, "totalcputime") || eq(name, "cputime")) { int total, totalu; #ifdef ipsc # define NO_RUDATA #else # ifdef HAVE_GETRUSAGE struct rusage ruse; (void) getrusage(RUSAGE_SELF, &ruse); total = ruse.ru_utime.tv_sec + ruse.ru_stime.tv_sec; totalu = (ruse.ru_utime.tv_usec + ruse.ru_stime.tv_usec) / 1000; cpu_elapsed = "CPU"; # else # ifdef HAVE_TIMES struct tms ruse; realt = times(&ruse); total = (ruse.tms_utime + ruse.tms_stime)/ HZ; totalu = (ruse.tms_utime + ruse.tms_utime) * 1000 / HZ; cpu_elapsed = "CPU"; # else # ifdef HAVE_FTIME struct timeb timenow; /* int sec, msec; sjb */ ftime(&timenow); timediff(&timenow, &timebegin, &total, &totalu); /* totalu /= 1000; hvogt */ cpu_elapsed = "elapsed"; # else # define NO_RUDATA # endif # endif # endif #endif #ifndef NO_RUDATA if (!name || eq(name, "totalcputime")) { total += totalu / 1000; totalu %= 1000; fprintf(cp_out, "Total %s time: %u.%03u seconds.\n", cpu_elapsed, total, totalu); } if (!name || eq(name, "cputime")) { lastusec = totalu - lastusec; lastsec = total - lastsec; while (lastusec < 0) { lastusec += 1000; lastsec -= 1; } while (lastusec > 1000) { lastusec -= 1000; lastsec += 1; } #ifndef HAVE__MEMAVL fprintf(cp_out, "%s time since last call: %lu.%03lu seconds.\n", cpu_elapsed, lastsec, lastusec); #endif lastsec = total; lastusec = totalu; } #ifdef XSPICE /* gtri - add - 12/12/90 - wbk - record cpu time used for ipc */ g_ipc.cpu_time = lastsec; ipc_test = lastsec; g_ipc.cpu_time = (double) lastusec; g_ipc.cpu_time /= 1.0e6; g_ipc.cpu_time += (double) lastsec; /* gtri - end - 12/12/90 */ #endif yy = TRUE; #else if (!name || eq(name, "totalcputime")) fprintf(cp_out, "Total CPU time: ??.??? seconds.\n"); if (!name || eq(name, "cputime")) fprintf(cp_out, "CPU time since last call: ??.??? seconds.\n"); yy = TRUE; #endif } if (!name || eq(name, "space")) { size_t usage = 0, limit = 0; #ifdef HAVE__MEMAVL size_t mem_avail_now; mem_avail_now = _memavl( ); usage = mem_avail - mem_avail_now; limit = mem_avail; #else /* HAVE__MEMAVL */ #ifdef ipsc NXINFO cur = nxinfo, start = nxinfo_snap; usage = cur.dataend - cur.datastart; limit = start.availmem; #else /* ipsc */ # ifdef HAVE_GETRLIMIT struct rlimit rld; char *hi; getrlimit(RLIMIT_DATA, &rld); limit = rld.rlim_cur - (enddata - startdata); hi = sbrk(0); usage = (size_t) (hi - enddata); # else /* HAVE_GETRLIMIT */ # ifdef HAVE_ULIMIT char *hi; limit = ulimit(3, 0L) - (enddata - startdata); hi = sbrk(0); usage = (size_t) (hi - enddata); # endif /* HAVE_ULIMIT */ # endif /* HAVE_GETRLIMIT */ #endif /* ipsc */ #endif /* HAVE__MEMAVL */ fprintf(cp_out, "Current dynamic memory usage = "); fprintmem(cp_out, usage); fprintf(cp_out, ",\n"); fprintf(cp_out, "Dynamic memory limit = "); fprintmem(cp_out, limit); fprintf(cp_out, ".\n"); yy = TRUE; } if (!name || eq(name, "faults")) { #ifdef HAVE_GETRUSAGE struct rusage ruse; (void) getrusage(RUSAGE_SELF, &ruse); fprintf(cp_out, "%lu page faults, %lu vol + %lu invol = %lu context switches.\n", ruse.ru_majflt, ruse.ru_nvcsw, ruse.ru_nivcsw, ruse.ru_nvcsw + ruse.ru_nivcsw); yy = TRUE; #endif } /* Now get all the spice resource stuff. */ if (ft_curckt && ft_curckt->ci_ckt) { #ifdef CIDER /* begin cider integration */ if (!name || eq(name, "circuit") || eq(name, "task")) { paramname = NULL; } else { paramname = name; } v = if_getstat(ft_curckt->ci_ckt, paramname); if (paramname && v) { /* end cider integration */ #else /* ~CIDER */ if (name && eq(name, "task")) v = if_getstat(ft_curckt->ci_ckt, NULL); else v = if_getstat(ft_curckt->ci_ckt, name); if (name && v) { #endif fprintf(cp_out, "%s = ", v->va_name); wl_print(cp_varwl(v), cp_out); (void) putc('\n', cp_out); yy = TRUE; } else if (v) { (void) putc('\n', cp_out); while (v) { fprintf(cp_out, "%s = ", v->va_name); wl_print(cp_varwl(v), cp_out); (void) putc('\n', cp_out); v = v->va_next; } yy = TRUE; } #ifdef CIDER /* begin cider integration */ /* Now print out interesting stuff about numerical devices. */ if (!name || eq(name, "devices")) { (void) NDEVacct((CKTcircuit*)ft_curckt->ci_ckt, cp_out); yy = TRUE; } /* end cider integration */ #endif } if (!yy) { fprintf(cp_err, "Note: no resource usage information for '%s',\n", name); fprintf(cp_err, "\tor no active circuit available\n"); } return; } /* Print to stream the given memory size in a human friendly format */ static void fprintmem(FILE* stream, size_t memory) { if (memory > 1000000) fprintf(stream, "%8.6f MB", memory/1000000.); else if (memory > 1000) fprintf(stream, "%5.3f kB", memory/1000.); else fprintf(stream, "%lu bytes", (unsigned long)memory); } #ifndef HAVE__MEMAVL #include #include /* * baseaddr( ) returns the base address of the data segment on most Unix * systems. It's an ugly hack for info that should be provided by the OS. */ /* Does anyone use a pagesize < 256 bytes?? I'll bet not; * too small doesn't hurt */ #define LOG2_PAGESIZE 8 static JMP_BUF env; static RETSIGTYPE fault(void) { signal(SIGSEGV, (SIGNAL_FUNCTION) fault); /* SysV style */ LONGJMP(env, 1); } static void * baseaddr(void) { #if defined(__CYGWIN__) || defined(__MINGW32__) || defined(HAS_WINDOWS) || defined(__APPLE__) return 0; #else char *low, *high, *at; long x; RETSIGTYPE (*orig_signal)( ); if (getenv("SPICE_NO_DATASEG_CHECK")) return 0; low = 0; high = (char *) ((unsigned long) sbrk(0) & ~((1 << LOG2_PAGESIZE) - 1)); orig_signal = signal(SIGSEGV, (SIGNAL_FUNCTION) fault); do { at = (char *) ((((long)low >> LOG2_PAGESIZE) + ((long)high >> LOG2_PAGESIZE)) << (LOG2_PAGESIZE - 1)); if (at == low || at == high) { break; } if (SETJMP(env, 1)) { low = at; continue; } else x = *at; if (SETJMP(env, 1)) { low = at; continue; } else *at = x; high = at; } while (1); (void) signal(SIGSEGV, (SIGNAL_FUNCTION) orig_signal); return (void *) high; #endif } #endif # ifdef notdef main( ) { printf("testing\n"); printf("baseaddr: %#8x topaddr: %#8x\n", baseaddr( ), sbrk(0)); } # endif