mem0dbg.c 20.8 KB
Newer Older
1 2 3 4 5 6 7 8 9
/************************************************************************
The memory management: the debug code. This is not a compilation module,
but is included in mem0mem.* !

(c) 1994, 1995 Innobase Oy

Created 6/9/1994 Heikki Tuuri
*************************************************************************/

10
#ifdef UNIV_MEM_DEBUG
11 12 13 14 15 16 17 18 19
mutex_t	mem_hash_mutex;	 /* The mutex which protects in the
			debug version the hash table containing
			the list of live memory heaps, and
			also the global variables below. */

/* The following variables contain information about the
extent of memory allocations. Only used in the debug version.
Protected by mem_hash_mutex above. */

20 21 22
static ulint	mem_n_created_heaps 		= 0;
static ulint	mem_n_allocations	  	= 0;
static ulint	mem_total_allocated_memory	= 0;
unknown's avatar
unknown committed
23
ulint		mem_current_allocated_memory	= 0;
24
static ulint	mem_max_allocated_memory	= 0;
unknown's avatar
unknown committed
25
static ulint	mem_last_print_info		= 0;
26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

/* Size of the hash table for memory management tracking */
#define	MEM_HASH_SIZE	997

/* The node of the list containing currently allocated memory heaps */

typedef struct mem_hash_node_struct mem_hash_node_t;
struct mem_hash_node_struct {
	UT_LIST_NODE_T(mem_hash_node_t)
				list;	/* hash list node */
	mem_heap_t*		heap;	/* memory heap */
	char*			file_name;/* file where heap was created*/
	ulint			line;	/* file line of creation */
	ulint			nth_heap;/* this is the nth heap created */
	UT_LIST_NODE_T(mem_hash_node_t)
				all_list;/* list of all created heaps */
};

typedef UT_LIST_BASE_NODE_T(mem_hash_node_t) mem_hash_cell_t;

/* The hash table of allocated heaps */
47
static mem_hash_cell_t		mem_hash_table[MEM_HASH_SIZE];
48 49

/* The base node of the list of all allocated heaps */
50
static mem_hash_cell_t		mem_all_list_base;
51

52
static ibool	mem_hash_initialized	= FALSE;
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68


UNIV_INLINE
mem_hash_cell_t*
mem_hash_get_nth_cell(ulint i);

/* Accessor function for the hash table. Returns a pointer to the
table cell. */
UNIV_INLINE
mem_hash_cell_t*
mem_hash_get_nth_cell(ulint i)
{
	ut_a(i < MEM_HASH_SIZE);

	return(&(mem_hash_table[i]));
}
69
#endif /* UNIV_MEM_DEBUG */
70 71 72 73 74 75

/* Accessor functions for a memory field in the debug version */

void
mem_field_header_set_len(byte* field, ulint len)
{
76
	mach_write_to_4(field - 2 * sizeof(ulint), len);
77 78 79 80 81
}

ulint
mem_field_header_get_len(byte* field)
{
82
	return(mach_read_from_4(field - 2 * sizeof(ulint)));
83 84 85 86 87
}

void
mem_field_header_set_check(byte* field, ulint check)
{
88
	mach_write_to_4(field - sizeof(ulint), check);
89 90 91 92 93
}

ulint
mem_field_header_get_check(byte* field)
{
94
	return(mach_read_from_4(field - sizeof(ulint)));
95 96 97 98 99
}

void
mem_field_trailer_set_check(byte* field, ulint check)
{
100
	mach_write_to_4(field + mem_field_header_get_len(field), check);
101 102 103 104 105
}

ulint
mem_field_trailer_get_check(byte* field)
{
106
	return(mach_read_from_4(field +
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
			mem_field_header_get_len(field)));
}

/**********************************************************************
Initializes the memory system. */

