Coverage Report

Created: 2019-07-03 22:50

/home/liu/buildslave/linux-x64-runtests/build/lib/3rdparty/khash/khash.h
Line
Count
Source (jump to first uncovered line)
1
/* The MIT License
2
3
   Copyright (c) 2008, 2009, 2011 by Attractive Chaos <attractor@live.co.uk>
4
5
   Permission is hereby granted, free of charge, to any person obtaining
6
   a copy of this software and associated documentation files (the
7
   "Software"), to deal in the Software without restriction, including
8
   without limitation the rights to use, copy, modify, merge, publish,
9
   distribute, sublicense, and/or sell copies of the Software, and to
10
   permit persons to whom the Software is furnished to do so, subject to
11
   the following conditions:
12
13
   The above copyright notice and this permission notice shall be
14
   included in all copies or substantial portions of the Software.
15
16
   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
17
   EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
18
   MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
19
   NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
20
   BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
21
   ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
22
   CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
23
   SOFTWARE.
24
*/
25
26
/*
27
  An example:
28
29
#include "khash.h"
30
KHASH_MAP_INIT_INT(32, char)
31
int main() {
32
  int ret, is_missing;
33
  khiter_t k;
34
  khash_t(32) *h = kh_init(32);
35
  k = kh_put(32, h, 5, &ret);
36
  kh_value(h, k) = 10;
37
  k = kh_get(32, h, 10);
38
  is_missing = (k == kh_end(h));
39
  k = kh_get(32, h, 5);
40
  kh_del(32, h, k);
41
  for (k = kh_begin(h); k != kh_end(h); ++k)
42
    if (kh_exist(h, k)) kh_value(h, k) = 1;
43
  kh_destroy(32, h);
44
  return 0;
45
}
46
*/
47
48
/*
49
  2013-05-02 (0.2.8):
50
51
  * Use quadratic probing. When the capacity is power of 2, stepping function
52
    i*(i+1)/2 guarantees to traverse each bucket. It is better than double
53
    hashing on cache performance and is more robust than linear probing.
54
55
    In theory, double hashing should be more robust than quadratic probing.
56
    However, my implementation is probably not for large hash tables, because
57
    the second hash function is closely tied to the first hash function,
58
    which reduce the effectiveness of double hashing.
59
60
  Reference: http://research.cs.vt.edu/AVresearch/hashing/quadratic.php
61
62
  2011-12-29 (0.2.7):
63
64
    * Minor code clean up; no actual effect.
65
66
  2011-09-16 (0.2.6):
67
68
  * The capacity is a power of 2. This seems to dramatically improve the
69
    speed for simple keys. Thank Zilong Tan for the suggestion. Reference:
70
71
     - http://code.google.com/p/ulib/
72
     - http://nothings.org/computer/judy/
73
74
  * Allow to optionally use linear probing which usually has better
75
    performance for random input. Double hashing is still the default as it
76
    is more robust to certain non-random input.
77
78
  * Added Wang's integer hash function (not used by default). This hash
79
    function is more robust to certain non-random input.
80
81
  2011-02-14 (0.2.5):
82
83
    * Allow to declare global functions.
84
85
  2009-09-26 (0.2.4):
86
87
    * Improve portability
88
89
  2008-09-19 (0.2.3):
90
91
  * Corrected the example
92
  * Improved interfaces
93
94
  2008-09-11 (0.2.2):
95
96
  * Improved speed a little in kh_put()
97
98
  2008-09-10 (0.2.1):
99
100
  * Added kh_clear()
101
  * Fixed a compiling error
102
103
  2008-09-02 (0.2.0):
104
105
  * Changed to token concatenation which increases flexibility.
106
107
  2008-08-31 (0.1.2):
108
109
  * Fixed a bug in kh_get(), which has not been tested previously.
110
111
  2008-08-31 (0.1.1):
112
113
  * Added destructor
114
*/
115
116
117
#ifndef __AC_KHASH_H
118
#define __AC_KHASH_H
119
120
/*!
121
  @header
122
123
  Generic hash table library.
124
 */
125
126
#define AC_VERSION_KHASH_H "0.2.8"
127
128
#include <stdlib.h>
129
#include <string.h>
130
#include <limits.h>
131
132
/* compiler specific configuration */
133
134
#if UINT_MAX == 0xffffffffu
135
typedef unsigned int khint32_t;
136
#elif ULONG_MAX == 0xffffffffu
137
typedef unsigned long khint32_t;
138
#endif
139
140
#if ULONG_MAX == ULLONG_MAX
141
typedef unsigned long khint64_t;
142
#else
143
typedef unsigned long long khint64_t;
144
#endif
145
146
#ifndef kh_inline
147
#ifdef _MSC_VER
148
#define kh_inline __inline
149
#else
150
#define kh_inline inline
151
#endif
152
#endif /* kh_inline */
153
154
#ifndef klib_unused
155
#if (defined __clang__ && __clang_major__ >= 3) || (defined __GNUC__ && __GNUC__ >= 3)
156
#define klib_unused __attribute__ ((__unused__))
157
#else
158
#define klib_unused
159
#endif
160
#endif /* klib_unused */
161
162
typedef khint32_t khint_t;
163
typedef khint_t khiter_t;
164
165
228M
#define __ac_isempty(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&2)
166
171M
#define __ac_isdel(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&1)
167
22.8M
#define __ac_iseither(flag, i) ((flag[i>>4]>>((i&0xfU)<<1))&3)
168
#define __ac_set_isdel_false(flag, i) (flag[i>>4]&=~(1ul<<((i&0xfU)<<1)))
169
0
#define __ac_set_isempty_false(flag, i) (flag[i>>4]&=~(2ul<<((i&0xfU)<<1)))
170
46
#define __ac_set_isboth_false(flag, i) (flag[i>>4]&=~(3ul<<((i&0xfU)<<1)))
171
0
#define __ac_set_isdel_true(flag, i) (flag[i>>4]|=1ul<<((i&0xfU)<<1))
172
173
40
#define __ac_fsize(m) ((m) < 16? 1 : 
(m)>>40
)
174
175
#ifndef kroundup32
176
40
#define kroundup32(x) (--(x), (x)|=(x)>>1, (x)|=(x)>>2, (x)|=(x)>>4, (x)|=(x)>>8, (x)|=(x)>>16, ++(x))
177
#endif
178
179
#ifndef kcalloc
180
395
#define kcalloc(N,Z) calloc(N,Z)
181
#endif
182
#ifndef kmalloc
183
40
#define kmalloc(Z) malloc(Z)
184
#endif
185
#ifndef krealloc
186
80
#define krealloc(P,Z) realloc(P,Z)
187
#endif
188
#ifndef kfree
189
1.62k
#define kfree(P) free(P)
190
#endif
191
192
static const double __ac_HASH_UPPER = 0.77;
193
194
#define __KHASH_TYPE(name, khkey_t, khval_t) \
195
  typedef struct kh_##name##_s { \
