- Jul 15, 2019
-
-
Don't search for scopes of entries with no children
-
- Jan 14, 2019
-
-
Quanah Gibson-Mount authored
-
- Mar 22, 2018
-
-
Quanah Gibson-Mount authored
-
- Jan 03, 2017
-
-
Quanah Gibson-Mount authored
-
- Jan 29, 2016
-
-
Quanah Gibson-Mount authored
-
- Jul 28, 2015
-
-
- Apr 17, 2015
-
-
- Feb 11, 2015
-
-
Quanah Gibson-Mount authored
-
- Jan 27, 2015
-
-
Remove assert. This is merely a cache of parent DNs, failure to insert doesn't affect outcome.
-
- Jan 05, 2015
-
-
dn2id.c: + assertion for mdb_id2l_insert() result; - unnecessary assignment; search.c: - unused variable 'first'; + range-check for mdb_idl_search() result;
-
- Dec 10, 2014
-
-
heap corruption due to returning a reference to a local variable
-
- Aug 29, 2014
-
-
Check for duplicate scopes in search_aliases, not later.
-
This reverts commit cac00c6a.
-
- Aug 27, 2014
-
-
Aliases pointing within the original search scope could cause the same entry to be returned multiple times. Check for subtree scope and duplicate scopes.
-
- May 29, 2014
-
-
Better check for missing IDs
-
mdb_idscopes was remembering the IDs of every entry it checked; it should only have been saving the IDs of entries that were actually in the search scope. The extra entries filled the scopes array, causing a loop searching for a parent entry that was never inserted.
-
- Jan 25, 2014
-
-
Kurt Zeilenga authored
-
- Oct 08, 2013
-
-
- May 24, 2013
-
-
- May 10, 2013
-
-
- Jan 30, 2013
-
-
uninit'd size in dn2id_walk, bogus pagedresults
-
- Jan 27, 2013
-
-
Non-recursive tree walker.
-
-
This is only a 10% gain, but still worth having for now.
-
- Jan 14, 2013
-
-
Quanah Gibson-Mount authored
-
- Jul 26, 2012
-
-
- Jun 22, 2012
-
-
- Apr 09, 2012
-
-
- Jan 20, 2012
-
-
- Nov 10, 2011
-
-
- Nov 04, 2011
-
-
So they can be reused, and avoid unnecessary page_searches
-
-
-
Tighten up entry_alloc/entry_decode Track parent nodes in idscopes
-
Also do not cast between berval and MDB_val. That breaks when sizeof(berval.bv_len) != sizeof(MDB_val.mv_size).
-
-
-