findLast() — netty Function Reference

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

Function java CommonUtil Concurrent calls 2 called by 2

Entity Profile

CommonUtil→ Concurrent→ findLast() — netty Function Reference

Dependency Diagram

graph TD
  47683aca_9858_9b43_8dd1_e652990cba37["findLast()"]
  d9a8da36_aab9_ab33_dc67_870b34dcd270["ConcurrentSkipListIntObjMultimap"]
  47683aca_9858_9b43_8dd1_e652990cba37 -->|defined in| d9a8da36_aab9_ab33_dc67_870b34dcd270
  aec4dc88_2ef9_2534_8c09_6f2a2a5a40ea["findLastEntry()"]
  aec4dc88_2ef9_2534_8c09_6f2a2a5a40ea -->|calls| 47683aca_9858_9b43_8dd1_e652990cba37
  0c1c6745_4690_6c23_b433_12dc7299832f["lastKey()"]
  0c1c6745_4690_6c23_b433_12dc7299832f -->|calls| 47683aca_9858_9b43_8dd1_e652990cba37
  acca47c3_12ae_23bb_59d5_d6000a11335e["acquireFence()"]
  47683aca_9858_9b43_8dd1_e652990cba37 -->|calls| acca47c3_12ae_23bb_59d5_d6000a11335e
  14308445_2437_e26b_41bb_c7458d3b14e0["unlinkNode()"]
  47683aca_9858_9b43_8dd1_e652990cba37 -->|calls| 14308445_2437_e26b_41bb_c7458d3b14e0
  style 47683aca_9858_9b43_8dd1_e652990cba37 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

common/src/main/java/io/netty/util/concurrent/ConcurrentSkipListIntObjMultimap.java lines 896–939

    final Node<V> findLast() {
        outer: for (;;) {
            Index<V> q; Node<V> b;
            acquireFence();
            if ((q = head) == null) {
                break;
            }
            for (Index<V> r, d;;) {
                while ((r = q.right) != null) {
                    Node<V> p;
                    if ((p = r.node) == null || p.val == null) {
                        RIGHT.compareAndSet(q, r, r.right);
                    } else {
                        q = r;
                    }
                }
                if ((d = q.down) != null) {
                    q = d;
                } else {
                    b = q.node;
                    break;
                }
            }
            if (b != null) {
                for (;;) {
                    Node<V> n;
                    if ((n = b.next) == null) {
                        if (b.key == noKey) { // empty
                            break outer;
                        } else {
                            return b;
                        }
                    } else if (n.key == noKey) {
                        break;
                    } else if (n.val == null) {
                        unlinkNode(b, n, noKey);
                    } else {
                        b = n;
                    }
                }
            }
        }
        return null;
    }