196
    khint_t n_buckets, size, n_occupied, upper_bound; \
197
    khint32_t *flags; \
198
    khkey_t *keys; \
199
    khval_t *vals; \
200
  } kh_##name##_t;
201
202
#define __KHASH_PROTOTYPES(name, khkey_t, khval_t)            \
203
  extern kh_##name##_t *kh_init_##name(void);             \
204
  extern void kh_destroy_##name(kh_##name##_t *h);          \
205
  extern void kh_clear_##name(kh_##name##_t *h);            \
206
  extern khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key);  \
207
  extern int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets); \
208
  extern khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret); \
209
  extern void kh_del_##name(kh_##name##_t *h, khint_t x);
210
211
#define __KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
212
395
  SCOPE kh_##name##_t *kh_init_##name(void) {             \
213
395
    return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t));   \
214
395
  }                                  \
Unexecuted instantiation: tape.tests.c:kh_init_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_init_signal_container
ccv_nnc_stream.c:kh_init_signal_container
Line
Count
Source
212
363
  SCOPE kh_##name##_t *kh_init_##name(void) {             \
213
363
    return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t));   \
214
363
  }                                  \
Unexecuted instantiation: ccv_nnc_graph.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_init_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_init_signal_container
ccv_cnnp_dataframe.c:kh_init_ctx
Line
Count
Source
212
30
  SCOPE kh_##name##_t *kh_init_##name(void) {             \
213
30
    return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t));   \
214
30
  }                                  \
ccv_cnnp_dataframe.c:kh_init_iter_ctx
Line
Count
Source
212
2
  SCOPE kh_##name##_t *kh_init_##name(void) {             \
213
2
    return (kh_##name##_t*)kcalloc(1, sizeof(kh_##name##_t));   \
214
2
  }                                  \
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_init_signal_container
215
  SCOPE void kh_destroy_##name(kh_##name##_t *h)            \
216
395
  {                                 \
217
395
    if (h) {                           \
218
395
      kfree((void *)h->keys); kfree(h->flags);         \
219
395
      kfree((void *)h->vals);                    \
220
395
      kfree(h);                          \
221
395
    }                               \
222
395
  }                                  \
Unexecuted instantiation: tape.tests.c:kh_destroy_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_destroy_signal_container
ccv_nnc_stream.c:kh_destroy_signal_container
Line
Count
Source
216
363
  {                                 \
217
363
    if (h) {                           \
218
363
      kfree((void *)h->keys); kfree(h->flags);         \
219
363
      kfree((void *)h->vals);                    \
220
363
      kfree(h);                          \
221
363
    }                               \
222
363
  }                                  \
Unexecuted instantiation: ccv_nnc_graph.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_destroy_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_destroy_signal_container
ccv_cnnp_dataframe.c:kh_destroy_iter_ctx
Line
Count
Source
216
2
  {                                 \
217
2
    if (h) {                           \
218
2
      kfree((void *)h->keys); kfree(h->flags);         \
219
2
      kfree((void *)h->vals);                    \
220
2
      kfree(h);                          \
221
2
    }                               \
222
2
  }                                  \
ccv_cnnp_dataframe.c:kh_destroy_ctx
Line
Count
Source
216
30
  {                                 \
217
30
    if (h) {                           \
218
30
      kfree((void *)h->keys); kfree(h->flags);         \
219
30
      kfree((void *)h->vals);                    \
220
30
      kfree(h);                          \
221
30
    }                               \
222
30
  }                                  \
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_destroy_signal_container
223
  SCOPE void kh_clear_##name(kh_##name##_t *h)            \
224
0
  {                                 \
225
0
    if (h && h->flags) {                      \
226
0
      memset(h->flags, 0xaa, __ac_fsize(h->n_buckets) * sizeof(khint32_t)); \
227
0
      h->size = h->n_occupied = 0;                \
228
0
    }                               \
229
0
  }                                  \
Unexecuted instantiation: tape.tests.c:kh_clear_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_stream.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_graph.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_clear_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_clear_signal_container
Unexecuted instantiation: ccv_cnnp_dataframe.c:kh_clear_ctx
Unexecuted instantiation: ccv_cnnp_dataframe.c:kh_clear_iter_ctx
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_clear_signal_container
230
  SCOPE khint_t kh_get_##name(const kh_##name##_t *h, khkey_t key)  \
231
22.8M
  {                                 \
232
22.8M
    if (h->n_buckets) {                       \
233
22.8M
      khint_t k, i, last, mask, step = 0; \
234
22.8M
      mask = h->n_buckets - 1;                  \
235
22.8M
      k = __hash_func(key); i = k & mask;              \
236
22.8M
      last = i; \
237
34.2M
      while (!__ac_isempty(h->flags, i) && 
(34.2M
__ac_isdel34.2M
(h->flags, i) ||
!34.2M
__hash_equal34.2M
(h->keys[i], key))) { \
238
11.3M
        i = (i + (++step)) & mask; \
239
11.3M
        if (i == last) 
return h->n_buckets0
; \
240
11.3M
      }                              \
241
22.8M
      return __ac_iseither(h->flags, i)? 
h->n_buckets13.3k
:
i22.8M
; \
242
22.8M
    } else 
return 022.6k
; \
243
22.8M
  }                                  \
