From b485aab7e71c1625cfc27e0f92c9509f42378458 Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sun, 5 May 2024 13:19:16 +0200 Subject: Adding upstream version 1.45.3+dfsg. Signed-off-by: Daniel Baumann --- web/server/h2o/libh2o/deps/klib/kgraph.h | 79 -------------------------------- 1 file changed, 79 deletions(-) delete mode 100644 web/server/h2o/libh2o/deps/klib/kgraph.h (limited to 'web/server/h2o/libh2o/deps/klib/kgraph.h') diff --git a/web/server/h2o/libh2o/deps/klib/kgraph.h b/web/server/h2o/libh2o/deps/klib/kgraph.h deleted file mode 100644 index af008ef7e..000000000 --- a/web/server/h2o/libh2o/deps/klib/kgraph.h +++ /dev/null @@ -1,79 +0,0 @@ -#ifndef AC_KGRAPH_H -#define AC_KGRAPH_H - -#include -#include -#include "khash.h" -#include "kbtree.h" - -typedef unsigned kgint_t; - -#define kgraph_t(name) kh_##name##_t - -#define __KG_BASIC(name, SCOPE, vertex_t, arc_t, ehn) \ - SCOPE kgraph_t(name) *kg_init_##name(void) { return kh_init(name); } \ - SCOPE void kg_destroy_##name(kgraph_t(name) *g) { \ - khint_t k; \ - if (g == 0) return; \ - for (k = kh_begin(g); k != kh_end(g); ++k) \ - if (kh_exist(g, k)) kh_destroy(ehn, kh_val(g, k)._arc); \ - kh_destroy(name, g); \ - } \ - SCOPE vertex_t *kg_get_v_##name(kgraph_t(name) *g, kgint_t v) { \ - khint_t k = kh_get(name, g, v); \ - return k == kh_end(g)? 0 : &kh_val(g, k); \ - } \ - SCOPE vertex_t *kg_put_v_##name(kgraph_t(name) *g, kgint_t v, int *absent) { \ - khint_t k; \ - k = kh_put(name, g, v, absent); \ - if (*absent) kh_val(g, k)._arc = kh_init(ehn); \ - return &kh_val(g, k); \ - } \ - SCOPE void kg_put_a_##name(kgraph_t(name) *g, kgint_t vbeg, kgint_t vend, int dir, arc_t **pb, arc_t **pe) { \ - vertex_t *p; \ - khint_t k; \ - int absent; \ - p = kg_put_v_##name(g, vbeg, &absent); \ - k = kh_put(ehn, p->_arc, vend<<2|dir, &absent); \ - *pb = &kh_val(p->_arc, k); \ - p = kg_put_v_##name(g, vend, &absent); \ - k = kh_put(ehn, p->_arc, vbeg<<2|(~dir&3), &absent); \ - *pe = &kh_val(p->_arc, k); \ - } \ - SCOPE vertex_t *kg_del_v_##name(kgraph_t(name) *g, kgint_t v) { \ - khint_t k, k0, k2, k3; \ - khash_t(ehn) *h; \ - k0 = k = kh_get(name, g, v); \ - if (k == kh_end(g)) return 0; /* not present in the graph */ \ - h = kh_val(g, k)._arc; \ - for (k = kh_begin(h); k != kh_end(h); ++k) /* remove v from its neighbors */ \ - if (kh_exist(h, k)) { \ - k2 = kh_get(name, g, kh_key(h, k)>>2); \ - /* assert(k2 != kh_end(g)); */ \ - k3 = kh_get(ehn, kh_val(g, k2)._arc, v<<2|(~kh_key(h, k)&3)); \ - /* assert(k3 != kh_end(kh_val(g, k2)._arc)); */ \ - kh_del(ehn, kh_val(g, k2)._arc, k3); \ - } \ - kh_destroy(ehn, h); \ - kh_del(name, g, k0); \ - return &kh_val(g, k0); \ - } - -#define KGRAPH_PRINT(name, SCOPE) \ - SCOPE void kg_print_##name(kgraph_t(name) *g) { \ - khint_t k, k2; \ - for (k = kh_begin(g); k != kh_end(g); ++k) \ - if (kh_exist(g, k)) { \ - printf("v %u\n", kh_key(g, k)); \ - for (k2 = kh_begin(kh_val(g, k)._arc); k2 != kh_end(kh_val(g, k)._arc); ++k2) \ - if (kh_exist(kh_val(g, k)._arc, k2) && kh_key(g, k) < kh_key(kh_val(g, k)._arc, k2)>>2) \ - printf("a %u%c%c%u\n", kh_key(g, k), "><"[kh_key(kh_val(g, k)._arc, k2)>>1&1], \ - "><"[kh_key(kh_val(g, k)._arc, k2)&1], kh_key(kh_val(g, k)._arc, k2)>>2); \ - } \ - } - -#define KGRAPH_INIT(name, SCOPE, vertex_t, arc_t, ehn) \ - KHASH_INIT2(name, SCOPE, kgint_t, vertex_t, 1, kh_int_hash_func, kh_int_hash_equal) \ - __KG_BASIC(name, SCOPE, vertex_t, arc_t, ehn) - -#endif -- cgit v1.2.3