Re: [PATCH] rust_binder: speed up get_node_debug_info using lower_bound iter

Hi Greg and Alice,

On Tue, Jul 28, 2026 at 6:54 AM Greg KH <[email protected]> wrote:
>
> On Mon, Jul 27, 2026 at 10:03:21PM -0300, Rafael Passos wrote:
> > Finding the next node in the RBTree can be done more efficiently using
> > the cursor_lower_bound, as it reduces cost from O(n) to O(log n).
> >
> > Link: https://github.com/Rust-for-Linux/linux/issues/1249
> > Suggested-by: Alice Ryhl <[email protected]>
> > Signed-off-by: Rafael Passos <[email protected]>
> > ---
>
> Does this actually speed anything up in the binder benchmark tools?

I want to run these benchmarks! I searched and this "Performance testing"
page [1] in android docs was the closest match. Am I correct?

I'm learning more about binder, watching the talks, reading posts etc.
It's really interesting. Any recommendations on how to run in VMs and in
Hardware ? Is the Cuttlefish emulator the recommended setup ?

On Tue Jul 28, 2026 at 2:47 AM -03, Alice Ryhl wrote:
> I don't think I got the email for this patch?

Sorry for the confusion. I had to send it twice because I missed the
list in the first email. The second send is in lore [2].
I will send a v2 with suggestions. This message might reach both
threads (if I manipulated the headers correctly ;P)

[1] Android Performance testing https://source.android.com/docs/core/tests/vts/performance
[2] patch resend https://lore.kernel.org/rust-for-linux/[email protected]/T/#t

Thanks,
Rafael Passos