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 */
11 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt,
12 "Logging specific to mm_diff in mmalloc");
14 extern char *xbt_binary_name;
16 void mmalloc_backtrace_display(xbt_mheap_t mdp, void *ptr){
17 size_t block = BLOCK(ptr);
21 if ((char *) ptr < (char *) mdp->heapbase || block > mdp->heapsize) {
22 fprintf(stderr,"Ouch, this pointer is not mine. I cannot display its backtrace. I refuse it to death!!\n");
26 type = mdp->heapinfo[block].type;
29 //fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
32 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
33 fprintf(stderr,"No backtrace available for that block, sorry.\n");
37 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
38 e.used = mdp->heapinfo[block].busy_block.bt_size;
40 xbt_ex_setup_backtrace(&e);
42 fprintf(stderr, "(backtrace not set)\n");
43 } else if (e.bt_strings == NULL) {
44 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
48 fprintf(stderr, "Backtrace of where the block %p where malloced (%d frames):\n",ptr,e.used);
49 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
50 fprintf(stderr,"%d",i);fflush(NULL);
51 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
57 void mmalloc_backtrace_block_display(xbt_mheap_t mdp, size_t block){
62 type = mdp->heapinfo[block].type;
65 fprintf(stderr,"Only full blocks are backtraced for now. Ignoring your request.\n");
68 if (mdp->heapinfo[block].busy_block.bt_size == 0) {
69 fprintf(stderr,"No backtrace available for that block, sorry.\n");
73 memcpy(&e.bt,&(mdp->heapinfo[block].busy_block.bt),sizeof(void*)*XBT_BACKTRACE_SIZE);
74 e.used = mdp->heapinfo[block].busy_block.bt_size;
76 xbt_ex_setup_backtrace(&e);
78 fprintf(stderr, "(backtrace not set)\n");
79 } else if (e.bt_strings == NULL) {
80 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
84 fprintf(stderr, "Backtrace of where the block %zu where malloced (%d frames):\n", block ,e.used);
85 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
86 fprintf(stderr,"%d",i);fflush(NULL);
87 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
92 void mmalloc_backtrace_fragment_display(xbt_mheap_t mdp, size_t block, size_t frag){
96 memcpy(&e.bt,&(mdp->heapinfo[block].busy_frag.bt[frag]),sizeof(void*)*XBT_BACKTRACE_SIZE);
97 e.used = XBT_BACKTRACE_SIZE;
99 xbt_ex_setup_backtrace(&e);
101 fprintf(stderr, "(backtrace not set)\n");
102 } else if (e.bt_strings == NULL) {
103 fprintf(stderr, "(backtrace not ready to be computed. %s)\n",xbt_binary_name?"Dunno why":"xbt_binary_name not setup yet");
107 fprintf(stderr, "Backtrace of where the fragment %zu in block %zu where malloced (%d frames):\n", frag, block ,e.used);
108 for (i = 0; i < e.used; i++) /* no need to display "xbt_backtrace_display" */{
109 fprintf(stderr,"%d",i);fflush(NULL);
110 fprintf(stderr, "---> %s\n", e.bt_strings[i] + 4);
115 int mmalloc_compare_heap(xbt_mheap_t mdp1, xbt_mheap_t mdp2, void* s_heap, void* r_heap){
117 if(mdp1 == NULL && mdp2 == NULL){
118 fprintf(stderr, "Malloc descriptors null\n");
122 int errors = mmalloc_compare_mdesc(mdp1, mdp2, s_heap, r_heap);
128 int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2, void* s_heap, void* r_heap){
132 /*if(mdp1->headersize != mdp2->headersize){
133 fprintf(stderr, "Different size of the file header for the mapped files\n");
137 if(mdp1->refcount != mdp2->refcount){
138 fprintf(stderr, "Different number of processes that attached the heap\n");
142 if(strcmp(mdp1->magic, mdp2->magic) != 0){
143 fprintf(stderr,"Different magic number\n");
147 if(mdp1->flags != mdp2->flags){
148 fprintf(stderr,"Different flags\n");
152 if(mdp1->heapsize != mdp2->heapsize){
153 fprintf(stderr,"Different number of info entries\n");
157 if(mdp1->heapbase != mdp2->heapbase){
158 fprintf(stderr,"Different first block of the heap\n");
162 if(mdp1->heapindex != mdp2->heapindex){
163 fprintf(stderr,"Different index for the heap table : %zu - %zu\n", mdp1->heapindex, mdp2->heapindex);
167 if(mdp1->base != mdp2->base){
168 fprintf(stderr,"Different base address of the memory region\n");
172 if(mdp1->breakval != mdp2->breakval){
173 fprintf(stderr,"Different current location in the memory region\n");
177 if(mdp1->top != mdp2->top){
178 fprintf(stderr,"Different end of the current location in the memory region\n");
182 if(mdp1->heaplimit != mdp2->heaplimit){
183 fprintf(stderr,"Different limit of valid info table indices\n");
187 if(mdp1->fd != mdp2->fd){
188 fprintf(stderr,"Different file descriptor for the file to which this malloc heap is mapped\n");
192 if(mdp1->version != mdp2->version){
193 fprintf(stderr,"Different version of the mmalloc package\n");
198 void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2;
207 char *pointed_address1, *pointed_address2;
209 /* Check busy blocks*/
211 while(i < mdp1->heaplimit){
213 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
214 fprintf(stderr,"Different type of block : %d - %d\n", mdp1->heapinfo[i].type, mdp2->heapinfo[i].type);
218 addr_block1 = (char *)mdp1 + sizeof(struct mdesc) + (i * BLOCKSIZE);
219 addr_block2 = (char *)mdp2 + sizeof(struct mdesc) + (i * BLOCKSIZE);
221 if(mdp1->heapinfo[i].type == 0){ /* busy large block */
223 if(mdp1->heapinfo[i].busy_block.size != mdp2->heapinfo[i].busy_block.size){
224 fprintf(stderr,"Different size of a large cluster : %zu - %zu\n", mdp1->heapinfo[i].busy_block.size, mdp2->heapinfo[i].busy_block.size);
228 if(mdp1->heapinfo[i].busy_block.busy_size != mdp2->heapinfo[i].busy_block.busy_size){
229 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);
233 //if(memcmp(addr_block1, addr_block2, (mdp1->heapinfo[i].busy_block.size)) != 0){
234 if(memcmp(addr_block1, addr_block2, (mdp1->heapinfo[i].busy_block.busy_size)) != 0){
235 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);
237 /* Hamming distance on different blocks */
239 //for(k=0;k<mdp1->heapinfo[i].busy_block.size;k++){
240 for(k=0;k<mdp1->heapinfo[i].busy_block.busy_size;k++){
241 if(memcmp(((char *)addr_block1) + k, ((char *)addr_block2) + k, 1) != 0){
242 fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1 + k, (char *)addr_block2 + k, i);
244 pointer_align = (k / sizeof(void*)) * sizeof(void*);
245 pointed_address1 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_block1 + pointer_align)), s_heap, r_heap));
246 pointed_address2 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_block2 + pointer_align)), s_heap, r_heap));
247 fprintf(stderr, "Pointed address : %p (in %s) - %p (in %s)\n", *((void **)((char *)addr_block1 + pointer_align)), pointed_address1, *((void **)((char *)addr_block2 + pointer_align)), pointed_address2);
248 if((strcmp(pointed_address1, pointed_address2) == 0) && (strcmp(pointed_address1, "std_heap") == 0)){
249 /* FIXME : compare value pointed thanks to DWARF */
254 fprintf(stderr, "Hamming distance between blocks : %d\n", distance);
256 mmalloc_backtrace_block_display(mdp1, i);
257 mmalloc_backtrace_block_display(mdp2, i);
261 i = i + mdp1->heapinfo[i].busy_block.size + 1;
265 if(mdp1->heapinfo[i].type > 0){ /* busy fragmented block */
267 if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){
268 fprintf(stderr,"Different size of fragments in fragmented block %zu : %d - %d\n", i, mdp1->heapinfo[i].type, mdp2->heapinfo[i].type);
272 if(mdp1->heapinfo[i].busy_frag.nfree != mdp2->heapinfo[i].busy_frag.nfree){
273 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);
277 if(mdp1->heapinfo[i].busy_frag.first != mdp2->heapinfo[i].busy_frag.first){
278 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);
282 frag_size = pow(2, mdp1->heapinfo[i].type);
284 for(j=0; j< (BLOCKSIZE/frag_size); j++){
286 if(mdp1->heapinfo[i].busy_frag.frag_size[j] != mdp2->heapinfo[i].busy_frag.frag_size[j]){
287 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]);
291 if(mdp1->heapinfo[i].busy_frag.frag_size[j] > 0){
293 addr_frag1 = (char *)addr_block1 + (j * frag_size);
294 addr_frag2 = (char *)addr_block2 + (j * frag_size);
296 //if(memcmp(addr_frag1, addr_frag2, frag_size) != 0){
297 if(memcmp(addr_frag1, addr_frag2, mdp1->heapinfo[i].busy_frag.frag_size[j]) != 0){
298 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);
300 /* Hamming distance on different blocks */
302 //for(k=0;k<frag_size;k++){
303 for(k=0;k<mdp1->heapinfo[i].busy_frag.frag_size[j];k++){
304 if(memcmp(((char *)addr_frag1) + k, ((char *)addr_frag2) + k, 1) != 0){
305 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);
307 pointer_align = (k / sizeof(void*)) * sizeof(void*);
308 pointed_address1 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_frag1 + pointer_align)), s_heap, r_heap));
309 pointed_address2 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_frag2 + pointer_align)), s_heap, r_heap));
310 fprintf(stderr, "Pointed address : %p (in %s) - %p (in %s)\n", *((void **)((char *)addr_frag1 + pointer_align)), pointed_address1, *((void **)((char *)addr_frag2 + pointer_align)), pointed_address2);
311 if((strcmp(pointed_address1, pointed_address2) == 0) && (strcmp(pointed_address1, "std_heap") == 0)){
312 /* FIXME : compare value pointed thanks to DWARF */
317 fprintf(stderr, "Hamming distance between fragments : %d\n", distance);
319 mmalloc_backtrace_fragment_display(mdp1, i, j);
320 mmalloc_backtrace_fragment_display(mdp2, i, j);
329 }else{ /* free block */
339 free(pointed_address1);
340 free(pointed_address2);
346 const char* get_addr_memory_map(void *addr, void* s_heap, void* r_heap){
348 FILE *fp; /* File pointer to process's proc maps file */
349 char *line = NULL; /* Temporal storage for each line that is readed */
350 ssize_t read; /* Number of bytes readed */
351 size_t n = 0; /* Amount of bytes to read by getline */
353 fp = fopen("/proc/self/maps", "r");
356 perror("fopen failed");
364 xbt_dynar_t lfields = NULL;
365 xbt_dynar_t start_end = NULL;
369 while ((read = getline(&line, &n, fp)) != -1) {
371 xbt_str_trim(line, NULL);
372 xbt_str_strip_spaces(line);
373 lfields = xbt_str_split(line,NULL);
375 start_end = xbt_str_split(xbt_dynar_get_as(lfields, 0, char*), "-");
376 start_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 0, char*), NULL, 16);
377 end_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 1, char*), NULL, 16);
379 if((addr > start_addr) && ( addr < end_addr)){
382 if(start_addr == s_heap)
384 if(start_addr == r_heap)
386 if(xbt_dynar_length(lfields) == 6)
387 return xbt_dynar_get_as(lfields, xbt_dynar_length(lfields) - 1, char*);
396 return "Unknown area";
400 void mmalloc_display_info_heap(xbt_mheap_t h){