/projects/netbeans-7.3/nbbuild/antsrc/org/netbeans/nbbuild/SortSuiteModules.java
Java | 656 lines | 399 code | 95 blank | 162 comment | 89 complexity | 9f512672853edb8368ebcd5f9246ffd1 MD5 | raw file
- /*
- * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
- *
- * Copyright 1997-2010 Oracle and/or its affiliates. All rights reserved.
- *
- * Oracle and Java are registered trademarks of Oracle and/or its affiliates.
- * Other names may be trademarks of their respective owners.
- *
- * The contents of this file are subject to the terms of either the GNU
- * General Public License Version 2 only ("GPL") or the Common
- * Development and Distribution License("CDDL") (collectively, the
- * "License"). You may not use this file except in compliance with the
- * License. You can obtain a copy of the License at
- * http://www.netbeans.org/cddl-gplv2.html
- * or nbbuild/licenses/CDDL-GPL-2-CP. See the License for the
- * specific language governing permissions and limitations under the
- * License. When distributing the software, include this License Header
- * Notice in each file and include the License file at
- * nbbuild/licenses/CDDL-GPL-2-CP. Oracle designates this
- * particular file as subject to the "Classpath" exception as provided
- * by Oracle in the GPL Version 2 section of the License file that
- * accompanied this code. If applicable, add the following below the
- * License Header, with the fields enclosed by brackets [] replaced by
- * your own identifying information:
- * "Portions Copyrighted [year] [name of copyright owner]"
- *
- * Contributor(s):
- *
- * The Original Software is NetBeans. The Initial Developer of the Original
- * Software is Sun Microsystems, Inc. Portions Copyright 1997-2006 Sun
- * Microsystems, Inc. All Rights Reserved.
- *
- * If you wish your version of this file to be governed by only the CDDL
- * or only the GPL Version 2, indicate your decision by adding
- * "[Contributor] elects to include this software in this distribution
- * under the [CDDL or GPL Version 2] license." If you do not indicate a
- * single choice of license, a recipient has the option to distribute
- * your version of this file under either the CDDL, the GPL Version 2 or
- * to extend the choice of license to its licensees as provided above.
- * However, if you add GPL Version 2 code and therefore, elected the GPL
- * Version 2 license, then the option applies only if the new code is
- * made subject to such option by the copyright holder.
- */
- package org.netbeans.nbbuild;
- import java.io.File;
- import java.io.IOException;
- import java.io.PrintWriter;
- import java.io.StringWriter;
- import java.util.ArrayList;
- import java.util.Collection;
- import java.util.Collections;
- import java.util.HashMap;
- import java.util.HashSet;
- import java.util.Iterator;
- import java.util.LinkedList;
- import java.util.List;
- import java.util.Map;
- import java.util.Set;
- import java.util.Stack;
- import java.util.TreeMap;
- import org.apache.tools.ant.BuildException;
- import org.apache.tools.ant.Project;
- import org.apache.tools.ant.Task;
- import org.apache.tools.ant.types.Path;
- import org.w3c.dom.Document;
- import org.w3c.dom.Element;
- import org.xml.sax.InputSource;
- import org.xml.sax.SAXException;
- /**
- * Task to sort the list of modules in a suite by their declared build dependencies.
- * @author Jesse Glick
- */
- public class SortSuiteModules extends Task {
- private boolean sortTests;
- private Path unsortedModules;
- /**
- * Set a list of modules in the suite.
- * Each entry should be a project base directory.
- */
- public void setUnsortedModules(Path unsortedModules) {
- this.unsortedModules = unsortedModules;
- }
- private String sortedModulesProperty;
- /**
- * Set a property name in which to store a sorted path of module base directories.
- */
- public void setSortedModulesProperty(String sortedModulesProperty) {
- this.sortedModulesProperty = sortedModulesProperty;
- }
- /** Is enabled sorting test dependencies?
- */
- public boolean isSortTests() {
- return sortTests;
- }
- /** Enable or disable sorting test dependenciens. Default value is false.
- */
- public void setSortTests(boolean sortTests) {
- this.sortTests = sortTests;
- }
- public SortSuiteModules() {}
- public @Override void execute() throws BuildException {
- if (unsortedModules == null) {
- throw new BuildException("Must set unsortedModules");
- }
- if (sortedModulesProperty == null) {
- throw new BuildException("Must set sortedModulesProperty");
- }
- Map<String,File> basedirsByCNB = new TreeMap<String,File>();
- Map<String,List<String>> buildDeps = new HashMap<String,List<String>>();
- for (String piece : unsortedModules.list()) {
- File d = new File(piece);
- File projectXml = new File(d, "nbproject" + File.separatorChar + "project.xml");
- if (!projectXml.isFile()) {
- throw new BuildException("Cannot open " + projectXml, getLocation());
- }
- Document doc;
- try {
- doc = XMLUtil.parse(new InputSource(projectXml.toURI().toString()), false, true, null, null);
- } catch (IOException e) {
- throw new BuildException("Error parsing " + projectXml + ": " + e, e, getLocation());
- } catch (SAXException e) {
- throw new BuildException("Error parsing " + projectXml + ": " + e, e, getLocation());
- }
- Element config = XMLUtil.findElement(doc.getDocumentElement(), "configuration", ParseProjectXml.PROJECT_NS);
- if (config == null) {
- throw new BuildException("Malformed project file " + projectXml, getLocation());
- }
- Element data = ParseProjectXml.findNBMElement(config, "data");
- if (data == null) {
- log("Skipping " + projectXml + " as it does not look like a module project", Project.MSG_WARN);
- continue;
- }
- Element cnbEl = ParseProjectXml.findNBMElement(data, "code-name-base");
- if (cnbEl == null) {
- throw new BuildException("Malformed project file " + projectXml, getLocation());
- }
- String cnb = XMLUtil.findText(cnbEl);
- basedirsByCNB.put(cnb, d);
- List<String> deps = new LinkedList<String>();
- Element depsEl = ParseProjectXml.findNBMElement(data, "module-dependencies");
- if (depsEl == null) {
- throw new BuildException("Malformed project file " + projectXml, getLocation());
- }
- for (Element dep : XMLUtil.findSubElements(depsEl)) {
- if (ParseProjectXml.findNBMElement(dep, "build-prerequisite") == null &&
- // Just build-prerequisite would not prevent "...will first try to build..." from ParseProjectXml,
- // since that builds transitive runtime dependencies (e.g. from *.kit) first.
- ParseProjectXml.findNBMElement(dep, "run-dependency") == null) {
- continue;
- }
- Element cnbEl2 = ParseProjectXml.findNBMElement(dep, "code-name-base");
- if (cnbEl2 == null) {
- throw new BuildException("Malformed project file " + projectXml, getLocation());
- }
- String cnb2 = XMLUtil.findText(cnbEl2);
- deps.add(cnb2);
- }
- buildDeps.put(cnb, deps);
- // create test dependencies
- if (isSortTests()) {
- Element testDepsEl = ParseProjectXml.findNBMElement(data,"test-dependencies");
- if (testDepsEl != null) {
- // <test-type>
- Iterator itTType = XMLUtil.findSubElements(testDepsEl).iterator();
- while (itTType.hasNext()) {
- Iterator itt = XMLUtil.findSubElements((Element)itTType.next()).iterator();
- while (itt.hasNext()) {
- Element dep = (Element) itt.next();
- if (ParseProjectXml.findNBMElement(dep, "test") == null) {
- continue;
- }
- Element cnbEl2 = ParseProjectXml.findNBMElement(dep, "code-name-base");
- if (cnbEl2 == null) {
- throw new BuildException("No cobase found for test-dependency");
- }
- String cnb2 = XMLUtil.findText(cnbEl2);
- deps.add(cnb2);
- }
- }
- }
- }
- }
- for (List<String> deps: buildDeps.values()) {
- deps.retainAll(basedirsByCNB.keySet());
- }
- Map<String,List<String>> reversedDeps = new HashMap<String,List<String>>();
- for (Map.Entry<String,List<String>> entry : buildDeps.entrySet()) {
- for (String from : entry.getValue()) {
- String to = entry.getKey();
- List<String> tos = reversedDeps.get(from);
- if (tos == null) {
- reversedDeps.put(from, tos = new ArrayList<String>());
- }
- tos.add(to);
- }
- }
- List<String> cnbs;
- try {
- cnbs = topologicalSort(basedirsByCNB.keySet(), reversedDeps);
- } catch (TopologicalSortException x) {
- throw new BuildException(x.getMessage(), x, getLocation());
- }
- StringBuffer path = new StringBuffer();
- for (String cnb: cnbs) {
- assert basedirsByCNB.containsKey(cnb);
- if (path.length() > 0) {
- path.append(File.pathSeparatorChar);
- }
- path.append(basedirsByCNB.get(cnb).getAbsolutePath());
- }
- getProject().setNewProperty(sortedModulesProperty, path.toString());
- }
- // Stolen from org.openide.util.Utilities:
- private static <T> List<T> topologicalSort(Collection<T> c, Map<? super T, ? extends Collection<? extends T>> edges)
- throws TopologicalSortException {
- Map<T,Boolean> finished = new HashMap<T,Boolean>();
- List<T> r = new ArrayList<T>(Math.max(c.size(), 1));
- List<T> cRev = new ArrayList<T>(c);
- Collections.reverse(cRev);
- Iterator<T> it = cRev.iterator();
- while (it.hasNext()) {
- List<T> cycle = visit(it.next(), edges, finished, r);
- if (cycle != null) {
- throw new TopologicalSortException(cRev, edges);
- }
- }
- Collections.reverse(r);
- if (r.size() != c.size()) {
- r.retainAll(c);
- }
- return r;
- }
- private static <T> List<T> visit(
- T node,
- Map<? super T, ? extends Collection<? extends T>> edges,
- Map<T,Boolean> finished,
- List<T> r
- ) {
- Boolean b = finished.get(node);
- //System.err.println("node=" + node + " color=" + b);
- if (b != null) {
- if (b.booleanValue()) {
- return null;
- }
- ArrayList<T> cycle = new ArrayList<T>();
- cycle.add(node);
- finished.put(node, null);
- return cycle;
- }
- Collection<? extends T> e = edges.get(node);
- if (e != null) {
- finished.put(node, Boolean.FALSE);
- Iterator<? extends T> it = e.iterator();
- while (it.hasNext()) {
- List<T> cycle = visit(it.next(), edges, finished, r);
- if (cycle != null) {
- if (cycle instanceof ArrayList) {
- // if cycle instanceof ArrayList we are still in the
- // cycle and we want to collect new members
- if (Boolean.FALSE == finished.get(node)) {
- // another member in the cycle
- cycle.add(node);
- } else {
- // we have reached the head of the cycle
- // do not add additional cycles anymore
- Collections.reverse(cycle);
- // changing cycle to not be ArrayList
- cycle = Collections.unmodifiableList(cycle);
- }
- }
- // mark this node as tested
- finished.put(node, Boolean.TRUE);
- // and report an error
- return cycle;
- }
- }
- }
- finished.put(node, Boolean.TRUE);
- r.add(node);
- return null;
- }
- private static final class TopologicalSortException extends Exception {
- /** all vertexes */
- private Collection vertexes;
- /** map with edges */
- private Map<?,? extends Collection<?>> edges;
- /** result if called twice */
- private Set[] result;
- /** counter to number the vertexes */
- private int counter;
- /** vertexes sorted by increasing value of y */
- private Stack<Vertex> dualGraph = new Stack<Vertex>();
- TopologicalSortException(Collection vertexes, Map<?,? extends Collection<?>> edges) {
- this.vertexes = vertexes;
- this.edges = edges;
- }
- /** Because the full sort was not possible, this methods
- * returns the best possible substitute for it that is available.
- *
- * @return list of partially sorted objects, the list can be freely modified
- */
- public final List partialSort() {
- Set[] all = topologicalSets();
- ArrayList<Object> res = new ArrayList<Object>(vertexes.size());
- for (int i = 0; i < all.length; i++) {
- for (Object e : all[i]) {
- res.add(e);
- }
- }
- return res;
- }
- /** The topological sort could not be finished as there
- * are some objects that are mutually refering to each other.
- * This methods finds such objects and partition them into
- * separate sets. All objects in one set (transitively) refer to
- * each other and thus prevent the sort from succeding. As
- * there can be more of such "unsortable sets" an array
- * of them is returned.
- *
- * @return array of sets that contain some of the original objects, result
- * shall not be modified
- */
- public final Set[] unsortableSets() {
- Set[] all = topologicalSets();
- ArrayList<Set> unsort = new ArrayList<Set>();
- for (int i = 0; i < all.length; i++) {
- if ((all[i].size() > 1) || !(all[i] instanceof HashSet)) {
- unsort.add(all[i]);
- }
- }
- return unsort.toArray(new Set[0]);
- }
- @Override
- public String getMessage() {
- StringWriter w = new StringWriter();
- PrintWriter pw = new PrintWriter(w);
- printDebug(pw);
- pw.close();
- return w.toString();
- }
- @Override
- public String toString() {
- String s = getClass().getName();
- return s;
- }
- private void printDebug(java.io.PrintWriter w) {
- Set<Object> relevantVertices = new HashSet<Object>();
- Set<?>[] bad = unsortableSets();
- for (Set<?> s : bad) {
- relevantVertices.addAll(s);
- }
- Map<Object,Collection<?>> relevantEdges = new HashMap<Object,Collection<?>>();
- for (Map.Entry<?,? extends Collection<?>> entry : edges.entrySet()) {
- Set<Object> relevant = new HashSet<Object>(entry.getValue());
- relevant.add(entry.getKey());
- relevant.retainAll(relevantVertices);
- if (!relevant.isEmpty()) {
- relevantEdges.put(entry.getKey(), entry.getValue());
- }
- }
- w.print("TopologicalSortException - Collection with relevant edges "); // NOI18N
- w.print(relevantEdges);
- w.println(" cannot be sorted"); // NOI18N
- for (int i = 0; i < bad.length; i++) {
- w.print(" Conflict #"); // NOI18N
- w.print(i);
- w.print(": "); // NOI18N
- w.println(bad[i]);
- }
- }
- /** Adds description why the graph cannot be sorted.
- * @param w writer to write to
- */
- public @Override final void printStackTrace(java.io.PrintWriter w) {
- printDebug(w);
- super.printStackTrace(w);
- }
- /** Adds description why the graph cannot be sorted.
- * @param s stream to write to
- */
- public @Override final void printStackTrace(java.io.PrintStream s) {
- java.io.PrintWriter w = new java.io.PrintWriter(s);
- this.printStackTrace(w);
- w.flush();
- }
- /** As the full topological sort cannot be finished due to cycles
- * in the graph this methods performs a partition topological sort.
- * <P>
- * First of all it identifies unsortable parts of the graph and
- * partitions the graph into sets of original objects. Each set contains
- * objects that are mutually unsortable (there is a cycle between them).
- * Then the topological sort is performed again on those sets, this
- * sort succeeds because the graph of sets is DAG (all problematic edges
- * were only between objects now grouped inside the sets) and the
- * result forms the return value of this method.
- *
- * @return array of sorted sets that contain the original objects, each
- * object from the original collection is exactly in one set, result
- * shall not be modified
- */
- public final Set[] topologicalSets() {
- if (result != null) {
- return result;
- }
- HashMap<Object, Vertex> vertexInfo = new HashMap<Object, Vertex>();
- // computes value X and Y for each vertex
- counter = 0;
- Iterator it = vertexes.iterator();
- while (it.hasNext()) {
- constructDualGraph(counter, it.next(), vertexInfo);
- }
- // now connect vertexes that cannot be sorted into own
- // sets
- // map from the original objects to
- Map<Object, Set> objectsToSets = new HashMap<Object, Set>();
- ArrayList<Set> sets = new ArrayList<Set>();
- while (!dualGraph.isEmpty()) {
- Vertex v = dualGraph.pop();
- if (!v.visited) {
- Set<Object> set = new HashSet<Object>();
- visitDualGraph(v, set);
- if ((set.size() == 1) && v.edgesFrom.contains(v)) {
- // mark if there is a self reference and the
- // set is only one element big, it means that there
- // is a self cycle
- //
- // do not use HashSet but Collections.singleton
- // to recognize such cycles
- set = Collections.singleton(v.object);
- }
- sets.add(set);
- // fill the objectsToSets mapping
- it = set.iterator();
- while (it.hasNext()) {
- objectsToSets.put(it.next(), set);
- }
- }
- }
- // now topologically sort the sets
- // 1. prepare the map
- HashMap<Set, Collection<Set>> edgesBetweenSets = new HashMap<Set, Collection<Set>>();
- it = edges.entrySet().iterator();
- while (it.hasNext()) {
- Map.Entry entry = (Map.Entry) it.next();
- Collection leadsTo = (Collection) entry.getValue();
- if ((leadsTo == null) || leadsTo.isEmpty()) {
- continue;
- }
- Set from = objectsToSets.get(entry.getKey());
- Collection<Set> setsTo = edgesBetweenSets.get(from);
- if (setsTo == null) {
- setsTo = new ArrayList<Set>();
- edgesBetweenSets.put(from, setsTo);
- }
- Iterator convert = leadsTo.iterator();
- while (convert.hasNext()) {
- Set to = objectsToSets.get(convert.next());
- if (from != to) {
- // avoid self cycles
- setsTo.add(to);
- }
- }
- }
- // 2. do the sort
- try {
- List<Set> listResult = topologicalSort(sets, edgesBetweenSets);
- result = listResult.toArray(new Set[0]);
- } catch (TopologicalSortException ex) {
- throw new IllegalStateException("Cannot happen"); // NOI18N
- }
- return result;
- }
- /** Traverses the tree
- * @param counter current value
- * @param vertex current vertex
- * @param vertexInfo the info
- */
- private Vertex constructDualGraph(int counter, Object vertex, HashMap<Object, Vertex> vertexInfo) {
- Vertex info = vertexInfo.get(vertex);
- if (info == null) {
- info = new Vertex(vertex, counter++);
- vertexInfo.put(vertex, info);
- } else {
- // already (being) processed
- return info;
- }
- // process children
- Collection c = (Collection) edges.get(vertex);
- if (c != null) {
- Iterator it = c.iterator();
- while (it.hasNext()) {
- Vertex next = constructDualGraph(counter, it.next(), vertexInfo);
- next.edgesFrom.add(info);
- }
- }
- // leaving the vertex
- info.y = counter++;
- dualGraph.push(info);
- return info;
- }
- /** Visit dual graph. Decreasing value of Y gives the order.
- * Number
- *
- * @param vertex vertex to start from
- * @param visited list of all objects that we've been to
- */
- private void visitDualGraph(Vertex vertex, Collection<Object> visited) {
- if (vertex.visited) {
- return;
- }
- visited.add(vertex.object);
- vertex.visited = true;
- Iterator it = vertex.edges();
- while (it.hasNext()) {
- Vertex v = (Vertex) it.next();
- visitDualGraph(v, visited);
- }
- }
- /** Represents info about a vertex in the graph. Vertexes are
- * comparable by the value of Y, but only after the value is set,
- * so the sort has to be done latelly.
- */
- private static final class Vertex implements Comparable<Vertex> {
- /** the found object */
- public Object object;
- /** list of vertexes that point to this one */
- public List<Vertex> edgesFrom = new ArrayList<Vertex>();
- /** the counter state when we entered the vertex */
- public final int x;
- /** the counter when we exited the vertex */
- public int y;
- /** already sorted, true if the edges has been sorted */
- public boolean sorted;
- /** true if visited in dual graph */
- public boolean visited;
- public Vertex(Object obj, int x) {
- this.x = x;
- this.object = obj;
- }
- /** Iterator over edges
- * @return iterator of Vertex items
- */
- public Iterator edges() {
- if (!sorted) {
- Collections.sort(edgesFrom);
- sorted = true;
- }
- return edgesFrom.iterator();
- }
- /** Comparing based on value of Y.
- *
- * @param o the Object to be compared.
- * @return a negative integer, zero, or a positive integer as this object
- * is less than, equal to, or greater than the specified object.
- */
- public int compareTo(Vertex o) {
- return o.y - y;
- }
- }
- }
- }