Unexecuted instantiation: tape.tests.c:kh_get_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_stream.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_graph.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_get_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_get_signal_container
ccv_cnnp_dataframe.c:kh_get_ctx
Line
Count
Source
231
22.8M
  {                                 \
232
22.8M
    if (h->n_buckets) {                       \
233
22.8M
      khint_t k, i, last, mask, step = 0; \
234
22.8M
      mask = h->n_buckets - 1;                  \
235
22.8M
      k = __hash_func(key); i = k & mask;              \
236
22.8M
      last = i; \
237
34.2M
      while (!__ac_isempty(h->flags, i) && 
(34.2M
__ac_isdel34.2M
(h->flags, i) ||
!34.2M
__hash_equal34.2M
(h->keys[i], key))) { \
238
11.3M
        i = (i + (++step)) & mask; \
239
11.3M
        if (i == last) 
return h->n_buckets0
; \
240
11.3M
      }                              \
241
22.8M
      return __ac_iseither(h->flags, i)? 
h->n_buckets13.3k
:
i22.8M
; \
242
22.8M
    } else 
return 022.6k
; \
243
22.8M
  }                                  \
Unexecuted instantiation: ccv_cnnp_dataframe.c:kh_get_iter_ctx
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_get_signal_container
244
  SCOPE int kh_resize_##name(kh_##name##_t *h, khint_t new_n_buckets) \
245
40
  { /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
246
40
    khint32_t *new_flags = 0;                   \
247
40
    khint_t j = 1;                          \
248
40
    {                               \
249
40
      kroundup32(new_n_buckets);                  \
250
40
      if (new_n_buckets < 4) new_n_buckets = 4;         \
251
40
      if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) 
j = 00
; /* requested size is too small */ \
252
40
      else { /* hash table size to be changed (shrink or expand); rehash */ \
253
40
        new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t));  \
254
40
        if (!new_flags) 
return -10
; \
255
40
        memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
256
40
        if (h->n_buckets < new_n_buckets) { /* expand */    \
257
40
          khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
258
40
          if (!new_keys) 
{ 0
kfree0
(new_flags); return -1; } \
259
40
          h->keys = new_keys;                 \
260
40
          if (kh_is_map) {                 \
261
40
            khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
262
40
            if (!new_vals) 
{ 0
kfree0
(new_flags); return -1; } \
263
40
            h->vals = new_vals;               \
264
40
          }                          \
265
40
        } /* otherwise shrink */                \
266
40
      }                             \
267
40
    }                               \
268
40
    if (j) { /* rehashing is needed */               \
269
40
      for (j = 0; j != h->n_buckets; 
++j0
) { \
270
0
        if (__ac_iseither(h->flags, j) == 0) {         \
271
0
          khkey_t key = h->keys[j];             \
272
0
          khval_t val;                    \
273
0
          khint_t new_mask;                 \
274
0
          new_mask = new_n_buckets - 1;             \
275
0
          if (kh_is_map) val = h->vals[j];         \
276
0
          __ac_set_isdel_true(h->flags, j);          \
277
0
          while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
278
0
            khint_t k, i, step = 0; \
279
0
            k = __hash_func(key);              \
280
0
            i = k & new_mask;               \
281
0
            while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
282
0
            __ac_set_isempty_false(new_flags, i);     \
283
0
            if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
284
0
              { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
285
0
              if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
286
0
              __ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
287
0
            } else { /* write the element and jump out of the loop */ \
288
0
              h->keys[i] = key;             \
289
0
              if (kh_is_map) h->vals[i] = val;     \
290
0
              break;                    \
291
0
            }                       \
292
0
          }                         \
293
0
        }                           \
294
0
      }                              \
295
40
      if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
296
0
        h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
297
0
        if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
298
0
      }                              \
299
40
      kfree(h->flags); /* free the working space */        \
300
40
      h->flags = new_flags;                   \
301
40
      h->n_buckets = new_n_buckets;               \
302
40
      h->n_occupied = h->size;                  \
303
40
      h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
304
40
    }                               \
305
40
    return 0;                           \
306
40
  }                                  \
Unexecuted instantiation: tape.tests.c:kh_resize_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_resize_signal_container
ccv_nnc_stream.c:kh_resize_signal_container
Line
Count
Source
245
8
  { /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
246
8
    khint32_t *new_flags = 0;                   \
247
8
    khint_t j = 1;                          \
248
8
    {                               \
249
8
      kroundup32(new_n_buckets);                  \
250
8
      if (new_n_buckets < 4) new_n_buckets = 4;         \
251
8
      if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) 
j = 00
; /* requested size is too small */ \
252
8
      else { /* hash table size to be changed (shrink or expand); rehash */ \
253
8
        new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t));  \
254
8
        if (!new_flags) 
return -10
; \
255
8
        memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
256
8
        if (h->n_buckets < new_n_buckets) { /* expand */    \
257
8
          khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
258
8
          if (!new_keys) 
{ 0
kfree0
(new_flags); return -1; } \
259
8
          h->keys = new_keys;                 \
260
8
          if (kh_is_map) {                 \
261
8
            khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
262
8
            if (!new_vals) 
{ 0
kfree0
(new_flags); return -1; } \
263
8
            h->vals = new_vals;               \
264
8
          }                          \
265
8
        } /* otherwise shrink */                \
266
8
      }                             \
267
8
    }                               \
268
8
    if (j) { /* rehashing is needed */               \
269
8
      for (j = 0; j != h->n_buckets; 
++j0
) { \
270
0
        if (__ac_iseither(h->flags, j) == 0) {         \
271
0
          khkey_t key = h->keys[j];             \
272
0
          khval_t val;                    \
273
0
          khint_t new_mask;                 \
274
0
          new_mask = new_n_buckets - 1;             \
275
0
          if (kh_is_map) val = h->vals[j];         \
276
0
          __ac_set_isdel_true(h->flags, j);          \
277
0
          while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
278
0
            khint_t k, i, step = 0; \
279
0
            k = __hash_func(key);              \
280
0
            i = k & new_mask;               \
281
0
            while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
282
0
            __ac_set_isempty_false(new_flags, i);     \
283
0
            if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
284
0
              { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
285
0
              if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
286
0
              __ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
287
0
            } else { /* write the element and jump out of the loop */ \
288
0
              h->keys[i] = key;             \
289
0
              if (kh_is_map) h->vals[i] = val;     \
290
0
              break;                    \
291
0
            }                       \
292
0
          }                         \
293
0
        }                           \
294
0
      }                              \
