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
|
/*
* Regular expression functions
*
* Copyright (C) 2003 Juha Heinanen
*
* This file is part of opensips, a free SIP server.
*
* opensips is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version
*
* opensips 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 General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
/*!
* \file
* \brief Regular Expression functions
*/
#include <sys/types.h>
#include <string.h>
#include <regex.h>
#include <ctype.h>
#include "regexp.h"
#include "dprint.h"
/*! \brief Replace in replacement tokens \\d with substrings of string pointed by
* pmatch.
*/
int replace(regmatch_t* pmatch, char* string, char* replacement, str* result)
{
int len, i, j, digit, size;
len = strlen(replacement);
j = 0;
for (i = 0; i < len; i++) {
if (replacement[i] == '\\') {
if (i < len - 1) {
if (isdigit((unsigned char)replacement[i+1])) {
digit = replacement[i+1] - '0';
if (pmatch[digit].rm_so != -1) {
size = pmatch[digit].rm_eo - pmatch[digit].rm_so;
if (j + size < result->len) {
memcpy(&(result->s[j]), string+pmatch[digit].rm_so, size);
j = j + size;
} else {
return -1;
}
} else {
return -2;
}
i = i + 1;
continue;
} else {
i = i + 1;
}
} else {
return -3;
}
}
if (j + 1 < result->len) {
result->s[j] = replacement[i];
j = j + 1;
} else {
return -4;
}
}
result->len = j;
return 1;
}
/*! \brief Match pattern against string and store result in pmatch */
int reg_match(char *pattern, char *string, regmatch_t *pmatch)
{
regex_t preg;
if (regcomp(&preg, pattern, REG_EXTENDED | REG_NEWLINE)) {
return -1;
}
if (preg.re_nsub > MAX_MATCH) {
regfree(&preg);
return -2;
}
if (regexec(&preg, string, MAX_MATCH, pmatch, 0)) {
regfree(&preg);
return -3;
}
regfree(&preg);
return 0;
}
/*! \brief Match pattern against string and, if match succeeds, and replace string
* with replacement substituting tokens \\d with matched substrings.
*/
int reg_replace(char *pattern, char *replacement, char *string, str *result)
{
regmatch_t pmatch[MAX_MATCH];
LM_DBG("pattern: '%s', replacement: '%s', string: '%s'\n",
pattern, replacement, string);
if (reg_match(pattern, string, &(pmatch[0]))) {
return -1;
}
return replace(&pmatch[0], string, replacement, result);
}
|
