1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/libs/assimp/Hash.h	Sat Feb 01 19:58:19 2014 +0200
     1.3 @@ -0,0 +1,113 @@
     1.4 +/*
     1.5 +Open Asset Import Library (assimp)
     1.6 +----------------------------------------------------------------------
     1.7 +
     1.8 +Copyright (c) 2006-2012, assimp team
     1.9 +All rights reserved.
    1.10 +
    1.11 +Redistribution and use of this software in source and binary forms, 
    1.12 +with or without modification, are permitted provided that the 
    1.13 +following conditions are met:
    1.14 +
    1.15 +* Redistributions of source code must retain the above
    1.16 +  copyright notice, this list of conditions and the
    1.17 +  following disclaimer.
    1.18 +
    1.19 +* Redistributions in binary form must reproduce the above
    1.20 +  copyright notice, this list of conditions and the
    1.21 +  following disclaimer in the documentation and/or other
    1.22 +  materials provided with the distribution.
    1.23 +
    1.24 +* Neither the name of the assimp team, nor the names of its
    1.25 +  contributors may be used to endorse or promote products
    1.26 +  derived from this software without specific prior
    1.27 +  written permission of the assimp team.
    1.28 +
    1.29 +THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 
    1.30 +"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 
    1.31 +LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
    1.32 +A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 
    1.33 +OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
    1.34 +SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 
    1.35 +LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
    1.36 +DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 
    1.37 +THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 
    1.38 +(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 
    1.39 +OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
    1.40 +
    1.41 +----------------------------------------------------------------------
    1.42 +*/
    1.43 +
    1.44 +#ifndef AI_HASH_H_INCLUDED
    1.45 +#define AI_HASH_H_INCLUDED
    1.46 +
    1.47 +// ------------------------------------------------------------------------------------------------
    1.48 +// Hashing function taken from 
    1.49 +// http://www.azillionmonkeys.com/qed/hash.html
    1.50 +// (incremental version)
    1.51 +//
    1.52 +// This code is Copyright 2004-2008 by Paul Hsieh. It is used here in the belief that
    1.53 +// Assimp's license is considered compatible with Pauls's derivative license as specified
    1.54 +// on his web page.
    1.55 +//
    1.56 +// (stdint.h should have been been included here)
    1.57 +// ------------------------------------------------------------------------------------------------
    1.58 +#undef get16bits
    1.59 +#if (defined(__GNUC__) && defined(__i386__)) || defined(__WATCOMC__) \
    1.60 +  || defined(_MSC_VER) || defined (__BORLANDC__) || defined (__TURBOC__)
    1.61 +#define get16bits(d) (*((const uint16_t *) (d)))
    1.62 +#endif
    1.63 +
    1.64 +#if !defined (get16bits)
    1.65 +#define get16bits(d) ((((uint32_t)(((const uint8_t *)(d))[1])) << 8)\
    1.66 +                       +(uint32_t)(((const uint8_t *)(d))[0]) )
    1.67 +#endif
    1.68 +
    1.69 +// ------------------------------------------------------------------------------------------------
    1.70 +inline uint32_t SuperFastHash (const char * data, uint32_t len = 0, uint32_t hash = 0) {
    1.71 +uint32_t tmp;
    1.72 +int rem;
    1.73 +
    1.74 +    if (!data) return 0;
    1.75 +	if (!len)len = (uint32_t)::strlen(data);
    1.76 +
    1.77 +    rem = len & 3;
    1.78 +    len >>= 2;
    1.79 +
    1.80 +    /* Main loop */
    1.81 +    for (;len > 0; len--) {
    1.82 +        hash  += get16bits (data);
    1.83 +        tmp    = (get16bits (data+2) << 11) ^ hash;
    1.84 +        hash   = (hash << 16) ^ tmp;
    1.85 +        data  += 2*sizeof (uint16_t);
    1.86 +        hash  += hash >> 11;
    1.87 +    }
    1.88 +
    1.89 +    /* Handle end cases */
    1.90 +    switch (rem) {
    1.91 +        case 3: hash += get16bits (data);
    1.92 +                hash ^= hash << 16;
    1.93 +                hash ^= data[sizeof (uint16_t)] << 18;
    1.94 +                hash += hash >> 11;
    1.95 +                break;
    1.96 +        case 2: hash += get16bits (data);
    1.97 +                hash ^= hash << 11;
    1.98 +                hash += hash >> 17;
    1.99 +                break;
   1.100 +        case 1: hash += *data;
   1.101 +                hash ^= hash << 10;
   1.102 +                hash += hash >> 1;
   1.103 +    }
   1.104 +
   1.105 +    /* Force "avalanching" of final 127 bits */
   1.106 +    hash ^= hash << 3;
   1.107 +    hash += hash >> 5;
   1.108 +    hash ^= hash << 4;
   1.109 +    hash += hash >> 17;
   1.110 +    hash ^= hash << 25;
   1.111 +    hash += hash >> 6;
   1.112 +
   1.113 +    return hash;
   1.114 +}
   1.115 +
   1.116 +#endif // !! AI_HASH_H_INCLUDED