Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
/*
* Copyright 2008-2017 UnboundID Corp.
* All Rights Reserved.
*/
/*
* Copyright (C) 2008-2017 UnboundID Corp.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License (GPLv2 only)
* or the terms of the GNU Lesser General Public License (LGPLv2.1 only)
* as published by the Free Software Foundation.
*
* 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, see .
*/
package com.unboundid.ldap.sdk.examples;
import java.util.Random;
import java.util.concurrent.CyclicBarrier;
import java.util.concurrent.atomic.AtomicBoolean;
import java.util.concurrent.atomic.AtomicLong;
import java.util.concurrent.atomic.AtomicReference;
import com.unboundid.asn1.ASN1OctetString;
import com.unboundid.ldap.sdk.Control;
import com.unboundid.ldap.sdk.LDAPConnection;
import com.unboundid.ldap.sdk.LDAPException;
import com.unboundid.ldap.sdk.Modification;
import com.unboundid.ldap.sdk.ModificationType;
import com.unboundid.ldap.sdk.ModifyRequest;
import com.unboundid.ldap.sdk.ResultCode;
import com.unboundid.ldap.sdk.controls.ProxiedAuthorizationV2RequestControl;
import com.unboundid.util.Debug;
import com.unboundid.util.FixedRateBarrier;
import com.unboundid.util.ResultCodeCounter;
import com.unboundid.util.ValuePattern;
/**
* This class provides a thread that may be used to repeatedly perform
* modifications.
*/
final class ModRateThread
extends Thread
{
// Indicates whether a request has been made to stop running.
private final AtomicBoolean stopRequested;
// The counter used to track the number of errors encountered while
// processing modifications.
private final AtomicLong errorCounter;
// The counter used to track the number of modifications performed.
private final AtomicLong modCounter;
// The value that will be updated with total duration of the modifications.
private final AtomicLong modDurations;
// The counter used to track the number of iterations remaining on the
// current connection.
private final AtomicLong remainingIterationsBeforeReconnect;
// The result code for this thread.
private final AtomicReference resultCode;
// Indicates whether to generate increment modifications instead of replace
// modifications.
private final boolean increment;
// The set of characters to use for the generated values.
private final byte[] charSet;
// The set of request controls to include in modify requests.
private final Control[] modifyControls;
// The barrier that will be used to coordinate starting among all the threads.
private final CyclicBarrier startBarrier;
// The amount by which to increment values.
private final int incrementAmount;
// The number of values to generate.
private final int valueCount;
// The length in bytes of the values to generate.
private final int valueLength;
// The connection to use for the modifications.
private LDAPConnection connection;
// The number of iterations to request on a connection before closing and
// re-establishing it.
private final long iterationsBeforeReconnect;
// A reference to the associated modrate tool that can be used when attempting
// to establish connections.
private final ModRate modRate;
// The result code counter to use for failed operations.
private final ResultCodeCounter rcCounter;
// The random number generator to use for this thread.
private final Random random;
// The names of the attributes to modify.
private final String[] attributes;
// The thread that is actually performing the modifications.
private final AtomicReference modThread;
// The value pattern to use for proxied authorization.
private final ValuePattern authzID;
// The value pattern to use for the entry DNs.
private final ValuePattern entryDN;
// The barrier to use for controlling the rate of modifies. null if no
// rate-limiting should be used.
private final FixedRateBarrier fixedRateBarrier;
/**
* Creates a new mod rate thread with the provided information.
*
* @param modRate A reference to the associated modrate
* tool.
* @param threadNumber The thread number for this thread.
* @param connection The connection to use for the
* modifications.
* @param entryDN The value pattern to use for the entry
* DNs.
* @param attributes The names of the attributes to modify.
* @param charSet The set of characters to include in the
* generated values.
* @param valueLength The length in bytes to use for the
* generated values.
* @param valueCount The number of values to generate for
* replace modifications.
* @param increment Indicates whether to use the increment
* modification type instead of the replace
* modification type.
* @param incrementAmount The amount by which values should be
* incremented.
* @param modifyControls The set of request controls that should
* be included in modify requests.
* @param authzID The value pattern to use to generate
* authorization identities for use with
* the proxied authorization control. It
* may be {@code null} if proxied
* authorization should not be used.
* @param randomSeed The seed to use for the random number
* generator.
* @param iterationsBeforeReconnect The number of iterations that should be
* processed on a connection before it is
* closed and replaced with a
* newly-established connection.
* @param startBarrier A barrier used to coordinate starting
* between all of the threads.
* @param modCounter A value that will be used to keep track
* of the total number of modifications
* performed.
* @param modDurations A value that will be used to keep track
* of the total duration for all
* modifications.
* @param errorCounter A value that will be used to keep track
* of the number of errors encountered
* while processing.
* @param rcCounter The result code counter to use for
* keeping track of the result codes for
* failed operations.
* @param rateBarrier The barrier to use for controlling the
* rate of modifies. {@code null} if no
* rate-limiting should be used.
*/
ModRateThread(final ModRate modRate, final int threadNumber,
final LDAPConnection connection, final ValuePattern entryDN,
final String[] attributes, final byte[] charSet,
final int valueLength, final int valueCount,
final boolean increment, final int incrementAmount,
final Control[] modifyControls, final ValuePattern authzID,
final long randomSeed, final long iterationsBeforeReconnect,
final CyclicBarrier startBarrier, final AtomicLong modCounter,
final AtomicLong modDurations, final AtomicLong errorCounter,
final ResultCodeCounter rcCounter,
final FixedRateBarrier rateBarrier)
{
setName("ModRate Thread " + threadNumber);
setDaemon(true);
this.modRate = modRate;
this.connection = connection;
this.entryDN = entryDN;
this.attributes = attributes;
this.charSet = charSet;
this.valueLength = valueLength;
this.valueCount = valueCount;
this.increment = increment;
this.incrementAmount = incrementAmount;
this.modifyControls = modifyControls;
this.authzID = authzID;
this.iterationsBeforeReconnect = iterationsBeforeReconnect;
this.modCounter = modCounter;
this.modDurations = modDurations;
this.errorCounter = errorCounter;
this.rcCounter = rcCounter;
this.startBarrier = startBarrier;
fixedRateBarrier = rateBarrier;
if (iterationsBeforeReconnect > 0L)
{
remainingIterationsBeforeReconnect =
new AtomicLong(iterationsBeforeReconnect);
}
else
{
remainingIterationsBeforeReconnect = null;
}
connection.setConnectionName("mod-" + threadNumber);
resultCode = new AtomicReference(null);
modThread = new AtomicReference(null);
stopRequested = new AtomicBoolean(false);
random = new Random(randomSeed);
}
/**
* Performs all modify processing for this thread.
*/
@Override()
public void run()
{
modThread.set(currentThread());
final Modification[] mods = new Modification[attributes.length];
final byte[][] valueBytes = new byte[valueCount][valueLength];
final ASN1OctetString[] values = new ASN1OctetString[valueCount];
if (increment)
{
valueBytes[0] = String.valueOf(incrementAmount).getBytes();
values[0] = new ASN1OctetString(valueBytes[0]);
for (int i=0; i < attributes.length; i++)
{
mods[i] = new Modification(ModificationType.INCREMENT, attributes[i],
values);
}
}
final ModifyRequest modifyRequest = new ModifyRequest("", mods);
try
{
startBarrier.await();
}
catch (Exception e)
{
Debug.debugException(e);
}
while (! stopRequested.get())
{
if ((iterationsBeforeReconnect > 0L) &&
(remainingIterationsBeforeReconnect.decrementAndGet() <= 0))
{
remainingIterationsBeforeReconnect.set(iterationsBeforeReconnect);
if (connection != null)
{
connection.close();
connection = null;
}
}
if (connection == null)
{
try
{
connection = modRate.getConnection();
}
catch (final LDAPException le)
{
Debug.debugException(le);
errorCounter.incrementAndGet();
final ResultCode rc = le.getResultCode();
rcCounter.increment(rc);
resultCode.compareAndSet(null, rc);
if (fixedRateBarrier != null)
{
fixedRateBarrier.await();
}
continue;
}
}
modifyRequest.setDN(entryDN.nextValue());
if (! increment)
{
for (int i=0; i < valueCount; i++)
{
for (int j=0; j < valueLength; j++)
{
valueBytes[i][j] = charSet[random.nextInt(charSet.length)];
}
values[i] = new ASN1OctetString(valueBytes[i]);
}
for (int i=0; i < attributes.length; i++)
{
mods[i] = new Modification(ModificationType.REPLACE, attributes[i],
values);
}
modifyRequest.setModifications(mods);
}
modifyRequest.setControls(modifyControls);
if (authzID != null)
{
modifyRequest.addControl(new ProxiedAuthorizationV2RequestControl(
authzID.nextValue()));
}
// If we're trying for a specific target rate, then we might need to
// wait until issuing the next modify.
if (fixedRateBarrier != null)
{
fixedRateBarrier.await();
}
final long startTime = System.nanoTime();
try
{
connection.modify(modifyRequest);
}
catch (LDAPException le)
{
Debug.debugException(le);
errorCounter.incrementAndGet();
final ResultCode rc = le.getResultCode();
rcCounter.increment(rc);
resultCode.compareAndSet(null, rc);
if (! le.getResultCode().isConnectionUsable())
{
connection.close();
connection = null;
}
}
modCounter.incrementAndGet();
modDurations.addAndGet(System.nanoTime() - startTime);
}
if (connection != null)
{
connection.close();
}
modThread.set(null);
}
/**
* Indicates that this thread should stop running.
*
* @return A result code that provides information about whether any errors
* were encountered during processing.
*/
public ResultCode stopRunning()
{
stopRequested.set(true);
if (fixedRateBarrier != null)
{
fixedRateBarrier.shutdownRequested();
}
final Thread t = modThread.get();
if (t != null)
{
try
{
t.join();
}
catch (Exception e)
{
Debug.debugException(e);
if (e instanceof InterruptedException)
{
Thread.currentThread().interrupt();
}
}
}
resultCode.compareAndSet(null, ResultCode.SUCCESS);
return resultCode.get();
}
}
