cpp

#include "mycpp/mark_sweep_heap.h"

#include <inttypes.h>  // PRId64

#include <stdio.h>     // dprintf()

#include <stdlib.h>    // getenv()

#include <string.h>    // strlen()

#include <sys/time.h>  // gettimeofday()

#include <time.h>      // clock_gettime(), CLOCK_PROCESS_CPUTIME_ID

#include <unistd.h>    // STDERR_FILENO

#include "_build/detected-cpp-config.h"  // for GC_TIMING

#include "mycpp/gc_builtins.h"           // StringToInt()

#include "mycpp/gc_slab.h"

// TODO: Remove this guard when we have separate binaries

#if MARK_SWEEP

void MarkSweepHeap::Init() {

  Init(1000);  // collect at 1000 objects in tests

}

void MarkSweepHeap::Init(int gc_threshold) {

  gc_threshold_ = gc_threshold;

  char* e;

  e = getenv("OILS_GC_THRESHOLD");

  if (e) {

    int result;

    if (StringToInt(e, strlen(e), 10, &result)) {

      // Override collection threshold

      gc_threshold_ = result;

    }

  }

  // only for developers

  e = getenv("_OILS_GC_VERBOSE");

  if (e && strcmp(e, "1") == 0) {

    gc_verbose_ = true;

  }

  live_objs_.reserve(KiB(10));

  roots_.reserve(KiB(1));  // prevent resizing in common case

}

int MarkSweepHeap::MaybeCollect() {

  // Maybe collect BEFORE allocation, because the new object won't be rooted

  #if GC_ALWAYS

  int result = Collect();

  #else

  int result = -1;

  if (num_live() > gc_threshold_) {

    result = Collect();

  }

  #endif

  num_gc_points_++;  // this is a manual collection point

  return result;

}

  #if defined(BUMP_SMALL)

    #include "mycpp/bump_leak_heap.h"

BumpLeakHeap gBumpLeak;

  #endif

// Allocate and update stats

// TODO: Make this interface nicer.

void* MarkSweepHeap::Allocate(size_t num_bytes, int* obj_id, int* pool_id) {

  // log("Allocate %d", num_bytes);

  #ifndef NO_POOL_ALLOC

  if (num_bytes <= pool1_.kMaxObjSize) {

    *pool_id = 1;

    return pool1_.Allocate(obj_id);

  }

  if (num_bytes <= pool2_.kMaxObjSize) {

    *pool_id = 2;

    return pool2_.Allocate(obj_id);

  }

  *pool_id = 0;  // malloc(), not a pool

  #endif

  // Does the pool allocator approximate a bump allocator?  Use pool2_

  // threshold of 48 bytes.

  // These only work with GC off -- OILS_GC_THRESHOLD=[big]

  #ifdef BUMP_SMALL

  if (num_bytes <= 48) {

    return gBumpLeak.Allocate(num_bytes);

  }

  #endif

  if (to_free_.empty()) {

    // Use higher object IDs

    *obj_id = greatest_obj_id_;

    greatest_obj_id_++;

    // This check is ON in release mode

    CHECK(greatest_obj_id_ <= kMaxObjId);

  } else {

    ObjHeader* dead = to_free_.back();

    to_free_.pop_back();

    *obj_id = dead->obj_id;  // reuse the dead object's ID

    free(dead);

  }

  void* result = malloc(num_bytes);

  DCHECK(result != nullptr);

  live_objs_.push_back(static_cast<ObjHeader*>(result));

  num_live_++;

  num_allocated_++;

  bytes_allocated_ += num_bytes;

  return result;

}

  #if 0

void* MarkSweepHeap::Reallocate(void* p, size_t num_bytes) {

  FAIL(kNotImplemented);

  // This causes a double-free in the GC!

  // return realloc(p, num_bytes);

}

  #endif

// "Leaf" for marking / TraceChildren

//

// - Abort if nullptr

// - Find the header (get rid of this when remove ObjHeader member)

// - Tag::{Opaque,FixedSized,Scanned} have their mark bits set

// - Tag::{FixedSize,Scanned} are also pushed on the gray stack

void MarkSweepHeap::MaybeMarkAndPush(RawObject* obj) {

  ObjHeader* header = ObjHeader::FromObject(obj);

  if (header->heap_tag == HeapTag::Global) {  // don't mark or push

    return;

  }

  int obj_id = header->obj_id;

  #ifndef NO_POOL_ALLOC

  if (header->pool_id == 1) {

    if (pool1_.IsMarked(obj_id)) {

      return;

    }

    pool1_.Mark(obj_id);

  } else if (header->pool_id == 2) {

    if (pool2_.IsMarked(obj_id)) {

      return;

    }

    pool2_.Mark(obj_id);

  } else

  #endif

  {

    if (mark_set_.IsMarked(obj_id)) {

      return;

    }

    mark_set_.Mark(obj_id);

  }

  switch (header->heap_tag) {

  case HeapTag::Opaque:  // e.g. strings have no children

    break;

  case HeapTag::Scanned:  // these 2 types have children

  case HeapTag::FixedSize:

    gray_stack_.push_back(header);  // Push the header, not the object!

    break;

  default:

    FAIL(kShouldNotGetHere);

  }

}

