HDFS-4995. Make getContentSummary less expensive. Contributed by Kihwal Lee.
git-svn-id: https://svn.apache.org/repos/asf/hadoop/common/trunk@1541971 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
bd5b23f4ce
commit
fe67e30bc2
|
@ -489,6 +489,8 @@ Release 2.3.0 - UNRELEASED
|
|||
|
||||
HDFS-5487. Introduce unit test for TokenAspect. (Haohui Mai via jing9)
|
||||
|
||||
HDFS-4995. Make getContentSummary less expensive. (kihwal)
|
||||
|
||||
OPTIMIZATIONS
|
||||
|
||||
HDFS-5239. Allow FSNamesystem lock fairness to be configurable (daryn)
|
||||
|
|
|
@ -198,6 +198,8 @@ public class DFSConfigKeys extends CommonConfigurationKeys {
|
|||
|
||||
public static final String DFS_LIST_LIMIT = "dfs.ls.limit";
|
||||
public static final int DFS_LIST_LIMIT_DEFAULT = 1000;
|
||||
public static final String DFS_CONTENT_SUMMARY_LIMIT_KEY = "dfs.content-summary.limit";
|
||||
public static final int DFS_CONTENT_SUMMARY_LIMIT_DEFAULT = 0;
|
||||
public static final String DFS_DATANODE_FAILED_VOLUMES_TOLERATED_KEY = "dfs.datanode.failed.volumes.tolerated";
|
||||
public static final int DFS_DATANODE_FAILED_VOLUMES_TOLERATED_DEFAULT = 0;
|
||||
public static final String DFS_DATANODE_SYNCONCLOSE_KEY = "dfs.datanode.synconclose";
|
||||
|
|
|
@ -0,0 +1,119 @@
|
|||
/**
|
||||
* Licensed to the Apache Software Foundation (ASF) under one
|
||||
* or more contributor license agreements. See the NOTICE file
|
||||
* distributed with this work for additional information
|
||||
* regarding copyright ownership. The ASF licenses this file
|
||||
* to you under the Apache License, Version 2.0 (the
|
||||
* "License"); you may not use this file except in compliance
|
||||
* with the License. You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* 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.apache.hadoop.hdfs.server.namenode;
|
||||
|
||||
import org.apache.hadoop.classification.InterfaceAudience;
|
||||
import org.apache.hadoop.classification.InterfaceStability;
|
||||
|
||||
@InterfaceAudience.Private
|
||||
@InterfaceStability.Unstable
|
||||
public class ContentSummaryComputationContext {
|
||||
private FSDirectory dir = null;
|
||||
private FSNamesystem fsn = null;
|
||||
private Content.Counts counts = null;
|
||||
private long nextCountLimit = 0;
|
||||
private long limitPerRun = 0;
|
||||
private long yieldCount = 0;
|
||||
|
||||
/**
|
||||
* Constructor
|
||||
*
|
||||
* @param dir The FSDirectory instance
|
||||
* @param fsn The FSNamesystem instance
|
||||
* @param limitPerRun allowed number of operations in one
|
||||
* locking period. 0 or a negative number means
|
||||
* no limit (i.e. no yielding)
|
||||
*/
|
||||
public ContentSummaryComputationContext(FSDirectory dir,
|
||||
FSNamesystem fsn, long limitPerRun) {
|
||||
this.dir = dir;
|
||||
this.fsn = fsn;
|
||||
this.limitPerRun = limitPerRun;
|
||||
this.nextCountLimit = limitPerRun;
|
||||
this.counts = Content.Counts.newInstance();
|
||||
}
|
||||
|
||||
/** Constructor for blocking computation. */
|
||||
public ContentSummaryComputationContext() {
|
||||
this(null, null, 0);
|
||||
}
|
||||
|
||||
/** Return current yield count */
|
||||
public long getYieldCount() {
|
||||
return yieldCount;
|
||||
}
|
||||
|
||||
/**
|
||||
* Relinquish locks held during computation for a short while
|
||||
* and reacquire them. This will give other threads a chance
|
||||
* to acquire the contended locks and run.
|
||||
*
|
||||
* @return true if locks were released and reacquired.
|
||||
*/
|
||||
public boolean yield() {
|
||||
// Are we set up to do this?
|
||||
if (limitPerRun <= 0 || dir == null || fsn == null) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// Have we reached the limit?
|
||||
long currentCount = counts.get(Content.FILE) +
|
||||
counts.get(Content.SYMLINK) +
|
||||
counts.get(Content.DIRECTORY) +
|
||||
counts.get(Content.SNAPSHOTTABLE_DIRECTORY);
|
||||
if (currentCount <= nextCountLimit) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// Update the next limit
|
||||
nextCountLimit = currentCount + limitPerRun;
|
||||
|
||||
boolean hadDirReadLock = dir.hasReadLock();
|
||||
boolean hadDirWriteLock = dir.hasWriteLock();
|
||||
boolean hadFsnReadLock = fsn.hasReadLock();
|
||||
boolean hadFsnWriteLock = fsn.hasWriteLock();
|
||||
|
||||
// sanity check.
|
||||
if (!hadDirReadLock || !hadFsnReadLock || hadDirWriteLock ||
|
||||
hadFsnWriteLock || dir.getReadHoldCount() != 1 ||
|
||||
fsn.getReadHoldCount() != 1) {
|
||||
// cannot relinquish
|
||||
return false;
|
||||
}
|
||||
|
||||
// unlock
|
||||
dir.readUnlock();
|
||||
fsn.readUnlock();
|
||||
|
||||
try {
|
||||
Thread.sleep(1);
|
||||
} catch (InterruptedException ie) {
|
||||
} finally {
|
||||
// reacquire
|
||||
fsn.readLock();
|
||||
dir.readLock();
|
||||
}
|
||||
yieldCount++;
|
||||
return true;
|
||||
}
|
||||
|
||||
/** Get the content counts */
|
||||
public Content.Counts getCounts() {
|
||||
return counts;
|
||||
}
|
||||
}
|
|
@ -113,7 +113,9 @@ public class FSDirectory implements Closeable {
|
|||
private final int maxComponentLength;
|
||||
private final int maxDirItems;
|
||||
private final int lsLimit; // max list limit
|
||||
private final int contentCountLimit; // max content summary counts per run
|
||||
private final INodeMap inodeMap; // Synchronized by dirLock
|
||||
private long yieldCount = 0; // keep track of lock yield count.
|
||||
|
||||
// lock to protect the directory and BlockMap
|
||||
private ReentrantReadWriteLock dirLock;
|
||||
|
@ -144,6 +146,14 @@ public class FSDirectory implements Closeable {
|
|||
return this.dirLock.getReadHoldCount() > 0;
|
||||
}
|
||||
|
||||
public int getReadHoldCount() {
|
||||
return this.dirLock.getReadHoldCount();
|
||||
}
|
||||
|
||||
public int getWriteHoldCount() {
|
||||
return this.dirLock.getWriteHoldCount();
|
||||
}
|
||||
|
||||
/**
|
||||
* Caches frequently used file names used in {@link INode} to reuse
|
||||
* byte[] objects and reduce heap usage.
|
||||
|
@ -160,6 +170,10 @@ public class FSDirectory implements Closeable {
|
|||
DFSConfigKeys.DFS_LIST_LIMIT, DFSConfigKeys.DFS_LIST_LIMIT_DEFAULT);
|
||||
this.lsLimit = configuredLimit>0 ?
|
||||
configuredLimit : DFSConfigKeys.DFS_LIST_LIMIT_DEFAULT;
|
||||
|
||||
this.contentCountLimit = conf.getInt(
|
||||
DFSConfigKeys.DFS_CONTENT_SUMMARY_LIMIT_KEY,
|
||||
DFSConfigKeys.DFS_CONTENT_SUMMARY_LIMIT_DEFAULT);
|
||||
|
||||
// filesystem limits
|
||||
this.maxComponentLength = conf.getInt(
|
||||
|
@ -2295,13 +2309,26 @@ public class FSDirectory implements Closeable {
|
|||
throw new FileNotFoundException("File does not exist: " + srcs);
|
||||
}
|
||||
else {
|
||||
return targetNode.computeContentSummary();
|
||||
// Make it relinquish locks everytime contentCountLimit entries are
|
||||
// processed. 0 means disabled. I.e. blocking for the entire duration.
|
||||
ContentSummaryComputationContext cscc =
|
||||
|
||||
new ContentSummaryComputationContext(this, getFSNamesystem(),
|
||||
contentCountLimit);
|
||||
ContentSummary cs = targetNode.computeAndConvertContentSummary(cscc);
|
||||
yieldCount += cscc.getYieldCount();
|
||||
return cs;
|
||||
}
|
||||
} finally {
|
||||
readUnlock();
|
||||
}
|
||||
}
|
||||
|
||||
@VisibleForTesting
|
||||
public long getYieldCount() {
|
||||
return yieldCount;
|
||||
}
|
||||
|
||||
public INodeMap getINodeMap() {
|
||||
return inodeMap;
|
||||
}
|
||||
|
|
|
@ -1302,6 +1302,14 @@ public class FSNamesystem implements Namesystem, FSClusterStats,
|
|||
return hasReadLock() || hasWriteLock();
|
||||
}
|
||||
|
||||
public int getReadHoldCount() {
|
||||
return this.fsLock.getReadHoldCount();
|
||||
}
|
||||
|
||||
public int getWriteHoldCount() {
|
||||
return this.fsLock.getWriteHoldCount();
|
||||
}
|
||||
|
||||
NamespaceInfo getNamespaceInfo() {
|
||||
readLock();
|
||||
try {
|
||||
|
|
|
@ -371,10 +371,18 @@ public abstract class INode implements INodeAttributes, Diff.Element<byte[]> {
|
|||
public abstract void destroyAndCollectBlocks(
|
||||
BlocksMapUpdateInfo collectedBlocks, List<INode> removedINodes);
|
||||
|
||||
/** Compute {@link ContentSummary}. */
|
||||
/** Compute {@link ContentSummary}. Blocking call */
|
||||
public final ContentSummary computeContentSummary() {
|
||||
final Content.Counts counts = computeContentSummary(
|
||||
Content.Counts.newInstance());
|
||||
return computeAndConvertContentSummary(
|
||||
new ContentSummaryComputationContext());
|
||||
}
|
||||
|
||||
/**
|
||||
* Compute {@link ContentSummary}.
|
||||
*/
|
||||
public final ContentSummary computeAndConvertContentSummary(
|
||||
ContentSummaryComputationContext summary) {
|
||||
Content.Counts counts = computeContentSummary(summary).getCounts();
|
||||
return new ContentSummary(counts.get(Content.LENGTH),
|
||||
counts.get(Content.FILE) + counts.get(Content.SYMLINK),
|
||||
counts.get(Content.DIRECTORY), getNsQuota(),
|
||||
|
@ -384,10 +392,12 @@ public abstract class INode implements INodeAttributes, Diff.Element<byte[]> {
|
|||
/**
|
||||
* Count subtree content summary with a {@link Content.Counts}.
|
||||
*
|
||||
* @param counts The subtree counts for returning.
|
||||
* @return The same objects as the counts parameter.
|
||||
* @param summary the context object holding counts for the subtree.
|
||||
* @return The same objects as summary.
|
||||
*/
|
||||
public abstract Content.Counts computeContentSummary(Content.Counts counts);
|
||||
public abstract ContentSummaryComputationContext computeContentSummary(
|
||||
ContentSummaryComputationContext summary);
|
||||
|
||||
|
||||
/**
|
||||
* Check and add namespace/diskspace consumed to itself and the ancestors.
|
||||
|
|
|
@ -466,12 +466,45 @@ public class INodeDirectory extends INodeWithAdditionalFields
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(final Content.Counts counts) {
|
||||
for (INode child : getChildrenList(null)) {
|
||||
child.computeContentSummary(counts);
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
ContentSummaryComputationContext summary) {
|
||||
ReadOnlyList<INode> childrenList = getChildrenList(null);
|
||||
// Explicit traversing is done to enable repositioning after relinquishing
|
||||
// and reacquiring locks.
|
||||
for (int i = 0; i < childrenList.size(); i++) {
|
||||
INode child = childrenList.get(i);
|
||||
byte[] childName = child.getLocalNameBytes();
|
||||
|
||||
long lastYieldCount = summary.getYieldCount();
|
||||
child.computeContentSummary(summary);
|
||||
|
||||
// Check whether the computation was paused in the subtree.
|
||||
// The counts may be off, but traversing the rest of children
|
||||
// should be made safe.
|
||||
if (lastYieldCount == summary.getYieldCount()) {
|
||||
continue;
|
||||
}
|
||||
|
||||
// The locks were released and reacquired. Check parent first.
|
||||
if (getParent() == null) {
|
||||
// Stop further counting and return whatever we have so far.
|
||||
break;
|
||||
}
|
||||
|
||||
// Obtain the children list again since it may have been modified.
|
||||
childrenList = getChildrenList(null);
|
||||
// Reposition in case the children list is changed. Decrement by 1
|
||||
// since it will be incremented when loops.
|
||||
i = nextChild(childrenList, childName) - 1;
|
||||
}
|
||||
counts.add(Content.DIRECTORY, 1);
|
||||
return counts;
|
||||
|
||||
// Increment the directory count for this directory.
|
||||
summary.getCounts().add(Content.DIRECTORY, 1);
|
||||
|
||||
// Relinquish and reacquire locks if necessary.
|
||||
summary.yield();
|
||||
|
||||
return summary;
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
|
@ -107,12 +107,16 @@ public class INodeDirectoryWithQuota extends INodeDirectory {
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(
|
||||
final Content.Counts counts) {
|
||||
final long original = counts.get(Content.DISKSPACE);
|
||||
super.computeContentSummary(counts);
|
||||
checkDiskspace(counts.get(Content.DISKSPACE) - original);
|
||||
return counts;
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
final ContentSummaryComputationContext summary) {
|
||||
final long original = summary.getCounts().get(Content.DISKSPACE);
|
||||
long oldYieldCount = summary.getYieldCount();
|
||||
super.computeContentSummary(summary);
|
||||
// Check only when the content has not changed in the middle.
|
||||
if (oldYieldCount == summary.getYieldCount()) {
|
||||
checkDiskspace(summary.getCounts().get(Content.DISKSPACE) - original);
|
||||
}
|
||||
return summary;
|
||||
}
|
||||
|
||||
private void checkDiskspace(final long computed) {
|
||||
|
|
|
@ -342,11 +342,11 @@ public class INodeFile extends INodeWithAdditionalFields
|
|||
}
|
||||
|
||||
@Override
|
||||
public final Content.Counts computeContentSummary(
|
||||
final Content.Counts counts) {
|
||||
computeContentSummary4Snapshot(counts);
|
||||
computeContentSummary4Current(counts);
|
||||
return counts;
|
||||
public final ContentSummaryComputationContext computeContentSummary(
|
||||
final ContentSummaryComputationContext summary) {
|
||||
computeContentSummary4Snapshot(summary.getCounts());
|
||||
computeContentSummary4Current(summary.getCounts());
|
||||
return summary;
|
||||
}
|
||||
|
||||
private void computeContentSummary4Snapshot(final Content.Counts counts) {
|
||||
|
|
|
@ -107,7 +107,8 @@ public class INodeMap {
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(Content.Counts counts) {
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
ContentSummaryComputationContext summary) {
|
||||
return null;
|
||||
}
|
||||
|
||||
|
|
|
@ -278,8 +278,9 @@ public abstract class INodeReference extends INode {
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(Content.Counts counts) {
|
||||
return referred.computeContentSummary(counts);
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
ContentSummaryComputationContext summary) {
|
||||
return referred.computeContentSummary(summary);
|
||||
}
|
||||
|
||||
@Override
|
||||
|
@ -444,12 +445,13 @@ public abstract class INodeReference extends INode {
|
|||
}
|
||||
|
||||
@Override
|
||||
public final Content.Counts computeContentSummary(Content.Counts counts) {
|
||||
public final ContentSummaryComputationContext computeContentSummary(
|
||||
ContentSummaryComputationContext summary) {
|
||||
//only count diskspace for WithName
|
||||
final Quota.Counts q = Quota.Counts.newInstance();
|
||||
computeQuotaUsage(q, false, lastSnapshotId);
|
||||
counts.add(Content.DISKSPACE, q.get(Quota.DISKSPACE));
|
||||
return counts;
|
||||
summary.getCounts().add(Content.DISKSPACE, q.get(Quota.DISKSPACE));
|
||||
return summary;
|
||||
}
|
||||
|
||||
@Override
|
||||
|
@ -688,4 +690,4 @@ public abstract class INodeReference extends INode {
|
|||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
|
|
@ -98,9 +98,10 @@ public class INodeSymlink extends INodeWithAdditionalFields {
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(final Content.Counts counts) {
|
||||
counts.add(Content.SYMLINK, 1);
|
||||
return counts;
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
final ContentSummaryComputationContext summary) {
|
||||
summary.getCounts().add(Content.SYMLINK, 1);
|
||||
return summary;
|
||||
}
|
||||
|
||||
@Override
|
||||
|
|
|
@ -38,6 +38,7 @@ import org.apache.hadoop.hdfs.protocol.SnapshotException;
|
|||
import org.apache.hadoop.hdfs.protocol.SnapshotDiffReport.DiffReportEntry;
|
||||
import org.apache.hadoop.hdfs.protocol.SnapshotDiffReport.DiffType;
|
||||
import org.apache.hadoop.hdfs.server.namenode.Content;
|
||||
import org.apache.hadoop.hdfs.server.namenode.ContentSummaryComputationContext;
|
||||
import org.apache.hadoop.hdfs.server.namenode.INode;
|
||||
import org.apache.hadoop.hdfs.server.namenode.INodeDirectory;
|
||||
import org.apache.hadoop.hdfs.server.namenode.INodeFile;
|
||||
|
@ -342,11 +343,12 @@ public class INodeDirectorySnapshottable extends INodeDirectoryWithSnapshot {
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(final Content.Counts counts) {
|
||||
super.computeContentSummary(counts);
|
||||
counts.add(Content.SNAPSHOT, snapshotsByNames.size());
|
||||
counts.add(Content.SNAPSHOTTABLE_DIRECTORY, 1);
|
||||
return counts;
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
final ContentSummaryComputationContext summary) {
|
||||
super.computeContentSummary(summary);
|
||||
summary.getCounts().add(Content.SNAPSHOT, snapshotsByNames.size());
|
||||
summary.getCounts().add(Content.SNAPSHOTTABLE_DIRECTORY, 1);
|
||||
return summary;
|
||||
}
|
||||
|
||||
/**
|
||||
|
|
|
@ -32,6 +32,7 @@ import org.apache.hadoop.hdfs.protocol.QuotaExceededException;
|
|||
import org.apache.hadoop.hdfs.protocol.SnapshotDiffReport.DiffReportEntry;
|
||||
import org.apache.hadoop.hdfs.protocol.SnapshotDiffReport.DiffType;
|
||||
import org.apache.hadoop.hdfs.server.namenode.Content;
|
||||
import org.apache.hadoop.hdfs.server.namenode.ContentSummaryComputationContext;
|
||||
import org.apache.hadoop.hdfs.server.namenode.FSImageSerialization;
|
||||
import org.apache.hadoop.hdfs.server.namenode.INode;
|
||||
import org.apache.hadoop.hdfs.server.namenode.INodeDirectory;
|
||||
|
@ -883,18 +884,27 @@ public class INodeDirectoryWithSnapshot extends INodeDirectoryWithQuota {
|
|||
}
|
||||
|
||||
@Override
|
||||
public Content.Counts computeContentSummary(final Content.Counts counts) {
|
||||
super.computeContentSummary(counts);
|
||||
computeContentSummary4Snapshot(counts);
|
||||
return counts;
|
||||
public ContentSummaryComputationContext computeContentSummary(
|
||||
final ContentSummaryComputationContext summary) {
|
||||
// Snapshot summary calc won't be relinquishing locks in the middle.
|
||||
// Do this first and handover to parent.
|
||||
computeContentSummary4Snapshot(summary.getCounts());
|
||||
super.computeContentSummary(summary);
|
||||
return summary;
|
||||
}
|
||||
|
||||
private void computeContentSummary4Snapshot(final Content.Counts counts) {
|
||||
// Create a new blank summary context for blocking processing of subtree.
|
||||
ContentSummaryComputationContext summary =
|
||||
new ContentSummaryComputationContext();
|
||||
for(DirectoryDiff d : diffs) {
|
||||
for(INode deleted : d.getChildrenDiff().getList(ListType.DELETED)) {
|
||||
deleted.computeContentSummary(counts);
|
||||
deleted.computeContentSummary(summary);
|
||||
}
|
||||
}
|
||||
// Add the counts from deleted trees.
|
||||
counts.add(summary.getCounts());
|
||||
// Add the deleted directory count.
|
||||
counts.add(Content.DIRECTORY, diffs.asList().size());
|
||||
}
|
||||
|
||||
|
|
|
@ -86,6 +86,9 @@ public class TestQuota {
|
|||
// Space quotas
|
||||
final int DEFAULT_BLOCK_SIZE = 512;
|
||||
conf.setLong(DFSConfigKeys.DFS_BLOCK_SIZE_KEY, DEFAULT_BLOCK_SIZE);
|
||||
// Make it relinquish locks. When run serially, the result should
|
||||
// be identical.
|
||||
conf.setInt(DFSConfigKeys.DFS_CONTENT_SUMMARY_LIMIT_KEY, 2);
|
||||
final MiniDFSCluster cluster = new MiniDFSCluster.Builder(conf).numDataNodes(2).build();
|
||||
final FileSystem fs = cluster.getFileSystem();
|
||||
assertTrue("Not a HDFS: "+fs.getUri(),
|
||||
|
@ -350,6 +353,7 @@ public class TestQuota {
|
|||
}
|
||||
assertTrue(hasException);
|
||||
|
||||
assertEquals(4, cluster.getNamesystem().getFSDirectory().getYieldCount());
|
||||
} finally {
|
||||
cluster.shutdown();
|
||||
}
|
||||
|
@ -360,6 +364,9 @@ public class TestQuota {
|
|||
@Test
|
||||
public void testNamespaceCommands() throws Exception {
|
||||
final Configuration conf = new HdfsConfiguration();
|
||||
// Make it relinquish locks. When run serially, the result should
|
||||
// be identical.
|
||||
conf.setInt(DFSConfigKeys.DFS_CONTENT_SUMMARY_LIMIT_KEY, 2);
|
||||
final MiniDFSCluster cluster = new MiniDFSCluster.Builder(conf).numDataNodes(2).build();
|
||||
final FileSystem fs = cluster.getFileSystem();
|
||||
assertTrue("Not a HDFS: "+fs.getUri(),
|
||||
|
@ -515,6 +522,7 @@ public class TestQuota {
|
|||
c = dfs.getContentSummary(quotaDir1);
|
||||
assertEquals(c.getDirectoryCount(), 6);
|
||||
assertEquals(c.getQuota(), 6);
|
||||
assertEquals(14, cluster.getNamesystem().getFSDirectory().getYieldCount());
|
||||
} finally {
|
||||
cluster.shutdown();
|
||||
}
|
||||
|
@ -532,6 +540,9 @@ public class TestQuota {
|
|||
// set a smaller block size so that we can test with smaller
|
||||
// diskspace quotas
|
||||
conf.set(DFSConfigKeys.DFS_BLOCK_SIZE_KEY, "512");
|
||||
// Make it relinquish locks. When run serially, the result should
|
||||
// be identical.
|
||||
conf.setInt(DFSConfigKeys.DFS_CONTENT_SUMMARY_LIMIT_KEY, 2);
|
||||
final MiniDFSCluster cluster = new MiniDFSCluster.Builder(conf).numDataNodes(2).build();
|
||||
final FileSystem fs = cluster.getFileSystem();
|
||||
assertTrue("Not a HDFS: "+fs.getUri(),
|
||||
|
@ -764,6 +775,7 @@ public class TestQuota {
|
|||
assertEquals(c.getSpaceConsumed(),
|
||||
(sizeFactorA + sizeFactorB + sizeFactorC) * fileSpace);
|
||||
|
||||
assertEquals(20, cluster.getNamesystem().getFSDirectory().getYieldCount());
|
||||
} finally {
|
||||
cluster.shutdown();
|
||||
}
|
||||
|
@ -905,6 +917,9 @@ public class TestQuota {
|
|||
final int BLOCK_SIZE = 6 * 1024;
|
||||
conf.setInt(DFSConfigKeys.DFS_BLOCK_SIZE_KEY, BLOCK_SIZE);
|
||||
conf.setBoolean(DFSConfigKeys.DFS_WEBHDFS_ENABLED_KEY, true);
|
||||
// Make it relinquish locks. When run serially, the result should
|
||||
// be identical.
|
||||
conf.setInt(DFSConfigKeys.DFS_CONTENT_SUMMARY_LIMIT_KEY, 2);
|
||||
MiniDFSCluster cluster =
|
||||
new MiniDFSCluster.Builder(conf).numDataNodes(3).build();
|
||||
cluster.waitActive();
|
||||
|
@ -971,6 +986,7 @@ public class TestQuota {
|
|||
exceededQuota = true;
|
||||
}
|
||||
assertTrue("Quota not exceeded", exceededQuota);
|
||||
assertEquals(2, cluster.getNamesystem().getFSDirectory().getYieldCount());
|
||||
} finally {
|
||||
cluster.shutdown();
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue