# Memory management data structures, part 2: Heap

# ------------------------------ Specification --------------------------------

#ifdef SPVW_PAGES
# Pages is a collection of pages.
# typedef ... Pages;
#endif

# Heap is a collection of pages, together with some management information.
# typedef ... Heap;

# Iteration through all pages of a heap.
# map_heap(heap,pagevar,statement);

# ------------------------------ Implementation -------------------------------

#ifdef SPVW_PAGES

typedef Page* Pages;

typedef struct {
  Pages inuse;     # the currently used pages
  # _Page reserve; # a reserve-page ??
  # heap for objects of fixed length:
  Pages lastused; # a cache for the last used page
} Heap;

  #define map_heap(heap,pagevar,statement)  \
    { AVL_map((heap).inuse,pagevar,statement); }

#endif

#ifdef SPVW_BLOCKS

typedef Page Pages;

#ifdef GENERATIONAL_GC
# For each physical memory page of the old generation we memorize,
# which pointers to objects of the new generation this page contains,
# so that we do not have to access this page.
# So long as we do not access this page for writing, this information stays
# up to date. But after we have written to this page, we must regenerate
# this information at the next GC. Additionally, this should be done
# without accessing the page before it or after it.
typedef struct {
  gcv_object_t* p; # address of the pointer, within an old object
  object o;  # o = *p, pointer to a new object
} old_new_pointer_t;
typedef struct {
  # traversal of the pointers in the page requires the following:
    # continuation of the last object on previous page:
    gcv_object_t* continued_addr;
    uintC continued_count;
    # first object, that begins at this page (or later) :
    aint firstobject;
  # the cache of pointers to objects of the new generation:
  int protection; # PROT_NONE : only the cache is valid.
                  # PROT_READ : both page and cache are valid.
                  # PROT_READ_WRITE : only the page is valid.
  uintL cache_size; # number of cached pointers
  old_new_pointer_t* cache; # cache of all pointers into the new generation
} physpage_state_t;
#endif

typedef struct {
  Pages pages;
  #if defined(SPVW_PURE_BLOCKS) || (defined(SPVW_MIXED_BLOCKS) && defined(TRIVIALMAP_MEMORY))
  aint heap_limit;
  #if !defined(SPVW_MIXED_BLOCKS_OPPOSITE) # SPVW_PURE_BLOCKS || SPVW_MIXED_BLOCKS_STAGGERED
  aint heap_hardlimit;
  #endif
  #endif
  #ifdef SELFMADE_MMAP
  uintL memfile_offset;
  uintL memfile_numpages;
  uintB* memfile_pages;
  #endif
  #ifdef GENERATIONAL_GC
  aint heap_gen0_start;
  aint heap_gen0_end;
  aint heap_gen1_start;
  physpage_state_t* physpages;
  #endif
} Heap;
#define heap_start  pages.page_start
#define heap_end    pages.page_end
#if defined(SPVW_PURE_BLOCKS) || (defined(SPVW_MIXED_BLOCKS) && defined(TRIVIALMAP_MEMORY))
# always: heap_start <= heap_end <= heap_limit.
#if defined(SPVW_MIXED_BLOCKS_OPPOSITE)
# resp. heap_limit <= heap_start <= heap_end.
#endif
# the memory between heap_start and heap_end is occupied,
# the memory between heap_end (resp. heap_start) and heap_limit is free.
# heap_limit is enlarged (resp. reduced), if necessary.
#if !defined(SPVW_MIXED_BLOCKS_OPPOSITE)
# heap_hardlimit is the biggest resp. smallest admissible value of heap_limit.
#endif
#else # defined(SPVW_MIXED_BLOCKS) && !defined(TRIVIALMAP_MEMORY)
# always: heap_start <= heap_end.
# the memory between heap_start and heap_end is occupied,
#endif
#ifdef GENERATIONAL_GC
#ifndef SPVW_MIXED_BLOCKS_OPPOSITE
# the generation 0 (older generation) begins at     heap_gen0_start,
#                                     reaches until heap_gen0_end.
# the generation 1 (newer generation) begins at     heap_gen1_start,
#                                     reaches until heap_end.
# heap_gen0_start and heap_gen1_start are divisible by physpagesize.
# Between heap_gen0_end and heap_gen1_start is a gap of
# less than a page.
# heap_start is either = heap_gen0_start or = heap_gen1_start.
#else
# the generation 0 (older generation) begins at     heap_gen0_start,
#                                     reaches until heap_gen0_end.
# For mem.varobjects:
#   generation 1 (newer generation)   begins at     heap_gen1_start,
#                                     reaches until heap_end.
#   heap_gen0_start and heap_gen1_start are divisible by physpagesize.
#   Between heap_gen0_end and heap_gen1_start is a gap of
#   less than a page.
#   heap_start is either = heap_gen0_start or = heap_gen1_start.
# For mem.conses:
    #define heap_gen1_end  heap_gen1_start
#   generation 1 (newer generation) begins at     heap_start,
#                                   reaches until heap_gen1_end.
#   heap_gen1_end and heap_gen0_end are divisible by physpagesize.
#   Between heap_gen1_end and heap_gen0_start is a gap of
#   less than a page.
#   heap_end is either = heap_gen1_end or = heap_gen0_end.
#endif
# the status of address addr (heap_gen0_start <= addr < heap_gen0_end) is
# given by physpages[(addr>>physpageshift)-(heap_gen0_start>>physpageshift)] .
# physpages=NULL is possible, if there was not sufficient space!
#endif

  #define map_heap(heap,pagevar,statement)  \
    { var Page* pagevar = &(heap).pages; statement; }

#endif
