3b462ce566
In unwatchAllKeys() function, we traverse all the keys watched by the client, and for each key we need to remove the client from the list of clients watching that key. This is implemented by listSearchKey which traverses the list of clients. If we can reach the node of the list of clients from watchedKey in O(1) time, then we do not need to call listSearchKey anymore. Changes in this PR: put the node of the list of clients of each watched key in the db inside the watchedKey structure. In this way, for every key watched by the client, we can get the watchedKey structure and then reach the node in the list of clients in db->watched_keys to remove it from that list. From the perspective of the list of clients watching the key, the list node is inside a watchedKey structure, so we can get to the watchedKey struct from the listnode by struct member offset math. And because of this, node->value is not used, we can point node->value to the list itself, so that we don't need to fetch the list of clients from the dict.
101 lines
3.7 KiB
C
101 lines
3.7 KiB
C
/* adlist.h - A generic doubly linked list implementation
|
|
*
|
|
* Copyright (c) 2006-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 __ADLIST_H__
|
|
#define __ADLIST_H__
|
|
|
|
/* Node, List, and Iterator are the only data structures used currently. */
|
|
|
|
typedef struct listNode {
|
|
struct listNode *prev;
|
|
struct listNode *next;
|
|
void *value;
|
|
} listNode;
|
|
|
|
typedef struct listIter {
|
|
listNode *next;
|
|
int direction;
|
|
} listIter;
|
|
|
|
typedef struct list {
|
|
listNode *head;
|
|
listNode *tail;
|
|
void *(*dup)(void *ptr);
|
|
void (*free)(void *ptr);
|
|
int (*match)(void *ptr, void *key);
|
|
unsigned long len;
|
|
} list;
|
|
|
|
/* Functions implemented as macros */
|
|
#define listLength(l) ((l)->len)
|
|
#define listFirst(l) ((l)->head)
|
|
#define listLast(l) ((l)->tail)
|
|
#define listPrevNode(n) ((n)->prev)
|
|
#define listNextNode(n) ((n)->next)
|
|
#define listNodeValue(n) ((n)->value)
|
|
|
|
#define listSetDupMethod(l,m) ((l)->dup = (m))
|
|
#define listSetFreeMethod(l,m) ((l)->free = (m))
|
|
#define listSetMatchMethod(l,m) ((l)->match = (m))
|
|
|
|
#define listGetDupMethod(l) ((l)->dup)
|
|
#define listGetFreeMethod(l) ((l)->free)
|
|
#define listGetMatchMethod(l) ((l)->match)
|
|
|
|
/* Prototypes */
|
|
list *listCreate(void);
|
|
void listRelease(list *list);
|
|
void listEmpty(list *list);
|
|
list *listAddNodeHead(list *list, void *value);
|
|
list *listAddNodeTail(list *list, void *value);
|
|
list *listInsertNode(list *list, listNode *old_node, void *value, int after);
|
|
void listDelNode(list *list, listNode *node);
|
|
listIter *listGetIterator(list *list, int direction);
|
|
listNode *listNext(listIter *iter);
|
|
void listReleaseIterator(listIter *iter);
|
|
list *listDup(list *orig);
|
|
listNode *listSearchKey(list *list, void *key);
|
|
listNode *listIndex(list *list, long index);
|
|
void listRewind(list *list, listIter *li);
|
|
void listRewindTail(list *list, listIter *li);
|
|
void listRotateTailToHead(list *list);
|
|
void listRotateHeadToTail(list *list);
|
|
void listJoin(list *l, list *o);
|
|
void listInitNode(listNode *node, void *value);
|
|
void listLinkNodeHead(list *list, listNode *node);
|
|
void listLinkNodeTail(list *list, listNode *node);
|
|
void listUnlinkNode(list *list, listNode *node);
|
|
|
|
/* Directions for iterators */
|
|
#define AL_START_HEAD 0
|
|
#define AL_START_TAIL 1
|
|
|
|
#endif /* __ADLIST_H__ */
|