blob: 0c7c9d9ae250ef45b027d6f2cc71cd98ac87ced9 [file] [log] [blame]
Erik Andersene49d5ec2000-02-08 19:58:47 +00001/* vi: set sw=4 ts=4: */
Eric Andersenc8fdb561999-10-26 05:21:02 +00002/*
3 * Busybox regexp header file
4 *
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 *
20 * Based in part on code from sash, Copyright (c) 1999 by David I. Bell
21 * Permission has been granted to redistribute this code under the GPL.
22 *
23 */
24#ifndef _REGEXP_H_
25#define _REGEXP_H_
26
27
28
29
30#define NSUBEXP 10
31typedef struct regexp {
32 char *startp[NSUBEXP];
33 char *endp[NSUBEXP];
34 int minlen; /* length of shortest possible match */
35 char first; /* first character, if known; else \0 */
36 char bol; /* boolean: must start at beginning of line? */
37 char program[1]; /* Unwarranted chumminess with compiler. */
38} regexp;
39
40
41
42extern regexp *regcomp(char* text);
43extern int regexec(struct regexp* re, char* str, int bol, int ignoreCase);
44extern void regsub(struct regexp* re, char* src, char* dst);
45
46extern int find_match(char *haystack, char *needle, int ignoreCase);
Eric Andersenc1525e81999-10-29 00:07:31 +000047extern int replace_match(char *haystack, char *needle, char *newNeedle, int ignoreCase);
Eric Andersenc8fdb561999-10-26 05:21:02 +000048
49#endif
50
51