/src/dcmtk/oficonv/libsrc/citrus_db_hash.c
Line | Count | Source |
1 | | /*- |
2 | | * Copyright (c)2003 Citrus Project, |
3 | | * All rights reserved. |
4 | | * |
5 | | * Redistribution and use in source and binary forms, with or without |
6 | | * modification, are permitted provided that the following conditions |
7 | | * are met: |
8 | | * 1. Redistributions of source code must retain the above copyright |
9 | | * notice, this list of conditions and the following disclaimer. |
10 | | * 2. Redistributions in binary form must reproduce the above copyright |
11 | | * notice, this list of conditions and the following disclaimer in the |
12 | | * documentation and/or other materials provided with the distribution. |
13 | | * |
14 | | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
15 | | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
16 | | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
17 | | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
18 | | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
19 | | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
20 | | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
21 | | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
22 | | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
23 | | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
24 | | * SUCH DAMAGE. |
25 | | */ |
26 | | |
27 | | #include "dcmtk/config/osconfig.h" |
28 | | #include "citrus_db_hash.h" |
29 | | |
30 | | #include <sys/types.h> |
31 | | #include <stdio.h> |
32 | | #include <string.h> |
33 | | |
34 | | #include "citrus_bcs.h" |
35 | | #include "citrus_types.h" |
36 | | #include "citrus_region.h" |
37 | | |
38 | | uint32_t |
39 | | _citrus_db_hash_std(struct _citrus_region *r) |
40 | 0 | { |
41 | 0 | const uint8_t *p; |
42 | 0 | uint32_t hash, tmp; |
43 | 0 | size_t i; |
44 | |
|
45 | 0 | hash = 0; |
46 | 0 | p = _citrus_region_head(r); |
47 | |
|
48 | 0 | for (i = _citrus_region_size(r); i > 0; i--) { |
49 | 0 | hash <<= 4; |
50 | 0 | hash += _citrus_bcs_tolower(*p); |
51 | 0 | tmp = hash & 0xF0000000; |
52 | 0 | if (tmp != 0) { |
53 | 0 | hash ^= tmp; |
54 | 0 | hash ^= tmp >> 24; |
55 | 0 | } |
56 | 0 | p++; |
57 | 0 | } |
58 | 0 | return (hash); |
59 | 0 | } |