@@ -41,7 +41,7 @@ strlower(char *str)
41
41
}
42
42
43
43
static char *
44
- strndup (char * s , int len ) {
44
+ strnduplicate (char * s , int len ) {
45
45
char * d = (char * )palloc ( len + 1 );
46
46
memcpy (d , s , len );
47
47
d [len ]= '\0' ;
@@ -866,7 +866,7 @@ SplitToVariants( IspellDict * Conf, SPNode *snode, SplitVar * orig, char *word,
866
866
/* and its length more than minimal */
867
867
if ( wordlen == level + 1 ) {
868
868
/* well, it was last word */
869
- var -> stem [ var -> nstem ] = strndup (word + startpos , wordlen - startpos );
869
+ var -> stem [ var -> nstem ] = strnduplicate (word + startpos , wordlen - startpos );
870
870
var -> nstem ++ ;
871
871
return var ;
872
872
} else {
@@ -877,7 +877,7 @@ SplitToVariants( IspellDict * Conf, SPNode *snode, SplitVar * orig, char *word,
877
877
ptr -> next = SplitToVariants (Conf , node , var , word , wordlen , startpos , level );
878
878
/* we can find next word */
879
879
level ++ ;
880
- var -> stem [ var -> nstem ] = strndup (word + startpos , level - startpos );
880
+ var -> stem [ var -> nstem ] = strnduplicate (word + startpos , level - startpos );
881
881
var -> nstem ++ ;
882
882
node = Conf -> Dictionary ;
883
883
startpos = level ;
@@ -889,7 +889,7 @@ SplitToVariants( IspellDict * Conf, SPNode *snode, SplitVar * orig, char *word,
889
889
node = StopMiddle -> node ;
890
890
}
891
891
892
- var -> stem [ var -> nstem ] = strndup (word + startpos , wordlen - startpos );
892
+ var -> stem [ var -> nstem ] = strnduplicate (word + startpos , wordlen - startpos );
893
893
var -> nstem ++ ;
894
894
return var ;
895
895
}
0 commit comments