#if (SS_BLOCKSIZE == 0) || (SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE)
-static inline
+static forceinline
int
ss_ilg(int n) {
#if SS_BLOCKSIZE == 0
247, 248, 248, 249, 249, 250, 250, 251, 251, 252, 252, 253, 253, 254, 254, 255
};
-static inline
+static forceinline
int
ss_isqrt(int x) {
int y, e;
/*---------------------------------------------------------------------------*/
/* Compares two suffixes. */
-static inline
+static forceinline
int
ss_compare(const unsigned char *T,
const int *p1, const int *p2,
#if (SS_BLOCKSIZE == 0) || (SS_INSERTIONSORT_THRESHOLD < SS_BLOCKSIZE)
-static inline
+static forceinline
void
ss_fixdown(const unsigned char *Td, const int *PA,
int *SA, int i, int size) {
/*---------------------------------------------------------------------------*/
/* Returns the median of three elements. */
-static inline
+static forceinline
int *
ss_median3(const unsigned char *Td, const int *PA,
int *v1, int *v2, int *v3) {
}
/* Returns the median of five elements. */
-static inline
+static forceinline
int *
ss_median5(const unsigned char *Td, const int *PA,
int *v1, int *v2, int *v3, int *v4, int *v5) {
}
/* Returns the pivot element. */
-static inline
+static forceinline
int *
ss_pivot(const unsigned char *Td, const int *PA, int *first, int *last) {
int *middle;
/*---------------------------------------------------------------------------*/
/* Binary partition for substrings. */
-static inline
+static forceinline
int *
ss_partition(const int *PA,
int *first, int *last, int depth) {
#if SS_BLOCKSIZE != 0
-static inline
+static forceinline
void
ss_blockswap(int *a, int *b, int n) {
int t;
}
}
-static inline
+static forceinline
void
ss_rotate(int *first, int *middle, int *last) {
int *a, *b, t;
/*---------------------------------------------------------------------------*/
-static inline
+static forceinline
int
tr_ilg(int n) {
return (n & 0xffff0000) ?
/*---------------------------------------------------------------------------*/
-static inline
+static forceinline
void
tr_fixdown(const int *ISAd, int *SA, int i, int size) {
int j, k;
/*---------------------------------------------------------------------------*/
/* Returns the median of three elements. */
-static inline
+static forceinline
int *
tr_median3(const int *ISAd, int *v1, int *v2, int *v3) {
if(ISAd[*v1] > ISAd[*v2]) { SWAP(v1, v2); }
}
/* Returns the median of five elements. */
-static inline
+static forceinline
int *
tr_median5(const int *ISAd,
int *v1, int *v2, int *v3, int *v4, int *v5) {
}
/* Returns the pivot element. */
-static inline
+static forceinline
int *
tr_pivot(const int *ISAd, int *first, int *last) {
int *middle;
int count;
};
-static inline
+static forceinline
void
trbudget_init(trbudget_t *budget, int chance, int incval) {
budget->chance = chance;
budget->remain = budget->incval = incval;
}
-static inline
+static forceinline
int
trbudget_check(trbudget_t *budget, int size) {
if(size <= budget->remain) { budget->remain -= size; return 1; }
/*---------------------------------------------------------------------------*/
-static inline
+static forceinline
void
tr_partition(const int *ISAd,
int *first, int *middle, int *last,