HDFS-15704. Mitigate lease monitor's rapid infinite loop. (#2511). Contributed by Daryn Sharp and Ahmed Hussein
(cherry picked from commit c2672bb234
)
This commit is contained in:
parent
1fe15113cf
commit
a23faaec18
|
@ -23,14 +23,12 @@ import java.io.IOException;
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.Collection;
|
import java.util.Collection;
|
||||||
import java.util.Collections;
|
import java.util.Collections;
|
||||||
import java.util.Comparator;
|
import java.util.HashMap;
|
||||||
import java.util.HashSet;
|
import java.util.HashSet;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
import java.util.NavigableSet;
|
|
||||||
import java.util.Set;
|
import java.util.Set;
|
||||||
import java.util.SortedMap;
|
import java.util.SortedMap;
|
||||||
import java.util.TreeMap;
|
import java.util.TreeMap;
|
||||||
import java.util.TreeSet;
|
|
||||||
import java.util.concurrent.Callable;
|
import java.util.concurrent.Callable;
|
||||||
import java.util.concurrent.ExecutorService;
|
import java.util.concurrent.ExecutorService;
|
||||||
import java.util.concurrent.Executors;
|
import java.util.concurrent.Executors;
|
||||||
|
@ -90,21 +88,11 @@ public class LeaseManager {
|
||||||
private long lastHolderUpdateTime;
|
private long lastHolderUpdateTime;
|
||||||
private String internalLeaseHolder;
|
private String internalLeaseHolder;
|
||||||
|
|
||||||
|
//
|
||||||
// Used for handling lock-leases
|
// Used for handling lock-leases
|
||||||
// Mapping: leaseHolder -> Lease
|
// Mapping: leaseHolder -> Lease
|
||||||
private final SortedMap<String, Lease> leases = new TreeMap<>();
|
//
|
||||||
// Set of: Lease
|
private final HashMap<String, Lease> leases = new HashMap<>();
|
||||||
private final NavigableSet<Lease> sortedLeases = new TreeSet<>(
|
|
||||||
new Comparator<Lease>() {
|
|
||||||
@Override
|
|
||||||
public int compare(Lease o1, Lease o2) {
|
|
||||||
if (o1.getLastUpdate() != o2.getLastUpdate()) {
|
|
||||||
return Long.signum(o1.getLastUpdate() - o2.getLastUpdate());
|
|
||||||
} else {
|
|
||||||
return o1.holder.compareTo(o2.holder);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
});
|
|
||||||
// INodeID -> Lease
|
// INodeID -> Lease
|
||||||
private final TreeMap<Long, Lease> leasesById = new TreeMap<>();
|
private final TreeMap<Long, Lease> leasesById = new TreeMap<>();
|
||||||
|
|
||||||
|
@ -338,7 +326,7 @@ public class LeaseManager {
|
||||||
/** @return the number of leases currently in the system */
|
/** @return the number of leases currently in the system */
|
||||||
@VisibleForTesting
|
@VisibleForTesting
|
||||||
public synchronized int countLease() {
|
public synchronized int countLease() {
|
||||||
return sortedLeases.size();
|
return leases.size();
|
||||||
}
|
}
|
||||||
|
|
||||||
/** @return the number of paths contained in all leases */
|
/** @return the number of paths contained in all leases */
|
||||||
|
@ -354,7 +342,6 @@ public class LeaseManager {
|
||||||
if (lease == null) {
|
if (lease == null) {
|
||||||
lease = new Lease(holder);
|
lease = new Lease(holder);
|
||||||
leases.put(holder, lease);
|
leases.put(holder, lease);
|
||||||
sortedLeases.add(lease);
|
|
||||||
} else {
|
} else {
|
||||||
renewLease(lease);
|
renewLease(lease);
|
||||||
}
|
}
|
||||||
|
@ -380,9 +367,8 @@ public class LeaseManager {
|
||||||
}
|
}
|
||||||
|
|
||||||
if (!lease.hasFiles()) {
|
if (!lease.hasFiles()) {
|
||||||
leases.remove(lease.holder);
|
if (leases.remove(lease.holder) == null) {
|
||||||
if (!sortedLeases.remove(lease)) {
|
LOG.error("{} not found", lease);
|
||||||
LOG.error("{} not found in sortedLeases", lease);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
@ -401,7 +387,6 @@ public class LeaseManager {
|
||||||
}
|
}
|
||||||
|
|
||||||
synchronized void removeAllLeases() {
|
synchronized void removeAllLeases() {
|
||||||
sortedLeases.clear();
|
|
||||||
leasesById.clear();
|
leasesById.clear();
|
||||||
leases.clear();
|
leases.clear();
|
||||||
}
|
}
|
||||||
|
@ -424,11 +409,10 @@ public class LeaseManager {
|
||||||
synchronized void renewLease(String holder) {
|
synchronized void renewLease(String holder) {
|
||||||
renewLease(getLease(holder));
|
renewLease(getLease(holder));
|
||||||
}
|
}
|
||||||
|
|
||||||
synchronized void renewLease(Lease lease) {
|
synchronized void renewLease(Lease lease) {
|
||||||
if (lease != null) {
|
if (lease != null) {
|
||||||
sortedLeases.remove(lease);
|
|
||||||
lease.renew();
|
lease.renew();
|
||||||
sortedLeases.add(lease);
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -454,8 +438,8 @@ public class LeaseManager {
|
||||||
private final HashSet<Long> files = new HashSet<>();
|
private final HashSet<Long> files = new HashSet<>();
|
||||||
|
|
||||||
/** Only LeaseManager object can create a lease */
|
/** Only LeaseManager object can create a lease */
|
||||||
private Lease(String holder) {
|
private Lease(String h) {
|
||||||
this.holder = holder;
|
this.holder = h;
|
||||||
renew();
|
renew();
|
||||||
}
|
}
|
||||||
/** Only LeaseManager object can renew a lease */
|
/** Only LeaseManager object can renew a lease */
|
||||||
|
@ -468,6 +452,10 @@ public class LeaseManager {
|
||||||
return monotonicNow() - lastUpdate > hardLimit;
|
return monotonicNow() - lastUpdate > hardLimit;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
public boolean expiredHardLimit(long now) {
|
||||||
|
return now - lastUpdate > hardLimit;
|
||||||
|
}
|
||||||
|
|
||||||
/** @return true if the Soft Limit Timer has expired */
|
/** @return true if the Soft Limit Timer has expired */
|
||||||
public boolean expiredSoftLimit() {
|
public boolean expiredSoftLimit() {
|
||||||
return monotonicNow() - lastUpdate > softLimit;
|
return monotonicNow() - lastUpdate > softLimit;
|
||||||
|
@ -510,6 +498,17 @@ public class LeaseManager {
|
||||||
this.hardLimit = hardLimit;
|
this.hardLimit = hardLimit;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
private synchronized Collection<Lease> getExpiredCandidateLeases() {
|
||||||
|
final long now = Time.monotonicNow();
|
||||||
|
Collection<Lease> expired = new HashSet<>();
|
||||||
|
for (Lease lease : leases.values()) {
|
||||||
|
if (lease.expiredHardLimit(now)) {
|
||||||
|
expired.add(lease);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
return expired;
|
||||||
|
}
|
||||||
|
|
||||||
/******************************************************
|
/******************************************************
|
||||||
* Monitor checks for leases that have expired,
|
* Monitor checks for leases that have expired,
|
||||||
* and disposes of them.
|
* and disposes of them.
|
||||||
|
@ -523,10 +522,19 @@ public class LeaseManager {
|
||||||
for(; shouldRunMonitor && fsnamesystem.isRunning(); ) {
|
for(; shouldRunMonitor && fsnamesystem.isRunning(); ) {
|
||||||
boolean needSync = false;
|
boolean needSync = false;
|
||||||
try {
|
try {
|
||||||
|
// sleep now to avoid infinite loop if an exception was thrown.
|
||||||
|
Thread.sleep(fsnamesystem.getLeaseRecheckIntervalMs());
|
||||||
|
|
||||||
|
// pre-filter the leases w/o the fsn lock.
|
||||||
|
Collection<Lease> candidates = getExpiredCandidateLeases();
|
||||||
|
if (candidates.isEmpty()) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
fsnamesystem.writeLockInterruptibly();
|
fsnamesystem.writeLockInterruptibly();
|
||||||
try {
|
try {
|
||||||
if (!fsnamesystem.isInSafeMode()) {
|
if (!fsnamesystem.isInSafeMode()) {
|
||||||
needSync = checkLeases();
|
needSync = checkLeases(candidates);
|
||||||
}
|
}
|
||||||
} finally {
|
} finally {
|
||||||
fsnamesystem.writeUnlock("leaseManager");
|
fsnamesystem.writeUnlock("leaseManager");
|
||||||
|
@ -535,8 +543,6 @@ public class LeaseManager {
|
||||||
fsnamesystem.getEditLog().logSync();
|
fsnamesystem.getEditLog().logSync();
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
Thread.sleep(fsnamesystem.getLeaseRecheckIntervalMs());
|
|
||||||
} catch(InterruptedException ie) {
|
} catch(InterruptedException ie) {
|
||||||
LOG.debug("{} is interrupted", name, ie);
|
LOG.debug("{} is interrupted", name, ie);
|
||||||
} catch(Throwable e) {
|
} catch(Throwable e) {
|
||||||
|
@ -551,17 +557,22 @@ public class LeaseManager {
|
||||||
*/
|
*/
|
||||||
@VisibleForTesting
|
@VisibleForTesting
|
||||||
synchronized boolean checkLeases() {
|
synchronized boolean checkLeases() {
|
||||||
|
return checkLeases(getExpiredCandidateLeases());
|
||||||
|
}
|
||||||
|
|
||||||
|
private synchronized boolean checkLeases(Collection<Lease> leasesToCheck) {
|
||||||
boolean needSync = false;
|
boolean needSync = false;
|
||||||
assert fsnamesystem.hasWriteLock();
|
assert fsnamesystem.hasWriteLock();
|
||||||
|
|
||||||
long start = monotonicNow();
|
long start = monotonicNow();
|
||||||
|
for (Lease leaseToCheck : leasesToCheck) {
|
||||||
while(!sortedLeases.isEmpty() &&
|
if (isMaxLockHoldToReleaseLease(start)) {
|
||||||
sortedLeases.first().expiredHardLimit()
|
break;
|
||||||
&& !isMaxLockHoldToReleaseLease(start)) {
|
}
|
||||||
Lease leaseToCheck = sortedLeases.first();
|
if (!leaseToCheck.expiredHardLimit(Time.monotonicNow())) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
LOG.info("{} has expired hard limit", leaseToCheck);
|
LOG.info("{} has expired hard limit", leaseToCheck);
|
||||||
|
|
||||||
final List<Long> removing = new ArrayList<>();
|
final List<Long> removing = new ArrayList<>();
|
||||||
// need to create a copy of the oldest lease files, because
|
// need to create a copy of the oldest lease files, because
|
||||||
// internalReleaseLease() removes files corresponding to empty files,
|
// internalReleaseLease() removes files corresponding to empty files,
|
||||||
|
@ -623,7 +634,6 @@ public class LeaseManager {
|
||||||
removeLease(leaseToCheck, id);
|
removeLease(leaseToCheck, id);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
return needSync;
|
return needSync;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -638,7 +648,6 @@ public class LeaseManager {
|
||||||
public synchronized String toString() {
|
public synchronized String toString() {
|
||||||
return getClass().getSimpleName() + "= {"
|
return getClass().getSimpleName() + "= {"
|
||||||
+ "\n leases=" + leases
|
+ "\n leases=" + leases
|
||||||
+ "\n sortedLeases=" + sortedLeases
|
|
||||||
+ "\n leasesById=" + leasesById
|
+ "\n leasesById=" + leasesById
|
||||||
+ "\n}";
|
+ "\n}";
|
||||||
}
|
}
|
||||||
|
|
|
@ -21,13 +21,11 @@ import java.io.FileNotFoundException;
|
||||||
import java.io.IOException;
|
import java.io.IOException;
|
||||||
import java.util.AbstractMap;
|
import java.util.AbstractMap;
|
||||||
import java.util.ArrayList;
|
import java.util.ArrayList;
|
||||||
import java.util.Comparator;
|
|
||||||
import java.util.EnumSet;
|
import java.util.EnumSet;
|
||||||
import java.util.HashMap;
|
import java.util.HashMap;
|
||||||
import java.util.List;
|
import java.util.List;
|
||||||
import java.util.Map;
|
import java.util.Map;
|
||||||
import java.util.Set;
|
import java.util.Set;
|
||||||
import java.util.TreeSet;
|
|
||||||
import java.util.concurrent.Semaphore;
|
import java.util.concurrent.Semaphore;
|
||||||
|
|
||||||
import org.apache.hadoop.fs.Options;
|
import org.apache.hadoop.fs.Options;
|
||||||
|
@ -55,7 +53,6 @@ import org.apache.hadoop.hdfs.server.blockmanagement.DatanodeDescriptor;
|
||||||
import org.apache.hadoop.hdfs.server.blockmanagement.DatanodeStorageInfo;
|
import org.apache.hadoop.hdfs.server.blockmanagement.DatanodeStorageInfo;
|
||||||
import org.apache.hadoop.hdfs.server.datanode.DataNode;
|
import org.apache.hadoop.hdfs.server.datanode.DataNode;
|
||||||
import org.apache.hadoop.hdfs.server.datanode.InternalDataNodeTestUtils;
|
import org.apache.hadoop.hdfs.server.datanode.InternalDataNodeTestUtils;
|
||||||
import org.apache.hadoop.hdfs.server.namenode.LeaseManager.Lease;
|
|
||||||
import org.apache.hadoop.hdfs.server.namenode.snapshot.SnapshotTestHelper;
|
import org.apache.hadoop.hdfs.server.namenode.snapshot.SnapshotTestHelper;
|
||||||
import org.apache.hadoop.io.IOUtils;
|
import org.apache.hadoop.io.IOUtils;
|
||||||
import org.apache.hadoop.net.Node;
|
import org.apache.hadoop.net.Node;
|
||||||
|
@ -68,7 +65,7 @@ import org.junit.rules.Timeout;
|
||||||
import org.mockito.Mockito;
|
import org.mockito.Mockito;
|
||||||
import org.mockito.internal.util.reflection.Whitebox;
|
import org.mockito.internal.util.reflection.Whitebox;
|
||||||
|
|
||||||
import static org.apache.hadoop.hdfs.DFSConfigKeys.DFS_NAMENODE_LEASE_RECHECK_INTERVAL_MS_DEFAULT;
|
import static org.apache.hadoop.hdfs.DFSConfigKeys.DFS_LEASE_HARDLIMIT_KEY;
|
||||||
import static org.apache.hadoop.hdfs.DFSConfigKeys.DFS_NAMENODE_LEASE_RECHECK_INTERVAL_MS_KEY;
|
import static org.apache.hadoop.hdfs.DFSConfigKeys.DFS_NAMENODE_LEASE_RECHECK_INTERVAL_MS_KEY;
|
||||||
import static org.junit.Assert.assertNotEquals;
|
import static org.junit.Assert.assertNotEquals;
|
||||||
|
|
||||||
|
@ -386,6 +383,10 @@ public class TestDeleteRace {
|
||||||
// Disable permissions so that another user can recover the lease.
|
// Disable permissions so that another user can recover the lease.
|
||||||
config.setBoolean(DFSConfigKeys.DFS_PERMISSIONS_ENABLED_KEY, false);
|
config.setBoolean(DFSConfigKeys.DFS_PERMISSIONS_ENABLED_KEY, false);
|
||||||
config.setInt(DFSConfigKeys.DFS_BLOCK_SIZE_KEY, BLOCK_SIZE);
|
config.setInt(DFSConfigKeys.DFS_BLOCK_SIZE_KEY, BLOCK_SIZE);
|
||||||
|
long leaseRecheck = 1000;
|
||||||
|
conf.setLong(DFS_NAMENODE_LEASE_RECHECK_INTERVAL_MS_KEY, leaseRecheck);
|
||||||
|
conf.setLong(DFS_LEASE_HARDLIMIT_KEY, leaseRecheck/1000);
|
||||||
|
|
||||||
FSDataOutputStream stm = null;
|
FSDataOutputStream stm = null;
|
||||||
try {
|
try {
|
||||||
cluster = new MiniDFSCluster.Builder(config).numDataNodes(3).build();
|
cluster = new MiniDFSCluster.Builder(config).numDataNodes(3).build();
|
||||||
|
@ -410,30 +411,8 @@ public class TestDeleteRace {
|
||||||
// the streamer.
|
// the streamer.
|
||||||
AppendTestUtil.write(stm, 0, BLOCK_SIZE);
|
AppendTestUtil.write(stm, 0, BLOCK_SIZE);
|
||||||
|
|
||||||
// Mock a scenario that the lease reached hard limit.
|
|
||||||
final LeaseManager lm = (LeaseManager) Whitebox
|
|
||||||
.getInternalState(cluster.getNameNode().getNamesystem(),
|
|
||||||
"leaseManager");
|
|
||||||
final TreeSet<Lease> leases =
|
|
||||||
(TreeSet<Lease>) Whitebox.getInternalState(lm, "sortedLeases");
|
|
||||||
final TreeSet<Lease> spyLeases = new TreeSet<>(new Comparator<Lease>() {
|
|
||||||
@Override
|
|
||||||
public int compare(Lease o1, Lease o2) {
|
|
||||||
return Long.signum(o1.getLastUpdate() - o2.getLastUpdate());
|
|
||||||
}
|
|
||||||
});
|
|
||||||
while (!leases.isEmpty()) {
|
|
||||||
final Lease lease = leases.first();
|
|
||||||
final Lease spyLease = Mockito.spy(lease);
|
|
||||||
Mockito.doReturn(true).when(spyLease).expiredHardLimit();
|
|
||||||
spyLeases.add(spyLease);
|
|
||||||
leases.remove(lease);
|
|
||||||
}
|
|
||||||
Whitebox.setInternalState(lm, "sortedLeases", spyLeases);
|
|
||||||
|
|
||||||
// wait for lease manager's background 'Monitor' class to check leases.
|
// wait for lease manager's background 'Monitor' class to check leases.
|
||||||
Thread.sleep(2 * conf.getLong(DFS_NAMENODE_LEASE_RECHECK_INTERVAL_MS_KEY,
|
Thread.sleep(2 * leaseRecheck);
|
||||||
DFS_NAMENODE_LEASE_RECHECK_INTERVAL_MS_DEFAULT));
|
|
||||||
|
|
||||||
LOG.info("Now check we can restart");
|
LOG.info("Now check we can restart");
|
||||||
cluster.restartNameNodes();
|
cluster.restartNameNodes();
|
||||||
|
|
Loading…
Reference in New Issue