/*
* The contents of this file are subject to the terms of the Common Development and
* Distribution License (the License). You may not use this file except in compliance with the
* License.
*
* You can obtain a copy of the License at legal/CDDLv1.0.txt. See the License for the
* specific language governing permission and limitations under the License.
*
* When distributing Covered Software, include this CDDL Header Notice in each file and include
* the License file at legal/CDDLv1.0.txt. If applicable, add the following below the CDDL
* Header, with the fields enclosed by brackets [] replaced by your own identifying
* information: "Portions Copyright [year] [name of copyright owner]".
*
* Copyright 2006-2008 Sun Microsystems, Inc.
* Portions Copyright 2014-2016 ForgeRock AS.
*/
package org.opends.server.backends.pluggable;
import static org.opends.server.backends.pluggable.EntryIDSet.*;
import java.util.Map;
import java.util.Map.Entry;
import java.util.SortedMap;
import java.util.TreeMap;
import java.util.TreeSet;
import org.forgerock.opendj.ldap.ByteString;
import org.forgerock.util.Reject;
import org.opends.server.backends.pluggable.spi.StorageRuntimeException;
import org.opends.server.backends.pluggable.spi.WriteableTransaction;
import org.opends.server.types.DirectoryException;
/**
* A buffered index is used to buffer multiple reads or writes to the
* same index key into a single read or write.
*
* It can only be used to buffer multiple reads and writes under
* the same transaction. The transaction may be null if it is known
* that there are no other concurrent updates to the index.
*/
class IndexBuffer
{
/** Internal interface for IndexBuffer implementor. */
private interface IndexBufferImplementor
{
void flush(WriteableTransaction txn) throws StorageRuntimeException, DirectoryException;
void writeTrustState(WriteableTransaction txn) throws StorageRuntimeException;
void put(DefaultIndex index, ByteString key, EntryID entryID);
void put(VLVIndex index, ByteString sortKey);
void remove(VLVIndex index, ByteString sortKey);
void remove(Index index, ByteString key, EntryID entryID);
void reset();
}
/**
* A buffered index is used to buffer multiple reads or writes to the same index key into a single read or write.
*
* It can only be used to buffer multiple reads and writes under the same transaction. The transaction may be null if
* it is known that there are no other concurrent updates to the index.
*/
private static final class DefaultIndexBuffer implements IndexBufferImplementor
{
/**
* The buffered records stored as a map from the record key to the buffered value for that key for each index.
*
* The map is sorted by {@link TreeName}s to establish a deterministic iteration order (see {@link AbstractTree}).
* This prevents potential deadlock for db having pessimistic lock strategy (e.g.: JE).
*/
private final SortedMap> bufferedIndexes = new TreeMap<>();
/**
* The buffered records stored as a set of buffered VLV values for each index.
*
* The map is sorted by {@link TreeName}s to establish a deterministic iteration order (see {@link AbstractTree}).
* This prevents potential deadlock for db having pessimistic lock strategy (e.g.: JE).
*/
private final SortedMap bufferedVLVIndexes = new TreeMap<>();
/**
* A simple class representing a pair of added and deleted indexed IDs. Initially both addedIDs and deletedIDs are
* {@code null} indicating that that the whole record should be deleted.
*/
private static class BufferedIndexValues
{
private EntryIDSet addedEntryIDs;
private EntryIDSet deletedEntryIDs;
void addEntryID(EntryID entryID)
{
if (!remove(deletedEntryIDs, entryID))
{
if (this.addedEntryIDs == null)
{
this.addedEntryIDs = newDefinedSet();
}
this.addedEntryIDs.add(entryID);
}
}
void deleteEntryID(EntryID entryID)
{
if (!remove(addedEntryIDs, entryID))
{
if (this.deletedEntryIDs == null)
{
this.deletedEntryIDs = newDefinedSet();
}
this.deletedEntryIDs.add(entryID);
}
}
private static boolean remove(EntryIDSet entryIDs, EntryID entryID)
{
return entryIDs != null ? entryIDs.remove(entryID) : false;
}
}
/** A simple class representing a pair of added and deleted VLV values. */
private static class BufferedVLVIndexValues
{
private TreeSet addedSortKeys;
private TreeSet deletedSortKeys;
void addSortKey(ByteString sortKey)
{
if (!remove(deletedSortKeys, sortKey))
{
if (addedSortKeys == null)
{
addedSortKeys = new TreeSet<>();
}
addedSortKeys.add(sortKey);
}
}
void deleteSortKey(ByteString sortKey)
{
if (!remove(addedSortKeys, sortKey))
{
if (deletedSortKeys == null)
{
deletedSortKeys = new TreeSet<>();
}
deletedSortKeys.add(sortKey);
}
}
private static boolean remove(TreeSet sortKeys, ByteString sortKey)
{
return sortKeys != null ? sortKeys.remove(sortKey) : false;
}
}
private BufferedVLVIndexValues createOrGetBufferedVLVIndexValues(VLVIndex vlvIndex)
{
BufferedVLVIndexValues bufferedValues = bufferedVLVIndexes.get(vlvIndex);
if (bufferedValues == null)
{
bufferedValues = new BufferedVLVIndexValues();
bufferedVLVIndexes.put(vlvIndex, bufferedValues);
}
return bufferedValues;
}
private BufferedIndexValues createOrGetBufferedIndexValues(Index index, ByteString keyBytes)
{
Map bufferedOperations = createOrGetBufferedOperations(index);
BufferedIndexValues values = bufferedOperations.get(keyBytes);
if (values == null)
{
values = new BufferedIndexValues();
bufferedOperations.put(keyBytes, values);
}
return values;
}
private Map createOrGetBufferedOperations(Index index)
{
SortedMap bufferedOperations = bufferedIndexes.get(index);
if (bufferedOperations == null)
{
bufferedOperations = new TreeMap<>();
bufferedIndexes.put(index, bufferedOperations);
}
return bufferedOperations;
}
@Override
public void flush(WriteableTransaction txn) throws StorageRuntimeException, DirectoryException
{
// Indexes are stored in sorted map to prevent deadlock during flush with DB using pessimistic lock strategies.
for (Entry> entry : bufferedIndexes.entrySet())
{
flushIndex(entry.getKey(), txn, entry.getValue());
}
for (Entry entry : bufferedVLVIndexes.entrySet())
{
entry.getKey().updateIndex(txn, entry.getValue().addedSortKeys, entry.getValue().deletedSortKeys);
}
}
@Override
public void writeTrustState(WriteableTransaction txn)
{
// Indexes cache the index trust flag. Ensure that the cached value is written into the db.
for (Index index : bufferedIndexes.keySet())
{
index.setTrusted(txn, index.isTrusted());
}
for (VLVIndex index : bufferedVLVIndexes.keySet())
{
index.setTrusted(txn, index.isTrusted());
}
}
@Override
public void put(DefaultIndex index, ByteString key, EntryID entryID)
{
createOrGetBufferedIndexValues(index, key).addEntryID(entryID);
}
@Override
public void put(VLVIndex index, ByteString sortKey)
{
createOrGetBufferedVLVIndexValues(index).addSortKey(sortKey);
}
@Override
public void remove(VLVIndex index, ByteString sortKey)
{
createOrGetBufferedVLVIndexValues(index).deleteSortKey(sortKey);
}
@Override
public void remove(Index index, ByteString key, EntryID entryID)
{
createOrGetBufferedIndexValues(index, key).deleteEntryID(entryID);
}
private static void flushIndex(Index index, WriteableTransaction txn,
Map bufferedValues)
{
for (Entry entry : bufferedValues.entrySet())
{
final BufferedIndexValues values = entry.getValue();
index.update(txn, entry.getKey(), values.deletedEntryIDs, values.addedEntryIDs);
}
}
@Override
public void reset()
{
bufferedIndexes.clear();
bufferedVLVIndexes.clear();
}
}
/**
* IndexBuffer used during import which actually doesn't buffer modifications but forward those directly to the
* supplied {@link WriteableTransaction}.
*/
private static final class ImportIndexBuffer implements IndexBufferImplementor
{
private final WriteableTransaction txn;
private final EntryID expectedEntryID;
ImportIndexBuffer(WriteableTransaction txn, EntryID expectedEntryID)
{
this.txn = txn;
this.expectedEntryID = expectedEntryID;
}
@Override
public void put(DefaultIndex index, ByteString key, EntryID entryID)
{
Reject.ifFalse(this.expectedEntryID.equals(entryID), "Unexpected entryID");
txn.put(index.getName(), key, index.importToValue(entryID));
}
@Override
public void put(VLVIndex index, ByteString sortKey)
{
txn.put(index.getName(), sortKey, index.toValue());
}
@Override
public void flush(WriteableTransaction txn) throws StorageRuntimeException, DirectoryException
{
// Nothing to do
}
@Override
public void writeTrustState(WriteableTransaction txn)
{
// Nothing to do
}
@Override
public void remove(VLVIndex index, ByteString sortKey)
{
throw new UnsupportedOperationException();
}
@Override
public void remove(Index index, ByteString key, EntryID entryID)
{
throw new UnsupportedOperationException();
}
@Override
public void reset()
{
throw new UnsupportedOperationException();
}
}
private final IndexBufferImplementor impl;
static IndexBuffer newImportIndexBuffer(WriteableTransaction txn, EntryID entryID)
{
return new IndexBuffer(new ImportIndexBuffer(txn, entryID));
}
public IndexBuffer()
{
this(new DefaultIndexBuffer());
}
private IndexBuffer(IndexBufferImplementor impl)
{
this.impl = impl;
}
/**
* Flush the buffered index changes to storage.
*
* @param txn
* a non null transaction
* @throws StorageRuntimeException
* If an error occurs in the storage.
* @throws DirectoryException
* If a Directory Server error occurs.
*/
void flush(WriteableTransaction txn) throws StorageRuntimeException, DirectoryException
{
impl.flush(txn);
}
/**
* Indexes might cache their trust state. This ensure that the cached state is persisted into the database.
*
* @param txn
* a non null transaction
* @throws StorageRuntimeException
* If an error occurs in the storage.
*/
void writeTrustState(WriteableTransaction txn)
{
impl.writeTrustState(txn);
}
void put(DefaultIndex index, ByteString key, EntryID entryID)
{
impl.put(index, key, entryID);
}
void put(VLVIndex index, ByteString sortKey)
{
impl.put(index, sortKey);
}
void remove(VLVIndex index, ByteString sortKey)
{
impl.remove(index, sortKey);
}
void remove(Index index, ByteString key, EntryID entryID)
{
impl.remove(index, key, entryID);
}
void reset()
{
impl.reset();
}
}