Skip to content
Closed
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Prev Previous commit
Next Next commit
7. JUMP_MIN_REPEAT_ONE should MARK_PUSH() if in a repeat
  • Loading branch information
wjssz committed Mar 11, 2019
commit 0e51eb67a6e66f1c7f620aeade1fd395a6d79495
7 changes: 7 additions & 0 deletions Lib/test/test_re.py
Original file line number Diff line number Diff line change
Expand Up @@ -2136,6 +2136,13 @@ def test_bug_35859(self):
self.assertEqual(m.span(), (0, 4))
self.assertEqual(m.groups(), (None, 'a'))

# JUMP_MIN_REPEAT_ONE should MARK_PUSH() if in a repeat
s = 'abab'
p = r'(?:.*?(?=(a)|(b))b)*'
m = re.match(p, s)
self.assertEqual(m.span(), (0, 4))
self.assertEqual(m.groups(), (None, 'b'))


class PatternReprTests(unittest.TestCase):
def check(self, pattern, expected):
Expand Down
13 changes: 12 additions & 1 deletion Modules/sre_lib.h
Original file line number Diff line number Diff line change
Expand Up @@ -972,15 +972,25 @@ SRE(match)(SRE_STATE* state, SRE_CODE* pattern, int toplevel)
} else {
/* general case */
LASTMARK_SAVE();
ctx->in_repeat = (state->repeat != NULL);
if (ctx->in_repeat)
MARK_PUSH(ctx->lastmark);

while ((Py_ssize_t)ctx->pattern[2] == SRE_MAXREPEAT
|| ctx->count <= (Py_ssize_t)ctx->pattern[2]) {
state->ptr = ctx->ptr;
DO_JUMP(JUMP_MIN_REPEAT_ONE,jump_min_repeat_one,
ctx->pattern+ctx->pattern[0]);
if (ret) {
if (ctx->in_repeat)
MARK_POP_DISCARD(ctx->lastmark);
RETURN_ON_ERROR(ret);
RETURN_SUCCESS;
}
if (ctx->in_repeat)
MARK_POP_KEEP(ctx->lastmark);
LASTMARK_RESTORE();

state->ptr = ctx->ptr;
ret = SRE(count)(state, ctx->pattern+3, 1);
RETURN_ON_ERROR(ret);
Expand All @@ -990,8 +1000,9 @@ SRE(match)(SRE_STATE* state, SRE_CODE* pattern, int toplevel)
assert(ret == 1);
ctx->ptr++;
ctx->count++;
LASTMARK_RESTORE();
}
if (ctx->in_repeat)
MARK_POP_DISCARD(ctx->lastmark);
}
RETURN_FAILURE;

Expand Down