#include #ifndef _DATATUPLE_H_ #define _DATATUPLE_H_ #include #include typedef unsigned char byte; #include #include typedef struct datatuple { public: typedef unsigned char* key_t ; typedef unsigned char* data_t ; private: len_t datalen_; byte* data_; // aliases key(). data_ - 1 should be the \0 terminating key(). datatuple* sanity_check() { assert(keylen() < 3000); return this; } public: inline len_t keylen() const { return data_ - key(); } inline len_t datalen() const { return (datalen_ == DELETE) ? 0 : datalen_; } //returns the length of the byte array representation len_t byte_length() const { return sizeof(len_t) + sizeof(len_t) + keylen() + datalen(); } static len_t length_from_header(len_t keylen, len_t datalen) { return keylen + ((datalen == DELETE) ? 0 : datalen); } inline key_t key() const { return (key_t)(this+1); } inline data_t data() const { return data_; } //this is used by the stl set bool operator() (const datatuple* lhs, const datatuple* rhs) const { return compare(lhs->key(), lhs->keylen(), rhs->key(), rhs->keylen()) < 0; //strcmp((char*)lhs.key(),(char*)rhs.key()) < 0; } /** * return -1 if k1 < k2 * 0 if k1 == k2 * 1 of k1 > k2 **/ static int compare(const byte* k1,size_t k1l, const byte* k2, size_t k2l) { // This function handles ASCII and UTF-8 correctly. // It also handles a Sherpa LSM-Tree specific encoding, where multiple utf-8 strings // are concatenated with \254., and the \254 is replaced with a \255 for 'max value in range'. size_t min_l = k1l < k2l ? k1l : k2l; int ret = memcmp(k1,k2, min_l); if(ret) return ret; if(k1l < k2l) return -1; if(k1l == k2l) return 0; return 1; //for testing with char* ending with \0 /*assert(strlen((char*)k1) == k1l - 1); assert(strlen((char*)k2) == k2l - 1); return strcmp((char*)k1,(char*)k2); */ } static int compare_obj(const datatuple * a, const datatuple* b) { return compare(a->key(), a->keylen(), b->key(), b->keylen()); } inline void setDelete() { datalen_ = DELETE; } inline bool isDelete() const { return datalen_ == DELETE; } static std::string key_to_str(const byte* k) { //for strings return std::string((char*)k); //for int /* std::ostringstream ostr; ostr << *((int32_t*)k); return ostr.str(); */ } //copy the tuple. does a deep copy of the contents. datatuple* create_copy() const { return create(key(), keylen(), data(), datalen_)->sanity_check(); } static datatuple* create(const void* key, len_t keylen) { return create(key, keylen, 0, DELETE); } static datatuple* create(const void* key, len_t keylen, const void* data, len_t datalen) { datatuple *ret = (datatuple*)malloc(sizeof(datatuple) + length_from_header(keylen,datalen)); memcpy(ret->key(), key, keylen); ret->data_ = ret->key() + keylen; // need to set this even if delete, since it encodes the key length. if(datalen != DELETE) { memcpy(ret->data_, data, datalen); } ret->datalen_ = datalen; return ret->sanity_check(); } //format: key length _ data length _ key _ data byte * to_bytes() const { byte *ret = (byte*)malloc(byte_length()); ((len_t*)ret)[0] = keylen(); ((len_t*)ret)[1] = datalen_; memcpy(((len_t*)ret)+2, key(), length_from_header(keylen(), datalen_)); return ret; } const byte* get_bytes(len_t *keylen, len_t *datalen) const { *keylen = this->keylen(); *datalen = datalen_; return key(); } //format of buf: key _ data. The caller needs to 'peel' off key length and data length for this call. static datatuple* from_bytes(len_t keylen, len_t datalen, byte* buf) { datatuple *dt = (datatuple*) malloc(sizeof(datatuple) + length_from_header(keylen,datalen)); dt->datalen_ = datalen; memcpy(dt->key(),buf, length_from_header(keylen,datalen)); dt->data_ = dt->key() + keylen; return dt->sanity_check(); } static datatuple* from_bytes(byte* buf) { len_t keylen = ((len_t*)buf)[0]; len_t buflen = length_from_header(keylen, ((len_t*)buf)[1]); datatuple *dt = (datatuple*) malloc(sizeof(datatuple) + buflen); dt->datalen_ = ((len_t*)buf)[1]; memcpy(dt->key(),((len_t*)buf)+2,buflen); dt->data_ = dt->key() + keylen; return dt->sanity_check(); } static inline void freetuple(datatuple* dt) { free(dt); } } datatuple; #endif