findNode() — netty Function Reference

Architecture documentation for the findNode() function in ConcurrentSkipListIntObjMultimap.java from the netty codebase.

Function java CommonUtil Concurrent calls 3 called by 1

Entity Profile

CommonUtil→ Concurrent→ findNode() — netty Function Reference

Dependency Diagram

graph TD
  e6377398_2342_36cb_6b52_ad257316c9a9["findNode()"]
  d9a8da36_aab9_ab33_dc67_870b34dcd270["ConcurrentSkipListIntObjMultimap"]
  e6377398_2342_36cb_6b52_ad257316c9a9 -->|defined in| d9a8da36_aab9_ab33_dc67_870b34dcd270
  0fbf9d08_a59a_4f48_733f_5eff8a8ca4ec["replace()"]
  0fbf9d08_a59a_4f48_733f_5eff8a8ca4ec -->|calls| e6377398_2342_36cb_6b52_ad257316c9a9
  ff16b6d0_47d8_82e1_a033_998f1f35233f["findPredecessor()"]
  e6377398_2342_36cb_6b52_ad257316c9a9 -->|calls| ff16b6d0_47d8_82e1_a033_998f1f35233f
  14308445_2437_e26b_41bb_c7458d3b14e0["unlinkNode()"]
  e6377398_2342_36cb_6b52_ad257316c9a9 -->|calls| 14308445_2437_e26b_41bb_c7458d3b14e0
  7e2d9d49_a28d_4cbe_a83c_2187034997b4["cpr()"]
  e6377398_2342_36cb_6b52_ad257316c9a9 -->|calls| 7e2d9d49_a28d_4cbe_a83c_2187034997b4
  style e6377398_2342_36cb_6b52_ad257316c9a9 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

common/src/main/java/io/netty/util/concurrent/ConcurrentSkipListIntObjMultimap.java lines 508–532

    private Node<V> findNode(int key) {
        if (key == noKey) {
            throw new IllegalArgumentException(); // don't postpone errors
        }
        Node<V> b;
        outer: while ((b = findPredecessor(key)) != null) {
            for (;;) {
                Node<V> n; int k; int c;
                if ((n = b.next) == null) {
                    break outer;               // empty
                } else if ((k = n.key) == noKey) {
                    break;                     // b is deleted
                } else if (n.val == null) {
                    unlinkNode(b, n, noKey);   // n is deleted
                } else if ((c = cpr(key, k)) > 0) {
                    b = n;
                } else if (c == 0) {
                    return n;
                } else {
                    break outer;
                }
            }
        }
        return null;
    }