Improved file map tracking, and use file map info in dynarec for bigblock setting

2 files changed, 11 insertions, 0 deletions

diff --git a/src/include/env.h b/src/include/env.h
index 0503b413..1b7f2130 100644
--- a/src/include/env.h
+++ b/src/include/env.h
@@ -205,5 +205,6 @@ void PrintEnvVariables(box64env_t* env, int level);
 void RecordEnvMappings(uintptr_t addr, size_t length, int fd);
 void RemoveMapping(uintptr_t addr, size_t length);
 box64env_t* GetCurEnvByAddr(uintptr_t addr);
+int IsAddrFileMapped(uintptr_t addr);
 
 #endif // __ENV_H
diff --git a/src/include/rbtree.h b/src/include/rbtree.h
index 83eddb78..0d267fde 100644
--- a/src/include/rbtree.h
+++ b/src/include/rbtree.h
@@ -250,4 +250,14 @@ int rb_unset(rbtree_t* tree, uintptr_t start, uintptr_t end);
  */
 uintptr_t rb_get_righter(rbtree_t* tree);
 
+/**
+ * rb_get_lefter() - Retrieves the start value of the left-most node in a red-black tree.
+ * @tree: Pointer to the red-black tree whose left-most node's start value is to be retrieved.
+ *
+ * This function traverses the red-black tree from the root to the left-most node, which is the node
+ * with the lowest key value in the tree. 
+ * Return: The start value of the left-most node if the tree is not empty; otherwise, 0.
+ */
+uintptr_t rb_get_lefter(rbtree_t* tree);
+
 #endif // RBTREE_H