Home
last modified time | relevance | path

Searched refs:BUCKET_A (Results 1 – 3 of 3) sorted by relevance

/freebsd/contrib/libdivsufsort/lib/
H A Ddivsufsort.c62 do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1)); in sort_typeBstar()
82 t = i + BUCKET_A(c0); in sort_typeBstar()
83 BUCKET_A(c0) = i + j; /* start point */ in sort_typeBstar()
174 i = BUCKET_A(c0 + 1) - 1; in sort_typeBstar()
208 j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1; in construct_SA()
234 k = SA + BUCKET_A(c2 = T[n - 1]); in construct_SA()
243 BUCKET_A(c2) = k - SA; in construct_SA()
244 k = SA + BUCKET_A(c2 = c0); in construct_SA()
272 j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1; in construct_BWT()
301 k = SA + BUCKET_A(c2 = T[n - 1]); in construct_BWT()
[all …]
/freebsd/sys/contrib/zstd/lib/dictBuilder/
H A Ddivsufsort.c128 #define BUCKET_A(_c0) bucket_A[(_c0)] macro
1465 do { ++BUCKET_A(c1 = c0); } while((0 <= --i) && ((c0 = T[i]) >= c1)); in sort_typeBstar()
1485 t = i + BUCKET_A(c0); in sort_typeBstar()
1486 BUCKET_A(c0) = i + j; /* start point */ in sort_typeBstar()
1592 i = BUCKET_A(c0 + 1) - 1; in sort_typeBstar()
1626 j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1; in construct_SA()
1652 k = SA + BUCKET_A(c2 = T[n - 1]); in construct_SA()
1661 BUCKET_A(c2) = k - SA; in construct_SA()
1662 k = SA + BUCKET_A(c2 = c0); in construct_SA()
1690 j = SA + BUCKET_A(c1 + 1) - 1, k = NULL, c2 = -1; in construct_BWT()
[all …]
/freebsd/contrib/libdivsufsort/include/
H A Ddivsufsort_private.h181 #define BUCKET_A(_c0) bucket_A[(_c0)] macro