We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Build dominator tree cost too much time in some bad case
I can provide a hprof file, and build as below
heapDumpFile.openHeapGraph().use { graph -> val heapAnalyzer = HeapAnalyzer(OnAnalysisProgressListener.NO_OP) val weakAndFinalizerRefs = EnumSet.of(REFERENCES, FINALIZER_WATCHDOG_DAEMON) val ignoredRefs = ReferenceMatcher.fromListBuilders(weakAndFinalizerRefs).map { matcher -> matcher as IgnoredReferenceMatcher } val dominatorTree = ObjectDominators().buildDominatorTree(graph, ignoredRefs) }
Expected behavior: [finish in few minutes]
In fact, it takes hundreds of minutes
Any additional information, configuration or data that might be necessary to reproduce the issue.
The text was updated successfully, but these errors were encountered:
Here is the hprof file download link
Sorry, something went wrong.
No branches or pull requests
Description
Build dominator tree cost too much time in some bad case
Steps to Reproduce
I can provide a hprof file, and build as below
Expected behavior: [finish in few minutes]
In fact, it takes hundreds of minutes
Version Information
Additional Information
Any additional information, configuration or data that might be necessary to reproduce the issue.
The text was updated successfully, but these errors were encountered: