/* ****************************************************************
routine for deep-sorting the suffixes a[0] ... a[n-1]
knowing that they have a common prefix of length "depth"
**************************************************************** */
void blind_ssort(Int32 *a, Int32 n, Int32 depth)
{
int neg_integer_cmp(const void *, const void *);
node *find_companion(node *head, UChar *s);
void insert_suffix(node *h, Int32 suf, int n, UChar mmchar);
void traverse_trie(node *h);
Int32 compare_suffixes(Int32 suf1, Int32 suf2, Int32 depth);
void free_node_mem();
Int32 i,j,aj,lcp;
node nh, *root, *h;
// ---- sort suffixes in order of increasing length
qsort(a,n, sizeof(Int32), neg_integer_cmp);
// --- skip suffixes which have already reached the end-of-text
for(j=0;j<n;j++)
if(a[j]+depth < Text_size)
break;
if(j>=n-1) return; // everything is already sorted!
// ------ init stack -------
Stack = (node **) malloc(n*sizeof(node *));
if(Stack==NULL) {
fprintf(stderr,"Out of memory! (blind_ssort)\n");
exit(1);
}
// ------- init root with the first unsorted suffix
nh.skip = -1; nh.right = NULL; nh.down = (void *) a[j];
root = &nh;
// ------- insert suffixes a[j+1] ... a[n-1]
for(i=j+1;i<n;i++) {
h=find_companion(root, Text+a[i]);
assert(h->skip==-1);
assert(Stack_size<=i-j);
aj=(Int32) h->down;
assert(aj>a[i]);
lcp = compare_suffixes(aj,a[i],depth);
insert_suffix(root, a[i], lcp, Text[aj+lcp]);
}
// ---- traverse the trie and get suffixes in lexicographic order
Aux=a; Aux_written = j;
traverse_trie(root);
assert(Aux_written==n);
free_node_mem();
free(Stack);
}
static void
state_changed (NMDevice *device,
NMDeviceState new_state,
NMDeviceState old_state,
NMDeviceStateReason reason)
{
if (new_state == NM_DEVICE_STATE_UNAVAILABLE)
find_companion (NM_DEVICE_OLPC_MESH (device));
}
void blind_ssort(UInt32 *a, Int32 n, Int32 depth)
{
Int32 i,j,aj,lcp;
node nh, *root, *h;
/* ---- sort suffixes in order of increasing length */
qsort(a,n, sizeof(Int32), neg_integer_cmp);
/* --- skip suffixes which have already reached the end-of-text */
for(j=0;j<n;j++)
if(a[j]+(UInt32)depth < (UInt32)Text_size)
break;
if(j>=n-1) return; /* everything is already sorted! */
/* ------ init stack ------- */
Stack = (node **) malloc(n*sizeof(node *));
if(Stack==NULL) {
fprintf(stderr,"Out of memory! (blind_ssort)\n");
exit(1);
}
/* ------- init root with the first unsorted suffix */
nh.skip = -1; nh.right = NULL; nh.down = (node *) a[j];
root = &nh;
/* ------- insert suffixes a[j+1] ... a[n-1] */
for(i=j+1;i<n;i++) {
h=find_companion(root, Text+a[i]);
assert(h->skip==-1);
assert(Stack_size<=i-j);
aj=(Int32) h->down;
assert((UInt32)aj>a[i]);
lcp = compare_suffixes(aj,a[i],depth);
insert_suffix(root, a[i], lcp, Text[aj+lcp]);
}
/* ---- traverse the trie and get suffixes in lexicographic order */
Aux=a; Aux_written = j;
traverse_trie(root);
assert(Aux_written==(UInt32)n);
free_node_mem();
free(Stack);
}