void
mem_init(
/*=====*/
	ulint	size)	/* in: common pool size in bytes */
{
#ifdef UNIV_MEM_DEBUG

	ulint	i;

	/* Initialize the hash table */
	ut_a(FALSE == mem_hash_initialized);

	mutex_create(&mem_hash_mutex);
	mutex_set_level(&mem_hash_mutex, SYNC_MEM_HASH);

	for (i = 0; i < MEM_HASH_SIZE; i++) {
		UT_LIST_INIT(*mem_hash_get_nth_cell(i));
	}

	UT_LIST_INIT(mem_all_list_base);
	
	mem_hash_initialized = TRUE;
#endif

	mem_comm_pool = mem_pool_create(size);
}

/**********************************************************************
Initializes an allocated memory field in the debug version. */

void
mem_field_init(
/*===========*/
	byte*	buf,	/* in: memory field */
	ulint	n)	/* in: how many bytes the user requested */
{
	ulint	rnd;
	byte*	usr_buf;

	usr_buf = buf + MEM_FIELD_HEADER_SIZE;
	
	/* In the debug version write the length field and the 
	check fields to the start and the end of the allocated storage.
	The field header consists of a length field and
	a random number field, in this order. The field trailer contains
	the same random number as a check field. */

	mem_field_header_set_len(usr_buf, n);
	
	rnd = ut_rnd_gen_ulint();
	
	mem_field_header_set_check(usr_buf, rnd);
	mem_field_trailer_set_check(usr_buf, rnd);

167
#ifdef UNIV_MEM_DEBUG
168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185
	/* Update the memory allocation information */

	mutex_enter(&mem_hash_mutex);

	mem_total_allocated_memory += n;
	mem_current_allocated_memory += n;
	mem_n_allocations++;

	if (mem_current_allocated_memory > mem_max_allocated_memory) {
		mem_max_allocated_memory = mem_current_allocated_memory;
	}

	mutex_exit(&mem_hash_mutex);

	/* In the debug version set the buffer to a random
	combination of 0xBA and 0xBE */

	mem_init_buf(usr_buf, n);
186
#endif /* UNIV_MEM_DEBUG */
187 188 189 190 191 192 193 194 195
}

/**********************************************************************
Erases an allocated memory field in the debug version. */

void
mem_field_erase(
/*============*/
	byte*	buf,	/* in: memory field */
196 197
	ulint	n __attribute__((unused)))
			/* in: how many bytes the user requested */
198 199 200 201
{
	byte*	usr_buf;

	usr_buf = buf + MEM_FIELD_HEADER_SIZE;
202 203

#ifdef UNIV_MEM_DEBUG
204 205 206 207 208 209 210 211 212 213 214
	mutex_enter(&mem_hash_mutex);
	mem_current_allocated_memory    -= n;
	mutex_exit(&mem_hash_mutex);

	/* Check that the field lengths agree */
	ut_ad(n == (ulint)mem_field_header_get_len(usr_buf));

	/* In the debug version, set the freed space to a random
	combination of 0xDE and 0xAD */

	mem_erase_buf(buf, MEM_SPACE_NEEDED(n));
215
#endif /* UNIV_MEM_DEBUG */
216 217
}

218
#ifdef UNIV_MEM_DEBUG
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
/*******************************************************************
Initializes a buffer to a random combination of hex BA and BE.
Used to initialize allocated memory. */

void
mem_init_buf(
/*=========*/
	byte*   buf,    /* in: pointer to buffer */
	ulint    n)     /* in: length of buffer */
{
	byte*   ptr;

	for (ptr = buf; ptr < buf + n; ptr++) {

		if (ut_rnd_gen_ibool()) {
			*ptr = 0xBA;
		} else {
			*ptr = 0xBE;
		}
	}
}

/*******************************************************************
Initializes a buffer to a random combination of hex DE and AD.
Used to erase freed memory.*/

