"Fossies" - the Fresh Open Source Software Archive
Member "xxgdb-1.12/regex.h" (26 Feb 1993, 10832 Bytes) of package /linux/misc/old/xxgdb-1.12.tar.gz:
As a special service "Fossies" has tried to format the requested source page into HTML format using (guessed) C and C++ source code syntax highlighting (style: standard
) with prefixed line numbers and code folding
Alternatively you can here view
the uninterpreted source code file.
1 /* Definitions for data structures callers pass the regex library.
2 Copyright (C) 1985 Free Software Foundation, Inc.
4 NO WARRANTY
6 BECAUSE THIS PROGRAM IS LICENSED FREE OF CHARGE, WE PROVIDE ABSOLUTELY
7 NO WARRANTY, TO THE EXTENT PERMITTED BY APPLICABLE STATE LAW. EXCEPT
8 WHEN OTHERWISE STATED IN WRITING, FREE SOFTWARE FOUNDATION, INC,
9 RICHARD M. STALLMAN AND/OR OTHER PARTIES PROVIDE THIS PROGRAM "AS IS"
10 WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
11 BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
12 FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY
13 AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE
14 DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR
17 IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW WILL RICHARD M.
18 STALLMAN, THE FREE SOFTWARE FOUNDATION, INC., AND/OR ANY OTHER PARTY
19 WHO MAY MODIFY AND REDISTRIBUTE THIS PROGRAM AS PERMITTED BELOW, BE
20 LIABLE TO YOU FOR DAMAGES, INCLUDING ANY LOST PROFITS, LOST MONIES, OR
21 OTHER SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
22 USE OR INABILITY TO USE (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR
23 DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY THIRD PARTIES OR
24 A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS) THIS
25 PROGRAM, EVEN IF YOU HAVE BEEN ADVISED OF THE POSSIBILITY OF SUCH
26 DAMAGES, OR FOR ANY CLAIM BY ANY OTHER PARTY.
28 GENERAL PUBLIC LICENSE TO COPY
30 1. You may copy and distribute verbatim copies of this source file
31 as you receive it, in any medium, provided that you conspicuously and
32 appropriately publish on each copy a valid copyright notice "Copyright
33 (C) 1985 Free Software Foundation, Inc."; and include following the
34 copyright notice a verbatim copy of the above disclaimer of warranty
35 and of this License. You may charge a distribution fee for the
36 physical act of transferring a copy.
38 2. You may modify your copy or copies of this source file or
39 any portion of it, and copy and distribute such modifications under
40 the terms of Paragraph 1 above, provided that you also do the following:
42 a) cause the modified files to carry prominent notices stating
43 that you changed the files and the date of any change; and
45 b) cause the whole of any work that you distribute or publish,
46 that in whole or in part contains or is a derivative of this
47 program or any part thereof, to be licensed at no charge to all
48 third parties on terms identical to those contained in this
49 License Agreement (except that you may choose to grant more extensive
50 warranty protection to some or all third parties, at your option).
52 c) You may charge a distribution fee for the physical act of
53 transferring a copy, and you may at your option offer warranty
54 protection in exchange for a fee.
56 Mere aggregation of another unrelated program with this program (or its
57 derivative) on a volume of a storage or distribution medium does not bring
58 the other program under the scope of these terms.
60 3. You may copy and distribute this program (or a portion or derivative
61 of it, under Paragraph 2) in object code or executable form under the terms
62 of Paragraphs 1 and 2 above provided that you also do one of the following:
64 a) accompany it with the complete corresponding machine-readable
65 source code, which must be distributed under the terms of
66 Paragraphs 1 and 2 above; or,
68 b) accompany it with a written offer, valid for at least three
69 years, to give any third party free (except for a nominal
70 shipping charge) a complete machine-readable copy of the
71 corresponding source code, to be distributed under the terms of
72 Paragraphs 1 and 2 above; or,
74 c) accompany it with the information you received as to where the
75 corresponding source code may be obtained. (This alternative is
76 allowed only for noncommercial distribution and only if you
77 received the program in object code or executable form alone.)
79 For an executable file, complete source code means all the source code for
80 all modules it contains; but, as a special exception, it need not include
81 source code for modules which are standard libraries that accompany the
82 operating system on which the executable file runs.
84 4. You may not copy, sublicense, distribute or transfer this program
85 except as expressly provided under this License Agreement. Any attempt
86 otherwise to copy, sublicense, distribute or transfer this program is void and
87 your rights to use the program under this License agreement shall be
88 automatically terminated. However, parties who have received computer
89 software programs from you with this License Agreement will not have
90 their licenses terminated so long as such parties remain in full compliance.
92 5. If you wish to incorporate parts of this program into other free
93 programs whose distribution conditions are different, write to the Free
94 Software Foundation at 675 Mass Ave, Cambridge, MA 02139. We have not yet
95 worked out a simple rule that can be stated here, but we will often permit
96 this. We will be guided by the two goals of preserving the free status of
97 all derivatives of our free software and of promoting the sharing and reuse of
101 In other words, you are welcome to use, share and improve this program.
102 You are forbidden to forbid anyone else to use, share and improve
103 what you give them. Help stamp out software-hoarding! */
106 #ifndef RE_NREGS
107 #define RE_NREGS 10
110 /* This data structure is used to represent a compiled pattern. */
112 struct re_pattern_buffer
114 char *buffer; /* Space holding the compiled pattern commands. */
115 int allocated; /* Size of space that buffer points to */
116 int used; /* Length of portion of buffer actually occupied */
117 char *fastmap; /* Pointer to fastmap, if any, or zero if none. */
118 /* re_search uses the fastmap, if there is one,
119 to skip quickly over totally implausible characters */
120 char *translate; /* Translate table to apply to all characters
121 before comparing.
122 Or zero for no translation.
123 The translation is applied to a pattern when it is compiled
124 and to data when it is matched. */
125 char fastmap_accurate;
126 /* Set to zero when a new pattern is stored,
127 set to one when the fastmap is updated from it. */
128 char can_be_null; /* Set to one by compiling fastmap
129 if this pattern might match the null string.
130 It does not necessarily match the null string
131 in that case, but if this is zero, it cannot.
132 2 as value means can match null string
133 but at end of range or before a character
134 listed in the fastmap. */
137 /* Structure to store "register" contents data in.
139 Pass the address of such a structure as an argument to re_match, etc.,
140 if you want this information back.
142 start[i] and end[i] record the string matched by \( ... \) grouping i,
143 for i from 1 to RE_NREGS - 1.
144 start and end record the entire string matched. */
146 struct re_registers
148 int start[RE_NREGS];
149 int end[RE_NREGS];
152 /* These are the command codes that appear in compiled regular expressions,
153 one per byte.
154 Some command codes are followed by argument bytes.
155 A command code can specify any interpretation whatever for its arguments.
156 Zero-bytes may appear in the compiled regular expression. */
158 enum regexpcode
161 exactn, /* followed by one byte giving n, and then by n literal bytes */
162 begline, /* fails unless at beginning of line */
163 endline, /* fails unless at end of line */
164 jump, /* followed by two bytes giving relative address to jump to */
165 on_failure_jump, /* followed by two bytes giving relative address of place
166 to resume at in case of failure. */
167 finalize_jump, /* Throw away latest failure point and then
168 jump to address. */
169 maybe_finalize_jump, /* Like jump but finalize if safe to do so.
170 This is used to jump back to the beginning
171 of a repeat. If the command that follows
172 this jump is clearly incompatible with the
173 one at the beginning of the repeat, such that
174 we can be sure that there is no use backtracking
175 out of repetitions already completed,
176 then we finalize. */
177 dummy_failure_jump, /* jump, and push a dummy failure point.
178 This failure point will be thrown away
179 if an attempt is made to use it for a failure.
180 A + construct makes this before the first repeat. */
181 anychar, /* matches any one character */
182 charset, /* matches any one char belonging to specified set.
183 First following byte is # bitmap bytes.
184 Then come bytes for a bit-map saying which chars are in.
185 Bits in each byte are ordered low-bit-first.
186 A character is in the set if its bit is 1.
187 A character too large to have a bit in the map
188 is automatically not in the set */
189 charset_not, /* similar but match any character that is NOT one
190 of those specified */
191 start_memory, /* starts remembering the text that is matched
192 and stores it in a memory register.
193 followed by one byte containing the register number.
194 Register numbers must be in the range 0 through NREGS. */
195 stop_memory, /* stops remembering the text that is matched
196 and stores it in a memory register.
197 followed by one byte containing the register number.
198 Register numbers must be in the range 0 through NREGS. */
199 duplicate, /* match a duplicate of something remembered.
200 Followed by one byte containing the index of the memory register. */
201 before_dot, /* Succeeds if before dot */
202 at_dot, /* Succeeds if at dot */
203 after_dot, /* Succeeds if after dot */
204 begbuf, /* Succeeds if at beginning of buffer */
205 endbuf, /* Succeeds if at end of buffer */
206 wordchar, /* Matches any word-constituent character */
207 notwordchar, /* Matches any char that is not a word-constituent */
208 wordbeg, /* Succeeds if at word beginning */
209 wordend, /* Succeeds if at word end */
210 wordbound, /* Succeeds if at a word boundary */
211 notwordbound, /* Succeeds if not at a word boundary */
212 syntaxspec, /* Matches any character whose syntax is specified.
213 followed by a byte which contains a syntax code, Sword
214 or such like */
215 notsyntaxspec /* Matches any character whose syntax differs from
216 the specified. */
219 extern char *re_compile_pattern ();
220 /* Is this really advertised? */
221 extern void re_compile_fastmap ();
222 extern int re_search (), re_search_2 ();
223 extern int re_match (), re_match_2 ();
225 /* 4.2 bsd compatibility (yuck) */
226 extern char *re_comp ();
227 extern int re_exec ();
229 #ifdef SYNTAX_TABLE
230 extern char *re_syntax_table;