295
8
      if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
296
0
        h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
297
0
        if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
298
0
      }                              \
299
8
      kfree(h->flags); /* free the working space */        \
300
8
      h->flags = new_flags;                   \
301
8
      h->n_buckets = new_n_buckets;               \
302
8
      h->n_occupied = h->size;                  \
303
8
      h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
304
8
    }                               \
305
8
    return 0;                           \
306
8
  }                                  \
Unexecuted instantiation: ccv_nnc_graph.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_resize_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_resize_signal_container
ccv_cnnp_dataframe.c:kh_resize_ctx
Line
Count
Source
245
30
  { /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
246
30
    khint32_t *new_flags = 0;                   \
247
30
    khint_t j = 1;                          \
248
30
    {                               \
249
30
      kroundup32(new_n_buckets);                  \
250
30
      if (new_n_buckets < 4) new_n_buckets = 4;         \
251
30
      if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) 
j = 00
; /* requested size is too small */ \
252
30
      else { /* hash table size to be changed (shrink or expand); rehash */ \
253
30
        new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t));  \
254
30
        if (!new_flags) 
return -10
; \
255
30
        memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
256
30
        if (h->n_buckets < new_n_buckets) { /* expand */    \
257
30
          khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
258
30
          if (!new_keys) 
{ 0
kfree0
(new_flags); return -1; } \
259
30
          h->keys = new_keys;                 \
260
30
          if (kh_is_map) {                 \
261
30
            khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
262
30
            if (!new_vals) 
{ 0
kfree0
(new_flags); return -1; } \
263
30
            h->vals = new_vals;               \
264
30
          }                          \
265
30
        } /* otherwise shrink */                \
266
30
      }                             \
267
30
    }                               \
268
30
    if (j) { /* rehashing is needed */               \
269
30
      for (j = 0; j != h->n_buckets; 
++j0
) { \
270
0
        if (__ac_iseither(h->flags, j) == 0) {         \
271
0
          khkey_t key = h->keys[j];             \
272
0
          khval_t val;                    \
273
0
          khint_t new_mask;                 \
274
0
          new_mask = new_n_buckets - 1;             \
275
0
          if (kh_is_map) val = h->vals[j];         \
276
0
          __ac_set_isdel_true(h->flags, j);          \
277
0
          while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
278
0
            khint_t k, i, step = 0; \
279
0
            k = __hash_func(key);              \
280
0
            i = k & new_mask;               \
281
0
            while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
282
0
            __ac_set_isempty_false(new_flags, i);     \
283
0
            if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
284
0
              { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
285
0
              if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
286
0
              __ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
287
0
            } else { /* write the element and jump out of the loop */ \
288
0
              h->keys[i] = key;             \
289
0
              if (kh_is_map) h->vals[i] = val;     \
290
0
              break;                    \
291
0
            }                       \
292
0
          }                         \
293
0
        }                           \
294
0
      }                              \
295
30
      if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
296
0
        h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
297
0
        if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
298
0
      }                              \
299
30
      kfree(h->flags); /* free the working space */        \
300
30
      h->flags = new_flags;                   \
301
30
      h->n_buckets = new_n_buckets;               \
302
30
      h->n_occupied = h->size;                  \
303
30
      h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
304
30
    }                               \
305
30
    return 0;                           \
306
30
  }                                  \
ccv_cnnp_dataframe.c:kh_resize_iter_ctx
Line
Count
Source
245
2
  { /* This function uses 0.25*n_buckets bytes of working space instead of [sizeof(key_t+val_t)+.25]*n_buckets. */ \
246
2
    khint32_t *new_flags = 0;                   \
247
2
    khint_t j = 1;                          \
248
2
    {                               \
249
2
      kroundup32(new_n_buckets);                  \
250
2
      if (new_n_buckets < 4) new_n_buckets = 4;         \
251
2
      if (h->size >= (khint_t)(new_n_buckets * __ac_HASH_UPPER + 0.5)) 
j = 00
; /* requested size is too small */ \
252
2
      else { /* hash table size to be changed (shrink or expand); rehash */ \
253
2
        new_flags = (khint32_t*)kmalloc(__ac_fsize(new_n_buckets) * sizeof(khint32_t));  \
254
2
        if (!new_flags) 
return -10
; \
255
2
        memset(new_flags, 0xaa, __ac_fsize(new_n_buckets) * sizeof(khint32_t)); \
256
2
        if (h->n_buckets < new_n_buckets) { /* expand */    \
257
2
          khkey_t *new_keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
258
2
          if (!new_keys) 
{ 0
kfree0
(new_flags); return -1; } \
259
2
          h->keys = new_keys;                 \
260
2
          if (kh_is_map) {                 \
261
2
            khval_t *new_vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
262
2
            if (!new_vals) 
{ 0
kfree0
(new_flags); return -1; } \
263
2
            h->vals = new_vals;               \
264
2
          }                          \
265
2
        } /* otherwise shrink */                \
266
2
      }                             \
267
2
    }                               \
268
2
    if (j) { /* rehashing is needed */               \
269
2
      for (j = 0; j != h->n_buckets; 
++j0
) { \
270
0
        if (__ac_iseither(h->flags, j) == 0) {         \
271
0
          khkey_t key = h->keys[j];             \
272
0
          khval_t val;                    \
273
0
          khint_t new_mask;                 \
274
0
          new_mask = new_n_buckets - 1;             \
275
0
          if (kh_is_map) val = h->vals[j];         \
276
0
          __ac_set_isdel_true(h->flags, j);          \
277
0
          while (1) { /* kick-out process; sort of like in Cuckoo hashing */ \
278
0
            khint_t k, i, step = 0; \
279
0
            k = __hash_func(key);              \
280
0
            i = k & new_mask;               \
281
0
            while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
282
0
            __ac_set_isempty_false(new_flags, i);     \
283
0
            if (i < h->n_buckets && __ac_iseither(h->flags, i) == 0) { /* kick out the existing element */ \
284
0
              { khkey_t tmp = h->keys[i]; h->keys[i] = key; key = tmp; } \
285
0
              if (kh_is_map) { khval_t tmp = h->vals[i]; h->vals[i] = val; val = tmp; } \
286
0
              __ac_set_isdel_true(h->flags, i); /* mark it as deleted in the old hash table */ \
287
0
            } else { /* write the element and jump out of the loop */ \
288
0
              h->keys[i] = key;             \
289
0
              if (kh_is_map) h->vals[i] = val;     \
290
0
              break;                    \
291
0
            }                       \
292
0
          }                         \
293
0
        }                           \
294
0
      }                              \
295
2
      if (h->n_buckets > new_n_buckets) { /* shrink the hash table */ \
296
0
        h->keys = (khkey_t*)krealloc((void *)h->keys, new_n_buckets * sizeof(khkey_t)); \
297
0
        if (kh_is_map) h->vals = (khval_t*)krealloc((void *)h->vals, new_n_buckets * sizeof(khval_t)); \
298
0
      }                              \
299
2
      kfree(h->flags); /* free the working space */        \
300
2
      h->flags = new_flags;                   \
301
2
      h->n_buckets = new_n_buckets;               \
302
2
      h->n_occupied = h->size;                  \
303
2
      h->upper_bound = (khint_t)(h->n_buckets * __ac_HASH_UPPER + 0.5); \
304
2
    }                               \
305
2
    return 0;                           \
306
2
  }                                  \
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_resize_signal_container
307
  SCOPE khint_t kh_put_##name(kh_##name##_t *h, khkey_t key, int *ret) \
