data 845 htags/asm.c struct data *inc; data 890 htags/c.c if (c == sep) { data 845 htags/cpp.c struct data *inc; data 744 htags/fileindex.c struct data *inc; data 71 htags/incop.c struct data *data; data 74 htags/incop.c data = entry->value; data 75 htags/incop.c if (data == NULL) { data 76 htags/incop.c data = (struct data *)check_malloc(sizeof(struct data)); data 78 htags/incop.c strlimcpy(data->name, file, sizeof(data->name)); data 80 htags/incop.c data->name = entry->name; data 82 htags/incop.c data->id = id; data 83 htags/incop.c data->contents = strbuf_open(0); data 84 htags/incop.c data->ref_contents = NULL; data 85 htags/incop.c data->count = 0; data 86 htags/incop.c data->ref_count = 0; data 87 htags/incop.c entry->value = data; data 89 htags/incop.c strbuf_puts0(data->contents, path); data 90 htags/incop.c data->count++; data 98 htags/incop.c struct data * data 110 htags/incop.c struct data * data 122 htags/incop.c struct data * data 140 htags/incop.c if (data->ref_contents == NULL) data 141 htags/incop.c data->ref_contents = strbuf_open(0); data 142 htags/incop.c strbuf_puts0(data->ref_contents, path); data 143 htags/incop.c data->ref_count++; data 151 htags/incop.c struct data * data 154 htags/incop.c struct data *data = get_inc(name); data 156 htags/incop.c return (data && data->ref_count) ? data : NULL; data 39 htags/incop.h struct data *get_inc(const char *); data 40 htags/incop.h struct data *first_inc(void); data 41 htags/incop.h struct data *next_inc(void); data 43 htags/incop.h struct data *get_included(const char *); data 969 htags/php.c struct data *inc; data 755 htags/src2html.c * It is not source file. data 99 libdb/bt_close.c if (t->bt_cursor.key.data != NULL) { data 100 libdb/bt_close.c free(t->bt_cursor.key.data); data 102 libdb/bt_close.c t->bt_cursor.key.data = NULL; data 104 libdb/bt_close.c if (t->bt_rkey.data) { data 105 libdb/bt_close.c free(t->bt_rkey.data); data 107 libdb/bt_close.c t->bt_rkey.data = NULL; data 109 libdb/bt_close.c if (t->bt_rdata.data) { data 110 libdb/bt_close.c free(t->bt_rdata.data); data 112 libdb/bt_close.c t->bt_rdata.data = NULL; data 93 libdb/bt_get.c status = __bt_ret(t, e, NULL, NULL, data, &t->bt_rdata, 0); data 158 libdb/bt_overflow.c for (last = NULL, p = dbt->data, sz = dbt->size;; data 130 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) { data 134 libdb/bt_put.c tkey.data = kb; data 142 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) { data 143 libdb/bt_put.c if (__ovfl_put(t, data, &pg) == RET_ERROR) data 145 libdb/bt_put.c tdata.data = db; data 149 libdb/bt_put.c &data->size, sizeof(u_int32_t)); data 151 libdb/bt_put.c data = &tdata; data 153 libdb/bt_put.c if (key->size + data->size > t->bt_ovflsize) data 169 libdb/bt_put.c if (t->bt_order == NOT || (e = bt_fast(t, key, data, &exact)) == NULL) data 208 libdb/bt_put.c nbytes = NBLEAFDBT(key->size, data->size); data 211 libdb/bt_put.c data, dflags, nbytes, index)) != RET_SUCCESS) data 223 libdb/bt_put.c WR_BLEAF(dest, key, data, dflags); data 289 libdb/bt_put.c nbytes = NBLEAFDBT(key->size, data->size); data 122 libdb/bt_seq.c __bt_ret(t, &e, key, &t->bt_rkey, data, &t->bt_rdata, 0); data 174 libdb/bt_seq.c if (key->data == NULL || key->size == 0) { data 450 libdb/bt_seq.c if (t->bt_cursor.key.data != NULL) { data 451 libdb/bt_seq.c free(t->bt_cursor.key.data); data 453 libdb/bt_seq.c t->bt_cursor.key.data = NULL; data 122 libdb/bt_split.c WR_RLEAF(dest, data, flags) data 124 libdb/bt_split.c WR_BLEAF(dest, key, data, flags) data 195 libdb/bt_split.c a.data = tbl->bytes; data 197 libdb/bt_split.c b.data = bl->bytes; data 91 libdb/bt_utils.c &key->size, &rkey->data, &rkey->size)) data 93 libdb/bt_utils.c key->data = rkey->data; data 96 libdb/bt_utils.c p = (void *)(rkey->data == NULL ? data 97 libdb/bt_utils.c malloc(bl->ksize) : realloc(rkey->data, bl->ksize)); data 100 libdb/bt_utils.c rkey->data = p; data 103 libdb/bt_utils.c memmove(rkey->data, bl->bytes, bl->ksize); data 105 libdb/bt_utils.c key->data = rkey->data; data 108 libdb/bt_utils.c key->data = bl->bytes; data 112 libdb/bt_utils.c if (data == NULL) data 117 libdb/bt_utils.c &data->size, &rdata->data, &rdata->size)) data 119 libdb/bt_utils.c data->data = rdata->data; data 123 libdb/bt_utils.c p = (void *)(rdata->data == NULL ? data 125 libdb/bt_utils.c realloc(rdata->data, bl->dsize + 1)); data 128 libdb/bt_utils.c rdata->data = p; data 131 libdb/bt_utils.c memmove(rdata->data, bl->bytes + bl->ksize, bl->dsize); data 132 libdb/bt_utils.c data->size = bl->dsize; data 133 libdb/bt_utils.c data->data = rdata->data; data 135 libdb/bt_utils.c data->size = bl->dsize; data 136 libdb/bt_utils.c data->data = bl->bytes + bl->ksize; data 184 libdb/bt_utils.c k2.data = bl->bytes; data 192 libdb/bt_utils.c k2.data = bi->bytes; data 199 libdb/bt_utils.c &k2.size, &t->bt_rdata.data, &t->bt_rdata.size)) data 201 libdb/bt_utils.c k2.data = t->bt_rdata.data; data 232 libdb/bt_utils.c for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2) data 257 libdb/bt_utils.c for (p1 = a->data, p2 = b->data; len--; ++p1, ++p2, ++cnt) data 191 libdb/btree.h *(u_int32_t *)p = data->size; \ data 195 libdb/btree.h memmove(p, key->data, key->size); \ data 197 libdb/btree.h memmove(p, data->data, data->size); \ data 220 libdb/btree.h *(u_int32_t *)p = data->size; \ data 224 libdb/btree.h memmove(p, data->data, data->size); \ data 59 libdb/db.h void *data; /* data */ data 140 libutil/dbop.c key.data = (char *)name; data 144 libutil/dbop.c dbop->lastdat = (char *)dat.data; data 154 libutil/dbop.c return (dat.data); data 175 libutil/dbop.c key.data = (char *)name; data 177 libutil/dbop.c dat.data = (char *)data; data 178 libutil/dbop.c dat.size = strlen(data)+1; data 209 libutil/dbop.c key.data = (char *)name; data 211 libutil/dbop.c dat.data = (char *)data; data 237 libutil/dbop.c key.data = (char *)path; data 285 libutil/dbop.c key.data = (char *)name; data 297 libutil/dbop.c if (strncmp((char *)key.data, dbop->key, dbop->keylen)) data 300 libutil/dbop.c if (strcmp((char *)key.data, dbop->key)) data 303 libutil/dbop.c if (preg && regexec(preg, (char *)key.data, 0, 0, 0) != 0) data 313 libutil/dbop.c if (ismeta(key.data)) data 315 libutil/dbop.c if (preg && regexec(preg, (char *)key.data, 0, 0, 0) != 0) data 320 libutil/dbop.c dbop->lastdat = (char *)dat.data; data 322 libutil/dbop.c dbop->lastkey = (char *)key.data; data 334 libutil/dbop.c strlimcpy(dbop->prev, (char *)key.data, sizeof(dbop->prev)); data 335 libutil/dbop.c return (char *)key.data; data 337 libutil/dbop.c return ((char *)dat.data); data 360 libutil/dbop.c assert(dat.data != NULL); data 362 libutil/dbop.c if (flags & DBOP_KEY && ismeta(key.data)) data 364 libutil/dbop.c else if (ismeta(dat.data)) data 367 libutil/dbop.c if (!strcmp(dbop->prev, (char *)key.data)) data 369 libutil/dbop.c if (strlen((char *)key.data) > MAXKEYLEN) data 371 libutil/dbop.c strlimcpy(dbop->prev, (char *)key.data, sizeof(dbop->prev)); data 373 libutil/dbop.c dbop->lastdat = (char *)dat.data; data 375 libutil/dbop.c dbop->lastkey = (char *)key.data; data 378 libutil/dbop.c if (strncmp((char *)key.data, dbop->key, dbop->keylen)) data 381 libutil/dbop.c if (strcmp((char *)key.data, dbop->key)) data 384 libutil/dbop.c if (dbop->preg && regexec(dbop->preg, (char *)key.data, 0, 0, 0) != 0) data 386 libutil/dbop.c return (flags & DBOP_KEY) ? (char *)key.data : (char *)dat.data;