-
- MC_SET_RAW_MEM;
-
-/* Get the start address and size of libsimgrid's data segment */
-/* CAVEAT: Here we are assuming that get_memory_map() */
-/* returns an array with the maps sorted from lower addresses to higher ones. */
- int i;
- char *libname, *tmp;
-
- /* Get memory map */
- memory_map_t maps;
- maps = get_memory_map();
-
- for(i=0; i < maps->mapsize; i++){
-
- if(maps->regions[i].inode != 0){
-
- tmp = xbt_strdup(maps->regions[i].pathname);
- libname = basename(tmp);
-
-#if 0
- if (maps->regions[i].perms & MAP_WRITE &&
- maps->regions[i].pathname[0] != '\0' && /* do not take anonymous segments: what are they? */
- strcmp("[heap]",maps->regions[i].pathname) && /* do not take standard heap: mmalloc saves it already */
- strcmp("[stack]",maps->regions[i].pathname) /* this is maestro's stack. No need to save it */
- ) {
- /* FIXME: we should save the data of more segments, in a list of block to save */
- }
-#endif
- /* for now, we only save the data of libsimgrid (FIXME) */
- if( strncmp("libsimgrid.so.", libname, 14) == 0 && maps->regions[i].perms & MAP_WRITE){
- libsimgrid_data_addr_start = maps->regions[i].start_addr;
- libsimgrid_data_size = (size_t)((char *)maps->regions[i+1].start_addr - (char *)maps->regions[i].start_addr);
- xbt_free(tmp);
- break;
- }
- xbt_free(tmp);
- }
- }
-
- xbt_assert0(libsimgrid_data_addr_start != NULL,
- "Cannot determine libsimgrid's .data segment address");
-
- MC_UNSET_RAW_MEM;
-}
-
-/* Finish the memory subsystem */
-void MC_memory_exit()
-{
- mmalloc_detach(std_heap);
- mmalloc_detach(raw_heap);
- actual_heap = NULL;
-}
-
-void *malloc(size_t n) {
- void *ret = mmalloc(actual_heap, n);
-
- DEBUG2("%zu bytes were allocated at %p",n, ret);
- return ret;
-}
-
-void *calloc(size_t nmemb, size_t size)
-{
- size_t total_size = nmemb * size;
-
- void *ret = mmalloc(actual_heap, total_size);
-
-/* Fill the allocated memory with zeroes to mimic calloc behaviour */
- memset(ret,'\0', total_size);
-
- DEBUG2("%zu bytes were mallocated and zeroed at %p",total_size, ret);
- return ret;
-}
-
-void *realloc(void *p, size_t s)
-{
- void *ret = NULL;
-
- if (s) {
- if (p)
- ret = mrealloc(actual_heap, p,s);
- else
- ret = malloc(s); /* FIXME: shouldn't this be mmalloc? */
- } else {
- if (p) {
- free(p);
- }
- }
-
- DEBUG2("%zu bytes were reallocated at %p",s,ret);
- return ret;
-}
-
-void free(void *p)
-{
- DEBUG1("%p was freed",p);
-// xbt_assert(actual_heap != NULL); FIXME: I had to comment this
- return mfree(actual_heap, p);
-}
-
-/* FIXME: Horrible hack! because the mmalloc library doesn't provide yet of */
-/* an API to query about the status of a heap, we simply call mmstats and */
-/* because I now how does structure looks like, then I redefine it here */
-
-struct mstats
- {
- size_t bytes_total; /* Total size of the heap. */
- size_t chunks_used; /* Chunks allocated by the user. */
- size_t bytes_used; /* Byte total of user-allocated chunks. */
- size_t chunks_free; /* Chunks in the free list. */
- size_t bytes_free; /* Byte total of chunks in the free list. */
- };
-
-extern struct mstats mmstats(void *);
-
-/* Copy std_heap to "to_heap" allocating the required space for it */
-size_t MC_save_heap(void **to_heap)
-{
- size_t heap_size = mmstats(std_heap).bytes_total;
-
- *to_heap = calloc(heap_size, 1);
-
- xbt_assert(*to_heap != NULL);
-
- memcpy(*to_heap, std_heap, heap_size);
-
- return heap_size;