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
|
/** BEGIN COPYRIGHT BLOCK
* Copyright 2001 Sun Microsystems, Inc.
* Portions copyright 1999, 2001-2003 Netscape Communications Corporation.
* All rights reserved.
* END COPYRIGHT BLOCK **/
/* parents.c - where the adults live */
#include "back-ldbm.h"
char *numsubordinates = "numsubordinates";
char *hassubordinates = "hassubordinates";
/* Routine where any in-memory modification of a parent entry happens on some state-change in
one of its children. vaid op values are: 1 == child entry newly added, 2 == child entry about to be
deleted; 3 == child modified, in which case childmods points to the modifications. The child entry
passed is in the state which reflects the mods having been appied. op ==3 HAS NOT BEEN IMPLEMENTED YET
The routine is allowed to modify the parent entry, and to return a set of LDAPMods reflecting
the changes it made. The LDAPMods array must be freed by the called by calling ldap_free_mods(p,1)
*/
int parent_update_on_childchange(modify_context *mc,int op, size_t *new_sub_count )
{
int ret = 0;
int mod_op = 0;
Slapi_Attr *read_attr = NULL;
size_t current_sub_count = 0;
int already_present = 0;
if (new_sub_count)
*new_sub_count = 0;
/* Check nobody is trying to use op == 3, it's not implemented yet */
PR_ASSERT( (op == 1) || (op == 2));
/* We want to invent a mods set to be passed to modify_apply_mods() */
/* For now, we're only interested in subordinatecount.
We first examine the present value for the attribute.
If it isn't present and we're adding, we assign value 1 to the attribute and add it.
If it is present, we increment or decrement depending upon whether we're adding or deleting.
If the value after decrementing is zero, we remove it.
*/
/* Get the present value of the subcount attr, or 0 if not present */
ret = slapi_entry_attr_find(mc->old_entry->ep_entry,numsubordinates,&read_attr);
if (0 == ret) {
/* decode the value */
Slapi_Value *sval;
slapi_attr_first_value( read_attr, &sval );
if (sval!=NULL) {
const struct berval *bval = slapi_value_get_berval(sval);
if(NULL != bval) {
already_present = 1;
current_sub_count = atol(bval->bv_val);
}
}
}
/* are we adding ? */
if ( (1 == op) && !already_present) {
/* If so, and the parent entry does not already have a subcount attribute, we need to add it */
mod_op = LDAP_MOD_ADD;
} else {
if (2 == op) {
if (!already_present) {
/* This means that something is wrong---deleting a child but no subcount present on parent */
LDAPDebug( LDAP_DEBUG_ANY, "numsubordinates assertion failure\n", 0, 0, 0 );
return -1;
} else {
if (current_sub_count == 1) {
mod_op = LDAP_MOD_DELETE;
} else {
mod_op = LDAP_MOD_REPLACE;
}
}
} else {
mod_op = LDAP_MOD_REPLACE;
}
}
/* Mow compute the new value */
if (1 == op) {
current_sub_count++;
} else {
current_sub_count--;
}
{
Slapi_Mods *smods= slapi_mods_new();
if (mod_op == LDAP_MOD_DELETE)
{
slapi_mods_add(smods, mod_op | LDAP_MOD_BVALUES, numsubordinates, 0, NULL);
}
else
{
char value_buffer[20]; /* enough digits for 2^64 children */
sprintf(value_buffer,"%lu", current_sub_count);
slapi_mods_add(smods, mod_op | LDAP_MOD_BVALUES, numsubordinates, strlen(value_buffer), value_buffer);
}
ret = modify_apply_mods(mc,smods); /* smods passed in */
}
if (new_sub_count)
*new_sub_count = current_sub_count;
return ret;
}
|