void
mem_erase_buf(
/*==========*/
	byte*   buf,    /* in: pointer to buffer */
	ulint    n)      /* in: length of buffer */
{
	byte*   ptr;

	for (ptr = buf; ptr < buf + n; ptr++) {
		if (ut_rnd_gen_ibool()) {
			*ptr = 0xDE;
		} else {
			*ptr = 0xAD;
		}
	}
}

/*******************************************************************
Inserts a created memory heap to the hash table of current allocated
memory heaps. */

void
mem_hash_insert(
/*============*/
	mem_heap_t*	heap,	   /* in: the created heap */
	char*		file_name, /* in: file name of creation */
	ulint		line)	   /* in: line where created */
{
	mem_hash_node_t*	new_node;
	ulint			cell_no	;

	ut_ad(mem_heap_check(heap));

	mutex_enter(&mem_hash_mutex);
	
	cell_no = ut_hash_ulint((ulint)heap, MEM_HASH_SIZE);

	/* Allocate a new node to the list */
	new_node = ut_malloc(sizeof(mem_hash_node_t));

	new_node->heap = heap;
	new_node->file_name = file_name;
	new_node->line = line;
	new_node->nth_heap = mem_n_created_heaps;

	/* Insert into lists */
	UT_LIST_ADD_FIRST(list, *mem_hash_get_nth_cell(cell_no), new_node);

	UT_LIST_ADD_LAST(all_list, mem_all_list_base, new_node);

	mem_n_created_heaps++;	

	mutex_exit(&mem_hash_mutex);
}

/*******************************************************************
Removes a memory heap (which is going to be freed by the caller)
from the list of live memory heaps. Returns the size of the heap
in terms of how much memory in bytes was allocated for the user of
the heap (not the total space occupied by the heap).
Also validates the heap.
NOTE: This function does not free the storage occupied by the
heap itself, only the node in the list of heaps. */

void
mem_hash_remove(
/*============*/
	mem_heap_t*	heap,	   /* in: the heap to be freed */
	char*		file_name, /* in: file name of freeing */
	ulint		line)	   /* in: line where freed */
{
	mem_hash_node_t*	node;
	ulint			cell_no;
	ibool			error;
	ulint			size;
	
	ut_ad(mem_heap_check(heap));

	mutex_enter(&mem_hash_mutex);

	cell_no = ut_hash_ulint((ulint)heap, MEM_HASH_SIZE);

	/* Look for the heap in the hash table list */	
	node = UT_LIST_GET_FIRST(*mem_hash_get_nth_cell(cell_no));

	while (node != NULL) {
		if (node->heap == heap) {

			break;
		}

		node = UT_LIST_GET_NEXT(list, node);
	}
						
	if (node == NULL) {
340
		fprintf(stderr,
341 342 343 344 345 346 347 348 349 350 351 352 353 354
    	    "Memory heap or buffer freed in %s line %lu did not exist.\n",
			file_name, line);
		ut_error;
	}

	/* Remove from lists */
	UT_LIST_REMOVE(list, *mem_hash_get_nth_cell(cell_no), node);

	UT_LIST_REMOVE(all_list, mem_all_list_base, node);

	/* Validate the heap which will be freed */
	mem_heap_validate_or_print(node->heap, NULL, FALSE, &error, &size,
								NULL, NULL);
	if (error) {
355 356 357 358 359 360 361
		fprintf(stderr,
	"Inconsistency in memory heap or buffer n:o %lu created\n"
	"in %s line %lu and tried to free in %s line %lu.\n"
	"Hex dump of 400 bytes around memory heap first block start:\n",
			node->nth_heap, node->file_name, node->line,
			file_name, line);
		ut_print_buf(stderr, (byte*)node->heap - 200, 400);
unknown's avatar
unknown committed
362

363
		fputs("\nDump of the mem heap:\n", stderr);
unknown's avatar
unknown committed
364

365 366
		mem_heap_validate_or_print(node->heap, NULL, TRUE, &error,
					&size, NULL, NULL);
367 368 369 370 371 372 373 374 375 376
	   ut_error;
	}

	/* Free the memory occupied by the node struct */
	ut_free(node);

	mem_current_allocated_memory -= size;

	mutex_exit(&mem_hash_mutex);
}
377
#endif /* UNIV_MEM_DEBUG */
378 379 380 381 382 383 384 385 386 387 388 389

