| The Android Open Source Project | 1dc9e47 | 2009-03-03 19:28:35 -0800 | [diff] [blame] | 1 | /* | 
|  | 2 | * Copyright (c) 1999 Kungliga Tekniska Högskolan | 
|  | 3 | * (Royal Institute of Technology, Stockholm, Sweden). | 
|  | 4 | * All rights reserved. | 
|  | 5 | * | 
|  | 6 | * Redistribution and use in source and binary forms, with or without | 
|  | 7 | * modification, are permitted provided that the following conditions | 
|  | 8 | * are met: | 
|  | 9 | * | 
|  | 10 | * 1. Redistributions of source code must retain the above copyright | 
|  | 11 | *    notice, this list of conditions and the following disclaimer. | 
|  | 12 | * | 
|  | 13 | * 2. Redistributions in binary form must reproduce the above copyright | 
|  | 14 | *    notice, this list of conditions and the following disclaimer in the | 
|  | 15 | *    documentation and/or other materials provided with the distribution. | 
|  | 16 | * | 
|  | 17 | * 3. Neither the name of KTH nor the names of its contributors may be | 
|  | 18 | *    used to endorse or promote products derived from this software without | 
|  | 19 | *    specific prior written permission. | 
|  | 20 | * | 
|  | 21 | * THIS SOFTWARE IS PROVIDED BY KTH AND ITS CONTRIBUTORS ``AS IS'' AND ANY | 
|  | 22 | * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | 
|  | 23 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | 
|  | 24 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL KTH OR ITS CONTRIBUTORS BE | 
|  | 25 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR | 
|  | 26 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF | 
|  | 27 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR | 
|  | 28 | * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, | 
|  | 29 | * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR | 
|  | 30 | * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF | 
|  | 31 | * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ | 
|  | 32 |  | 
|  | 33 | /* $Heimdal: hash.h,v 1.1 1999/03/22 19:16:25 joda Exp $ | 
|  | 34 | $NetBSD: hash.h,v 1.1.1.3 2002/09/12 12:41:42 joda Exp $ */ | 
|  | 35 |  | 
|  | 36 | /* stuff in common between md4, md5, and sha1 */ | 
|  | 37 |  | 
|  | 38 | #ifndef __hash_h__ | 
|  | 39 | #define __hash_h__ | 
|  | 40 |  | 
|  | 41 | #include <stdlib.h> | 
|  | 42 | #include <string.h> | 
|  | 43 |  | 
|  | 44 | #ifndef min | 
|  | 45 | #define min(a,b) (((a)>(b))?(b):(a)) | 
|  | 46 | #endif | 
|  | 47 |  | 
|  | 48 | /* Vector Crays doesn't have a good 32-bit type, or more precisely, | 
|  | 49 | int32_t as defined by <bind/bitypes.h> isn't 32 bits, and we don't | 
|  | 50 | want to depend in being able to redefine this type.  To cope with | 
|  | 51 | this we have to clamp the result in some places to [0,2^32); no | 
|  | 52 | need to do this on other machines.  Did I say this was a mess? | 
|  | 53 | */ | 
|  | 54 |  | 
|  | 55 | #ifdef _CRAY | 
|  | 56 | #define CRAYFIX(X) ((X) & 0xffffffff) | 
|  | 57 | #else | 
|  | 58 | #define CRAYFIX(X) (X) | 
|  | 59 | #endif | 
|  | 60 |  | 
|  | 61 | static inline u_int32_t | 
|  | 62 | cshift (u_int32_t x, unsigned int n) | 
|  | 63 | { | 
|  | 64 | x = CRAYFIX(x); | 
|  | 65 | return CRAYFIX((x << n) | (x >> (32 - n))); | 
|  | 66 | } | 
|  | 67 |  | 
|  | 68 | #endif /* __hash_h__ */ |