net/mlx4: use rb_entry()

To make the code clearer, use rb_entry() instead of container_of() to
deal with rbtree.

Signed-off-by: Geliang Tang <geliangtang@gmail.com>
Reviewed-by: Leon Romanovsky <leonro@mellanox.com>
Signed-off-by: David S. Miller <davem@davemloft.net>

diff --git a/drivers/net/ethernet/mellanox/mlx4/resource_tracker.c b/drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
index 1822382212eed5d77fb290598fbe2d0834480aa9..6da6e01d07bd83462d9db0b2ff722e65747cd4d5 100644 (file)
--- a/drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
+++ b/drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
@@ -236,8 +236,8 @@ static void *res_tracker_lookup(struct rb_root *root, u64 res_id)
        struct rb_node *node = root->rb_node;
 
        while (node) {
-               struct res_common *res = container_of(node, struct res_common,
-                                                     node);
+               struct res_common *res = rb_entry(node, struct res_common,
+                                                 node);
 
                if (res_id < res->res_id)
                        node = node->rb_left;
@@ -255,8 +255,8 @@ static int res_tracker_insert(struct rb_root *root, struct res_common *res)
 
        /* Figure out where to put new node */
        while (*new) {
-               struct res_common *this = container_of(*new, struct res_common,
-                                                      node);
+               struct res_common *this = rb_entry(*new, struct res_common,
+                                                  node);
 
                parent = *new;
                if (res->res_id < this->res_id)