Function dmHashFinal32

engine/dlib/src/dlib/hash.cpp:425–458

}

uint32_t dmHashFinal32(HashState32* hash_state)
{
    const uint32_t m = 0x5bd1e995;
    const int r = 24;
    uint32_t s = hash_state->m_Size;
    mmix(hash_state->m_Hash, hash_state->m_Tail);
    mmix(hash_state->m_Hash, s);

    hash_state->m_Hash ^= hash_state->m_Hash >> 13;
    hash_state->m_Hash *= m;
    hash_state->m_Hash ^= hash_state->m_Hash >> 15;

    if (dmHashContainer().m_Enabled && hash_state->m_ReverseHashEntryIndex && hash_state->m_Size <= DMHASH_MAX_REVERSE_LENGTH)
    {
        DM_MUTEX_SCOPED_LOCK(dmHashContainer().m_Mutex);
        dmHashTable32<ReverseHashEntry>* hash_table = &dmHashContainer().m_HashTable32Entries;
        if (hash_table->Get(hash_state->m_Hash) == 0)
        {
            if (hash_table->Full())
            {
                IncreaseTableCapacity(hash_table, dmHashContainer().m_HashTableCapacityIncrement);
            }
            hash_table->Put(hash_state->m_Hash, dmHashContainer().m_HashStates[hash_state->m_ReverseHashEntryIndex]);
        }
        else
        {
            free(dmHashContainer().m_HashStates[hash_state->m_ReverseHashEntryIndex].m_Value);
        }
        dmHashContainer().FreeReverseHashStatesSlot(hash_state->m_ReverseHashEntryIndex);
        hash_state->m_ReverseHashEntryIndex = 0;
    }

    return hash_state->m_Hash;
}

void dmHashRelease32(HashState32* hash_state)
{