ssFixdown() — netty Function Reference

Architecture documentation for the ssFixdown() function in Bzip2DivSufSort.java from the netty codebase.

Function java Buffer Allocators called by 1

Entity Profile

Buffer→ Allocators→ ssFixdown() — netty Function Reference

Dependency Diagram

graph TD
  714c6073_5359_c901_e325_0408748a36a1["ssFixdown()"]
  5a60cb70_bf06_95bf_9c73_ed3a4dc24eba["Bzip2DivSufSort"]
  714c6073_5359_c901_e325_0408748a36a1 -->|defined in| 5a60cb70_bf06_95bf_9c73_ed3a4dc24eba
  d34a90df_0d9e_75f0_92a2_6d656258f8df["ssHeapSort()"]
  d34a90df_0d9e_75f0_92a2_6d656258f8df -->|calls| 714c6073_5359_c901_e325_0408748a36a1
  style 714c6073_5359_c901_e325_0408748a36a1 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

codec-compression/src/main/java/io/netty/handler/codec/compression/Bzip2DivSufSort.java lines 142–161

    private void ssFixdown(int td, int pa, int sa, int i, int size) {
        final int[] SA = this.SA;
        final byte[] T = this.T;

        int j, k;
        int v;
        int c, d, e;

        for (v = SA[sa + i], c = T[td + SA[pa + v]] & 0xff; (j = 2 * i + 1) < size; SA[sa + i] = SA[sa + k], i = k) {
            d = T[td + SA[pa + SA[sa + (k = j++)]]] & 0xff;
            if (d < (e = T[td + SA[pa + SA[sa + j]]] & 0xff)) {
                k = j;
                d = e;
            }
            if (d <= c) {
                break;
            }
        }
        SA[sa + i] = v;
    }