Use list_next_entry() and list_prev_entry().

Signed-off-by: Sergei Zviagintsev <[email protected]>
---
 ipc/kdbus/pool.c | 6 ++----
 1 file changed, 2 insertions(+), 4 deletions(-)

diff --git a/ipc/kdbus/pool.c b/ipc/kdbus/pool.c
index c26ef963d8d1..cb692a35755b 100644
--- a/ipc/kdbus/pool.c
+++ b/ipc/kdbus/pool.c
@@ -287,8 +287,7 @@ static void __kdbus_pool_slice_release(struct 
kdbus_pool_slice *slice)
        if (!list_is_last(&slice->entry, &pool->slices)) {
                struct kdbus_pool_slice *s;
 
-               s = list_entry(slice->entry.next,
-                              struct kdbus_pool_slice, entry);
+               s = list_next_entry(slice, entry);
                if (s->free) {
                        rb_erase(&s->rb_node, &pool->slices_free);
                        list_del(&s->entry);
@@ -301,8 +300,7 @@ static void __kdbus_pool_slice_release(struct 
kdbus_pool_slice *slice)
        if (pool->slices.next != &slice->entry) {
                struct kdbus_pool_slice *s;
 
-               s = list_entry(slice->entry.prev,
-                              struct kdbus_pool_slice, entry);
+               s = list_prev_entry(slice, entry);
                if (s->free) {
                        /*
                         * As size of slice increases after merge and free
-- 
1.8.3.1

--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

Reply via email to