2 * Copyright (c) 2013 Cisco Systems, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
8 package org.opendaylight.yangtools.yang.model.util;
10 import com.google.common.annotations.Beta;
11 import com.google.common.collect.HashBasedTable;
12 import com.google.common.collect.Lists;
13 import com.google.common.collect.Table;
15 import java.util.Arrays;
16 import java.util.Collection;
17 import java.util.HashMap;
18 import java.util.HashSet;
19 import java.util.LinkedHashSet;
20 import java.util.List;
22 import java.util.Objects;
23 import java.util.Optional;
24 import org.opendaylight.yangtools.util.TopologicalSort;
25 import org.opendaylight.yangtools.util.TopologicalSort.Node;
26 import org.opendaylight.yangtools.util.TopologicalSort.NodeImpl;
27 import org.opendaylight.yangtools.yang.common.Revision;
28 import org.opendaylight.yangtools.yang.common.YangVersion;
29 import org.opendaylight.yangtools.yang.model.api.Module;
30 import org.opendaylight.yangtools.yang.model.api.ModuleImport;
31 import org.slf4j.Logger;
32 import org.slf4j.LoggerFactory;
35 * Creates a module dependency graph from provided {@link Module}s and provides a {@link #sort(Collection)} method.
36 * It is topological sort and returns modules in order in which they should be processed (e.g. if A imports B, sort
40 public final class ModuleDependencySort {
41 private static final Logger LOG = LoggerFactory.getLogger(ModuleDependencySort.class);
44 * It is not desirable to instance this class.
46 private ModuleDependencySort() {
47 throw new UnsupportedOperationException();
51 * Topological sort of module dependency graph.
53 * @param modules YANG modules
54 * @return Sorted list of Modules. Modules can be further processed in returned order.
55 * @throws IllegalArgumentException when provided modules are not consistent.
57 public static List<Module> sort(final Module... modules) {
58 return sort(Arrays.asList(modules));
62 * Topological sort of module dependency graph.
64 * @param modules YANG modules
65 * @return Sorted list of Modules. Modules can be further processed in returned order.
66 * @throws IllegalArgumentException when provided modules are not consistent.
68 public static List<Module> sort(final Collection<Module> modules) {
69 final List<Node> sorted = sortInternal(modules);
70 // Cast to Module from Node and return
71 return Lists.transform(sorted, input -> input == null ? null : ((ModuleNodeImpl) input).getReference());
74 private static List<Node> sortInternal(final Collection<Module> modules) {
75 final Table<String, Optional<Revision>, ModuleNodeImpl> moduleGraph = createModuleGraph(modules);
76 return TopologicalSort.sort(new HashSet<>(moduleGraph.values()));
79 private static Table<String, Optional<Revision>, ModuleNodeImpl> createModuleGraph(
80 final Collection<Module> builders) {
81 final Table<String, Optional<Revision>, ModuleNodeImpl> moduleGraph = HashBasedTable.create();
83 processModules(moduleGraph, builders);
84 processDependencies(moduleGraph, builders);
90 * Extract module:revision from modules.
92 private static void processDependencies(final Table<String, Optional<Revision>, ModuleNodeImpl> moduleGraph,
93 final Collection<Module> mmbs) {
94 final Map<URI, Module> allNS = new HashMap<>();
96 // Create edges in graph
97 for (final Module module : mmbs) {
98 final Map<String, Optional<Revision>> imported = new HashMap<>();
99 final String fromName = module.getName();
100 final URI ns = module.getNamespace();
101 final Optional<Revision> fromRevision = module.getRevision();
103 // check for existence of module with same namespace
104 final Module prev = allNS.putIfAbsent(ns, module);
106 final String name = prev.getName();
107 if (!fromName.equals(name)) {
108 LOG.warn("Error while sorting module [{}, {}]: module with same namespace ({}) already loaded:"
109 + " [{}, {}]", fromName, fromRevision, ns, name, prev.getRevision());
113 // no need to check if other Type of object, check is performed in process modules
114 for (final ModuleImport imprt : allImports(module)) {
115 final String toName = imprt.getModuleName();
116 final Optional<Revision> toRevision = imprt.getRevision();
118 final ModuleNodeImpl from = moduleGraph.get(fromName, fromRevision);
119 final ModuleNodeImpl to = getModuleByNameAndRevision(moduleGraph, fromName, fromRevision, toName,
123 * If it is an yang 1 module, check imports: If module is imported twice with different
124 * revisions then throw exception
126 if (module.getYangVersion() == YangVersion.VERSION_1) {
127 final Optional<Revision> impRevision = imported.get(toName);
128 if (impRevision != null && impRevision.isPresent() && !impRevision.equals(toRevision)
129 && toRevision.isPresent()) {
130 throw new IllegalArgumentException(String.format(
131 "Module:%s imported twice with different revisions:%s, %s", toName,
132 formatRevDate(impRevision), formatRevDate(toRevision)));
136 imported.put(toName, toRevision);
143 private static Collection<ModuleImport> allImports(final Module mod) {
144 if (mod.getSubmodules().isEmpty()) {
145 return mod.getImports();
148 final Collection<ModuleImport> concat = new LinkedHashSet<>();
149 concat.addAll(mod.getImports());
150 for (Module sub : mod.getSubmodules()) {
151 concat.addAll(sub.getImports());
157 * Get imported module by its name and revision from moduleGraph.
159 private static ModuleNodeImpl getModuleByNameAndRevision(
160 final Table<String, Optional<Revision>, ModuleNodeImpl> moduleGraph, final String fromName,
161 final Optional<Revision> fromRevision, final String toName, final Optional<Revision> toRevision) {
163 final ModuleNodeImpl exact = moduleGraph.get(toName, toRevision);
168 // If revision is not specified in import, but module exists with different revisions, take first one
169 if (toRevision.isEmpty()) {
170 final Map<Optional<Revision>, ModuleNodeImpl> modulerevs = moduleGraph.row(toName);
172 if (!modulerevs.isEmpty()) {
173 final ModuleNodeImpl first = modulerevs.values().iterator().next();
174 if (LOG.isTraceEnabled()) {
175 LOG.trace("Import:{}:{} by module:{}:{} does not specify revision, using:{}:{}"
176 + " for module dependency sort", toName, formatRevDate(toRevision), fromName,
177 formatRevDate(fromRevision), first.getName(), formatRevDate(first.getRevision()));
183 LOG.warn("Not existing module imported:{}:{} by:{}:{}", toName, formatRevDate(toRevision), fromName,
184 formatRevDate(fromRevision));
185 LOG.warn("Available models: {}", moduleGraph);
186 throw new IllegalArgumentException(String.format("Not existing module imported:%s:%s by:%s:%s", toName,
187 formatRevDate(toRevision), fromName, formatRevDate(fromRevision)));
191 * Extract dependencies from modules to fill dependency graph.
193 private static void processModules(final Table<String, Optional<Revision>, ModuleNodeImpl> moduleGraph,
194 final Iterable<Module> modules) {
197 for (final Module momb : modules) {
199 final String name = momb.getName();
200 final Optional<Revision> rev = momb.getRevision();
201 final Map<Optional<Revision>, ModuleNodeImpl> revs = moduleGraph.row(name);
202 if (revs.containsKey(rev)) {
203 throw new IllegalArgumentException(String.format("Module:%s with revision:%s declared twice", name,
204 formatRevDate(rev)));
207 revs.put(rev, new ModuleNodeImpl(name, rev.orElse(null), momb));
211 private static String formatRevDate(final Optional<Revision> rev) {
212 return rev.map(Revision::toString).orElse("default");
215 private static final class ModuleNodeImpl extends NodeImpl {
216 private final String name;
217 private final Revision revision;
218 private final Module originalObject;
220 ModuleNodeImpl(final String name, final Revision revision, final Module module) {
222 this.revision = revision;
223 this.originalObject = module;
230 Optional<Revision> getRevision() {
231 return Optional.ofNullable(revision);
235 public int hashCode() {
236 final int prime = 31;
238 result = prime * result + Objects.hashCode(name);
239 result = prime * result + Objects.hashCode(revision);
244 public boolean equals(final Object obj) {
251 if (getClass() != obj.getClass()) {
254 final ModuleNodeImpl other = (ModuleNodeImpl) obj;
256 if (other.name != null) {
259 } else if (!name.equals(other.name)) {
262 if (revision == null) {
263 if (other.revision != null) {
266 } else if (!revision.equals(other.revision)) {
273 public String toString() {
274 return "Module [name=" + name + ", revision=" + formatRevDate(getRevision()) + "]";
277 public Module getReference() {
278 return originalObject;