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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
|
/** BEGIN COPYRIGHT BLOCK
* This Program 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; version 2 of the License.
*
* 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 General Public License along with
* this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
* Place, Suite 330, Boston, MA 02111-1307 USA.
*
* In addition, as a special exception, Red Hat, Inc. gives You the additional
* right to link the code of this Program with code not covered under the GNU
* General Public License ("Non-GPL Code") and to distribute linked combinations
* including the two, subject to the limitations in this paragraph. Non-GPL Code
* permitted under this exception must only link to the code of this Program
* through those well defined interfaces identified in the file named EXCEPTION
* found in the source code files (the "Approved Interfaces"). The files of
* Non-GPL Code may instantiate templates or use macros or inline functions from
* the Approved Interfaces without causing the resulting work to be covered by
* the GNU General Public License. Only Red Hat, Inc. may make changes or
* additions to the list of Approved Interfaces. You must obey the GNU General
* Public License in all respects for all of the Program code and other code used
* in conjunction with the Program except the Non-GPL Code covered by this
* exception. If you modify this file, you may extend this exception to your
* version of the file, but you are not obligated to do so. If you do not wish to
* provide this exception without modification, you must delete this exception
* statement from your version and license this file solely under the GPL without
* exception.
*
*
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
* END COPYRIGHT BLOCK **/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
/* tel.c - telephonenumber syntax routines */
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include "syntax.h"
static int tel_filter_ava( Slapi_PBlock *pb, struct berval *bvfilter,
Slapi_Value **bvals, int ftype, Slapi_Value **retVal );
static int tel_filter_sub( Slapi_PBlock *pb, char *initial, char **any,
char *final, Slapi_Value **bvals );
static int tel_values2keys( Slapi_PBlock *pb, Slapi_Value **val,
Slapi_Value ***ivals, int ftype );
static int tel_assertion2keys_ava( Slapi_PBlock *pb, Slapi_Value *val,
Slapi_Value ***ivals, int ftype );
static int tel_assertion2keys_sub( Slapi_PBlock *pb, char *initial, char **any,
char *final, Slapi_Value ***ivals );
static int tel_compare(struct berval *v1, struct berval *v2);
static int tel_validate(struct berval *val);
/* the first name is the official one from RFC 2252 */
static char *names[] = { "TelephoneNumber", "tel", TELEPHONE_SYNTAX_OID, 0 };
static Slapi_PluginDesc pdesc = { "tele-syntax", VENDOR, DS_PACKAGE_VERSION,
"telephoneNumber attribute syntax plugin" };
static const char *telephoneNumberMatch_names[] = {"telephoneNumberMatch", "2.5.13.20", NULL};
static const char *telephoneNumberSubstringsMatch_names[] = {"telephoneNumberSubstringsMatch", "2.5.13.21", NULL};
static char *telephoneNumberSubstringsMatch_syntaxes[] = {TELEPHONE_SYNTAX_OID, NULL};
static struct mr_plugin_def mr_plugin_table[] = {
{{"2.5.13.20", NULL, "telephoneNumberMatch", "The telephoneNumberMatch rule compares an assertion value of the "
"Telephone Number syntax to an attribute value of a syntax (e.g., the "
"Telephone Number syntax) whose corresponding ASN.1 type is a "
"PrintableString representing a telephone number. "
"The rule evaluates to TRUE if and only if the prepared attribute "
"value character string and the prepared assertion value character "
"string have the same number of characters and corresponding "
"characters have the same code point. "
"In preparing the attribute value and assertion value for comparison, "
"characters are case folded in the Map preparation step, and only "
"telephoneNumber Insignificant Character Handling is applied in the "
"Insignificant Character Handling step.",
TELEPHONE_SYNTAX_OID, 0, NULL /* tel syntax only */}, /* matching rule desc */
{"telephoneNumberMatch-mr", VENDOR, DS_PACKAGE_VERSION, "telephoneNumberMatch matching rule plugin"}, /* plugin desc */
telephoneNumberMatch_names, /* matching rule name/oid/aliases */
NULL, NULL, tel_filter_ava, NULL, tel_values2keys,
tel_assertion2keys_ava, NULL, tel_compare},
{{"2.5.13.21", NULL, "telephoneNumberSubstringsMatch", "The telephoneNumberSubstringsMatch rule compares an assertion value "
"of the Substring Assertion syntax to an attribute value of a syntax "
"(e.g., the Telephone Number syntax) whose corresponding ASN.1 type is "
"a PrintableString representing a telephone number. "
"The rule evaluates to TRUE if and only if (1) the prepared substrings "
"of the assertion value match disjoint portions of the prepared "
"attribute value character string in the order of the substrings in "
"the assertion value, (2) an <initial> substring, if present, matches "
"the beginning of the prepared attribute value character string, and "
"(3) a <final> substring, if present, matches the end of the prepared "
"attribute value character string. A prepared substring matches a "
"portion of the prepared attribute value character string if "
"corresponding characters have the same code point. "
"In preparing the attribute value and assertion value substrings for "
"comparison, characters are case folded in the Map preparation step, "
"and only telephoneNumber Insignificant Character Handling is applied "
"in the Insignificant Character Handling step.",
"1.3.6.1.4.1.1466.115.121.1.58", 0, telephoneNumberSubstringsMatch_syntaxes}, /* matching rule desc */
{"telephoneNumberSubstringsMatch-mr", VENDOR, DS_PACKAGE_VERSION, "telephoneNumberSubstringsMatch matching rule plugin"}, /* plugin desc */
telephoneNumberSubstringsMatch_names, /* matching rule name/oid/aliases */
NULL, NULL, NULL, tel_filter_sub, tel_values2keys,
NULL, tel_assertion2keys_sub, tel_compare},
};
static size_t mr_plugin_table_size = sizeof(mr_plugin_table)/sizeof(mr_plugin_table[0]);
static int
matching_rule_plugin_init(Slapi_PBlock *pb)
{
return syntax_matching_rule_plugin_init(pb, mr_plugin_table, mr_plugin_table_size);
}
static int
register_matching_rule_plugins()
{
return syntax_register_matching_rule_plugins(mr_plugin_table, mr_plugin_table_size, matching_rule_plugin_init);
}
int
tel_init( Slapi_PBlock *pb )
{
int rc, flags;
LDAPDebug( LDAP_DEBUG_PLUGIN, "=> tel_init\n", 0, 0, 0 );
rc = slapi_pblock_set( pb, SLAPI_PLUGIN_VERSION,
(void *) SLAPI_PLUGIN_VERSION_01 );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_DESCRIPTION,
(void *)&pdesc );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_AVA,
(void *) tel_filter_ava );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_SUB,
(void *) tel_filter_sub );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALUES2KEYS,
(void *) tel_values2keys );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_AVA,
(void *) tel_assertion2keys_ava );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_SUB,
(void *) tel_assertion2keys_sub );
flags = SLAPI_PLUGIN_SYNTAX_FLAG_ORDERING;
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FLAGS,
(void *) &flags );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_NAMES,
(void *) names );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_OID,
(void *) TELEPHONE_SYNTAX_OID );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_COMPARE,
(void *) tel_compare );
rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALIDATE,
(void *) tel_validate );
rc |= register_matching_rule_plugins();
LDAPDebug( LDAP_DEBUG_PLUGIN, "<= tel_init %d\n", rc, 0, 0 );
return( rc );
}
static int
tel_filter_ava(
Slapi_PBlock *pb,
struct berval *bvfilter,
Slapi_Value **bvals,
int ftype,
Slapi_Value **retVal
)
{
return( string_filter_ava( bvfilter, bvals, SYNTAX_TEL | SYNTAX_CIS,
ftype, retVal ) );
}
static int
tel_filter_sub(
Slapi_PBlock *pb,
char *initial,
char **any,
char *final,
Slapi_Value **bvals
)
{
return( string_filter_sub( pb, initial, any, final, bvals, SYNTAX_TEL | SYNTAX_CIS ) );
}
static int
tel_values2keys(
Slapi_PBlock *pb,
Slapi_Value **vals,
Slapi_Value ***ivals,
int ftype
)
{
return( string_values2keys( pb, vals, ivals, SYNTAX_TEL | SYNTAX_CIS,
ftype ) );
}
static int
tel_assertion2keys_ava(
Slapi_PBlock *pb,
Slapi_Value *val,
Slapi_Value ***ivals,
int ftype
)
{
return(string_assertion2keys_ava( pb, val, ivals,
SYNTAX_TEL | SYNTAX_CIS, ftype ));
}
static int
tel_assertion2keys_sub(
Slapi_PBlock *pb,
char *initial,
char **any,
char *final,
Slapi_Value ***ivals
)
{
return( string_assertion2keys_sub( pb, initial, any, final, ivals,
SYNTAX_TEL | SYNTAX_CIS ) );
}
static int tel_compare(
struct berval *v1,
struct berval *v2
)
{
return value_cmp(v1, v2, SYNTAX_TEL|SYNTAX_CIS, 3 /* Normalise both values */);
}
static int
tel_validate(
struct berval *val
)
{
int rc = 0; /* assume the value is valid */
int i = 0;
/* Per RFC4517:
*
* TelephoneNumber = PrintableString
* PrintableString = 1*PrintableCharacter
*/
/* Don't allow a 0 length string */
if ((val == NULL) || (val->bv_len == 0)) {
rc = 1;
goto exit;
}
/* Make sure all chars are a PrintableCharacter */
for (i=0; i < val->bv_len; i++) {
if (!IS_PRINTABLE(val->bv_val[i])) {
rc = 1;
goto exit;
}
}
exit:
return rc;
}
|