#3533

Committed 20 Nov 2024 07:11AM UTC coverage: 58.848% (-1.9%) from 60.78%

Build # #3533

Build Type

push

travis-ci

Committed by

web-flow

Commit Message

Merge pull request #28823 from taosdata/fix/3.0/TD-32587

fix:[TD-32587]fix stmt segmentation fault

Run Details

115578 of 252434 branches covered (45.79%)

Branch coverage included in aggregate %.

1 of 4 new or added lines in 1 file covered. (25.0%)

8038 existing lines in 233 files now uncovered.

194926 of 275199 relevant lines covered (70.83%)

1494459.59 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

57.46

/source/dnode/vnode/src/vnd/vnodeHash.c

/*
 * Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
 *
 * This program is free software: you can use, redistribute, and/or modify
 * it under the terms of the GNU Affero General Public License, version 3
 * or later ("AGPL"), as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with this program. If not, see <http://www.gnu.org/licenses/>.
 */

#include "vnodeHash.h"

#define VNODE_HASH_DEFAULT_NUM_BUCKETS 1024

typedef struct SVHashEntry SVHashEntry;

struct SVHashEntry {
  SVHashEntry* next;
  void*        obj;
};

static void vHashRehash(SVHashTable* ht, uint32_t newNumBuckets) {
  SVHashEntry** newBuckets = (SVHashEntry**)taosMemoryCalloc(newNumBuckets, sizeof(SVHashEntry*));
  if (newBuckets == NULL) {
    return;
  }

  for (int32_t i = 0; i < ht->numBuckets; i++) {
    SVHashEntry* entry = ht->buckets[i];
    while (entry != NULL) {
      SVHashEntry* next = entry->next;
      uint32_t     bucketIndex = ht->hash(entry->obj) % newNumBuckets;
      entry->next = newBuckets[bucketIndex];
      newBuckets[bucketIndex] = entry;
      entry = next;
    }
  }

  taosMemoryFree(ht->buckets);
  ht->buckets = newBuckets;
  ht->numBuckets = newNumBuckets;

  return;
}

int32_t vHashInit(SVHashTable** ht, uint32_t (*hash)(const void*), int32_t (*compare)(const void*, const void*)) {
  if (ht == NULL || hash == NULL || compare == NULL) {
    return TSDB_CODE_INVALID_PARA;
  }

  (*ht) = (SVHashTable*)taosMemoryMalloc(sizeof(SVHashTable));
  if (*ht == NULL) {
    return terrno;
  }

  (*ht)->hash = hash;
  (*ht)->compare = compare;
  (*ht)->numEntries = 0;
  (*ht)->numBuckets = VNODE_HASH_DEFAULT_NUM_BUCKETS;
  (*ht)->buckets = (SVHashEntry**)taosMemoryCalloc((*ht)->numBuckets, sizeof(SVHashEntry*));
  if ((*ht)->buckets == NULL) {
    taosMemoryFree(*ht);
    return terrno;
  }

  return 0;
}

void vHashDestroy(SVHashTable** ht) {
  if (ht == NULL) {
    return;
  }

  if (*ht) {
    taosMemoryFree((*ht)->buckets);
    taosMemoryFree(*ht);
    (*ht) = NULL;
  }
}

int32_t vHashPut(SVHashTable* ht, void* obj) {
  if (ht == NULL || obj == NULL) {
    return TSDB_CODE_INVALID_PARA;
  }

  uint32_t bucketIndex = ht->hash(obj) % ht->numBuckets;
  for (SVHashEntry* entry = ht->buckets[bucketIndex]; entry != NULL; entry = entry->next) {
    if (ht->compare(entry->obj, obj) == 0) {
      return TSDB_CODE_DUP_KEY;
    }
  }

  if (ht->numEntries >= ht->numBuckets) {
    vHashRehash(ht, ht->numBuckets * 2);
    bucketIndex = ht->hash(obj) % ht->numBuckets;
  }

  SVHashEntry* entry = (SVHashEntry*)taosMemoryMalloc(sizeof(SVHashEntry));
  if (entry == NULL) {
    return terrno;
  }
  entry->obj = obj;
  entry->next = ht->buckets[bucketIndex];
  ht->buckets[bucketIndex] = entry;
  ht->numEntries++;

  return 0;
}

