uid.c 33 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192
  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) 2005 Red Hat, Inc.
  36. * All rights reserved.
  37. * END COPYRIGHT BLOCK **/
  38. #ifdef HAVE_CONFIG_H
  39. # include <config.h>
  40. #endif
  41. /*
  42. * uid.c
  43. *
  44. * Implements a directory server pre-operation plugin to test
  45. * attributes for uniqueness within a defined subtree in the
  46. * directory.
  47. *
  48. * Called uid.c since the original purpose of the plugin was to
  49. * check the uid attribute in user entries.
  50. */
  51. #include <slapi-plugin.h>
  52. #include <portable.h>
  53. #include <string.h>
  54. #include "plugin-utils.h"
  55. #include "nspr.h"
  56. #if defined( LDAP_DEBUG ) && !defined( DEBUG )
  57. #define DEBUG
  58. #endif
  59. #define UNTAGGED_PARAMETER 12
  60. /* Quoting routine - this should be in a library somewhere (slapi?) */
  61. int ldap_quote_filter_value(
  62. char *value, int len,
  63. char *out, int maxLen,
  64. int *outLen);
  65. static int search_one_berval(const char *baseDN, const char *attrName,
  66. const struct berval *value, const char *requiredObjectClass, const char *target);
  67. /*
  68. * ISSUES:
  69. * How should this plugin handle ACL issues? It seems wrong to reject
  70. * adds and modifies because there is already a conflicting UID, when
  71. * the request would have failed because of an ACL check anyway.
  72. *
  73. * This code currently defines a maximum filter string size of 512. Is
  74. * this large enough?
  75. *
  76. * This code currently does not quote the value portion of the filter as
  77. * it is created. This is a bug.
  78. */
  79. /* */
  80. #define BEGIN do {
  81. #define END } while(0);
  82. /*
  83. * Slapi plugin descriptor
  84. */
  85. static char *plugin_name = "NSUniqueAttr";
  86. static Slapi_PluginDesc
  87. pluginDesc = {
  88. "NSUniqueAttr", VENDOR, DS_PACKAGE_VERSION,
  89. "Enforce unique attribute values"
  90. };
  91. static void* plugin_identity = NULL;
  92. /*
  93. * More information about constraint failure
  94. */
  95. static char *moreInfo =
  96. "Another entry with the same attribute value already exists (attribute: \"%s\")";
  97. static void
  98. freePblock( Slapi_PBlock *spb ) {
  99. if ( spb )
  100. {
  101. slapi_free_search_results_internal( spb );
  102. slapi_pblock_destroy( spb );
  103. }
  104. }
  105. /* ------------------------------------------------------------ */
  106. /*
  107. * op_error - Record (and report) an operational error.
  108. * name changed to uid_op_error so as not to conflict with the external function
  109. * of the same name thereby preventing compiler warnings.
  110. */
  111. static int
  112. uid_op_error(int internal_error)
  113. {
  114. slapi_log_error(
  115. SLAPI_LOG_PLUGIN,
  116. plugin_name,
  117. "Internal error: %d\n",
  118. internal_error);
  119. return LDAP_OPERATIONS_ERROR;
  120. }
  121. /* ------------------------------------------------------------ */
  122. /*
  123. * Create an LDAP search filter from the attribute
  124. * name and value supplied.
  125. */
  126. static char *
  127. create_filter(const char *attribute, const struct berval *value, const char *requiredObjectClass)
  128. {
  129. char *filter;
  130. char *fp;
  131. char *max;
  132. int attrLen;
  133. int valueLen;
  134. int classLen = 0;
  135. int filterLen;
  136. PR_ASSERT(attribute);
  137. /* Compute the length of the required buffer */
  138. attrLen = strlen(attribute);
  139. if (ldap_quote_filter_value(value->bv_val,
  140. value->bv_len, 0, 0, &valueLen))
  141. return 0;
  142. if (requiredObjectClass) {
  143. classLen = strlen(requiredObjectClass);
  144. /* "(&(objectClass=)())" == 19 */
  145. filterLen = attrLen + 1 + valueLen + classLen + 19 + 1;
  146. } else {
  147. filterLen = attrLen + 1 + valueLen + 1;
  148. }
  149. /* Allocate the buffer */
  150. filter = slapi_ch_malloc(filterLen);
  151. fp = filter;
  152. max = &filter[filterLen];
  153. /* Place AND expression and objectClass in filter */
  154. if (requiredObjectClass) {
  155. strcpy(fp, "(&(objectClass=");
  156. fp += 15;
  157. strcpy(fp, requiredObjectClass);
  158. fp += classLen;
  159. *fp++ = ')';
  160. *fp++ = '(';
  161. }
  162. /* Place attribute name in filter */
  163. strcpy(fp, attribute);
  164. fp += attrLen;
  165. /* Place comparison operator */
  166. *fp++ = '=';
  167. /* Place value in filter */
  168. if (ldap_quote_filter_value(value->bv_val, value->bv_len,
  169. fp, max-fp, &valueLen)) { slapi_ch_free((void**)&filter); return 0; }
  170. fp += valueLen;
  171. /* Close AND expression if a requiredObjectClass was set */
  172. if (requiredObjectClass) {
  173. *fp++ = ')';
  174. *fp++ = ')';
  175. }
  176. /* Terminate */
  177. *fp = 0;
  178. return filter;
  179. }
  180. /* ------------------------------------------------------------ */
  181. /*
  182. * search - search a subtree for entries with a named attribute matching
  183. * the list of values. An entry matching the 'target' DN is
  184. * not considered in the search.
  185. *
  186. * If 'attr' is NULL, the values are taken from 'values'.
  187. * If 'attr' is non-NULL, the values are taken from 'attr'.
  188. *
  189. * Return:
  190. * LDAP_SUCCESS - no matches, or the attribute matches the
  191. * target dn.
  192. * LDAP_CONSTRAINT_VIOLATION - an entry was found that already
  193. * contains the attribute value.
  194. * LDAP_OPERATIONS_ERROR - a server failure.
  195. */
  196. static int
  197. search(const char *baseDN, const char *attrName, Slapi_Attr *attr,
  198. struct berval **values, const char *requiredObjectClass,
  199. const char *target)
  200. {
  201. int result;
  202. #ifdef DEBUG
  203. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  204. "SEARCH baseDN=%s attr=%s target=%s\n", baseDN, attrName,
  205. target?target:"None");
  206. #endif
  207. result = LDAP_SUCCESS;
  208. /* If no values, can't possibly be a conflict */
  209. if ( (Slapi_Attr *)NULL == attr && (struct berval **)NULL == values )
  210. return result;
  211. /*
  212. * Perform the search for each value provided
  213. *
  214. * Another possibility would be to search for all the values at once.
  215. * However, this is more complex (for filter creation) and unique
  216. * attributes values are probably only changed one at a time anyway.
  217. */
  218. if ( (Slapi_Attr *)NULL != attr )
  219. {
  220. Slapi_Value *v = NULL;
  221. int vhint = -1;
  222. for ( vhint = slapi_attr_first_value( attr, &v );
  223. vhint != -1 && LDAP_SUCCESS == result;
  224. vhint = slapi_attr_next_value( attr, vhint, &v ))
  225. {
  226. result = search_one_berval(baseDN, attrName,
  227. slapi_value_get_berval(v),
  228. requiredObjectClass, target);
  229. }
  230. }
  231. else
  232. {
  233. for (;*values != NULL && LDAP_SUCCESS == result; values++)
  234. {
  235. result = search_one_berval(baseDN, attrName, *values, requiredObjectClass,
  236. target);
  237. }
  238. }
  239. #ifdef DEBUG
  240. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  241. "SEARCH result = %d\n", result);
  242. #endif
  243. return( result );
  244. }
  245. static int
  246. search_one_berval(const char *baseDN, const char *attrName,
  247. const struct berval *value, const char *requiredObjectClass,
  248. const char *target)
  249. {
  250. int result;
  251. char *filter;
  252. Slapi_PBlock *spb;
  253. result = LDAP_SUCCESS;
  254. /* If no value, can't possibly be a conflict */
  255. if ( (struct berval *)NULL == value )
  256. return result;
  257. filter = 0;
  258. spb = 0;
  259. BEGIN
  260. int err;
  261. int sres;
  262. Slapi_Entry **entries;
  263. static char *attrs[] = { "1.1", 0 };
  264. /* Create the filter - this needs to be freed */
  265. filter = create_filter(attrName, value, requiredObjectClass);
  266. #ifdef DEBUG
  267. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  268. "SEARCH filter=%s\n", filter);
  269. #endif
  270. /* Perform the search using the new internal API */
  271. spb = slapi_pblock_new();
  272. if (!spb) { result = uid_op_error(2); break; }
  273. slapi_search_internal_set_pb(spb, baseDN, LDAP_SCOPE_SUBTREE,
  274. filter, attrs, 0 /* attrs only */, NULL, NULL, plugin_identity, 0 /* actions */);
  275. slapi_search_internal_pb(spb);
  276. err = slapi_pblock_get(spb, SLAPI_PLUGIN_INTOP_RESULT, &sres);
  277. if (err) { result = uid_op_error(3); break; }
  278. /* Allow search to report that there is nothing in the subtree */
  279. if (sres == LDAP_NO_SUCH_OBJECT) break;
  280. /* Other errors are bad */
  281. if (sres) { result = uid_op_error(3); break; }
  282. err = slapi_pblock_get(spb, SLAPI_PLUGIN_INTOP_SEARCH_ENTRIES,
  283. &entries);
  284. if (err) { result = uid_op_error(4); break; }
  285. /*
  286. * Look at entries returned. Any entry found must be the
  287. * target entry or the constraint fails.
  288. */
  289. for(;*entries;entries++)
  290. {
  291. char *ndn = slapi_entry_get_ndn(*entries); /* get the normalized dn */
  292. #ifdef DEBUG
  293. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  294. "SEARCH entry dn=%s\n", ndn);
  295. #endif
  296. /*
  297. * It is a Constraint Violation if any entry is found, unless
  298. * the entry is the target entry (if any).
  299. */
  300. if (!target || strcmp(ndn, target) != 0)
  301. {
  302. result = LDAP_CONSTRAINT_VIOLATION;
  303. break;
  304. }
  305. }
  306. #ifdef DEBUG
  307. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  308. "SEARCH complete result=%d\n", result);
  309. #endif
  310. END
  311. /* Clean-up */
  312. if (spb) {
  313. slapi_free_search_results_internal(spb);
  314. slapi_pblock_destroy(spb);
  315. }
  316. slapi_ch_free((void**)&filter);
  317. return result;
  318. }
  319. /* ------------------------------------------------------------ */
  320. /*
  321. * searchAllSubtrees - search all subtrees in argv for entries
  322. * with a named attribute matching the list of values, by
  323. * calling search for each one.
  324. *
  325. * If 'attr' is NULL, the values are taken from 'values'.
  326. * If 'attr' is non-NULL, the values are taken from 'attr'.
  327. *
  328. * Return:
  329. * LDAP_SUCCESS - no matches, or the attribute matches the
  330. * target dn.
  331. * LDAP_CONSTRAINT_VIOLATION - an entry was found that already
  332. * contains the attribute value.
  333. * LDAP_OPERATIONS_ERROR - a server failure.
  334. */
  335. static int
  336. searchAllSubtrees(int argc, char *argv[], const char *attrName,
  337. Slapi_Attr *attr, struct berval **values, const char *requiredObjectClass,
  338. const char *dn)
  339. {
  340. int result = LDAP_SUCCESS;
  341. /*
  342. * For each DN in the managed list, do uniqueness checking if
  343. * the target DN is a subnode in the tree.
  344. */
  345. for(;argc > 0;argc--,argv++)
  346. {
  347. /*
  348. * The DN should already be normalized, so we don't have to
  349. * worry about that here.
  350. */
  351. if (slapi_dn_issuffix(dn, *argv)) {
  352. result = search(*argv, attrName, attr, values, requiredObjectClass, dn);
  353. if (result) break;
  354. }
  355. }
  356. return result;
  357. }
  358. /* ------------------------------------------------------------ */
  359. /*
  360. * getArguments - parse invocation parameters
  361. * Return:
  362. * 0 - success
  363. * >0 - error parsing parameters
  364. */
  365. static int
  366. getArguments(Slapi_PBlock *pb, char **attrName, char **markerObjectClass,
  367. char **requiredObjectClass)
  368. {
  369. int argc;
  370. char **argv;
  371. /*
  372. * Get the arguments
  373. */
  374. if (slapi_pblock_get(pb, SLAPI_PLUGIN_ARGC, &argc))
  375. {
  376. return uid_op_error(10);
  377. }
  378. if (slapi_pblock_get(pb, SLAPI_PLUGIN_ARGV, &argv))
  379. {
  380. return uid_op_error(11);
  381. }
  382. /*
  383. * Required arguments: attribute and markerObjectClass
  384. * Optional argument: requiredObjectClass
  385. */
  386. for(;argc > 0;argc--,argv++)
  387. {
  388. char *param = *argv;
  389. char *delimiter = strchr(param, '=');
  390. if (NULL == delimiter)
  391. {
  392. /* Old style untagged parameter */
  393. *attrName = *argv;
  394. return UNTAGGED_PARAMETER;
  395. }
  396. if (strncasecmp(param, "attribute", delimiter-param) == 0)
  397. {
  398. /* It's OK to set a pointer here, because ultimately it points
  399. * inside the argv array of the pblock, which will be staying
  400. * arround.
  401. */
  402. *attrName = delimiter+1;
  403. } else if (strncasecmp(param, "markerobjectclass", delimiter-param) == 0)
  404. {
  405. *markerObjectClass = delimiter+1;
  406. } else if (strncasecmp(param, "requiredobjectclass", delimiter-param) == 0)
  407. {
  408. *requiredObjectClass = delimiter+1;
  409. }
  410. }
  411. if (!*attrName || !*markerObjectClass)
  412. {
  413. return uid_op_error(13);
  414. }
  415. return 0;
  416. }
  417. /* ------------------------------------------------------------ */
  418. /*
  419. * findSubtreeAndSearch - walk up the tree to find an entry with
  420. * the marker object class; if found, call search from there and
  421. * return the result it returns
  422. *
  423. * If 'attr' is NULL, the values are taken from 'values'.
  424. * If 'attr' is non-NULL, the values are taken from 'attr'.
  425. *
  426. * Return:
  427. * LDAP_SUCCESS - no matches, or the attribute matches the
  428. * target dn.
  429. * LDAP_CONSTRAINT_VIOLATION - an entry was found that already
  430. * contains the attribute value.
  431. * LDAP_OPERATIONS_ERROR - a server failure.
  432. */
  433. static int
  434. findSubtreeAndSearch(char *parentDN, const char *attrName, Slapi_Attr *attr,
  435. struct berval **values, const char *requiredObjectClass, const char *target,
  436. const char *markerObjectClass)
  437. {
  438. int result = LDAP_SUCCESS;
  439. Slapi_PBlock *spb = NULL;
  440. while (NULL != (parentDN = slapi_dn_parent(parentDN)))
  441. {
  442. if ((spb = dnHasObjectClass(parentDN, markerObjectClass)))
  443. {
  444. freePblock(spb);
  445. /*
  446. * Do the search. There is no entry that is allowed
  447. * to have the attribute already.
  448. */
  449. result = search(parentDN, attrName, attr, values, requiredObjectClass,
  450. target);
  451. break;
  452. }
  453. }
  454. return result;
  455. }
  456. /* ------------------------------------------------------------ */
  457. /*
  458. * preop_add - pre-operation plug-in for add
  459. */
  460. static int
  461. preop_add(Slapi_PBlock *pb)
  462. {
  463. int result;
  464. char *errtext = NULL;
  465. char *attrName = NULL;
  466. #ifdef DEBUG
  467. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name, "ADD begin\n");
  468. #endif
  469. result = LDAP_SUCCESS;
  470. /*
  471. * Do constraint check on the added entry. Set result.
  472. */
  473. BEGIN
  474. int err;
  475. char *markerObjectClass = NULL;
  476. char *requiredObjectClass = NULL;
  477. const char *dn = NULL;
  478. Slapi_DN *sdn = NULL;
  479. int isupdatedn;
  480. Slapi_Entry *e;
  481. Slapi_Attr *attr;
  482. int argc;
  483. char **argv = NULL;
  484. /*
  485. * If this is a replication update, just be a noop.
  486. */
  487. err = slapi_pblock_get(pb, SLAPI_IS_REPLICATED_OPERATION, &isupdatedn);
  488. if (err) { result = uid_op_error(50); break; }
  489. if (isupdatedn)
  490. {
  491. break;
  492. }
  493. /*
  494. * Get the arguments
  495. */
  496. result = getArguments(pb, &attrName, &markerObjectClass,
  497. &requiredObjectClass);
  498. if (UNTAGGED_PARAMETER == result)
  499. {
  500. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  501. "ADD parameter untagged: %s\n", attrName);
  502. result = LDAP_SUCCESS;
  503. /* Statically defined subtrees to monitor */
  504. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGC, &argc);
  505. if (err) { result = uid_op_error(53); break; }
  506. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGV, &argv);
  507. if (err) { result = uid_op_error(54); break; }
  508. argc--; argv++; /* First argument was attribute name */
  509. } else if (0 != result)
  510. {
  511. break;
  512. }
  513. /*
  514. * Get the target DN for this add operation
  515. */
  516. err = slapi_pblock_get(pb, SLAPI_ADD_TARGET_SDN, &sdn);
  517. if (err) { result = uid_op_error(51); break; }
  518. dn = slapi_sdn_get_dn(sdn);
  519. #ifdef DEBUG
  520. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name, "ADD target=%s\n", dn);
  521. #endif
  522. /*
  523. * Get the entry data for this add. Check whether it
  524. * contains a value for the unique attribute
  525. */
  526. err = slapi_pblock_get(pb, SLAPI_ADD_ENTRY, &e);
  527. if (err) { result = uid_op_error(52); break; }
  528. err = slapi_entry_attr_find(e, attrName, &attr);
  529. if (err) break; /* no unique attribute */
  530. /*
  531. * Check if it contains the required object class
  532. */
  533. if (NULL != requiredObjectClass)
  534. {
  535. if (!entryHasObjectClass(pb, e, requiredObjectClass))
  536. {
  537. /* No, so we don't have to do anything */
  538. break;
  539. }
  540. }
  541. /*
  542. * Passed all the requirements - this is an operation we
  543. * need to enforce uniqueness on. Now find all parent entries
  544. * with the marker object class, and do a search for each one.
  545. */
  546. if (NULL != markerObjectClass)
  547. {
  548. /* Subtree defined by location of marker object class */
  549. result = findSubtreeAndSearch((char *)dn, attrName, attr, NULL,
  550. requiredObjectClass, dn,
  551. markerObjectClass);
  552. } else
  553. {
  554. /* Subtrees listed on invocation line */
  555. result = searchAllSubtrees(argc, argv, attrName, attr, NULL,
  556. requiredObjectClass, dn);
  557. }
  558. END
  559. if (result)
  560. {
  561. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  562. "ADD result %d\n", result);
  563. if (result == LDAP_CONSTRAINT_VIOLATION) {
  564. errtext = slapi_ch_smprintf(moreInfo, attrName);
  565. } else {
  566. errtext = slapi_ch_strdup("Error checking for attribute uniqueness.");
  567. }
  568. /* Send failure to the client */
  569. slapi_send_ldap_result(pb, result, 0, errtext, 0, 0);
  570. slapi_ch_free_string(&errtext);
  571. }
  572. return (result==LDAP_SUCCESS)?0:-1;
  573. }
  574. static void
  575. addMod(LDAPMod ***modary, int *capacity, int *nmods, LDAPMod *toadd)
  576. {
  577. if (*nmods == *capacity) {
  578. *capacity += 4;
  579. if (*modary) {
  580. *modary = (LDAPMod **)slapi_ch_realloc((char *)*modary, *capacity * sizeof(LDAPMod *));
  581. } else {
  582. *modary = (LDAPMod **)slapi_ch_malloc(*capacity * sizeof(LDAPMod *));
  583. }
  584. }
  585. (*modary)[*nmods] = toadd;
  586. (*nmods)++;
  587. }
  588. /* ------------------------------------------------------------ */
  589. /*
  590. * preop_modify - pre-operation plug-in for modify
  591. */
  592. static int
  593. preop_modify(Slapi_PBlock *pb)
  594. {
  595. int result = LDAP_SUCCESS;
  596. Slapi_PBlock *spb = NULL;
  597. LDAPMod **checkmods = NULL;
  598. int checkmodsCapacity = 0;
  599. char *errtext = NULL;
  600. char *attrName = NULL;
  601. #ifdef DEBUG
  602. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  603. "MODIFY begin\n");
  604. #endif
  605. BEGIN
  606. int err;
  607. char *markerObjectClass=NULL;
  608. char *requiredObjectClass=NULL;
  609. LDAPMod **mods;
  610. int modcount = 0;
  611. int ii;
  612. LDAPMod *mod;
  613. const char *dn = NULL;
  614. Slapi_DN *sdn = NULL;
  615. int isupdatedn;
  616. int argc;
  617. char **argv = NULL;
  618. /*
  619. * If this is a replication update, just be a noop.
  620. */
  621. err = slapi_pblock_get(pb, SLAPI_IS_REPLICATED_OPERATION, &isupdatedn);
  622. if (err) { result = uid_op_error(60); break; }
  623. if (isupdatedn)
  624. {
  625. break;
  626. }
  627. /*
  628. * Get the arguments
  629. */
  630. result = getArguments(pb, &attrName, &markerObjectClass,
  631. &requiredObjectClass);
  632. if (UNTAGGED_PARAMETER == result)
  633. {
  634. result = LDAP_SUCCESS;
  635. /* Statically defined subtrees to monitor */
  636. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGC, &argc);
  637. if (err) { result = uid_op_error(53); break; }
  638. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGV, &argv);
  639. if (err) { result = uid_op_error(54); break; }
  640. argc--; /* First argument was attribute name */
  641. argv++;
  642. } else if (0 != result)
  643. {
  644. break;
  645. }
  646. err = slapi_pblock_get(pb, SLAPI_MODIFY_MODS, &mods);
  647. if (err) { result = uid_op_error(61); break; }
  648. /* There may be more than one mod that matches e.g.
  649. changetype: modify
  650. delete: uid
  651. uid: balster1950
  652. -
  653. add: uid
  654. uid: scottg
  655. So, we need to first find all mods that contain the attribute
  656. which are add or replace ops and are bvalue encoded
  657. */
  658. /* find out how many mods meet this criteria */
  659. for(;*mods;mods++)
  660. {
  661. mod = *mods;
  662. if ((slapi_attr_type_cmp(mod->mod_type, attrName, 1) == 0) && /* mod contains target attr */
  663. (mod->mod_op & LDAP_MOD_BVALUES) && /* mod is bval encoded (not string val) */
  664. (mod->mod_bvalues && mod->mod_bvalues[0]) && /* mod actually contains some values */
  665. (SLAPI_IS_MOD_ADD(mod->mod_op) || /* mod is add */
  666. SLAPI_IS_MOD_REPLACE(mod->mod_op))) /* mod is replace */
  667. {
  668. addMod(&checkmods, &checkmodsCapacity, &modcount, mod);
  669. }
  670. }
  671. if (modcount == 0) {
  672. break; /* no mods to check, we are done */
  673. }
  674. /* Get the target DN */
  675. err = slapi_pblock_get(pb, SLAPI_MODIFY_TARGET_SDN, &sdn);
  676. if (err) { result = uid_op_error(11); break; }
  677. dn = slapi_sdn_get_dn(sdn);
  678. /*
  679. * Check if it has the required object class
  680. */
  681. if (requiredObjectClass &&
  682. !(spb = dnHasObjectClass(dn, requiredObjectClass))) {
  683. break;
  684. }
  685. /*
  686. * Passed all the requirements - this is an operation we
  687. * need to enforce uniqueness on. Now find all parent entries
  688. * with the marker object class, and do a search for each one.
  689. */
  690. /*
  691. * stop checking at first mod that fails the check
  692. */
  693. for (ii = 0; (result == 0) && (ii < modcount); ++ii)
  694. {
  695. mod = checkmods[ii];
  696. if (NULL != markerObjectClass)
  697. {
  698. /* Subtree defined by location of marker object class */
  699. result = findSubtreeAndSearch((char *)dn, attrName, NULL,
  700. mod->mod_bvalues, requiredObjectClass,
  701. dn, markerObjectClass);
  702. } else
  703. {
  704. /* Subtrees listed on invocation line */
  705. result = searchAllSubtrees(argc, argv, attrName, NULL,
  706. mod->mod_bvalues, requiredObjectClass, dn);
  707. }
  708. }
  709. END
  710. slapi_ch_free((void **)&checkmods);
  711. freePblock(spb);
  712. if (result)
  713. {
  714. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  715. "MODIFY result %d\n", result);
  716. if (result == LDAP_CONSTRAINT_VIOLATION) {
  717. errtext = slapi_ch_smprintf(moreInfo, attrName);
  718. } else {
  719. errtext = slapi_ch_strdup("Error checking for attribute uniqueness.");
  720. }
  721. slapi_send_ldap_result(pb, result, 0, errtext, 0, 0);
  722. slapi_ch_free_string(&errtext);
  723. }
  724. return (result==LDAP_SUCCESS)?0:-1;
  725. }
  726. /* ------------------------------------------------------------ */
  727. /*
  728. * preop_modrdn - Pre-operation call for modify RDN
  729. *
  730. * Check that the new RDN does not include attributes that
  731. * cause a constraint violation
  732. */
  733. static int
  734. preop_modrdn(Slapi_PBlock *pb)
  735. {
  736. int result = LDAP_SUCCESS;
  737. Slapi_Entry *e = NULL;
  738. Slapi_Value *sv_requiredObjectClass = NULL;
  739. char *errtext = NULL;
  740. char *attrName = NULL;
  741. #ifdef DEBUG
  742. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  743. "MODRDN begin\n");
  744. #endif
  745. BEGIN
  746. int err;
  747. char *markerObjectClass=NULL;
  748. char *requiredObjectClass=NULL;
  749. const char *dn = NULL;
  750. Slapi_DN *sdn = NULL;
  751. Slapi_DN *superior;
  752. char *rdn;
  753. int deloldrdn = 0;
  754. int isupdatedn;
  755. Slapi_Attr *attr;
  756. int argc;
  757. char **argv = NULL;
  758. /*
  759. * If this is a replication update, just be a noop.
  760. */
  761. err = slapi_pblock_get(pb, SLAPI_IS_REPLICATED_OPERATION, &isupdatedn);
  762. if (err) { result = uid_op_error(30); break; }
  763. if (isupdatedn)
  764. {
  765. break;
  766. }
  767. /*
  768. * Get the arguments
  769. */
  770. result = getArguments(pb, &attrName, &markerObjectClass,
  771. &requiredObjectClass);
  772. if (UNTAGGED_PARAMETER == result)
  773. {
  774. result = LDAP_SUCCESS;
  775. /* Statically defined subtrees to monitor */
  776. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGC, &argc);
  777. if (err) { result = uid_op_error(53); break; }
  778. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGV, &argv);
  779. if (err) { result = uid_op_error(54); break; }
  780. argc--; /* First argument was attribute name */
  781. argv++;
  782. } else if (0 != result)
  783. {
  784. break;
  785. }
  786. /* Create a Slapi_Value for the requiredObjectClass to use
  787. * for checking the entry. */
  788. if (requiredObjectClass) {
  789. sv_requiredObjectClass = slapi_value_new_string(requiredObjectClass);
  790. }
  791. /* Get the DN of the entry being renamed */
  792. err = slapi_pblock_get(pb, SLAPI_MODRDN_TARGET_SDN, &sdn);
  793. if (err) { result = uid_op_error(31); break; }
  794. dn = slapi_sdn_get_dn(sdn);
  795. /* Get superior value - unimplemented in 3.0/4.0/5.0 DS */
  796. err = slapi_pblock_get(pb, SLAPI_MODRDN_NEWSUPERIOR_SDN, &superior);
  797. if (err) { result = uid_op_error(32); break; }
  798. /*
  799. * No superior means the entry is just renamed at
  800. * its current level in the tree. Use the target DN for
  801. * determining which managed tree this belongs to
  802. */
  803. if (!superior) superior = sdn;
  804. /* Get the new RDN - this has the attribute values */
  805. err = slapi_pblock_get(pb, SLAPI_MODRDN_NEWRDN, &rdn);
  806. if (err) { result = uid_op_error(33); break; }
  807. #ifdef DEBUG
  808. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  809. "MODRDN newrdn=%s\n", rdn);
  810. #endif
  811. /* See if the old RDN value is being deleted. */
  812. err = slapi_pblock_get(pb, SLAPI_MODRDN_DELOLDRDN, &deloldrdn);
  813. if (err) { result = uid_op_error(34); break; }
  814. /* Get the entry that is being renamed so we can make a dummy copy
  815. * of what it will look like after the rename. */
  816. err = slapi_search_internal_get_entry(sdn, NULL, &e, plugin_identity);
  817. if (err != LDAP_SUCCESS) {
  818. result = uid_op_error(35);
  819. /* We want to return a no such object error if the target doesn't exist. */
  820. if (err == LDAP_NO_SUCH_OBJECT) {
  821. result = err;
  822. }
  823. break;
  824. }
  825. /* Apply the rename operation to the dummy entry. */
  826. err = slapi_entry_rename(e, rdn, deloldrdn, slapi_sdn_get_dn(superior));
  827. if (err != LDAP_SUCCESS) { result = uid_op_error(36); break; }
  828. /*
  829. * Find any unique attribute data in the new RDN
  830. */
  831. err = slapi_entry_attr_find(e, attrName, &attr);
  832. if (err) break; /* no UID attribute */
  833. /*
  834. * Check if it has the required object class
  835. */
  836. if (requiredObjectClass &&
  837. !slapi_entry_attr_has_syntax_value(e, SLAPI_ATTR_OBJECTCLASS, sv_requiredObjectClass)) { break; }
  838. /*
  839. * Passed all the requirements - this is an operation we
  840. * need to enforce uniqueness on. Now find all parent entries
  841. * with the marker object class, and do a search for each one.
  842. */
  843. if (NULL != markerObjectClass)
  844. {
  845. /* Subtree defined by location of marker object class */
  846. result = findSubtreeAndSearch(slapi_entry_get_dn(e), attrName, attr, NULL,
  847. requiredObjectClass, dn,
  848. markerObjectClass);
  849. } else
  850. {
  851. /* Subtrees listed on invocation line */
  852. result = searchAllSubtrees(argc, argv, attrName, attr, NULL,
  853. requiredObjectClass, dn);
  854. }
  855. END
  856. /* Clean-up */
  857. slapi_value_free(&sv_requiredObjectClass);
  858. if (e) slapi_entry_free(e);
  859. if (result)
  860. {
  861. slapi_log_error(SLAPI_LOG_PLUGIN, plugin_name,
  862. "MODRDN result %d\n", result);
  863. if (result == LDAP_CONSTRAINT_VIOLATION) {
  864. errtext = slapi_ch_smprintf(moreInfo, attrName);
  865. } else {
  866. errtext = slapi_ch_strdup("Error checking for attribute uniqueness.");
  867. }
  868. slapi_send_ldap_result(pb, result, 0, errtext, 0, 0);
  869. slapi_ch_free_string(&errtext);
  870. }
  871. return (result==LDAP_SUCCESS)?0:-1;
  872. }
  873. /* ------------------------------------------------------------ */
  874. /*
  875. * Initialize the plugin
  876. *
  877. * uidunique_init (the old name) is deprecated
  878. */
  879. int
  880. NSUniqueAttr_Init(Slapi_PBlock *pb)
  881. {
  882. int err = 0;
  883. BEGIN
  884. int argc;
  885. char **argv;
  886. /* Declare plugin version */
  887. err = slapi_pblock_set(pb, SLAPI_PLUGIN_VERSION,
  888. SLAPI_PLUGIN_VERSION_01);
  889. if (err) break;
  890. /*
  891. * Get plugin identity and store it for later use
  892. * Used for internal operations
  893. */
  894. slapi_pblock_get (pb, SLAPI_PLUGIN_IDENTITY, &plugin_identity);
  895. /* PR_ASSERT (plugin_identity); */
  896. /*
  897. * Get and normalize arguments
  898. */
  899. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGC, &argc);
  900. if (err) break;
  901. err = slapi_pblock_get(pb, SLAPI_PLUGIN_ARGV, &argv);
  902. if (err) break;
  903. /* First argument is the unique attribute name */
  904. if (argc < 1) { err = -1; break; }
  905. argv++; argc--;
  906. for(;argc > 0;argc--, argv++) {
  907. char *normdn = slapi_create_dn_string_case("%s", *argv);
  908. slapi_ch_free_string(argv);
  909. *argv = normdn;
  910. }
  911. /* Provide descriptive information */
  912. err = slapi_pblock_set(pb, SLAPI_PLUGIN_DESCRIPTION,
  913. (void*)&pluginDesc);
  914. if (err) break;
  915. /* Register functions */
  916. err = slapi_pblock_set(pb, SLAPI_PLUGIN_PRE_ADD_FN,
  917. (void*)preop_add);
  918. if (err) break;
  919. err = slapi_pblock_set(pb, SLAPI_PLUGIN_PRE_MODIFY_FN,
  920. (void*)preop_modify);
  921. if (err) break;
  922. err = slapi_pblock_set(pb, SLAPI_PLUGIN_PRE_MODRDN_FN,
  923. (void*)preop_modrdn);
  924. if (err) break;
  925. END
  926. if (err) {
  927. slapi_log_error(SLAPI_LOG_PLUGIN, "NSUniqueAttr_Init",
  928. "Error: %d\n", err);
  929. err = -1;
  930. }
  931. else
  932. slapi_log_error(SLAPI_LOG_PLUGIN, "NSUniqueAttr_Init",
  933. "plugin loaded\n");
  934. return err;
  935. }
  936. int
  937. uidunique_init(Slapi_PBlock *pb)
  938. {
  939. return NSUniqueAttr_Init(pb);
  940. }
  941. /* ------------------------------------------------------------ */
  942. /*
  943. * ldap_quote_filter_value
  944. *
  945. * Quote the filter value according to RFC 2254 (Dec 1997)
  946. *
  947. * value - a UTF8 string containing the value. It may contain
  948. * any of the chars needing quotes ( '(' ')' '*' '/' and NUL ).
  949. * len - the length of the UTF8 value
  950. * out - a buffer to recieve the converted value. May be NULL, in
  951. * which case, only the length of the output is computed (and placed in
  952. * outLen).
  953. * maxLen - the size of the output buffer. It is an error if this length
  954. * is exceeded. Ignored if out is NULL.
  955. * outLen - recieves the size of the output. If an error occurs, this
  956. * result is not available.
  957. *
  958. * Returns
  959. * 0 - success
  960. * -1 - failure (usually a buffer overflow)
  961. */
  962. int /* Error value */
  963. ldap_quote_filter_value(
  964. char *value, int len,
  965. char *out, int maxLen,
  966. int *outLen)
  967. {
  968. int err;
  969. char *eValue;
  970. int resLen;
  971. #ifdef SLAPI_SUPPORTS_V3_ESCAPING
  972. static char hexchars[16] = "0123456789abcdef";
  973. #endif
  974. err = 0;
  975. eValue = &value[len];
  976. resLen = 0;
  977. /*
  978. * Convert each character in the input string
  979. */
  980. while(value < eValue)
  981. {
  982. switch(*value)
  983. {
  984. case '(':
  985. case ')':
  986. case '*':
  987. case '\\':
  988. #ifdef SLAPI_SUPPORTS_V3_ESCAPING
  989. case 0:
  990. #endif
  991. /* Handle characters needing special escape sequences */
  992. /* Compute size of output */
  993. #ifdef SLAPI_SUPPORTS_V3_ESCAPING
  994. resLen += 3;
  995. #else
  996. resLen += 2;
  997. #endif
  998. /* Generate output if requested */
  999. if (out)
  1000. {
  1001. /* Check for overflow */
  1002. if (resLen > maxLen) { err = -1; break; }
  1003. *out++ = '\\';
  1004. #ifdef SLAPI_SUPPORTS_V3_ESCAPING
  1005. *out++ = hexchars[(*value >> 4) & 0xF];
  1006. *out++ = hexchars[*value & 0xF];
  1007. #else
  1008. *out++ = *value;
  1009. #endif
  1010. }
  1011. break;
  1012. default:
  1013. /* Compute size of output */
  1014. resLen += 1;
  1015. /* Generate output if requested */
  1016. if (out)
  1017. {
  1018. if (resLen > maxLen) { err = -1; break; }
  1019. *out++ = *value;
  1020. }
  1021. break;
  1022. }
  1023. if (err) break;
  1024. value++;
  1025. }
  1026. if (!err) *outLen = resLen;
  1027. return err;
  1028. }