You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@accumulo.apache.org by kt...@apache.org on 2019/10/10 14:55:13 UTC
[accumulo] branch 1.9 updated: Improved metadata table consitency
checking and testing (#1379)
This is an automated email from the ASF dual-hosted git repository.
kturner pushed a commit to branch 1.9
in repository https://gitbox.apache.org/repos/asf/accumulo.git
The following commit(s) were added to refs/heads/1.9 by this push:
new 328ffa0 Improved metadata table consitency checking and testing (#1379)
328ffa0 is described below
commit 328ffa0849981e0f113dfbf539c832b447e06902
Author: Keith Turner <kt...@apache.org>
AuthorDate: Thu Oct 10 10:55:08 2019 -0400
Improved metadata table consitency checking and testing (#1379)
Added unit test to exercise the code that checks the consistency of the
metadata table during GC scans. Also added a check to ensure the last
tablet was seen. This should cause an error to be thrown if the scanner
stops returning data for any reason. These changes were already made in
2.0 in #1266. However the code in 1.9 is so different that they could
not be back-ported, but had to be re-implemented.
---
.../accumulo/server/util/TabletIterator.java | 23 +-
.../accumulo/server/util/TabletIteratorTest.java | 258 +++++++++++++++++++++
2 files changed, 277 insertions(+), 4 deletions(-)
diff --git a/server/base/src/main/java/org/apache/accumulo/server/util/TabletIterator.java b/server/base/src/main/java/org/apache/accumulo/server/util/TabletIterator.java
index b6fed26..83ec344 100644
--- a/server/base/src/main/java/org/apache/accumulo/server/util/TabletIterator.java
+++ b/server/base/src/main/java/org/apache/accumulo/server/util/TabletIterator.java
@@ -22,6 +22,7 @@ import java.util.Iterator;
import java.util.Map;
import java.util.Map.Entry;
import java.util.NoSuchElementException;
+import java.util.Objects;
import java.util.Set;
import java.util.SortedMap;
import java.util.TreeMap;
@@ -101,6 +102,23 @@ public class TabletIterator implements Iterator<Map<Key,Value>> {
currentTabletKeys = scanToPrevEndRow();
if (currentTabletKeys.size() == 0) {
+ // Always expect the default tablet to exist for a table. The following checks for the case when
+ // the default tablet was not seen when it should have been seen.
+ if (lastTablet != null) {
+ KeyExtent lastExtent = new KeyExtent(lastTablet, (Text) null);
+
+ // if lastTablet was not the default tablet
+ if (lastExtent.getEndRow() != null) {
+
+ Text defaultTabletRow = TabletsSection.getRow(lastExtent.getTableId(), null);
+ if (range.contains(new Key(defaultTabletRow))) {
+ throw new IllegalStateException(
+ "Scan range included default tablet, but did not see default tablet. Last tablet seen : "
+ + lastTablet);
+ }
+ }
+ }
+
break;
}
@@ -137,10 +155,7 @@ public class TabletIterator implements Iterator<Map<Key,Value>> {
}
}
- boolean perEqual = (per == null && lastEndRow == null)
- || (per != null && lastEndRow != null && per.equals(lastEndRow));
-
- if (!perEqual) {
+ if (!Objects.equals(per, lastEndRow)) {
log.info("Metadata inconsistency : " + per + " != " + lastEndRow + " metadataKey = "
+ prevEndRowKey);
diff --git a/server/base/src/test/java/org/apache/accumulo/server/util/TabletIteratorTest.java b/server/base/src/test/java/org/apache/accumulo/server/util/TabletIteratorTest.java
new file mode 100644
index 0000000..233c87a
--- /dev/null
+++ b/server/base/src/test/java/org/apache/accumulo/server/util/TabletIteratorTest.java
@@ -0,0 +1,258 @@
+/*
+ * 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.accumulo.server.util;
+
+import static org.easymock.EasyMock.anyObject;
+import static org.easymock.EasyMock.capture;
+import static org.easymock.EasyMock.createMock;
+import static org.easymock.EasyMock.expect;
+import static org.easymock.EasyMock.expectLastCall;
+import static org.easymock.EasyMock.replay;
+import static org.junit.Assert.assertEquals;
+import static org.junit.Assert.assertFalse;
+
+import java.util.Arrays;
+import java.util.Iterator;
+import java.util.List;
+import java.util.Map;
+import java.util.Map.Entry;
+import java.util.TreeMap;
+
+import org.apache.accumulo.core.client.Scanner;
+import org.apache.accumulo.core.data.ColumnUpdate;
+import org.apache.accumulo.core.data.Key;
+import org.apache.accumulo.core.data.Mutation;
+import org.apache.accumulo.core.data.Range;
+import org.apache.accumulo.core.data.Value;
+import org.apache.accumulo.core.data.impl.KeyExtent;
+import org.apache.accumulo.core.metadata.schema.MetadataSchema;
+import org.apache.accumulo.core.metadata.schema.MetadataSchema.TabletsSection;
+import org.apache.accumulo.server.util.TabletIterator.TabletDeletedException;
+import org.apache.hadoop.io.Text;
+import org.easymock.Capture;
+import org.easymock.IAnswer;
+import org.junit.Rule;
+import org.junit.Test;
+import org.junit.rules.ExpectedException;
+
+import com.google.common.base.Predicate;
+import com.google.common.collect.Iterators;
+
+public class TabletIteratorTest {
+
+ @Rule
+ public ExpectedException thrown = ExpectedException.none();
+
+ @Test
+ public void testSplits() {
+ TreeMap<Key,Value> data1 = new TreeMap<Key,Value>();
+
+ createTabletData(data1, "4", "j", null);
+ createTabletData(data1, "4", "m", "j");
+ createTabletData(data1, "4", null, "x");
+
+ TreeMap<Key,Value> data2 = new TreeMap<Key,Value>(data1);
+
+ createTabletData(data2, "4", "s", "m");
+ createTabletData(data2, "4", "x", "s");
+
+ runTest(Arrays.asList(data1, data2), Arrays.asList("4;j", "4;m", "4;s", "4;x", "4<"));
+ }
+
+ @Test
+ public void testTableTransition1() {
+ TreeMap<Key,Value> data1 = new TreeMap<Key,Value>();
+
+ createTabletData(data1, "3", "c", null);
+ createTabletData(data1, "3", "n", "c");
+ createTabletData(data1, "4", "f", null);
+ createTabletData(data1, "4", null, "f");
+
+ TreeMap<Key,Value> data2 = new TreeMap<Key,Value>(data1);
+
+ createTabletData(data2, "3", null, "n");
+
+ runTest(Arrays.asList(data1, data2), Arrays.asList("3;c", "3;n", "3<", "4;f", "4<"));
+ }
+
+ @Test
+ public void testTableTransition2() {
+ TreeMap<Key,Value> data1 = new TreeMap<Key,Value>();
+
+ createTabletData(data1, "3", "c", null);
+ createTabletData(data1, "3", "n", "c");
+ createTabletData(data1, "3", null, "n");
+ createTabletData(data1, "4", null, "f");
+
+ TreeMap<Key,Value> data2 = new TreeMap<Key,Value>(data1);
+
+ createTabletData(data2, "4", "f", null);
+
+ runTest(Arrays.asList(data1, data2), Arrays.asList("3;c", "3;n", "3<", "4;f", "4<"));
+ }
+
+ @Test
+ public void testMissingFirstTablet() {
+ TreeMap<Key,Value> data1 = new TreeMap<Key,Value>();
+
+ createTabletData(data1, "3", "n", "c");
+ createTabletData(data1, "3", null, "n");
+
+ TreeMap<Key,Value> data2 = new TreeMap<Key,Value>(data1);
+
+ createTabletData(data2, "3", "c", null);
+
+ runTest(Arrays.asList(data1, data2), Arrays.asList("3;c", "3;n", "3<"));
+ }
+
+ @Test
+ public void testMissingLastTablet() {
+ TreeMap<Key,Value> data1 = new TreeMap<Key,Value>();
+
+ createTabletData(data1, "3", "c", null);
+ createTabletData(data1, "3", "n", "c");
+
+ TreeMap<Key,Value> data2 = new TreeMap<Key,Value>(data1);
+
+ createTabletData(data2, "3", null, "n");
+
+ thrown.expect(IllegalStateException.class);
+ runTest(Arrays.asList(data1, data2), Arrays.asList("3;c", "3;n", "3<"));
+ }
+
+ @Test
+ public void testDeletedTable() {
+ TreeMap<Key,Value> data1 = new TreeMap<Key,Value>();
+
+ createTabletData(data1, "3", "c", null);
+ createTabletData(data1, "3", "n", "c");
+ createTabletData(data1, "4", null, "f");
+ createTabletData(data1, "4", "f", null);
+
+ TreeMap<Key,Value> data2 = new TreeMap<Key,Value>();
+ createTabletData(data1, "4", null, "f");
+ createTabletData(data1, "4", "f", null);
+
+ thrown.expect(TabletDeletedException.class);
+ runTest(Arrays.asList(data1, data2), Arrays.asList("3;c", "3;n"));
+ }
+
+ private static class ScannerState {
+
+ public Capture<Range> rangeCapture;
+
+ private Range getRange() {
+ if (rangeCapture.hasCaptured())
+ return rangeCapture.getValue();
+ return null;
+ }
+
+ Predicate<Entry<Key,Value>> getScanPredicate() {
+ final Range range = getRange();
+
+ return new Predicate<Entry<Key,Value>>() {
+ @Override
+ public boolean apply(Entry<Key,Value> input) {
+ if (range != null && !range.contains(input.getKey()))
+ return false;
+
+ return true;
+ }
+ };
+ }
+ }
+
+ private Scanner createMockScanner(final TreeMap<Key,Value> data) {
+
+ final ScannerState state = new ScannerState();
+
+ Scanner scanner = createMock(Scanner.class);
+
+ expect(scanner.iterator()).andAnswer(new IAnswer<Iterator<Entry<Key,Value>>>() {
+ @Override
+ public Iterator<Entry<Key,Value>> answer() throws Throwable {
+ Iterator<Entry<Key,Value>> iter = data.entrySet().iterator();
+ iter = Iterators.filter(iter, state.getScanPredicate());
+ return iter;
+ }
+ }).anyTimes();
+
+ state.rangeCapture = Capture.newInstance();
+
+ scanner.setRange(capture(state.rangeCapture));
+ expectLastCall().anyTimes();
+
+ scanner.fetchColumn(anyObject(Text.class), anyObject(Text.class));
+ expectLastCall().anyTimes();
+
+ scanner.fetchColumnFamily(anyObject(Text.class));
+ expectLastCall().anyTimes();
+
+ replay(scanner);
+
+ return scanner;
+ }
+
+ private void createTabletData(TreeMap<Key,Value> data, String tableId, String endRow,
+ String prevEndRow) {
+ KeyExtent ke = new KeyExtent(tableId, endRow == null ? null : new Text(endRow),
+ prevEndRow == null ? null : new Text(prevEndRow));
+
+ Mutation m = ke.getPrevRowUpdateMutation();
+ MetadataSchema.TabletsSection.ServerColumnFamily.DIRECTORY_COLUMN.put(m, new Value("/d1"));
+
+ for (ColumnUpdate cu : m.getUpdates()) {
+ Key k = new Key(m.getRow(), cu.getColumnFamily(), cu.getColumnQualifier(),
+ cu.getColumnVisibility(), cu.getTimestamp());
+ Value v = new Value(cu.getValue());
+
+ data.put(k, v);
+ }
+ }
+
+ public void runTest(List<TreeMap<Key,Value>> dataSets, List<String> expectedEndRows) {
+ final Iterator<TreeMap<Key,Value>> dataSetIter = dataSets.iterator();
+
+ final TreeMap<Key,Value> data = new TreeMap<Key,Value>(dataSetIter.next());
+
+ Scanner scanner = createMockScanner(data);
+
+ TabletIterator tabIter = new TabletIterator(scanner, TabletsSection.getRange(), true, false) {
+ protected void resetScanner() {
+ data.clear();
+ data.putAll(dataSetIter.next());
+ super.resetScanner();
+ }
+ };
+
+ Iterator<String> expEndRowIter = expectedEndRows.iterator();
+
+ while (tabIter.hasNext()) {
+ String expextedEndRow = expEndRowIter.next();
+ Map<Key,Value> tabEntries = tabIter.next();
+
+ assertFalse(tabEntries.isEmpty());
+
+ for (Key k : tabEntries.keySet()) {
+ assertEquals(expextedEndRow, k.getRowData().toString());
+ }
+ }
+
+ assertFalse(expEndRowIter.hasNext());
+ assertFalse(dataSetIter.hasNext());
+ }
+}