-
Notifications
You must be signed in to change notification settings - Fork 3.4k
HBASE-30038: RefCnt Leak error when caching #7995
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
dParikesit
wants to merge
2
commits into
apache:master
Choose a base branch
from
dParikesit:5-RefCnt-release
base: master
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
+117
−7
Open
Changes from all commits
Commits
Show all changes
2 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
|
|
@@ -216,6 +216,60 @@ public void onLeak(String s, String s1) { | |
| assertEquals(0, counter.get()); | ||
| } | ||
|
|
||
| @Test | ||
| public void testIntermediateIndexCacheOnWriteDoesNotLeak() throws Exception { | ||
| Configuration localConf = new Configuration(TEST_UTIL.getConfiguration()); | ||
| localConf.setInt(HFile.FORMAT_VERSION_KEY, HFile.MAX_FORMAT_VERSION); | ||
| localConf.setBoolean(CacheConfig.CACHE_INDEX_BLOCKS_ON_WRITE_KEY, true); | ||
| localConf.setInt(ByteBuffAllocator.BUFFER_SIZE_KEY, 4096); | ||
| localConf.setInt(ByteBuffAllocator.MAX_BUFFER_COUNT_KEY, 32); | ||
| localConf.setInt(ByteBuffAllocator.MIN_ALLOCATE_SIZE_KEY, 0); | ||
| ByteBuffAllocator allocator = ByteBuffAllocator.create(localConf, true); | ||
| List<ByteBuff> buffers = new ArrayList<>(); | ||
| for (int i = 0; i < allocator.getTotalBufferCount(); i++) { | ||
| buffers.add(allocator.allocateOneBuffer()); | ||
| assertEquals(0, allocator.getFreeBufferCount()); | ||
| } | ||
| buffers.forEach(ByteBuff::release); | ||
| assertEquals(allocator.getTotalBufferCount(), allocator.getFreeBufferCount()); | ||
| ResourceLeakDetector.setLevel(ResourceLeakDetector.Level.PARANOID); | ||
| final AtomicInteger counter = new AtomicInteger(); | ||
| RefCnt.detector.setLeakListener(new ResourceLeakDetector.LeakListener() { | ||
| @Override | ||
| public void onLeak(String s, String s1) { | ||
| counter.incrementAndGet(); | ||
| } | ||
| }); | ||
|
|
||
| Path localPath = new Path(TEST_UTIL.getDataTestDir(), | ||
| "block_index_testIntermediateIndexCacheOnWriteDoesNotLeak_" + compr); | ||
| HFileContext meta = new HFileContextBuilder().withHBaseCheckSum(true) | ||
| .withIncludesMvcc(includesMemstoreTS).withIncludesTags(true).withCompression(compr) | ||
| .withBytesPerCheckSum(HFile.DEFAULT_BYTES_PER_CHECKSUM).build(); | ||
| HFileBlock.Writer hbw = new HFileBlock.Writer(localConf, null, meta, allocator, | ||
| meta.getBlocksize()); | ||
| FSDataOutputStream outputStream = fs.create(localPath); | ||
| LruBlockCache cache = new LruBlockCache(8 * 1024 * 1024, 1024, true, localConf); | ||
| CacheConfig cacheConfig = new CacheConfig(localConf, null, cache, allocator); | ||
| HFileBlockIndex.BlockIndexWriter biw = | ||
| new HFileBlockIndex.BlockIndexWriter(hbw, cacheConfig, localPath.getName(), null); | ||
| biw.setMaxChunkSize(512); | ||
|
|
||
| try { | ||
| writeDataBlocksAndCreateIndex(hbw, outputStream, biw); | ||
| assertTrue(biw.getNumLevels() >= 3); | ||
| System.gc(); | ||
| Thread.sleep(1000); | ||
|
Contributor
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. @dParikesit |
||
| allocator.allocate(128 * 1024).release(); | ||
| assertEquals(0, counter.get()); | ||
| } finally { | ||
| hbw.release(); | ||
| cache.shutdown(); | ||
| allocator.clean(); | ||
| fs.delete(localPath, false); | ||
| } | ||
| } | ||
|
|
||
| private void clear() throws IOException { | ||
| keys.clear(); | ||
| firstKeyInFile = null; | ||
|
|
||
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@dParikesit
I think the 1-second assumption might bite us on slower systems and make the test flaky.
What if we wrap this in a loop instead? We could retry up to 15 times with a small delay—that way it succeeds as soon as it's ready rather than relying on luck.