X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/ae8140f19db6cb86f753e32499eab49190846d1f..255034c505d975829a242b98eceeb2c2a4df4517:/src/xbt/mmalloc/mm_diff.c diff --git a/src/xbt/mmalloc/mm_diff.c b/src/xbt/mmalloc/mm_diff.c index 988bbe3685..14adfa21b5 100644 --- a/src/xbt/mmalloc/mm_diff.c +++ b/src/xbt/mmalloc/mm_diff.c @@ -6,6 +6,7 @@ * under the terms of the license (GNU LGPL) which comes with this package. */ #include "xbt/ex_interface.h" /* internals of backtrace setup */ +#include "xbt/str.h" XBT_LOG_NEW_DEFAULT_SUBCATEGORY(mm_diff, xbt, "Logging specific to mm_diff in mmalloc"); @@ -111,24 +112,24 @@ void mmalloc_backtrace_fragment_display(xbt_mheap_t mdp, size_t block, size_t fr } } -int mmalloc_compare_heap(xbt_mheap_t mdp1, xbt_mheap_t mdp2){ +int mmalloc_compare_heap(xbt_mheap_t mdp1, xbt_mheap_t mdp2, void* s_heap, void* r_heap){ if(mdp1 == NULL && mdp2 == NULL){ - XBT_DEBUG("Malloc descriptors null\n"); + fprintf(stderr, "Malloc descriptors null\n"); return 0; } - int errors = mmalloc_compare_mdesc(mdp1, mdp2); + int errors = mmalloc_compare_mdesc(mdp1, mdp2, s_heap, r_heap); return (errors > 0); } -int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ +int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2, void* s_heap, void* r_heap){ int errors = 0; - if(mdp1->headersize != mdp2->headersize){ + /*if(mdp1->headersize != mdp2->headersize){ fprintf(stderr, "Different size of the file header for the mapped files\n"); return 1; } @@ -151,21 +152,18 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ if(mdp1->heapsize != mdp2->heapsize){ fprintf(stderr,"Different number of info entries\n"); return 1; - } - + } if(mdp1->heapbase != mdp2->heapbase){ fprintf(stderr,"Different first block of the heap\n"); return 1; } - if(mdp1->heapindex != mdp2->heapindex){ fprintf(stderr,"Different index for the heap table : %zu - %zu\n", mdp1->heapindex, mdp2->heapindex); return 1; } - if(mdp1->base != mdp2->base){ fprintf(stderr,"Different base address of the memory region\n"); return 1; @@ -194,8 +192,7 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ if(mdp1->version != mdp2->version){ fprintf(stderr,"Different version of the mmalloc package\n"); return 1; - } - + }*/ size_t i, j; void *addr_block1, *addr_block2, *addr_frag1, *addr_frag2; @@ -205,18 +202,21 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ int k; int distance = 0; + int pointer_align; + + char *pointed_address1 = NULL, *pointed_address2 = NULL; /* Check busy blocks*/ - while(i < mdp1->heapindex){ + while(i < mdp1->heaplimit){ if(mdp1->heapinfo[i].type != mdp2->heapinfo[i].type){ fprintf(stderr,"Different type of block : %d - %d\n", mdp1->heapinfo[i].type, mdp2->heapinfo[i].type); errors++; } - addr_block1 = (char *)mdp1 + sizeof(struct mdesc) + (i * BLOCKSIZE); - addr_block2 = (char *)mdp2 + sizeof(struct mdesc) + (i * BLOCKSIZE); + addr_block1 = (char *)mdp1 + mdp1->headersize + ((i-1) * BLOCKSIZE); + addr_block2 = (char *)mdp2 + mdp2->headersize + ((i-1) * BLOCKSIZE); if(mdp1->heapinfo[i].type == 0){ /* busy large block */ @@ -230,15 +230,24 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ errors++; } + //if(memcmp(addr_block1, addr_block2, (mdp1->heapinfo[i].busy_block.size)) != 0){ if(memcmp(addr_block1, addr_block2, (mdp1->heapinfo[i].busy_block.busy_size)) != 0){ 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); /* Hamming distance on different blocks */ distance = 0; + //for(k=0;kheapinfo[i].busy_block.size;k++){ for(k=0;kheapinfo[i].busy_block.busy_size;k++){ if(memcmp(((char *)addr_block1) + k, ((char *)addr_block2) + k, 1) != 0){ - fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1, (char *)addr_block2, i); + fprintf(stderr, "Different byte (offset=%d) (%p - %p) in block %zu\n", k, (char *)addr_block1 + k, (char *)addr_block2 + k, i); distance++; + pointer_align = (k / sizeof(void*)) * sizeof(void*); + pointed_address1 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_block1 + pointer_align)), s_heap, r_heap)); + pointed_address2 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_block2 + pointer_align)), s_heap, r_heap)); + 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); + if((strcmp(pointed_address1, pointed_address2) == 0) && (strcmp(pointed_address1, "std_heap") == 0)){ + /* FIXME : compare value pointed thanks to DWARF */ + } } } @@ -249,8 +258,10 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ errors++; } - - i = i + mdp1->heapinfo[i].busy_block.size; + if( mdp1->heapinfo[i].busy_block.size == 0) + i = i + 1; + else + i = i + mdp1->heapinfo[i].busy_block.size; }else{ @@ -285,15 +296,24 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ addr_frag1 = (char *)addr_block1 + (j * frag_size); addr_frag2 = (char *)addr_block2 + (j * frag_size); + //if(memcmp(addr_frag1, addr_frag2, frag_size) != 0){ if(memcmp(addr_frag1, addr_frag2, mdp1->heapinfo[i].busy_frag.frag_size[j]) != 0){ 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); /* Hamming distance on different blocks */ distance = 0; + //for(k=0;kheapinfo[i].busy_frag.frag_size[j];k++){ if(memcmp(((char *)addr_frag1) + k, ((char *)addr_frag2) + k, 1) != 0){ - fprintf(stderr, "Different byte (offset=%d) (%p - %p) in fragment %zu in block %zu\n", k, (char *)addr_frag1, (char *)addr_frag2, j, i); + 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); distance++; + pointer_align = (k / sizeof(void*)) * sizeof(void*); + pointed_address1 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_frag1 + pointer_align)), s_heap, r_heap)); + pointed_address2 = xbt_strdup(get_addr_memory_map(*((void **)((char *)addr_frag2 + pointer_align)), s_heap, r_heap)); + 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); + if((strcmp(pointed_address1, pointed_address2) == 0) && (strcmp(pointed_address1, "std_heap") == 0)){ + /* FIXME : compare value pointed thanks to DWARF */ + } } } @@ -319,11 +339,67 @@ int mmalloc_compare_mdesc(struct mdesc *mdp1, struct mdesc *mdp2){ } + free(pointed_address1); + free(pointed_address2); return (errors); } +const char* get_addr_memory_map(void *addr, void* s_heap, void* r_heap){ + + FILE *fp; /* File pointer to process's proc maps file */ + char *line = NULL; /* Temporal storage for each line that is readed */ + ssize_t read; /* Number of bytes readed */ + size_t n = 0; /* Amount of bytes to read by getline */ + + fp = fopen("/proc/self/maps", "r"); + + if(fp == NULL) + perror("fopen failed"); + + if(addr == NULL){ + free(line); + fclose(fp); + return "nil"; + } + + xbt_dynar_t lfields = NULL; + xbt_dynar_t start_end = NULL; + void *start_addr; + void *end_addr; + + while ((read = getline(&line, &n, fp)) != -1) { + + xbt_str_trim(line, NULL); + xbt_str_strip_spaces(line); + lfields = xbt_str_split(line,NULL); + + start_end = xbt_str_split(xbt_dynar_get_as(lfields, 0, char*), "-"); + start_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 0, char*), NULL, 16); + end_addr = (void *) strtoul(xbt_dynar_get_as(start_end, 1, char*), NULL, 16); + + if((addr > start_addr) && ( addr < end_addr)){ + free(line); + fclose(fp); + if(start_addr == s_heap) + return "std_heap"; + if(start_addr == r_heap) + return "raw_heap"; + if(xbt_dynar_length(lfields) == 6) + return xbt_dynar_get_as(lfields, xbt_dynar_length(lfields) - 1, char*); + else + return "Anonymous"; + } + + } + + free(line); + fclose(fp); + return "Unknown area"; + +} + void mmalloc_display_info_heap(xbt_mheap_t h){ }