REV32:     "REV32",
	REV64:     "REV64",
	ROR:       "ROR",
	RORV:      "RORV",
	RSHRN:     "RSHRN",
	RSHRN2:    "RSHRN2",
	RSUBHN:    "RSUBHN",
	RSUBHN2:   "RSUBHN2",
	SABA:      "SABA",
	SABAL:     "SABAL",
	SABAL2:    "SABAL2",
	SABD:      "SABD",
	SABDL:     "SABDL",
	SABDL2:    "SABDL2",
	SADALP:    "SADALP",
	SADDL:     "SADDL",
	SADDL2:    "SADDL2",
	SADDLP:    "SADDLP",

{"Name":"SABA","Bits":"0|Q|0|0|1|1|1|0|size:2|1|Rm:5|0|1|1|1|1|1|Rn:5|Rd:5","Arch":"Three registers of the same type variant","Syntax":"SABA <Vd>.<T>, <Vn>.<T>, <Vm>.<T>","Code":"","Alias":""},

  /** see {@link WorkerRunningState} */
  @LazyInit
  @GuardedBy("queue")
  private WorkerRunningState workerRunningState = IDLE;

  /**
   * This counter prevents an ABA issue where a thread may successfully schedule the worker, the
   * worker runs and exhausts the queue, another thread enqueues a task and fails to schedule the

  /** see {@link WorkerRunningState} */
  @LazyInit
  @GuardedBy("queue")
  private WorkerRunningState workerRunningState = IDLE;

  /**
   * This counter prevents an ABA issue where a thread may successfully schedule the worker, the
   * worker runs and exhausts the queue, another thread enqueues a task and fails to schedule the

E	(a|b)*c|(a|ab)*c		abc	(0,3)(1,2)
E	(a|b)*c|(a|ab)*c		xc	(1,2)
E	(.a|.b).*|.*(.a|.b)		xa	(0,2)(0,2)
E	a?(ab|ba)ab			abab	(0,4)(0,2)
E	a?(ac{0}b|ba)ab			abab	(0,4)(0,2)
E	ab|abab				abbabab	(0,2)
E	aba|bab|bba			baaabbbaba	(5,8)
E	aba|bab				baaabbbaba	(6,9)
E	(aa|aaa)*|(a|aaaaa)		aa	(0,2)(0,2)
E	(a.|.a.)*|(a|.a...)		aa	(0,2)(0,2)
E	ab|a				xabc	(1,3)
E	ab|a				xxabc	(2,4)
Ei	(Ab|cD)*			aBcD	(0,4)(2,4)
BE	[^-]			--a		(2,3)

                    return new SampleElements<>(
                        mapEntry("a", 1),
                        mapEntry("aa", 2),
                        mapEntry("aba", 3),
                        mapEntry("bbbb", 4),
                        mapEntry("ccccc", 5));
                  }

                  @Override

func test(t *testing.T, build func([]byte) []int) {
	t.Run("ababab...", func(t *testing.T) {
		// Very repetitive input has numLMS = len(x)/2-1
		// at top level, the largest it can be.
		// But maxID is only two (aba and ab$).
		size := 100000
		if testing.Short() {
			size = 10000
		}
		x := make([]byte, size)
		for i := range x {
			x[i] = "ab"[i%2]
		}
		testSA(t, x, build)
	})

// time of the first discarded write. The high 32 bits of 'overflow'
// increment each time the low 32 bits transition from zero to non-zero
// or vice versa. This sequence number avoids ABA problems in the use of
// compare-and-swap to coordinate between reader and writer.
// The overflowTime is only written when the low 32 bits of overflow are
// zero, that is, only when there is no pending overflow entry, in

// assignID_8_32 assigns a dense ID numbering to the
// set of LMS-substrings respecting string ordering and equality,
// returning the maximum assigned ID.
// For example given the input "ababab", the LMS-substrings
// are "aba", "aba", and "ab", renumbered as 2 2 1.
// sa[len(sa)-numLMS:] holds the LMS-substring indexes
// sorted in string order, so to assign numbers we can
// consider each in turn, removing adjacent duplicates.

	// accessed atomically.
	owned atomic.Uint32
}

// allDloggers is a list of all dloggers, linked through
// dlogger.allLink. This is accessed atomically. This is prepend only,
// so it doesn't need to protect against ABA races.
var allDloggers *dlogger

//go:nosplit
func (l *dlogger) end() {
	if !dlogEnabled {
		return
	}

	// Fill in framing header.
	size := l.w.write - l.w.r.end