mirror of
https://codeberg.org/redict/redict.git
synced 2025-01-23 16:48:27 -05:00
3716950cfc
If RESTORE passes successfully with full sanitization, we can't affort to crash later on assertion due to duplicate records in a hash when converting it form ziplist to dict. This means that when doing full sanitization, we must make sure there are no duplicate records in any of the collections.
61 lines
3.1 KiB
C
61 lines
3.1 KiB
C
/*
|
|
* Copyright (c) 2009-2012, Pieter Noordhuis <pcnoordhuis at gmail dot com>
|
|
* Copyright (c) 2009-2012, Salvatore Sanfilippo <antirez at gmail dot com>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* * Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* * Neither the name of Redis nor the names of its contributors may be used
|
|
* to endorse or promote products derived from this software without
|
|
* specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
*/
|
|
|
|
#ifndef _ZIPLIST_H
|
|
#define _ZIPLIST_H
|
|
|
|
#define ZIPLIST_HEAD 0
|
|
#define ZIPLIST_TAIL 1
|
|
|
|
unsigned char *ziplistNew(void);
|
|
unsigned char *ziplistMerge(unsigned char **first, unsigned char **second);
|
|
unsigned char *ziplistPush(unsigned char *zl, unsigned char *s, unsigned int slen, int where);
|
|
unsigned char *ziplistIndex(unsigned char *zl, int index);
|
|
unsigned char *ziplistNext(unsigned char *zl, unsigned char *p);
|
|
unsigned char *ziplistPrev(unsigned char *zl, unsigned char *p);
|
|
unsigned int ziplistGet(unsigned char *p, unsigned char **sval, unsigned int *slen, long long *lval);
|
|
unsigned char *ziplistInsert(unsigned char *zl, unsigned char *p, unsigned char *s, unsigned int slen);
|
|
unsigned char *ziplistDelete(unsigned char *zl, unsigned char **p);
|
|
unsigned char *ziplistDeleteRange(unsigned char *zl, int index, unsigned int num);
|
|
unsigned int ziplistCompare(unsigned char *p, unsigned char *s, unsigned int slen);
|
|
unsigned char *ziplistFind(unsigned char *zl, unsigned char *p, unsigned char *vstr, unsigned int vlen, unsigned int skip);
|
|
unsigned int ziplistLen(unsigned char *zl);
|
|
size_t ziplistBlobLen(unsigned char *zl);
|
|
void ziplistRepr(unsigned char *zl);
|
|
typedef int (*ziplistValidateEntryCB)(unsigned char* p, void* userdata);
|
|
int ziplistValidateIntegrity(unsigned char *zl, size_t size, int deep,
|
|
ziplistValidateEntryCB entry_cb, void *cb_userdata);
|
|
|
|
#ifdef REDIS_TEST
|
|
int ziplistTest(int argc, char *argv[]);
|
|
#endif
|
|
|
|
#endif /* _ZIPLIST_H */
|