< prev index next >

src/hotspot/share/memory/filemap.cpp

Print this page

        

*** 1078,1088 **** return rs; } // Memory map a region in the address space. ! static const char* shared_region_name[] = { "MiscData", "ReadWrite", "ReadOnly", "MiscCode", "String1", "String2", "OpenArchive1", "OpenArchive2" }; char* FileMapInfo::map_regions(int regions[], char* saved_base[], size_t len) { char* prev_top = NULL; char* curr_base; --- 1078,1088 ---- return rs; } // Memory map a region in the address space. ! static const char* shared_region_name[] = { "MiscData", "ReadWrite", "ReadOnly", "MiscCode", "OptionalData", "String1", "String2", "OpenArchive1", "OpenArchive2" }; char* FileMapInfo::map_regions(int regions[], char* saved_base[], size_t len) { char* prev_top = NULL; char* curr_base;
*** 1092,1102 **** curr_base = map_region(regions[i], &curr_top); if (curr_base == NULL) { return NULL; } if (i > 0) { ! // We require that mc->rw->ro->md to be laid out consecutively, with no // gaps between them. That way, we can ensure that the OS won't be able to // allocate any new memory spaces inside _shared_metaspace_{base,top}, which // would mess up the simple comparision in MetaspaceShared::is_in_shared_metaspace(). assert(curr_base == prev_top, "must be"); } --- 1092,1102 ---- curr_base = map_region(regions[i], &curr_top); if (curr_base == NULL) { return NULL; } if (i > 0) { ! // We require that mc->rw->ro->md->od to be laid out consecutively, with no // gaps between them. That way, we can ensure that the OS won't be able to // allocate any new memory spaces inside _shared_metaspace_{base,top}, which // would mess up the simple comparision in MetaspaceShared::is_in_shared_metaspace(). assert(curr_base == prev_top, "must be"); }
< prev index next >