Method test_memorygrowth

test/test_core.py:2105–2140

(self)

  @no_highmem('memory growth issues')
  def test_memorygrowth(self):
    if self.has_changed_setting('ALLOW_MEMORY_GROWTH'):
      self.skipTest('test needs to modify memory growth')
    if self.maybe_closure():
      # verify NO_DYNAMIC_EXECUTION is compatible with closure
      self.set_setting('DYNAMIC_EXECUTION', 0)
    # With typed arrays in particular, it is dangerous to use more memory than INITIAL_MEMORY,
    # since we then need to enlarge the heap(s).
    src = test_file('core/test_memorygrowth.c')

    # Fail without memory growth
    self.do_runf(src, 'OOM', assert_returncode=NON_ZERO)
    fail = read_file(self.output_name('test_memorygrowth'))

    # Win with it
    self.set_setting('ALLOW_MEMORY_GROWTH')
    output = self.do_runf(src)
    output = self.remove_growth_warning(output)
    self.assertContained('*pre: hello,4.955*\n*hello,4.955*\n*hello,4.955*', output)
    win = read_file(self.output_name('test_memorygrowth'))

    if '-O2' in self.cflags and self.is_wasm2js():
      # Make sure ALLOW_MEMORY_GROWTH generates different code (should be less optimized)
      code_start = '// EMSCRIPTEN_START_FUNCS'
      self.assertContained(code_start, fail)
      fail = fail[fail.find(code_start):]
      win = win[win.find(code_start):]
      assert len(fail) < len(win), 'failing code - without memory growth on - is more optimized, and smaller' + str([len(fail), len(win)])

    # Tracing of memory growths should work
    # (SAFE_HEAP would instrument the tracing code itself, leading to recursion)
    if not self.get_setting('SAFE_HEAP'):
      self.cflags += ['--tracing']
      output = self.do_runf(src)
      output = self.remove_growth_warning(output)
      self.assertContained('*pre: hello,4.955*\n*hello,4.955*\n*hello,4.955*', output)

  @no_highmem('memory growth issues')
  def test_memorygrowth_2(self):