On Thu, Jul 04, 2024 at 02:24:44PM +0800, Xavier wrote: > The process of constructing scheduling domains > involves multiple loops and repeated evaluations, leading to numerous > redundant and ineffective assessments that impact code efficiency. > > Here, we use union-find to optimize the merging of cpumasks. By employing > path compression and union by rank, we effectively reduce the number of > lookups and merge comparisons. > > Signed-off-by: Xavier <xavier_qy@xxxxxxx> Applied to cgroup/for-6.12. Thanks. -- tejun