308
22.8M
  {                                 \
309
22.8M
    khint_t x;                            \
310
22.8M
    if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
311
40
      if (h->n_buckets > (h->size<<1)) {             \
312
0
        if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
313
0
          *ret = -1; return h->n_buckets;           \
314
0
        }                            \
315
40
      } else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
316
0
        *ret = -1; return h->n_buckets;             \
317
0
      }                              \
318
40
    } /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
319
22.8M
    {                               \
320
22.8M
      khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
321
22.8M
      x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
322
22.8M
      if (__ac_isempty(h->flags, i)) 
x = i40
; /* for speed up */ \
323
22.8M
      else {                           \
324
22.8M
        last = i; \
325
34.2M
        while (!__ac_isempty(h->flags, i) && 
(34.2M
__ac_isdel34.2M
(h->flags, i) ||
!34.2M
__hash_equal34.2M
(h->keys[i], key))) { \
326
11.3M
          if (__ac_isdel(h->flags, i)) 
site = i0
; \
327
11.3M
          i = (i + (++step)) & mask; \
328
11.3M
          if (i == last) 
{ x = site; break; }0
\
329
11.3M
        }                            \
330
22.8M
        if (x == h->n_buckets) {               \
331
22.8M
          if (__ac_isempty(h->flags, i) && 
site != h->n_buckets6
)
x = site0
; \
332
22.8M
          else x = i;                     \
333
22.8M
        }                           \
334
22.8M
      }                              \
335
22.8M
    }                               \
336
22.8M
    if (__ac_isempty(h->flags, x)) { /* not present at all */    \
337
46
      h->keys[x] = key;                     \
338
46
      __ac_set_isboth_false(h->flags, x);              \
339
46
      ++h->size; ++h->n_occupied;                 \
340
46
      *ret = 1;                         \
341
22.8M
    } else if (__ac_isdel(h->flags, x)) { /* deleted */       \
342
0
      h->keys[x] = key;                     \
343
0
      __ac_set_isboth_false(h->flags, x);              \
344
0
      ++h->size;                          \
345
0
      *ret = 2;                         \
346
22.8M
    } else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
347
22.8M
    return x;                           \
348
22.8M
  }                                  \
Unexecuted instantiation: tape.tests.c:kh_put_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_put_signal_container
ccv_nnc_stream.c:kh_put_signal_container
Line
Count
Source
308
3.43k
  {                                 \
309
3.43k
    khint_t x;                            \
310
3.43k
    if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
311
8
      if (h->n_buckets > (h->size<<1)) {             \
312
0
        if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
313
0
          *ret = -1; return h->n_buckets;           \
314
0
        }                            \
315
8
      } else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
316
0
        *ret = -1; return h->n_buckets;             \
317
0
      }                              \
318
8
    } /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
319
3.43k
    {                               \
320
3.43k
      khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
321
3.43k
      x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
322
3.43k
      if (__ac_isempty(h->flags, i)) 
x = i8
; /* for speed up */ \
323
3.43k
      else {                           \
324
3.42k
        last = i; \
325
3.42k
        while (!__ac_isempty(h->flags, i) && (__ac_isdel(h->flags, i) || !__hash_equal(h->keys[i], key))) { \
326
0
          if (__ac_isdel(h->flags, i)) site = i;       \
327
0
          i = (i + (++step)) & mask; \
328
0
          if (i == last) { x = site; break; }          \
329
0
        }                            \
330
3.42k
        if (x == h->n_buckets) {               \
331
3.42k
          if (__ac_isempty(h->flags, i) && 
site != h->n_buckets0
)
x = site0
; \
332
3.42k
          else x = i;                     \
333
3.42k
        }                           \
334
3.42k
      }                              \
335
3.43k
    }                               \
336
3.43k
    if (__ac_isempty(h->flags, x)) { /* not present at all */    \
337
8
      h->keys[x] = key;                     \
338
8
      __ac_set_isboth_false(h->flags, x);              \
339
8
      ++h->size; ++h->n_occupied;                 \
340
8
      *ret = 1;                         \
341
3.42k
    } else if (__ac_isdel(h->flags, x)) { /* deleted */       \
342
0
      h->keys[x] = key;                     \
343
0
      __ac_set_isboth_false(h->flags, x);              \
344
0
      ++h->size;                          \
345
0
      *ret = 2;                         \
346
3.42k
    } else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
347
3.43k
    return x;                           \
348
3.43k
  }                                  \