void MarkSweepHeap::TraceChildren() {

  while (!gray_stack_.empty()) {

    ObjHeader* header = gray_stack_.back();

    gray_stack_.pop_back();

    switch (header->heap_tag) {

    case HeapTag::FixedSize: {

      auto fixed = reinterpret_cast<LayoutFixed*>(header->ObjectAddress());

      int mask = FIELD_MASK(*header);

      for (int i = 0; i < kFieldMaskBits; ++i) {

        if (mask & (1 << i)) {

          RawObject* child = fixed->children_[i];

          if (child) {

            MaybeMarkAndPush(child);

          }

        }

      }

      break;

    }

    case HeapTag::Scanned: {

      auto slab = reinterpret_cast<Slab<RawObject*>*>(header->ObjectAddress());

      int n = NUM_POINTERS(*header);

      for (int i = 0; i < n; ++i) {

        RawObject* child = slab->items_[i];

        if (child) {

          MaybeMarkAndPush(child);

        }

      }

      break;

    }

    default:

      // Only FixedSize and Scanned are pushed

      FAIL(kShouldNotGetHere);

    }

  }

}

void MarkSweepHeap::Sweep() {

  #ifndef NO_POOL_ALLOC

  pool1_.Sweep();

  pool2_.Sweep();

  #endif

  int last_live_index = 0;

  int num_objs = live_objs_.size();

  for (int i = 0; i < num_objs; ++i) {

    ObjHeader* obj = live_objs_[i];

    DCHECK(obj);  // malloc() shouldn't have returned nullptr

    bool is_live = mark_set_.IsMarked(obj->obj_id);

    // Compact live_objs_ and populate to_free_.  Note: doing the reverse could

    // be more efficient when many objects are dead.

    if (is_live) {

      live_objs_[last_live_index++] = obj;

    } else {

      to_free_.push_back(obj);

      // free(obj);

      num_live_--;

    }

  }

  live_objs_.resize(last_live_index);  // remove dangling objects

  num_collections_++;

  max_survived_ = std::max(max_survived_, num_live());

}

int MarkSweepHeap::Collect() {

  #ifdef GC_TIMING

  struct timespec start, end;

  if (clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &start) < 0) {

    FAIL("clock_gettime failed");

  }

  #endif

  int num_roots = roots_.size();

  int num_globals = global_roots_.size();

  if (gc_verbose_) {

    log("");

    log("%2d. GC with %d roots (%d global) and %d live objects",

        num_collections_, num_roots + num_globals, num_globals, num_live());

  }

  // Resize it

  mark_set_.ReInit(greatest_obj_id_);

  #ifndef NO_POOL_ALLOC

  pool1_.PrepareForGc();

  pool2_.PrepareForGc();

  #endif

  // Mark roots.

  // Note: It might be nice to get rid of double pointers

  for (int i = 0; i < num_roots; ++i) {

    RawObject* root = *(roots_[i]);

    if (root) {

      MaybeMarkAndPush(root);

    }

  }

  for (int i = 0; i < num_globals; ++i) {

    RawObject* root = global_roots_[i];

    if (root) {

      MaybeMarkAndPush(root);

    }

  }

  // Traverse object graph.

  TraceChildren();

  Sweep();

  if (gc_verbose_) {

    log("    %d live after sweep", num_live());

  }

  // We know how many are live.  If the number of objects is close to the

  // threshold (above 75%), then set the threshold to 2 times the number of

  // live objects.  This is an ad hoc policy that removes observed "thrashing"

  // -- being at 99% of the threshold and doing FUTILE mark and sweep.

  int water_mark = (gc_threshold_ * 3) / 4;

  if (num_live() > water_mark) {

    gc_threshold_ = num_live() * 2;

    num_growths_++;

    if (gc_verbose_) {

      log("    exceeded %d live objects; gc_threshold set to %d", water_mark,

          gc_threshold_);

    }

  }

  #ifdef GC_TIMING

  if (clock_gettime(CLOCK_PROCESS_CPUTIME_ID, &end) < 0) {

    FAIL("clock_gettime failed");

  }

  double start_secs = start.tv_sec + start.tv_nsec / 1e9;

  double end_secs = end.tv_sec + end.tv_nsec / 1e9;

  double gc_millis = (end_secs - start_secs) * 1000.0;

  if (gc_verbose_) {

    log("    %.1f ms GC", gc_millis);

  }

  total_gc_millis_ += gc_millis;

  if (gc_millis > max_gc_millis_) {

    max_gc_millis_ = gc_millis;

  }

  #endif

  return num_live();  // for unit tests only

}

