Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Use malloc'd memory, stored persistently in thread-local storage.

Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

So they can be reused, and avoid unnecessary page_searches

Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Well, just like in back-bdb in 2005, it only slowed things down
on larger LDIFs.

Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Nested txn stuff which we don't use.

Hallvard Furuseth authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Parenthesize macros.  Microoptimize IDL search.  Use RANGE_<FIRST/LAST>
when IDL is known to be a range.

Hallvard Furuseth authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Do not access a size_t via an unsigned long pointer, an MDB_val via a
berval pointer, or the inverse. Instead copy into the proper data types.

Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Don't truncate all indices if specific indices were given.

Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Tighten up entry_alloc/entry_decode
Track parent nodes in idscopes

Howard Chu authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Keep entries word-aligned. Yields ~10% speedup, but also 10% more space used.
May revert this if the space cost is unacceptable.

Conflicts:

	servers/slapd/bconfig.c

Hallvard Furuseth authored 13 years ago and Quanah Gibson-Mount committed 13 years ago

Also do not cast between berval and MDB_val.  That breaks when
sizeof(berval.bv_len) != sizeof(MDB_val.mv_size).