org.apache.felix.framework.resolver.Candidates Maven / Gradle / Ivy
/*
* 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.felix.framework.resolver;
import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Set;
import java.util.TreeMap;
import org.apache.felix.framework.ResolveContextImpl;
import org.apache.felix.framework.util.FelixConstants;
import org.apache.felix.framework.util.Util;
import org.apache.felix.framework.wiring.BundleCapabilityImpl;
import org.apache.felix.framework.wiring.BundleRequirementImpl;
import org.osgi.framework.Constants;
import org.osgi.framework.Version;
import org.osgi.framework.wiring.BundleCapability;
import org.osgi.framework.wiring.BundleRequirement;
import org.osgi.framework.wiring.BundleRevision;
import org.osgi.framework.wiring.BundleWire;
import org.osgi.framework.wiring.BundleWiring;
class Candidates
{
public static final int MANDATORY = 0;
public static final int OPTIONAL = 1;
public static final int ON_DEMAND = 2;
private final Set m_mandatoryRevisions;
// Maps a capability to requirements that match it.
private final Map> m_dependentMap;
// Maps a requirement to the capability it matches.
private final Map> m_candidateMap;
// Maps a bundle revision to its associated wrapped revision; this only happens
// when a revision being resolved has fragments to attach to it.
private final Map m_allWrappedHosts;
// Map used when populating candidates to hold intermediate and final results.
private final Map m_populateResultCache;
// Flag to signal if fragments are present in the candidate map.
private boolean m_fragmentsPresent = false;
/**
* Private copy constructor used by the copy() method.
* @param dependentMap the capability dependency map.
* @param candidateMap the requirement candidate map.
* @param hostFragments the fragment map.
* @param wrappedHosts the wrapped hosts map.
**/
private Candidates(
Set mandatoryRevisions,
Map> dependentMap,
Map> candidateMap,
Map wrappedHosts, Map populateResultCache,
boolean fragmentsPresent)
{
m_mandatoryRevisions = mandatoryRevisions;
m_dependentMap = dependentMap;
m_candidateMap = candidateMap;
m_allWrappedHosts = wrappedHosts;
m_populateResultCache = populateResultCache;
m_fragmentsPresent = fragmentsPresent;
}
/**
* Constructs an empty Candidates object.
**/
public Candidates()
{
m_mandatoryRevisions = new HashSet();
m_dependentMap = new HashMap>();
m_candidateMap = new HashMap>();
m_allWrappedHosts = new HashMap();
m_populateResultCache = new HashMap();
}
/**
* Populates candidates for the specified revision. How a revision is
* resolved depends on its resolution type as follows:
*
* - MANDATORY - must resolve and failure to do so throws
* an exception.
* - OPTIONAL - attempt to resolve, but no exception is thrown
* if the resolve fails.
* - ON_DEMAND - only resolve on demand; this only applies to
* fragments and will only resolve a fragment if its host is already
* selected as a candidate.
*
* @param state the resolver state used for populating the candidates.
* @param revision the revision whose candidates should be populated.
* @param resolution indicates the resolution type.
*/
public final void populate(
ResolveContext rc, BundleRevision revision, int resolution)
{
// Get the current result cache value, to make sure the revision
// hasn't already been populated.
Object cacheValue = m_populateResultCache.get(revision);
// Has been unsuccessfully populated.
if (cacheValue instanceof ResolveException)
{
return;
}
// Has been successfully populated.
else if (cacheValue instanceof Boolean)
{
return;
}
// We will always attempt to populate fragments, since this is necessary
// for ondemand attaching of fragment. However, we'll only attempt to
// populate optional non-fragment revisions if they aren't already
// resolved.
boolean isFragment = Util.isFragment(revision);
if (!isFragment && (revision.getWiring() != null))
{
return;
}
// Always attempt to populate mandatory or optional revisions.
// However, for on-demand fragments only populate if their host
// is already populated.
if ((resolution != ON_DEMAND)
|| (isFragment && populateFragmentOndemand(rc, revision)))
{
if (resolution == MANDATORY)
{
m_mandatoryRevisions.add(revision);
}
try
{
// Try to populate candidates for the optional revision.
populateRevision(rc, revision);
}
catch (ResolveException ex)
{
// Only throw an exception if resolution is mandatory.
if (resolution == MANDATORY)
{
throw ex;
}
}
}
}
/**
* Populates candidates for the specified revision.
* @param state the resolver state used for populating the candidates.
* @param revision the revision whose candidates should be populated.
*/
// TODO: FELIX3 - Modify to not be recursive.
private void populateRevision(ResolveContext rc, BundleRevision revision)
{
// Determine if we've already calculated this revision's candidates.
// The result cache will have one of three values:
// 1. A resolve exception if we've already attempted to populate the
// revision's candidates but were unsuccessful.
// 2. Boolean.TRUE indicating we've already attempted to populate the
// revision's candidates and were successful.
// 3. An array containing the cycle count, current map of candidates
// for already processed requirements, and a list of remaining
// requirements whose candidates still need to be calculated.
// For case 1, rethrow the exception. For case 2, simply return immediately.
// For case 3, this means we have a cycle so we should continue to populate
// the candidates where we left off and not record any results globally
// until we've popped completely out of the cycle.
// Keeps track of the number of times we've reentered this method
// for the current revision.
Integer cycleCount = null;
// Keeps track of the candidates we've already calculated for the
// current revision's requirements.
Map> localCandidateMap = null;
// Keeps track of the current revision's requirements for which we
// haven't yet found candidates.
List remainingReqs = null;
// Get the cache value for the current revision.
Object cacheValue = m_populateResultCache.get(revision);
// This is case 1.
if (cacheValue instanceof ResolveException)
{
throw (ResolveException) cacheValue;
}
// This is case 2.
else if (cacheValue instanceof Boolean)
{
return;
}
// This is case 3.
else if (cacheValue != null)
{
// Increment and get the cycle count.
cycleCount = (Integer)
(((Object[]) cacheValue)[0]
= new Integer(((Integer) ((Object[]) cacheValue)[0]).intValue() + 1));
// Get the already populated candidates.
localCandidateMap = (Map) ((Object[]) cacheValue)[1];
// Get the remaining requirements.
remainingReqs = (List) ((Object[]) cacheValue)[2];
}
// If there is no cache value for the current revision, then this is
// the first time we are attempting to populate its candidates, so
// do some one-time checks and initialization.
if ((remainingReqs == null) && (localCandidateMap == null))
{
// Verify that any native libraries match the current platform.
((ResolveContextImpl) rc).checkNativeLibraries(revision);
// Record cycle count.
cycleCount = new Integer(0);
// Create a local map for populating candidates first, just in case
// the revision is not resolvable.
localCandidateMap = new HashMap();
// Create a modifiable list of the revision's requirements.
remainingReqs = new ArrayList(revision.getDeclaredRequirements(null));
// Add these value to the result cache so we know we are
// in the middle of populating candidates for the current
// revision.
m_populateResultCache.put(revision,
cacheValue = new Object[] { cycleCount, localCandidateMap, remainingReqs });
}
// If we have requirements remaining, then find candidates for them.
while (!remainingReqs.isEmpty())
{
BundleRequirement req = remainingReqs.remove(0);
// Ignore non-effective and dynamic requirements.
String resolution = req.getDirectives().get(Constants.RESOLUTION_DIRECTIVE);
if (!rc.isEffective(req)
|| ((resolution != null)
&& resolution.equals(FelixConstants.RESOLUTION_DYNAMIC)))
{
continue;
}
// Process the candidates, removing any candidates that
// cannot resolve.
List candidates = rc.findProviders(req, true);
ResolveException rethrow = processCandidates(rc, revision, candidates);
// First, due to cycles, makes sure we haven't already failed in
// a deeper recursion.
Object result = m_populateResultCache.get(revision);
if (result instanceof ResolveException)
{
throw (ResolveException) result;
}
// Next, if are no candidates remaining and the requirement is not
// not optional, then record and throw a resolve exception.
else if (candidates.isEmpty() && !((BundleRequirementImpl) req).isOptional())
{
String msg = "Unable to resolve " + revision
+ ": missing requirement " + req;
if (rethrow != null)
{
msg = msg + " [caused by: " + rethrow.getMessage() + "]";
}
rethrow = new ResolveException(msg, revision, req);
m_populateResultCache.put(revision, rethrow);
throw rethrow;
}
// Otherwise, if we actually have candidates for the requirement, then
// add them to the local candidate map.
else if (candidates.size() > 0)
{
localCandidateMap.put(req, candidates);
}
}
// If we are exiting from a cycle then decrement
// cycle counter, otherwise record the result.
if (cycleCount.intValue() > 0)
{
((Object[]) cacheValue)[0] = new Integer(cycleCount.intValue() - 1);
}
else if (cycleCount.intValue() == 0)
{
// Record that the revision was successfully populated.
m_populateResultCache.put(revision, Boolean.TRUE);
// Merge local candidate map into global candidate map.
if (localCandidateMap.size() > 0)
{
add(localCandidateMap);
}
}
}
private boolean populateFragmentOndemand(ResolveContext rc, BundleRevision revision)
throws ResolveException
{
// Create a modifiable list of the revision's requirements.
List remainingReqs =
new ArrayList(revision.getDeclaredRequirements(null));
// Find the host requirement.
BundleRequirement hostReq = null;
for (Iterator it = remainingReqs.iterator();
it.hasNext(); )
{
BundleRequirement r = it.next();
if (r.getNamespace().equals(BundleRevision.HOST_NAMESPACE))
{
hostReq = r;
it.remove();
break;
}
}
// Get candidates hosts and keep any that have been populated.
List hosts = rc.findProviders(hostReq, false);
for (Iterator it = hosts.iterator(); it.hasNext(); )
{
BundleCapability host = it.next();
if (!isPopulated(host.getRevision()))
{
it.remove();
}
}
// If there aren't any populated hosts, then we can just
// return since this fragment isn't needed.
if (hosts.isEmpty())
{
return false;
}
// If there are populates host candidates, then finish up
// some other checks and prepopulate the result cache with
// the work we've done so far.
// Verify that any native libraries match the current platform.
((ResolveContextImpl) rc).checkNativeLibraries(revision);
// Record cycle count, but start at -1 since it will
// be incremented again in populate().
Integer cycleCount = new Integer(-1);
// Create a local map for populating candidates first, just in case
// the revision is not resolvable.
Map> localCandidateMap =
new HashMap>();
// Add the discovered host candidates to the local candidate map.
localCandidateMap.put(hostReq, hosts);
// Add these value to the result cache so we know we are
// in the middle of populating candidates for the current
// revision.
m_populateResultCache.put(revision,
new Object[] { cycleCount, localCandidateMap, remainingReqs });
return true;
}
public void populateDynamic(
ResolveContext rc, BundleRevision revision,
BundleRequirement req, List candidates)
{
// Record the revision associated with the dynamic require
// as a mandatory revision.
m_mandatoryRevisions.add(revision);
// Add the dynamic imports candidates.
add(req, candidates);
// Process the candidates, removing any candidates that
// cannot resolve.
ResolveException rethrow = processCandidates(rc, revision, candidates);
if (candidates.isEmpty())
{
if (rethrow == null)
{
rethrow = new ResolveException("Dynamic import failed.", revision, req);
}
throw rethrow;
}
m_populateResultCache.put(revision, Boolean.TRUE);
}
/**
* This method performs common processing on the given set of candidates.
* Specifically, it removes any candidates which cannot resolve and it
* synthesizes candidates for any candidates coming from any attached
* fragments, since fragment capabilities only appear once, but technically
* each host represents a unique capability.
* @param state the resolver state.
* @param revision the revision being resolved.
* @param candidates the candidates to process.
* @return a resolve exception to be re-thrown, if any, or null.
*/
private ResolveException processCandidates(
ResolveContext rc,
BundleRevision revision,
List candidates)
{
// Get satisfying candidates and populate their candidates if necessary.
ResolveException rethrow = null;
Set fragmentCands = null;
for (Iterator itCandCap = candidates.iterator();
itCandCap.hasNext(); )
{
BundleCapability candCap = itCandCap.next();
boolean isFragment = Util.isFragment(candCap.getRevision());
// If the capability is from a fragment, then record it
// because we have to insert associated host capabilities
// if the fragment is already attached to any hosts.
if (isFragment)
{
if (fragmentCands == null)
{
fragmentCands = new HashSet();
}
fragmentCands.add(candCap);
}
// If the candidate revision is a fragment, then always attempt
// to populate candidates for its dependency, since it must be
// attached to a host to be used. Otherwise, if the candidate
// revision is not already resolved and is not the current version
// we are trying to populate, then populate the candidates for
// its dependencies as well.
// NOTE: Technically, we don't have to check to see if the
// candidate revision is equal to the current revision, but this
// saves us from recursing and also simplifies exceptions messages
// since we effectively chain exception messages for each level
// of recursion; thus, any avoided recursion results in fewer
// exceptions to chain when an error does occur.
if ((isFragment || (candCap.getRevision().getWiring() == null))
&& !candCap.getRevision().equals(revision))
{
try
{
populateRevision(rc, candCap.getRevision());
}
catch (ResolveException ex)
{
if (rethrow == null)
{
rethrow = ex;
}
// Remove the candidate since we weren't able to
// populate its candidates.
itCandCap.remove();
}
}
}
// If any of the candidates for the requirement were from a fragment,
// then also insert synthesized hosted capabilities for any other host
// to which the fragment is attached since they are all effectively
// unique capabilities.
if (fragmentCands != null)
{
for (BundleCapability fragCand : fragmentCands)
{
// Only necessary for resolved fragments.
BundleWiring wiring = fragCand.getRevision().getWiring();
if (wiring != null)
{
// Fragments only have host wire, so each wire represents
// an attached host.
for (BundleWire wire : wiring.getRequiredWires(null))
{
// If the capability is a package, then make sure the
// host actually provides it in its resolved capabilities,
// since it may be a substitutable export.
if (!fragCand.getNamespace().equals(BundleRevision.PACKAGE_NAMESPACE)
|| wire.getProviderWiring().getCapabilities(null).contains(fragCand))
{
// Note that we can just add this as a candidate
// directly, since we know it is already resolved.
// NOTE: We are synthesizing a hosted capability here,
// but we are not using a ShadowList like we do when
// we synthesizing capabilities for unresolved hosts.
// It is not necessary to use the ShadowList here since
// the host is resolved, because in that case we can
// calculate the proper package space by traversing
// the wiring. In the unresolved case, this isn't possible
// so we need to use the ShadowList so we can keep
// a reference to a synthesized resource with attached
// fragments so we can correctly calculate its package
// space.
rc.insertHostedCapability(candidates,
new WrappedCapability(
wire.getCapability().getRevision(),
(BundleCapabilityImpl) fragCand));
}
}
}
}
}
return rethrow;
}
public boolean isPopulated(BundleRevision revision)
{
Object value = m_populateResultCache.get(revision);
return ((value != null) && (value instanceof Boolean));
}
public ResolveException getResolveException(BundleRevision revision)
{
Object value = m_populateResultCache.get(revision);
return ((value != null) && (value instanceof ResolveException))
? (ResolveException) value : null;
}
/**
* Adds a requirement and its matching candidates to the internal data
* structure. This method assumes it owns the data being passed in and
* does not make a copy. It takes the data and processes, such as calculating
* which requirements depend on which capabilities and recording any fragments
* it finds for future merging.
* @param req the requirement to add.
* @param candidates the candidates matching the requirement.
**/
private void add(BundleRequirement req, List candidates)
{
if (req.getNamespace().equals(BundleRevision.HOST_NAMESPACE))
{
m_fragmentsPresent = true;
}
// Record the candidates.
m_candidateMap.put(req, candidates);
}
/**
* Adds requirements and candidates in bulk. The outer map is not retained
* by this method, but the inner data structures are, so they should not
* be further modified by the caller.
* @param candidates the bulk requirements and candidates to add.
**/
private void add(Map> candidates)
{
for (Entry> entry : candidates.entrySet())
{
add(entry.getKey(), entry.getValue());
}
}
/**
* Returns the wrapped module associated with the given module. If the module
* was not wrapped, then the module itself is returned. This is really only
* needed to determine if the root modules of the resolve have been wrapped.
* @param m the module whose wrapper is desired.
* @return the wrapper module or the module itself if it was not wrapped.
**/
public BundleRevision getWrappedHost(BundleRevision m)
{
BundleRevision wrapped = m_allWrappedHosts.get(m);
return (wrapped == null) ? m : wrapped;
}
/**
* Gets the candidates associated with a given requirement.
* @param req the requirement whose candidates are desired.
* @return the matching candidates or null.
**/
public List getCandidates(BundleRequirement req)
{
return m_candidateMap.get(req);
}
/**
* Merges fragments into their hosts. It does this by wrapping all host
* modules and attaching their selected fragments, removing all unselected
* fragment modules, and replacing all occurrences of the original fragments
* in the internal data structures with the wrapped host modules instead.
* Thus, fragment capabilities and requirements are merged into the appropriate
* host and the candidates for the fragment now become candidates for the host.
* Likewise, any module depending on a fragment now depend on the host. Note
* that this process is sort of like multiplication, since one fragment that
* can attach to two hosts effectively gets multiplied across the two hosts.
* So, any modules being satisfied by the fragment will end up having the
* two hosts as potential candidates, rather than the single fragment.
* @param existingSingletons existing resolved singletons.
* @throws ResolveException if the removal of any unselected fragments result
* in the root module being unable to resolve.
**/
public void prepare(ResolveContext rc)
{
// Maps a host capability to a map containing its potential fragments;
// the fragment map maps a fragment symbolic name to a map that maps
// a version to a list of fragments requirements matching that symbolic
// name and version.
Map>>>
hostFragments = Collections.EMPTY_MAP;
if (m_fragmentsPresent)
{
hostFragments = populateDependents();
}
// This method performs the following steps:
// 1. Select the fragments to attach to a given host.
// 2. Wrap hosts and attach fragments.
// 3. Remove any unselected fragments. This is necessary because
// other revisions may depend on the capabilities of unselected
// fragments, so we need to remove the unselected fragments and
// any revisions that depends on them, which could ultimately cause
// the entire resolve to fail.
// 4. Replace all fragments with any host it was merged into
// (effectively multiplying it).
// * This includes setting candidates for attached fragment
// requirements as well as replacing fragment capabilities
// with host's attached fragment capabilities.
// Steps 1 and 2
List hostRevisions = new ArrayList();
List unselectedFragments = new ArrayList();
for (Entry>>>
hostEntry : hostFragments.entrySet())
{
// Step 1
BundleCapability hostCap = hostEntry.getKey();
Map>> fragments
= hostEntry.getValue();
List selectedFragments = new ArrayList();
for (Entry>> fragEntry
: fragments.entrySet())
{
boolean isFirst = true;
for (Entry> versionEntry
: fragEntry.getValue().entrySet())
{
for (BundleRequirement hostReq : versionEntry.getValue())
{
// Selecting the first fragment in each entry, which
// is equivalent to selecting the highest version of
// each fragment with a given symbolic name.
if (isFirst)
{
selectedFragments.add(hostReq.getRevision());
isFirst = false;
}
// For any fragment that wasn't selected, remove the
// current host as a potential host for it and remove it
// as a dependent on the host. If there are no more
// potential hosts for the fragment, then mark it as
// unselected for later removal.
else
{
m_dependentMap.get(hostCap).remove(hostReq);
List hosts = m_candidateMap.get(hostReq);
hosts.remove(hostCap);
if (hosts.isEmpty())
{
unselectedFragments.add(hostReq.getRevision());
}
}
}
}
}
// Step 2
WrappedRevision wrappedHost =
new WrappedRevision(hostCap.getRevision(), selectedFragments);
hostRevisions.add(wrappedHost);
m_allWrappedHosts.put(hostCap.getRevision(), wrappedHost);
}
// Step 3
for (BundleRevision br : unselectedFragments)
{
removeRevision(br,
new ResolveException(
"Fragment was not selected for attachment.", br, null));
}
// Step 4
for (WrappedRevision hostRevision : hostRevisions)
{
// Replaces capabilities from fragments with the capabilities
// from the merged host.
for (BundleCapability c : hostRevision.getDeclaredCapabilities(null))
{
// Don't replace the host capability, since the fragment will
// really be attached to the original host, not the wrapper.
if (!c.getNamespace().equals(BundleRevision.HOST_NAMESPACE))
{
BundleCapability origCap = ((HostedCapability) c).getDeclaredCapability();
// Note that you might think we could remove the original cap
// from the dependent map, but you can't since it may come from
// a fragment that is attached to multiple hosts, so each host
// will need to make their own copy.
Set dependents = m_dependentMap.get(origCap);
if (dependents != null)
{
dependents = new HashSet(dependents);
m_dependentMap.put(c, dependents);
for (BundleRequirement r : dependents)
{
// We have synthesized hosted capabilities for all
// fragments that have been attached to hosts by
// wrapping the host bundle and their attached
// fragments. We need to use the ResolveContext to
// determine the proper priority order for hosted
// capabilities since the order may depend on the
// declaring host/fragment combination. However,
// internally we completely wrap the host revision
// and make all capabilities/requirements point back
// to the wrapped host not the declaring host. The
// ResolveContext expects HostedCapabilities to point
// to the declaring revision, so we need two separate
// candidate lists: one for the ResolveContext with
// HostedCapabilities pointing back to the declaring
// host and one for the resolver with HostedCapabilities
// pointing back to the wrapped host. We ask the
// ResolveContext to insert its appropriate HostedCapability
// into its list, then we mirror the insert into a
// shadow list with the resolver's HostedCapability.
// We only need to ask the ResolveContext to find
// the insert position for fragment caps since these
// were synthesized and we don't know their priority.
// However, in the resolver's candidate list we need
// to replace all caps with the wrapped caps, no
// matter if they come from the host or fragment,
// since we are completing replacing the declaring
// host and fragments with the wrapped host.
List cands = m_candidateMap.get(r);
if (!(cands instanceof ShadowList))
{
ShadowList shadow =
new ShadowList(cands);
m_candidateMap.put(r, shadow);
cands = shadow;
}
// If the original capability is from a fragment, then
// ask the ResolveContext to insert it and update the
// shadow copy of the list accordingly.
if (!origCap.getRevision().equals(hostRevision.getHost()))
{
List original = ((ShadowList) cands).getOriginal();
int removeIdx = original.indexOf(origCap);
original.remove(removeIdx);
int insertIdx = rc.insertHostedCapability(
original,
new SimpleHostedCapability(hostRevision.getHost(), origCap));
cands.remove(removeIdx);
cands.add(insertIdx, c);
}
// If the original capability is from the host, then
// we just need to replace it in the shadow list.
else
{
int idx = cands.indexOf(origCap);
cands.set(idx, c);
}
}
}
}
}
// Copy candidates for fragment requirements to the host.
for (BundleRequirement r : hostRevision.getDeclaredRequirements(null))
{
BundleRequirement origReq =
((WrappedRequirement) r).getOriginalRequirement();
List cands = m_candidateMap.get(origReq);
if (cands != null)
{
m_candidateMap.put(r, new ArrayList(cands));
for (BundleCapability cand : cands)
{
Set dependents = m_dependentMap.get(cand);
dependents.remove(origReq);
dependents.add(r);
}
}
}
}
// Lastly, verify that all mandatory revisions are still
// populated, since some might have become unresolved after
// selecting fragments/singletons.
for (BundleRevision br : m_mandatoryRevisions)
{
if (!isPopulated(br))
{
throw getResolveException(br);
}
}
}
// Maps a host capability to a map containing its potential fragments;
// the fragment map maps a fragment symbolic name to a map that maps
// a version to a list of fragments requirements matching that symbolic
// name and version.
private Map>>> populateDependents()
{
Map>>>
hostFragments = new HashMap>>>();
for (Entry> entry : m_candidateMap.entrySet())
{
BundleRequirement req = entry.getKey();
List caps = entry.getValue();
for (BundleCapability cap : caps)
{
// Record the requirement as dependent on the capability.
Set dependents = m_dependentMap.get(cap);
if (dependents == null)
{
dependents = new HashSet();
m_dependentMap.put(cap, dependents);
}
dependents.add(req);
// Keep track of hosts and associated fragments.
if (req.getNamespace().equals(BundleRevision.HOST_NAMESPACE))
{
Map>>
fragments = hostFragments.get(cap);
if (fragments == null)
{
fragments = new HashMap>>();
hostFragments.put(cap, fragments);
}
Map> fragmentVersions =
fragments.get(req.getRevision().getSymbolicName());
if (fragmentVersions == null)
{
fragmentVersions =
new TreeMap>(Collections.reverseOrder());
fragments.put(req.getRevision().getSymbolicName(), fragmentVersions);
}
List actual = fragmentVersions.get(req.getRevision().getVersion());
if (actual == null)
{
actual = new ArrayList();
fragmentVersions.put(req.getRevision().getVersion(), actual);
}
actual.add(req);
}
}
}
return hostFragments;
}
/**
* Removes a module from the internal data structures if it wasn't selected
* as a fragment or a singleton. This process may cause other modules to
* become unresolved if they depended on the module's capabilities and there
* is no other candidate.
* @param revision the module to remove.
* @throws ResolveException if removing the module caused the resolve to fail.
**/
private void removeRevision(BundleRevision revision, ResolveException ex)
{
// Add removal reason to result cache.
m_populateResultCache.put(revision, ex);
// Remove from dependents.
Set unresolvedRevisions = new HashSet();
remove(revision, unresolvedRevisions);
// Remove dependents that failed as a result of removing revision.
while (!unresolvedRevisions.isEmpty())
{
Iterator it = unresolvedRevisions.iterator();
revision = it.next();
it.remove();
remove(revision, unresolvedRevisions);
}
}
/**
* Removes the specified module from the internal data structures, which
* involves removing its requirements and its capabilities. This may cause
* other modules to become unresolved as a result.
* @param br the module to remove.
* @param unresolvedRevisions a list to containing any additional modules that
* that became unresolved as a result of removing this module and will
* also need to be removed.
* @throws ResolveException if removing the module caused the resolve to fail.
**/
private void remove(BundleRevision br, Set unresolvedRevisions)
throws ResolveException
{
for (BundleRequirement r : br.getDeclaredRequirements(null))
{
remove(r);
}
for (BundleCapability c : br.getDeclaredCapabilities(null))
{
remove(c, unresolvedRevisions);
}
}
/**
* Removes a requirement from the internal data structures.
* @param req the requirement to remove.
**/
private void remove(BundleRequirement req)
{
boolean isFragment = req.getNamespace().equals(BundleRevision.HOST_NAMESPACE);
List candidates = m_candidateMap.remove(req);
if (candidates != null)
{
for (BundleCapability cap : candidates)
{
Set dependents = m_dependentMap.get(cap);
if (dependents != null)
{
dependents.remove(req);
}
}
}
}
/**
* Removes a capability from the internal data structures. This may cause
* other modules to become unresolved as a result.
* @param c the capability to remove.
* @param unresolvedRevisions a list to containing any additional modules that
* that became unresolved as a result of removing this module and will
* also need to be removed.
* @throws ResolveException if removing the module caused the resolve to fail.
**/
private void remove(BundleCapability c, Set unresolvedRevisions)
throws ResolveException
{
Set dependents = m_dependentMap.remove(c);
if (dependents != null)
{
for (BundleRequirement r : dependents)
{
List candidates = m_candidateMap.get(r);
candidates.remove(c);
if (candidates.isEmpty())
{
m_candidateMap.remove(r);
if (!((BundleRequirementImpl) r).isOptional())
{
String msg = "Unable to resolve " + r.getRevision()
+ ": missing requirement " + r;
m_populateResultCache.put(
r.getRevision(), new ResolveException(msg, r.getRevision(), r));
unresolvedRevisions.add(r.getRevision());
}
}
}
}
}
/**
* Creates a copy of the Candidates object. This is used for creating
* permutations when package space conflicts are discovered.
* @return copy of this Candidates object.
**/
public Candidates copy()
{
Map> dependentMap =
new HashMap>();
for (Entry> entry : m_dependentMap.entrySet())
{
Set dependents = new HashSet(entry.getValue());
dependentMap.put(entry.getKey(), dependents);
}
Map> candidateMap =
new HashMap>();
for (Entry> entry
: m_candidateMap.entrySet())
{
List candidates =
new ArrayList(entry.getValue());
candidateMap.put(entry.getKey(), candidates);
}
return new Candidates(
m_mandatoryRevisions, dependentMap, candidateMap,
m_allWrappedHosts, m_populateResultCache, m_fragmentsPresent);
}
public void dump()
{
// Create set of all revisions from requirements.
Set revisions = new HashSet();
for (Entry> entry
: m_candidateMap.entrySet())
{
revisions.add(entry.getKey().getRevision());
}
// Now dump the revisions.
System.out.println("=== BEGIN CANDIDATE MAP ===");
for (BundleRevision br : revisions)
{
System.out.println(" " + br
+ " (" + ((br.getWiring() != null) ? "RESOLVED)" : "UNRESOLVED)"));
List reqs = (br.getWiring() != null)
? br.getWiring().getRequirements(null)
: br.getDeclaredRequirements(null);
for (BundleRequirement req : reqs)
{
List candidates = m_candidateMap.get(req);
if ((candidates != null) && (candidates.size() > 0))
{
System.out.println(" " + req + ": " + candidates);
}
}
reqs = (br.getWiring() != null)
? Util.getDynamicRequirements(br.getWiring().getRequirements(null))
: Util.getDynamicRequirements(br.getDeclaredRequirements(null));
for (BundleRequirement req : reqs)
{
List candidates = m_candidateMap.get(req);
if ((candidates != null) && (candidates.size() > 0))
{
System.out.println(" " + req + ": " + candidates);
}
}
}
System.out.println("=== END CANDIDATE MAP ===");
}
} © 2015 - 2025 Weber Informatics LLC | Privacy Policy