mirror of
git://git.code.sf.net/p/cdesktopenv/code
synced 2025-03-09 15:50:02 +00:00
libast: regex: backport robustness improvements from 93v- beta
There are two main changes:
1. The regex code now creates and uses its own stack (env->mst)
instead of using the shared standard stack (stkstd). That seems
likely to be a good thing.
2. Missing mbinit() calls were inserted. The 93v- code uses a
completely different multibyte characters API, so these needed
to be translated back to the older API. But, as mbinit() is no
longer a no-op as of 300cd199, these calls do stop things from
breaking if a previous operation is interrupted mid-character.
I think there might be a couple of off-by-one errors fixed as well,
as there are two instances of this change:
- while ((index += skip[buf[index]]) < mid);
+ while (index < mid)
+ index += skip[buf[index]];
This commit is contained in:
parent
7c30a59e25
commit
1aa8f771d8
8 changed files with 89 additions and 60 deletions
|
|
@ -1,7 +1,7 @@
|
|||
/***********************************************************************
|
||||
* *
|
||||
* This software is part of the ast package *
|
||||
* Copyright (c) 1985-2012 AT&T Intellectual Property *
|
||||
* Copyright (c) 1985-2013 AT&T Intellectual Property *
|
||||
* Copyright (c) 2020-2021 Contributors to ksh 93u+m *
|
||||
* and is licensed under the *
|
||||
* Eclipse Public License, Version 1.0 *
|
||||
|
|
@ -34,9 +34,9 @@
|
|||
*/
|
||||
|
||||
int
|
||||
regrexec(const regex_t* p, const char* s, size_t len, size_t nmatch, regmatch_t* match, regflags_t flags, int sep, void* handle, regrecord_t record)
|
||||
regrexec_20120528(const regex_t* p, const char* s, size_t len, size_t nmatch, regmatch_t* match, regflags_t flags, int sep, void* handle, regrecord_t record)
|
||||
{
|
||||
register unsigned char* buf = (unsigned char*)s;
|
||||
register unsigned char* buf;
|
||||
register unsigned char* beg;
|
||||
register unsigned char* l;
|
||||
register unsigned char* r;
|
||||
|
|
@ -73,7 +73,8 @@ regrexec(const regex_t* p, const char* s, size_t len, size_t nmatch, regmatch_t*
|
|||
index = leftlen++;
|
||||
for (;;)
|
||||
{
|
||||
while ((index += skip[buf[index]]) < mid);
|
||||
while (index < mid)
|
||||
index += skip[buf[index]];
|
||||
if (index < HIT)
|
||||
goto impossible;
|
||||
index -= HIT;
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue