trSort() — netty Function Reference

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

Function java Buffer Allocators calls 4 called by 1

Entity Profile

Buffer→ Allocators→ trSort() — netty Function Reference

Dependency Diagram

graph TD
  0800d61f_d4b4_d698_736e_dd03b4e4c519["trSort()"]
  5a60cb70_bf06_95bf_9c73_ed3a4dc24eba["Bzip2DivSufSort"]
  0800d61f_d4b4_d698_736e_dd03b4e4c519 -->|defined in| 5a60cb70_bf06_95bf_9c73_ed3a4dc24eba
  d73c676c_466b_db84_289f_f07769f8f60c["sortTypeBstar()"]
  d73c676c_466b_db84_289f_f07769f8f60c -->|calls| 0800d61f_d4b4_d698_736e_dd03b4e4c519
  ab86c1c3_9c98_276f_d59f_e8ab65ab24f3["TRBudget()"]
  0800d61f_d4b4_d698_736e_dd03b4e4c519 -->|calls| ab86c1c3_9c98_276f_d59f_e8ab65ab24f3
  4c249bdc_e1de_688c_e0ef_eef3cf5d1d8e["trLog()"]
  0800d61f_d4b4_d698_736e_dd03b4e4c519 -->|calls| 4c249bdc_e1de_688c_e0ef_eef3cf5d1d8e
  3a0e84e1_ef8e_7654_d7c8_b99b9f0abfe8["trIntroSort()"]
  0800d61f_d4b4_d698_736e_dd03b4e4c519 -->|calls| 3a0e84e1_ef8e_7654_d7c8_b99b9f0abfe8
  3d921cb0_f13e_75a1_dd66_01c31c095e3a["lsSort()"]
  0800d61f_d4b4_d698_736e_dd03b4e4c519 -->|calls| 3d921cb0_f13e_75a1_dd66_01c31c095e3a
  style 0800d61f_d4b4_d698_736e_dd03b4e4c519 fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

codec-compression/src/main/java/io/netty/handler/codec/compression/Bzip2DivSufSort.java lines 1823–1851

    private void trSort(final int isa, final int n, final int depth) {
        final int[] SA = this.SA;

        int first = 0, last;
        int t;

        if (-n < SA[0]) {
            TRBudget budget = new TRBudget(n, trLog(n) * 2 / 3 + 1);
            do {
                if ((t = SA[first]) < 0) {
                    first -= t;
                } else {
                    last = SA[isa + t] + 1;
                    if (1 < last - first) {
                        trIntroSort(isa, isa + depth, isa + n, first, last, budget, n);
                        if (budget.chance == 0) {
                            /* Switch to Larsson-Sadakane sorting algorithm */
                            if (0 < first) {
                                SA[0] = -first;
                            }
                            lsSort(isa, n, depth);
                            break;
                        }
                    }
                    first = last;
                }
            } while (first < n);
        }
    }