提交 6b6f0b12 编写于 作者: M Minglei Jin

[TS-144]<fix>: fix table missing issue caused by hash rcount overflow

上级 50212eef
......@@ -36,7 +36,7 @@ typedef struct SHashNode {
uint32_t dataLen; // length of data
uint32_t keyLen; // length of the key
int8_t removed; // flag to indicate removed
int8_t count; // reference count
int32_t count; // reference count
char data[];
} SHashNode;
......
......@@ -117,7 +117,7 @@ static SHashNode *doCreateHashNode(const void *key, size_t keyLen, const void *p
static FORCE_INLINE SHashNode *doUpdateHashNode(SHashObj *pHashObj, SHashEntry* pe, SHashNode* prev, SHashNode *pNode, SHashNode *pNewNode) {
assert(pNode->keyLen == pNewNode->keyLen);
pNode->count--;
atomic_sub_fetch_32(&pNode->count, 1);
if (prev != NULL) {
prev->next = pNewNode;
} else {
......@@ -372,7 +372,7 @@ int32_t taosHashRemoveWithData(SHashObj *pHashObj, const void *key, size_t keyLe
if (pNode) {
code = 0; // it is found
pNode->count--;
atomic_sub_fetch_32(&pNode->count, 1);
pNode->removed = 1;
if (pNode->count <= 0) {
if (prevNode) {
......@@ -720,7 +720,7 @@ static void *taosHashReleaseNode(SHashObj *pHashObj, void *p, int *slot) {
pNode = pNode->next;
}
pOld->count--;
atomic_sub_fetch_32(&pOld->count, 1);
if (pOld->count <=0) {
if (prevNode) {
prevNode->next = pOld->next;
......@@ -786,7 +786,7 @@ void *taosHashIterate(SHashObj *pHashObj, void *p) {
if (pNode) {
SHashEntry *pe = pHashObj->hashList[slot];
pNode->count++;
atomic_add_fetch_32(&pNode->count, 1);
data = GET_HASH_NODE_DATA(pNode);
if (pHashObj->type == HASH_ENTRY_LOCK) {
taosWUnLockLatch(&pe->latch);
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册