1
0

nameoptuid.c 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274
  1. /** BEGIN COPYRIGHT BLOCK
  2. * This Program is free software; you can redistribute it and/or modify it under
  3. * the terms of the GNU General Public License as published by the Free Software
  4. * Foundation; version 2 of the License.
  5. *
  6. * This Program is distributed in the hope that it will be useful, but WITHOUT
  7. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  8. * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  9. *
  10. * You should have received a copy of the GNU General Public License along with
  11. * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
  12. * Place, Suite 330, Boston, MA 02111-1307 USA.
  13. *
  14. * In addition, as a special exception, Red Hat, Inc. gives You the additional
  15. * right to link the code of this Program with code not covered under the GNU
  16. * General Public License ("Non-GPL Code") and to distribute linked combinations
  17. * including the two, subject to the limitations in this paragraph. Non-GPL Code
  18. * permitted under this exception must only link to the code of this Program
  19. * through those well defined interfaces identified in the file named EXCEPTION
  20. * found in the source code files (the "Approved Interfaces"). The files of
  21. * Non-GPL Code may instantiate templates or use macros or inline functions from
  22. * the Approved Interfaces without causing the resulting work to be covered by
  23. * the GNU General Public License. Only Red Hat, Inc. may make changes or
  24. * additions to the list of Approved Interfaces. You must obey the GNU General
  25. * Public License in all respects for all of the Program code and other code used
  26. * in conjunction with the Program except the Non-GPL Code covered by this
  27. * exception. If you modify this file, you may extend this exception to your
  28. * version of the file, but you are not obligated to do so. If you do not wish to
  29. * provide this exception without modification, you must delete this exception
  30. * statement from your version and license this file solely under the GPL without
  31. * exception.
  32. *
  33. *
  34. * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
  35. * Copyright (C) 2009 Red Hat, Inc.
  36. * All rights reserved.
  37. * END COPYRIGHT BLOCK **/
  38. #ifdef HAVE_CONFIG_H
  39. # include <config.h>
  40. #endif
  41. /* nameoptuid.c - Name And Optional UID syntax routines */
  42. #include <stdio.h>
  43. #include <string.h>
  44. #include <sys/types.h>
  45. #include "syntax.h"
  46. static int nameoptuid_filter_ava( Slapi_PBlock *pb, struct berval *bvfilter,
  47. Slapi_Value **bvals, int ftype, Slapi_Value **retVal );
  48. static int nameoptuid_filter_sub( Slapi_PBlock *pb, char *initial, char **any,
  49. char *final, Slapi_Value **bvals );
  50. static int nameoptuid_values2keys( Slapi_PBlock *pb, Slapi_Value **val,
  51. Slapi_Value ***ivals, int ftype );
  52. static int nameoptuid_assertion2keys_ava( Slapi_PBlock *pb, Slapi_Value *val,
  53. Slapi_Value ***ivals, int ftype );
  54. static int nameoptuid_assertion2keys_sub( Slapi_PBlock *pb, char *initial, char **any,
  55. char *final, Slapi_Value ***ivals );
  56. static int nameoptuid_compare(struct berval *v1, struct berval *v2);
  57. static int nameoptuid_validate(struct berval *val);
  58. /* the first name is the official one from RFC 4517 */
  59. static char *names[] = { "Name And Optional UID", "nameoptuid", NAMEANDOPTIONALUID_SYNTAX_OID, 0 };
  60. static Slapi_PluginDesc pdesc = { "nameoptuid-syntax", VENDOR, DS_PACKAGE_VERSION,
  61. "Name And Optional UID attribute syntax plugin" };
  62. static const char *uniqueMemberMatch_names[] = {"uniqueMemberMatch", "2.5.13.23", NULL};
  63. static struct mr_plugin_def mr_plugin_table[] = {
  64. {{"2.5.13.23", NULL, "uniqueMemberMatch", "The uniqueMemberMatch rule compares an assertion value of the Name "
  65. "And Optional UID syntax to an attribute value of a syntax (e.g., the "
  66. "Name And Optional UID syntax) whose corresponding ASN.1 type is "
  67. "NameAndOptionalUID. "
  68. "The rule evaluates to TRUE if and only if the <distinguishedName> "
  69. "components of the assertion value and attribute value match according "
  70. "to the distinguishedNameMatch rule and either, (1) the <BitString> "
  71. "component is absent from both the attribute value and assertion "
  72. "value, or (2) the <BitString> component is present in both the "
  73. "attribute value and the assertion value and the <BitString> component "
  74. "of the assertion value matches the <BitString> component of the "
  75. "attribute value according to the bitStringMatch rule. "
  76. "Note that this matching rule has been altered from its description in "
  77. "X.520 [X.520] in order to make the matching rule commutative. Server "
  78. "implementors should consider using the original X.520 semantics "
  79. "(where the matching was less exact) for approximate matching of "
  80. "attributes with uniqueMemberMatch as the equality matching rule.",
  81. NAMEANDOPTIONALUID_SYNTAX_OID, 0, NULL /* no other syntaxes supported */}, /* matching rule desc */
  82. {"uniqueMemberMatch-mr", VENDOR, DS_PACKAGE_VERSION, "uniqueMemberMatch matching rule plugin"}, /* plugin desc */
  83. uniqueMemberMatch_names, /* matching rule name/oid/aliases */
  84. NULL, NULL, nameoptuid_filter_ava, NULL, nameoptuid_values2keys,
  85. nameoptuid_assertion2keys_ava, NULL, nameoptuid_compare},
  86. };
  87. static size_t mr_plugin_table_size = sizeof(mr_plugin_table)/sizeof(mr_plugin_table[0]);
  88. static int
  89. matching_rule_plugin_init(Slapi_PBlock *pb)
  90. {
  91. return syntax_matching_rule_plugin_init(pb, mr_plugin_table, mr_plugin_table_size);
  92. }
  93. static int
  94. register_matching_rule_plugins()
  95. {
  96. return syntax_register_matching_rule_plugins(mr_plugin_table, mr_plugin_table_size, matching_rule_plugin_init);
  97. }
  98. int
  99. nameoptuid_init( Slapi_PBlock *pb )
  100. {
  101. int rc, flags;
  102. LDAPDebug( LDAP_DEBUG_PLUGIN, "=> nameoptuid_init\n", 0, 0, 0 );
  103. rc = slapi_pblock_set( pb, SLAPI_PLUGIN_VERSION,
  104. (void *) SLAPI_PLUGIN_VERSION_01 );
  105. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_DESCRIPTION,
  106. (void *)&pdesc );
  107. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_AVA,
  108. (void *) nameoptuid_filter_ava );
  109. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_SUB,
  110. (void *) nameoptuid_filter_sub );
  111. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALUES2KEYS,
  112. (void *) nameoptuid_values2keys );
  113. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_AVA,
  114. (void *) nameoptuid_assertion2keys_ava );
  115. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_SUB,
  116. (void *) nameoptuid_assertion2keys_sub );
  117. flags = SLAPI_PLUGIN_SYNTAX_FLAG_ORDERING;
  118. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FLAGS,
  119. (void *) &flags );
  120. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_NAMES,
  121. (void *) names );
  122. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_OID,
  123. (void *) NAMEANDOPTIONALUID_SYNTAX_OID );
  124. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_COMPARE,
  125. (void *) nameoptuid_compare );
  126. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALIDATE,
  127. (void *) nameoptuid_validate );
  128. rc |= register_matching_rule_plugins();
  129. LDAPDebug( LDAP_DEBUG_PLUGIN, "<= nameoptuid_init %d\n", rc, 0, 0 );
  130. return( rc );
  131. }
  132. static int
  133. nameoptuid_filter_ava(
  134. Slapi_PBlock *pb,
  135. struct berval *bvfilter,
  136. Slapi_Value **bvals,
  137. int ftype,
  138. Slapi_Value **retVal
  139. )
  140. {
  141. return( string_filter_ava( bvfilter, bvals, SYNTAX_CIS | SYNTAX_DN,
  142. ftype, retVal ) );
  143. }
  144. static int
  145. nameoptuid_filter_sub(
  146. Slapi_PBlock *pb,
  147. char *initial,
  148. char **any,
  149. char *final,
  150. Slapi_Value **bvals
  151. )
  152. {
  153. return( string_filter_sub( pb, initial, any, final, bvals,
  154. SYNTAX_CIS | SYNTAX_DN ) );
  155. }
  156. static int
  157. nameoptuid_values2keys(
  158. Slapi_PBlock *pb,
  159. Slapi_Value **vals,
  160. Slapi_Value ***ivals,
  161. int ftype
  162. )
  163. {
  164. return( string_values2keys( pb, vals, ivals, SYNTAX_CIS | SYNTAX_DN,
  165. ftype ) );
  166. }
  167. static int
  168. nameoptuid_assertion2keys_ava(
  169. Slapi_PBlock *pb,
  170. Slapi_Value *val,
  171. Slapi_Value ***ivals,
  172. int ftype
  173. )
  174. {
  175. return(string_assertion2keys_ava( pb, val, ivals,
  176. SYNTAX_CIS | SYNTAX_DN, ftype ));
  177. }
  178. static int
  179. nameoptuid_assertion2keys_sub(
  180. Slapi_PBlock *pb,
  181. char *initial,
  182. char **any,
  183. char *final,
  184. Slapi_Value ***ivals
  185. )
  186. {
  187. return( string_assertion2keys_sub( pb, initial, any, final, ivals,
  188. SYNTAX_CIS | SYNTAX_DN ) );
  189. }
  190. static int nameoptuid_compare(
  191. struct berval *v1,
  192. struct berval *v2
  193. )
  194. {
  195. return value_cmp(v1, v2, SYNTAX_CIS | SYNTAX_DN, 3 /* Normalise both values */);
  196. }
  197. static int
  198. nameoptuid_validate(
  199. struct berval *val
  200. )
  201. {
  202. int rc = 0; /* assume the value is valid */
  203. int got_sharp = 0;
  204. const char *p = NULL;
  205. const char *start = NULL;
  206. const char *end = NULL;
  207. /* Per RFC4517:
  208. *
  209. * NameAndOptionalUID = distinguishedName [ SHARP BitString ]
  210. */
  211. /* Don't allow a 0 length string */
  212. if ((val == NULL) || (val->bv_len == 0)) {
  213. rc = 1;
  214. goto exit;
  215. }
  216. start = &(val->bv_val[0]);
  217. end = &(val->bv_val[val->bv_len - 1]);
  218. /* Find the last SHARP in the value that may be separating
  219. * the distinguishedName from the optional BitString. */
  220. for (p = end; p >= start + 1; p--) {
  221. if (IS_SHARP(*p)) {
  222. got_sharp = 1;
  223. break;
  224. }
  225. }
  226. if (got_sharp) {
  227. /* Try to validate everything after the sharp as
  228. * a BitString. If this fails, we may still have
  229. * a valid value since a sharp is allowed in a
  230. * distinguishedName. If we don't find a valid
  231. * BitString, just validate the entire value as
  232. * a distinguishedName. */
  233. if ((rc = bitstring_validate_internal(p + 1, end)) != 0) {
  234. rc = distinguishedname_validate(start, end);
  235. } else {
  236. rc = distinguishedname_validate(start, p - 1);
  237. }
  238. } else {
  239. /* No optional BitString is present, so validate
  240. * the entire value as a distinguishedName. */
  241. rc = distinguishedname_validate(start, end);
  242. }
  243. exit:
  244. return rc;
  245. }