/*******************************************************************
Checks a memory heap for consistency and prints the contents if requested.
Outputs the sum of sizes of buffers given to the user (only in
the debug version), the physical size of the heap and the number of
blocks in the heap. In case of error returns 0 as sizes and number
of blocks. */

void
mem_heap_validate_or_print(
/*=======================*/
	mem_heap_t* 	heap, 	/* in: memory heap */
unknown's avatar
unknown committed
390 391
	byte*		top __attribute__((unused)),	
	                        /* in: calculate and validate only until
392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413
				this top pointer in the heap is reached,
				if this pointer is NULL, ignored */
	ibool		print,	/* in: if TRUE, prints the contents
				of the heap; works only in
				the debug version */
	ibool*		error,	/* out: TRUE if error */
	ulint*		us_size,/* out: allocated memory 
				(for the user) in the heap,
				if a NULL pointer is passed as this
				argument, it is ignored; in the
				non-debug version this is always -1 */
	ulint*		ph_size,/* out: physical size of the heap,
				if a NULL pointer is passed as this
				argument, it is ignored */
	ulint*		n_blocks) /* out: number of blocks in the heap,
				if a NULL pointer is passed as this
				argument, it is ignored */
{
	mem_block_t*	block;
	ulint		total_len 	= 0;
	ulint		block_count	= 0;
	ulint		phys_len	= 0;
unknown's avatar
unknown committed
414
#ifdef UNIV_MEM_DEBUG
415 416 417 418
	ulint		len;
	byte*		field;
	byte*		user_field;
	ulint		check_field;
unknown's avatar
unknown committed
419
#endif
420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439

	/* Pessimistically, we set the parameters to error values */
 	if (us_size != NULL) {
		*us_size = 0;
	}
 	if (ph_size != NULL) {
		*ph_size = 0;
	}
	if (n_blocks != NULL) {
		*n_blocks = 0;
	}	
	*error = TRUE;

	block = heap;
	
	if (block->magic_n != MEM_BLOCK_MAGIC_N) {
		return;
	}

	if (print) {
440
		fputs("Memory heap:", stderr);
441 442 443 444 445 446 447 448 449 450 451 452 453
	}

	while (block != NULL) {	
		phys_len += mem_block_get_len(block);

		if ((block->type == MEM_HEAP_BUFFER)
		    && (mem_block_get_len(block) > UNIV_PAGE_SIZE)) {

		    	/* error */

		    	return;
		}

unknown's avatar
unknown committed
454
#ifdef UNIV_MEM_DEBUG
455 456 457
		/* We can trace the fields of the block only in the debug
		version */
		if (print) {
458
			fprintf(stderr, " Block %ld:", block_count);
459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477
		}

		field = (byte*)block + mem_block_get_start(block);

		if (top && (field == top)) {

			goto completed;
		}

		while (field < (byte*)block + mem_block_get_free(block)) {

			/* Calculate the pointer to the storage
			which was given to the user */
			
			user_field = field + MEM_FIELD_HEADER_SIZE;
						
			len = mem_field_header_get_len(user_field); 
						   
			if (print) {
478
				ut_print_buf(stderr, user_field, len);
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
			}
				
			total_len += len;
			check_field = mem_field_header_get_check(user_field);
			
			if (check_field != 
			    mem_field_trailer_get_check(user_field)) {
				/* error */

			     	return;
			}

			/* Move to next field */
			field = field + MEM_SPACE_NEEDED(len);

			if (top && (field == top)) {

				goto completed;
			}

		}

		/* At the end check that we have arrived to the first free
		position */

		if (field != (byte*)block + mem_block_get_free(block)) {
			/* error */

			return;
		}

unknown's avatar
unknown committed
510
#endif
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 539 540 541 542 543 544 545 546

		block = UT_LIST_GET_NEXT(list, block);
		block_count++;
	}
#ifdef UNIV_MEM_DEBUG
completed:
#endif	
 	if (us_size != NULL) {
		*us_size = total_len;
	}
 	if (ph_size != NULL) {
		*ph_size = phys_len;
	}
	if (n_blocks != NULL) {
		*n_blocks = block_count;
	}	
	*error = FALSE;
}

