|
| 1 | +/* |
| 2 | + * Licensed to the Apache Software Foundation (ASF) under one |
| 3 | + * or more contributor license agreements. See the NOTICE file |
| 4 | + * distributed with this work for additional information |
| 5 | + * regarding copyright ownership. The ASF licenses this file |
| 6 | + * to you under the Apache License, Version 2.0 (the |
| 7 | + * "License"); you may not use this file except in compliance |
| 8 | + * with the License. You may obtain a copy of the License at |
| 9 | + * |
| 10 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 11 | + * |
| 12 | + * Unless required by applicable law or agreed to in writing, software |
| 13 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 14 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 15 | + * See the License for the specific language governing permissions and |
| 16 | + * limitations under the License. |
| 17 | + */ |
| 18 | + |
| 19 | +package org.apache.cassandra.cql3; |
| 20 | + |
| 21 | +import java.util.ArrayList; |
| 22 | +import java.util.List; |
| 23 | +import java.util.Random; |
| 24 | +import java.util.concurrent.ExecutorService; |
| 25 | +import java.util.concurrent.Executors; |
| 26 | +import java.util.concurrent.Future; |
| 27 | +import java.util.concurrent.TimeUnit; |
| 28 | +import java.util.concurrent.atomic.AtomicBoolean; |
| 29 | +import java.util.concurrent.atomic.AtomicInteger; |
| 30 | + |
| 31 | +import org.junit.After; |
| 32 | +import org.junit.Assert; |
| 33 | +import org.junit.Test; |
| 34 | + |
| 35 | +import org.apache.cassandra.config.DatabaseDescriptor; |
| 36 | +import org.apache.cassandra.db.ColumnFamilyStore; |
| 37 | +import org.hamcrest.Matchers; |
| 38 | + |
| 39 | +import static org.junit.Assert.assertEquals; |
| 40 | +import static org.junit.Assert.assertTrue; |
| 41 | + |
| 42 | +public class EarlyOpenCompactionTest extends CQLTester |
| 43 | +{ |
| 44 | + private static final int NUM_PARTITIONS = 1000; |
| 45 | + private static final int NUM_ROWS_PER_PARTITION = 100; |
| 46 | + private static final int VALUE_SIZE = 1000; // ~1KB per row |
| 47 | + private static final int VERIFICATION_THREADS = 4; |
| 48 | + |
| 49 | + private final AtomicBoolean stopVerification = new AtomicBoolean(false); |
| 50 | + private final AtomicInteger verificationErrors = new AtomicInteger(0); |
| 51 | + private final Random random = new Random(); |
| 52 | + private ExecutorService executor; |
| 53 | + |
| 54 | + @After |
| 55 | + public void cleanupAfter() throws Throwable |
| 56 | + { |
| 57 | + stopVerification.set(true); |
| 58 | + if (executor != null) |
| 59 | + { |
| 60 | + executor.shutdownNow(); |
| 61 | + executor.awaitTermination(1, TimeUnit.MINUTES); |
| 62 | + } |
| 63 | + DatabaseDescriptor.setSSTablePreemptiveOpenIntervalInMB(50); |
| 64 | + } |
| 65 | + |
| 66 | + @Test |
| 67 | + public void testEarlyOpenDuringCompaction() throws Throwable |
| 68 | + { |
| 69 | + // Create a table with a simple schema |
| 70 | + createTable("CREATE TABLE %s (" + |
| 71 | + "pk int, " + |
| 72 | + "ck int, " + |
| 73 | + "data text, " + |
| 74 | + "PRIMARY KEY (pk, ck)" + |
| 75 | + ")"); |
| 76 | + |
| 77 | + ColumnFamilyStore cfs = getCurrentColumnFamilyStore(); |
| 78 | + disableCompaction(); |
| 79 | + |
| 80 | + // Insert data to create multiple SSTables |
| 81 | + System.out.println("Inserting test data..."); |
| 82 | + for (int i = 0; i < NUM_PARTITIONS; i++) |
| 83 | + { |
| 84 | + for (int j = 0; j < NUM_ROWS_PER_PARTITION; j++) |
| 85 | + { |
| 86 | + String value = randomString(VALUE_SIZE); |
| 87 | + execute("INSERT INTO %s (pk, ck, data) VALUES (?, ?, ?)", i, j, value); |
| 88 | + } |
| 89 | + |
| 90 | + // Flush from time to time to get 10 sstables |
| 91 | + if (i > 0 && i % Math.max(1, NUM_PARTITIONS / 10) == 0) |
| 92 | + { |
| 93 | + flush(); |
| 94 | + } |
| 95 | + } |
| 96 | + |
| 97 | + // Final flush to ensure all data is written |
| 98 | + flush(); |
| 99 | + |
| 100 | + // Verify we have multiple SSTables |
| 101 | + int sstableCount = cfs.getLiveSSTables().size(); |
| 102 | + assertTrue("Expected multiple SSTables, got: " + sstableCount, sstableCount > 1); |
| 103 | + |
| 104 | + // Start verification threads |
| 105 | + System.out.println("Starting verification threads..."); |
| 106 | + executor = Executors.newFixedThreadPool(VERIFICATION_THREADS); |
| 107 | + List<Future<?>> futures = new ArrayList<>(); |
| 108 | + |
| 109 | + for (int i = 0; i < VERIFICATION_THREADS; i++) |
| 110 | + { |
| 111 | + futures.add(executor.submit(new VerificationTask())); |
| 112 | + } |
| 113 | + |
| 114 | + // Wait a bit to ensure verification is running |
| 115 | + Thread.sleep(1000); |
| 116 | + |
| 117 | + // Set early open interval to 1MiB to trigger early open during compaction |
| 118 | + int intervalMB = 1; |
| 119 | + System.out.println("Setting early open interval to " + intervalMB + "MiB..."); |
| 120 | + DatabaseDescriptor.setSSTablePreemptiveOpenIntervalInMB(intervalMB); |
| 121 | + // Slow down compaction to give the verifier time to fail. |
| 122 | + DatabaseDescriptor.setCompactionThroughputMbPerSec(10); |
| 123 | + |
| 124 | + // Trigger compaction and await its completion |
| 125 | + System.out.println("Starting compaction..."); |
| 126 | + cfs.enableAutoCompaction(true); |
| 127 | + |
| 128 | + // Let verification run for a while during and after compaction |
| 129 | + System.out.println("Verifying data during and after compaction..."); |
| 130 | + Thread.sleep(1000); |
| 131 | + |
| 132 | + // Stop verification |
| 133 | + stopVerification.set(true); |
| 134 | + |
| 135 | + // Wait for verification to complete |
| 136 | + for (Future<?> future : futures) |
| 137 | + { |
| 138 | + try |
| 139 | + { |
| 140 | + future.get(10, TimeUnit.SECONDS); |
| 141 | + } |
| 142 | + catch (Exception e) |
| 143 | + { |
| 144 | + System.err.println("Verification task failed: " + e); |
| 145 | + e.printStackTrace(); |
| 146 | + } |
| 147 | + } |
| 148 | + |
| 149 | + // Verify no errors occurred during verification |
| 150 | + int errors = verificationErrors.get(); |
| 151 | + assertEquals("Found " + errors + " verification errors. Check logs for details.", 0, errors); |
| 152 | + |
| 153 | + System.out.println("Test completed successfully"); |
| 154 | + } |
| 155 | + |
| 156 | + private class VerificationTask implements Runnable |
| 157 | + { |
| 158 | + @Override |
| 159 | + public void run() |
| 160 | + { |
| 161 | + try |
| 162 | + { |
| 163 | + Random localRandom = new Random(Thread.currentThread().getId()); |
| 164 | + |
| 165 | + while (!stopVerification.get() && !Thread.currentThread().isInterrupted()) |
| 166 | + { |
| 167 | + // Randomly choose between point query and partition range query |
| 168 | + if (localRandom.nextBoolean()) |
| 169 | + { |
| 170 | + // Point query |
| 171 | + int pk = localRandom.nextInt(NUM_PARTITIONS * 110 / 100); // 10% chance outside |
| 172 | + int ck = localRandom.nextInt(NUM_ROWS_PER_PARTITION * 110 / 100); // 10% chance outside |
| 173 | + |
| 174 | + try |
| 175 | + { |
| 176 | + Assert.assertEquals(pk < NUM_PARTITIONS && ck < NUM_ROWS_PER_PARTITION ? 1 : 0, |
| 177 | + execute("SELECT data FROM %s WHERE pk = ? AND ck = ?", pk, ck).size()); |
| 178 | + } |
| 179 | + catch (Throwable t) |
| 180 | + { |
| 181 | + verificationErrors.incrementAndGet(); |
| 182 | + System.err.println("Point query failed for pk=" + pk + ", ck=" + ck + ": " + t); |
| 183 | + t.printStackTrace(); |
| 184 | + } |
| 185 | + } |
| 186 | + else |
| 187 | + { |
| 188 | + // Partition range query |
| 189 | + int pk = localRandom.nextInt(NUM_PARTITIONS); |
| 190 | + |
| 191 | + try |
| 192 | + { |
| 193 | + Assert.assertThat(execute("SELECT data FROM %s WHERE token(pk) <= token(?) AND token(pk) >= token(?)", pk, pk).size(), |
| 194 | + Matchers.greaterThanOrEqualTo(NUM_ROWS_PER_PARTITION)); |
| 195 | + } |
| 196 | + catch (Throwable t) |
| 197 | + { |
| 198 | + verificationErrors.incrementAndGet(); |
| 199 | + System.err.println("Range query failed for pk in (" + pk + ", " + (pk + 1) + ", " + (pk + 2) + "): " + t); |
| 200 | + t.printStackTrace(); |
| 201 | + } |
| 202 | + } |
| 203 | + |
| 204 | + // Add a small delay to prevent overwhelming the system |
| 205 | + Thread.yield(); |
| 206 | + } |
| 207 | + } |
| 208 | + catch (Throwable t) |
| 209 | + { |
| 210 | + verificationErrors.incrementAndGet(); |
| 211 | + System.err.println("Verification task failed: " + t); |
| 212 | + t.printStackTrace(); |
| 213 | + } |
| 214 | + } |
| 215 | + } |
| 216 | + |
| 217 | + private String randomString(int length) |
| 218 | + { |
| 219 | + StringBuilder sb = new StringBuilder(length); |
| 220 | + for (int i = 0; i < length; i++) |
| 221 | + { |
| 222 | + sb.append((char)('a' + random.nextInt(26))); |
| 223 | + } |
| 224 | + return sb.toString(); |
| 225 | + } |
| 226 | +} |
0 commit comments