version 1.26, 2011/12/16 20:06:58 |
version 1.27, 2011/12/20 21:41:11 |
Line 171 btree_read(const DBT *k, const DBT *v, |
|
Line 171 btree_read(const DBT *k, const DBT *v, |
|
const struct mchars *mc, |
const struct mchars *mc, |
struct db_val *dbv, char **buf) |
struct db_val *dbv, char **buf) |
{ |
{ |
const struct db_val *vp; |
struct db_val raw_dbv; |
|
|
/* Are our sizes sane? */ |
/* Are our sizes sane? */ |
if (k->size < 2 || sizeof(struct db_val) != v->size) |
if (k->size < 2 || sizeof(struct db_val) != v->size) |
Line 181 btree_read(const DBT *k, const DBT *v, |
|
Line 181 btree_read(const DBT *k, const DBT *v, |
|
if ('\0' != ((const char *)k->data)[(int)k->size - 1]) |
if ('\0' != ((const char *)k->data)[(int)k->size - 1]) |
return(0); |
return(0); |
|
|
vp = v->data; |
|
norm_string((const char *)k->data, mc, buf); |
norm_string((const char *)k->data, mc, buf); |
dbv->rec = betoh32(vp->rec); |
memcpy(&raw_dbv, v->data, v->size); |
dbv->mask = betoh64(vp->mask); |
dbv->rec = betoh32(raw_dbv.rec); |
|
dbv->mask = betoh64(raw_dbv.mask); |
return(1); |
return(1); |
} |
} |
|
|
Line 380 index_read(const DBT *key, const DBT *val, int index, |
|
Line 380 index_read(const DBT *key, const DBT *val, int index, |
|
return(0); |
return(0); |
|
|
cp = val->data; |
cp = val->data; |
rec->res.rec = *(recno_t *)key->data; |
assert(sizeof(recno_t) == key->size); |
|
memcpy(&rec->res.rec, key->data, key->size); |
rec->res.volume = index; |
rec->res.volume = index; |
|
|
if ('d' == (type = *cp++)) |
if ('d' == (type = *cp++)) |