/******************************************************************
Prints the contents of a memory heap. */

void
mem_heap_print(
/*===========*/
	mem_heap_t*	heap)	/* in: memory heap */
{
	ibool	error;	
	ulint	us_size;
	ulint	phys_size;
	ulint	n_blocks;

	ut_ad(mem_heap_check(heap));

	mem_heap_validate_or_print(heap, NULL, TRUE, &error, 
				&us_size, &phys_size, &n_blocks);
547
	fprintf(stderr,
548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660
  "\nheap type: %lu; size: user size %lu; physical size %lu; blocks %lu.\n",
			heap->type, us_size, phys_size, n_blocks);
	ut_a(!error);
}

/******************************************************************
Checks that an object is a memory heap (or a block of it). */

ibool
mem_heap_check(
/*===========*/
				/* out: TRUE if ok */
	mem_heap_t*	heap)	/* in: memory heap */
{
	ut_a(heap->magic_n == MEM_BLOCK_MAGIC_N);

	return(TRUE);
}

/******************************************************************
Validates the contents of a memory heap. */

ibool
mem_heap_validate(
/*==============*/
				/* out: TRUE if ok */
	mem_heap_t*	heap)	/* in: memory heap */
{
	ibool	error;	
	ulint	us_size;
	ulint	phys_size;
	ulint	n_blocks;

	ut_ad(mem_heap_check(heap));

	mem_heap_validate_or_print(heap, NULL, FALSE, &error, &us_size,
						&phys_size, &n_blocks);
	ut_a(!error);

	return(TRUE);
}

#ifdef UNIV_MEM_DEBUG
/*********************************************************************
TRUE if no memory is currently allocated. */

ibool
mem_all_freed(void)
/*===============*/
			/* out: TRUE if no heaps exist */
{
	mem_hash_node_t*	node;
	ulint			heap_count	= 0;
	ulint			i;

	mem_validate();

	mutex_enter(&mem_hash_mutex);

	for (i = 0; i < MEM_HASH_SIZE; i++) {

		node = UT_LIST_GET_FIRST(*mem_hash_get_nth_cell(i));
		while (node != NULL) {
			heap_count++;
			node = UT_LIST_GET_NEXT(list, node);
		}
	}

	mutex_exit(&mem_hash_mutex);

	if (heap_count == 0) {

		ut_a(mem_pool_get_reserved(mem_comm_pool) == 0);

		return(TRUE);
	} else {
		return(FALSE);
	}
}

/*********************************************************************
Validates the dynamic memory allocation system. */