Unexecuted instantiation: ccv_nnc_graph.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_put_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_put_signal_container
ccv_cnnp_dataframe.c:kh_put_ctx
Line
Count
Source
308
22.8M
  {                                 \
309
22.8M
    khint_t x;                            \
310
22.8M
    if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
311
30
      if (h->n_buckets > (h->size<<1)) {             \
312
0
        if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
313
0
          *ret = -1; return h->n_buckets;           \
314
0
        }                            \
315
30
      } else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
316
0
        *ret = -1; return h->n_buckets;             \
317
0
      }                              \
318
30
    } /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
319
22.8M
    {                               \
320
22.8M
      khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
321
22.8M
      x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
322
22.8M
      if (__ac_isempty(h->flags, i)) 
x = i30
; /* for speed up */ \
323
22.8M
      else {                           \
324
22.8M
        last = i; \
325
34.2M
        while (!__ac_isempty(h->flags, i) && 
(34.2M
__ac_isdel34.2M
(h->flags, i) ||
!34.2M
__hash_equal34.2M
(h->keys[i], key))) { \
326
11.3M
          if (__ac_isdel(h->flags, i)) 
site = i0
; \
327
11.3M
          i = (i + (++step)) & mask; \
328
11.3M
          if (i == last) 
{ x = site; break; }0
\
329
11.3M
        }                            \
330
22.8M
        if (x == h->n_buckets) {               \
331
22.8M
          if (__ac_isempty(h->flags, i) && 
site != h->n_buckets4
)
x = site0
; \
332
22.8M
          else x = i;                     \
333
22.8M
        }                           \
334
22.8M
      }                              \
335
22.8M
    }                               \
336
22.8M
    if (__ac_isempty(h->flags, x)) { /* not present at all */    \
337
34
      h->keys[x] = key;                     \
338
34
      __ac_set_isboth_false(h->flags, x);              \
339
34
      ++h->size; ++h->n_occupied;                 \
340
34
      *ret = 1;                         \
341
22.8M
    } else if (__ac_isdel(h->flags, x)) { /* deleted */       \
342
0
      h->keys[x] = key;                     \
343
0
      __ac_set_isboth_false(h->flags, x);              \
344
0
      ++h->size;                          \
345
0
      *ret = 2;                         \
346
22.8M
    } else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
347
22.8M
    return x;                           \
348
22.8M
  }                                  \
ccv_cnnp_dataframe.c:kh_put_iter_ctx
Line
Count
Source
308
20.5k
  {                                 \
309
20.5k
    khint_t x;                            \
310
20.5k
    if (h->n_occupied >= h->upper_bound) { /* update the hash table */ \
311
2
      if (h->n_buckets > (h->size<<1)) {             \
312
0
        if (kh_resize_##name(h, h->n_buckets - 1) < 0) { /* clear "deleted" elements */ \
313
0
          *ret = -1; return h->n_buckets;           \
314
0
        }                            \
315
2
      } else if (kh_resize_##name(h, h->n_buckets + 1) < 0) { /* expand the hash table */ \
316
0
        *ret = -1; return h->n_buckets;             \
317
0
      }                              \
318
2
    } /* TODO: to implement automatically shrinking; resize() already support shrinking */ \
319
20.5k
    {                               \
320
20.5k
      khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
321
20.5k
      x = site = h->n_buckets; k = __hash_func(key); i = k & mask; \
322
20.5k
      if (__ac_isempty(h->flags, i)) 
x = i2
; /* for speed up */ \
323
20.5k
      else {                           \
324
20.5k
        last = i; \
325
30.8k
        while (!__ac_isempty(h->flags, i) && 
(30.8k
__ac_isdel30.8k
(h->flags, i) ||
!30.8k
__hash_equal30.8k
(h->keys[i], key))) { \
326
10.2k
          if (__ac_isdel(h->flags, i)) 
site = i0
; \
327
10.2k
          i = (i + (++step)) & mask; \
328
10.2k
          if (i == last) 
{ x = site; break; }0
\
329
10.2k
        }                            \
330
20.5k
        if (x == h->n_buckets) {               \
331
20.5k
          if (__ac_isempty(h->flags, i) && 
site != h->n_buckets2
)
x = site0
; \
332
20.5k
          else x = i;                     \
333
20.5k
        }                           \
334
20.5k
      }                              \
335
20.5k
    }                               \
336
20.5k
    if (__ac_isempty(h->flags, x)) { /* not present at all */    \
337
4
      h->keys[x] = key;                     \
338
4
      __ac_set_isboth_false(h->flags, x);              \
339
4
      ++h->size; ++h->n_occupied;                 \
340
4
      *ret = 1;                         \
341
20.5k
    } else if (__ac_isdel(h->flags, x)) { /* deleted */       \
342
0
      h->keys[x] = key;                     \
343
0
      __ac_set_isboth_false(h->flags, x);              \
344
0
      ++h->size;                          \
345
0
      *ret = 2;                         \
346
20.5k
    } else *ret = 0; /* Don't touch h->keys[x] if present and not deleted */ \
347
20.5k
    return x;                           \
348
20.5k
  }                                  \
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_put_signal_container
349
  SCOPE void kh_del_##name(kh_##name##_t *h, khint_t x)       \
350
0
  {                                 \
351
0
    if (x != h->n_buckets && !__ac_iseither(h->flags, x)) {     \
352
0
      __ac_set_isdel_true(h->flags, x);             \
353
0
      --h->size;                          \
354
0
    }                               \
355
0
  }
Unexecuted instantiation: tape.tests.c:kh_del_signal_container
Unexecuted instantiation: while.backward.tests.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_cmd.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_tensor.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_stream.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_graph.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_graph_while.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_tensor_tape.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_graph_case_of.c:kh_del_signal_container
Unexecuted instantiation: ccv_nnc_graph_run.c:kh_del_signal_container
Unexecuted instantiation: ccv_cnnp_dataframe.c:kh_del_ctx
Unexecuted instantiation: ccv_cnnp_dataframe.c:kh_del_iter_ctx
Unexecuted instantiation: ccv_cnnp_model_io.c:kh_del_signal_container
356
357
#define KHASH_DECLARE(name, khkey_t, khval_t)             \
358
  __KHASH_TYPE(name, khkey_t, khval_t)                \
359
  __KHASH_PROTOTYPES(name, khkey_t, khval_t)
