How to implement the “latch” function used by the search function in this T-link-tree paper?

Question

From this paper, Tlink-tree: Main memory index structure with concurrency control and recovery by Jan Lindström, we have the following algorithm shown: