summaryrefslogtreecommitdiffstats
path: root/pattern.c
blob: 455f5746e9560a73bc836a2f5378483c43f75a1d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
/******************************************************************************
  Copyright (c) 1995, 1996 Xerox Corporation.  All rights reserved.
  Portions of this code were written by Stephen White, aka ghond.
  Use and copying of this software and preparation of derivative works based
  upon this software are permitted.  Any distribution of this software or
  derivative works must comply with all applicable United States export
  control laws.  This software is made available AS IS, and Xerox Corporation
  makes no warranty about the software, its performance or its conformity to
  any specification.  Any person obtaining a copy of this software is requested
  to send their name and post office or electronic mail address to:
    Pavel Curtis
    Xerox PARC
    3333 Coyote Hill Rd.
    Palo Alto, CA 94304
    Pavel@Xerox.Com
 *****************************************************************************/

#include "my-ctype.h"
#include "my-stdlib.h"
#include "my-string.h"

#include "config.h"
#include "pattern.h"
#include "regexpr.h"
#include "storage.h"
#include "streams.h"

static char casefold[256];

static void
init_casefold_once(void)
{
    if (casefold[1] != 1) {
	int i;

	for (i = 0; i < 256; i++)
	    casefold[i] = isupper(i) ? tolower(i) : i;
    }
}

static const char *
translate_pattern(const char *pattern, int *tpatlen)
{
    /* Translate a MOO pattern into a more standard syntax.  Effectively, this
     * just involves converting from `%' escapes into `\' escapes.
     */

    static Stream *s = 0;
    const char *p = pattern;
    char c;

    if (!s)
	s = new_stream(100);

    while (*p) {
	switch (c = *p++) {
	case '%':
	    c = *p++;
	    if (!c)
		goto fail;
	    else if (strchr(".*+?[^$|()123456789bB<>wW", c))
		stream_add_char(s, '\\');
	    stream_add_char(s, c);
	    break;
	case '\\':
	    stream_add_string(s, "\\\\");
	    break;
	case '[':
	    /* Any '%' or '\' characters inside a charset should be copied
	     * over without translation. */
	    stream_add_char(s, c);
	    c = *p++;
	    if (c == '^') {
		stream_add_char(s, c);
		c = *p++;
	    }
	    /* This is the only place a ']' can appear and not be the end of
	     * the charset. */
	    if (c == ']') {
		stream_add_char(s, c);
		c = *p++;
	    }
	    while (c && c != ']') {
		stream_add_char(s, c);
		c = *p++;
	    }
	    if (!c)
		goto fail;
	    else
		stream_add_char(s, c);
	    break;
	default:
	    stream_add_char(s, c);
	    break;
	}
    }

    *tpatlen = stream_length(s);
    return reset_stream(s);

  fail:
    reset_stream(s);
    return 0;
}

#define MOO_SYNTAX	(RE_CONTEXT_INDEP_OPS)

Pattern
new_pattern(const char *pattern, int case_matters)
{
    int tpatlen;
    const char *tpattern = translate_pattern(pattern, &tpatlen);
    regexp_t buf = mymalloc(sizeof(*buf), M_PATTERN);
    Pattern p;

    init_casefold_once();

    buf->buffer = 0;
    buf->allocated = 0;
    buf->translate = case_matters ? 0 : casefold;
    re_set_syntax(MOO_SYNTAX);

    if (tpattern
	&& !re_compile_pattern((void *) tpattern, tpatlen, buf)) {
	buf->fastmap = mymalloc(256 * sizeof(char), M_PATTERN);
	re_compile_fastmap(buf);
	p.ptr = buf;
    } else {
	if (buf->buffer)
	    free(buf->buffer);
	myfree(buf, M_PATTERN);
	p.ptr = 0;
    }

    return p;
}

Match_Result
match_pattern(Pattern p, const char *string, Match_Indices * indices,
	      int is_reverse)
{
    regexp_t buf = p.ptr;
    int len = strlen(string);
    int i;
    struct re_registers regs;

    switch (re_search(buf, (void *) string, len,
		      is_reverse ? len : 0,
		      is_reverse ? -len : len,
		      &regs)) {
    default:
	for (i = 0; i < 10; i++) {
	    /* Convert from 0-based open interval to 1-based closed one. */
	    indices[i].start = regs.start[i] + 1;
	    indices[i].end = regs.end[i];
	}
	return MATCH_SUCCEEDED;
    case -1:
	return MATCH_FAILED;
    case -2:
	return MATCH_ABORTED;
    }
}

void
free_pattern(Pattern p)
{
    regexp_t buf = p.ptr;

    if (buf) {
	free(buf->buffer);
	myfree(buf->fastmap, M_PATTERN);
	myfree(buf, M_PATTERN);
    }
}

char rcsid_pattern[] = "$Id";

/* 
 * $Log$
 * Revision 1.4  1998/12/14 13:18:46  nop
 * Merge UNSAFE_OPTS (ref fixups); fix Log tag placement to fit CVS whims
 *
 * Revision 1.3  1997/03/03 07:04:01  bjj
 * fastmap is mymalloc'd, so myfree it
 *
 * Revision 1.2  1997/03/03 04:19:16  nop
 * GNU Indent normalization
 *
 * Revision 1.1.1.1  1997/03/03 03:45:01  nop
 * LambdaMOO 1.8.0p5
 *
 * Revision 2.2  1996/05/12  21:33:02  pavel
 * Fixed memory leak in case of a malformed pattern.  Release 1.8.0p5.
 *
 * Revision 2.1  1996/02/08  06:54:40  pavel
 * Updated copyright notice for 1996.  Release 1.8.0beta1.
 *
 * Revision 2.0  1995/11/30  05:03:32  pavel
 * New baseline version, corresponding to release 1.8.0alpha1.
 *
 * Revision 1.1  1995/11/30  05:03:24  pavel
 * Initial revision
 */