rewrite for compability

This commit is contained in:
2026-07-14 15:46:22 +03:00
parent e39d6b2401
commit 0628c9ba48
2 changed files with 128 additions and 17 deletions
+20 -17
View File
@@ -2,24 +2,11 @@
#include "stdio.h" #include "stdio.h"
#include "system.h" #include "system.h"
uint64_t hash(const char* str) {
uint64_t h = 0xcbf29ce484222325ULL;
while (*str) {
h ^= (uint64_t)(unsigned char)(*str++);
h *= 0x100000001b3ULL;
}
return h;
}
// ---
struct set { struct set {
size_t cnt; size_t cnt;
struct symbols { struct symbols {
const char* str; const char* str;
uint64_t hash; int hash;
}* symbols_v; }* symbols_v;
}; };
@@ -61,6 +48,20 @@ struct set* set_free(struct set* set) {
// --- // ---
static unsigned int hash(const char* str) {
unsigned int hash = 0x9e3779b9;
const unsigned char* p = (const unsigned char*)str;
while (*p) {
hash += *p++;
hash += (hash << 10);
hash ^= (hash >> 6);
}
hash += (hash << 3);
hash ^= (hash >> 11);
hash += (hash << 15);
return hash;
}
int cmp(const void* arg1, const void* arg2) { int cmp(const void* arg1, const void* arg2) {
const struct symbols* s1 = arg1; const struct symbols* s1 = arg1;
const struct symbols* s2 = arg2; const struct symbols* s2 = arg2;
@@ -76,9 +77,9 @@ const char* set_fini(struct set* set, int bpp) {
assert(set != NULL); assert(set != NULL);
assert(set->cnt > 0); assert(set->cnt > 0);
assert(bpp >= 10 && bpp <= 63); assert(bpp >= 10 && bpp <= 32);
uint64_t mask = (1ULL << bpp) - 1; int mask = (bpp < 32) ? (1u << bpp) - 1 : ~0u;
for (size_t i = 0; i < set->cnt; ++i) { for (size_t i = 0; i < set->cnt; ++i) {
set->symbols_v[i].hash = hash(set->symbols_v[i].str) & mask; set->symbols_v[i].hash = hash(set->symbols_v[i].str) & mask;
@@ -86,6 +87,7 @@ const char* set_fini(struct set* set, int bpp) {
qsort(set->symbols_v, set->cnt, sizeof *set->symbols_v, cmp); qsort(set->symbols_v, set->cnt, sizeof *set->symbols_v, cmp);
// warn on hash collizions
for (size_t i = 0; i < set->cnt - 1; ++i) { for (size_t i = 0; i < set->cnt - 1; ++i) {
if (set->symbols_v[i].hash != set->symbols_v[i + 1].hash) continue; if (set->symbols_v[i].hash != set->symbols_v[i + 1].hash) continue;
if (!strcmp(set->symbols_v[i].str, set->symbols_v[i + 1].str)) continue; if (!strcmp(set->symbols_v[i].str, set->symbols_v[i + 1].str)) continue;
@@ -94,9 +96,10 @@ const char* set_fini(struct set* set, int bpp) {
set->symbols_v[i + 1].str); set->symbols_v[i + 1].str);
} }
uint64_t unique_hash[set->cnt]; int unique_hash[set->cnt];
size_t unique_cnt = 0; size_t unique_cnt = 0;
// delete duplicates
for (size_t i = 0; i < set->cnt; ++i) { for (size_t i = 0; i < set->cnt; ++i) {
while (i + 1 < set->cnt && set->symbols_v[i].hash == set->symbols_v[i + 1].hash) { while (i + 1 < set->cnt && set->symbols_v[i].hash == set->symbols_v[i + 1].hash) {
++i; ++i;
+108
View File
@@ -0,0 +1,108 @@
#include "stdint.h"
#include "stdio.h"
#include "system.h"
struct set {
size_t cnt;
struct symbols {
const char* str;
uint64_t hash;
}* symbols_v;
};
struct set* set_new() {
// should we use x___ funcs?
struct set* set = xmalloc(sizeof *set);
set->cnt = 0;
set->symbols_v = NULL;
return set;
}
void set_add(struct set* set, const char* sym) {
const int delta = 1024;
if (set->cnt % delta == 0) {
set->symbols_v = xrealloc(set->symbols_v, sizeof(*set->symbols_v) * (set->cnt + delta));
}
set->symbols_v[set->cnt].str = xstrdup(sym);
set->symbols_v[set->cnt].hash = 0;
set->cnt++;
return;
}
struct set* set_free(struct set* set) {
if (set) {
for (size_t i = 0; i < set->cnt; ++i) {
_free((char*)set->symbols_v[i].str);
}
_free(set->symbols_v);
set = _free(set);
}
return NULL;
}
// ---
uint64_t hash(const char* str) {
uint64_t h = 0xcbf29ce484222325ULL;
while (*str) {
h ^= (uint64_t)(unsigned char)(*str++);
h *= 0x100000001b3ULL;
}
return h;
}
int cmp(const void* arg1, const void* arg2) {
const struct symbols* s1 = arg1;
const struct symbols* s2 = arg2;
if (s1->hash > s2->hash) return 1;
if (s2->hash > s1->hash) return -1;
return 0;
}
const char* set_fini(struct set* set, int bpp) {
// Implementation for finalizing the set
assert(set != NULL);
assert(set->cnt > 0);
assert(bpp >= 10 && bpp <= 63);
uint64_t mask = (1ULL << bpp) - 1;
for (size_t i = 0; i < set->cnt; ++i) {
set->symbols_v[i].hash = hash(set->symbols_v[i].str) & mask;
}
qsort(set->symbols_v, set->cnt, sizeof *set->symbols_v, cmp);
// warn on hash collizions
for (size_t i = 0; i < set->cnt - 1; ++i) {
if (set->symbols_v[i].hash != set->symbols_v[i + 1].hash) continue;
if (!strcmp(set->symbols_v[i].str, set->symbols_v[i + 1].str)) continue;
fprintf(stderr, "warning: hash collision: %s %s\n", set->symbols_v[i].str,
set->symbols_v[i + 1].str);
}
uint64_t unique_hash[set->cnt];
size_t unique_cnt = 0;
// delete duplicates
for (size_t i = 0; i < set->cnt; ++i) {
while (i + 1 < set->cnt && set->symbols_v[i].hash == set->symbols_v[i + 1].hash) {
++i;
}
unique_hash[unique_cnt++] = set->symbols_v[i].hash;
}
return NULL;
}