ucx: src/hash_map.c@d7f0b5a9a985 (annotated)

src/hash_map.c@d7f0b5a9a985 (annotated)

src/hash_map.c

Wed, 18 May 2022 16:26:32 +0200

author: Mike Becker <universe@uap-core.de>
date: Wed, 18 May 2022 16:26:32 +0200
changeset 549: d7f0b5a9a985
child 550: 89b2a83728b1
permissions: -rw-r--r--

#189 declare basic map functions

 /*
  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
  *
  * Copyright 2021 Mike Becker, Olaf Wintermann All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are met:
  *
  *   1. Redistributions of source code must retain the above copyright
  *      notice, this list of conditions and the following disclaimer.
  *
  *   2. Redistributions in binary form must reproduce the above copyright
  *      notice, this list of conditions and the following disclaimer in the
  *      documentation and/or other materials provided with the distribution.
  *
  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
  * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  * POSSIBILITY OF SUCH DAMAGE.
  */
 #include <string.h>
 #include "cx/hash_map.h"
 /**
  * Computes a murmur hash-2.
  *
  * @param data the data to hash
  * @param len the length of the data
  * @return the murmur hash-2 of the data
  */
 static unsigned cx_hash_map_murmur(
         unsigned char const *data,
         size_t len
 ) {
     unsigned m = 0x5bd1e995;
     unsigned r = 24;
     unsigned h = 25 ^ len;
     unsigned i = 0;
     while (len >= 4) {
         unsigned k = data[i + 0] & 0xFF;
         k |= (data[i + 1] & 0xFF) << 8;
         k |= (data[i + 2] & 0xFF) << 16;
         k |= (data[i + 3] & 0xFF) << 24;
         k *= m;
         k ^= k >> r;
         k *= m;
         h *= m;
         h ^= k;
         i += 4;
         len -= 4;
     }
     switch (len) {
         case 3:
             h ^= (data[i + 2] & 0xFF) << 16;
                     __attribute__((__fallthrough__));
         case 2:
             h ^= (data[i + 1] & 0xFF) << 8;
                     __attribute__((__fallthrough__));
         case 1:
             h ^= (data[i + 0] & 0xFF);
             h *= m;
                     __attribute__((__fallthrough__));
         default:
             /* do nothing */;
     }
     h ^= h >> 13;
     h *= m;
     h ^= h >> 15;
     return h;
 }
 /**
  * Creates a hash map key based on the given data.
  *
  * This function implicitly computes the hash.
  *
  * @attention The data will be copied to the key structure.
  *
  * @param data the data for the key
  * @return the computed key
  */
 static struct cx_hash_map_key_s cx_hash_map_key(CxDataPtr data) {
     unsigned char *target = malloc(data.len);
     memcpy(target, data.data, data.len);
     struct cx_hash_map_key_s key;
     key.data.data = target;
     key.data.len = data.len;
     key.hash = cx_hash_map_murmur(target, data.len);
     return key;
 }

Mercurial > hg > ucx / annotate

src/hash_map.c@d7f0b5a9a985 (annotated)

src/hash_map.c