ibool
mem_validate_no_assert(void)
/*========================*/
			/* out: TRUE if error */
{
	mem_hash_node_t*	node;
	ulint			n_heaps 		= 0;
	ulint			allocated_mem;
	ulint			ph_size;
	ulint			total_allocated_mem 	= 0;
	ibool			error			= FALSE;
	ulint			n_blocks;
	ulint			i;

	mem_pool_validate(mem_comm_pool);

	mutex_enter(&mem_hash_mutex);

	for (i = 0; i < MEM_HASH_SIZE; i++) {

		node = UT_LIST_GET_FIRST(*mem_hash_get_nth_cell(i));

		while (node != NULL) {
			n_heaps++;

			mem_heap_validate_or_print(node->heap, NULL,
				FALSE, &error, &allocated_mem, 
				&ph_size, &n_blocks);

			if (error) {
661 662 663 664 665
				fprintf(stderr,
		"\nERROR!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\n"
		"Inconsistency in memory heap or buffer created\n"
		"in %s line %lu.\n",
					node->file_name, node->line);
666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693

				mutex_exit(&mem_hash_mutex);

				return(TRUE);
			}

			total_allocated_mem += allocated_mem;
			node = UT_LIST_GET_NEXT(list, node);
		}
	}
	
	if ((n_heaps == 0) && (mem_current_allocated_memory != 0)) {
		error = TRUE;
	}
	
	if (mem_total_allocated_memory < mem_current_allocated_memory) {
		error = TRUE;
	}

	if (mem_max_allocated_memory > mem_total_allocated_memory) {
		error = TRUE;
	}
	
	if (mem_n_created_heaps < n_heaps) {
		error = TRUE;
	}
	
	mutex_exit(&mem_hash_mutex);
unknown's avatar
unknown committed
694
 
695 696 697 698 699 700 701 702 703 704 705 706 707 708 709
	return(error);
}

/****************************************************************
Validates the dynamic memory */

ibool
mem_validate(void)
/*==============*/
			/* out: TRUE if ok */
{
	ut_a(!mem_validate_no_assert());

	return(TRUE);
}
unknown's avatar
unknown committed
710
#endif /* UNIV_MEM_DEBUG */
unknown's avatar
unknown committed
711 712 713 714 715 716 717 718 719 720 721 722 723 724

/****************************************************************
Tries to find neigboring memory allocation blocks and dumps to stderr
the neighborhood of a given pointer. */

void
mem_analyze_corruption(
/*===================*/
	byte*	ptr)	/* in: pointer to place of possible corruption */
{
	byte*	p;
	ulint	i;
	ulint	dist;

725 726
	fputs("InnoDB: Apparent memory corruption: mem dump ", stderr);
	ut_print_buf(stderr, ptr - 250, 500);
unknown's avatar
unknown committed
727

728
	fputs("\nInnoDB: Scanning backward trying to find previous allocated mem blocks\n", stderr);
unknown's avatar
unknown committed
729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800

	p = ptr;
	dist = 0;
  
	for (i = 0; i < 10; i++) {
		for (;;) {
			if (((ulint)p) % 4 == 0) {

			    if (*((ulint*)p) == MEM_BLOCK_MAGIC_N) {
				fprintf(stderr,
			"Mem block at - %lu, file %s, line %lu\n",
				dist, p + sizeof(ulint),
				*(ulint*)(p + 8 + sizeof(ulint)));

				break;
			    }

			    if (*((ulint*)p) == MEM_FREED_BLOCK_MAGIC_N) {
				fprintf(stderr,
			"Freed mem block at - %lu, file %s, line %lu\n",
				dist, p + sizeof(ulint),
				*(ulint*)(p + 8 + sizeof(ulint)));

				break;
			    }
			}

			p--;
			dist++;
		}

		p--;
		dist++;
	}

	fprintf(stderr,
  "InnoDB: Scanning forward trying to find next allocated mem blocks\n");

	p = ptr;
	dist = 0;
  
	for (i = 0; i < 10; i++) {
		for (;;) {
			if (((ulint)p) % 4 == 0) {

			    if (*((ulint*)p) == MEM_BLOCK_MAGIC_N) {
				fprintf(stderr,
			"Mem block at + %lu, file %s, line %lu\n",
				dist, p + sizeof(ulint),
				*(ulint*)(p + 8 + sizeof(ulint)));

				break;
			    }

			    if (*((ulint*)p) == MEM_FREED_BLOCK_MAGIC_N) {
				fprintf(stderr,
			"Freed mem block at + %lu, file %s, line %lu\n",
				dist, p + sizeof(ulint),
				*(ulint*)(p + 8 + sizeof(ulint)));

				break;
			    }
			}

			p++;
			dist++;
		}

		p++;
		dist++;
	}
}
unknown's avatar
unknown committed
801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925

