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

Signed-off-by: Geliang Tang <geliangt...@gmail.com>
---
 net/6lowpan/nhc.c | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/net/6lowpan/nhc.c b/net/6lowpan/nhc.c
index 7008d53..4fa2fdd 100644
--- a/net/6lowpan/nhc.c
+++ b/net/6lowpan/nhc.c
@@ -27,8 +27,8 @@ static int lowpan_nhc_insert(struct lowpan_nhc *nhc)
 
        /* Figure out where to put new node */
        while (*new) {
-               struct lowpan_nhc *this = container_of(*new, struct lowpan_nhc,
-                                                      node);
+               struct lowpan_nhc *this = rb_entry(*new, struct lowpan_nhc,
+                                                  node);
                int result, len_dif, len;
 
                len_dif = nhc->idlen - this->idlen;
@@ -69,8 +69,8 @@ static struct lowpan_nhc *lowpan_nhc_by_nhcid(const struct 
sk_buff *skb)
        const u8 *nhcid_skb_ptr = skb->data;
 
        while (node) {
-               struct lowpan_nhc *nhc = container_of(node, struct lowpan_nhc,
-                                                     node);
+               struct lowpan_nhc *nhc = rb_entry(node, struct lowpan_nhc,
+                                                 node);
                u8 nhcid_skb_ptr_masked[LOWPAN_NHC_MAX_ID_LEN];
                int result, i;
 
-- 
2.9.3

Reply via email to