php-internal-docs 8.4.8
Unofficial docs for php/php-src
Loading...
Searching...
No Matches
pcre2_jit_match.c
Go to the documentation of this file.
1/*************************************************
2* Perl-Compatible Regular Expressions *
3*************************************************/
4
5/* PCRE is a library of functions to support regular expressions whose syntax
6and semantics are as close as possible to those of the Perl 5 language.
7
8 Written by Philip Hazel
9 Original API code Copyright (c) 1997-2012 University of Cambridge
10 New API code Copyright (c) 2016-2023 University of Cambridge
11
12-----------------------------------------------------------------------------
13Redistribution and use in source and binary forms, with or without
14modification, are permitted provided that the following conditions are met:
15
16 * Redistributions of source code must retain the above copyright notice,
17 this list of conditions and the following disclaimer.
18
19 * Redistributions in binary form must reproduce the above copyright
20 notice, this list of conditions and the following disclaimer in the
21 documentation and/or other materials provided with the distribution.
22
23 * Neither the name of the University of Cambridge nor the names of its
24 contributors may be used to endorse or promote products derived from
25 this software without specific prior written permission.
26
27THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
28AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
29IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
30ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
31LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37POSSIBILITY OF SUCH DAMAGE.
38-----------------------------------------------------------------------------
39*/
40
41#ifndef INCLUDED_FROM_PCRE2_JIT_COMPILE
42#error This file must be included from pcre2_jit_compile.c.
43#endif
44
45#if defined(__has_feature)
46#if __has_feature(memory_sanitizer)
47#include <sanitizer/msan_interface.h>
48#endif /* __has_feature(memory_sanitizer) */
49#endif /* defined(__has_feature) */
50
51#ifdef SUPPORT_JIT
52
53static SLJIT_NOINLINE int jit_machine_stack_exec(jit_arguments *arguments, jit_function executable_func)
54{
55sljit_u8 local_space[MACHINE_STACK_SIZE];
56struct sljit_stack local_stack;
57
58local_stack.min_start = local_space;
59local_stack.start = local_space;
60local_stack.end = local_space + MACHINE_STACK_SIZE;
61local_stack.top = local_space + MACHINE_STACK_SIZE;
62arguments->stack = &local_stack;
63return executable_func(arguments);
64}
65
66#endif
67
68
69/*************************************************
70* Do a JIT pattern match *
71*************************************************/
72
73/* This function runs a JIT pattern match.
74
75Arguments:
76 code points to the compiled expression
77 subject points to the subject string
78 length length of subject string (may contain binary zeros)
79 start_offset where to start in the subject string
80 options option bits
81 match_data points to a match_data block
82 mcontext points to a match context
83
84Returns: > 0 => success; value is the number of ovector pairs filled
85 = 0 => success, but ovector is not big enough
86 -1 => failed to match (PCRE_ERROR_NOMATCH)
87 < -1 => some kind of unexpected problem
88*/
89
91pcre2_jit_match(const pcre2_code *code, PCRE2_SPTR subject, PCRE2_SIZE length,
92 PCRE2_SIZE start_offset, uint32_t options, pcre2_match_data *match_data,
93 pcre2_match_context *mcontext)
94{
95#ifndef SUPPORT_JIT
96
97(void)code;
98(void)subject;
99(void)length;
100(void)start_offset;
102(void)match_data;
103(void)mcontext;
105
106#else /* SUPPORT_JIT */
107
108pcre2_real_code *re = (pcre2_real_code *)code;
109executable_functions *functions = (executable_functions *)re->executable_jit;
110pcre2_jit_stack *jit_stack;
111uint32_t oveccount = match_data->oveccount;
112uint32_t max_oveccount;
113union {
114 void *executable_func;
115 jit_function call_executable_func;
116} convert_executable_func;
117jit_arguments arguments;
118int rc;
119int index = 0;
120
121if ((options & PCRE2_PARTIAL_HARD) != 0)
122 index = 2;
123else if ((options & PCRE2_PARTIAL_SOFT) != 0)
124 index = 1;
125
126if (functions == NULL || functions->executable_funcs[index] == NULL)
128
129/* Sanity checks should be handled by pcre2_match. */
130arguments.str = subject + start_offset;
131arguments.begin = subject;
132arguments.end = subject + length;
133arguments.match_data = match_data;
134arguments.startchar_ptr = subject;
135arguments.mark_ptr = NULL;
136arguments.options = options;
137
138if (mcontext != NULL)
139 {
140 arguments.callout = mcontext->callout;
141 arguments.callout_data = mcontext->callout_data;
142 arguments.offset_limit = mcontext->offset_limit;
143 arguments.limit_match = (mcontext->match_limit < re->limit_match)?
144 mcontext->match_limit : re->limit_match;
145 if (mcontext->jit_callback != NULL)
146 jit_stack = mcontext->jit_callback(mcontext->jit_callback_data);
147 else
148 jit_stack = (pcre2_jit_stack *)mcontext->jit_callback_data;
149 }
150else
151 {
152 arguments.callout = NULL;
153 arguments.callout_data = NULL;
154 arguments.offset_limit = PCRE2_UNSET;
155 arguments.limit_match = (MATCH_LIMIT < re->limit_match)?
157 jit_stack = NULL;
158 }
159
160
161max_oveccount = functions->top_bracket;
162if (oveccount > max_oveccount)
163 oveccount = max_oveccount;
164arguments.oveccount = oveccount << 1;
165
166
167convert_executable_func.executable_func = functions->executable_funcs[index];
168if (jit_stack != NULL)
169 {
170 arguments.stack = (struct sljit_stack *)(jit_stack->stack);
171 rc = convert_executable_func.call_executable_func(&arguments);
172 }
173else
174 rc = jit_machine_stack_exec(&arguments, convert_executable_func.call_executable_func);
175
176if (rc > (int)oveccount)
177 rc = 0;
178match_data->code = re;
179match_data->subject = (rc >= 0 || rc == PCRE2_ERROR_PARTIAL)? subject : NULL;
180match_data->subject_length = length;
181match_data->rc = rc;
182match_data->startchar = arguments.startchar_ptr - subject;
183match_data->leftchar = 0;
184match_data->rightchar = 0;
185match_data->mark = arguments.mark_ptr;
186match_data->matchedby = PCRE2_MATCHEDBY_JIT;
187
188#if defined(__has_feature)
189#if __has_feature(memory_sanitizer)
190if (rc > 0)
191 __msan_unpoison(match_data->ovector, 2 * rc * sizeof(match_data->ovector[0]));
192#endif /* __has_feature(memory_sanitizer) */
193#endif /* defined(__has_feature) */
194
195return match_data->rc;
196
197#endif /* SUPPORT_JIT */
198}
199
200/* End of pcre2_jit_match.c */
#define NULL
Definition gdcache.h:45
#define pcre2_real_code
Definition pcre2.h:826
#define PCRE2_UNSET
Definition pcre2.h:482
#define PCRE2_ERROR_JIT_BADOPTION
Definition pcre2.h:386
#define pcre2_jit_stack
Definition pcre2.h:824
#define pcre2_code
Definition pcre2.h:822
#define PCRE2_SIZE
Definition pcre2.h:479
#define PCRE2_PARTIAL_SOFT
Definition pcre2.h:180
#define PCRE2_SPTR
Definition pcre2.h:820
#define PCRE2_PARTIAL_HARD
Definition pcre2.h:181
#define pcre2_jit_match
Definition pcre2.h:874
#define pcre2_match_data
Definition pcre2.h:844
#define pcre2_match_context
Definition pcre2.h:843
#define PCRE2_CALL_CONVENTION
Definition pcre2.h:81
#define PCRE2_ERROR_PARTIAL
Definition pcre2.h:328
@ PCRE2_MATCHEDBY_JIT
#define PCRE2_EXP_DEFN
#define MATCH_LIMIT
Definition config.h:52
PHP_JSON_API size_t int options
Definition php_json.h:102
HashTable functions
unsigned char sljit_u8
#define SLJIT_NOINLINE
sljit_u8 * min_start
Definition sljitLir.h:2408
ZEND_API void(ZEND_FASTCALL *zend_touch_vm_stack_data)(void *vm_stack_data)