nameoptuid.c 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233
  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", PLUGIN_MAGIC_VENDOR_STR, PRODUCTTEXT,
  61. "Name And Optional UID attribute syntax plugin" };
  62. int
  63. nameoptuid_init( Slapi_PBlock *pb )
  64. {
  65. int rc, flags;
  66. LDAPDebug( LDAP_DEBUG_PLUGIN, "=> nameoptuid_init\n", 0, 0, 0 );
  67. rc = slapi_pblock_set( pb, SLAPI_PLUGIN_VERSION,
  68. (void *) SLAPI_PLUGIN_VERSION_01 );
  69. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_DESCRIPTION,
  70. (void *)&pdesc );
  71. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_AVA,
  72. (void *) nameoptuid_filter_ava );
  73. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FILTER_SUB,
  74. (void *) nameoptuid_filter_sub );
  75. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALUES2KEYS,
  76. (void *) nameoptuid_values2keys );
  77. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_AVA,
  78. (void *) nameoptuid_assertion2keys_ava );
  79. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_ASSERTION2KEYS_SUB,
  80. (void *) nameoptuid_assertion2keys_sub );
  81. flags = SLAPI_PLUGIN_SYNTAX_FLAG_ORDERING;
  82. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_FLAGS,
  83. (void *) &flags );
  84. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_NAMES,
  85. (void *) names );
  86. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_OID,
  87. (void *) NAMEANDOPTIONALUID_SYNTAX_OID );
  88. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_COMPARE,
  89. (void *) nameoptuid_compare );
  90. rc |= slapi_pblock_set( pb, SLAPI_PLUGIN_SYNTAX_VALIDATE,
  91. (void *) nameoptuid_validate );
  92. LDAPDebug( LDAP_DEBUG_PLUGIN, "<= nameoptuid_init %d\n", rc, 0, 0 );
  93. return( rc );
  94. }
  95. static int
  96. nameoptuid_filter_ava(
  97. Slapi_PBlock *pb,
  98. struct berval *bvfilter,
  99. Slapi_Value **bvals,
  100. int ftype,
  101. Slapi_Value **retVal
  102. )
  103. {
  104. return( string_filter_ava( bvfilter, bvals, SYNTAX_CIS | SYNTAX_DN,
  105. ftype, retVal ) );
  106. }
  107. static int
  108. nameoptuid_filter_sub(
  109. Slapi_PBlock *pb,
  110. char *initial,
  111. char **any,
  112. char *final,
  113. Slapi_Value **bvals
  114. )
  115. {
  116. return( string_filter_sub( pb, initial, any, final, bvals,
  117. SYNTAX_CIS | SYNTAX_DN ) );
  118. }
  119. static int
  120. nameoptuid_values2keys(
  121. Slapi_PBlock *pb,
  122. Slapi_Value **vals,
  123. Slapi_Value ***ivals,
  124. int ftype
  125. )
  126. {
  127. return( string_values2keys( pb, vals, ivals, SYNTAX_CIS | SYNTAX_DN,
  128. ftype ) );
  129. }
  130. static int
  131. nameoptuid_assertion2keys_ava(
  132. Slapi_PBlock *pb,
  133. Slapi_Value *val,
  134. Slapi_Value ***ivals,
  135. int ftype
  136. )
  137. {
  138. return(string_assertion2keys_ava( pb, val, ivals,
  139. SYNTAX_CIS | SYNTAX_DN, ftype ));
  140. }
  141. static int
  142. nameoptuid_assertion2keys_sub(
  143. Slapi_PBlock *pb,
  144. char *initial,
  145. char **any,
  146. char *final,
  147. Slapi_Value ***ivals
  148. )
  149. {
  150. return( string_assertion2keys_sub( pb, initial, any, final, ivals,
  151. SYNTAX_CIS | SYNTAX_DN ) );
  152. }
  153. static int nameoptuid_compare(
  154. struct berval *v1,
  155. struct berval *v2
  156. )
  157. {
  158. return value_cmp(v1, v2, SYNTAX_CIS | SYNTAX_DN, 3 /* Normalise both values */);
  159. }
  160. static int
  161. nameoptuid_validate(
  162. struct berval *val
  163. )
  164. {
  165. int rc = 0; /* assume the value is valid */
  166. int got_sharp = 0;
  167. const char *p = NULL;
  168. const char *start = NULL;
  169. const char *end = NULL;
  170. /* Per RFC4517:
  171. *
  172. * NameAndOptionalUID = distinguishedName [ SHARP BitString ]
  173. */
  174. /* Don't allow a 0 length string */
  175. if ((val == NULL) || (val->bv_len == 0)) {
  176. rc = 1;
  177. goto exit;
  178. }
  179. start = &(val->bv_val[0]);
  180. end = &(val->bv_val[val->bv_len - 1]);
  181. /* Find the last SHARP in the value that may be separating
  182. * the distinguishedName from the optional BitString. */
  183. for (p = end; p >= start + 1; p--) {
  184. if (IS_SHARP(*p)) {
  185. got_sharp = 1;
  186. break;
  187. }
  188. }
  189. if (got_sharp) {
  190. /* Try to validate everything after the sharp as
  191. * a BitString. If this fails, we may still have
  192. * a valid value since a sharp is allowed in a
  193. * distinguishedName. If we don't find a valid
  194. * BitString, just validate the entire value as
  195. * a distinguishedName. */
  196. if ((rc = bitstring_validate_internal(p + 1, end)) != 0) {
  197. rc = distinguishedname_validate(start, end);
  198. } else {
  199. rc = distinguishedname_validate(start, p - 1);
  200. }
  201. } else {
  202. /* No optional BitString is present, so validate
  203. * the entire value as a distinguishedName. */
  204. rc = distinguishedname_validate(start, end);
  205. }
  206. exit:
  207. return rc;
  208. }