key 169 gtags-parser/asm_res.h register int key = asm_hash (str, len); key 171 gtags-parser/asm_res.h if (key <= MAX_HASH_VALUE && key >= 0) key 173 gtags-parser/asm_res.h register const char *s = wordlist[key].name; key 176 gtags-parser/asm_res.h return &wordlist[key]; key 450 gtags-parser/c_res.h register int key = c_hash (str, len); key 452 gtags-parser/c_res.h if (key <= MAX_HASH_VALUE && key >= 0) key 454 gtags-parser/c_res.h register const char *s = wordlist[key].name; key 457 gtags-parser/c_res.h return &wordlist[key]; key 353 gtags-parser/cpp_res.h register int key = cpp_hash (str, len); key 355 gtags-parser/cpp_res.h if (key <= MAX_HASH_VALUE && key >= 0) key 357 gtags-parser/cpp_res.h register const char *s = wordlist[key].name; key 360 gtags-parser/cpp_res.h return &wordlist[key]; key 232 gtags-parser/java_res.h register int key = java_hash (str, len); key 234 gtags-parser/java_res.h if (key <= MAX_HASH_VALUE && key >= 0) key 236 gtags-parser/java_res.h register const char *s = wordlist[key].name; key 239 gtags-parser/java_res.h return &wordlist[key]; key 528 gtags-parser/php_res.h register int key = php_hash (str, len); key 530 gtags-parser/php_res.h if (key <= MAX_HASH_VALUE && key >= 0) key 532 gtags-parser/php_res.h register const char *s = wordlist[key].name; key 535 gtags-parser/php_res.h return &wordlist[key]; key 449 htags/common.c * i) target target='xxx' key 470 htags/common.c strbuf_putc(sb, '.'); key 476 htags/common.c /* key 478 htags/common.c * XHTML 1.1 profibits number as an anchor. key 500 htags/common.c /* key 502 htags/common.c */ key 508 htags/common.c /* key 510 htags/common.c */ key 230 htags/src2html.c if (i == A_INDEX) { key 233 htags/src2html.c strbuf_puts(sb, gen_href_begin("..", "help", normal_suffix, NULL)); key 235 htags/src2html.c char tmp[32], *key = tmp; key 238 htags/src2html.c key = "TOP"; key 770 htags/src2html.c /* key 781 htags/src2html.c */ key 797 htags/src2html.c snprintf(s_id, sizeof(s_id), "%d", incref->id); key 800 htags/src2html.c suffix = HTML; key 99 libdb/bt_close.c if (t->bt_cursor.key.data != NULL) { key 100 libdb/bt_close.c free(t->bt_cursor.key.data); key 101 libdb/bt_close.c t->bt_cursor.key.size = 0; key 102 libdb/bt_close.c t->bt_cursor.key.data = NULL; key 66 libdb/bt_delete.c __bt_delete(dbp, key, flags) key 68 libdb/bt_delete.c const DBT *key; key 92 libdb/bt_delete.c status = __bt_bdelete(t, key); key 167 libdb/bt_delete.c if ((e = __bt_search(t, &c->key, &exact)) == NULL) key 226 libdb/bt_delete.c if ((e = __bt_search(t, &c->key, &exact)) == NULL) key 294 libdb/bt_delete.c __bt_bdelete(t, key) key 296 libdb/bt_delete.c const DBT *key; key 305 libdb/bt_delete.c loop: if ((e = __bt_search(t, key, &exact)) == NULL) key 320 libdb/bt_delete.c if (__bt_dleaf(t, key, h, e->index)) { key 333 libdb/bt_delete.c } while (e->index < NEXTINDEX(h) && __bt_cmp(t, key, e) == 0); key 341 libdb/bt_delete.c if (__bt_cmp(t, key, e) != 0) key 343 libdb/bt_delete.c if (__bt_dleaf(t, key, h, e->index) == RET_ERROR) { key 477 libdb/bt_delete.c __bt_dleaf(t, key, h, index) key 479 libdb/bt_delete.c const DBT *key; key 493 libdb/bt_delete.c __bt_curdel(t, key, h, index)) key 542 libdb/bt_delete.c __bt_curdel(t, key, h, index) key 544 libdb/bt_delete.c const DBT *key; key 567 libdb/bt_delete.c if (key == NULL) { key 571 libdb/bt_delete.c &c->key, &c->key, NULL, NULL, 1)) != RET_SUCCESS) key 574 libdb/bt_delete.c key = &c->key; key 580 libdb/bt_delete.c if (__bt_cmp(t, key, &e) == 0) { key 589 libdb/bt_delete.c if (__bt_cmp(t, key, &e) == 0) { key 600 libdb/bt_delete.c if (__bt_cmp(t, key, &e) == 0) { key 612 libdb/bt_delete.c if (__bt_cmp(t, key, &e) == 0) { key 625 libdb/bt_delete.c __bt_ret(t, &e, &c->key, &c->key, NULL, NULL, 1)) == RET_SUCCESS) { key 62 libdb/bt_get.c __bt_get(dbp, key, data, flags) key 64 libdb/bt_get.c const DBT *key; key 86 libdb/bt_get.c if ((e = __bt_search(t, key, &exact)) == NULL) key 72 libdb/bt_put.c __bt_put(dbp, key, data, flags) key 74 libdb/bt_put.c DBT *key; key 130 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) { key 131 libdb/bt_put.c if (key->size > t->bt_ovflsize) { key 132 libdb/bt_put.c storekey: if (__ovfl_put(t, key, &pg) == RET_ERROR) key 138 libdb/bt_put.c &key->size, sizeof(u_int32_t)); key 140 libdb/bt_put.c key = &tkey; key 142 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) { key 153 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) key 169 libdb/bt_put.c if (t->bt_order == NOT || (e = bt_fast(t, key, data, &exact)) == NULL) key 170 libdb/bt_put.c if ((e = __bt_search(t, key, &exact)) == NULL) key 195 libdb/bt_put.c delete: if (__bt_dleaf(t, key, h, index) == RET_ERROR) { key 208 libdb/bt_put.c nbytes = NBLEAFDBT(key->size, data->size); key 210 libdb/bt_put.c if ((status = __bt_split(t, h, key, key 223 libdb/bt_put.c WR_BLEAF(dest, key, data, dflags); key 269 libdb/bt_put.c bt_fast(t, key, data, exactp) key 271 libdb/bt_put.c const DBT *key, *data; key 289 libdb/bt_put.c nbytes = NBLEAFDBT(key->size, data->size); key 298 libdb/bt_put.c if ((cmp = __bt_cmp(t, key, &t->bt_cur)) < 0) key 306 libdb/bt_put.c if ((cmp = __bt_cmp(t, key, &t->bt_cur)) > 0) key 65 libdb/bt_search.c __bt_search(t, key, exactp) key 67 libdb/bt_search.c const DBT *key; key 84 libdb/bt_search.c if ((cmp = __bt_cmp(t, key, &t->bt_cur)) == 0) { key 109 libdb/bt_search.c __bt_sprev(t, h, key, exactp)) key 113 libdb/bt_search.c __bt_snext(t, h, key, exactp)) key 150 libdb/bt_search.c __bt_snext(t, h, key, exactp) key 153 libdb/bt_search.c const DBT *key; key 165 libdb/bt_search.c if (__bt_cmp(t, key, &e) == 0) { key 189 libdb/bt_search.c __bt_sprev(t, h, key, exactp) key 192 libdb/bt_search.c const DBT *key; key 204 libdb/bt_search.c if (__bt_cmp(t, key, &e) == 0) { key 78 libdb/bt_seq.c __bt_seq(dbp, key, data, flags) key 80 libdb/bt_seq.c DBT *key, *data; key 111 libdb/bt_seq.c status = __bt_seqset(t, &e, key, flags); key 122 libdb/bt_seq.c __bt_ret(t, &e, key, &t->bt_rkey, data, &t->bt_rdata, 0); key 153 libdb/bt_seq.c __bt_seqset(t, ep, key, flags) key 156 libdb/bt_seq.c DBT *key; key 174 libdb/bt_seq.c if (key->data == NULL || key->size == 0) { key 178 libdb/bt_seq.c return (__bt_first(t, key, ep, &exact)); key 267 libdb/bt_seq.c return (__bt_first(t, &c->key, ep, &exact)); key 343 libdb/bt_seq.c __bt_first(t, key, erval, exactp) key 345 libdb/bt_seq.c const DBT *key; key 361 libdb/bt_seq.c if ((ep = __bt_search(t, key, exactp)) == NULL) key 404 libdb/bt_seq.c } while (__bt_cmp(t, key, ep) == 0); key 450 libdb/bt_seq.c if (t->bt_cursor.key.data != NULL) { key 451 libdb/bt_seq.c free(t->bt_cursor.key.data); key 452 libdb/bt_seq.c t->bt_cursor.key.size = 0; key 453 libdb/bt_seq.c t->bt_cursor.key.data = NULL; key 83 libdb/bt_split.c __bt_split(t, sp, key, data, flags, ilen, argskip) key 86 libdb/bt_split.c const DBT *key, *data; key 124 libdb/bt_split.c WR_BLEAF(dest, key, data, flags) key 70 libdb/bt_utils.c __bt_ret(t, e, key, rkey, data, rdata, copy) key 73 libdb/bt_utils.c DBT *key, *rkey, *data, *rdata; key 86 libdb/bt_utils.c if (key == NULL) key 91 libdb/bt_utils.c &key->size, &rkey->data, &rkey->size)) key 93 libdb/bt_utils.c key->data = rkey->data; key 104 libdb/bt_utils.c key->size = bl->ksize; key 105 libdb/bt_utils.c key->data = rkey->data; key 107 libdb/bt_utils.c key->size = bl->ksize; key 108 libdb/bt_utils.c key->data = bl->bytes; key 188 libdb/btree.h #define WR_BLEAF(p, key, data, flags) { \ key 189 libdb/btree.h *(u_int32_t *)p = key->size; \ key 195 libdb/btree.h memmove(p, key->data, key->size); \ key 196 libdb/btree.h p += key->size; \ key 273 libdb/btree.h DBT key; /* B: Saved key, or key.data == NULL. */ key 72 libdb/mpool.c mpool_open(key, fd, pagesize, maxcache) key 73 libdb/mpool.c void *key; key 137 libutil/dbop.c DBT key, dat; key 140 libutil/dbop.c key.data = (char *)name; key 141 libutil/dbop.c key.size = strlen(name)+1; key 143 libutil/dbop.c status = (*db->get)(db, &key, &dat, 0); key 167 libutil/dbop.c DBT key, dat; key 175 libutil/dbop.c key.data = (char *)name; key 176 libutil/dbop.c key.size = strlen(name)+1; key 180 libutil/dbop.c status = (*db->put)(db, &key, &dat, 0); key 201 libutil/dbop.c DBT key, dat; key 209 libutil/dbop.c key.data = (char *)name; key 210 libutil/dbop.c key.size = strlen(name)+1; key 214 libutil/dbop.c status = (*db->put)(db, &key, &dat, 0); key 233 libutil/dbop.c DBT key; key 237 libutil/dbop.c key.data = (char *)path; key 238 libutil/dbop.c key.size = strlen(path)+1; key 239 libutil/dbop.c status = (*db->del)(db, &key, 0); key 241 libutil/dbop.c status = (*db->del)(db, &key, R_CURSOR); key 253 libutil/dbop.c dbop_update(DBOP *dbop, const char *key, const char *dat) key 255 libutil/dbop.c dbop_put(dbop, key, dat); key 275 libutil/dbop.c DBT key, dat; key 284 libutil/dbop.c strlimcpy(dbop->key, name, sizeof(dbop->key)); key 285 libutil/dbop.c key.data = (char *)name; key 286 libutil/dbop.c key.size = strlen(name); key 291 libutil/dbop.c key.size++; key 292 libutil/dbop.c dbop->keylen = key.size; key 293 libutil/dbop.c for (status = (*db->seq)(db, &key, &dat, R_CURSOR); key 295 libutil/dbop.c status = (*db->seq)(db, &key, &dat, R_NEXT)) { key 297 libutil/dbop.c if (strncmp((char *)key.data, dbop->key, dbop->keylen)) key 300 libutil/dbop.c if (strcmp((char *)key.data, dbop->key)) key 303 libutil/dbop.c if (preg && regexec(preg, (char *)key.data, 0, 0, 0) != 0) key 308 libutil/dbop.c dbop->keylen = dbop->key[0] = 0; key 309 libutil/dbop.c for (status = (*db->seq)(db, &key, &dat, R_FIRST); key 311 libutil/dbop.c status = (*db->seq)(db, &key, &dat, R_NEXT)) { key 313 libutil/dbop.c if (ismeta(key.data)) key 315 libutil/dbop.c if (preg && regexec(preg, (char *)key.data, 0, 0, 0) != 0) key 322 libutil/dbop.c dbop->lastkey = (char *)key.data; key 323 libutil/dbop.c dbop->lastkeysize = key.size; key 334 libutil/dbop.c strlimcpy(dbop->prev, (char *)key.data, sizeof(dbop->prev)); key 335 libutil/dbop.c return (char *)key.data; key 352 libutil/dbop.c DBT key, dat; key 359 libutil/dbop.c while ((status = (*db->seq)(db, &key, &dat, R_NEXT)) == RET_SUCCESS) { key 362 libutil/dbop.c if (flags & DBOP_KEY && ismeta(key.data)) key 367 libutil/dbop.c if (!strcmp(dbop->prev, (char *)key.data)) key 369 libutil/dbop.c if (strlen((char *)key.data) > MAXKEYLEN) key 371 libutil/dbop.c strlimcpy(dbop->prev, (char *)key.data, sizeof(dbop->prev)); key 375 libutil/dbop.c dbop->lastkey = (char *)key.data; key 376 libutil/dbop.c dbop->lastkeysize = key.size; key 378 libutil/dbop.c if (strncmp((char *)key.data, dbop->key, dbop->keylen)) key 381 libutil/dbop.c if (strcmp((char *)key.data, dbop->key)) key 384 libutil/dbop.c if (dbop->preg && regexec(dbop->preg, (char *)key.data, 0, 0, 0) != 0) key 386 libutil/dbop.c return (flags & DBOP_KEY) ? (char *)key.data : (char *)dat.data; key 442 libutil/dbop.c dbop_getoption(DBOP *dbop, const char *key) key 447 libutil/dbop.c if ((p = dbop_get(dbop, key)) == NULL) key 449 libutil/dbop.c if (dbop->lastsize <= strlen(key)) key 451 libutil/dbop.c for (p += strlen(key); *p && isspace((unsigned char)*p); p++) key 460 libutil/dbop.c dbop_putoption(DBOP *dbop, const char *key, const char *string) key 465 libutil/dbop.c snprintf(buf, sizeof(buf), "%s %s", key, string); key 467 libutil/dbop.c snprintf(buf, sizeof(buf), "%s", key); key 468 libutil/dbop.c dbop_put(dbop, key, buf); key 54 libutil/dbop.h char key[MAXKEYLEN+1]; /* key */ key 383 libutil/gtagsop.c gtags_put(GTOP *gtop, const char *key, const char *ctags_x) /* virtually const */ key 419 libutil/gtagsop.c entry = strhash_assign(gtop->path_hash, key, 1); key 433 libutil/gtagsop.c strbuf_puts(gtop->sb, compress(ptable.part[PART_TAG].start, key)); key 440 libutil/gtagsop.c compress(ptable.part[PART_LINE].start, key) : key 442 libutil/gtagsop.c dbop_put(gtop->dbop, key, strbuf_value(gtop->sb)); key 494 libutil/gtagsop.c const char *key = NULL; key 523 libutil/gtagsop.c key = pattern; key 530 libutil/gtagsop.c key = NULL; key 545 libutil/gtagsop.c key = prefix; key 548 libutil/gtagsop.c key = NULL; key 551 libutil/gtagsop.c key = pattern; key 574 libutil/gtagsop.c for (tagline = dbop_first(gtop->dbop, key, preg, dbflags); key 617 libutil/gtagsop.c return ((gtop->gtp.tag = dbop_first(gtop->dbop, key, preg, dbflags)) == NULL) key 632 libutil/gtagsop.c tagline = dbop_first(gtop->dbop, key, preg, dbflags); key 730 libutil/gtagsop.c const char *key = entry->name; key 741 libutil/gtagsop.c if ((key = locatestring(entry->name, ".", MATCH_LAST)) != NULL) key 742 libutil/gtagsop.c key++; key 743 libutil/gtagsop.c else if ((key = locatestring(entry->name, "::", MATCH_LAST)) != NULL) key 744 libutil/gtagsop.c key += 2; key 746 libutil/gtagsop.c key = entry->name; key 755 libutil/gtagsop.c strbuf_puts(gtop->sb, compress(entry->name, key)); key 801 libutil/gtagsop.c dbop_put(gtop->dbop, key, strbuf_value(gtop->sb)); key 825 libutil/gtagsop.c dbop_put(gtop->dbop, key, strbuf_value(gtop->sb)); key 832 libutil/gtagsop.c dbop_put(gtop->dbop, key, strbuf_value(gtop->sb));