[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[freetype2] ksvsk_test 3ee5b29: Pushing edited code for hash generation
From: |
Kushal K S V S |
Subject: |
[freetype2] ksvsk_test 3ee5b29: Pushing edited code for hash generation |
Date: |
Tue, 27 Jun 2017 17:14:13 -0400 (EDT) |
branch: ksvsk_test
commit 3ee5b299b396ac9885a21d8da8073a9e3133ebdc
Author: Kushal K S V S <address@hidden>
Commit: Kushal K S V S <address@hidden>
Pushing edited code for hash generation
---
arial.ttf | Bin 0 -> 311636 bytes
final/bitmap.c | 29 +++++
final/bitmap.h | 29 +++++
final/hash_to_file.c | 146 ++++++++++++++++++++++++
final/make_png.c | 242 +++++++++++++++++++++++++++++++++++++++
final/makefile | 22 ++++
final/murmur3.c | 312 +++++++++++++++++++++++++++++++++++++++++++++++++++
final/murmur3.h | 24 ++++
8 files changed, 804 insertions(+)
diff --git a/arial.ttf b/arial.ttf
new file mode 100644
index 0000000..886789b
Binary files /dev/null and b/arial.ttf differ
diff --git a/final/bitmap.c b/final/bitmap.c
new file mode 100644
index 0000000..923d072
--- /dev/null
+++ b/final/bitmap.c
@@ -0,0 +1,29 @@
+#include "bitmap.h"
+
+HASH_128 * Generate_Hash_x64_128(FT_Bitmap * bitmap, HASH_128 * murmur)
+{
+ int seed = 99; // Dont change
+
+ MurmurHash3_x64_128(bitmap->buffer, (bitmap->pitch * bitmap->rows), seed,
murmur->hash);
+
+ return murmur;
+}
+
+HASH_128 * Generate_Hash_x86_128(FT_Bitmap * bitmap, HASH_128 * murmur)
+{
+ int seed = 99; // Dont change
+
+ MurmurHash3_x86_128(bitmap->buffer, (bitmap->pitch * bitmap->rows), seed,
murmur->hash);
+
+ return murmur;
+}
+
+HASH_32 * Generate_Hash_x86_32(FT_Bitmap * bitmap, HASH_32 * murmur)
+{
+ int seed = 99; // Dont change
+
+ MurmurHash3_x86_32(bitmap->buffer, (bitmap->pitch * bitmap->rows), seed,
murmur->hash);
+
+ return murmur;
+}
+
diff --git a/final/bitmap.h b/final/bitmap.h
new file mode 100644
index 0000000..8ad333a
--- /dev/null
+++ b/final/bitmap.h
@@ -0,0 +1,29 @@
+#include <stdio.h>
+#include <ft2build.h>
+#include "murmur3.h" // MurmurHash3_x64_128 header file
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <unistd.h>
+
+#include FT_FREETYPE_H
+#include FT_MODULE_H
+#include FT_LCD_FILTER_H
+#include FT_BITMAP_H
+
+#define BITS_PER_PIXEL_RGBA 32
+
+typedef struct { // To store 32bit Hash
+ FT_UInt32 hash[1];
+}HASH_32;
+
+typedef struct { // To store 128bit Hash
+ FT_UInt32 hash[4];
+}HASH_128;
+
+//-------------------------------------------------------------------------------
+
+HASH_32 * Generate_Hash_x86_32(FT_Bitmap * bitmap, HASH_32 * murmur);
+HASH_128 * Generate_Hash_x86_128(FT_Bitmap * bitmap, HASH_128 * murmur);
+HASH_128 * Generate_Hash_x64_128(FT_Bitmap * bitmap, HASH_128 * murmur);
+
+//-------------------------------------------------------------------------------
diff --git a/final/hash_to_file.c b/final/hash_to_file.c
new file mode 100644
index 0000000..dc4cb04
--- /dev/null
+++ b/final/hash_to_file.c
@@ -0,0 +1,146 @@
+#include "bitmap.h"
+
+int main (int argc, char const *argv[])
+{
+ FT_Library library;
+ FT_Face face;
+ FT_GlyphSlot slot;
+
+ FT_Bitmap* bitmap;
+
+ FT_Error error;
+
+ const char* font_file;
+ int size;
+ int render_mode; // argument
+
+ int load_flag; // FT_LOAD_XXX
+ int render_flag; // FT_RENDER_MODE_XXX
+ int target_flag; // FT_LOAD_TARGET_XXX
+ char* render_type; // for file_name
+
+ char name[100]; // hashes file name
+ int i; // for loop
+
+ if (argc != 4)
+ {
+ printf("\nTo generate MurmurHash3 hash values of all glyphs\n");
+ printf("Hashes will be saved in a file named
$(font)_$(pt_size)_$(render_mode).hash \n\n");
+
+ printf("By default, hashes of 256-level gray bitmaps will be
generated\n\n");
+
+ printf("Usage ./<exe> <font_file> <pt_size> <render_mode>\n\n");
+
+ printf("Values for render_mode 0 - monochrome\n");
+ printf(" 1 - anti-aliased\n");
+ printf(" 2 - lcd horizontal-RGB\n");
+ printf(" 3 - lcd vertical-RGB\n");
+
+ return 1;
+ }
+
+ font_file = argv[1];
+ size = atof(argv[2]);
+ render_mode = atoi(argv[3]);
+
+ error = FT_Init_FreeType( &library );
+ if(error){
+ printf("Error while initialising library\n");
+ }
+
+ error = FT_New_Face( library,
+ font_file,
+ 0,
+ &face );
+ if(error){
+ printf("Error loading new face\n");
+ }
+
+ error = FT_Set_Char_Size( face,
+ size * 64,
+ 0,
+ DPI,
+ 0 );
+ if(error){
+ printf("Error setting character size\n");
+ }
+
+ switch ( render_mode ) {
+ case 0: render_flag = FT_RENDER_MODE_MONO;
+ load_flag = FT_LOAD_DEFAULT;
+ target_flag = FT_LOAD_TARGET_MONO;
+ render_type = "mono";
+ break;
+
+ case 1: render_flag = FT_RENDER_MODE_NORMAL;
+ load_flag = FT_LOAD_DEFAULT;
+ target_flag = FT_LOAD_TARGET_NORMAL;
+ render_type = "gray";
+ break;
+
+ case 2: render_flag = FT_RENDER_MODE_LCD;
+ load_flag = FT_LOAD_DEFAULT;
+ target_flag = FT_LOAD_TARGET_LCD;
+ render_type = "lcd_rgb";
+ break;
+
+ case 3: render_flag = FT_RENDER_MODE_LCD_V;
+ load_flag = FT_LOAD_DEFAULT;
+ target_flag = FT_LOAD_TARGET_LCD_V;
+ render_type = "lcd_ver_rgb";
+ break;
+
+ default:render_flag = FT_RENDER_MODE_NORMAL;
+ load_flag = FT_LOAD_DEFAULT;
+ target_flag = FT_LOAD_TARGET_NORMAL;
+ render_type = "gray";
+ }
+
+ slot = face->glyph;
+
+ struct stat st = {0};
+ if (stat("/some/directory", &st) == -1) {
+ mkdir("/some/directory", 0700);
+ }
+
+ FILE* fp;
+
+ sprintf(name,"./hashes/%s_%d_%s.hash",font_file,
+ size,
+ render_type);
+
+ fp = fopen(name,"w");
+
+ for (i = 0; i < face->num_glyphs; ++i)
+ {
+ error = FT_Load_Glyph( face,
+ i,
+ load_flag | target_flag);
+ if(error){
+ printf("Error loading glyph\n");
+ }
+
+ FT_Render_Glyph( slot,
+ render_flag);
+ if(error){
+ printf("Error rendering the glyph\n");
+ }
+
+ bitmap = &slot->bitmap;
+
+ HASH_128 * murmur = (HASH_128 *) malloc(sizeof(HASH_128)) ;
+ murmur = Generate_Hash_x64_128(bitmap,murmur);
+
+ fprintf(fp, "%08x %08x %08x %08x\n", murmur->hash[0], // Print hash
+ murmur->hash[1],
+ murmur->hash[2],
+ murmur->hash[3]);
+ }
+ fclose(fp);
+
+ FT_Done_Face ( face );
+ FT_Done_FreeType( library );
+
+ return 0;
+
+}
diff --git a/final/make_png.c b/final/make_png.c
new file mode 100644
index 0000000..a80710d
--- /dev/null
+++ b/final/make_png.c
@@ -0,0 +1,242 @@
+#include <png.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include "bitmap.h"
+
+typedef struct { // An RGBA pixel
+ unsigned char red;
+ unsigned char green;
+ unsigned char blue;
+ unsigned char alpha;
+} pixel_t;
+
+typedef struct { // A Picture
+ pixel_t *pixels;
+ size_t width;
+ size_t height;
+} bitmap_t;
+
+/* Given "bitmap", this returns the pixel of bitmap at the point
+ ("x", "y"). */
+
+static pixel_t * pixel_at (bitmap_t * bitmap, int x, int y)
+{
+ return bitmap->pixels + bitmap->width * y + x;
+}
+
+/* Write "bitmap" to a PNG file specified by "path"; returns 0 on
+ success, non-zero on error. */
+
+static int save_png_to_file (bitmap_t *bitmap, const char *path)
+{
+ FILE * fp;
+ png_structp png_ptr = NULL;
+ png_infop info_ptr = NULL;
+ size_t x, y;
+ png_byte ** row_pointers = NULL;
+ /* "status" contains the return value of this function. At first
+ it is set to a value which means 'failure'. When the routine
+ has finished its work, it is set to a value which means
+ 'success'. */
+ int status = -1;
+ /* The following number is set by trial and error only. I cannot
+ see where it it is documented in the libpng manual.
+ */
+ int pixel_size = 4;
+ int depth = 8;
+
+ fp = fopen (path, "wb");
+ if (! fp) {
+ goto fopen_failed;
+ }
+
+ png_ptr = png_create_write_struct (PNG_LIBPNG_VER_STRING, NULL, NULL,
NULL);
+ if (png_ptr == NULL) {
+ goto png_create_write_struct_failed;
+ }
+
+ info_ptr = png_create_info_struct (png_ptr);
+ if (info_ptr == NULL) {
+ goto png_create_info_struct_failed;
+ }
+
+ /* Set up error handling. */
+
+ if (setjmp (png_jmpbuf (png_ptr))) {
+ goto png_failure;
+ }
+
+ /* Set image attributes. */
+
+ png_set_IHDR (png_ptr,
+ info_ptr,
+ bitmap->width,
+ bitmap->height,
+ depth,
+ PNG_COLOR_TYPE_RGBA,
+ PNG_INTERLACE_NONE,
+ PNG_COMPRESSION_TYPE_DEFAULT,
+ PNG_FILTER_TYPE_DEFAULT);
+
+ /* Initialize rows of PNG. */
+
+ row_pointers = png_malloc (png_ptr, bitmap->height * sizeof (png_byte *));
+ for (y = 0; y < bitmap->height; y++) {
+ png_byte *row =
+ png_malloc (png_ptr, sizeof (uint8_t) * bitmap->width *
pixel_size);
+ row_pointers[y] = row;
+ for (x = 0; x < bitmap->width; x++) {
+ pixel_t * pixel = pixel_at (bitmap, x, y);
+ *row++ = pixel->red;
+ *row++ = pixel->green;
+ *row++ = pixel->blue;
+ *row++ = pixel->alpha;
+ }
+ }
+
+ /* Write the image data to "fp". */
+
+ png_init_io (png_ptr, fp);
+ png_set_rows (png_ptr, info_ptr, row_pointers);
+ png_write_png (png_ptr, info_ptr, PNG_TRANSFORM_IDENTITY, NULL);
+
+ /* The routine has successfully written the file, so we set
+ "status" to a value which indicates success. */
+
+ status = 0;
+
+ for (y = 0; y < bitmap->height; y++) {
+ png_free (png_ptr, row_pointers[y]);
+ }
+ png_free (png_ptr, row_pointers);
+
+ png_failure:
+ png_create_info_struct_failed:
+ png_destroy_write_struct (&png_ptr, &info_ptr);
+ png_create_write_struct_failed:
+ fclose (fp);
+ fopen_failed:
+ return status;
+}
+
+int main (int argc, char const *argv[])
+{
+ FT_Library library;
+ FT_Face face;
+ FT_GlyphSlot slot;
+
+ FT_Bitmap* bitmap;
+
+ FT_Error error;
+
+ const char* font_file; // Arguments
+ FT_UInt32 size;
+ FT_UInt glyph_index;
+ const char* character;
+
+ if (argc != 4)
+ {
+ printf("\nTo render a RGBA PNG(s) of a glyph to be displayed on an
\n");
+ printf("LCD surface and to generate the 128bit MurmurHash3 hash \n\n");
+
+ printf("Filter used is FT_LCD_FILTER_DEFAULT\n\n");
+
+ printf("Usage ./<exe> <font_file> <pt_size> <character>\n\n");
+
+ exit(0);
+ }
+
+ font_file = argv[1];
+ size = atoi(argv[2]);
+ character = argv[3];
+
+ error = FT_Init_FreeType( &library );
+ if(error){
+ printf("Error while initialising library\n");
+ }
+
+ error = FT_New_Face( library,
+ font_file,
+ 0,
+ &face );
+ if(error){
+ printf("Error loading new face\n");
+ }
+
+ error = FT_Set_Char_Size( face,
+ size * 64,
+ 0,
+ 100,
+ 0 );
+ if(error){
+ printf("Error setting character size\n");
+ }
+
+ glyph_index = FT_Get_Char_Index( face, *character );
+
+ slot = face->glyph;
+
+ error = FT_Load_Glyph( face,
+ 130,
+ 0);
+ if(error){
+ printf("Error loading glyph\n");
+ }
+
+ FT_Render_Glyph( slot,
+ FT_RENDER_MODE_NORMAL);
+ if(error){
+ printf("Error rendering the glyph\n");
+ }
+
+ bitmap = &slot->bitmap;
+
+ if (bitmap->width == 0 || bitmap->rows == 0)
+ {
+ return 1;
+ }
+
+ char * file_name = ( char * )calloc(20,sizeof(char));
+ /* Write the image to a file 'fruit.png'. */
+ sprintf(file_name, "%d_127.png",glyph_index);
+
+ file_name = "out.png"; // remove this
+
+ bitmap_t fruit;
+ int x;
+ int y;
+
+ /* Create an image. */
+
+ fruit.width = bitmap->width;
+ fruit.height = bitmap->rows;
+
+ fruit.pixels = calloc (fruit.width * fruit.height, sizeof (pixel_t));
+
+ if (! fruit.pixels) {
+ return -1;
+ }
+
+ unsigned char value;
+ for (y = 0; y < fruit.height; y++) {
+ for (x = 0; x < fruit.width; x++) {
+ pixel_t * pixel = pixel_at (& fruit, x, y);
+ value = bitmap->buffer[(y * bitmap->pitch ) + x];
+ pixel->red = 255- value;
+ pixel->green = 255- value;
+ pixel->blue = 255- value;
+ if (value == 0)
+ {
+ pixel->alpha = 0;
+ }else{
+ pixel->alpha = 255;
+ }
+ }
+ }
+
+ save_png_to_file (& fruit, file_name);
+
+ free (fruit.pixels);
+ return 0;
+}
\ No newline at end of file
diff --git a/final/makefile b/final/makefile
new file mode 100644
index 0000000..8f5bb70
--- /dev/null
+++ b/final/makefile
@@ -0,0 +1,22 @@
+# Define required macros here
+
+SHELL = /bin/sh
+
+SRC = hash_to_file.c bitmap.c murmur3.c
+OBJS = $(src:.c=.o)
+
+CFLAGS = -Wall -g
+CC = gcc
+INCLUDE = -I /usr/local/include/freetype2/
+LIBS = -lfreetype
+
+DPI = 100
+
+hash:$(SRC)
+ $(CC) $(CFLAGS) $(INCLUDE) -DDPI=$(DPI) -o $@ $(SRC) $(OBJS) $(LIBS)
+
+.PHONY: clean
+clean:
+ -rm -f *.o
+
+
diff --git a/final/murmur3.c b/final/murmur3.c
new file mode 100644
index 0000000..484ebfd
--- /dev/null
+++ b/final/murmur3.c
@@ -0,0 +1,312 @@
+//-----------------------------------------------------------------------------
+// Note - The x86 and x64 versions do _not_ produce the same results, as the
+// algorithms are optimized for their respective platforms. You can still
+// compile and run any of them on any platform, but your performance with the
+// non-native version will be less than optimal.
+
+#include "murmur3.h"
+
+//-----------------------------------------------------------------------------
+// Platform-specific functions and macros
+
+#ifdef __GNUC__
+#define FORCE_INLINE __attribute__((always_inline)) inline
+#else
+#define FORCE_INLINE inline
+#endif
+
+static FORCE_INLINE uint32_t rotl32 ( uint32_t x, int8_t r )
+{
+ return (x << r) | (x >> (32 - r));
+}
+
+static FORCE_INLINE uint64_t rotl64 ( uint64_t x, int8_t r )
+{
+ return (x << r) | (x >> (64 - r));
+}
+
+#define ROTL32(x,y) rotl32(x,y)
+#define ROTL64(x,y) rotl64(x,y)
+
+#define BIG_CONSTANT(x) (x##LLU)
+
+//-----------------------------------------------------------------------------
+// Block read - if your platform needs to do endian-swapping or can only
+// handle aligned reads, do the conversion here
+
+#define getblock(p, i) (p[i])
+
+//-----------------------------------------------------------------------------
+// Finalization mix - force all bits of a hash block to avalanche
+
+static FORCE_INLINE uint32_t fmix32 ( uint32_t h )
+{
+ h ^= h >> 16;
+ h *= 0x85ebca6b;
+ h ^= h >> 13;
+ h *= 0xc2b2ae35;
+ h ^= h >> 16;
+
+ return h;
+}
+
+//----------
+
+static FORCE_INLINE uint64_t fmix64 ( uint64_t k )
+{
+ k ^= k >> 33;
+ k *= BIG_CONSTANT(0xff51afd7ed558ccd);
+ k ^= k >> 33;
+ k *= BIG_CONSTANT(0xc4ceb9fe1a85ec53);
+ k ^= k >> 33;
+
+ return k;
+}
+
+//-----------------------------------------------------------------------------
+
+void MurmurHash3_x86_32 ( const void * key, int len,
+ uint32_t seed, void * out )
+{
+ const uint8_t * data = (const uint8_t*)key;
+ const int nblocks = len / 4;
+ int i;
+
+ uint32_t h1 = seed;
+
+ uint32_t c1 = 0xcc9e2d51;
+ uint32_t c2 = 0x1b873593;
+
+ //----------
+ // body
+
+ const uint32_t * blocks = (const uint32_t *)(data + nblocks*4);
+
+ for(i = -nblocks; i; i++)
+ {
+ uint32_t k1 = getblock(blocks,i);
+
+ k1 *= c1;
+ k1 = ROTL32(k1,15);
+ k1 *= c2;
+
+ h1 ^= k1;
+ h1 = ROTL32(h1,13);
+ h1 = h1*5+0xe6546b64;
+ }
+
+ //----------
+ // tail
+
+ const uint8_t * tail = (const uint8_t*)(data + nblocks*4);
+
+ uint32_t k1 = 0;
+
+ switch(len & 3)
+ {
+ case 3: k1 ^= tail[2] << 16;
+ case 2: k1 ^= tail[1] << 8;
+ case 1: k1 ^= tail[0];
+ k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1;
+ };
+
+ //----------
+ // finalization
+
+ h1 ^= len;
+
+ h1 = fmix32(h1);
+
+ *(uint32_t*)out = h1;
+}
+
+//-----------------------------------------------------------------------------
+
+void MurmurHash3_x86_128 ( const void * key, const int len,
+ uint32_t seed, void * out )
+{
+ const uint8_t * data = (const uint8_t*)key;
+ const int nblocks = len / 16;
+ int i;
+
+ uint32_t h1 = seed;
+ uint32_t h2 = seed;
+ uint32_t h3 = seed;
+ uint32_t h4 = seed;
+
+ uint32_t c1 = 0x239b961b;
+ uint32_t c2 = 0xab0e9789;
+ uint32_t c3 = 0x38b34ae5;
+ uint32_t c4 = 0xa1e38b93;
+
+ //----------
+ // body
+
+ const uint32_t * blocks = (const uint32_t *)(data + nblocks*16);
+
+ for(i = -nblocks; i; i++)
+ {
+ uint32_t k1 = getblock(blocks,i*4+0);
+ uint32_t k2 = getblock(blocks,i*4+1);
+ uint32_t k3 = getblock(blocks,i*4+2);
+ uint32_t k4 = getblock(blocks,i*4+3);
+
+ k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1;
+
+ h1 = ROTL32(h1,19); h1 += h2; h1 = h1*5+0x561ccd1b;
+
+ k2 *= c2; k2 = ROTL32(k2,16); k2 *= c3; h2 ^= k2;
+
+ h2 = ROTL32(h2,17); h2 += h3; h2 = h2*5+0x0bcaa747;
+
+ k3 *= c3; k3 = ROTL32(k3,17); k3 *= c4; h3 ^= k3;
+
+ h3 = ROTL32(h3,15); h3 += h4; h3 = h3*5+0x96cd1c35;
+
+ k4 *= c4; k4 = ROTL32(k4,18); k4 *= c1; h4 ^= k4;
+
+ h4 = ROTL32(h4,13); h4 += h1; h4 = h4*5+0x32ac3b17;
+ }
+
+ //----------
+ // tail
+
+ const uint8_t * tail = (const uint8_t*)(data + nblocks*16);
+
+ uint32_t k1 = 0;
+ uint32_t k2 = 0;
+ uint32_t k3 = 0;
+ uint32_t k4 = 0;
+
+ switch(len & 15)
+ {
+ case 15: k4 ^= tail[14] << 16;
+ case 14: k4 ^= tail[13] << 8;
+ case 13: k4 ^= tail[12] << 0;
+ k4 *= c4; k4 = ROTL32(k4,18); k4 *= c1; h4 ^= k4;
+
+ case 12: k3 ^= tail[11] << 24;
+ case 11: k3 ^= tail[10] << 16;
+ case 10: k3 ^= tail[ 9] << 8;
+ case 9: k3 ^= tail[ 8] << 0;
+ k3 *= c3; k3 = ROTL32(k3,17); k3 *= c4; h3 ^= k3;
+
+ case 8: k2 ^= tail[ 7] << 24;
+ case 7: k2 ^= tail[ 6] << 16;
+ case 6: k2 ^= tail[ 5] << 8;
+ case 5: k2 ^= tail[ 4] << 0;
+ k2 *= c2; k2 = ROTL32(k2,16); k2 *= c3; h2 ^= k2;
+
+ case 4: k1 ^= tail[ 3] << 24;
+ case 3: k1 ^= tail[ 2] << 16;
+ case 2: k1 ^= tail[ 1] << 8;
+ case 1: k1 ^= tail[ 0] << 0;
+ k1 *= c1; k1 = ROTL32(k1,15); k1 *= c2; h1 ^= k1;
+ };
+
+ //----------
+ // finalization
+
+ h1 ^= len; h2 ^= len; h3 ^= len; h4 ^= len;
+
+ h1 += h2; h1 += h3; h1 += h4;
+ h2 += h1; h3 += h1; h4 += h1;
+
+ h1 = fmix32(h1);
+ h2 = fmix32(h2);
+ h3 = fmix32(h3);
+ h4 = fmix32(h4);
+
+ h1 += h2; h1 += h3; h1 += h4;
+ h2 += h1; h3 += h1; h4 += h1;
+
+ ((uint32_t*)out)[0] = h1;
+ ((uint32_t*)out)[1] = h2;
+ ((uint32_t*)out)[2] = h3;
+ ((uint32_t*)out)[3] = h4;
+}
+
+//-----------------------------------------------------------------------------
+
+void MurmurHash3_x64_128 ( const void * key, const int len,
+ const uint32_t seed, void * out )
+{
+ const uint8_t * data = (const uint8_t*)key;
+ const int nblocks = len / 16;
+ int i;
+
+ uint64_t h1 = seed;
+ uint64_t h2 = seed;
+
+ uint64_t c1 = BIG_CONSTANT(0x87c37b91114253d5);
+ uint64_t c2 = BIG_CONSTANT(0x4cf5ad432745937f);
+
+ //----------
+ // body
+
+ const uint64_t * blocks = (const uint64_t *)(data);
+
+ for(i = 0; i < nblocks; i++)
+ {
+ uint64_t k1 = getblock(blocks,i*2+0);
+ uint64_t k2 = getblock(blocks,i*2+1);
+
+ k1 *= c1; k1 = ROTL64(k1,31); k1 *= c2; h1 ^= k1;
+
+ h1 = ROTL64(h1,27); h1 += h2; h1 = h1*5+0x52dce729;
+
+ k2 *= c2; k2 = ROTL64(k2,33); k2 *= c1; h2 ^= k2;
+
+ h2 = ROTL64(h2,31); h2 += h1; h2 = h2*5+0x38495ab5;
+ }
+
+ //----------
+ // tail
+
+ const uint8_t * tail = (const uint8_t*)(data + nblocks*16);
+
+ uint64_t k1 = 0;
+ uint64_t k2 = 0;
+
+ switch(len & 15)
+ {
+ case 15: k2 ^= (uint64_t)(tail[14]) << 48;
+ case 14: k2 ^= (uint64_t)(tail[13]) << 40;
+ case 13: k2 ^= (uint64_t)(tail[12]) << 32;
+ case 12: k2 ^= (uint64_t)(tail[11]) << 24;
+ case 11: k2 ^= (uint64_t)(tail[10]) << 16;
+ case 10: k2 ^= (uint64_t)(tail[ 9]) << 8;
+ case 9: k2 ^= (uint64_t)(tail[ 8]) << 0;
+ k2 *= c2; k2 = ROTL64(k2,33); k2 *= c1; h2 ^= k2;
+
+ case 8: k1 ^= (uint64_t)(tail[ 7]) << 56;
+ case 7: k1 ^= (uint64_t)(tail[ 6]) << 48;
+ case 6: k1 ^= (uint64_t)(tail[ 5]) << 40;
+ case 5: k1 ^= (uint64_t)(tail[ 4]) << 32;
+ case 4: k1 ^= (uint64_t)(tail[ 3]) << 24;
+ case 3: k1 ^= (uint64_t)(tail[ 2]) << 16;
+ case 2: k1 ^= (uint64_t)(tail[ 1]) << 8;
+ case 1: k1 ^= (uint64_t)(tail[ 0]) << 0;
+ k1 *= c1; k1 = ROTL64(k1,31); k1 *= c2; h1 ^= k1;
+ };
+
+ //----------
+ // finalization
+
+ h1 ^= len; h2 ^= len;
+
+ h1 += h2;
+ h2 += h1;
+
+ h1 = fmix64(h1);
+ h2 = fmix64(h2);
+
+ h1 += h2;
+ h2 += h1;
+
+ ((uint64_t*)out)[0] = h1;
+ ((uint64_t*)out)[1] = h2;
+}
+
+//-----------------------------------------------------------------------------
+
diff --git a/final/murmur3.h b/final/murmur3.h
new file mode 100644
index 0000000..90878b0
--- /dev/null
+++ b/final/murmur3.h
@@ -0,0 +1,24 @@
+#ifndef _MURMURHASH3_H_
+#define _MURMURHASH3_H_
+
+#include <stdint.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+//-----------------------------------------------------------------------------
+
+void MurmurHash3_x86_32 (const void *key, int len, uint32_t seed, void *out);
+
+void MurmurHash3_x86_128(const void *key, int len, uint32_t seed, void *out);
+
+void MurmurHash3_x64_128(const void *key, int len, uint32_t seed, void *out);
+
+//-----------------------------------------------------------------------------
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // _MURMURHASH3_H_
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [freetype2] ksvsk_test 3ee5b29: Pushing edited code for hash generation,
Kushal K S V S <=