diff options
| author | Binbin <binloveplay1314@qq.com> | 2021-05-10 19:02:25 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-05-10 14:02:25 +0300 |
| commit | fb66c1b58cbf84ad5372a2c793399d9301564da5 (patch) | |
| tree | be97c3318a7b2874e22441733b13a675dfb98288 /src/quicklist.h | |
| parent | 4d4db9797fd684185dae476747069b54243f1e83 (diff) | |
| download | redis-fb66c1b58cbf84ad5372a2c793399d9301564da5.tar.gz | |
Fix typos, and consistent function argument names in quicklist (#8915)
Also fixes a chance for compilation error if REDIS_TEST_VERBOSE would be used.
Diffstat (limited to 'src/quicklist.h')
| -rw-r--r-- | src/quicklist.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/src/quicklist.h b/src/quicklist.h index 43b145044..b9c01757d 100644 --- a/src/quicklist.h +++ b/src/quicklist.h @@ -100,7 +100,7 @@ typedef struct quicklistBookmark { * 'compress' is: 0 if compression disabled, otherwise it's the number * of quicklistNodes to leave uncompressed at ends of quicklist. * 'fill' is the user-requested (or default) fill factor. - * 'bookmakrs are an optional feature that is used by realloc this struct, + * 'bookmarks are an optional feature that is used by realloc this struct, * so that they don't consume memory when not used. */ typedef struct quicklist { quicklistNode *head; @@ -164,9 +164,9 @@ quicklist *quicklistAppendValuesFromZiplist(quicklist *quicklist, unsigned char *zl); quicklist *quicklistCreateFromZiplist(int fill, int compress, unsigned char *zl); -void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *node, +void quicklistInsertAfter(quicklist *quicklist, quicklistEntry *entry, void *value, const size_t sz); -void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *node, +void quicklistInsertBefore(quicklist *quicklist, quicklistEntry *entry, void *value, const size_t sz); void quicklistDelEntry(quicklistIter *iter, quicklistEntry *entry); int quicklistReplaceAtIndex(quicklist *quicklist, long index, void *data, @@ -175,7 +175,7 @@ int quicklistDelRange(quicklist *quicklist, const long start, const long stop); quicklistIter *quicklistGetIterator(const quicklist *quicklist, int direction); quicklistIter *quicklistGetIteratorAtIdx(const quicklist *quicklist, int direction, const long long idx); -int quicklistNext(quicklistIter *iter, quicklistEntry *node); +int quicklistNext(quicklistIter *iter, quicklistEntry *entry); void quicklistReleaseIterator(quicklistIter *iter); quicklist *quicklistDup(quicklist *orig); int quicklistIndex(const quicklist *quicklist, const long long index, |