HomeSort by: relevance | last modified time | path
    Searched refs:bt_rdata (Results 1 - 8 of 8) sorted by relevancy

  /src/lib/libc/db/recno/
rec_utils.c 96 &data->size, &t->bt_rdata.data, &t->bt_rdata.size))
98 data->data = t->bt_rdata.data;
101 if (rl->dsize + 1 > t->bt_rdata.size) {
102 p = realloc(t->bt_rdata.data, rl->dsize + 1);
105 t->bt_rdata.data = p;
106 t->bt_rdata.size = rl->dsize + 1;
108 memmove(t->bt_rdata.data, rl->bytes, rl->dsize);
110 data->data = t->bt_rdata.data;
rec_get.c 129 if (t->bt_rdata.size < t->bt_reclen) {
130 void *np = realloc(t->bt_rdata.data, t->bt_reclen);
133 t->bt_rdata.data = np;
134 t->bt_rdata.size = t->bt_reclen;
136 data.data = t->bt_rdata.data;
141 for (p = t->bt_rdata.data;; *p++ = ch)
184 for (p = t->bt_rdata.data,
185 sz = t->bt_rdata.size;; *p++ = ch, --sz) {
187 data.data = t->bt_rdata.data;
188 data.size = p - (uint8_t *)t->bt_rdata.data
    [all...]
rec_put.c 89 if (t->bt_rdata.size < t->bt_reclen) {
90 void *np = realloc(t->bt_rdata.data, t->bt_reclen);
93 t->bt_rdata.data = np;
94 t->bt_rdata.size = t->bt_reclen;
96 memmove(t->bt_rdata.data, data->data, data->size);
97 memset((char *)t->bt_rdata.data + data->size,
99 fdata.data = t->bt_rdata.data;
  /src/lib/libc/db/btree/
bt_close.c 98 if (t->bt_rdata.data) {
99 free(t->bt_rdata.data);
100 t->bt_rdata.size = 0;
101 t->bt_rdata.data = NULL;
bt_get.c 93 status = __bt_ret(t, e, NULL, NULL, data, &t->bt_rdata, 0);
bt_utils.c 188 &k2.size, &t->bt_rdata.data, &t->bt_rdata.size))
190 k2.data = t->bt_rdata.data;
btree.h 375 DBT bt_rdata; /* returned data */ member in struct:_btree
bt_seq.c 125 __bt_ret(t, &e, key, &t->bt_rkey, data, &t->bt_rdata, 0);

Completed in 31 milliseconds