This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
pp_regcomp(): fix refcnt issue with qr_anoncv
[perl5.git] / regcomp.h
CommitLineData
a0d0e21e 1/* regcomp.h
d6376244 2 *
4bb101f2 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
663f364b 4 * 2000, 2001, 2002, 2003, 2005, 2006, 2007, by Larry Wall and others
d6376244
JH
5 *
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
8 *
a687059c 9 */
e1d1eefb 10#include "regcharclass.h"
a687059c 11
c277df42
IZ
12typedef OP OP_4tree; /* Will be redefined later. */
13
07be1b83 14
58e23c8d 15/* Convert branch sequences to more efficient trie ops? */
07be1b83 16#define PERL_ENABLE_TRIE_OPTIMISATION 1
58e23c8d 17
486ec47a 18/* Be really aggressive about optimising patterns with trie sequences? */
07be1b83 19#define PERL_ENABLE_EXTENDED_TRIE_OPTIMISATION 1
58e23c8d
YO
20
21/* Should the optimiser take positive assertions into account? */
68ba3a3f 22#define PERL_ENABLE_POSITIVE_ASSERTION_STUDY 0
58e23c8d
YO
23
24/* Not for production use: */
07be1b83 25#define PERL_ENABLE_EXPERIMENTAL_REGEX_OPTIMISATIONS 0
58e23c8d 26
7122b237
YO
27/* Activate offsets code - set to if 1 to enable */
28#ifdef DEBUGGING
29#define RE_TRACK_PATTERN_OFFSETS
30#endif
31
b9b4dddf
YO
32/* Unless the next line is uncommented it is illegal to combine lazy
33 matching with possessive matching. Frankly it doesn't make much sense
34 to allow it as X*?+ matches nothing, X+?+ matches a single char only,
35 and X{min,max}?+ matches min times only.
36 */
37/* #define REG_ALLOW_MINMOD_SUSPEND */
07be1b83 38
a687059c
LW
39/*
40 * The "internal use only" fields in regexp.h are present to pass info from
41 * compile to execute that permits the execute phase to run lots faster on
42 * simple cases. They are:
43 *
bd61b366 44 * regstart sv that must begin a match; NULL if none obvious
a687059c
LW
45 * reganch is the match anchored (at beginning-of-line only)?
46 * regmust string (pointer into program) that match must include, or NULL
79072805 47 * [regmust changed to SV* for bminstr()--law]
a687059c
LW
48 * regmlen length of regmust string
49 * [regmlen not used currently]
50 *
51 * Regstart and reganch permit very fast decisions on suitable starting points
52 * for a match, cutting down the work a lot. Regmust permits fast rejection
53 * of lines that cannot possibly match. The regmust tests are costly enough
e50aee73 54 * that pregcomp() supplies a regmust only if the r.e. contains something
a687059c
LW
55 * potentially expensive (at present, the only such thing detected is * or +
56 * at the start of the r.e., which can involve a lot of backup). Regmlen is
e50aee73 57 * supplied because the test in pregexec() needs it and pregcomp() is computing
a687059c
LW
58 * it anyway.
59 * [regmust is now supplied always. The tests that use regmust have a
60 * heuristic that disables the test if it usually matches.]
61 *
62 * [In fact, we now use regmust in many cases to locate where the search
63 * starts in the string, so if regback is >= 0, the regmust search is never
64 * wasted effort. The regback variable says how many characters back from
65 * where regmust matched is the earliest possible start of the match.
66 * For instance, /[a-z].foo/ has a regmust of 'foo' and a regback of 2.]
67 */
68
69/*
70 * Structure for regexp "program". This is essentially a linear encoding
71 * of a nondeterministic finite-state machine (aka syntax charts or
72 * "railroad normal form" in parsing technology). Each node is an opcode
73 * plus a "next" pointer, possibly plus an operand. "Next" pointers of
74 * all nodes except BRANCH implement concatenation; a "next" pointer with
75 * a BRANCH on both ends of it is connecting two alternatives. (Here we
76 * have one of the subtle syntax dependencies: an individual BRANCH (as
77 * opposed to a collection of them) is never concatenated with anything
78 * because of operator precedence.) The operand of some types of node is
79 * a literal string; for others, it is a node leading into a sub-FSM. In
80 * particular, the operand of a BRANCH node is the first node of the branch.
81 * (NB this is *not* a tree structure: the tail of the branch connects
a3621e74
YO
82 * to the thing following the set of BRANCHes.) The opcodes are defined
83 * in regnodes.h which is generated from regcomp.sym by regcomp.pl.
a687059c
LW
84 */
85
a687059c
LW
86/*
87 * A node is one char of opcode followed by two chars of "next" pointer.
88 * "Next" pointers are stored as two 8-bit pieces, high order first. The
89 * value is a positive offset from the opcode of the node containing it.
90 * An operand, if any, simply follows the node. (Note that much of the
91 * code generation knows about this implicit relationship.)
92 *
93 * Using two bytes for the "next" pointer is vast overkill for most things,
94 * but allows patterns to get big without disasters.
95 *
e91177ed 96 * [The "next" pointer is always aligned on an even
a687059c
LW
97 * boundary, and reads the offset directly as a short. Also, there is no
98 * special test to reverse the sign of BACK pointers since the offset is
99 * stored negative.]
100 */
785a26d5
YO
101
102/* This is the stuff that used to live in regexp.h that was truly
103 private to the engine itself. It now lives here. */
104
28d8d7f4 105
785a26d5
YO
106
107 typedef struct regexp_internal {
1f1031fe 108 int name_list_idx; /* Optional data index of an array of paren names */
7122b237
YO
109 union {
110 U32 *offsets; /* offset annotations 20001228 MJD
111 data about mapping the program to the
112 string -
113 offsets[0] is proglen when this is used
114 */
115 U32 proglen;
116 } u;
117
6d5c990f
RGS
118 regnode *regstclass; /* Optional startclass as identified or constructed
119 by the optimiser */
120 struct reg_data *data; /* Additional miscellaneous data used by the program.
121 Used to make it easier to clone and free arbitrary
122 data that the regops need. Often the ARG field of
123 a regop is an index into this structure */
124 regnode program[1]; /* Unwarranted chumminess with compiler. */
125} regexp_internal;
126
127#define RXi_SET(x,y) (x)->pprivate = (void*)(y)
128#define RXi_GET(x) ((regexp_internal *)((x)->pprivate))
129#define RXi_GET_DECL(r,ri) regexp_internal *ri = RXi_GET(r)
785a26d5
YO
130/*
131 * Flags stored in regexp->intflags
132 * These are used only internally to the regexp engine
133 *
134 * See regexp.h for flags used externally to the regexp engine
135 */
136#define PREGf_SKIP 0x00000001
137#define PREGf_IMPLICIT 0x00000002 /* Converted .* to ^.* */
138#define PREGf_NAUGHTY 0x00000004 /* how exponential is this pattern? */
139#define PREGf_VERBARG_SEEN 0x00000008
140#define PREGf_CUTGROUP_SEEN 0x00000010
141
142
143/* this is where the old regcomp.h started */
a687059c 144
c277df42 145struct regnode_string {
cd439c50 146 U8 str_len;
c277df42
IZ
147 U8 type;
148 U16 next_off;
cd439c50 149 char string[1];
c277df42 150};
a687059c 151
6bda09f9
YO
152/* Argument bearing node - workhorse,
153 arg1 is often for the data field */
c277df42
IZ
154struct regnode_1 {
155 U8 flags;
156 U8 type;
157 U16 next_off;
158 U32 arg1;
159};
160
6bda09f9
YO
161/* Similar to a regnode_1 but with an extra signed argument */
162struct regnode_2L {
163 U8 flags;
164 U8 type;
165 U16 next_off;
166 U32 arg1;
167 I32 arg2;
168};
169
170/* 'Two field' -- Two 16 bit unsigned args */
c277df42
IZ
171struct regnode_2 {
172 U8 flags;
173 U8 type;
174 U16 next_off;
175 U16 arg1;
176 U16 arg2;
177};
178
6bda09f9 179
936ed897 180#define ANYOF_BITMAP_SIZE 32 /* 256 b/(8 b/B) */
d1eb3177 181#define ANYOF_CLASSBITMAP_SIZE 4 /* up to 32 (8*4) named classes */
936ed897 182
786e8c11 183/* also used by trie */
936ed897
IZ
184struct regnode_charclass {
185 U8 flags;
186 U8 type;
187 U16 next_off;
bf3f2d85 188 U32 arg1; /* used as ptr in S_regclass */
19103b91 189 char bitmap[ANYOF_BITMAP_SIZE]; /* only compile-time */
936ed897
IZ
190};
191
bf3f2d85
KW
192/* has runtime (locale) \d, \w, ..., [:posix:] classes */
193struct regnode_charclass_class {
194 U8 flags; /* ANYOF_CLASS bit must go here */
936ed897
IZ
195 U8 type;
196 U16 next_off;
bf3f2d85 197 U32 arg1; /* used as ptr in S_regclass */
19103b91
JH
198 char bitmap[ANYOF_BITMAP_SIZE]; /* both compile-time */
199 char classflags[ANYOF_CLASSBITMAP_SIZE]; /* and run-time */
936ed897
IZ
200};
201
9c7e81e8
AD
202/* XXX fix this description.
203 Impose a limit of REG_INFTY on various pattern matching operations
204 to limit stack growth and to avoid "infinite" recursions.
205*/
206/* The default size for REG_INFTY is I16_MAX, which is the same as
207 SHORT_MAX (see perl.h). Unfortunately I16 isn't necessarily 16 bits
208 (see handy.h). On the Cray C90, sizeof(short)==4 and hence I16_MAX is
209 ((1<<31)-1), while on the Cray T90, sizeof(short)==8 and I16_MAX is
210 ((1<<63)-1). To limit stack growth to reasonable sizes, supply a
211 smaller default.
212 --Andy Dougherty 11 June 1998
213*/
214#if SHORTSIZE > 2
215# ifndef REG_INFTY
216# define REG_INFTY ((1<<15)-1)
217# endif
218#endif
219
220#ifndef REG_INFTY
83cfe48c
IZ
221# define REG_INFTY I16_MAX
222#endif
a687059c 223
e91177ed
IZ
224#define ARG_VALUE(arg) (arg)
225#define ARG__SET(arg,val) ((arg) = (val))
c277df42 226
e8e3b0fb
JH
227#undef ARG
228#undef ARG1
229#undef ARG2
230
c277df42
IZ
231#define ARG(p) ARG_VALUE(ARG_LOC(p))
232#define ARG1(p) ARG_VALUE(ARG1_LOC(p))
233#define ARG2(p) ARG_VALUE(ARG2_LOC(p))
6bda09f9 234#define ARG2L(p) ARG_VALUE(ARG2L_LOC(p))
786e8c11 235
c277df42
IZ
236#define ARG_SET(p, val) ARG__SET(ARG_LOC(p), (val))
237#define ARG1_SET(p, val) ARG__SET(ARG1_LOC(p), (val))
238#define ARG2_SET(p, val) ARG__SET(ARG2_LOC(p), (val))
6bda09f9 239#define ARG2L_SET(p, val) ARG__SET(ARG2L_LOC(p), (val))
c277df42 240
e8e3b0fb
JH
241#undef NEXT_OFF
242#undef NODE_ALIGN
243
075abff3
AL
244#define NEXT_OFF(p) ((p)->next_off)
245#define NODE_ALIGN(node)
246#define NODE_ALIGN_FILL(node) ((node)->flags = 0xde) /* deadbeef */
a687059c 247
c277df42
IZ
248#define SIZE_ALIGN NODE_ALIGN
249
e8e3b0fb
JH
250#undef OP
251#undef OPERAND
252#undef MASK
253#undef STRING
254
e91177ed 255#define OP(p) ((p)->type)
b988e673
KW
256#define FLAGS(p) ((p)->flags) /* Caution: Doesn't apply to all \
257 regnode types. For some, it's the \
258 character set of the regnode */
e91177ed 259#define OPERAND(p) (((struct regnode_string *)p)->string)
cd439c50
IZ
260#define MASK(p) ((char*)OPERAND(p))
261#define STR_LEN(p) (((struct regnode_string *)p)->str_len)
262#define STRING(p) (((struct regnode_string *)p)->string)
263#define STR_SZ(l) ((l + sizeof(regnode) - 1) / sizeof(regnode))
264#define NODE_SZ_STR(p) (STR_SZ(STR_LEN(p))+1)
265
e8e3b0fb
JH
266#undef NODE_ALIGN
267#undef ARG_LOC
268#undef NEXTOPER
269#undef PREVOPER
270
e91177ed
IZ
271#define NODE_ALIGN(node)
272#define ARG_LOC(p) (((struct regnode_1 *)p)->arg1)
273#define ARG1_LOC(p) (((struct regnode_2 *)p)->arg1)
274#define ARG2_LOC(p) (((struct regnode_2 *)p)->arg2)
6bda09f9 275#define ARG2L_LOC(p) (((struct regnode_2L *)p)->arg2)
786e8c11 276
e91177ed
IZ
277#define NODE_STEP_REGNODE 1 /* sizeof(regnode)/sizeof(regnode) */
278#define EXTRA_STEP_2ARGS EXTRA_SIZE(struct regnode_2)
279
280#define NODE_STEP_B 4
c277df42
IZ
281
282#define NEXTOPER(p) ((p) + NODE_STEP_REGNODE)
283#define PREVOPER(p) ((p) - NODE_STEP_REGNODE)
284
e91177ed 285#define FILL_ADVANCE_NODE(ptr, op) STMT_START { \
c277df42 286 (ptr)->type = op; (ptr)->next_off = 0; (ptr)++; } STMT_END
e91177ed 287#define FILL_ADVANCE_NODE_ARG(ptr, op, arg) STMT_START { \
c277df42 288 ARG_SET(ptr, arg); FILL_ADVANCE_NODE(ptr, op); (ptr) += 1; } STMT_END
a687059c 289
22c35a8c 290#define REG_MAGIC 0234
a687059c 291
830247a4 292#define SIZE_ONLY (RExC_emit == &PL_regdummy)
c277df42 293
137165a6
KW
294/* If the bitmap doesn't fully represent what this ANYOF node can match, the
295 * ARG is set to this special value (since 0, 1, ... are legal, but will never
296 * reach this high). */
297#define ANYOF_NONBITMAP_EMPTY ((U32) -1)
298
299/* The information used to be stored as as combination of the ANYOF_UTF8 and
300 * ANYOF_NONBITMAP_NON_UTF8 bits in the flags field, but was moved out of there
301 * to free up a bit for other uses. This tries to hide the change from
302 * existing code as much as possible. Now, the data structure that goes in ARG
303 * is not allocated unless it is needed, and that is what is used to determine
304 * if there is something outside the bitmap. The code now assumes that if
305 * that structure exists, that any UTF-8 encoded string should be tried against
306 * it, but a non-UTF8-encoded string will be tried only if the
307 * ANYOF_NONBITMAP_NON_UTF8 bit is also set. */
308#define ANYOF_NONBITMAP(node) (ARG(node) != ANYOF_NONBITMAP_EMPTY)
309
d5788240 310/* Flags for node->flags of ANYOF. These are in short supply, so some games
f4244008 311 * are done to share them, as described below. If necessary, the ANYOF_LOCALE
dd58aee1
KW
312 * and ANYOF_CLASS bits could be shared with a space penalty for locale nodes,
313 * but this isn't quite so easy, as the optimizer also uses ANYOF_CLASS.
dbe7a391
KW
314 * Another option would be to push them into new nodes. E.g. there could be an
315 * ANYOF_LOCALE node that would be in place of the flag of the same name.
dd58aee1
KW
316 * Once the planned change to compile all the above-latin1 code points is done,
317 * then the UNICODE_ALL bit can be freed up, with a small performance penalty.
318 * If flags need to be added that are applicable to the synthetic start class
319 * only, with some work, they could be put in the next-node field, or in an
320 * unused bit of the classflags field. */
b8c5462f 321
a4e790c1 322#define ANYOF_LOCALE 0x01 /* /l modifier */
39065660
KW
323
324/* The fold is calculated and stored in the bitmap where possible at compile
325 * time. However there are two cases where it isn't possible. These share
326 * this bit: 1) under locale, where the actual folding varies depending on
327 * what the locale is at the time of execution; and 2) where the folding is
328 * specified in a swash, not the bitmap, such as characters which aren't
329 * specified in the bitmap, or properties that aren't looked at at compile time
330 */
331#define ANYOF_LOC_NONBITMAP_FOLD 0x02
332
333#define ANYOF_INVERT 0x04
1984f6a0 334
dd58aee1
KW
335/* Set if this is a struct regnode_charclass_class vs a regnode_charclass. This
336 * is used for runtime \d, \w, [:posix:], ..., which are used only in locale
337 * and the optimizer's synthetic start class. Non-locale \d, etc are resolved
338 * at compile-time */
c8d3cd88
KW
339#define ANYOF_CLASS 0x08
340#define ANYOF_LARGE ANYOF_CLASS /* Same; name retained for back compat */
341
f4244008 342/* EOS, meaning that it can match an empty string too, is used for the
c613755a 343 * synthetic start class only. */
84193928 344#define ANYOF_EOS 0x10
f4244008 345
c613755a
KW
346/* ? Is this node the synthetic start class (ssc). This bit is shared with
347 * ANYOF_EOS, as the latter is used only for the ssc, and then not used by
348 * regexec.c. And, the code is structured so that if it is set, the ssc is
349 * not used, so it is guaranteed to be 0 for the ssc by the time regexec.c
350 * gets executed, and 0 for a non-ssc ANYOF node, as it only ever gets set for
351 * a potential ssc candidate. Thus setting it to 1 after it has been
352 * determined that the ssc will be used is not ambiguous */
353#define ANYOF_IS_SYNTHETIC ANYOF_EOS
354
ef87b810
KW
355/* Can match something outside the bitmap that isn't in utf8 */
356#define ANYOF_NONBITMAP_NON_UTF8 0x20
357
61ef9872
KW
358/* Matches every code point 0x100 and above*/
359#define ANYOF_UNICODE_ALL 0x40
ffc61ed2 360
11454c59
KW
361/* Match all Latin1 characters that aren't ASCII when the target string is not
362 * in utf8. */
363#define ANYOF_NON_UTF8_LATIN1_ALL 0x80
364
ffc61ed2 365#define ANYOF_FLAGS_ALL 0xff
653099ff 366
ace6b0e4
KW
367/* These are the flags that ANYOF_INVERT being set or not doesn't affect
368 * whether they are operative or not. e.g., the node still has LOCALE
369 * regardless of being inverted; whereas ANYOF_UNICODE_ALL means something
370 * different if inverted */
371#define INVERSION_UNAFFECTED_FLAGS (ANYOF_LOCALE \
372 |ANYOF_LOC_NONBITMAP_FOLD \
373 |ANYOF_CLASS \
374 |ANYOF_EOS \
375 |ANYOF_NONBITMAP_NON_UTF8)
376
936ed897 377/* Character classes for node->classflags of ANYOF */
653099ff
GS
378/* Should be synchronized with a table in regprop() */
379/* 2n should pair with 2n+1 */
b8c5462f 380
289d4f09 381#define ANYOF_ALNUM 0 /* \w, PL_utf8_alnum, utf8::IsWord, ALNUM */
b8c5462f 382#define ANYOF_NALNUM 1
aaa51d5e 383#define ANYOF_SPACE 2 /* \s */
b8c5462f 384#define ANYOF_NSPACE 3
24d786f4 385#define ANYOF_DIGIT 4 /* \d */
b8c5462f 386#define ANYOF_NDIGIT 5
24d786f4 387#define ANYOF_ALNUMC 6 /* [[:alnum:]] isalnum(3), utf8::IsAlnum, ALNUMC */
b8c5462f
JH
388#define ANYOF_NALNUMC 7
389#define ANYOF_ALPHA 8
390#define ANYOF_NALPHA 9
391#define ANYOF_ASCII 10
392#define ANYOF_NASCII 11
393#define ANYOF_CNTRL 12
394#define ANYOF_NCNTRL 13
395#define ANYOF_GRAPH 14
396#define ANYOF_NGRAPH 15
397#define ANYOF_LOWER 16
398#define ANYOF_NLOWER 17
399#define ANYOF_PRINT 18
400#define ANYOF_NPRINT 19
401#define ANYOF_PUNCT 20
402#define ANYOF_NPUNCT 21
403#define ANYOF_UPPER 22
404#define ANYOF_NUPPER 23
405#define ANYOF_XDIGIT 24
406#define ANYOF_NXDIGIT 25
aaa51d5e
JF
407#define ANYOF_PSXSPC 26 /* POSIX space: \s plus the vertical tab */
408#define ANYOF_NPSXSPC 27
ffc61ed2 409#define ANYOF_BLANK 28 /* GNU extension: space and tab: non-vertical space */
289d4f09 410#define ANYOF_NBLANK 29
b8c5462f 411
aaa51d5e 412#define ANYOF_MAX 32
b8c5462f 413
e1d1eefb
YO
414/* pseudo classes, not stored in the class bitmap, but used as flags
415 during compilation of char classes */
416
417#define ANYOF_VERTWS (ANYOF_MAX+1)
418#define ANYOF_NVERTWS (ANYOF_MAX+2)
419#define ANYOF_HORIZWS (ANYOF_MAX+3)
420#define ANYOF_NHORIZWS (ANYOF_MAX+4)
421
b8c5462f
JH
422/* Backward source code compatibility. */
423
424#define ANYOF_ALNUML ANYOF_ALNUM
425#define ANYOF_NALNUML ANYOF_NALNUM
426#define ANYOF_SPACEL ANYOF_SPACE
427#define ANYOF_NSPACEL ANYOF_NSPACE
428
429/* Utility macros for the bitmap and classes of ANYOF */
430
936ed897
IZ
431#define ANYOF_SIZE (sizeof(struct regnode_charclass))
432#define ANYOF_CLASS_SIZE (sizeof(struct regnode_charclass_class))
b8c5462f 433
936ed897 434#define ANYOF_FLAGS(p) ((p)->flags)
b8c5462f
JH
435
436#define ANYOF_BIT(c) (1 << ((c) & 7))
437
936ed897 438#define ANYOF_CLASS_BYTE(p, c) (((struct regnode_charclass_class*)(p))->classflags[((c) >> 3) & 3])
b8c5462f
JH
439#define ANYOF_CLASS_SET(p, c) (ANYOF_CLASS_BYTE(p, c) |= ANYOF_BIT(c))
440#define ANYOF_CLASS_CLEAR(p, c) (ANYOF_CLASS_BYTE(p, c) &= ~ANYOF_BIT(c))
441#define ANYOF_CLASS_TEST(p, c) (ANYOF_CLASS_BYTE(p, c) & ANYOF_BIT(c))
442
936ed897 443#define ANYOF_CLASS_ZERO(ret) Zero(((struct regnode_charclass_class*)(ret))->classflags, ANYOF_CLASSBITMAP_SIZE, char)
ab753c70
KW
444#define ANYOF_CLASS_SETALL(ret) \
445 memset (((struct regnode_charclass_class*)(ret))->classflags, 255, ANYOF_CLASSBITMAP_SIZE)
936ed897
IZ
446#define ANYOF_BITMAP_ZERO(ret) Zero(((struct regnode_charclass*)(ret))->bitmap, ANYOF_BITMAP_SIZE, char)
447
448#define ANYOF_BITMAP(p) (((struct regnode_charclass*)(p))->bitmap)
786e8c11 449#define ANYOF_BITMAP_BYTE(p, c) (ANYOF_BITMAP(p)[(((U8)(c)) >> 3) & 31])
b8c5462f
JH
450#define ANYOF_BITMAP_SET(p, c) (ANYOF_BITMAP_BYTE(p, c) |= ANYOF_BIT(c))
451#define ANYOF_BITMAP_CLEAR(p,c) (ANYOF_BITMAP_BYTE(p, c) &= ~ANYOF_BIT(c))
452#define ANYOF_BITMAP_TEST(p, c) (ANYOF_BITMAP_BYTE(p, c) & ANYOF_BIT(c))
453
f8bef550
NC
454#define ANYOF_BITMAP_SETALL(p) \
455 memset (ANYOF_BITMAP(p), 255, ANYOF_BITMAP_SIZE)
456#define ANYOF_BITMAP_CLEARALL(p) \
457 Zero (ANYOF_BITMAP(p), ANYOF_BITMAP_SIZE)
458/* Check that all 256 bits are all set. Used in S_cl_is_anything() */
c355c09a 459#define ANYOF_BITMAP_TESTALLSET(p) /* Assumes sizeof(p) == 32 */ \
f8bef550
NC
460 memEQ (ANYOF_BITMAP(p), "\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377\377", ANYOF_BITMAP_SIZE)
461
936ed897
IZ
462#define ANYOF_SKIP ((ANYOF_SIZE - 1)/sizeof(regnode))
463#define ANYOF_CLASS_SKIP ((ANYOF_CLASS_SIZE - 1)/sizeof(regnode))
3a15e693 464
dd58aee1
KW
465#if ANYOF_CLASSBITMAP_SIZE != 4
466# error ANYOF_CLASSBITMAP_SIZE is expected to be 4
3a15e693 467#endif
dd58aee1
KW
468#define ANYOF_CLASS_TEST_ANY_SET(p) ((ANYOF_FLAGS(p) & ANYOF_CLASS) \
469 && memNE (((struct regnode_charclass_class*)(p))->classflags, \
470 "\0\0\0\0", ANYOF_CLASSBITMAP_SIZE))
471/*#define ANYOF_CLASS_ADD_SKIP (ANYOF_CLASS_SKIP - ANYOF_SKIP)
472 * */
c277df42 473
786e8c11 474
a687059c
LW
475/*
476 * Utility definitions.
477 */
2304df62 478#ifndef CHARMASK
075abff3 479# define UCHARAT(p) ((int)*(const U8*)(p))
a687059c 480#else
075abff3 481# define UCHARAT(p) ((int)*(p)&CHARMASK)
a687059c 482#endif
a687059c 483
c277df42
IZ
484#define EXTRA_SIZE(guy) ((sizeof(guy)-1)/sizeof(struct regnode))
485
3dab1dad
YO
486#define REG_SEEN_ZERO_LEN 0x00000001
487#define REG_SEEN_LOOKBEHIND 0x00000002
488#define REG_SEEN_GPOS 0x00000004
489#define REG_SEEN_EVAL 0x00000008
490#define REG_SEEN_CANY 0x00000010
cce850e4 491#define REG_SEEN_SANY REG_SEEN_CANY /* src bckwrd cmpt */
6bda09f9 492#define REG_SEEN_RECURSE 0x00000020
eaf3ca90 493#define REG_TOP_LEVEL_BRANCHES 0x00000040
e2e6a0f1 494#define REG_SEEN_VERBARG 0x00000080
5d458dd8 495#define REG_SEEN_CUTGROUP 0x00000100
bcdf7404 496#define REG_SEEN_RUN_ON_COMMENT 0x00000200
bb914485 497#define REG_SEEN_EXACTF_SHARP_S 0x00000400
d09b2d29 498
73c4f7a1
GS
499START_EXTERN_C
500
be8e71aa
YO
501#ifdef PLUGGABLE_RE_EXTENSION
502#include "re_nodes.h"
503#else
d09b2d29 504#include "regnodes.h"
be8e71aa 505#endif
d09b2d29 506
f9f4320a
YO
507#ifndef PLUGGABLE_RE_EXTENSION
508#ifndef DOINIT
509EXTCONST regexp_engine PL_core_reg_engine;
510#else /* DOINIT */
511EXTCONST regexp_engine PL_core_reg_engine = {
fe578d7f 512 Perl_re_compile,
2fdbfb4d 513 Perl_regexec_flags,
f9f4320a
YO
514 Perl_re_intuit_start,
515 Perl_re_intuit_string,
2fdbfb4d
AB
516 Perl_regfree_internal,
517 Perl_reg_numbered_buff_fetch,
518 Perl_reg_numbered_buff_store,
519 Perl_reg_numbered_buff_length,
192b9cd1
AB
520 Perl_reg_named_buff,
521 Perl_reg_named_buff_iter,
49d7dfbc 522 Perl_reg_qr_package,
f9f4320a 523#if defined(USE_ITHREADS)
f8149455 524 Perl_regdupe_internal
f9f4320a
YO
525#endif
526};
527#endif /* DOINIT */
528#endif /* PLUGGABLE_RE_EXTENSION */
529
530
73c4f7a1 531END_EXTERN_C
cad2e5aa 532
cad2e5aa 533
261faec3
MJD
534/* .what is a character array with one character for each member of .data
535 * The character describes the function of the corresponding .data item:
af534a04 536 * a - AV for paren_name_list under DEBUGGING
0111c4fd 537 * f - start-class data for regstclass optimization
68e2671b 538 * l - start op for literal (?{EVAL}) item
d63c20f2 539 * L - start op for literal (?{EVAL}) item, with separate CV (qr//)
261faec3
MJD
540 * n - Root of op tree for (?{EVAL}) item
541 * o - Start op for (?{EVAL}) item
3dab1dad 542 * p - Pad for (?{EVAL}) item
38a44b82 543 * s - swash for Unicode-style character class, and the multicharacter
9e55ce06
JH
544 * strings resulting from casefolding the single-character entries
545 * in the character class
a3621e74 546 * t - trie struct
55eed653 547 * u - trie struct's widecharmap (a HV, so can't share, must dup)
2b8b4781 548 * also used for revcharmap and words under DEBUGGING
07be1b83 549 * T - aho-trie struct
81714fb9 550 * S - sv for named capture lookup
261faec3 551 * 20010712 mjd@plover.com
c3613ed7 552 * (Remember to update re_dup() and pregfree() if you add any items.)
261faec3 553 */
cad2e5aa
JH
554struct reg_data {
555 U32 count;
556 U8 *what;
557 void* data[1];
558};
559
a1cac82e
NC
560/* Code in S_to_utf8_substr() and S_to_byte_substr() in regexec.c accesses
561 anchored* and float* via array indexes 0 and 1. */
cad2e5aa 562#define anchored_substr substrs->data[0].substr
33b8afdf 563#define anchored_utf8 substrs->data[0].utf8_substr
cad2e5aa 564#define anchored_offset substrs->data[0].min_offset
1de06328
YO
565#define anchored_end_shift substrs->data[0].end_shift
566
cad2e5aa 567#define float_substr substrs->data[1].substr
33b8afdf 568#define float_utf8 substrs->data[1].utf8_substr
cad2e5aa
JH
569#define float_min_offset substrs->data[1].min_offset
570#define float_max_offset substrs->data[1].max_offset
1de06328
YO
571#define float_end_shift substrs->data[1].end_shift
572
cad2e5aa 573#define check_substr substrs->data[2].substr
33b8afdf 574#define check_utf8 substrs->data[2].utf8_substr
cad2e5aa
JH
575#define check_offset_min substrs->data[2].min_offset
576#define check_offset_max substrs->data[2].max_offset
1de06328 577#define check_end_shift substrs->data[2].end_shift
a3621e74 578
288b8c02
NC
579#define RX_ANCHORED_SUBSTR(rx) (((struct regexp *)SvANY(rx))->anchored_substr)
580#define RX_ANCHORED_UTF8(rx) (((struct regexp *)SvANY(rx))->anchored_utf8)
581#define RX_FLOAT_SUBSTR(rx) (((struct regexp *)SvANY(rx))->float_substr)
582#define RX_FLOAT_UTF8(rx) (((struct regexp *)SvANY(rx))->float_utf8)
a3621e74
YO
583
584/* trie related stuff */
5d9a96ca 585
a3621e74
YO
586/* a transition record for the state machine. the
587 check field determines which state "owns" the
588 transition. the char the transition is for is
589 determined by offset from the owning states base
590 field. the next field determines which state
591 is to be transitioned to if any.
592*/
593struct _reg_trie_trans {
594 U32 next;
595 U32 check;
596};
597
598/* a transition list element for the list based representation */
599struct _reg_trie_trans_list_elem {
600 U16 forid;
601 U32 newstate;
602};
603typedef struct _reg_trie_trans_list_elem reg_trie_trans_le;
604
605/* a state for compressed nodes. base is an offset
606 into an array of reg_trie_trans array. If wordnum is
607 nonzero the state is accepting. if base is zero then
608 the state has no children (and will be accepting)
609*/
610struct _reg_trie_state {
611 U16 wordnum;
612 union {
613 U32 base;
614 reg_trie_trans_le* list;
615 } trans;
616};
617
2e64971a
DM
618/* info per word; indexed by wordnum */
619typedef struct {
620 U16 prev; /* previous word in acceptance chain; eg in
621 * zzz|abc|ab/ after matching the chars abc, the
622 * accepted word is #2, and the previous accepted
623 * word is #3 */
624 U32 len; /* how many chars long is this word? */
625 U32 accept; /* accept state for this word */
626} reg_trie_wordinfo;
a3621e74
YO
627
628
a3621e74
YO
629typedef struct _reg_trie_state reg_trie_state;
630typedef struct _reg_trie_trans reg_trie_trans;
631
632
633/* anything in here that needs to be freed later
23eab42c
NC
634 should be dealt with in pregfree.
635 refcount is first in both this and _reg_ac_data to allow a space
636 optimisation in Perl_regdupe. */
a3621e74 637struct _reg_trie_data {
23eab42c 638 U32 refcount; /* number of times this trie is referenced */
786e8c11
YO
639 U32 lasttrans; /* last valid transition element */
640 U16 *charmap; /* byte to charid lookup array */
786e8c11
YO
641 reg_trie_state *states; /* state data */
642 reg_trie_trans *trans; /* array of transition elements */
643 char *bitmap; /* stclass bitmap */
786e8c11
YO
644 U16 *jump; /* optional 1 indexed array of offsets before tail
645 for the node following a given word. */
2e64971a 646 reg_trie_wordinfo *wordinfo; /* array of info per word */
1b5c067c
NC
647 U16 uniquecharcount; /* unique chars in trie (width of trans table) */
648 U32 startstate; /* initial state - used for common prefix optimisation */
649 STRLEN minlen; /* minimum length of words in trie - build/opt only? */
650 STRLEN maxlen; /* maximum length of words in trie - build/opt only? */
2e64971a 651 U32 prefixlen; /* #chars in common prefix */
1e2e3d02
YO
652 U32 statecount; /* Build only - number of states in the states array
653 (including the unused zero state) */
786e8c11 654 U32 wordcount; /* Build only */
a3621e74 655#ifdef DEBUGGING
786e8c11 656 STRLEN charcount; /* Build only */
a3621e74
YO
657#endif
658};
2b8b4781
NC
659/* There is one (3 under DEBUGGING) pointers that logically belong in this
660 structure, but are held outside as they need duplication on thread cloning,
661 whereas the rest of the structure can be read only:
662 HV *widecharmap; code points > 255 to charid
663#ifdef DEBUGGING
664 AV *words; Array of words contained in trie, for dumping
665 AV *revcharmap; Map of each charid back to its character representation
666#endif
667*/
668
669#define TRIE_WORDS_OFFSET 2
670
a3621e74
YO
671typedef struct _reg_trie_data reg_trie_data;
672
23eab42c
NC
673/* refcount is first in both this and _reg_trie_data to allow a space
674 optimisation in Perl_regdupe. */
07be1b83 675struct _reg_ac_data {
23eab42c 676 U32 refcount;
1b5c067c 677 U32 trie;
07be1b83
YO
678 U32 *fail;
679 reg_trie_state *states;
07be1b83
YO
680};
681typedef struct _reg_ac_data reg_ac_data;
682
486ec47a 683/* ANY_BIT doesn't use the structure, so we can borrow it here.
3dab1dad
YO
684 This is simpler than refactoring all of it as wed end up with
685 three different sets... */
686
687#define TRIE_BITMAP(p) (((reg_trie_data *)(p))->bitmap)
786e8c11 688#define TRIE_BITMAP_BYTE(p, c) (TRIE_BITMAP(p)[(((U8)(c)) >> 3) & 31])
5dfe062f
YO
689#define TRIE_BITMAP_SET(p, c) (TRIE_BITMAP_BYTE(p, c) |= ANYOF_BIT((U8)c))
690#define TRIE_BITMAP_CLEAR(p,c) (TRIE_BITMAP_BYTE(p, c) &= ~ANYOF_BIT((U8)c))
691#define TRIE_BITMAP_TEST(p, c) (TRIE_BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))
3dab1dad 692
1de06328
YO
693#define IS_ANYOF_TRIE(op) ((op)==TRIEC || (op)==AHOCORASICKC)
694#define IS_TRIE_AC(op) ((op)>=AHOCORASICK)
695
696
786e8c11
YO
697#define BITMAP_BYTE(p, c) (((U8*)p)[(((U8)(c)) >> 3) & 31])
698#define BITMAP_TEST(p, c) (BITMAP_BYTE(p, c) & ANYOF_BIT((U8)c))
3dab1dad 699
a3621e74
YO
700/* these defines assume uniquecharcount is the correct variable, and state may be evaluated twice */
701#define TRIE_NODENUM(state) (((state)-1)/(trie->uniquecharcount)+1)
702#define SAFE_TRIE_NODENUM(state) ((state) ? (((state)-1)/(trie->uniquecharcount)+1) : (state))
703#define TRIE_NODEIDX(state) ((state) ? (((state)-1)*(trie->uniquecharcount)+1) : (state))
704
3dab1dad 705#ifdef DEBUGGING
3dab1dad 706#define TRIE_CHARCOUNT(trie) ((trie)->charcount)
3dab1dad 707#else
3dab1dad 708#define TRIE_CHARCOUNT(trie) (trie_charcount)
3dab1dad 709#endif
a3621e74 710
0111c4fd
RGS
711#define RE_TRIE_MAXBUF_INIT 65536
712#define RE_TRIE_MAXBUF_NAME "\022E_TRIE_MAXBUF"
a3621e74
YO
713#define RE_DEBUG_FLAGS "\022E_DEBUG_FLAGS"
714
be8e71aa
YO
715/*
716
717RE_DEBUG_FLAGS is used to control what debug output is emitted
718its divided into three groups of options, some of which interact.
719The three groups are: Compile, Execute, Extra. There is room for a
720further group, as currently only the low three bytes are used.
721
722 Compile Options:
07be1b83 723
be8e71aa
YO
724 PARSE
725 PEEP
726 TRIE
727 PROGRAM
728 OFFSETS
a3621e74 729
be8e71aa 730 Execute Options:
a3621e74 731
be8e71aa
YO
732 INTUIT
733 MATCH
734 TRIE
a3621e74 735
be8e71aa 736 Extra Options
a3621e74 737
be8e71aa
YO
738 TRIE
739 OFFSETS
740
741If you modify any of these make sure you make corresponding changes to
742re.pm, especially to the documentation.
a3621e74 743
be8e71aa
YO
744*/
745
746
747/* Compile */
748#define RE_DEBUG_COMPILE_MASK 0x0000FF
749#define RE_DEBUG_COMPILE_PARSE 0x000001
750#define RE_DEBUG_COMPILE_OPTIMISE 0x000002
751#define RE_DEBUG_COMPILE_TRIE 0x000004
752#define RE_DEBUG_COMPILE_DUMP 0x000008
f7819f85 753#define RE_DEBUG_COMPILE_FLAGS 0x000010
be8e71aa
YO
754
755/* Execute */
756#define RE_DEBUG_EXECUTE_MASK 0x00FF00
757#define RE_DEBUG_EXECUTE_INTUIT 0x000100
758#define RE_DEBUG_EXECUTE_MATCH 0x000200
759#define RE_DEBUG_EXECUTE_TRIE 0x000400
760
761/* Extra */
762#define RE_DEBUG_EXTRA_MASK 0xFF0000
763#define RE_DEBUG_EXTRA_TRIE 0x010000
764#define RE_DEBUG_EXTRA_OFFSETS 0x020000
a5ca303d
YO
765#define RE_DEBUG_EXTRA_OFFDEBUG 0x040000
766#define RE_DEBUG_EXTRA_STATE 0x080000
767#define RE_DEBUG_EXTRA_OPTIMISE 0x100000
e7707071 768#define RE_DEBUG_EXTRA_BUFFERS 0x400000
2c296965 769#define RE_DEBUG_EXTRA_GPOS 0x800000
24b23f37
YO
770/* combined */
771#define RE_DEBUG_EXTRA_STACK 0x280000
be8e71aa 772
e68ec53f 773#define RE_DEBUG_FLAG(x) (re_debug_flags & x)
be8e71aa
YO
774/* Compile */
775#define DEBUG_COMPILE_r(x) DEBUG_r( \
e68ec53f 776 if (re_debug_flags & RE_DEBUG_COMPILE_MASK) x )
be8e71aa 777#define DEBUG_PARSE_r(x) DEBUG_r( \
e68ec53f 778 if (re_debug_flags & RE_DEBUG_COMPILE_PARSE) x )
be8e71aa 779#define DEBUG_OPTIMISE_r(x) DEBUG_r( \
e68ec53f 780 if (re_debug_flags & RE_DEBUG_COMPILE_OPTIMISE) x )
be8e71aa 781#define DEBUG_PARSE_r(x) DEBUG_r( \
e68ec53f 782 if (re_debug_flags & RE_DEBUG_COMPILE_PARSE) x )
be8e71aa 783#define DEBUG_DUMP_r(x) DEBUG_r( \
e68ec53f 784 if (re_debug_flags & RE_DEBUG_COMPILE_DUMP) x )
be8e71aa 785#define DEBUG_TRIE_COMPILE_r(x) DEBUG_r( \
e68ec53f 786 if (re_debug_flags & RE_DEBUG_COMPILE_TRIE) x )
f7819f85
A
787#define DEBUG_FLAGS_r(x) DEBUG_r( \
788 if (re_debug_flags & RE_DEBUG_COMPILE_FLAGS) x )
be8e71aa
YO
789/* Execute */
790#define DEBUG_EXECUTE_r(x) DEBUG_r( \
e68ec53f 791 if (re_debug_flags & RE_DEBUG_EXECUTE_MASK) x )
be8e71aa 792#define DEBUG_INTUIT_r(x) DEBUG_r( \
e68ec53f 793 if (re_debug_flags & RE_DEBUG_EXECUTE_INTUIT) x )
be8e71aa 794#define DEBUG_MATCH_r(x) DEBUG_r( \
e68ec53f 795 if (re_debug_flags & RE_DEBUG_EXECUTE_MATCH) x )
be8e71aa 796#define DEBUG_TRIE_EXECUTE_r(x) DEBUG_r( \
e68ec53f 797 if (re_debug_flags & RE_DEBUG_EXECUTE_TRIE) x )
be8e71aa
YO
798
799/* Extra */
800#define DEBUG_EXTRA_r(x) DEBUG_r( \
e68ec53f 801 if (re_debug_flags & RE_DEBUG_EXTRA_MASK) x )
a5ca303d
YO
802#define DEBUG_OFFSETS_r(x) DEBUG_r( \
803 if (re_debug_flags & RE_DEBUG_EXTRA_OFFSETS) x )
ab3bbdeb
YO
804#define DEBUG_STATE_r(x) DEBUG_r( \
805 if (re_debug_flags & RE_DEBUG_EXTRA_STATE) x )
24b23f37
YO
806#define DEBUG_STACK_r(x) DEBUG_r( \
807 if (re_debug_flags & RE_DEBUG_EXTRA_STACK) x )
e7707071
YO
808#define DEBUG_BUFFERS_r(x) DEBUG_r( \
809 if (re_debug_flags & RE_DEBUG_EXTRA_BUFFERS) x )
810
a5ca303d
YO
811#define DEBUG_OPTIMISE_MORE_r(x) DEBUG_r( \
812 if ((RE_DEBUG_EXTRA_OPTIMISE|RE_DEBUG_COMPILE_OPTIMISE) == \
813 (re_debug_flags & (RE_DEBUG_EXTRA_OPTIMISE|RE_DEBUG_COMPILE_OPTIMISE)) ) x )
07be1b83 814#define MJD_OFFSET_DEBUG(x) DEBUG_r( \
a5ca303d 815 if (re_debug_flags & RE_DEBUG_EXTRA_OFFDEBUG) \
be8e71aa
YO
816 Perl_warn_nocontext x )
817#define DEBUG_TRIE_COMPILE_MORE_r(x) DEBUG_TRIE_COMPILE_r( \
e68ec53f 818 if (re_debug_flags & RE_DEBUG_EXTRA_TRIE) x )
be8e71aa 819#define DEBUG_TRIE_EXECUTE_MORE_r(x) DEBUG_TRIE_EXECUTE_r( \
e68ec53f 820 if (re_debug_flags & RE_DEBUG_EXTRA_TRIE) x )
be8e71aa
YO
821
822#define DEBUG_TRIE_r(x) DEBUG_r( \
e68ec53f 823 if (re_debug_flags & (RE_DEBUG_COMPILE_TRIE \
be8e71aa 824 | RE_DEBUG_EXECUTE_TRIE )) x )
2c296965
YO
825#define DEBUG_GPOS_r(x) DEBUG_r( \
826 if (re_debug_flags & RE_DEBUG_EXTRA_GPOS) x )
be8e71aa
YO
827
828/* initialization */
595598ee
KW
829/* get_sv() can return NULL during global destruction. re_debug_flags can get
830 * clobbered by a longjmp, so must be initialized */
e68ec53f
YO
831#define GET_RE_DEBUG_FLAGS DEBUG_r({ \
832 SV * re_debug_flags_sv = NULL; \
595598ee 833 re_debug_flags = 0; \
e68ec53f
YO
834 re_debug_flags_sv = get_sv(RE_DEBUG_FLAGS, 1); \
835 if (re_debug_flags_sv) { \
8e9a8a48 836 if (!SvIOK(re_debug_flags_sv)) \
e68ec53f 837 sv_setuv(re_debug_flags_sv, RE_DEBUG_COMPILE_DUMP | RE_DEBUG_EXECUTE_MASK ); \
8e9a8a48 838 re_debug_flags=SvIV(re_debug_flags_sv); \
e68ec53f
YO
839 }\
840})
a3621e74
YO
841
842#ifdef DEBUGGING
ab3bbdeb 843
9c4fdda1 844#define GET_RE_DEBUG_FLAGS_DECL VOL IV re_debug_flags \
9d63fa07 845 PERL_UNUSED_DECL = 0; GET_RE_DEBUG_FLAGS;
ab3bbdeb
YO
846
847#define RE_PV_COLOR_DECL(rpv,rlen,isuni,dsv,pv,l,m,c1,c2) \
848 const char * const rpv = \
ddc5bc0f 849 pv_pretty((dsv), (pv), (l), (m), \
ab3bbdeb 850 PL_colors[(c1)],PL_colors[(c2)], \
c89df6cf 851 PERL_PV_ESCAPE_RE|PERL_PV_ESCAPE_NONASCII |((isuni) ? PERL_PV_ESCAPE_UNI : 0) ); \
0df25f3d 852 const int rlen = SvCUR(dsv)
ab3bbdeb
YO
853
854#define RE_SV_ESCAPE(rpv,isuni,dsv,sv,m) \
855 const char * const rpv = \
ddc5bc0f 856 pv_pretty((dsv), (SvPV_nolen_const(sv)), (SvCUR(sv)), (m), \
ab3bbdeb 857 PL_colors[(c1)],PL_colors[(c2)], \
c89df6cf 858 PERL_PV_ESCAPE_RE|PERL_PV_ESCAPE_NONASCII |((isuni) ? PERL_PV_ESCAPE_UNI : 0) )
ab3bbdeb
YO
859
860#define RE_PV_QUOTED_DECL(rpv,isuni,dsv,pv,l,m) \
861 const char * const rpv = \
ddc5bc0f 862 pv_pretty((dsv), (pv), (l), (m), \
ab3bbdeb 863 PL_colors[0], PL_colors[1], \
c89df6cf 864 ( PERL_PV_PRETTY_QUOTE | PERL_PV_ESCAPE_RE | PERL_PV_ESCAPE_NONASCII | PERL_PV_PRETTY_ELLIPSES | \
ab3bbdeb 865 ((isuni) ? PERL_PV_ESCAPE_UNI : 0)) \
0a0e9afc 866 )
ab3bbdeb
YO
867
868#define RE_SV_DUMPLEN(ItEm) (SvCUR(ItEm) - (SvTAIL(ItEm)!=0))
869#define RE_SV_TAIL(ItEm) (SvTAIL(ItEm) ? "$" : "")
870
871#else /* if not DEBUGGING */
872
a3621e74 873#define GET_RE_DEBUG_FLAGS_DECL
ab3bbdeb
YO
874#define RE_PV_COLOR_DECL(rpv,rlen,isuni,dsv,pv,l,m,c1,c2)
875#define RE_SV_ESCAPE(rpv,isuni,dsv,sv,m)
876#define RE_PV_QUOTED_DECL(rpv,isuni,dsv,pv,l,m)
877#define RE_SV_DUMPLEN(ItEm)
878#define RE_SV_TAIL(ItEm)
879
880#endif /* DEBUG RELATED DEFINES */
a3621e74 881
e9a8c099
MHM
882/*
883 * Local variables:
884 * c-indentation-style: bsd
885 * c-basic-offset: 4
14d04a33 886 * indent-tabs-mode: nil
e9a8c099
MHM
887 * End:
888 *
14d04a33 889 * ex: set ts=8 sts=4 sw=4 et:
e9a8c099 890 */