Refactor and optimize IOMT DB code

Removed the copy-pasta that was the SQL generation code, replaced with a
much cleaner interface (albeit one that lacks bounds checks on strings).

Also replaced old linear search for finding a leaf node with a database
query.

1 files changed, 1 insertions, 0 deletions

diff --git a/iomt.h b/iomt.h
index a28b670..7dfd619 100644
--- a/iomt.h
+++ b/iomt.h
@@ -41,6 +41,7 @@ struct iomt {
 
             sqlite3_stmt *getnode, *updatenode, *insertnode;
             sqlite3_stmt *getleaf, *updateleaf, *insertleaf;
+            sqlite3_stmt *findleaf, *findencloser, *findleaf_or_encloser;
         } db;
         struct {
             hash_t *mt_nodes; /* this has 2 * mt_leafcount - 1 elements. Note