/* dn2entry.c - routines to deal with the dn2id / id2entry glue */ /* $OpenLDAP: pkg/ldap/servers/slapd/back-bdb/dn2entry.c,v 1.25.2.5 2007/01/02 21:44:00 kurt Exp $ */ /* This work is part of OpenLDAP Software . * * Copyright 2000-2007 The OpenLDAP Foundation. * 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 * . */ #include "portable.h" #include #include #include "back-bdb.h" /* * dn2entry - look up dn in the cache/indexes and return the corresponding * 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. */ int bdb_dn2entry( Operation *op, DB_TXN *tid, struct berval *dn, EntryInfo **e, int matched, u_int32_t locker, DB_LOCK *lock ) { EntryInfo *ei = NULL; int rc, rc2; Debug(LDAP_DEBUG_TRACE, "bdb_dn2entry(\"%s\")\n", dn->bv_val, 0, 0 ); *e = NULL; rc = bdb_cache_find_ndn( op, tid, dn, &ei ); if ( rc ) { if ( matched && rc == DB_NOTFOUND ) { /* Set the return value, whether we have its entry * or not. */ *e = ei; if ( ei && ei->bei_id ) { rc2 = bdb_cache_find_id( op, tid, ei->bei_id, &ei, 1, locker, lock ); if ( rc2 ) rc = rc2; } else if ( ei ) { bdb_cache_entryinfo_unlock( ei ); memset( lock, 0, sizeof( *lock )); lock->mode = DB_LOCK_NG; } } else if ( ei ) { bdb_cache_entryinfo_unlock( ei ); } } else { rc = bdb_cache_find_id( op, tid, ei->bei_id, &ei, 1, locker, lock ); if ( rc == 0 ) { *e = ei; } else if ( matched && rc == DB_NOTFOUND ) { /* always return EntryInfo */ if ( ei->bei_parent ) { ei = ei->bei_parent; rc2 = bdb_cache_find_id( op, tid, ei->bei_id, &ei, 1, locker, lock ); if ( rc2 ) rc = rc2; } *e = ei; } } return rc; }