| /dports/databases/libpbl/pbl_1_04_04/src/ |
| H A D | ISAM0006.TST | 69 # keylen 0, key
75 # keylen 5, key key00
87 # keylen 0, key
96 # keylen 0, key
105 # keylen 0, key
123 # keylen 0, key
330 # keylen 0, key
348 # keylen 0, key
357 # keylen 0, key
366 # keylen 0, key
[all …]
|
| H A D | ISAM0004.TST | 121 # keylen 5, key dup10
124 # keylen 5, key key00
130 # keylen 5, key key00
133 # keylen 5, key dup10
136 # keylen 5, key key00
139 # keylen 5, key dup10
142 # keylen 5, key key00
148 # keylen 5, key key00
160 # keylen 5, key dup12
163 # keylen 5, key key02
[all …]
|
| H A D | ISAM0005.TST | 69 # keylen 0, key
75 # keylen 5, key key00
84 # keylen 5, key key00
87 # keylen 0, key
93 # keylen 5, key key01
96 # keylen 0, key
102 # keylen 5, key key01
105 # keylen 0, key
123 # keylen 0, key
132 # keylen 5, key key00
[all …]
|
| /dports/graphics/sam2p/sam2p-0.49.4/ |
| H A D | mapping.cpp | 50 memcpy(p->keydata+=datalen, key, p->keylen=keylen); len++; in set()
57 if (p->keylen==keylen && 0==memcmp(p->keydata, key, keylen)) { updated: in set()
68 if (p->keylen==keylen && 0==memcmp(p->keydata, key, keylen)) goto updated; in set()
77 if (p->keylen==keylen && 0==memcmp(p->keydata, key, keylen)) return p->keydata-datalen; in get()
86 if (p->keylen==keylen && 0==memcmp(p->keydata, key, keylen)) return p->keydata-datalen; in get()
99 if (p->keylen==keylen && 0==memcmp(p->keydata, key, keylen)) { found: in deletee()
115 if (p->keylen==keylen && 0==memcmp(p->keydata, key, keylen)) goto found; in deletee()
123 else { key=&p->keydata; data=p->keydata-datalen; keylen=p->keylen; } in getFirst()
167 p->keylen=pp->keylen; in rehash()
171 …assert(!(p->keylen==pp->keylen && 0==memcmp(p->keydata, pp->keydata, pp->keylen)) && "dupicate key… in rehash()
[all …]
|
| /dports/lang/perl5.34/perl-5.34.0/ |
| H A D | feature.h | 239 keypv = SvPV_const(keysv, keylen); in S_magic_sethint_feature()
241 if (memBEGINs(keypv, keylen, "feature_")) { in S_magic_sethint_feature()
246 if (keylen == sizeof("feature___SUB__")-1 in S_magic_sethint_feature()
267 if (keylen == sizeof("feature_evalbytes")-1 in S_magic_sethint_feature()
275 if (keylen == sizeof("feature_fc")-1 in S_magic_sethint_feature()
283 if (keylen == sizeof("feature_indirect")-1 in S_magic_sethint_feature()
288 else if (keylen == sizeof("feature_isa")-1 in S_magic_sethint_feature()
301 else if (keylen == sizeof("feature_myref")-1 in S_magic_sethint_feature()
325 if (keylen == sizeof("feature_say")-1 in S_magic_sethint_feature()
348 if (keylen == sizeof("feature_try")-1 in S_magic_sethint_feature()
[all …]
|
| /dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/ |
| H A D | feature.h | 251 keypv = SvPV_const(keysv, keylen); in S_magic_sethint_feature()
253 if (memBEGINs(keypv, keylen, "feature_")) { in S_magic_sethint_feature()
258 if (keylen == sizeof("feature___SUB__")-1 in S_magic_sethint_feature()
279 if (keylen == sizeof("feature_defer")-1 in S_magic_sethint_feature()
287 if (keylen == sizeof("feature_evalbytes")-1 in S_magic_sethint_feature()
295 if (keylen == sizeof("feature_fc")-1 in S_magic_sethint_feature()
303 if (keylen == sizeof("feature_indirect")-1 in S_magic_sethint_feature()
308 else if (keylen == sizeof("feature_isa")-1 in S_magic_sethint_feature()
345 if (keylen == sizeof("feature_say")-1 in S_magic_sethint_feature()
368 if (keylen == sizeof("feature_try")-1 in S_magic_sethint_feature()
[all …]
|
| /dports/lang/perl5.32/perl-5.32.1/ |
| H A D | feature.h | 216 keypv = SvPV_const(keysv, keylen); in S_magic_sethint_feature()
218 if (memBEGINs(keypv, keylen, "feature_")) { in S_magic_sethint_feature()
223 if (keylen == sizeof("feature___SUB__")-1 in S_magic_sethint_feature()
231 if (keylen == sizeof("feature_bitwise")-1 in S_magic_sethint_feature()
239 if (keylen == sizeof("feature_evalbytes")-1 in S_magic_sethint_feature()
247 if (keylen == sizeof("feature_fc")-1 in S_magic_sethint_feature()
255 if (keylen == sizeof("feature_indirect")-1 in S_magic_sethint_feature()
260 else if (keylen == sizeof("feature_isa")-1 in S_magic_sethint_feature()
268 if (keylen == sizeof("feature_myref")-1 in S_magic_sethint_feature()
292 if (keylen == sizeof("feature_say")-1 in S_magic_sethint_feature()
[all …]
|
| /dports/print/tex-dvipdfmx/texlive-20150521-source/texk/dvipdfm-x/ |
| H A D | pdfnames.c | 112 int keylen; in check_objects_defined() local
148 if (!key || keylen < 1) { in pdf_names_add_object()
206 const void *key, int keylen) in pdf_names_lookup_object() argument
222 const void *key, int keylen) in pdf_names_close_object() argument
248 int keylen; member
256 int keylen, cmp; in cmp_key() local
266 keylen = MIN(sd1->keylen, sd2->keylen); in cmp_key()
269 cmp = sd1->keylen - sd2->keylen; in cmp_key()
368 int keylen; in flat_table() local
389 objects[count].keylen = keylen; in flat_table()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/libtextstyle/lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/gnulib-local/lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/gnulib-local/lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/libtextstyle/lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/gettext-tools/libgettextpo/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-tools/gettext-0.21/gettext-tools/gnulib-lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/chinese/enscript/enscript-1.6.6/afmlib/ |
| H A D | strhash.c | 38 int keylen; member
130 pos = count_hash (key, keylen); in strhash_put()
134 if (list->keylen == keylen) in strhash_put()
151 else if (list->keylen > keylen) in strhash_put()
168 list->keylen = keylen; in strhash_put()
199 pos = count_hash (key, keylen); in strhash_get()
201 if (list->keylen == keylen) in strhash_get()
213 else if (list->keylen > keylen) in strhash_get()
233 if (list->keylen == keylen) in strhash_delete()
261 else if (list->keylen > keylen) in strhash_delete()
[all …]
|
| /dports/print/enscript-letter/enscript-1.6.6/afmlib/ |
| H A D | strhash.c | 38 int keylen; member
130 pos = count_hash (key, keylen); in strhash_put()
134 if (list->keylen == keylen) in strhash_put()
151 else if (list->keylen > keylen) in strhash_put()
168 list->keylen = keylen; in strhash_put()
199 pos = count_hash (key, keylen); in strhash_get()
201 if (list->keylen == keylen) in strhash_get()
213 else if (list->keylen > keylen) in strhash_get()
233 if (list->keylen == keylen) in strhash_delete()
261 else if (list->keylen > keylen) in strhash_delete()
[all …]
|
| /dports/print/enscript-letterdj/enscript-1.6.6/afmlib/ |
| H A D | strhash.c | 38 int keylen; member
130 pos = count_hash (key, keylen); in strhash_put()
134 if (list->keylen == keylen) in strhash_put()
151 else if (list->keylen > keylen) in strhash_put()
168 list->keylen = keylen; in strhash_put()
199 pos = count_hash (key, keylen); in strhash_get()
201 if (list->keylen == keylen) in strhash_get()
213 else if (list->keylen > keylen) in strhash_get()
233 if (list->keylen == keylen) in strhash_delete()
261 else if (list->keylen > keylen) in strhash_delete()
[all …]
|
| /dports/print/enscript-a4/enscript-1.6.6/afmlib/ |
| H A D | strhash.c | 38 int keylen; member
130 pos = count_hash (key, keylen); in strhash_put()
134 if (list->keylen == keylen) in strhash_put()
151 else if (list->keylen > keylen) in strhash_put()
168 list->keylen = keylen; in strhash_put()
199 pos = count_hash (key, keylen); in strhash_get()
201 if (list->keylen == keylen) in strhash_get()
213 else if (list->keylen > keylen) in strhash_get()
233 if (list->keylen == keylen) in strhash_delete()
261 else if (list->keylen > keylen) in strhash_delete()
[all …]
|
| /dports/devel/gettext-po-mode/gettext-0.21/libtextstyle/lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-po-mode/gettext-0.21/gnulib-local/lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-po-mode/gettext-0.21/gettext-tools/gnulib-lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/gettext-tools/gnulib-lib/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-runtime/gettext-0.21/gettext-tools/libgettextpo/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/gettext-po-mode/gettext-0.21/gettext-tools/libgettextpo/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|
| /dports/devel/libtextstyle/gettext-0.21/gettext-tools/libgettextpo/ |
| H A D | mem-hash-map.c | 45 size_t keylen; member
120 compute_hashval (const void *key, size_t keylen) in compute_hashval() argument
129 hval = keylen; in compute_hashval()
130 while (cnt < keylen) in compute_hashval()
148 const void *key, size_t keylen, in lookup() argument
162 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
177 if (table[idx].used == hval && table[idx].keylen == keylen in lookup()
194 size_t idx = lookup (htab, key, keylen, compute_hashval (key, keylen)); in hash_find_entry()
216 table[idx].keylen = keylen; in insert_entry_2()
346 *keylen = curr->keylen; in hash_iterate()
[all …]
|