On 06/02/23 21:09, Jakub Kicinski wrote: > On Fri, 20 Jan 2023 20:24:30 -0800 Yury Norov wrote: >> The function finds Nth set CPU in a given cpumask starting from a given >> node. >> >> Leveraging the fact that each hop in sched_domains_numa_masks includes the >> same or greater number of CPUs than the previous one, we can use binary >> search on hops instead of linear walk, which makes the overall complexity >> of O(log n) in terms of number of cpumask_weight() calls. > > Valentin, would you be willing to give us a SoB or Review tag for > this one? We'd like to take the whole series via networking, if > that's okay. Sure, feel free to add Reviewed-by: Valentin Schneider <vschneid@xxxxxxxxxx> to patches that don't already have it.
