mirror of
https://github.com/Alfresco/alfresco-community-repo.git
synced 2025-06-02 17:35:18 +00:00
b209f4c073
to using SSL when needed. Restructured exports of AVM specific apis to authenticate remotely and pass the ticket with each remote service call. These required some changes to jndi-client and even to the web-client which uses the AVM remote interface within the Alfresco server. Oh, the point of this is that since I'm writing some CLTs, I might as well do them correctly; we'll need the option of security sooner rather than later. git-svn-id: https://svn.alfresco.com/repos/alfresco-enterprise/alfresco/HEAD/root@4489 c4b6b30b-aa2e-2d43-bbcb-ca4b014f7261
731 lines
28 KiB
Java
731 lines
28 KiB
Java
/*
|
|
* Copyright (C) 2006 Alfresco, Inc.
|
|
*
|
|
* Licensed under the Mozilla Public License version 1.1
|
|
* with a permitted attribution clause. You may obtain a
|
|
* copy of the License at
|
|
*
|
|
* http://www.alfresco.org/legal/license.txt
|
|
*
|
|
* Unless required by applicable law or agreed to in writing,
|
|
* software distributed under the License is distributed on an
|
|
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND,
|
|
* either express or implied. See the License for the specific
|
|
* language governing permissions and limitations under the
|
|
* License.
|
|
*/
|
|
|
|
package org.alfresco.repo.avm;
|
|
|
|
import java.util.ArrayList;
|
|
import java.util.HashMap;
|
|
import java.util.HashSet;
|
|
import java.util.List;
|
|
import java.util.Map;
|
|
import java.util.Set;
|
|
|
|
import org.alfresco.repo.domain.PropertyValue;
|
|
import org.alfresco.service.cmr.avm.AVMBadArgumentException;
|
|
import org.alfresco.service.cmr.avm.AVMNodeDescriptor;
|
|
import org.alfresco.service.cmr.avm.AVMNotFoundException;
|
|
import org.alfresco.service.cmr.avm.AVMService;
|
|
import org.alfresco.service.cmr.avm.AVMWrongTypeException;
|
|
import org.alfresco.service.cmr.avmsync.AVMDifference;
|
|
import org.alfresco.service.cmr.avmsync.AVMSyncException;
|
|
import org.alfresco.service.cmr.avmsync.AVMSyncService;
|
|
import org.alfresco.service.namespace.QName;
|
|
import org.apache.log4j.Logger;
|
|
|
|
/**
|
|
* This implements APIs that allow comparison and synchronization
|
|
* of node trees as well as cumulative operations on layers to
|
|
* support various content production models.
|
|
* @author britt
|
|
*/
|
|
public class AVMSyncServiceImpl implements AVMSyncService
|
|
{
|
|
private static Logger fgLogger = Logger.getLogger(AVMSyncServiceImpl.class);
|
|
|
|
/**
|
|
* The AVMService.
|
|
*/
|
|
private AVMService fAVMService;
|
|
|
|
/**
|
|
* The AVMRepository.
|
|
*/
|
|
private AVMRepository fAVMRepository;
|
|
|
|
/**
|
|
* Do nothing constructor.
|
|
*/
|
|
public AVMSyncServiceImpl()
|
|
{
|
|
}
|
|
|
|
/**
|
|
* Set the AVM Service. For Spring.
|
|
* @param avmService The AVMService reference.
|
|
*/
|
|
public void setAvmService(AVMService avmService)
|
|
{
|
|
fAVMService = avmService;
|
|
}
|
|
|
|
public void setAvmRepository(AVMRepository avmRepository)
|
|
{
|
|
fAVMRepository = avmRepository;
|
|
}
|
|
|
|
/**
|
|
* Get a difference list between two corresponding node trees.
|
|
* @param srcVersion The version id for the source tree.
|
|
* @param srcPath The avm path to the source tree.
|
|
* @param dstVersion The version id for the destination tree.
|
|
* @param dstPath The avm path to the destination tree.
|
|
* @return A List of AVMDifference structs which can be used for
|
|
* the update operation.
|
|
*/
|
|
public List<AVMDifference> compare(int srcVersion, String srcPath,
|
|
int dstVersion, String dstPath)
|
|
{
|
|
if (srcPath == null || dstPath == null)
|
|
{
|
|
throw new AVMBadArgumentException("Illegal null path.");
|
|
}
|
|
List<AVMDifference> result = new ArrayList<AVMDifference>();
|
|
AVMNodeDescriptor srcDesc = fAVMService.lookup(srcVersion, srcPath, true);
|
|
if (srcDesc == null)
|
|
{
|
|
throw new AVMSyncException("Source not found: " + srcPath);
|
|
}
|
|
AVMNodeDescriptor dstDesc = fAVMService.lookup(dstVersion, dstPath, true);
|
|
if (dstDesc == null)
|
|
{
|
|
// Special case: no pre-existing version in the destination.
|
|
result.add(new AVMDifference(srcVersion, srcPath,
|
|
dstVersion, dstPath,
|
|
AVMDifference.NEWER));
|
|
}
|
|
else
|
|
{
|
|
// Invoke the recursive implementation.
|
|
compare(srcVersion, srcDesc, dstVersion, dstDesc, result);
|
|
}
|
|
return result;
|
|
}
|
|
|
|
/**
|
|
* Internal recursive implementation of compare.
|
|
* @param srcVersion The version of the source tree.
|
|
* @param srcDesc The current source descriptor.
|
|
* @param dstVersion The version of the destination tree.
|
|
* @param dstDesc The current dstDesc
|
|
*/
|
|
private void compare(int srcVersion, AVMNodeDescriptor srcDesc,
|
|
int dstVersion, AVMNodeDescriptor dstDesc,
|
|
List<AVMDifference> result)
|
|
{
|
|
// Determine how the source and destination nodes differ.
|
|
int diffCode = compareOne(srcDesc, dstDesc);
|
|
switch (diffCode)
|
|
{
|
|
case AVMDifference.SAME :
|
|
{
|
|
// A big short circuit.
|
|
return;
|
|
}
|
|
// The trivial to handle cases.
|
|
case AVMDifference.NEWER :
|
|
case AVMDifference.OLDER :
|
|
case AVMDifference.CONFLICT :
|
|
{
|
|
result.add(new AVMDifference(srcVersion, srcDesc.getPath(),
|
|
dstVersion, dstDesc.getPath(),
|
|
diffCode));
|
|
return;
|
|
}
|
|
case AVMDifference.DIRECTORY :
|
|
{
|
|
// First special case: source is a layered directory which points to
|
|
// the destinations path, and we are comparing 'head' versions.
|
|
if (srcDesc.isLayeredDirectory() &&
|
|
srcDesc.getIndirection().equals(dstDesc.getPath()) && srcVersion < 0 && dstVersion < 0)
|
|
{
|
|
// Get only a direct listing, since that's all that can be different.
|
|
Map<String, AVMNodeDescriptor> srcList =
|
|
fAVMService.getDirectoryListingDirect(srcDesc, true);
|
|
// The biggest shortcut: if the source directory is directly empty
|
|
// then we're done.
|
|
if (srcList.size() == 0)
|
|
{
|
|
return;
|
|
}
|
|
// We grab a complete listing of the destination.
|
|
Map<String, AVMNodeDescriptor> dstList =
|
|
fAVMService.getDirectoryListing(dstDesc, true);
|
|
for (String name : srcList.keySet())
|
|
{
|
|
AVMNodeDescriptor srcChild = srcList.get(name);
|
|
AVMNodeDescriptor dstChild = dstList.get(name);
|
|
if (dstChild == null)
|
|
{
|
|
// A missing destination child means the source is NEWER.
|
|
result.add(new AVMDifference(srcVersion, srcChild.getPath(),
|
|
dstVersion,
|
|
AVMNodeConverter.ExtendAVMPath(dstDesc.getPath(), name),
|
|
AVMDifference.NEWER));
|
|
continue;
|
|
}
|
|
// Otherwise recursively invoke.
|
|
compare(srcVersion, srcChild,
|
|
dstVersion, dstChild,
|
|
result);
|
|
}
|
|
return;
|
|
}
|
|
// Second special case. Just as above but reversed.
|
|
if (dstDesc.isLayeredDirectory() &&
|
|
dstDesc.getIndirection().equals(srcDesc.getPath()) && srcVersion < 0 && dstVersion < 0)
|
|
{
|
|
// Get direct content of destination.
|
|
Map<String, AVMNodeDescriptor> dstList =
|
|
fAVMService.getDirectoryListingDirect(dstDesc, true);
|
|
// Big short circuit.
|
|
if (dstList.size() == 0)
|
|
{
|
|
return;
|
|
}
|
|
// Get the source listing.
|
|
Map<String, AVMNodeDescriptor> srcList =
|
|
fAVMService.getDirectoryListing(srcDesc, true);
|
|
for (String name : dstList.keySet())
|
|
{
|
|
AVMNodeDescriptor dstChild = dstList.get(name);
|
|
AVMNodeDescriptor srcChild = srcList.get(name);
|
|
if (srcChild == null)
|
|
{
|
|
// Missing means the source is older.
|
|
result.add(new AVMDifference(srcVersion,
|
|
AVMNodeConverter.ExtendAVMPath(srcDesc.getPath(), name),
|
|
dstVersion, dstChild.getPath(),
|
|
AVMDifference.OLDER));
|
|
continue;
|
|
}
|
|
// Otherwise, recursively invoke.
|
|
compare(srcVersion, srcChild,
|
|
dstVersion, dstChild,
|
|
result);
|
|
}
|
|
return;
|
|
}
|
|
// Neither of the special cases apply, so brute force is the only answer.
|
|
Map<String, AVMNodeDescriptor> srcList =
|
|
fAVMService.getDirectoryListing(srcDesc, true);
|
|
Map<String, AVMNodeDescriptor> dstList =
|
|
fAVMService.getDirectoryListing(dstDesc, true);
|
|
// Iterate over the source.
|
|
for (String name : srcList.keySet())
|
|
{
|
|
AVMNodeDescriptor srcChild = srcList.get(name);
|
|
AVMNodeDescriptor dstChild = dstList.get(name);
|
|
if (dstChild == null)
|
|
{
|
|
// Not found in the destination means NEWER.
|
|
result.add(new AVMDifference(srcVersion, srcChild.getPath(),
|
|
dstVersion,
|
|
AVMNodeConverter.ExtendAVMPath(dstDesc.getPath(), name),
|
|
AVMDifference.NEWER));
|
|
continue;
|
|
}
|
|
// Otherwise recursive invocation.
|
|
compare(srcVersion, srcChild,
|
|
dstVersion, dstChild,
|
|
result);
|
|
}
|
|
// Iterate over the destination.
|
|
for (String name : dstList.keySet())
|
|
{
|
|
if (srcList.containsKey(name))
|
|
{
|
|
continue;
|
|
}
|
|
AVMNodeDescriptor dstChild = dstList.get(name);
|
|
// An entry not found in the source is OLDER.
|
|
result.add(new AVMDifference(srcVersion,
|
|
AVMNodeConverter.ExtendAVMPath(srcDesc.getPath(), name),
|
|
dstVersion, dstChild.getPath(),
|
|
AVMDifference.OLDER));
|
|
}
|
|
break;
|
|
}
|
|
default :
|
|
{
|
|
throw new AVMSyncException("Invalid Difference Code, Internal Error.");
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Updates the destination nodes in the AVMDifferences
|
|
* with the source nodes. Normally any conflicts or cases in
|
|
* which the source of an AVMDifference is older than the destination
|
|
* will cause the transaction to roll back.
|
|
* @param diffList A List of AVMDifference structs.
|
|
* @param ignoreConflicts If this is true the update will skip those
|
|
* AVMDifferences which are in conflict with
|
|
* the destination.
|
|
* @param ignoreOlder If this is true the update will skip those
|
|
* AVMDifferences which have the source older than the destination.
|
|
* @param overrideConflicts If this is true the update will override conflicting
|
|
* AVMDifferences and replace the destination with the conflicting source.
|
|
* @param overrideOlder If this is true the update will override AVMDifferences
|
|
* @param tag Short update blurb.
|
|
* @param description Full update blurb.
|
|
* in which the source is older than the destination and overwrite the destination.
|
|
*/
|
|
public void update(List<AVMDifference> diffList, boolean ignoreConflicts, boolean ignoreOlder,
|
|
boolean overrideConflicts, boolean overrideOlder, String tag, String description)
|
|
{
|
|
Map<String, Integer> storeVersions = new HashMap<String, Integer>();
|
|
Set<String> destStores = new HashSet<String>();
|
|
for (AVMDifference diff : diffList)
|
|
{
|
|
if (!diff.isValid())
|
|
{
|
|
throw new AVMSyncException("Malformed AVMDifference.");
|
|
}
|
|
// Snapshot the source if needed.
|
|
int version = diff.getSourceVersion();
|
|
if (version < 0)
|
|
{
|
|
int colonOff = diff.getSourcePath().indexOf(':');
|
|
if (colonOff == -1)
|
|
{
|
|
throw new AVMBadArgumentException("Invalid path.");
|
|
}
|
|
String storeName = diff.getSourcePath().substring(0, colonOff);
|
|
if (storeVersions.containsKey(storeName))
|
|
{
|
|
// We've already snapshotted this store.
|
|
version = storeVersions.get(storeName);
|
|
}
|
|
else
|
|
{
|
|
version = fAVMService.createSnapshot(storeName, "Snapshotted for submit.", null);
|
|
}
|
|
}
|
|
AVMNodeDescriptor srcDesc = fAVMService.lookup(version,
|
|
diff.getSourcePath(), true);
|
|
// if (srcDesc == null)
|
|
// {
|
|
// throw new AVMSyncException("Source node not found: " + diff.getSourcePath());
|
|
// }
|
|
String [] dstParts = AVMNodeConverter.SplitBase(diff.getDestinationPath());
|
|
if (dstParts[0] == null || diff.getDestinationVersion() >= 0)
|
|
{
|
|
// You can't have a root node as a destination.
|
|
throw new AVMSyncException("Invalid destination node: " + diff.getDestinationPath());
|
|
}
|
|
AVMNodeDescriptor dstDesc = fAVMService.lookup(-1, diff.getDestinationPath(), true);
|
|
// The default is that the source is newer in the case where
|
|
// the destination doesn't exist.
|
|
int diffCode = AVMDifference.NEWER;
|
|
if (dstDesc != null)
|
|
{
|
|
diffCode = compareOne(srcDesc, dstDesc);
|
|
}
|
|
// Keep track of stores updated so that they can all be snapshotted
|
|
// at end of update.
|
|
String dstPath = diff.getDestinationPath();
|
|
destStores.add(dstPath.substring(0, dstPath.indexOf(':')));
|
|
// Dispatch.
|
|
switch (diffCode)
|
|
{
|
|
case AVMDifference.SAME :
|
|
{
|
|
// Nada to do.
|
|
continue;
|
|
}
|
|
case AVMDifference.NEWER :
|
|
{
|
|
// You can't delete what isn't there.
|
|
linkIn(dstParts[0], dstParts[1], srcDesc, dstDesc != null);
|
|
continue;
|
|
}
|
|
case AVMDifference.OLDER :
|
|
{
|
|
// You can force it.
|
|
if (overrideOlder)
|
|
{
|
|
linkIn(dstParts[0], dstParts[1], srcDesc, !dstDesc.isDeleted());
|
|
continue;
|
|
}
|
|
// You can ignore it.
|
|
if (ignoreOlder)
|
|
{
|
|
continue;
|
|
}
|
|
// Or it's an error.
|
|
throw new AVMSyncException("Older version prevents update.");
|
|
}
|
|
case AVMDifference.CONFLICT :
|
|
{
|
|
// You can force it.
|
|
if (overrideConflicts)
|
|
{
|
|
linkIn(dstParts[0], dstParts[1], srcDesc, true);
|
|
continue;
|
|
}
|
|
// You can ignore it.
|
|
if (ignoreConflicts)
|
|
{
|
|
continue;
|
|
}
|
|
// Or it's an error.
|
|
throw new AVMSyncException("Conflict prevents update.");
|
|
}
|
|
case AVMDifference.DIRECTORY :
|
|
{
|
|
// You can only ignore this.
|
|
if (ignoreConflicts)
|
|
{
|
|
continue;
|
|
}
|
|
// Otherwise it's an error.
|
|
throw new AVMSyncException("Directory conflict prevents update.");
|
|
}
|
|
default :
|
|
{
|
|
throw new AVMSyncException("Invalid Difference Code: Internal Error.");
|
|
}
|
|
}
|
|
}
|
|
for (String storeName : destStores)
|
|
{
|
|
fAVMService.createSnapshot(storeName, tag, description);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Do the actual work of connecting nodes to the destination tree.
|
|
* @param parentPath The parent path the node will go in.
|
|
* @param name The name it will have.
|
|
* @param toLink The node descriptor.
|
|
* @param removeFirst Whether to do a removeNode before linking in.
|
|
*/
|
|
private void linkIn(String parentPath, String name, AVMNodeDescriptor toLink, boolean removeFirst)
|
|
{
|
|
// This is a delete.
|
|
if (toLink == null)
|
|
{
|
|
fAVMService.removeNode(parentPath, name);
|
|
return;
|
|
}
|
|
mkdirs(parentPath, AVMNodeConverter.SplitBase(toLink.getPath())[0]);
|
|
if (removeFirst)
|
|
{
|
|
fAVMService.removeNode(parentPath, name);
|
|
}
|
|
if (toLink.isLayeredDirectory() && !toLink.isPrimary())
|
|
{
|
|
recursiveCopy(parentPath, name, toLink);
|
|
return;
|
|
}
|
|
fAVMService.link(parentPath, name, toLink);
|
|
}
|
|
|
|
/**
|
|
* Recursively copy a node into the given position.
|
|
* @param parentPath The place to put it.
|
|
* @param name The name to give it.
|
|
* @param toCopy The it to put.
|
|
*/
|
|
private void recursiveCopy(String parentPath, String name, AVMNodeDescriptor toCopy)
|
|
{
|
|
fAVMService.createDirectory(parentPath, name);
|
|
String newParentPath = AVMNodeConverter.ExtendAVMPath(parentPath, name);
|
|
fAVMService.setMetaDataFrom(newParentPath, toCopy);
|
|
AVMNodeDescriptor parentDesc = fAVMService.lookup(-1, newParentPath, true);
|
|
Map<String, AVMNodeDescriptor> children =
|
|
fAVMService.getDirectoryListing(toCopy, true);
|
|
for (Map.Entry<String, AVMNodeDescriptor> entry : children.entrySet())
|
|
{
|
|
recursiveCopy(parentDesc, entry.getKey(), entry.getValue());
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Shortcutting helper that uses an AVMNodeDescriptor parent.
|
|
* @param parent The parent we are linking into.
|
|
* @param name The name to link in.
|
|
* @param toCopy The node to link in.
|
|
*/
|
|
private void recursiveCopy(AVMNodeDescriptor parent, String name, AVMNodeDescriptor toCopy)
|
|
{
|
|
// If it's a file or deleted simply link it in.
|
|
if (toCopy.isFile() || toCopy.isDeleted() || toCopy.isPlainDirectory())
|
|
{
|
|
fAVMRepository.link(parent, name, toCopy);
|
|
return;
|
|
}
|
|
// Otherwise make a directory in the target parent, and recursiveCopy all the source
|
|
// children into it.
|
|
AVMNodeDescriptor newParentDesc = fAVMRepository.createDirectory(parent, name);
|
|
fAVMService.setMetaDataFrom(newParentDesc.getPath(), toCopy);
|
|
Map<String, AVMNodeDescriptor> children =
|
|
fAVMService.getDirectoryListing(toCopy, true);
|
|
for (Map.Entry<String, AVMNodeDescriptor> entry : children.entrySet())
|
|
{
|
|
recursiveCopy(newParentDesc, entry.getKey(), entry.getValue());
|
|
}
|
|
}
|
|
|
|
/**
|
|
* The workhorse of comparison and updating. Determine the versioning relationship
|
|
* of two nodes.
|
|
* @param srcDesc Descriptor for the source node.
|
|
* @param dstDesc Descriptor for the destination node.
|
|
* @return One of SAME, OLDER, NEWER, CONFLICT, DIRECTORY
|
|
*/
|
|
private int compareOne(AVMNodeDescriptor srcDesc, AVMNodeDescriptor dstDesc)
|
|
{
|
|
if (srcDesc == null)
|
|
{
|
|
return AVMDifference.OLDER;
|
|
}
|
|
if (srcDesc.getId() == dstDesc.getId())
|
|
{
|
|
return AVMDifference.SAME;
|
|
}
|
|
// Matched directories that are not identical are nominally in conflict
|
|
// but get their own special difference code for comparison logic. The DIRECTORY
|
|
// difference code never gets returned to callers of compare.
|
|
if (srcDesc.isDirectory() && dstDesc.isDirectory())
|
|
{
|
|
return AVMDifference.DIRECTORY;
|
|
}
|
|
// Check for mismatched fundamental types.
|
|
if ((srcDesc.isDirectory() && dstDesc.isFile()) ||
|
|
(srcDesc.isFile() && dstDesc.isDirectory()))
|
|
{
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
// A deleted node on either side means uniform handling because
|
|
// a deleted node can be the descendent of any other type of node.
|
|
if (srcDesc.isDeleted() || dstDesc.isDeleted())
|
|
{
|
|
AVMNodeDescriptor common = fAVMService.getCommonAncestor(srcDesc, dstDesc);
|
|
if (common == null)
|
|
{
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
if (common.getId() == srcDesc.getId())
|
|
{
|
|
return AVMDifference.OLDER;
|
|
}
|
|
if (common.getId() == dstDesc.getId())
|
|
{
|
|
return AVMDifference.NEWER;
|
|
}
|
|
// Must be a conflict.
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
// At this point both source and destination are both some kind of file.
|
|
if (srcDesc.isLayeredFile())
|
|
{
|
|
// Handle the layered file source case.
|
|
if (dstDesc.isPlainFile())
|
|
{
|
|
// We consider a layered source file that points at the destination
|
|
// file SAME.
|
|
if (srcDesc.getIndirection().equals(dstDesc.getPath()))
|
|
{
|
|
return AVMDifference.SAME;
|
|
}
|
|
// We know that they are in conflict since they are of different types.
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
// Destination is a layered file also.
|
|
AVMNodeDescriptor common = fAVMService.getCommonAncestor(srcDesc, dstDesc);
|
|
if (common == null)
|
|
{
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
if (common.getId() == srcDesc.getId())
|
|
{
|
|
return AVMDifference.OLDER;
|
|
}
|
|
if (common.getId() == dstDesc.getId())
|
|
{
|
|
return AVMDifference.NEWER;
|
|
}
|
|
// Finally we know they are in conflict.
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
// Source is a plain file.
|
|
if (dstDesc.isLayeredFile())
|
|
{
|
|
// We consider a source file that is the target of a layered destination file to be
|
|
// SAME.
|
|
if (dstDesc.getIndirection().equals(srcDesc.getPath()))
|
|
{
|
|
return AVMDifference.SAME;
|
|
}
|
|
// Otherwise we know they are in conflict because they are of different type.
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
// Destination is a plain file.
|
|
AVMNodeDescriptor common = fAVMService.getCommonAncestor(srcDesc, dstDesc);
|
|
// Conflict case.
|
|
if (common == null)
|
|
{
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
if (common.getId() == srcDesc.getId())
|
|
{
|
|
return AVMDifference.OLDER;
|
|
}
|
|
if (common.getId() == dstDesc.getId())
|
|
{
|
|
return AVMDifference.NEWER;
|
|
}
|
|
// The must, finally, be in conflict.
|
|
return AVMDifference.CONFLICT;
|
|
}
|
|
|
|
/**
|
|
* Flattens a layer so that all all nodes under and including
|
|
* <code>layerPath</code> become translucent to any nodes in the
|
|
* corresponding location under and including <code>underlyingPath</code>
|
|
* that are the same version.
|
|
* @param layerPath The overlying layer path.
|
|
* @param underlyingPath The underlying path.
|
|
*/
|
|
public void flatten(String layerPath, String underlyingPath)
|
|
{
|
|
if (layerPath == null || underlyingPath == null)
|
|
{
|
|
throw new AVMBadArgumentException("Illegal null path.");
|
|
}
|
|
AVMNodeDescriptor layerNode = fAVMService.lookup(-1, layerPath, true);
|
|
if (layerNode == null)
|
|
{
|
|
throw new AVMNotFoundException("Not found: " + layerPath);
|
|
}
|
|
AVMNodeDescriptor underlyingNode = fAVMService.lookup(-1, underlyingPath, true);
|
|
if (underlyingNode == null)
|
|
{
|
|
throw new AVMNotFoundException("Not found: " + underlyingPath);
|
|
}
|
|
flatten(layerNode, underlyingNode);
|
|
}
|
|
|
|
/**
|
|
* This is the implementation of flatten.
|
|
* @param layer The on top node.
|
|
* @param underlying The underlying node.
|
|
*/
|
|
private boolean flatten(AVMNodeDescriptor layer, AVMNodeDescriptor underlying)
|
|
{
|
|
if (!layer.isLayeredDirectory())
|
|
{
|
|
return false;
|
|
}
|
|
// layer and underlying must match for flattening to be useful.
|
|
if (!layer.getIndirection().equals(underlying.getPath()))
|
|
{
|
|
return false;
|
|
}
|
|
// The underlying thing must be a directory.
|
|
if (!underlying.isDirectory())
|
|
{
|
|
return false;
|
|
}
|
|
Map<String, AVMNodeDescriptor> layerListing =
|
|
fAVMService.getDirectoryListingDirect(-1, layer.getPath(), true);
|
|
// If the layer is empty (directly, that is) we're done.
|
|
if (layerListing.size() == 0)
|
|
{
|
|
return true;
|
|
}
|
|
// layer = fAVMService.forceCopy(layer.getPath());
|
|
// Grab the listing
|
|
Map<String, AVMNodeDescriptor> underListing =
|
|
fAVMService.getDirectoryListing(underlying, true);
|
|
boolean flattened = true;
|
|
for (String name : layerListing.keySet())
|
|
{
|
|
AVMNodeDescriptor topNode = layerListing.get(name);
|
|
AVMNodeDescriptor bottomNode = underListing.get(name);
|
|
// fgLogger.error("Trying to flatten out: " + name);
|
|
if (bottomNode == null)
|
|
{
|
|
flattened = false;
|
|
continue;
|
|
}
|
|
// We've found an identity so flatten it.
|
|
if (topNode.getId() == bottomNode.getId())
|
|
{
|
|
fAVMRepository.flatten(layer.getPath(), name);
|
|
// fgLogger.error("Identity flattened: " + name);
|
|
}
|
|
else
|
|
{
|
|
// Otherwise recursively flatten the children.
|
|
if (flatten(topNode, bottomNode))
|
|
{
|
|
fAVMRepository.flatten(layer.getPath(), name);
|
|
// fgLogger.error("Recursively flattened: " + name);
|
|
}
|
|
else
|
|
{
|
|
flattened = false;
|
|
}
|
|
}
|
|
}
|
|
return flattened;
|
|
}
|
|
|
|
/**
|
|
* Takes a layer, deletes it and recreates it pointing at the same underlying
|
|
* node. Any changes in the layer are lost (except to history if the layer has been
|
|
* snapshotted.)
|
|
* @param layerPath
|
|
*/
|
|
public void resetLayer(String layerPath)
|
|
{
|
|
AVMNodeDescriptor desc = fAVMService.lookup(-1, layerPath);
|
|
if (desc == null)
|
|
{
|
|
throw new AVMNotFoundException("Not Found: " + layerPath);
|
|
}
|
|
String [] parts = AVMNodeConverter.SplitBase(layerPath);
|
|
fAVMService.removeNode(parts[0], parts[1]);
|
|
fAVMService.createLayeredDirectory(desc.getIndirection(), parts[0], parts[1]);
|
|
}
|
|
|
|
/**
|
|
* Make sure this entire directory path exists.
|
|
* @param path
|
|
* @param sourcePath
|
|
*/
|
|
private void mkdirs(String path, String sourcePath)
|
|
{
|
|
if (fAVMService.lookup(-1, path) != null)
|
|
{
|
|
return;
|
|
}
|
|
String [] pathParts = AVMNodeConverter.SplitBase(path);
|
|
if (pathParts[0] == null)
|
|
{
|
|
// This is a root path and as such has to exist.
|
|
// Something else is going on.
|
|
throw new AVMSyncException("No corresponding destination path: " + path);
|
|
}
|
|
mkdirs(pathParts[0], AVMNodeConverter.SplitBase(sourcePath)[0]);
|
|
fAVMService.createDirectory(pathParts[0], pathParts[1]);
|
|
fAVMService.setMetaDataFrom(path, fAVMService.lookup(-1, sourcePath));
|
|
}
|
|
}
|