/***************************************************************************
* Copyright (c) Johan Mabille, Sylvain Corlay and Wolf Vollprecht          *
* Copyright (c) QuantStack                                                 *
*                                                                          *
* Distributed under the terms of the BSD 3-Clause License.                 *
*                                                                          *
* The full license is in the file LICENSE, distributed with this software. *
****************************************************************************/

#ifndef XTL_HASH_HPP
#define XTL_HASH_HPP

#include <cstddef>
#include <cstdint>
#include <cstring>

#include <type_traits>

namespace xtl
{

    std::size_t hash_bytes(const void* buffer, std::size_t length, std::size_t seed);

    uint32_t murmur2_x86(const void* buffer, std::size_t length, uint32_t seed);
    uint64_t murmur2_x64(const void* buffer, std::size_t length, uint64_t seed);

    /******************************
     *  hash_bytes implementation *
     ******************************/

    namespace detail
    {
        // Dummy hash implementation for unusual sizeof(std::size_t)
        template <std::size_t N>
        std::size_t murmur_hash(const void* buffer, std::size_t length, std::size_t seed)
        {
            std::size_t hash = seed;
            const char* data = static_cast<const char*>(buffer);
            for (; length != 0; --length)
            {
                hash = (hash * 131) + static_cast<std::size_t>(*data++);
            }
            return hash;
        }

        // Murmur hash is an algorithm written by Austin Appleby. See https://github.com/aappleby/smhasher/blob/master/src/MurmurHash2.cpp
        inline uint32_t murmur2_x86_impl(const void* buffer, std::size_t length, uint32_t seed)
        {
            const uint32_t m = 0x5bd1e995;
            uint32_t len = static_cast<uint32_t>(length);

            // Initialize the hash to a 'random' value
            uint32_t h = seed ^ len;

            // Mix 4 bytes at a time into the hash
            const unsigned char * data = (const unsigned char *)buffer;
            
            while(len >= 4)
            {
                uint32_t k = *(uint32_t*)data;
                k *= m;
                k ^= k >> 24;
                k *= m;
                
                h *= m;
                h ^= k;
                
                data += 4;
                len -= 4;
            }
            
            // Handle the last few bytes of the input array
            switch(len)
            {
            case 3: h ^= static_cast<uint32_t>(data[2] << 16);
            case 2: h ^= static_cast<uint32_t>(data[1] << 8);
            case 1: h ^= static_cast<uint32_t>(data[0]);
                h *= m;
            };

            // Do a few final mixes of the hash to ensure the last few
            // // bytes are well-incorporated.
            h ^= h >> 13;
            h *= m;
            h ^= h >> 15;
            
            return h;
        }

        template <>
        inline std::size_t murmur_hash<4>(const void* buffer, std::size_t length, std::size_t seed)
        {
            return std::size_t(murmur2_x86_impl(buffer, length, static_cast<uint32_t>(seed)));
        }

        inline std::size_t load_bytes(const char* p, int n)
        {
            std::size_t result = 0;
            --n;
            do
            {
                result = (result << 8) + static_cast<unsigned char>(p[n]);
            } while (--n >= 0);
            return result;
        }

#if INTPTR_MAX == INT64_MAX
        // 64-bits hash for 64-bits platform
        template <>
        inline std::size_t murmur_hash<8>(const void* buffer, std::size_t length, std::size_t seed)
        {
            constexpr std::size_t m = (static_cast<std::size_t>(0xc6a4a793UL) << 32UL) +
                static_cast<std::size_t>(0x5bd1e995UL);
            constexpr int r = 47;
            const char* data = static_cast<const char*>(buffer);
            const char* end = data + (length & std::size_t(~0x7));
            std::size_t hash = seed ^ (length * m);
            while (data != end)
            {
                std::size_t k;
                std::memcpy(&k, data, sizeof(k));
                k *= m;
                k ^= k >> r;
                k *= m;
                hash ^= k;
                hash *= m;
                data += 8;
            }
            if ((length & 0x7) != 0)
            {
                std::size_t k = load_bytes(end, length & 0x7);
                hash ^= k;
                hash *= m;
            }
            hash ^= hash >> r;
            hash *= m;
            hash ^= hash >> r;

            return hash;
        }
#elif INTPTR_MAX == INT32_MAX
        //64-bits hash for 32-bits platform
        inline void mmix(uint32_t& h, uint32_t& k, uint32_t m, int r)
        {
            k *= m; k ^= k >> r; k *= m; h *= m; h ^= k;
        }

        template <>
        inline std::size_t murmur_hash<8>(const void* buffer, std::size_t length, std::size_t seed)
        {
            const uint32_t m = 0x5bd1e995;
            const int r = 24;
            uint32_t l = length;

            const auto* data = reinterpret_cast<const unsigned char*>(buffer);

            uint32_t h = seed;

            while (length >= 4)
            {
                uint32_t k = *(uint32_t*)data;

                mmix(h, k, m, r);

                data += 4;
                length -= 4;
            }

            uint32_t t = 0;

            switch (length)
            {
            case 3: t ^= data[2] << 16;
            case 2: t ^= data[1] << 8;
            case 1: t ^= data[0];
            };

            mmix(h, t, m, r);
            mmix(h, l, m, r);

            h ^= h >> 13;
            h *= m;
            h ^= h >> 15;

            return h;
        }
#else
#error Unknown pointer size or missing size macros!
#endif
    }

    inline std::size_t hash_bytes(const void* buffer, std::size_t length, std::size_t seed)
    {
        return detail::murmur_hash<sizeof(std::size_t)>(buffer, length, seed);
    }

    inline uint32_t murmur2_x86(const void* buffer, std::size_t length, uint32_t seed)
    {
        return detail::murmur2_x86_impl(buffer, length, seed);
    }

    inline uint64_t murmur2_x64(const void* buffer, std::size_t length, uint64_t seed)
    {
        return detail::murmur_hash<8>(buffer, length, seed);
    }
}

#endif