/*********************************************************************
Prints information of dynamic memory usage and currently allocated
memory heaps or buffers. Can only be used in the debug version. */
static
void
mem_print_info_low(
/*===============*/
	ibool	print_all)      /* in: if TRUE, all heaps are printed,
				else only the heaps allocated after the
				previous call of this function */	
{
#ifdef UNIV_MEM_DEBUG
	mem_hash_node_t*	node;
	ulint			n_heaps 		= 0;
	ulint			allocated_mem;
	ulint			ph_size;
	ulint			total_allocated_mem 	= 0;
	ibool			error;
	ulint			n_blocks;
#endif
	FILE*			outfile;
	
	/* outfile = fopen("ibdebug", "a"); */

	outfile = stdout;
	
	fprintf(outfile, "\n");	
	fprintf(outfile,
		"________________________________________________________\n");
	fprintf(outfile, "MEMORY ALLOCATION INFORMATION\n\n");

#ifndef UNIV_MEM_DEBUG

	UT_NOT_USED(print_all);

	mem_pool_print_info(outfile, mem_comm_pool);
	
	fprintf(outfile,
		"Sorry, non-debug version cannot give more memory info\n");

	/* fclose(outfile); */
	
	return;
#else
	mutex_enter(&mem_hash_mutex);
	
	fprintf(outfile, "LIST OF CREATED HEAPS AND ALLOCATED BUFFERS: \n\n");

	if (!print_all) {
		fprintf(outfile, "AFTER THE LAST PRINT INFO\n");
	}

	node = UT_LIST_GET_FIRST(mem_all_list_base);

	while (node != NULL) {
		n_heaps++;
		
		if (!print_all && node->nth_heap < mem_last_print_info) {

			goto next_heap;
		}	

		mem_heap_validate_or_print(node->heap, NULL, 
				FALSE, &error, &allocated_mem, 
				&ph_size, &n_blocks);
		total_allocated_mem += allocated_mem;

		fprintf(outfile,
 "%lu: file %s line %lu of size %lu phys.size %lu with %lu blocks, type %lu\n",
				node->nth_heap, node->file_name, node->line, 
				allocated_mem, ph_size, n_blocks,
				(node->heap)->type);
	next_heap:
		node = UT_LIST_GET_NEXT(all_list, node);
	}
	
	fprintf(outfile, "\n");

	fprintf(outfile, "Current allocated memory	  	: %lu\n", 
			mem_current_allocated_memory);
	fprintf(outfile, "Current allocated heaps and buffers	: %lu\n", 
			n_heaps);
	fprintf(outfile, "Cumulative allocated memory	  	: %lu\n", 
			mem_total_allocated_memory);
	fprintf(outfile, "Maximum allocated memory	  	: %lu\n",
			mem_max_allocated_memory);
	fprintf(outfile, "Cumulative created heaps and buffers	: %lu\n", 
			mem_n_created_heaps);
	fprintf(outfile, "Cumulative number of allocations	: %lu\n", 
			mem_n_allocations);

	mem_last_print_info = mem_n_created_heaps;

	mutex_exit(&mem_hash_mutex);

	mem_pool_print_info(outfile, mem_comm_pool);
	
/*	mem_validate(); */

/* 	fclose(outfile); */
#endif
}

/*********************************************************************
Prints information of dynamic memory usage and currently allocated memory
heaps or buffers. Can only be used in the debug version. */

void
mem_print_info(void)
/*================*/
{
	mem_print_info_low(TRUE);
}

/*********************************************************************
Prints information of dynamic memory usage and currently allocated memory
heaps or buffers since the last ..._print_info or..._print_new_info. */

void
mem_print_new_info(void)
/*====================*/
{
	mem_print_info_low(FALSE);
}