DXR is a code search and navigation tool aimed at making sense of large projects. It supports full-text and regex searches as well as structural queries.

Header

Mercurial (dcc6d7a0dc00)

VCS Links

Line Code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80
/* -*- Mode: C++; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* vim: set ts=8 sts=2 et sw=2 tw=80: */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

#include "mozilla/IncrementalClearCOMRuleArray.h"

#include "nsCycleCollector.h"
#include "mozilla/DeferredFinalize.h"
#include "nsTArray.h"
#include "nsCCUncollectableMarker.h"

using namespace mozilla;

typedef nsCOMArray<css::Rule> RuleArray;
typedef nsTArray<RuleArray> RuleArrayArray;


// These methods are based on those in DeferredFinalizerImpl.

static void*
AppendRulesArrayPointer(void* aData, void* aObject)
{
  RuleArrayArray* rulesArray = static_cast<RuleArrayArray*>(aData);
  RuleArray* oldRules = static_cast<RuleArray*>(aObject);

  if (!rulesArray) {
    rulesArray = new RuleArrayArray();
  }

  RuleArray* newRules = rulesArray->AppendElement();
  newRules->SwapElements(*oldRules);

  return rulesArray;
}

// Remove up to |aSliceBudget| css::Rules from the arrays, starting at
// the end of the last array.
static bool
DeferredFinalizeRulesArray(uint32_t aSliceBudget, void* aData)
{
  MOZ_ASSERT(aSliceBudget > 0, "nonsensical/useless call with aSliceBudget == 0");
  RuleArrayArray* rulesArray = static_cast<RuleArrayArray*>(aData);

  size_t newOuterLen = rulesArray->Length();

  while (aSliceBudget > 0 && newOuterLen > 0) {
    RuleArray& lastArray = rulesArray->ElementAt(newOuterLen - 1);
    uint32_t innerLen = lastArray.Length();
    uint32_t currSlice = std::min(innerLen, aSliceBudget);
    uint32_t newInnerLen = innerLen - currSlice;
    lastArray.TruncateLength(newInnerLen);
    aSliceBudget -= currSlice;
    if (newInnerLen == 0) {
      newOuterLen -= 1;
    }
  }

  rulesArray->TruncateLength(newOuterLen);

  if (newOuterLen == 0) {
    delete rulesArray;
    return true;
  }
  return false;
}

void
IncrementalClearCOMRuleArray::Clear()
{
  // Destroy the array incrementally if it is long and we
  // haven't started shutting down.
  if (Length() > 10 && nsCCUncollectableMarker::sGeneration) {
    DeferredFinalize(AppendRulesArrayPointer, DeferredFinalizeRulesArray, this);
  } else {
    nsCOMArray<css::Rule>::Clear();
  }
  MOZ_ASSERT(Length() == 0);
}