360
361
#define KHASH_INIT2(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
362
  __KHASH_TYPE(name, khkey_t, khval_t)                \
363
  __KHASH_IMPL(name, SCOPE, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
364
365
#define KHASH_INIT(name, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal) \
366
  KHASH_INIT2(name, static kh_inline klib_unused, khkey_t, khval_t, kh_is_map, __hash_func, __hash_equal)
367
368
/* --- BEGIN OF HASH FUNCTIONS --- */
369
370
/*! @function
371
  @abstract     Integer hash function
372
  @param  key   The integer [khint32_t]
373
  @return       The hash value [khint_t]
374
 */
375
#define kh_int_hash_func(key) (khint32_t)(key)
376
/*! @function
377
  @abstract     Integer comparison function
378
 */
379
#define kh_int_hash_equal(a, b) ((a) == (b))
380
/*! @function
381
  @abstract     64-bit integer hash function
382
  @param  key   The integer [khint64_t]
383
  @return       The hash value [khint_t]
384
 */
385
45.7M
#define kh_int64_hash_func(key) (khint32_t)((key)>>33^(key)^(key)<<11)
386
/*! @function
387
  @abstract     64-bit integer comparison function
388
 */
389
68.5M
#define kh_int64_hash_equal(a, b) ((a) == (b))
390
/*! @function
391
  @abstract     const char* hash function
392
  @param  s     Pointer to a null terminated string
393
  @return       The hash value
394
 */
395
static kh_inline khint_t __ac_X31_hash_string(const char *s)
396
0
{
397
0
  khint_t h = (khint_t)*s;
398
0
  if (h) for (++s ; *s; ++s) h = (h << 5) - h + (khint_t)*s;
399
0
  return h;
400
0
}
Unexecuted instantiation: tape.tests.c:__ac_X31_hash_string
Unexecuted instantiation: while.backward.tests.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_cmd.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_tensor.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_stream.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_graph.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_graph_while.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_tensor_tape.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_graph_case_of.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_nnc_graph_run.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_cnnp_dataframe.c:__ac_X31_hash_string
Unexecuted instantiation: ccv_cnnp_model_io.c:__ac_X31_hash_string
401
/*! @function
402
  @abstract     Another interface to const char* hash function
403
  @param  key   Pointer to a null terminated string [const char*]
404
  @return       The hash value [khint_t]
405
 */
406
#define kh_str_hash_func(key) __ac_X31_hash_string(key)
407
/*! @function
408
  @abstract     Const char* comparison function
409
 */
410
#define kh_str_hash_equal(a, b) (strcmp(a, b) == 0)
411
412
static kh_inline khint_t __ac_Wang_hash(khint_t key)
413
0
{
414
0
    key += ~(key << 15);
415
0
    key ^=  (key >> 10);
416
0
    key +=  (key << 3);
417
0
    key ^=  (key >> 6);
418
0
    key += ~(key << 11);
419
0
    key ^=  (key >> 16);
420
0
    return key;
421
0
}
Unexecuted instantiation: tape.tests.c:__ac_Wang_hash
Unexecuted instantiation: while.backward.tests.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_cmd.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_tensor.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_stream.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_graph.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_symbolic_graph_io.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_symbolic_graph_compile.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_graph_while.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_tensor_tape.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_graph_case_of.c:__ac_Wang_hash
Unexecuted instantiation: ccv_nnc_graph_run.c:__ac_Wang_hash
Unexecuted instantiation: ccv_cnnp_dataframe.c:__ac_Wang_hash
Unexecuted instantiation: ccv_cnnp_model_io.c:__ac_Wang_hash
422
#define kh_int_hash_func2(key) __ac_Wang_hash((khint_t)key)
423
424
/* --- END OF HASH FUNCTIONS --- */
425
426
/* Other convenient macros... */
427
428
/*!
429
  @abstract Type of the hash table.
430
  @param  name  Name of the hash table [symbol]
431
 */
432
45.7M
#define khash_t(name) kh_##name##_t
433
434
/*! @function
435
  @abstract     Initiate a hash table.
436
  @param  name  Name of the hash table [symbol]
437
  @return       Pointer to the hash table [khash_t(name)*]
438
 */
439
395
#define kh_init(name) kh_init_##name()
440
441
/*! @function
442
  @abstract     Destroy a hash table.
443
  @param  name  Name of the hash table [symbol]
444
  @param  h     Pointer to the hash table [khash_t(name)*]
445
 */
446
395
#define kh_destroy(name, h) kh_destroy_
##name(h)30
447
448
/*! @function
449
  @abstract     Reset a hash table without deallocating memory.
450
  @param  name  Name of the hash table [symbol]
451
  @param  h     Pointer to the hash table [khash_t(name)*]
452
 */
453
#define kh_clear(name, h) kh_clear_##name(h)
454
455
/*! @function
456
  @abstract     Resize a hash table.
457
  @param  name  Name of the hash table [symbol]
458
  @param  h     Pointer to the hash table [khash_t(name)*]
459
  @param  s     New size [khint_t]
460
 */
461
#define kh_resize(name, h, s) kh_resize_##name(h, s)
462
463
/*! @function
464
  @abstract     Insert a key to the hash table.
465
  @param  name  Name of the hash table [symbol]
466
  @param  h     Pointer to the hash table [khash_t(name)*]
467
  @param  k     Key [type of keys]
468
  @param  r     Extra return code: -1 if the operation failed;
469
                0 if the key is present in the hash table;
470
                1 if the bucket is empty (never used); 2 if the element in
471
        the bucket has been deleted [int*]
472
  @return       Iterator to the inserted element [khint_t]
473
 */
474
22.8M
#define kh_put(name, h, k, r) kh_put_##name(h, k, r)
475
476
/*! @function
477
  @abstract     Retrieve a key from the hash table.
478
  @param  name  Name of the hash table [symbol]
479
  @param  h     Pointer to the hash table [khash_t(name)*]
480
  @param  k     Key [type of keys]
481
  @return       Iterator to the found element, or kh_end(h) if the element is absent [khint_t]
482
 */
483
22.8M
#define kh_get(name, h, k) kh_get_##name(h, k)
484
485
/*! @function
486
  @abstract     Remove a key from the hash table.
487
  @param  name  Name of the hash table [symbol]
488
  @param  h     Pointer to the hash table [khash_t(name)*]
489
  @param  k     Iterator to the element to be deleted [khint_t]
490
 */
491
#define kh_del(name, h, k) kh_del_##name(h, k)
492
493
/*! @function
494
  @abstract     Test whether a bucket contains data.
495
  @param  h     Pointer to the hash table [khash_t(name)*]
496
  @param  x     Iterator to the bucket [khint_t]
497
  @return       1 if containing data; 0 otherwise [int]
498
 */
499
160
#define kh_exist(h, x) (!__ac_iseither((h)->flags, (x)))
500
501
/*! @function
502
  @abstract     Get key given an iterator
503
  @param  h     Pointer to the hash table [khash_t(name)*]
504
  @param  x     Iterator to the bucket [khint_t]
505
  @return       Key [type of keys]
506
 */
507
#define kh_key(h, x) ((h)->keys[x])
508
509
/*! @function
510
  @abstract     Get value given an iterator
511
  @param  h     Pointer to the hash table [khash_t(name)*]
512
  @param  x     Iterator to the bucket [khint_t]
513
  @return       Value [type of values]
514
  @discussion   For hash sets, calling this results in segfault.
515
 */
516
45.7M
#define kh_val(h, x) ((h)->vals[x])
517
518
/*! @function
519
  @abstract     Alias of kh_val()
520
 */
521
#define kh_value(h, x) ((h)->vals[x])
522
523
/*! @function
524
  @abstract     Get the start iterator
525
  @param  h     Pointer to the hash table [khash_t(name)*]
526
  @return       The start iterator [khint_t]
527
 */
528
395
#define kh_begin(h) (khint_t)(0)
529
530
/*! @function
531
  @abstract     Get the end iterator
532
  @param  h     Pointer to the hash table [khash_t(name)*]
533
  @return       The end iterator [khint_t]
534
 */
535
22.8M
#define kh_end(h) ((h)->n_buckets)
536
537
/*! @function
538
  @abstract     Get the number of elements in the hash table
539
  @param  h     Pointer to the hash table [khash_t(name)*]
540
  @return       Number of elements in the hash table [khint_t]
541
 */
542
#define kh_size(h) ((h)->size)
543
544
/*! @function
545
  @abstract     Get the number of buckets in the hash table
546
  @param  h     Pointer to the hash table [khash_t(name)*]
547
  @return       Number of buckets in the hash table [khint_t]
548
 */
549
#define kh_n_buckets(h) ((h)->n_buckets)
550
551
/*! @function
552
  @abstract     Iterate over the entries in the hash table
553
  @param  h     Pointer to the hash table [khash_t(name)*]
554
  @param  kvar  Variable to which key will be assigned
555
  @param  vvar  Variable to which value will be assigned
556
  @param  code  Block of code to execute
557
 */
558
#define kh_foreach(h, kvar, vvar, code) { khint_t __i;    \
559
  for (__i = kh_begin(h); __i != kh_end(h); ++__i) {    \
560
    if (!kh_exist(h,__i)) continue;           \
561
    (kvar) = kh_key(h,__i);               \
562
    (vvar) = kh_val(h,__i);               \
563
    code;                       \
564
  } }
