libhl

libhl copied to clipboard

The lock-free circular queue currently requires one extra page in its internal ringbuffer to work properly

2

The number of successfully read from rqueue sometimes less than the number of successfully write to rqueue. Here is the test code. https://gist.github.com/mingpepe/9d6ec5f17bdb60094d7fc980df3437ce But i am not found the bug...

mingpepe

ht_foreach_value return remove, will lose item

2

ht_create(65536, 65536, NULL); TEST_1 remove all item: add 100000 item to hashtable, before ht_foreach_value, ht_count() is 100000 then ht_foreach_value. in callback function return HT_ITERATOR_REMOVE, record entry callback function count is...

cxm1997

The original code [`int rc = ht_delete(graph->nodes, node->label, strlen(node->label), (void **)&node, NULL);` ](https://github.com/xant/libhl/blob/master/src/graph.c#L91) dereferences the NULL pointer, this results in a segment fault.

marsCatXdu