On Tue, 2026-06-30 at 10:31 -0700, Richard Henderson wrote: > > 6 files changed, 118 insertions(+), 45 deletions(-) > > I think it would be better to use IntervalTree, so that we don't have > to keep that second > tree of pages. Obviously, IntervalTree can query an interval, which > takes care of > querying for entries within a page. > > > r~
As per my initial understanding of Interval trees, The primary goal of them would be store intervals, and then query with point/intervals. But current usecase is storing points and querring with intervals? maybe i can be wrong with this idea. Maybe i can just use cpu->breakpoint tree to find out page match, with using lower_bound on the `pc & TARGET_PAGE_MASK` and find if the bp->pc < (pc & TARGET_PAGE_MASK + PAGESIZE)? ~Shivang.
