2000-09-25 06:48:13 +08:00
|
|
|
/* dn2entry.c - routines to deal with the dn2id / id2entry glue */
|
|
|
|
/* $OpenLDAP$ */
|
2003-11-29 05:08:20 +08:00
|
|
|
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
|
|
|
|
*
|
2008-01-08 08:19:56 +08:00
|
|
|
* Copyright 2000-2008 The OpenLDAP Foundation.
|
2003-11-29 05:08:20 +08:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted only as authorized by the OpenLDAP
|
|
|
|
* Public License.
|
|
|
|
*
|
|
|
|
* A copy of this license is available in the file LICENSE in the
|
|
|
|
* top-level directory of the distribution or, alternatively, at
|
|
|
|
* <http://www.OpenLDAP.org/license.html>.
|
2000-09-25 06:48:13 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#include "portable.h"
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <ac/string.h>
|
|
|
|
|
|
|
|
#include "back-bdb.h"
|
|
|
|
|
|
|
|
/*
|
|
|
|
* dn2entry - look up dn in the cache/indexes and return the corresponding
|
2003-04-17 00:23:36 +08:00
|
|
|
* entry. If the requested DN is not found and matched is TRUE, return info
|
|
|
|
* for the closest ancestor of the DN. Otherwise e is NULL.
|
2000-09-25 06:48:13 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2003-04-17 00:23:36 +08:00
|
|
|
bdb_dn2entry(
|
2003-05-25 08:53:08 +08:00
|
|
|
Operation *op,
|
2000-09-25 06:48:13 +08:00
|
|
|
DB_TXN *tid,
|
2001-12-27 07:26:17 +08:00
|
|
|
struct berval *dn,
|
2003-04-17 00:23:36 +08:00
|
|
|
EntryInfo **e,
|
|
|
|
int matched,
|
2003-05-25 08:53:08 +08:00
|
|
|
DB_LOCK *lock )
|
2000-09-25 06:48:13 +08:00
|
|
|
{
|
2003-04-17 00:23:36 +08:00
|
|
|
EntryInfo *ei = NULL;
|
2004-06-25 13:29:33 +08:00
|
|
|
int rc, rc2;
|
2000-09-25 06:48:13 +08:00
|
|
|
|
2003-04-17 00:23:36 +08:00
|
|
|
Debug(LDAP_DEBUG_TRACE, "bdb_dn2entry(\"%s\")\n",
|
2001-12-27 07:26:17 +08:00
|
|
|
dn->bv_val, 0, 0 );
|
2000-09-25 06:48:13 +08:00
|
|
|
|
2000-09-27 01:47:24 +08:00
|
|
|
*e = NULL;
|
|
|
|
|
2008-08-27 09:45:35 +08:00
|
|
|
rc = bdb_cache_find_ndn( op, tid, dn, &ei );
|
2003-04-17 00:23:36 +08:00
|
|
|
if ( rc ) {
|
|
|
|
if ( matched && rc == DB_NOTFOUND ) {
|
|
|
|
/* Set the return value, whether we have its entry
|
|
|
|
* or not.
|
|
|
|
*/
|
|
|
|
*e = ei;
|
2004-06-25 13:29:33 +08:00
|
|
|
if ( ei && ei->bei_id ) {
|
|
|
|
rc2 = bdb_cache_find_id( op, tid, ei->bei_id,
|
2008-08-27 09:45:35 +08:00
|
|
|
&ei, ID_LOCKED, lock );
|
2004-06-25 13:29:33 +08:00
|
|
|
if ( rc2 ) rc = rc2;
|
2006-06-01 10:03:10 +08:00
|
|
|
} else if ( ei ) {
|
2003-04-17 00:23:36 +08:00
|
|
|
bdb_cache_entryinfo_unlock( ei );
|
2006-06-01 10:03:10 +08:00
|
|
|
memset( lock, 0, sizeof( *lock ));
|
|
|
|
lock->mode = DB_LOCK_NG;
|
|
|
|
}
|
2003-04-17 00:23:36 +08:00
|
|
|
} else if ( ei ) {
|
|
|
|
bdb_cache_entryinfo_unlock( ei );
|
|
|
|
}
|
2000-09-25 06:48:13 +08:00
|
|
|
} else {
|
2007-11-12 19:16:30 +08:00
|
|
|
rc = bdb_cache_find_id( op, tid, ei->bei_id, &ei, ID_LOCKED,
|
2008-08-27 09:45:35 +08:00
|
|
|
lock );
|
2003-04-17 00:23:36 +08:00
|
|
|
if ( rc == 0 ) {
|
|
|
|
*e = ei;
|
|
|
|
} else if ( matched && rc == DB_NOTFOUND ) {
|
|
|
|
/* always return EntryInfo */
|
2005-04-09 19:15:05 +08:00
|
|
|
if ( ei->bei_parent ) {
|
|
|
|
ei = ei->bei_parent;
|
2007-12-05 13:24:15 +08:00
|
|
|
rc2 = bdb_cache_find_id( op, tid, ei->bei_id, &ei, 0,
|
2008-08-27 09:45:35 +08:00
|
|
|
lock );
|
2005-04-09 19:15:05 +08:00
|
|
|
if ( rc2 ) rc = rc2;
|
|
|
|
}
|
2003-04-17 00:23:36 +08:00
|
|
|
*e = ei;
|
|
|
|
}
|
2000-09-25 06:48:13 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return rc;
|
2000-09-27 01:47:24 +08:00
|
|
|
}
|