@@ -49,7 +49,7 @@ strnduplicate(char *s, int len) {
4949}
5050/* backward string compaire for suffix tree operations */
5151static int
52- strbcmp (const char * s1 ,const char * s2 )
52+ strbcmp (const unsigned char * s1 ,const unsigned char * s2 )
5353{
5454int l1 = strlen (s1 )- 1 ,
5555l2 = strlen (s2 )- 1 ;
@@ -71,7 +71,7 @@ strbcmp(const char *s1, const char *s2)
7171return 0 ;
7272}
7373static int
74- strbncmp (const char * s1 ,const char * s2 ,size_t count )
74+ strbncmp (const unsigned char * s1 ,const unsigned char * s2 ,size_t count )
7575{
7676int l1 = strlen (s1 )- 1 ,
7777l2 = strlen (s2 )- 1 ,
@@ -536,9 +536,10 @@ mkANode(IspellDict *Conf, int low, int high, int level, int type) {
536536}
537537data -> val = GETCHAR (Conf -> Affix + i ,level ,type );
538538if (Conf -> Affix [i ].replen == level + 1 ) {/* affix stopped */
539- if ( !data -> naff )
539+ if ( !data -> naff ) {
540540data -> aff = (AFFIX * * )malloc (sizeof (AFFIX * )* (high - i + 1 ));
541- MEMOUT (data );
541+ MEMOUT (data -> aff );
542+ }
542543data -> aff [data -> naff ]= Conf -> Affix + i ;
543544data -> naff ++ ;
544545}