/usr/include/ns3.27/ns3/hash-murmur3.h is in libns3-dev 3.27+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 | /* -*- Mode:C++; c-file-style:"gnu"; indent-tabs-mode:nil; -*- */
/*
* Copyright (c) 2012 Lawrence Livermore National Laboratory
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation;
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Author: Peter D. Barnes, Jr. <pdbarnes@llnl.gov>
*/
#ifndef HASH_MURMUR3_H
#define HASH_MURMUR3_H
#include "hash-function.h"
/**
* \file
* \ingroup hash
* \brief ns3::Hash::Function::Murmur3 declaration.
*/
namespace ns3 {
namespace Hash {
namespace Function {
/**
* \ingroup hash
*
* \brief Murmur3 hash function implementation
*
* Adapted from http://code.google.com/p/smhasher/
*
* MurmurHash3 was written by Austin Appleby, and is placed in the public
* domain. The author hereby disclaims copyright to this source code.
* Note - The x86 and x64 versions do _not_ produce the same results, as the
* algorithms are optimized for their respective platforms. You can still
* compile and run any of them on any platform, but your performance with the
* non-native version will be less than optimal.
*/
class Murmur3 : public Implementation
{
public:
/**
* Constructor, clears internal state
*/
Murmur3 ();
/**
* Compute 32-bit hash of a byte buffer
*
* Call clear () between calls to GetHash32() to reset the
* internal state and hash each buffer separately.
*
* If you don't call clear() between calls to GetHash32,
* you can hash successive buffers. The final return value
* will be the cumulative hash across all calls.
*
* \param [in] buffer pointer to the beginning of the buffer
* \param [in] size length of the buffer, in bytes
* \return 32-bit hash of the buffer
*/
uint32_t GetHash32 (const char * buffer, const size_t size);
/**
* Compute 64-bit hash of a byte buffer.
*
* Call clear () between calls to GetHash64() to reset the
* internal state and hash each buffer separately.
*
* If you don't call clear() between calls to GetHash64,
* you can hash successive buffers. The final return value
* will be the cumulative hash across all calls.
*
* \param [in] buffer pointer to the beginning of the buffer
* \param [in] size length of the buffer, in bytes
* \return 64-bit hash of the buffer
*/
uint64_t GetHash64 (const char * buffer, const size_t size);
/**
* Restore initial state
*/
virtual void clear (void);
private:
/**
* Seed value
*
* This has to be a constant for all MPI ranks to generate
* the same hash from the same string.
*/
enum seed
{
SEED = 0x8BADF00D // Ate bad food
};
/**
* Cache last hash value, and total bytes hashed (needed to finalize),
* for incremental hashing
*/
/**@{*/
uint32_t m_hash32;
uint32_t m_size32;
/**@}*/
/** murmur3 produces 128-bit hash and state; we use just the first 64-bits. */
/**@{*/
uint64_t m_hash64[2];
uint64_t m_size64;
/**@}*/
}; // class Murmur3
} // namespace Function
} // namespace Hash
} // namespace ns3
#endif /* HASH_MURMUR3_H */
|