mirror of
https://github.com/MariaDB/server.git
synced 2025-01-22 23:04:20 +01:00
110754f57c
Current tests fail (not regressions, they fail as of 13461)
* {{{x1.tdbrun}}}
* {{{test_log(2,3,4,5,6,7,8,9,10).recover}}}
* {{{test-recover(1,2,3).tdbrun}}}
* {{{test1324.tdbrun}}}
ULE_DEBUG disabled (defined to 0) Can be re-enabled for test purposes (set to 1).
refs [t:1125]
Merging into the temp branch (tokudb.main_13461+1125)
{{{svn merge --accept=postpone -r 12527:13461 ../tokudb.1125 ./}}}
Merging into main
{{{svn merge --accept=postpone -r13462:13463 ../tokudb.main_13461+1125/ ./}}}
git-svn-id: file:///svn/toku/tokudb@13464 c7de825b-a66e-492c-adef-691d508d4ae1
243 lines
12 KiB
C
243 lines
12 KiB
C
#ifndef LEAFENTRY_H
|
|
#define LEAFENTRY_H
|
|
#ident "$Id$"
|
|
#ident "Copyright (c) 2007, 2008, 2009 Tokutek Inc. All rights reserved."
|
|
#ident "The technology is licensed by the Massachusetts Institute of Technology, Rutgers State University of New Jersey, and the Research Foundation of State University of New York at Stony Brook under United States of America Serial No. 11/760379 and to the patents and/or patent applications resulting from it."
|
|
|
|
|
|
/* In the past, leaves simply contained key-value pairs.
|
|
* In this implementatoin, leaf values are more complex
|
|
* They can contain a committed value:
|
|
* - Which can be "not-present",
|
|
* - Or a key-value pair.
|
|
* They can contain a provisional value, which depends on whether a particular transaction commits or aborts.
|
|
* - A not-present value
|
|
* - Or a key-value pair.
|
|
* - Or there can be no provisional value at all (that is, the value doesn't depend on the transaction.)
|
|
* Note that if both the provisional value and the committed value are not-present, then there is simply no entry in the leaf.
|
|
* So let's enumerate the possibilities:
|
|
* committed pair A committed pair unaffected by any incomplete transaction.
|
|
* committed pair and provisional pair A committed pair to provisionally be replaced by a new pair.
|
|
* committed pair and provisional delete A committed pair that will be deleted
|
|
* provisional pair No committed pair, but if a provisional pair to add.
|
|
*
|
|
* In the case of a committed pair and a provisional pair, the key is the same in both cases. The value can be different.
|
|
*
|
|
* For DUPSORT databases, the key-value pair is everything, so we need only represent the key-value pair once. So the cases are
|
|
* committed pair
|
|
* committed pair provisionally deleted
|
|
* provisional pair
|
|
* The case of a committed pair and a provisional pair can be represented by a committed pair, since it doesn't matter whether the transction aborts or commits, the value is the same.
|
|
*/
|
|
|
|
#include <toku_portability.h>
|
|
#include "rbuf.h"
|
|
#include "x1764.h"
|
|
|
|
#if 0
|
|
Memory format of packed nodup leaf entry
|
|
CONSTANTS:
|
|
num_uxrs
|
|
keylen
|
|
Run-time-constants
|
|
voffset of val/vallen??? (for le_any_val) This must be small if it is interpreted as voffset = realoffset_of_val - keylen
|
|
GOOD performance optimization.
|
|
ALSO good for simplicity (no having to scan packed version)
|
|
key[]
|
|
variable length
|
|
|
|
|
|
Memory format of packed dup leaf entry
|
|
CONSTANTS:
|
|
num_uxrs
|
|
keylen
|
|
vallen
|
|
Run-time-constants
|
|
key[]
|
|
val[]
|
|
#endif
|
|
#if TOKU_WINDOWS
|
|
#pragma pack(push, 1)
|
|
#endif
|
|
struct __attribute__ ((__packed__)) leafentry {
|
|
u_int8_t num_xrs;
|
|
u_int32_t keylen;
|
|
u_int32_t innermost_inserted_vallen;
|
|
union {
|
|
struct __attribute__ ((__packed__)) leafentry_committed {
|
|
u_int8_t key_val[0]; //Actual key, then actual val
|
|
} comm;
|
|
struct __attribute__ ((__packed__)) leafentry_provisional {
|
|
u_int8_t innermost_type;
|
|
TXNID xid_outermost_uncommitted;
|
|
u_int8_t key_val_xrs[]; //Actual key,
|
|
//then actual innermost inserted val,
|
|
//then transaction records.
|
|
} prov;
|
|
} u;
|
|
};
|
|
#if TOKU_WINDOWS
|
|
#pragma pack(pop)
|
|
#endif
|
|
|
|
typedef struct leafentry *LEAFENTRY;
|
|
|
|
|
|
u_int32_t toku_le_crc(LEAFENTRY v);
|
|
|
|
//TODO: #1125 next four probably are not necessary once testing for new structure is done (except possibly for test-leafentry.c, rename to test-leafentry10.c
|
|
int le10_committed (u_int32_t klen, void* kval, u_int32_t dlen, void* dval, u_int32_t *resultsize, u_int32_t *disksize, LEAFENTRY *result,
|
|
OMT, struct mempool *, void **maybe_free);
|
|
int le10_both (TXNID xid, u_int32_t cklen, void* ckval, u_int32_t cdlen, void* cdval, u_int32_t pdlen, void* pdval,
|
|
u_int32_t *memsize, u_int32_t *disksize, LEAFENTRY *result,
|
|
OMT, struct mempool *, void **maybe_free);
|
|
int le10_provdel (TXNID xid, u_int32_t klen, void* kval, u_int32_t dlen, void* dval,
|
|
u_int32_t *resultsize, u_int32_t *memsize, LEAFENTRY *result,
|
|
OMT, struct mempool *, void **maybe_free);
|
|
int le10_provpair (TXNID xid, u_int32_t klen, void* kval, u_int32_t plen, void* pval, u_int32_t *memsize, u_int32_t *disksize, LEAFENTRY *result,
|
|
OMT omt, struct mempool *mp, void **maybe_free);
|
|
|
|
enum le_state { LE_COMMITTED=1, // A committed pair.
|
|
LE_BOTH, // A committed pair and a provisional pair.
|
|
LE_PROVDEL, // A committed pair that has been provisionally deleted
|
|
LE_PROVPAIR }; // No committed value, but a provisional pair.
|
|
|
|
static inline enum le_state get_le_state(LEAFENTRY le) {
|
|
return (enum le_state)*(unsigned char *)le;
|
|
}
|
|
|
|
static inline void putint (unsigned char *p, u_int32_t i) {
|
|
#if 1
|
|
*(u_int32_t*)p = toku_htod32(i);
|
|
#else
|
|
p[0]=(i>>24)&0xff;
|
|
p[1]=(i>>16)&0xff;
|
|
p[2]=(i>> 8)&0xff;
|
|
p[3]=(i>> 0)&0xff;
|
|
#endif
|
|
}
|
|
static inline void putint64 (unsigned char *p, u_int64_t i) {
|
|
putint(p, (u_int32_t)(i>>32));
|
|
putint(p+4, (u_int32_t)(i&0xffffffff));
|
|
}
|
|
static inline u_int32_t getint (unsigned char *p) {
|
|
#if 1
|
|
return toku_dtoh32(*(u_int32_t*)p);
|
|
#else
|
|
return (p[0]<<24)+(p[1]<<16)+(p[2]<<8)+(p[3]);
|
|
#endif
|
|
}
|
|
static inline u_int64_t getint64 (unsigned char *p) {
|
|
u_int64_t H = getint(p);
|
|
u_int64_t L = getint(p+4);
|
|
return (H<<32) + L;
|
|
}
|
|
|
|
// This ugly factorization of the macro is done so that we can do ## or not depending on which version of the
|
|
// compiler we are using, without repeating all this crufty offset calculation.
|
|
|
|
#define DO_LE_COMMITTED(funname,le) case LE_COMMITTED: { \
|
|
unsigned char* __klenaddr = 1+(unsigned char*)le; u_int32_t __klen = getint(__klenaddr); \
|
|
unsigned char* __kvaladdr = 4 + __klenaddr; \
|
|
unsigned char* __clenaddr = __klen + __kvaladdr; u_int32_t __clen = getint(__clenaddr); \
|
|
unsigned char* __cvaladdr = 4 + __clenaddr; \
|
|
return funname ## _le10_committed(__klen, __kvaladdr, __clen, __cvaladdr
|
|
|
|
#define DO_LE_BOTH(funname,le) case LE_BOTH: { \
|
|
unsigned char* __xidaddr = 1+(unsigned char*)le; u_int64_t __xid = getint64(__xidaddr); \
|
|
unsigned char* __klenaddr = 8 + __xidaddr; u_int32_t __klen = getint(__klenaddr); \
|
|
unsigned char* __kvaladdr = 4 + __klenaddr; \
|
|
unsigned char* __clenaddr = __klen + __kvaladdr; u_int32_t __clen = getint(__clenaddr); \
|
|
unsigned char* __cvaladdr = 4 + __clenaddr; \
|
|
unsigned char* __plenaddr = __clen + __cvaladdr; u_int32_t __plen = getint(__plenaddr); \
|
|
unsigned char* __pvaladdr = 4 + __plenaddr; \
|
|
return funname ## _le10_both(__xid, __klen, __kvaladdr, __clen, __cvaladdr, __plen, __pvaladdr
|
|
|
|
#define DO_LE_PROVDEL(funname,le ) case LE_PROVDEL: { \
|
|
unsigned char* __xidaddr = 1+(unsigned char*)le; u_int64_t __xid = getint64(__xidaddr); \
|
|
unsigned char* __klenaddr = 8 + __xidaddr; u_int32_t __klen = getint(__klenaddr); \
|
|
unsigned char* __kvaladdr = 4 + __klenaddr; \
|
|
unsigned char* __dlenaddr = __klen + __kvaladdr; u_int32_t __dlen = getint(__dlenaddr); \
|
|
unsigned char* __dvaladdr = 4 + __dlenaddr; \
|
|
return funname ## _le10_provdel(__xid, __klen, __kvaladdr, __dlen, __dvaladdr
|
|
|
|
#define DO_LE_PROVPAIR(funname,le) case LE_PROVPAIR: { \
|
|
unsigned char* __xidaddr = 1+(unsigned char*)le; u_int64_t __xid = getint64(__xidaddr); \
|
|
unsigned char* __klenaddr = 8 + __xidaddr; u_int32_t __klen = getint(__klenaddr); \
|
|
unsigned char* __kvaladdr = 4 + __klenaddr; \
|
|
unsigned char* __plenaddr = __klen + __kvaladdr; u_int32_t __plen = getint(__plenaddr); \
|
|
unsigned char* __pvaladdr = 4 + __plenaddr; \
|
|
return funname ## _le10_provpair(__xid, __klen, __kvaladdr, __plen, __pvaladdr
|
|
|
|
#ifdef __ICL
|
|
#define LESWITCHCALL(le,funname, ...) do { \
|
|
switch(get_le_state(le)) { \
|
|
DO_LE_COMMITTED(funname,le) , __VA_ARGS__); } \
|
|
DO_LE_BOTH (funname,le) , __VA_ARGS__); } \
|
|
DO_LE_PROVDEL (funname,le) , __VA_ARGS__); } \
|
|
DO_LE_PROVPAIR (funname,le) , __VA_ARGS__); } \
|
|
} abort(); } while (0)
|
|
#else
|
|
#define LESWITCHCALL(le,funname, ...) do { \
|
|
switch(get_le_state(le)) { \
|
|
DO_LE_COMMITTED(funname,le) , ## __VA_ARGS__); } \
|
|
DO_LE_BOTH (funname,le) , ## __VA_ARGS__); } \
|
|
DO_LE_PROVDEL (funname,le) , ## __VA_ARGS__); } \
|
|
DO_LE_PROVPAIR (funname,le) , ## __VA_ARGS__); } \
|
|
} abort(); } while (0)
|
|
#endif
|
|
|
|
size_t leafentry_memsize (LEAFENTRY le); // the size of a leafentry in memory.
|
|
size_t leafentry_disksize (LEAFENTRY le); // this is the same as logsizeof_LEAFENTRY. The size of a leafentry on disk.
|
|
void wbuf_LEAFENTRY(struct wbuf *w, LEAFENTRY le);
|
|
int print_leafentry (FILE *outf, LEAFENTRY v); // Print a leafentry out in human-readable form.
|
|
|
|
int le_is_provdel(LEAFENTRY le); // Return true if it is a provisional delete.
|
|
void* le_latest_key (LEAFENTRY le); // Return the latest key (return NULL for provisional deletes)
|
|
u_int32_t le_latest_keylen (LEAFENTRY le); // Return the latest keylen.
|
|
void* le_latest_key_and_len (LEAFENTRY le, u_int32_t *len);
|
|
void* le_latest_val (LEAFENTRY le); // Return the latest val (return NULL for provisional deletes)
|
|
u_int32_t le_latest_vallen (LEAFENTRY le); // Return the latest vallen. Returns 0 for provisional deletes.
|
|
void* le_latest_val_and_len (LEAFENTRY le, u_int32_t *len);
|
|
|
|
// Return any key or value (even if it's only provisional).
|
|
void* le_key (LEAFENTRY le);
|
|
u_int32_t le_keylen (LEAFENTRY le);
|
|
void* le_key_and_len (LEAFENTRY le, u_int32_t *len);
|
|
|
|
u_int64_t le_outermost_uncommitted_xid (LEAFENTRY le);
|
|
|
|
// Return any key or value (even if it's only provisional) If more than one exist, choose innermost (newest)
|
|
void* le_innermost_inserted_val (LEAFENTRY le);
|
|
u_int32_t le_innermost_inserted_vallen (LEAFENTRY le);
|
|
void* le_innermost_inserted_val_and_len (LEAFENTRY le, u_int32_t *len);
|
|
|
|
void le_full_promotion(LEAFENTRY le, size_t *new_leafentry_memorysize, size_t *new_leafentry_disksize);
|
|
//Effect: Fully promotes le. Returns new memory/disk size.
|
|
// Reuses the memory of le.
|
|
// Memory size is guaranteed to reduce.
|
|
// result of leafentry_memsize() changes
|
|
// Pointer to le is reused.
|
|
// No need to update omt if it just points to the leafentry.
|
|
// Does not change results of:
|
|
// le_is_provdel()
|
|
// le_latest_keylen()
|
|
// le_latest_vallen()
|
|
// le_keylen()
|
|
// le_innermost_inserted_vallen()
|
|
// le_outermost_uncommitted_xid will return 0 after this.
|
|
// Changes results of following pointer functions, but memcmp of old/new answers would say they're the same.
|
|
// Note: You would have to memdup the old answers before calling le_full_promotion, if you want to run the comparison
|
|
// le_latest_key()
|
|
// le_latest_val()
|
|
// le_key()
|
|
// le_innermost_inserted_val()
|
|
// le_outermost_uncommitted_xid will return 0 after this
|
|
// key/val pointers will change, but data pointed to by them will be the same
|
|
// as before
|
|
//Requires: le is not a provdel
|
|
//Requires: le is not marked committed
|
|
//Requires: The outermost uncommitted xid in le has actually committed (le was not yet updated to reflect that)
|
|
|
|
#endif
|
|
|