Bug 307405 [CommonNavigator] Deadlock in NavigatorContentServiceContentProvider
We are using an adopting product and one of our users encountered this deadlock when starting up their workspace: 1LKDEADLOCK Deadlock detected !!! NULL --------------------- NULL 2LKDEADLOCKTHR Thread "main" (0x41591300) 3LKDEADLOCKWTR is waiting for: 4LKDEADLOCKMON sys_mon_t:0x43134548 infl_mon_t: 0x43134580: 4LKDEADLOCKOBJ org/eclipse/ui/internal/navigator/NavigatorSaveablesService@0x05DB48A8/0x05DB48B4: 3LKDEADLOCKOWN which is owned by: 2LKDEADLOCKTHR Thread "Framework Event Dispatcher" (0x42467700) 3LKDEADLOCKWTR which is waiting for: 4LKDEADLOCKMON sys_mon_t:0x43BA6AB8 infl_mon_t: 0x43BA6AF0: 4LKDEADLOCKOBJ org/eclipse/ui/internal/navigator/NavigatorContentServiceContentProvider@0x0306F6E8/0x0306F6F4: 3LKDEADLOCKOWN which is owned by: 2LKDEADLOCKTHR Thread "main" (0x41591300) I will attach the stack trace.
bundles/org.eclipse.ui.navigator/src/org/eclipse/ui/internal/navigator/NavigatorContentService.java
* INavigatorContentService ({@link #getViewerId() }). See
	 * {@link #createCommonContentProvider() } for more information about how
	 * content providers are located for the root of the viewer. The root
	 * content providers are calculated once. If a new element is supplied, a
	 * client must call {@link #update() } prior in order to reset the calculated
	 * root providers.
	 * </p>
	 * 
	 * @param anElement
	 *            An element from the tree (generally the input of the viewer)
	 * @return The set of content providers that can provide root elements for a
	 *         viewer.
	 */
	public ITreeContentProvider[] findRootContentProviders(Object anElement) {
		if (rootContentProviders != null) {
			return rootContentProviders;
		}
		synchronized (this) {
			if (rootContentProviders == null) {
				rootContentProviders = extractContentProviders(findRootContentExtensions(anElement));
			}
		}
		return rootContentProviders;
	}
	
	/**
	 * Returns the list of extensions that should be considered as possible
	 * contributors of CNF artifacts (labels, sorters, ...). The algorithm
	 * first considers the source of contribution and its overrides, and then
	 * any possibleChildren and their overrides in order.