int32_t vHashGet(SVHashTable* ht, const void* obj, void** retObj) {
  if (ht == NULL || obj == NULL || retObj == NULL) {
    return TSDB_CODE_INVALID_PARA;
  }

  uint32_t bucketIndex = ht->hash(obj) % ht->numBuckets;
  for (SVHashEntry* entry = ht->buckets[bucketIndex]; entry != NULL; entry = entry->next) {
    if (ht->compare(entry->obj, obj) == 0) {
      *retObj = entry->obj;
      return 0;
    }
  }

  *retObj = NULL;
  return TSDB_CODE_NOT_FOUND;
}

int32_t vHashDrop(SVHashTable* ht, const void* obj) {
  if (ht == NULL || obj == NULL) {
    return TSDB_CODE_INVALID_PARA;
  }

  uint32_t bucketIndex = ht->hash(obj) % ht->numBuckets;
  for (SVHashEntry** entry = &ht->buckets[bucketIndex]; *entry != NULL; entry = &(*entry)->next) {
    if (ht->compare((*entry)->obj, obj) == 0) {
      SVHashEntry* tmp = *entry;
      *entry = (*entry)->next;
      taosMemoryFree(tmp);
      ht->numEntries--;
      if (ht->numBuckets > VNODE_HASH_DEFAULT_NUM_BUCKETS && ht->numEntries < ht->numBuckets / 4) {
        vHashRehash(ht, ht->numBuckets / 2);
      }
      return 0;
    }
  }

  return TSDB_CODE_NOT_FOUND;
}

1	/*
2	* Copyright (c) 2019 TAOS Data, Inc. <jhtao@taosdata.com>
3	*
4	* This program is free software: you can use, redistribute, and/or modify
5	* it under the terms of the GNU Affero General Public License, version 3
6	* or later ("AGPL"), as published by the Free Software Foundation.
7	*
8	* This program is distributed in the hope that it will be useful, but WITHOUT
9	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
10	* FITNESS FOR A PARTICULAR PURPOSE.
11	*
12	* You should have received a copy of the GNU Affero General Public License
13	* along with this program. If not, see <http://www.gnu.org/licenses/>.
14	*/
15
16	#include "vnodeHash.h"
17
18	#define VNODE_HASH_DEFAULT_NUM_BUCKETS 1024
19
20	typedef struct SVHashEntry SVHashEntry;
21
22	struct SVHashEntry {
23	SVHashEntry* next;
24	void* obj;
25	};
26
UNCOV 27	static void vHashRehash(SVHashTable* ht, uint32_t newNumBuckets) {	×
UNCOV 28	SVHashEntry newBuckets = (SVHashEntry)taosMemoryCalloc(newNumBuckets, sizeof(SVHashEntry*));	×
UNCOV 29	if (newBuckets == NULL) {	×
30	return;	×
31	}
32
UNCOV 33	for (int32_t i = 0; i < ht->numBuckets; i++) {	×
UNCOV 34	SVHashEntry* entry = ht->buckets[i];	×
UNCOV 35	while (entry != NULL) {	×
UNCOV 36	SVHashEntry* next = entry->next;	×
UNCOV 37	uint32_t bucketIndex = ht->hash(entry->obj) % newNumBuckets;	×
UNCOV 38	entry->next = newBuckets[bucketIndex];	×
UNCOV 39	newBuckets[bucketIndex] = entry;	×
UNCOV 40	entry = next;	×
41	}
42	}
43
UNCOV 44	taosMemoryFree(ht->buckets);	×
UNCOV 45	ht->buckets = newBuckets;	×
UNCOV 46	ht->numBuckets = newNumBuckets;	×
47
UNCOV 48	return;	×
49	}
50
51	int32_t vHashInit(SVHashTable** ht, uint32_t (hash)(const void), int32_t (compare)(const void, const void*)) {	8,840✔
52	if (ht == NULL \|\| hash == NULL \|\| compare == NULL) {	8,840!
53	return TSDB_CODE_INVALID_PARA;	×
54	}
55
56	(ht) = (SVHashTable)taosMemoryMalloc(sizeof(SVHashTable));	8,840✔
57	if (*ht == NULL) {	8,840!
58	return terrno;	×
59	}
60
61	(*ht)->hash = hash;	8,840✔
62	(*ht)->compare = compare;	8,840✔
63	(*ht)->numEntries = 0;	8,840✔
64	(*ht)->numBuckets = VNODE_HASH_DEFAULT_NUM_BUCKETS;	8,840✔
65	(ht)->buckets = (SVHashEntry)taosMemoryCalloc((ht)->numBuckets, sizeof(SVHashEntry*));	8,840✔
66	if ((*ht)->buckets == NULL) {	8,840!
67	taosMemoryFree(*ht);	×
68	return terrno;	×
69	}
70
71	return 0;	8,840✔
72	}
73
74	void vHashDestroy(SVHashTable** ht) {	8,840✔
75	if (ht == NULL) {	8,840!
76	return;	×
77	}
78
79	if (*ht) {	8,840!
80	taosMemoryFree((*ht)->buckets);	8,840✔
81	taosMemoryFree(*ht);	8,840✔
82	(*ht) = NULL;	8,840✔
83	}
84	}
85
86	int32_t vHashPut(SVHashTable* ht, void* obj) {	20,966✔
87	if (ht == NULL \|\| obj == NULL) {	20,966!
88	return TSDB_CODE_INVALID_PARA;	×
89	}
90
91	uint32_t bucketIndex = ht->hash(obj) % ht->numBuckets;	20,966✔
92	for (SVHashEntry* entry = ht->buckets[bucketIndex]; entry != NULL; entry = entry->next) {	20,971✔
93	if (ht->compare(entry->obj, obj) == 0) {	5!
94	return TSDB_CODE_DUP_KEY;	×
95	}
96	}
97
98	if (ht->numEntries >= ht->numBuckets) {	20,966!
UNCOV 99	vHashRehash(ht, ht->numBuckets * 2);	×
UNCOV 100	bucketIndex = ht->hash(obj) % ht->numBuckets;	×
101	}
102
103	SVHashEntry* entry = (SVHashEntry*)taosMemoryMalloc(sizeof(SVHashEntry));	20,966✔
104	if (entry == NULL) {	20,966!
UNCOV 105	return terrno;	×
106	}
107	entry->obj = obj;	20,966✔
108	entry->next = ht->buckets[bucketIndex];	20,966✔
109	ht->buckets[bucketIndex] = entry;	20,966✔
110	ht->numEntries++;	20,966✔
111
112	return 0;	20,966✔
113	}
114
115	int32_t vHashGet(SVHashTable* ht, const void* obj, void** retObj) {	41,105✔
116	if (ht == NULL \|\| obj == NULL \|\| retObj == NULL) {	41,105!
117	return TSDB_CODE_INVALID_PARA;	×
118	}
119
120	uint32_t bucketIndex = ht->hash(obj) % ht->numBuckets;	41,105✔
121	for (SVHashEntry* entry = ht->buckets[bucketIndex]; entry != NULL; entry = entry->next) {	41,124✔
122	if (ht->compare(entry->obj, obj) == 0) {	28,283✔
123	*retObj = entry->obj;	28,281✔
124	return 0;	28,281✔
125	}
126	}
127
128	*retObj = NULL;	12,841✔
129	return TSDB_CODE_NOT_FOUND;	12,841✔
130	}
131
132	int32_t vHashDrop(SVHashTable* ht, const void* obj) {	20,966✔
133	if (ht == NULL \|\| obj == NULL) {	20,966!
134	return TSDB_CODE_INVALID_PARA;	×
135	}
136
137	uint32_t bucketIndex = ht->hash(obj) % ht->numBuckets;	20,966✔
138	for (SVHashEntry** entry = &ht->buckets[bucketIndex]; entry != NULL; entry = &(entry)->next) {	20,969!
139	if (ht->compare((*entry)->obj, obj) == 0) {	20,969✔
140	SVHashEntry* tmp = *entry;	20,966✔
141	entry = (entry)->next;	20,966✔
142	taosMemoryFree(tmp);	20,966✔
143	ht->numEntries--;	20,966✔
144	if (ht->numBuckets > VNODE_HASH_DEFAULT_NUM_BUCKETS && ht->numEntries < ht->numBuckets / 4) {	20,966!
UNCOV 145	vHashRehash(ht, ht->numBuckets / 2);	×
146	}
147	return 0;	20,966✔
148	}
149	}
150
UNCOV 151	return TSDB_CODE_NOT_FOUND;	×
152	}

taosdata / TDengine / #3533

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous