> @@ -57,6 +59,9 @@ static int saved_value_cmp(struct rb_node *rb_node, const > void *entry) > if (a->ctx != b->ctx) > return a->ctx - b->ctx; > > + if (a->cgrp != b->cgrp) > + return (char *)a->cgrp < (char *)b->cgrp ? -1 : +1;
This means the sort order will depend on heap randomization, which will make it harder to debug. Better use something stable like the inode number of the cgroup. Do we have the same problem with other filters? The rest of the patch looks good to me. -Andi
