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
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
|
/** BEGIN COPYRIGHT BLOCK
* This Program is free software; you can redistribute it and/or modify it under
* the terms of the GNU General Public License as published by the Free Software
* Foundation; version 2 of the License.
*
* This Program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along with
* this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
* Place, Suite 330, Boston, MA 02111-1307 USA.
*
* In addition, as a special exception, Red Hat, Inc. gives You the additional
* right to link the code of this Program with code not covered under the GNU
* General Public License ("Non-GPL Code") and to distribute linked combinations
* including the two, subject to the limitations in this paragraph. Non-GPL Code
* permitted under this exception must only link to the code of this Program
* through those well defined interfaces identified in the file named EXCEPTION
* found in the source code files (the "Approved Interfaces"). The files of
* Non-GPL Code may instantiate templates or use macros or inline functions from
* the Approved Interfaces without causing the resulting work to be covered by
* the GNU General Public License. Only Red Hat, Inc. may make changes or
* additions to the list of Approved Interfaces. You must obey the GNU General
* Public License in all respects for all of the Program code and other code used
* in conjunction with the Program except the Non-GPL Code covered by this
* exception. If you modify this file, you may extend this exception to your
* version of the file, but you are not obligated to do so. If you do not wish to
* provide this exception without modification, you must delete this exception
* statement from your version and license this file solely under the GPL without
* exception.
*
*
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
* END COPYRIGHT BLOCK **/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
/* vlv_key.c */
#include "back-ldbm.h"
#include "vlv_key.h"
/*
* These functions manipulate keys for the virtual list view indexes.
* A key consists of a string of attribute values concatinated together,
* plus an entry DN to ensure uniqueness.
*/
struct vlv_key *
vlv_key_new()
{
struct vlv_key *p= (struct vlv_key*)slapi_ch_malloc(sizeof(struct vlv_key));
p->keymem= 64;
memset(&p->key,0,sizeof(DBT));
p->key.data= slapi_ch_malloc(p->keymem);
p->key.size= 0;
return p;
}
void
vlv_key_delete(struct vlv_key **p)
{
slapi_ch_free(&((*p)->key.data));
slapi_ch_free((void **)p);
}
#if 0
static void
vlv_key_copy(const struct vlv_key *p1,struct vlv_key *p2)
{
p2->keymem= p1->keymem;
p2->key.data= slapi_ch_realloc(p2->key.data,p2->keymem);
strcpy(p2->key.data, p1->key.data);
p2->key.size= p1->key.size;
}
#endif
/*
* Add an attribute value to the end of a composite key.
*/
void
vlv_key_addattr(struct vlv_key *p,struct berval *val)
{
/* If there isn't room then allocate some more memory */
unsigned int need = p->key.size + val->bv_len;
if(need > p->keymem)
{
p->keymem*= 2;
if(need > p->keymem)
{
p->keymem= need;
}
p->key.data= slapi_ch_realloc(p->key.data,p->keymem);
}
memcpy(((char*)p->key.data)+p->key.size, val->bv_val, val->bv_len);
p->key.size+= val->bv_len;
}
|
