AttrInfoMultiple.java revision 6dc163f291f94184689cdf2e9bee29ad35346d1a
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License, Version 1.0 only
* (the "License"). You may not use this file except in compliance
* with the License.
*
* You can obtain a copy of the license at
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at
* trunk/opends/resource/legal-notices/OpenDS.LICENSE. If applicable,
* add the following below this CDDL HEADER, with the fields enclosed
* by brackets "[]" replaced with your own identifying information:
* Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*
*
* Portions Copyright 2006-2007 Sun Microsystems, Inc.
*/
/**
* This classes is used to store historical information for multiple valued
* attributes.
* One object of this type is created for each attribute that was changed in
* the entry.
* It allows to record the last time a given value was added, the last
* time a given value was deleted and the last time the whole attribute was
* deleted.
*/
public class AttrInfoMultiple extends AttributeInfo
{
lastUpdateTime; // last time the attribute was modified
// given values
/**
* create a new AttrInfo object.
* @param deleteTime the deletion time
* @param updateTime the update time
* @param valuesInfo of Value Info
*/
{
this.deleteTime = deleteTime;
this.lastUpdateTime = updateTime;
if (valuesInfo == null)
else
this.valuesInfo = valuesInfo;
}
/**
* create a new empty AttrInfo object.
*/
public AttrInfoMultiple()
{
this.deleteTime = null;
this.lastUpdateTime = null;
}
/**
* Returns the last time when the entry was updated.
* @return the last time when the entry was updated
*/
private ChangeNumber getLastUpdateTime()
{
return lastUpdateTime;
}
/**
* Returns the last time when the attribute was deleted.
*
* @return the last time when the attribute was deleted
*/
public ChangeNumber getDeleteTime()
{
return deleteTime;
}
/**
* Duplicate an AttrInfo.
* ChangeNumber are duplicated by references
* @return the duplicated AttrInfo
*/
{
this.valuesInfo);
return dup;
}
/**
* Delete all historical information that is older than
* the provided ChangeNumber for this attribute type.
* Add the delete attribute state information
* @param CN time when the delete was done
*/
{
// iterate through the values in the valuesInfo
// and suppress all the values that have not been added
// after the date of this delete.
{
}
{
deleteTime = CN;
}
{
lastUpdateTime = CN;
}
}
/**
* Change historical information after a delete value.
* @param val value that was deleted
* @param CN time when the delete was done
*/
{
{
lastUpdateTime = CN;
}
}
/**
* Change historical information after a delete of a set of values.
*
* @param values values that were deleted
* @param CN time when the delete was done
*/
{
{
{
lastUpdateTime = CN;
}
}
}
/**
* Update the historical information when a value is added.
*
* @param val values that was added
* @param CN time when the value was added
*/
{
{
lastUpdateTime = CN;
}
}
/**
* Update the historical information when values are added.
*
* @param values the set of added values
* @param CN time when the add is done
*/
{
{
{
lastUpdateTime = CN;
}
}
}
/**
* Get the List of ValueInfo for this attribute Info.
*
* @return the List of ValueInfo
*/
{
return valuesInfo;
}
/**
* {@inheritDoc}
*/
public boolean replayOperation(
{
// We are replaying an operation that was already done
// on another master server and this operation has a potential
// conflict
// with some more recent operations on this same entry
// we need to take the more complex path to solve them
{
// the attribute was modified after this change -> conflict
switch (m.getModificationType())
{
case DELETE:
{
/* this delete is already obsoleted by a more recent delete
* skip this mod
*/
break;
}
break;
case ADD:
break;
case REPLACE:
{
/* this replace is already obsoleted by a more recent delete
* skip this mod
*/
break;
}
/* save the values that are added by the replace operation
* into addedValues
* first process the replace as a delete operation -> this generate
* a list of values that should be kept
* then process the addedValues as if they were coming from a add
* -> this generate the list of values that needs to be added
* concatenate the 2 generated lists into a replace
*/
modAttr.getOptions());
break;
case INCREMENT:
// TODO : FILL ME
break;
}
return true;
}
else
{
return false;// the attribute was not modified more recently
}
}
/**
* This method calculate the historical information and update the hist
* attribute to store the historical information for modify operation that
* does not conflict with previous operation.
* This is the usual path and should therefore be optimized.
*
* It does not check if the operation to process is conflicting or not with
* previous operations. The caller is responsible for this.
*
* @param changeNumber The changeNumber of the operation to process
* @param mod The modify operation to process.
*/
{
/*
* The operation is either a non-conflicting operation or a local
* operation so there is no need to check the historical information
* for conflicts.
* If this is a local operation, then this code is run after
* the pre-operation phase.
* If this is a non-conflicting replicated operation, this code is run
* during the handleConflictResolution().
*/
switch (mod.getModificationType())
{
case DELETE:
{
}
else
{
}
break;
case ADD:
if (type.isSingleValue())
{
}
break;
case REPLACE:
/* TODO : can we replace specific attribute values ????? */
break;
case INCREMENT:
/* FIXME : we should update ChangeNumber */
break;
}
}
/**
* Process a delete attribute values that is conflicting with a previous
* modification.
*
* @param changeNumber The changeNumber of the currently processed change
* @param type attribute type
* @param m the modification that is being processed
* @param modifiedEntry the entry that is modified (before current mod)
* @param attrInfo the historical info associated to the entry
* @param modAttr the attribute modification
* @return false if there is nothing to do
*/
{
/*
* We are processing a conflicting DELETE modification
*
* This code is written on the assumption that conflict are
* rare. We therefore don't care much about the performance
* However since it is rarely executed this code needs to be
* as simple as possible to make sure that all paths are tested.
* In this case the most simple seem to change the DELETE
* in a REPLACE modification that keeps all values
* more recent that the DELETE.
* we are therefore going to change m into a REPLACE that will keep
* all the values that have been updated after the DELETE time
* If a value is present in the entry without any state information
* it must be removed so we simply ignore them
*/
{
/*
* We are processing a DELETE attribute modification
*/
{
{
/*
* this value has been updated after this delete, therefore
* this value must be kept
*/
}
else
{
/*
* this value is going to be deleted, remove it from historical
* information unless it is a Deleted attribute value that is
* more recent than this DELETE
*/
{
}
}
}
{
}
{
}
}
else
{
/*
* we are processing DELETE of some attribute values
*/
{
/* update historical information */
if (index != -1)
{
/* this value already exist in the historical information */
{
}
else if (oldValInfo.isUpdate())
{
deleteIt = false;
}
}
else
{
}
/* if the attribute value is not to be deleted
* or if attribute value is not present suppress it from the
* mod to make sure the delete is going to process again
*/
if (!deleteIt
{
}
}
{
}
}
return true;
}
/**
* Process a add attribute values that is conflicting with a previous
* modification.
*
* @param modsIterator iterator on the list of modification
* @param changeNumber the historical info associated to the entry
* @param addValues the values that are added
* @param options the options that are added
* @return false if operation becomes empty and must not be processed
*/
{
/* if historicalattributedelete is newer forget this mod
* else find attr value
* if does not exist
* add historicalvalueadded timestamp
* add real value in entry
* else if timestamp older and already was historicalvalueadded
* update historicalvalueadded
* else if timestamp older and was historicalvaluedeleted
* change historicalvaluedeleted into historicalvalueadded
* add value in real entry
*/
{
/* A delete has been done more recently than this add
* forget this MOD ADD
*/
return false;
}
valIterator.hasNext();)
{
if (index == -1)
{
/* this values does not exist yet
* add it in the historical information
* let the operation process normally
*/
}
else
{
if (oldValueInfo.isUpdate())
{
/* if the value is already present
* check if the updateTime must be updated
* in all cases suppress this value from the value list
* as it is already present in the entry
*/
{
}
}
else
{
/* this value is marked as a deleted value
* check if this mod is more recent the this delete
*/
{
/* this add is more recent,
* remove the old delete historical information
* and add our more recent one
* let the operation process
*/
}
else
{
/* the delete that is present in the historical information
* is more recent so it must win,
* remove this value from the list of values to add
* don't update the historical information
*/
}
}
}
}
{
}
{
}
return true;
}
/**
* {@inheritDoc}
*/
{
switch (histKey)
{
case ADD:
{
}
break;
case DEL:
{
}
break;
case REPL:
{
}
break;
case DELATTR:
break;
}
}
}