damage-refinery: Replace murmurhash with XXH3

include/damage-refinery.h

@@ -20,8 +20,10 @@
 
 struct pixman_region16;
 struct nvnc_fb;
+struct XXH3_state_s;
 
 struct damage_refinery {
+	struct XXH3_state_s* state;
 	uint32_t* hashes;
 	uint32_t width;
 	uint32_t height;

include/murmurhash.h

@@ -1,48 +0,0 @@
-/*
- * The MIT License (MIT)
- * 
- * Copyright (c) 2014 Joseph Werle
- * 
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- * 
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- * 
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#ifndef MURMURHASH_H
-#define MURMURHASH_H 1
-
-#include <stdint.h>
-
-#define MURMURHASH_VERSION "0.0.3"
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-/**
- * Returns a murmur hash of `key' based on `seed'
- * using the MurmurHash3 algorithm
- */
-
-uint32_t
-murmurhash (const char *, uint32_t, uint32_t);
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif

meson.build

@@ -91,7 +91,6 @@ sources = [
 	'src/resampler.c',
 	'src/transform-util.c',
 	'src/damage-refinery.c',
-	'src/murmurhash.c',
 	'src/encoder.c',
 	'src/cursor.c',
 	'src/logging.c',

src/damage-refinery.c

@@ -24,7 +24,10 @@
 #include "fb.h"
 #include "pixels.h"
 #include "damage-refinery.h"
-#include "murmurhash.h"
+
+#define XXH_STATIC_LINKING_ONLY
+#define XXH_IMPLEMENTATION
+#include "xxhash.h"
 
 #define UDIV_UP(a, b) (((a) + (b) - 1) / (b))
 
@@ -39,10 +42,16 @@ int damage_refinery_init(struct damage_refinery* self, uint32_t width,
 	uint32_t twidth = UDIV_UP(width, 32);
 	uint32_t theight = UDIV_UP(height, 32);
 
-	self->hashes = calloc(twidth * theight, sizeof(*self->hashes));
+	self->state = XXH3_createState();
-	if (!self->hashes)
+	if (!self->state)
 		return -1;
 
+	self->hashes = calloc(twidth * theight, sizeof(*self->hashes));
+	if (!self->hashes) {
+		XXH3_freeState(self->state);
+		return -1;
+	}
+
 	return 0;
 }
 
@@ -58,6 +67,7 @@ int damage_refinery_resize(struct damage_refinery* self, uint32_t width,
 
 void damage_refinery_destroy(struct damage_refinery* self)
 {
+	XXH3_freeState(self->state);
 	free(self->hashes);
 }
 
@@ -73,14 +83,15 @@ static uint32_t damage_hash_tile(struct damage_refinery* self, uint32_t tx,
 	int y_start = ty * 32;
 	int y_stop = MIN((ty + 1) * 32, self->height);
 
-	uint32_t hash = 0;
 	int32_t xoff = x_start * bpp;
 
-	for (int y = y_start; y < y_stop; ++y)
+	XXH3_64bits_reset(self->state);
-		hash = murmurhash((void*)&(pixels[xoff + y * byte_stride]),
+	for (int y = y_start; y < y_stop; ++y) {
-				bpp * (x_stop - x_start), hash);
+		XXH3_64bits_update(self->state, pixels + xoff + y * byte_stride,
+				bpp * (x_stop - x_start));
+	}
 
-	return hash;
+	return XXH3_64bits_digest(self->state);
 }
 
 static uint32_t* damage_tile_hash_ptr(struct damage_refinery* self,

src/murmurhash.c

@@ -1,92 +0,0 @@
-/*
- * The MIT License (MIT)
- * 
- * Copyright (c) 2014 Joseph Werle
- * 
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- * 
- * The above copyright notice and this permission notice shall be included in
- * all copies or substantial portions of the Software.
- * 
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-
-#include <stdlib.h>
-#include <stdio.h>
-#include <stdint.h>
-#include "murmurhash.h"
-
-uint32_t
-murmurhash (const char *key, uint32_t len, uint32_t seed) {
-  uint32_t c1 = 0xcc9e2d51;
-  uint32_t c2 = 0x1b873593;
-  uint32_t r1 = 15;
-  uint32_t r2 = 13;
-  uint32_t m = 5;
-  uint32_t n = 0xe6546b64;
-  uint32_t h = 0;
-  uint32_t k = 0;
-  uint8_t *d = (uint8_t *) key; // 32 bit extract from `key'
-  const uint32_t *chunks = NULL;
-  const uint8_t *tail = NULL; // tail - last 8 bytes
-  int i = 0;
-  int l = len / 4; // chunk length
-
-  h = seed;
-
-  chunks = (const uint32_t *) (d + l * 4); // body
-  tail = (const uint8_t *) (d + l * 4); // last 8 byte chunk of `key'
-
-  // for each 4 byte chunk of `key'
-  for (i = -l; i != 0; ++i) {
-    // next 4 byte chunk of `key'
-    k = chunks[i];
-
-    // encode next 4 byte chunk of `key'
-    k *= c1;
-    k = (k << r1) | (k >> (32 - r1));
-    k *= c2;
-
-    // append to hash
-    h ^= k;
-    h = (h << r2) | (h >> (32 - r2));
-    h = h * m + n;
-  }
-
-  k = 0;
-
-  // remainder
-  switch (len & 3) { // `len % 4'
-    case 3: k ^= (tail[2] << 16);
-      // fallthrough
-    case 2: k ^= (tail[1] << 8);
-      // fallthrough
-    case 1:
-      k ^= tail[0];
-      k *= c1;
-      k = (k << r1) | (k >> (32 - r1));
-      k *= c2;
-      h ^= k;
-  }
-
-  h ^= len;
-
-  h ^= (h >> 16);
-  h *= 0x85ebca6b;
-  h ^= (h >> 13);
-  h *= 0xc2b2ae35;
-  h ^= (h >> 16);
-
-  return h;
-}