forked from enlightenment/efl
we can optimize matching by breaking loop when match becomes 0 :)
SVN revision: 67267
This commit is contained in:
parent
ad3aca617f
commit
a70fc50208
|
@ -4738,7 +4738,11 @@ _escaped_char_match(const char *s, int *adv)
|
||||||
while ((*mc) && (*sc))
|
while ((*mc) && (*sc))
|
||||||
{
|
{
|
||||||
if ((unsigned char)*sc < (unsigned char)*mc) return NULL;
|
if ((unsigned char)*sc < (unsigned char)*mc) return NULL;
|
||||||
if (*sc != *mc) match = 0;
|
if (*sc != *mc)
|
||||||
|
{
|
||||||
|
match = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
mc++;
|
mc++;
|
||||||
sc++;
|
sc++;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue