pcrejit.html 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499
  1. <html>
  2. <head>
  3. <title>pcrejit specification</title>
  4. </head>
  5. <body bgcolor="#FFFFFF" text="#00005A" link="#0066FF" alink="#3399FF" vlink="#2222BB">
  6. <h1>pcrejit man page</h1>
  7. <p>
  8. Return to the <a href="index.html">PCRE index page</a>.
  9. </p>
  10. <p>
  11. This page is part of the PCRE HTML documentation. It was generated automatically
  12. from the original man page. If there is any nonsense in it, please consult the
  13. man page, in case the conversion went wrong.
  14. <br>
  15. <ul>
  16. <li><a name="TOC1" href="#SEC1">PCRE JUST-IN-TIME COMPILER SUPPORT</a>
  17. <li><a name="TOC2" href="#SEC2">8-BIT, 16-BIT AND 32-BIT SUPPORT</a>
  18. <li><a name="TOC3" href="#SEC3">AVAILABILITY OF JIT SUPPORT</a>
  19. <li><a name="TOC4" href="#SEC4">SIMPLE USE OF JIT</a>
  20. <li><a name="TOC5" href="#SEC5">UNSUPPORTED OPTIONS AND PATTERN ITEMS</a>
  21. <li><a name="TOC6" href="#SEC6">RETURN VALUES FROM JIT EXECUTION</a>
  22. <li><a name="TOC7" href="#SEC7">SAVING AND RESTORING COMPILED PATTERNS</a>
  23. <li><a name="TOC8" href="#SEC8">CONTROLLING THE JIT STACK</a>
  24. <li><a name="TOC9" href="#SEC9">JIT STACK FAQ</a>
  25. <li><a name="TOC10" href="#SEC10">EXAMPLE CODE</a>
  26. <li><a name="TOC11" href="#SEC11">JIT FAST PATH API</a>
  27. <li><a name="TOC12" href="#SEC12">SEE ALSO</a>
  28. <li><a name="TOC13" href="#SEC13">AUTHOR</a>
  29. <li><a name="TOC14" href="#SEC14">REVISION</a>
  30. </ul>
  31. <br><a name="SEC1" href="#TOC1">PCRE JUST-IN-TIME COMPILER SUPPORT</a><br>
  32. <P>
  33. Just-in-time compiling is a heavyweight optimization that can greatly speed up
  34. pattern matching. However, it comes at the cost of extra processing before the
  35. match is performed. Therefore, it is of most benefit when the same pattern is
  36. going to be matched many times. This does not necessarily mean many calls of a
  37. matching function; if the pattern is not anchored, matching attempts may take
  38. place many times at various positions in the subject, even for a single call.
  39. Therefore, if the subject string is very long, it may still pay to use JIT for
  40. one-off matches.
  41. </P>
  42. <P>
  43. JIT support applies only to the traditional Perl-compatible matching function.
  44. It does not apply when the DFA matching function is being used. The code for
  45. this support was written by Zoltan Herczeg.
  46. </P>
  47. <br><a name="SEC2" href="#TOC1">8-BIT, 16-BIT AND 32-BIT SUPPORT</a><br>
  48. <P>
  49. JIT support is available for all of the 8-bit, 16-bit and 32-bit PCRE
  50. libraries. To keep this documentation simple, only the 8-bit interface is
  51. described in what follows. If you are using the 16-bit library, substitute the
  52. 16-bit functions and 16-bit structures (for example, <i>pcre16_jit_stack</i>
  53. instead of <i>pcre_jit_stack</i>). If you are using the 32-bit library,
  54. substitute the 32-bit functions and 32-bit structures (for example,
  55. <i>pcre32_jit_stack</i> instead of <i>pcre_jit_stack</i>).
  56. </P>
  57. <br><a name="SEC3" href="#TOC1">AVAILABILITY OF JIT SUPPORT</a><br>
  58. <P>
  59. JIT support is an optional feature of PCRE. The "configure" option --enable-jit
  60. (or equivalent CMake option) must be set when PCRE is built if you want to use
  61. JIT. The support is limited to the following hardware platforms:
  62. <pre>
  63. ARM v5, v7, and Thumb2
  64. Intel x86 32-bit and 64-bit
  65. MIPS 32-bit
  66. Power PC 32-bit and 64-bit
  67. SPARC 32-bit (experimental)
  68. </pre>
  69. If --enable-jit is set on an unsupported platform, compilation fails.
  70. </P>
  71. <P>
  72. A program that is linked with PCRE 8.20 or later can tell if JIT support is
  73. available by calling <b>pcre_config()</b> with the PCRE_CONFIG_JIT option. The
  74. result is 1 when JIT is available, and 0 otherwise. However, a simple program
  75. does not need to check this in order to use JIT. The normal API is implemented
  76. in a way that falls back to the interpretive code if JIT is not available. For
  77. programs that need the best possible performance, there is also a "fast path"
  78. API that is JIT-specific.
  79. </P>
  80. <P>
  81. If your program may sometimes be linked with versions of PCRE that are older
  82. than 8.20, but you want to use JIT when it is available, you can test the
  83. values of PCRE_MAJOR and PCRE_MINOR, or the existence of a JIT macro such as
  84. PCRE_CONFIG_JIT, for compile-time control of your code. Also beware that the
  85. <b>pcre_jit_exec()</b> function was not available at all before 8.32,
  86. and may not be available at all if PCRE isn't compiled with
  87. --enable-jit. See the "JIT FAST PATH API" section below for details.
  88. </P>
  89. <br><a name="SEC4" href="#TOC1">SIMPLE USE OF JIT</a><br>
  90. <P>
  91. You have to do two things to make use of the JIT support in the simplest way:
  92. <pre>
  93. (1) Call <b>pcre_study()</b> with the PCRE_STUDY_JIT_COMPILE option for
  94. each compiled pattern, and pass the resulting <b>pcre_extra</b> block to
  95. <b>pcre_exec()</b>.
  96. (2) Use <b>pcre_free_study()</b> to free the <b>pcre_extra</b> block when it is
  97. no longer needed, instead of just freeing it yourself. This ensures that
  98. any JIT data is also freed.
  99. </pre>
  100. For a program that may be linked with pre-8.20 versions of PCRE, you can insert
  101. <pre>
  102. #ifndef PCRE_STUDY_JIT_COMPILE
  103. #define PCRE_STUDY_JIT_COMPILE 0
  104. #endif
  105. </pre>
  106. so that no option is passed to <b>pcre_study()</b>, and then use something like
  107. this to free the study data:
  108. <pre>
  109. #ifdef PCRE_CONFIG_JIT
  110. pcre_free_study(study_ptr);
  111. #else
  112. pcre_free(study_ptr);
  113. #endif
  114. </pre>
  115. PCRE_STUDY_JIT_COMPILE requests the JIT compiler to generate code for complete
  116. matches. If you want to run partial matches using the PCRE_PARTIAL_HARD or
  117. PCRE_PARTIAL_SOFT options of <b>pcre_exec()</b>, you should set one or both of
  118. the following options in addition to, or instead of, PCRE_STUDY_JIT_COMPILE
  119. when you call <b>pcre_study()</b>:
  120. <pre>
  121. PCRE_STUDY_JIT_PARTIAL_HARD_COMPILE
  122. PCRE_STUDY_JIT_PARTIAL_SOFT_COMPILE
  123. </pre>
  124. If using <b>pcre_jit_exec()</b> and supporting a pre-8.32 version of
  125. PCRE, you can insert:
  126. <pre>
  127. #if PCRE_MAJOR &#62;= 8 && PCRE_MINOR &#62;= 32
  128. pcre_jit_exec(...);
  129. #else
  130. pcre_exec(...)
  131. #endif
  132. </pre>
  133. but as described in the "JIT FAST PATH API" section below this assumes
  134. version 8.32 and later are compiled with --enable-jit, which may
  135. break.
  136. <br>
  137. <br>
  138. The JIT compiler generates different optimized code for each of the three
  139. modes (normal, soft partial, hard partial). When <b>pcre_exec()</b> is called,
  140. the appropriate code is run if it is available. Otherwise, the pattern is
  141. matched using interpretive code.
  142. </P>
  143. <P>
  144. In some circumstances you may need to call additional functions. These are
  145. described in the section entitled
  146. <a href="#stackcontrol">"Controlling the JIT stack"</a>
  147. below.
  148. </P>
  149. <P>
  150. If JIT support is not available, PCRE_STUDY_JIT_COMPILE etc. are ignored, and
  151. no JIT data is created. Otherwise, the compiled pattern is passed to the JIT
  152. compiler, which turns it into machine code that executes much faster than the
  153. normal interpretive code. When <b>pcre_exec()</b> is passed a <b>pcre_extra</b>
  154. block containing a pointer to JIT code of the appropriate mode (normal or
  155. hard/soft partial), it obeys that code instead of running the interpreter. The
  156. result is identical, but the compiled JIT code runs much faster.
  157. </P>
  158. <P>
  159. There are some <b>pcre_exec()</b> options that are not supported for JIT
  160. execution. There are also some pattern items that JIT cannot handle. Details
  161. are given below. In both cases, execution automatically falls back to the
  162. interpretive code. If you want to know whether JIT was actually used for a
  163. particular match, you should arrange for a JIT callback function to be set up
  164. as described in the section entitled
  165. <a href="#stackcontrol">"Controlling the JIT stack"</a>
  166. below, even if you do not need to supply a non-default JIT stack. Such a
  167. callback function is called whenever JIT code is about to be obeyed. If the
  168. execution options are not right for JIT execution, the callback function is not
  169. obeyed.
  170. </P>
  171. <P>
  172. If the JIT compiler finds an unsupported item, no JIT data is generated. You
  173. can find out if JIT execution is available after studying a pattern by calling
  174. <b>pcre_fullinfo()</b> with the PCRE_INFO_JIT option. A result of 1 means that
  175. JIT compilation was successful. A result of 0 means that JIT support is not
  176. available, or the pattern was not studied with PCRE_STUDY_JIT_COMPILE etc., or
  177. the JIT compiler was not able to handle the pattern.
  178. </P>
  179. <P>
  180. Once a pattern has been studied, with or without JIT, it can be used as many
  181. times as you like for matching different subject strings.
  182. </P>
  183. <br><a name="SEC5" href="#TOC1">UNSUPPORTED OPTIONS AND PATTERN ITEMS</a><br>
  184. <P>
  185. The only <b>pcre_exec()</b> options that are supported for JIT execution are
  186. PCRE_NO_UTF8_CHECK, PCRE_NO_UTF16_CHECK, PCRE_NO_UTF32_CHECK, PCRE_NOTBOL,
  187. PCRE_NOTEOL, PCRE_NOTEMPTY, PCRE_NOTEMPTY_ATSTART, PCRE_PARTIAL_HARD, and
  188. PCRE_PARTIAL_SOFT.
  189. </P>
  190. <P>
  191. The only unsupported pattern items are \C (match a single data unit) when
  192. running in a UTF mode, and a callout immediately before an assertion condition
  193. in a conditional group.
  194. </P>
  195. <br><a name="SEC6" href="#TOC1">RETURN VALUES FROM JIT EXECUTION</a><br>
  196. <P>
  197. When a pattern is matched using JIT execution, the return values are the same
  198. as those given by the interpretive <b>pcre_exec()</b> code, with the addition of
  199. one new error code: PCRE_ERROR_JIT_STACKLIMIT. This means that the memory used
  200. for the JIT stack was insufficient. See
  201. <a href="#stackcontrol">"Controlling the JIT stack"</a>
  202. below for a discussion of JIT stack usage. For compatibility with the
  203. interpretive <b>pcre_exec()</b> code, no more than two-thirds of the
  204. <i>ovector</i> argument is used for passing back captured substrings.
  205. </P>
  206. <P>
  207. The error code PCRE_ERROR_MATCHLIMIT is returned by the JIT code if searching a
  208. very large pattern tree goes on for too long, as it is in the same circumstance
  209. when JIT is not used, but the details of exactly what is counted are not the
  210. same. The PCRE_ERROR_RECURSIONLIMIT error code is never returned by JIT
  211. execution.
  212. </P>
  213. <br><a name="SEC7" href="#TOC1">SAVING AND RESTORING COMPILED PATTERNS</a><br>
  214. <P>
  215. The code that is generated by the JIT compiler is architecture-specific, and is
  216. also position dependent. For those reasons it cannot be saved (in a file or
  217. database) and restored later like the bytecode and other data of a compiled
  218. pattern. Saving and restoring compiled patterns is not something many people
  219. do. More detail about this facility is given in the
  220. <a href="pcreprecompile.html"><b>pcreprecompile</b></a>
  221. documentation. It should be possible to run <b>pcre_study()</b> on a saved and
  222. restored pattern, and thereby recreate the JIT data, but because JIT
  223. compilation uses significant resources, it is probably not worth doing this;
  224. you might as well recompile the original pattern.
  225. <a name="stackcontrol"></a></P>
  226. <br><a name="SEC8" href="#TOC1">CONTROLLING THE JIT STACK</a><br>
  227. <P>
  228. When the compiled JIT code runs, it needs a block of memory to use as a stack.
  229. By default, it uses 32K on the machine stack. However, some large or
  230. complicated patterns need more than this. The error PCRE_ERROR_JIT_STACKLIMIT
  231. is given when there is not enough stack. Three functions are provided for
  232. managing blocks of memory for use as JIT stacks. There is further discussion
  233. about the use of JIT stacks in the section entitled
  234. <a href="#stackcontrol">"JIT stack FAQ"</a>
  235. below.
  236. </P>
  237. <P>
  238. The <b>pcre_jit_stack_alloc()</b> function creates a JIT stack. Its arguments
  239. are a starting size and a maximum size, and it returns a pointer to an opaque
  240. structure of type <b>pcre_jit_stack</b>, or NULL if there is an error. The
  241. <b>pcre_jit_stack_free()</b> function can be used to free a stack that is no
  242. longer needed. (For the technically minded: the address space is allocated by
  243. mmap or VirtualAlloc.)
  244. </P>
  245. <P>
  246. JIT uses far less memory for recursion than the interpretive code,
  247. and a maximum stack size of 512K to 1M should be more than enough for any
  248. pattern.
  249. </P>
  250. <P>
  251. The <b>pcre_assign_jit_stack()</b> function specifies which stack JIT code
  252. should use. Its arguments are as follows:
  253. <pre>
  254. pcre_extra *extra
  255. pcre_jit_callback callback
  256. void *data
  257. </pre>
  258. The <i>extra</i> argument must be the result of studying a pattern with
  259. PCRE_STUDY_JIT_COMPILE etc. There are three cases for the values of the other
  260. two options:
  261. <pre>
  262. (1) If <i>callback</i> is NULL and <i>data</i> is NULL, an internal 32K block
  263. on the machine stack is used.
  264. (2) If <i>callback</i> is NULL and <i>data</i> is not NULL, <i>data</i> must be
  265. a valid JIT stack, the result of calling <b>pcre_jit_stack_alloc()</b>.
  266. (3) If <i>callback</i> is not NULL, it must point to a function that is
  267. called with <i>data</i> as an argument at the start of matching, in
  268. order to set up a JIT stack. If the return from the callback
  269. function is NULL, the internal 32K stack is used; otherwise the
  270. return value must be a valid JIT stack, the result of calling
  271. <b>pcre_jit_stack_alloc()</b>.
  272. </pre>
  273. A callback function is obeyed whenever JIT code is about to be run; it is not
  274. obeyed when <b>pcre_exec()</b> is called with options that are incompatible for
  275. JIT execution. A callback function can therefore be used to determine whether a
  276. match operation was executed by JIT or by the interpreter.
  277. </P>
  278. <P>
  279. You may safely use the same JIT stack for more than one pattern (either by
  280. assigning directly or by callback), as long as the patterns are all matched
  281. sequentially in the same thread. In a multithread application, if you do not
  282. specify a JIT stack, or if you assign or pass back NULL from a callback, that
  283. is thread-safe, because each thread has its own machine stack. However, if you
  284. assign or pass back a non-NULL JIT stack, this must be a different stack for
  285. each thread so that the application is thread-safe.
  286. </P>
  287. <P>
  288. Strictly speaking, even more is allowed. You can assign the same non-NULL stack
  289. to any number of patterns as long as they are not used for matching by multiple
  290. threads at the same time. For example, you can assign the same stack to all
  291. compiled patterns, and use a global mutex in the callback to wait until the
  292. stack is available for use. However, this is an inefficient solution, and not
  293. recommended.
  294. </P>
  295. <P>
  296. This is a suggestion for how a multithreaded program that needs to set up
  297. non-default JIT stacks might operate:
  298. <pre>
  299. During thread initalization
  300. thread_local_var = pcre_jit_stack_alloc(...)
  301. During thread exit
  302. pcre_jit_stack_free(thread_local_var)
  303. Use a one-line callback function
  304. return thread_local_var
  305. </pre>
  306. All the functions described in this section do nothing if JIT is not available,
  307. and <b>pcre_assign_jit_stack()</b> does nothing unless the <b>extra</b> argument
  308. is non-NULL and points to a <b>pcre_extra</b> block that is the result of a
  309. successful study with PCRE_STUDY_JIT_COMPILE etc.
  310. <a name="stackfaq"></a></P>
  311. <br><a name="SEC9" href="#TOC1">JIT STACK FAQ</a><br>
  312. <P>
  313. (1) Why do we need JIT stacks?
  314. <br>
  315. <br>
  316. PCRE (and JIT) is a recursive, depth-first engine, so it needs a stack where
  317. the local data of the current node is pushed before checking its child nodes.
  318. Allocating real machine stack on some platforms is difficult. For example, the
  319. stack chain needs to be updated every time if we extend the stack on PowerPC.
  320. Although it is possible, its updating time overhead decreases performance. So
  321. we do the recursion in memory.
  322. </P>
  323. <P>
  324. (2) Why don't we simply allocate blocks of memory with <b>malloc()</b>?
  325. <br>
  326. <br>
  327. Modern operating systems have a nice feature: they can reserve an address space
  328. instead of allocating memory. We can safely allocate memory pages inside this
  329. address space, so the stack could grow without moving memory data (this is
  330. important because of pointers). Thus we can allocate 1M address space, and use
  331. only a single memory page (usually 4K) if that is enough. However, we can still
  332. grow up to 1M anytime if needed.
  333. </P>
  334. <P>
  335. (3) Who "owns" a JIT stack?
  336. <br>
  337. <br>
  338. The owner of the stack is the user program, not the JIT studied pattern or
  339. anything else. The user program must ensure that if a stack is used by
  340. <b>pcre_exec()</b>, (that is, it is assigned to the pattern currently running),
  341. that stack must not be used by any other threads (to avoid overwriting the same
  342. memory area). The best practice for multithreaded programs is to allocate a
  343. stack for each thread, and return this stack through the JIT callback function.
  344. </P>
  345. <P>
  346. (4) When should a JIT stack be freed?
  347. <br>
  348. <br>
  349. You can free a JIT stack at any time, as long as it will not be used by
  350. <b>pcre_exec()</b> again. When you assign the stack to a pattern, only a pointer
  351. is set. There is no reference counting or any other magic. You can free the
  352. patterns and stacks in any order, anytime. Just <i>do not</i> call
  353. <b>pcre_exec()</b> with a pattern pointing to an already freed stack, as that
  354. will cause SEGFAULT. (Also, do not free a stack currently used by
  355. <b>pcre_exec()</b> in another thread). You can also replace the stack for a
  356. pattern at any time. You can even free the previous stack before assigning a
  357. replacement.
  358. </P>
  359. <P>
  360. (5) Should I allocate/free a stack every time before/after calling
  361. <b>pcre_exec()</b>?
  362. <br>
  363. <br>
  364. No, because this is too costly in terms of resources. However, you could
  365. implement some clever idea which release the stack if it is not used in let's
  366. say two minutes. The JIT callback can help to achieve this without keeping a
  367. list of the currently JIT studied patterns.
  368. </P>
  369. <P>
  370. (6) OK, the stack is for long term memory allocation. But what happens if a
  371. pattern causes stack overflow with a stack of 1M? Is that 1M kept until the
  372. stack is freed?
  373. <br>
  374. <br>
  375. Especially on embedded sytems, it might be a good idea to release memory
  376. sometimes without freeing the stack. There is no API for this at the moment.
  377. Probably a function call which returns with the currently allocated memory for
  378. any stack and another which allows releasing memory (shrinking the stack) would
  379. be a good idea if someone needs this.
  380. </P>
  381. <P>
  382. (7) This is too much of a headache. Isn't there any better solution for JIT
  383. stack handling?
  384. <br>
  385. <br>
  386. No, thanks to Windows. If POSIX threads were used everywhere, we could throw
  387. out this complicated API.
  388. </P>
  389. <br><a name="SEC10" href="#TOC1">EXAMPLE CODE</a><br>
  390. <P>
  391. This is a single-threaded example that specifies a JIT stack without using a
  392. callback.
  393. <pre>
  394. int rc;
  395. int ovector[30];
  396. pcre *re;
  397. pcre_extra *extra;
  398. pcre_jit_stack *jit_stack;
  399. re = pcre_compile(pattern, 0, &error, &erroffset, NULL);
  400. /* Check for errors */
  401. extra = pcre_study(re, PCRE_STUDY_JIT_COMPILE, &error);
  402. jit_stack = pcre_jit_stack_alloc(32*1024, 512*1024);
  403. /* Check for error (NULL) */
  404. pcre_assign_jit_stack(extra, NULL, jit_stack);
  405. rc = pcre_exec(re, extra, subject, length, 0, 0, ovector, 30);
  406. /* Check results */
  407. pcre_free(re);
  408. pcre_free_study(extra);
  409. pcre_jit_stack_free(jit_stack);
  410. </PRE>
  411. </P>
  412. <br><a name="SEC11" href="#TOC1">JIT FAST PATH API</a><br>
  413. <P>
  414. Because the API described above falls back to interpreted execution when JIT is
  415. not available, it is convenient for programs that are written for general use
  416. in many environments. However, calling JIT via <b>pcre_exec()</b> does have a
  417. performance impact. Programs that are written for use where JIT is known to be
  418. available, and which need the best possible performance, can instead use a
  419. "fast path" API to call JIT execution directly instead of calling
  420. <b>pcre_exec()</b> (obviously only for patterns that have been successfully
  421. studied by JIT).
  422. </P>
  423. <P>
  424. The fast path function is called <b>pcre_jit_exec()</b>, and it takes exactly
  425. the same arguments as <b>pcre_exec()</b>, plus one additional argument that
  426. must point to a JIT stack. The JIT stack arrangements described above do not
  427. apply. The return values are the same as for <b>pcre_exec()</b>.
  428. </P>
  429. <P>
  430. When you call <b>pcre_exec()</b>, as well as testing for invalid options, a
  431. number of other sanity checks are performed on the arguments. For example, if
  432. the subject pointer is NULL, or its length is negative, an immediate error is
  433. given. Also, unless PCRE_NO_UTF[8|16|32] is set, a UTF subject string is tested
  434. for validity. In the interests of speed, these checks do not happen on the JIT
  435. fast path, and if invalid data is passed, the result is undefined.
  436. </P>
  437. <P>
  438. Bypassing the sanity checks and the <b>pcre_exec()</b> wrapping can give
  439. speedups of more than 10%.
  440. </P>
  441. <P>
  442. Note that the <b>pcre_jit_exec()</b> function is not available in versions of
  443. PCRE before 8.32 (released in November 2012). If you need to support versions
  444. that old you must either use the slower <b>pcre_exec()</b>, or switch between
  445. the two codepaths by checking the values of PCRE_MAJOR and PCRE_MINOR.
  446. </P>
  447. <P>
  448. Due to an unfortunate implementation oversight, even in versions 8.32
  449. and later there will be no <b>pcre_jit_exec()</b> stub function defined
  450. when PCRE is compiled with --disable-jit, which is the default, and
  451. there's no way to detect whether PCRE was compiled with --enable-jit
  452. via a macro.
  453. </P>
  454. <P>
  455. If you need to support versions older than 8.32, or versions that may
  456. not build with --enable-jit, you must either use the slower
  457. <b>pcre_exec()</b>, or switch between the two codepaths by checking the
  458. values of PCRE_MAJOR and PCRE_MINOR.
  459. </P>
  460. <P>
  461. Switching between the two by checking the version assumes that all the
  462. versions being targeted are built with --enable-jit. To also support
  463. builds that may use --disable-jit either <b>pcre_exec()</b> must be
  464. used, or a compile-time check for JIT via <b>pcre_config()</b> (which
  465. assumes the runtime environment will be the same), or as the Git
  466. project decided to do, simply assume that <b>pcre_jit_exec()</b> is
  467. present in 8.32 or later unless a compile-time flag is provided, see
  468. the "grep: un-break building with PCRE &#62;= 8.32 without --enable-jit"
  469. commit in git.git for an example of that.
  470. </P>
  471. <br><a name="SEC12" href="#TOC1">SEE ALSO</a><br>
  472. <P>
  473. <b>pcreapi</b>(3)
  474. </P>
  475. <br><a name="SEC13" href="#TOC1">AUTHOR</a><br>
  476. <P>
  477. Philip Hazel (FAQ by Zoltan Herczeg)
  478. <br>
  479. University Computing Service
  480. <br>
  481. Cambridge CB2 3QH, England.
  482. <br>
  483. </P>
  484. <br><a name="SEC14" href="#TOC1">REVISION</a><br>
  485. <P>
  486. Last updated: 05 July 2017
  487. <br>
  488. Copyright &copy; 1997-2017 University of Cambridge.
  489. <br>
  490. <p>
  491. Return to the <a href="index.html">PCRE index page</a>.
  492. </p>