Add words on how free and busy slices trees are sorted. Signed-off-by: Sergei Zviagintsev <ser...@s15v.net> --- ipc/kdbus/pool.c | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/ipc/kdbus/pool.c b/ipc/kdbus/pool.c index 0433e26b777e..84afe96fbc22 100644 --- a/ipc/kdbus/pool.c +++ b/ipc/kdbus/pool.c @@ -38,8 +38,8 @@ * @accounted_size: Currently accounted memory in bytes * @lock: Pool data lock * @slices: All slices sorted by address - * @slices_busy: Tree of allocated slices - * @slices_free: Tree of free slices + * @slices_busy: Tree of allocated slices, sorted by slice offset + * @slices_free: Tree of free slices, sorted by slice size * * The receiver's buffer, managed as a pool of allocated and free * slices containing the queued messages. -- 1.8.3.1 -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
