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 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538
|
/*
* debugging support -- tom dickey.
*
* $Header: /usr/build/vile/vile/RCS/trace.c,v 1.25 2002/02/16 01:50:11 tom Exp $
*
*/
#include "estruct.h"
#include "edef.h"
#include <ctype.h>
#if SYS_WINNT
#include <io.h>
#include <fcntl.h>
#endif
#undef fopen /* avoid conflict with 'fakevms.c' */
#ifndef _trace_h
#include "trace.h"
#endif
#if SYS_UNIX
#include <sys/time.h>
#endif
#if defined(sun) && !defined(__SVR4)
extern void perror(const char *s);
extern int gettimeofday(struct timeval *t, struct timezone *z);
extern int vfprintf(FILE * fp, const char *fmt, va_list v);
extern int fflush(FILE * fp);
#endif
#include <stdarg.h>
#if DOALLOC
#undef calloc
#undef malloc
#undef realloc
#undef free
#endif /* DOALLOC */
static const char *bad_form;
void
Trace(const char *fmt,...)
{
int save_err;
va_list ap;
static FILE *fp;
#if SYS_WINNT
HANDLE myMutex = CreateMutex(NULL, FALSE, NULL);
WaitForSingleObject(myMutex, INFINITE);
#endif
beginDisplay();
save_err = errno;
va_start(ap, fmt);
if (fp == NULL)
fp = fopen("Trace.out", "w");
if (fp == NULL)
abort();
if (fmt != bad_form) {
vfprintf(fp, fmt, ap);
(void) fflush(fp);
} else {
(void) fclose(fp);
(void) fflush(stdout);
(void) fflush(stderr);
}
va_end(ap);
errno = save_err;
endofDisplay();
#if SYS_WINNT
ReleaseMutex(myMutex);
CloseHandle(myMutex);
#endif
}
char *
visible_buff(const char *buffer, int length, int eos)
{
static char *result;
int j;
unsigned k = 0;
unsigned need = ((length > 0) ? (length * 4) : 0) + 1;
beginDisplay();
if (buffer == 0)
buffer = "";
if (result != 0)
free(result);
result = malloc(need);
for (j = 0; j < length; j++) {
int c = buffer[j] & 0xff;
if (eos && !c) {
break;
} else if (isprint(c)) {
result[k++] = (char) c;
} else {
if (c >= 128)
sprintf(result + k, "\\%03o", c);
else if (c == 127)
strcpy(result + k, "^?");
else
sprintf(result + k, "^%c", c | '@');
k = strlen(result);
}
}
result[k] = 0;
endofDisplay();
return result;
}
char *
str_visible(char *s)
{
if (s == 0)
return "(null)";
return visible_buff(s, strlen(s), TRUE);
}
char *
tb_visible(TBUFF * p)
{
return visible_buff(tb_values(p), tb_length(p), FALSE);
}
char *
lp_visible(LINE *p)
{
if (p == 0)
return "";
return visible_buff(p->l_text, llength(p), FALSE);
}
#define SECS(tv) (tv.tv_sec + (tv.tv_usec / 1.0e6))
void
Elapsed(char *msg)
{
#if SYS_UNIX
struct timeval tv1;
struct timezone tz1;
static struct timeval tv0;
static int init;
gettimeofday(&tv1, &tz1);
if (!init++)
tv0 = tv1;
Trace("%10.3f %s\n", SECS(tv1) - SECS(tv0), msg);
tv0 = tv1;
#endif
#if SYS_WINNT
static DWORD tv0;
static int init;
DWORD tv1 = GetTickCount();
if (!init++)
tv0 = tv1;
Trace("%10.3f %s\n", (tv1 - tv0) / 1000.0, msg);
tv0 = tv1;
#endif
}
#ifdef apollo
static int
contains(char *ref, char *tst)
{
size_t len = strlen(ref);
while (*tst) {
if (!strncmp(ref, tst++, len))
return TRUE;
}
return FALSE;
}
#endif /* apollo */
void
WalkBack(void)
{
#ifdef apollo
static char *first = "\"WalkBack\"";
static char *last = "\"unix_$main\"";
auto FILE *pp;
auto char bfr[BUFSIZ];
auto int ok = FALSE;
static int count;
Trace("%s %d\n", first, ++count);
sprintf(bfr, "/com/tb %d", getpid());
if (!(pp = popen(bfr, "r")))
perror(bfr);
while (fgets(bfr, sizeof(bfr), pp)) {
if (ok && contains(last, bfr))
break;
else if (contains(first, bfr))
ok = TRUE;
else if (ok)
Trace("%s", bfr);
}
(void) fclose(pp);
#endif /* apollo */
}
static int count_alloc;
static int count_freed;
void
fail_alloc(char *msg, char *ptr)
{
Trace("%s: %p\n", msg, ptr);
Trace("allocs %d, frees %d\n", count_alloc, count_freed);
WalkBack();
#if NO_LEAKS
show_alloc();
#endif
Trace(bad_form);
abort();
}
#if DOALLOC
typedef struct {
long size; /* ...its size */
char *text; /* the actual segment */
int note; /* ...last value of 'count_alloc' */
} AREA;
static AREA *area;
static long maxAllocated, /* maximum # of bytes allocated */
nowAllocated; /* current # of bytes allocated */
static int nowPending, /* current end of 'area[]' table */
maxPending; /* maximum # of segments allocated */
static void
InitArea(void)
{
if (area == 0) {
area = (AREA *) calloc(DOALLOC, sizeof(AREA));
if (area == 0)
abort();
Trace("Initialized doalloc (%d * %d) = %ld\n",
DOALLOC,
sizeof(AREA),
(long) sizeof(AREA) * (long) DOALLOC);
}
}
static int
FindArea(char *ptr)
{
register int j;
InitArea();
for (j = 0; j < DOALLOC; j++)
if (area[j].text == ptr) {
if (j >= nowPending) {
nowPending = j + 1;
if (nowPending > maxPending)
maxPending = nowPending;
}
return j;
}
return -1;
}
static int
record_freed(char *ptr)
{
register int j;
if ((j = FindArea(ptr)) >= 0) {
nowAllocated -= area[j].size;
area[j].size = 0;
area[j].text = 0;
area[j].note = count_freed;
if ((j + 1) == nowPending) {
register int k;
for (k = j; (k >= 0) && !area[k].size; k--)
nowPending = k;
}
}
return j;
}
static int
record_alloc(char *newp, char *oldp, unsigned len)
{
register int j;
if (newp == oldp) {
if ((j = FindArea(oldp)) >= 0) {
nowAllocated -= area[j].size;
area[j].size = len;
area[j].note = count_alloc;
} else
fail_alloc("could not find", oldp);
} else {
if (oldp != 0)
record_freed(oldp);
if ((j = FindArea((char *) 0)) >= 0) {
area[j].text = newp;
area[j].size = len;
area[j].note = count_alloc;
} else
fail_alloc("no room in table", newp);
}
nowAllocated += len;
if (nowAllocated > maxAllocated)
maxAllocated = nowAllocated;
return len;
}
#define OK_ALLOC(p,q,n) ((p != 0) && (record_alloc(p,q,n) >= 0))
#define OK_FREE(p) ((p != 0) && (record_freed(p) >= 0))
#else
#define OK_ALLOC(p,q,n) (p != 0)
#define OK_FREE(p) (p != 0)
#endif /* DOALLOC */
#ifdef DEBUG2
#define LOG_PTR(msg,num) Trace("%s %p\n", msg, num)
#define LOG_LEN(msg,num) Trace("%s %d\n", msg, num)
#else
#define LOG_PTR(msg,num)
#define LOG_LEN(msg,num)
#endif
/************************************************************************
* public entrypoints *
************************************************************************/
#if DOALLOC
char *
doalloc(char *oldp, unsigned amount)
{
register char *newp;
count_alloc += (oldp == 0);
LOG_LEN("allocate", amount);
LOG_PTR(" old = ", oldp);
newp = (oldp != 0) ? realloc(oldp, amount) : malloc(amount);
if (!OK_ALLOC(newp, oldp, amount)) {
perror("doalloc");
fail_alloc("doalloc", oldp);
/*NOT REACHED */
}
LOG_PTR(" new = ", newp);
return (newp);
}
char *
do_calloc(unsigned nmemb, unsigned size)
{
unsigned len = nmemb * size;
char *result = doalloc((char *) 0, len);
memset(result, 0, len);
return result;
}
/*
* Entrypoint so we can validate pointers
*/
void
dofree(void *oldp)
{
count_freed++;
LOG_PTR("dealloc ", oldp);
if (OK_FREE(oldp)) {
free(oldp);
return;
}
fail_alloc("free (not found)", oldp);
}
/*
* Write over the area if it is valid.
*/
void
dopoison(void *oldp, long len)
{
int j;
if ((j = FindArea(oldp)) >= 0) {
if (area[j].size >= len)
(void) memset((char *) oldp, 0xdf, len);
else
fail_alloc("incorrect length", oldp);
} else {
fail_alloc("cannot find to poison", oldp);
}
}
#endif
#ifndef show_alloc
void
show_alloc(void)
{
#if DOALLOC
static char *fmt = ".. %-24.24s %10ld\n";
printf("show_alloc\n"); /* patch */
Trace("** allocator metrics:\n");
Trace(fmt, "allocs:", count_alloc);
Trace(fmt, "frees:", count_freed);
{
register int j, count = 0;
register long total = 0;
for (j = 0; j < nowPending; j++) {
if (area[j].text) {
if (count++ < 50)
Trace("...%5d) %5ld bytes in alloc #%-5d @%p %s\n",
j,
area[j].size,
area[j].note,
area[j].text,
visible_buff(area[j].text,
area[j].size,
FALSE));
total += area[j].size;
}
}
Trace(fmt, "total bytes allocated:", total);
Trace(fmt, "current bytes allocated:", nowAllocated);
Trace(fmt, "maximum bytes allocated:", maxAllocated);
Trace(fmt, "segment-table length:", nowPending);
Trace(fmt, "current # of segments:", (long) count);
Trace(fmt, "maximum # of segments:", maxPending);
}
#endif
}
#endif /* show_alloc */
static int oops;
static int
check_line(LINE *lp, BUFFER *bp)
{
LINE *p;
for_each_line(p, bp) {
if (lp == p)
return TRUE;
}
return FALSE;
}
static int
check_forw(LINE *lp)
{
LINE *p, *q;
p = lforw(lp);
q = lback(p);
return (lp == q);
}
static int
check_back(LINE *lp)
{
LINE *p, *q;
p = lback(lp);
q = lforw(p);
return (lp == q);
}
void
trace_line(LINE *lp, BUFFER *bp)
{
if (lp == 0) {
Trace("? null LINE pointer\n");
} else if (bp == 0) {
Trace("? null BUFFER pointer\n");
} else {
char *a = check_forw(lp) ? "" : "?";
char *b = check_back(lp) ? "" : "?";
Trace("%4d%s:{%p, f %p%s, b %p%s}:%s\n",
line_no(bp, lp), check_line(lp, bp) ? "" : "?", lp,
lforw(lp), a,
lback(lp), b,
lp_visible(lp));
if (*a || *b)
oops++;
}
}
void
trace_buffer(BUFFER *bp)
{
LINEPTR lp;
Trace("trace_buffer(%s) dot=%p%s\n",
bp->b_bname,
bp->b_dot.l,
bp == curbp ? " (curbp)" : "");
for_each_line(lp, bp)
trace_line(lp, bp);
}
void
trace_window(WINDOW *wp)
{
LINEPTR lp;
int got_dot = FALSE;
int had_line = FALSE;
if (wp->w_bufp == 0
|| wp->w_bufp->b_bname == 0)
return;
Trace("trace_window(%s) top=%d, rows=%d, head=%p, line=%p dot=%p%s\n",
wp->w_bufp->b_bname,
wp->w_toprow,
wp->w_ntrows,
win_head(wp),
wp->w_line.l,
wp->w_dot.l,
wp == curwp ? " (curwp)" : "");
for (lp = wp->w_line.l; lp != win_head(wp); lp = lforw(lp)) {
trace_line(lp, wp->w_bufp);
if (lp == 0)
break;
if (lp == wp->w_dot.l)
got_dot = TRUE;
had_line = TRUE;
}
if (!got_dot && had_line) {
Trace("DOT not found!\n");
imdying(10);
}
}
|