Recursive btree traversal test case Add an unlink page command to the dbtest program. This dbtest command finds a page that has both a left and a right neighbor and unlinks it, making it inaccessible to conventional sequential traversal. This simulates some btree corruption that has been seen in the field. Unlike the bttest command, the dbtest unlink command always searches for a leaf page with both a left and a right sibling, and doesn't allow the user to specify internal pages or a specific page number. Add a new dbtest command to recursively dump a btree database. Add a new test case to run.test that uses these new commands to verify the correct functioning of the recursive btree traversal options. https://github.com/krb5/krb5/commit/b88630244995b5a8c7aee29240ced957cf8d7fdb Author: Tom Yu Commit: b88630244995b5a8c7aee29240ced957cf8d7fdb Branch: master src/plugins/kdb/db2/libdb2/test/dbtest.c | 84 +++++++++++++++++++++++++++--- src/plugins/kdb/db2/libdb2/test/run.test | 43 ++++++++++++++- 2 files changed, 118 insertions(+), 9 deletions(-)