author Andreas Farre <farre@mozilla.com>
Sun, 05 May 2019 19:26:51 +0000
changeset 472634 f59b3336d254c80bf2b315a74fea0cb0fa8e0d47
parent 448947 6f3709b3878117466168c40affa7bca0b60cf75b
permissions -rw-r--r--
Bug 1547911 - Don't assert that there are no children when restoring BC. r=nika This is essentially equal to restoring cached children and removing current children from a BrowsingContext, which is the correct behaviour. It would've been better if the current children were removed in a more transparent manner, but it is more important to remove an assert that too eagerly triggers. Differential Revision: https://phabricator.services.mozilla.com/D29945

/* -*- 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/. */

/* Helper routines for perfecthash.py.  Not to be used directly. */

#ifndef mozilla_PerfectHash_h
#define mozilla_PerfectHash_h

#include "mozilla/TypeTraits.h"

namespace mozilla {
namespace perfecthash {

// 32-bit FNV offset basis and prime value.
// NOTE: Must match values in |perfecthash.py|
constexpr uint32_t FNV_OFFSET_BASIS = 0x811C9DC5;
constexpr uint32_t FNV_PRIME = 16777619;

 * Basic FNV hasher function used by perfecthash. Generic over the unit type.
template <typename C>
inline uint32_t Hash(uint32_t aBasis, const C* aKey, size_t aLen) {
  for (size_t i = 0; i < aLen; ++i) {
    aBasis = (aBasis ^ static_cast<typename MakeUnsigned<C>::Type>(aKey[i])) *
  return aBasis;

 * Helper method for getting the index from a perfect hash.
 * Called by code generated from |perfecthash.py|.
template <typename C, typename Base, size_t NBases, typename Entry,
          size_t NEntries>
inline const Entry& Lookup(const C* aKey, size_t aLen,
                           const Base (&aTable)[NBases],
                           const Entry (&aEntries)[NEntries]) {
  uint32_t basis = aTable[Hash(FNV_OFFSET_BASIS, aKey, aLen) % NBases];
  return aEntries[Hash(basis, aKey, aLen) % NEntries];

}  // namespace perfecthash
}  // namespace mozilla

#endif  // !defined(mozilla_PerfectHash_h)