Almost a clean copy & paste from the previous implementation.
return NULL;
}
+
+/*
+ * Search the index for a key
+ *
+ * Returns the value of the first match
+ *
+ * The recursive functions free their node argument (using index_close).
+ */
+char *index_mm_search(struct index_mm *idx, const char *key)
+{
+ struct index_mm_node *root;
+ char *value;
+
+ root = index_mm_readroot(idx);
+ value = index_mm_search_node(root, key, 0);
+
+ return value;
+}
struct index_mm;
struct index_mm *index_mm_open(struct kmod_ctx *ctx, const char *filename);
void index_mm_close(struct index_mm *index);
+char *index_mm_search(struct index_mm *idx, const char *key);
#endif