*
* This program is a free software; you can redistribute it
* and/or modify it under the terms of the GNU General Public
- * License (version 3) as published by the FSF - Free Software
+ * License (version 2) as published by the FSF - Free Software
* Foundation
*/
{
if(str[j] == '\0')
return(FALSE);
-
+
else if(*pt != charmap[(uchar)str[j]])
{
- pt = pattern;
+ pt = pattern;
goto nnext;
}
j++;pt++;
{
if(strncasecmp(pattern, str, size) == 0)
return(TRUE);
-
- return(FALSE);
+
+ return(FALSE);
}
/** Internal matching **/
{
if(strcasecmp(pattern, str) == 0)
return(TRUE);
-
- return(FALSE);
+
+ return(FALSE);
}
int _os_strmatch(char *pattern, char *str, int str_len, int size)
return(TRUE);
}
+int _os_strstr(char *pattern, char *str, int str_len, int size)
+{
+ if(strstr(str, pattern) != NULL)
+ {
+ return(TRUE);
+ }
+ return(FALSE);
+}
+
/** Internal matching **/
int _os_strcmp_last(char *pattern, char *str, int str_len, int size)
/* Size of the string must be bigger */
if((str_len - size) < 0)
return(FALSE);
-
+
if(strcasecmp(pattern, str + (str_len - size)) == 0)
return(TRUE);
-
- return(FALSE);
+
+ return(FALSE);
}
int OSMatch_Execute(char *str, int str_len, OSMatch *reg)
{
short int i = 0;
-
+
/* The string can't be NULL */
if(str == NULL)
{
/* Looping on all sub patterns */
while(reg->patterns[i])
{
- if(reg->match_fp[i](reg->patterns[i],
- str,
- str_len,
+ if(reg->match_fp[i](reg->patterns[i],
+ str,
+ str_len,
reg->size[i]) == TRUE)
{
return(1);
}
return(0);
-}
+}
/* EOF */