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
|
/*
* Copyright (C) 2003 Red Hat, Inc.
*
* This is free software; you can redistribute it and/or modify it under
* the terms of the GNU Library General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU Library General Public
* License along with this program; if not, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <config.h>
#include <sys/types.h>
#include <errno.h>
#include <limits.h>
#include <string.h>
#include <unistd.h>
#include <glib.h>
#include <regex.h>
#include "vteregex.h"
static gint
compare_matches(gconstpointer a, gconstpointer b)
{
const struct _vte_regex_match *A, *B;
A = a;
B = b;
if (B->rm_so != A->rm_so) {
return B->rm_so - A->rm_so;
}
return B->rm_eo - A->rm_eo;
}
/* Sort match structures first by starting position, and then by ending
* position. We do this because some expression matching APIs sort their
* results differently, or just plain don't sort them. */
static void
_vte_regex_sort_matches(struct _vte_regex_match *matches, gsize n_matches)
{
GArray *array;
if (n_matches <= 1) {
return;
}
array = g_array_new(FALSE, FALSE, sizeof(struct _vte_regex_match));
g_array_append_vals(array, matches, n_matches);
g_array_sort(array, compare_matches);
memmove(matches, array->data,
n_matches * sizeof(struct _vte_regex_match));
g_array_free(array, TRUE);
}
/* Ah, POSIX regex. Kind of clunky, but I don't have anything better to
* suggest. Better still, it works on my machine. */
struct _vte_regex {
regex_t posix_regex;
};
struct _vte_regex *
_vte_regex_compile(const char *pattern)
{
struct _vte_regex *ret;
int i;
ret = g_slice_new(struct _vte_regex);
i = regcomp(&ret->posix_regex, pattern, REG_EXTENDED);
if (i != 0) {
g_slice_free(struct _vte_regex, ret);
return NULL;
}
return ret;
}
void
_vte_regex_free(struct _vte_regex *regex)
{
regfree(®ex->posix_regex);
g_slice_free(struct _vte_regex, regex);
}
int
_vte_regex_exec(struct _vte_regex *regex, const char *string,
gsize nmatch, struct _vte_regex_match *matches)
{
regmatch_t *posix_matches;
guint i, ret;
posix_matches = g_new(regmatch_t, nmatch);
ret = regexec(®ex->posix_regex, string, nmatch, posix_matches, 0);
if (ret == 0) {
for (i = 0; i < nmatch; i++) {
matches[i].rm_so = -1;
matches[i].rm_eo = -1;
}
for (i = 0; i < nmatch; i++) {
matches[i].rm_so = posix_matches[i].rm_so;
matches[i].rm_eo = posix_matches[i].rm_eo;
if (matches[i].rm_so == -1) {
_vte_regex_sort_matches(matches, i);
break;
}
}
}
g_free(posix_matches);
if (ret == 0) {
return 0;
}
return -1;
}
|