565
566
/*! @function
567
  @abstract     Iterate over the values in the hash table
568
  @param  h     Pointer to the hash table [khash_t(name)*]
569
  @param  vvar  Variable to which value will be assigned
570
  @param  code  Block of code to execute
571
 */
572
#define kh_foreach_value(h, vvar, code) { khint_t __i;    \
573
  for (__i = kh_begin(h); __i != kh_end(h); ++__i) {    \
574
    if (!kh_exist(h,__i)) continue;           \
575
    (vvar) = kh_val(h,__i);               \
576
    code;                       \
577
  } }
578
579
/* More convenient interfaces */
580
581
/*! @function
582
  @abstract     Instantiate a hash set containing integer keys
583
  @param  name  Name of the hash table [symbol]
584
 */
585
#define KHASH_SET_INIT_INT(name)                    \
586
  KHASH_INIT(name, khint32_t, char, 0, kh_int_hash_func, kh_int_hash_equal)
587
588
/*! @function
589
  @abstract     Instantiate a hash map containing integer keys
590
  @param  name  Name of the hash table [symbol]
591
  @param  khval_t  Type of values [type]
592
 */
593
#define KHASH_MAP_INIT_INT(name, khval_t)               \
594
  KHASH_INIT(name, khint32_t, khval_t, 1, kh_int_hash_func, kh_int_hash_equal)
595
596
/*! @function
597
  @abstract     Instantiate a hash set containing 64-bit integer keys
598
  @param  name  Name of the hash table [symbol]
599
 */
600
#define KHASH_SET_INIT_INT64(name)                    \
601
  KHASH_INIT(name, khint64_t, char, 0, kh_int64_hash_func, kh_int64_hash_equal)
602
603
/*! @function
604
  @abstract     Instantiate a hash map containing 64-bit integer keys
605
  @param  name  Name of the hash table [symbol]
606
  @param  khval_t  Type of values [type]
607
 */
608
#define KHASH_MAP_INIT_INT64(name, khval_t)               \
609
68.5M
  KHASH_INIT(name, khint64_t, khval_t, 1, 
kh_int64_hash_func45.7M
, kh_int64_hash_equal)
610
611
typedef const char *kh_cstr_t;
612
/*! @function
613
  @abstract     Instantiate a hash map containing const char* keys
614
  @param  name  Name of the hash table [symbol]
615
 */
616
#define KHASH_SET_INIT_STR(name)                    \
617
  KHASH_INIT(name, kh_cstr_t, char, 0, kh_str_hash_func, kh_str_hash_equal)
618
619
/*! @function
620
  @abstract     Instantiate a hash map containing const char* keys
621
  @param  name  Name of the hash table [symbol]
622
  @param  khval_t  Type of values [type]
623
 */
624
#define KHASH_MAP_INIT_STR(name, khval_t)               \
625
  KHASH_INIT(name, kh_cstr_t, khval_t, 1, kh_str_hash_func, kh_str_hash_equal)
626
627
#endif /* __AC_KHASH_H */