1 /* mm_diff - Memory snapshooting and comparison */
3 /* Copyright (c) 2008-2012. The SimGrid Team. All rights reserved. */
5 /* This program is free software; you can redistribute it and/or modify it
6 * under the terms of the license (GNU LGPL) which comes with this package. */
8 #include "xbt/ex_interface.h" /* internals of backtrace setup */
12 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
13 "Logging specific to mm_diff in mmalloc");
15 extern char *xbt_binary_name;
17 void mmalloc_backtrace_display(xbt_mheap_t mdp, void *ptr){
18 size_t block = BLOCK(ptr);
22 if ((char *) ptr < (char *) mdp->heapbase || block > mdp->heapsize) {
23 fprintf(stderr,"Ouch, this pointer is not mine. I cannot display its backtrace. I refuse it to death!!\n");
27 type = mdp->heapinfo[block].type;
30 //fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
33 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
34 fprintf(stderr,"No backtrace available for that block, sorry.\n");
38 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
39 e.used = mdp->heapinfo[block].busy_block.bt_size;
41 xbt_ex_setup_backtrace(&e);
43 fprintf(stderr, "(backtrace not set)\n");
44 } else if (e.bt_strings == NULL) {
45 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
49 fprintf(stderr, "Backtrace of where the block %p was malloced (%d frames):\n",ptr,e.used);
50 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
51 fprintf(stderr,"%d",i);fflush(NULL);
52 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
58 void mmalloc_backtrace_block_display(xbt_mheap_t mdp, size_t block){
63 type = mdp->heapinfo[block].type;
66 fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
69 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
70 fprintf(stderr,"No backtrace available for that block, sorry.\n");
74 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
75 e.used = mdp->heapinfo[block].busy_block.bt_size;
77 xbt_ex_setup_backtrace(&e);
79 fprintf(stderr, "(backtrace not set)\n");
80 } else if (e.bt_strings == NULL) {
81 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
85 fprintf(stderr, "Backtrace of where the block %zu was malloced (%d frames):\n", block ,e.used);
86 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
87 fprintf(stderr,"%d",i);fflush(NULL);
88 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
93 void mmalloc_backtrace_fragment_display(xbt_mheap_t mdp, size_t block, size_t frag){
97 memcpy(&e.bt,&(mdp->heapinfo[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE);
98 e.used = XBT_BACKTRACE_SIZE;
100 xbt_ex_setup_backtrace(&e);
102 fprintf(stderr, "(backtrace not set)\n");
103 } else if (e.bt_strings == NULL) {
104 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
108 fprintf(stderr, "Backtrace of where the fragment %zu in block %zu was malloced (%d frames):\n", frag, block ,e.used);
109 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
110 fprintf(stderr,"%d",i);fflush(NULL);
111 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
116 int mmalloc_compare_heap(xbt_mheap_t mdp1, xbt_mheap_t mdp2){
118 if(mdp1 == NULL && mdp2 == NULL){
119 fprintf(stderr, "Malloc descriptors null\n");
123 int errors = mmalloc_compare_mdesc(mdp1, mdp2);
129 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){
133 if(mdp1->heaplimit != mdp2->heaplimit){
134 fprintf(stderr,"Different limit of valid info table indices\n");
138 void* s_heap = (char *)mmalloc_get_current_heap() - STD_HEAP_SIZE - getpagesize();
140 void *heapbase1 = (char *)mdp1 + BLOCKSIZE;
141 void *heapbase2 = (char *)mdp2 + BLOCKSIZE;
143 void * breakval1 = (char *)mdp1 + ((char *)mdp1->breakval - (char *)s_heap);
144 void * breakval2 = (char *)mdp2 + ((char *)mdp2->breakval - (char *)s_heap);
147 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
154 int total_distance = 0;
157 void *address_pointed1, *address_pointed2;
159 int block_pointed1, block_pointed2;
160 void *addr_block_pointed1, *addr_block_pointed2;
162 /* Check busy blocks*/
164 while(i < mdp1->heaplimit){
166 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
167 fprintf(stderr,"Different type of block : %d - %d\n", mdp1->heapinfo[i].type, mdp2->heapinfo[i].type);
171 addr_block1 = (char*)heapbase1 + ((i-1)*BLOCKSIZE);
172 xbt_assert(addr_block1 < breakval1, "Block address out of heap memory used");
174 addr_block2 = (char*)heapbase2 + ((i-1)*BLOCKSIZE);
175 xbt_assert(addr_block2 < breakval2, "Block address out of heap memory used");
177 if(mdp1->heapinfo[i].type == 0){ /* busy large block */
179 if(mdp1->heapinfo[i].busy_block.size != mdp2->heapinfo[i].busy_block.size){
180 fprintf(stderr,"Different size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.size, mdp2->heapinfo[i].busy_block.size);
185 if(mdp1->heapinfo[i].busy_block.busy_size != mdp2->heapinfo[i].busy_block.busy_size){
186 fprintf(stderr,"Different busy_size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.busy_size, mdp2->heapinfo[i].busy_block.busy_size);
191 /* Hamming distance on different blocks */
194 //for(k=0;k<mdp1->heapinfo[i].busy_block.size * BLOCKSIZE;k++){
195 for(k=0;k<mdp1->heapinfo[i].busy_block.busy_size;k++){
196 if((((char *)addr_block1) + k != 0) && (((char *)addr_block2) + k != 0)){
197 if(memcmp(((char *)addr_block1) + k, ((char *)addr_block2) + k, 1) != 0){
198 fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1 + k, (char *)addr_block2 + k, i); fflush(NULL);
199 pointer_align = (k / sizeof(void*)) * sizeof(void*);
200 address_pointed1 = *((void **)((char *)addr_block1 + pointer_align));
201 address_pointed2 = *((void **)((char *)addr_block2 + pointer_align));
202 if(((address_pointed1 > (void *)s_heap) && (address_pointed1 < mdp1->breakval)) && ((address_pointed2 > (void *)s_heap) && (address_pointed2 < mdp2->breakval))){
203 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) % BLOCKSIZE;
204 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) % BLOCKSIZE;
205 //fprintf(stderr, "Blocks pointed : %d - %d\n", block_pointed1, block_pointed2);
206 if((block_pointed1 == 0) && (block_pointed2 == 0)){
207 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
208 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
209 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
210 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
211 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
212 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
213 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
214 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
217 fprintf(stderr, "False difference detected\n");
222 }else{ // Fragmented block
223 addr_block_pointed1 = (char*)mdp1 + ((char *)address_pointed1 - (char *)s_heap);
224 addr_block_pointed2 = (char*)mdp2 + ((char *)address_pointed2 - (char *)s_heap);
225 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[0] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[0]){
226 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_frag.frag_size[0]) != 0){
227 fprintf(stderr, "Pointed fragments are different \n");
230 fprintf(stderr, "False difference detected\n");
233 fprintf(stderr, "Different size of pointed fragments\n");
238 fprintf(stderr, "Pointers on blocks with different types \n");
242 /* FIXME : peut pointer vers le début d'un fragment mais dans un bloc */
243 fprintf(stderr, "Pointed addresses (%p - %p) not valid\n", address_pointed1, address_pointed2);
247 fprintf(stderr, "Pointed addresses (%p - %p) not in std_heap\n", address_pointed1, address_pointed2);
256 fprintf(stderr,"\nDifferent data in large block %zu (size = %zu (in blocks), busy_size = %zu (in bytes))\n", i, mdp1->heapinfo[i].busy_block.size, mdp1->heapinfo[i].busy_block.busy_size);
258 fprintf(stderr, "Hamming distance between blocks : %d\n", distance);
259 mmalloc_backtrace_block_display(mdp1, i);
260 mmalloc_backtrace_block_display(mdp2, i);
261 fprintf(stderr, "\n");
263 total_distance += distance;
270 if(mdp1->heapinfo[i].type > 0){ /* busy fragmented block */
272 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
273 fprintf(stderr,"Different size of fragments in fragmented block %zu : %d - %d\n", i, mdp1->heapinfo[i].type, mdp2->heapinfo[i].type); fflush(NULL);
277 if(mdp1->heapinfo[i].busy_frag.nfree != mdp2->heapinfo[i].busy_frag.nfree){
278 fprintf(stderr,"Different free fragments in fragmented block %zu : %zu - %zu\n", i, mdp1->heapinfo[i].busy_frag.nfree, mdp2->heapinfo[i].busy_frag.nfree); fflush(NULL);
282 if(mdp1->heapinfo[i].busy_frag.first != mdp2->heapinfo[i].busy_frag.first){
283 fprintf(stderr,"Different busy_size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.busy_size, mdp2->heapinfo[i].busy_block.busy_size); fflush(NULL);
287 frag_size = pow(2, mdp1->heapinfo[i].type);
289 for(j=0; j< (BLOCKSIZE/frag_size); j++){
291 if(mdp1->heapinfo[i].busy_frag.frag_size[j] != mdp2->heapinfo[i].busy_frag.frag_size[j]){
292 fprintf(stderr,"Different busy_size for fragment %zu in block %zu : %hu - %hu\n", j, i, mdp1->heapinfo[i].busy_frag.frag_size[j], mdp2->heapinfo[i].busy_frag.frag_size[j]); fflush(NULL);
296 if(mdp1->heapinfo[i].busy_frag.frag_size[j] > 0){
298 addr_frag1 = (char *)addr_block1 + (j * frag_size);
299 xbt_assert(addr_frag1 < breakval1, "Fragment address out of heap memory used");
301 addr_frag2 = (char *)addr_block2 + (j * frag_size);
302 xbt_assert(addr_frag1 < breakval1, "Fragment address out of heap memory used");
304 /* Hamming distance on different blocks */
306 //for(k=0;k<frag_size;k++){
307 for(k=0;k<mdp1->heapinfo[i].busy_frag.frag_size[j];k++){
308 if((((char *)addr_frag1) + k != 0) && (((char *)addr_frag2) + k != 0)){
309 if(memcmp(((char *)addr_frag1) + k, ((char *)addr_frag2) + k, 1) != 0){
310 fprintf(stderr, "Different byte (offset=%d) (%p - %p) in fragment %zu in block %zu\n", k, (char *)addr_frag1 + k, (char *)addr_frag2 + k, j, i); fflush(NULL);
311 pointer_align = (k / sizeof(void*)) * sizeof(void*);
312 address_pointed1 = *((void **)((char *)addr_frag1 + pointer_align));
313 address_pointed2 = *((void **)((char *)addr_frag2 + pointer_align));
314 if(((address_pointed1 > (void *)s_heap) && (address_pointed1 < mdp1->breakval)) && ((address_pointed2 > (void *)s_heap) && (address_pointed2 < mdp2->breakval))){
315 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) % BLOCKSIZE;
316 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) % BLOCKSIZE;
317 if((block_pointed1 == 0) && (block_pointed2 == 0)){
318 block_pointed1 = ((char*)address_pointed1 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
319 block_pointed2 = ((char*)address_pointed2 - (char*)((struct mdesc*)s_heap)->heapbase) / BLOCKSIZE + 1;
320 if(mdp1->heapinfo[block_pointed1].type == mdp2->heapinfo[block_pointed2].type){
321 if(mdp1->heapinfo[block_pointed1].type == 0){ // Large block
322 if(mdp1->heapinfo[block_pointed1].busy_block.busy_size == mdp2->heapinfo[block_pointed2].busy_block.busy_size){
323 addr_block_pointed1 = (char*)heapbase1 + ((block_pointed1 - 1)*BLOCKSIZE);
324 addr_block_pointed2 = (char*)heapbase2 + ((block_pointed2 - 1)*BLOCKSIZE);
325 fprintf(stderr, "Memcmp between blocks %d and %d (size = %zu)\n", block_pointed1, block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size);
326 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_block.busy_size) != 0){
329 fprintf(stderr, "False difference detected\n");
334 }else{ // Fragmented block
335 addr_block_pointed1 = (char*)mdp1 + ((char *)address_pointed1 - (char *)s_heap);
336 addr_block_pointed2 = (char*)mdp2 + ((char *)address_pointed2 - (char *)s_heap);
337 if(mdp1->heapinfo[block_pointed1].busy_frag.frag_size[0] == mdp2->heapinfo[block_pointed2].busy_frag.frag_size[0]){
338 if(memcmp(addr_block_pointed1, addr_block_pointed2, mdp1->heapinfo[block_pointed1].busy_frag.frag_size[0]) != 0){
341 fprintf(stderr, "False difference detected\n");
348 fprintf(stderr, "Pointers on blocks with different types \n");
352 /* FIXME : peut pointer vers le début d'un fragment mais dans un bloc */
353 fprintf(stderr, "Pointed addresses (%p - %p) not valid \n", address_pointed1, address_pointed2);
357 fprintf(stderr, "Pointed addresses (%p - %p) not in std_heap\n", address_pointed1, address_pointed2);
366 fprintf(stderr,"\nDifferent data in fragment %zu (size = %zu, size used = %hu) in block %zu \n", j, frag_size, mdp1->heapinfo[i].busy_frag.frag_size[j], i);
367 fprintf(stderr, "Hamming distance between fragments : %d\n", distance);
368 mmalloc_backtrace_fragment_display(mdp1, i, j);
369 mmalloc_backtrace_fragment_display(mdp2, i, j);
370 fprintf(stderr, "\n");
372 total_distance += distance;
381 }else{ /* free block */
392 fprintf(stderr, "Hamming distance between heap regions : %d\n", total_distance);
398 /* void *get_end_addr_heap(void *heap){ */
400 /* FILE *fp; /\* File pointer to process's proc maps file *\/ */
401 /* char *line = NULL; /\* Temporal storage for each line that is readed *\/ */
402 /* ssize_t read; /\* Number of bytes readed *\/ */
403 /* size_t n = 0; /\* Amount of bytes to read by getline *\/ */
405 /* fp = fopen("/proc/self/maps", "r"); */
408 /* perror("fopen failed"); */
411 /* xbt_dynar_t lfields = NULL; */
412 /* xbt_dynar_t start_end = NULL; */
413 /* void *start_addr; */
414 /* void *end_addr; */
416 /* while ((read = getline(&line, &n, fp)) != -1) { */
418 /* xbt_str_trim(line, NULL); */
419 /* xbt_str_strip_spaces(line); */
420 /* lfields = xbt_str_split(line,NULL); */
422 /* start_end = xbt_str_split(xbt_dynar_get_as(lfields, 0, char*), "-"); */
423 /* start_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 0, char*), NULL, 16); */
424 /* end_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 1, char*), NULL, 16); */
426 /* if(start_addr == heap){ */
429 /* xbt_dynar_reset(lfields); */
430 /* xbt_free(lfields); */
431 /* xbt_dynar_reset(start_end); */
432 /* xbt_free(start_end); */
433 /* return end_addr; */
438 /* xbt_dynar_reset(lfields); */
439 /* xbt_free(lfields); */
440 /* xbt_dynar_reset(start_end); */
441 /* xbt_free(start_end); */
450 void mmalloc_display_info_heap(xbt_mheap_t h){