blob: 83a0d5c7ae2e23ca80677d7b250ef4fa799ca458 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
|
/* addentry.c */
/* $OpenLDAP$ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
* Copyright 1998-2024 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
* <http://www.OpenLDAP.org/license.html>.
*/
/* Portions Copyright (c) 1990 Regents of the University of Michigan.
* All rights reserved.
*/
#include "portable.h"
#include <stdio.h>
#include <ac/stdlib.h>
#include <ac/socket.h>
#include <ac/string.h>
#include <ac/time.h>
#include "ldap-int.h"
LDAPMessage *
ldap_delete_result_entry( LDAPMessage **list, LDAPMessage *e )
{
LDAPMessage *tmp, *prev = NULL;
assert( list != NULL );
assert( e != NULL );
for ( tmp = *list; tmp != NULL && tmp != e; tmp = tmp->lm_chain )
prev = tmp;
if ( tmp == NULL )
return( NULL );
if ( prev == NULL ) {
if ( tmp->lm_chain )
tmp->lm_chain->lm_chain_tail = (*list)->lm_chain_tail;
*list = tmp->lm_chain;
} else {
prev->lm_chain = tmp->lm_chain;
if ( prev->lm_chain == NULL )
(*list)->lm_chain_tail = prev;
}
tmp->lm_chain = NULL;
return( tmp );
}
void
ldap_add_result_entry( LDAPMessage **list, LDAPMessage *e )
{
assert( list != NULL );
assert( e != NULL );
e->lm_chain = *list;
if ( *list )
e->lm_chain_tail = (*list)->lm_chain_tail;
else
e->lm_chain_tail = e;
*list = e;
}
|