void MarkSweepHeap::PrintShortStats() {

  // TODO: should use feature detection of dprintf

  #ifndef OILS_WIN32

    #ifndef NO_POOL_ALLOC

  int fd = 2;

  dprintf(fd, "  num allocated    = %10d\n",

          num_allocated_ + pool1_.num_allocated() + pool2_.num_allocated());

  dprintf(

      fd, "bytes allocated    = %10" PRId64 "\n",

      bytes_allocated_ + pool1_.bytes_allocated() + pool2_.bytes_allocated());

    #endif

  #endif

}

void MarkSweepHeap::PrintStats(int fd) {

  // TODO: should use feature detection of dprintf

  #ifndef OILS_WIN32

  dprintf(fd, "  num live         = %10d\n", num_live());

  // max survived_ can be less than num_live(), because leave off the last GC

  dprintf(fd, "  max survived     = %10d\n", max_survived_);

  dprintf(fd, "\n");

    #ifndef NO_POOL_ALLOC

  dprintf(fd, "  num allocated    = %10d\n",

          num_allocated_ + pool1_.num_allocated() + pool2_.num_allocated());

  dprintf(fd, "  num in heap      = %10d\n", num_allocated_);

    #else

  dprintf(fd, "  num allocated    = %10d\n", num_allocated_);

    #endif

    #ifndef NO_POOL_ALLOC

  dprintf(fd, "  num in pool 1    = %10d\n", pool1_.num_allocated());

  dprintf(fd, "  num in pool 2    = %10d\n", pool2_.num_allocated());

  dprintf(

      fd, "bytes allocated    = %10" PRId64 "\n",

      bytes_allocated_ + pool1_.bytes_allocated() + pool2_.bytes_allocated());

    #else

  dprintf(fd, "bytes allocated    = %10" PRId64 "\n", bytes_allocated_);

    #endif

  dprintf(fd, "\n");

  dprintf(fd, "  num gc points    = %10d\n", num_gc_points_);

  dprintf(fd, "  num collections  = %10d\n", num_collections_);

  dprintf(fd, "\n");

  dprintf(fd, "   gc threshold    = %10d\n", gc_threshold_);

  dprintf(fd, "  num growths      = %10d\n", num_growths_);

  dprintf(fd, "\n");

  dprintf(fd, "  max gc millis    = %10.1f\n", max_gc_millis_);

  dprintf(fd, "total gc millis    = %10.1f\n", total_gc_millis_);

  dprintf(fd, "\n");

  dprintf(fd, "roots capacity     = %10d\n",

          static_cast<int>(roots_.capacity()));

  dprintf(fd, " objs capacity     = %10d\n",

          static_cast<int>(live_objs_.capacity()));

  #endif

}

// Cleanup at the end of main() to remain ASAN-safe

void MarkSweepHeap::MaybePrintStats() {

  int stats_fd = -1;

  char* e = getenv("OILS_GC_STATS");

  if (e && strlen(e)) {  // env var set and non-empty

    stats_fd = STDERR_FILENO;

  } else {

    // A raw file descriptor lets benchmarks extract stats even if the script

    // writes to stdout and stderr.  Shells can't use open() without potential

    // conflicts.

    e = getenv("OILS_GC_STATS_FD");

    if (e && strlen(e)) {

      // Try setting 'stats_fd'.  If there's an error, it will be unchanged, and

      // we don't PrintStats();

      StringToInt(e, strlen(e), 10, &stats_fd);

    }

  }

  if (stats_fd != -1) {

    PrintStats(stats_fd);

  }

}

void MarkSweepHeap::FreeEverything() {

  roots_.clear();

  global_roots_.clear();

  Collect();

  // Collect() told us what to free()

  for (auto obj : to_free_) {

    free(obj);

  }

  #ifndef NO_POOL_ALLOC

  pool1_.Free();

  pool2_.Free();

  #endif

}

void MarkSweepHeap::CleanProcessExit() {

  MaybePrintStats();

  char* e = getenv("OILS_GC_ON_EXIT");

  // collect by default; OILS_GC_ON_EXIT=0 overrides

  if (e && strcmp(e, "0") == 0) {

    ;

  } else {

    FreeEverything();

  }

}

// for the main binary

void MarkSweepHeap::ProcessExit() {

  MaybePrintStats();

  #ifdef CLEAN_PROCESS_EXIT

  FreeEverything();

  #else

  char* e = getenv("OILS_GC_ON_EXIT");

  // don't collect by default; OILS_GC_ON_EXIT=1 overrides

  if (e && strcmp(e, "1") == 0) {

    FreeEverything();

  }

  #endif

}

MarkSweepHeap gHeap;

#endif  // MARK_SWEEP