summaryrefslogtreecommitdiff
path: root/ctdb/common/rb_tree.c
Commit message (Expand)AuthorAgeFilesLines
* ctdb-common: Use #ifdef to avoid TEST_RB_TREE not definedMartin Schwenke2019-06-051-2/+2
* Correct "occured" typos.Chris Lamb2017-02-221-1/+1
* ctdb-common: Fix CID 1125585 Dereference after null check (FORWARD_NULL)Martin Schwenke2016-08-081-1/+1
* ctdb-common: Fix CID 1125583 Dereference after null check (FORWARD_NULL)Martin Schwenke2016-08-081-1/+1
* ctdb-common: Fix CID 1125581 Dereference after null check (FORWARD_NULL)Martin Schwenke2016-08-081-1/+1
* ctdb-common: Replace ctdb_logging.h with common/logging.hAmitay Isaacs2015-11-161-2/+2
* Fix various spelling errorsMathieu Parent2015-11-061-3/+3
* ctdb-daemon: Remove dependency on includes.hAmitay Isaacs2015-10-301-1/+7
* server: Replace BOOL datatype with bool, True/False with true/falseAmitay Isaacs2012-05-281-3/+3
* rb_tree: fix possible access-after-free-error in trbt_traversearray32_nodeMichael Adam2011-12-231-4/+7
* RB_TREE: Add mechanism to abort a traverseRonnie Sahlberg2011-11-081-17/+36
* merge from ronnieAndrew Tridgell2008-02-041-1/+1
* add a function to return the first entry that is stored in a tree where Ronnie Sahlberg2007-08-151-0/+37
* change the mem hierarchy for trees. let the node be owned by the data Ronnie Sahlberg2007-08-091-63/+154
* remove an unused functionRonnie Sahlberg2007-08-091-10/+0
* add helpers to traverse a tree where the key is an array of uint32Ronnie Sahlberg2007-08-081-0/+50
* add helpers to add/lookup/delete nodes in a tree where the key is an Ronnie Sahlberg2007-08-081-0/+119
* add a tree insert function that takes a callback fucntion to populate Ronnie Sahlberg2007-08-081-8/+75
* when inserting data in the tree, if there was already a node with the Ronnie Sahlberg2007-08-081-6/+14
* fix the remaining bugs with tree delete that testing found.Ronnie Sahlberg2007-07-301-5/+50
* remove dead codeRonnie Sahlberg2007-07-261-2/+0
* fix some remaining bugs with deleting nodesRonnie Sahlberg2007-07-261-55/+118
* there were situations where we were not guaranteed that a sibling had 2 Ronnie Sahlberg2007-07-251-35/+46
* if sibling is NULL it is a leaf node and thus black.Ronnie Sahlberg2007-07-251-2/+3
* initial version of talloc based red-black treesRonnie Sahlberg2007-07-241-0/+593