| 1 |
.TH PCRE_JIT_STACK_ALLOC 3 "21 January 2012" "PCRE 8.30"
|
| 2 |
.SH NAME
|
| 3 |
PCRE - Perl-compatible regular expressions
|
| 4 |
.SH SYNOPSIS
|
| 5 |
.rs
|
| 6 |
.sp
|
| 7 |
.B #include <pcre.h>
|
| 8 |
.PP
|
| 9 |
.SM
|
| 10 |
.B pcre_jit_stack *pcre_jit_stack_alloc(int \fIstartsize\fP,
|
| 11 |
.ti +5n
|
| 12 |
.B int \fImaxsize\fP);
|
| 13 |
.PP
|
| 14 |
.B pcre16_jit_stack *pcre16_jit_stack_alloc(int \fIstartsize\fP,
|
| 15 |
.ti +5n
|
| 16 |
.B int \fImaxsize\fP);
|
| 17 |
.
|
| 18 |
.SH DESCRIPTION
|
| 19 |
.rs
|
| 20 |
.sp
|
| 21 |
This function is used to create a stack for use by the code compiled by the JIT
|
| 22 |
optimization of \fBpcre[16]_study()\fP. The arguments are a starting size for
|
| 23 |
the stack, and a maximum size to which it is allowed to grow. The result can be
|
| 24 |
passed to the JIT runtime code by \fBpcre[16]_assign_jit_stack()\fP, or that
|
| 25 |
function can set up a callback for obtaining a stack. A maximum stack size of
|
| 26 |
512K to 1M should be more than enough for any pattern. For more details, see
|
| 27 |
the
|
| 28 |
.\" HREF
|
| 29 |
\fBpcrejit\fP
|
| 30 |
.\"
|
| 31 |
page.
|
| 32 |
.P
|
| 33 |
There is a complete description of the PCRE native API in the
|
| 34 |
.\" HREF
|
| 35 |
\fBpcreapi\fP
|
| 36 |
.\"
|
| 37 |
page and a description of the POSIX API in the
|
| 38 |
.\" HREF
|
| 39 |
\fBpcreposix\fP
|
| 40 |
.\"
|
| 41 |
page.
|
Parent Directory
| 
Revision Log