/* * Copyright (C) 2005, 2006, 2008 Apple Inc. All rights reserved. * * This library is free software; you can redistribute it and/or * modify it under the terms of the GNU Library General Public * License as published by the Free Software Foundation; either * version 2 of the License, or (at your option) any later version. * * This library is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Library General Public License for more details. * * You should have received a copy of the GNU Library General Public License * along with this library; see the file COPYING.LIB. If not, write to * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, * Boston, MA 02110-1301, USA. * */ #ifndef WTF_HashFunctions_h #define WTF_HashFunctions_h #include "RefPtr.h" #include namespace WTF { template struct IntTypes; template<> struct IntTypes<1> { typedef int8_t SignedType; typedef uint8_t UnsignedType; }; template<> struct IntTypes<2> { typedef int16_t SignedType; typedef uint16_t UnsignedType; }; template<> struct IntTypes<4> { typedef int32_t SignedType; typedef uint32_t UnsignedType; }; template<> struct IntTypes<8> { typedef int64_t SignedType; typedef uint64_t UnsignedType; }; // integer hash function // Thomas Wang's 32 Bit Mix Function: http://www.cris.com/~Ttwang/tech/inthash.htm inline unsigned intHash(uint8_t key8) { unsigned key = key8; key += ~(key << 15); key ^= (key >> 10); key += (key << 3); key ^= (key >> 6); key += ~(key << 11); key ^= (key >> 16); return key; } // Thomas Wang's 32 Bit Mix Function: http://www.cris.com/~Ttwang/tech/inthash.htm inline unsigned intHash(uint16_t key16) { unsigned key = key16; key += ~(key << 15); key ^= (key >> 10); key += (key << 3); key ^= (key >> 6); key += ~(key << 11); key ^= (key >> 16); return key; } // Thomas Wang's 32 Bit Mix Function: http://www.cris.com/~Ttwang/tech/inthash.htm inline unsigned intHash(uint32_t key) { key += ~(key << 15); key ^= (key >> 10); key += (key << 3); key ^= (key >> 6); key += ~(key << 11); key ^= (key >> 16); return key; } // Thomas Wang's 64 bit Mix Function: http://www.cris.com/~Ttwang/tech/inthash.htm inline unsigned intHash(uint64_t key) { key += ~(key << 32); key ^= (key >> 22); key += ~(key << 13); key ^= (key >> 8); key += (key << 3); key ^= (key >> 15); key += ~(key << 27); key ^= (key >> 31); return static_cast(key); } template struct IntHash { static unsigned hash(T key) { return intHash(static_cast::UnsignedType>(key)); } static bool equal(T a, T b) { return a == b; } static const bool safeToCompareToEmptyOrDeleted = true; }; template struct FloatHash { static unsigned hash(T key) { union { T key; typename IntTypes::UnsignedType bits; } u; u.key = key; return intHash(u.bits); } static bool equal(T a, T b) { return a == b; } static const bool safeToCompareToEmptyOrDeleted = true; }; // pointer identity hash function template struct PtrHash { static unsigned hash(T key) { #if COMPILER(MSVC) #pragma warning(push) #pragma warning(disable: 4244) // work around what seems to be a bug in MSVC's conversion warnings #endif return IntHash::hash(reinterpret_cast(key)); #if COMPILER(MSVC) #pragma warning(pop) #endif } static bool equal(T a, T b) { return a == b; } static const bool safeToCompareToEmptyOrDeleted = true; }; template struct PtrHash > : PtrHash { using PtrHash::hash; static unsigned hash(const RefPtr

& key) { return hash(key.get()); } using PtrHash::equal; static bool equal(const RefPtr

& a, const RefPtr

& b) { return a == b; } static bool equal(P* a, const RefPtr

& b) { return a == b; } static bool equal(const RefPtr

& a, P* b) { return a == b; } }; // default hash function for each type template struct DefaultHash; template struct PairHash { static unsigned hash(const std::pair& p) { return intHash((static_cast(DefaultHash::Hash::hash(p.first)) << 32 | DefaultHash::Hash::hash(p.second))); } static bool equal(const std::pair& a, const std::pair& b) { return DefaultHash::Hash::equal(a.first, b.first) && DefaultHash::Hash::equal(a.second, b.second); } static const bool safeToCompareToEmptyOrDeleted = DefaultHash::Hash::safeToCompareToEmptyOrDeleted && DefaultHash::Hash::safeToCompareToEmptyOrDeleted; }; // make IntHash the default hash function for many integer types template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; template<> struct DefaultHash { typedef IntHash Hash; }; #if !COMPILER(MSVC) || defined(_NATIVE_WCHAR_T_DEFINED) template<> struct DefaultHash { typedef IntHash Hash; }; #endif template<> struct DefaultHash { typedef FloatHash Hash; }; template<> struct DefaultHash { typedef FloatHash Hash; }; // make PtrHash the default hash function for pointer types that don't specialize template struct DefaultHash { typedef PtrHash Hash; }; template struct DefaultHash > { typedef PtrHash > Hash; }; template struct DefaultHash > { typedef PairHash Hash; }; // Golden ratio - arbitrary start value to avoid mapping all 0's to all 0's static const unsigned stringHashingStartValue = 0x9e3779b9U; } // namespace WTF using WTF::DefaultHash; using WTF::IntHash; using WTF::PtrHash; #endif // WTF_HashFunctions_h