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.mdsal.binding.yang.types;
10 import java.util.ArrayList;
11 import java.util.Collection;
12 import java.util.List;
13 import org.opendaylight.yangtools.yang.model.api.CaseSchemaNode;
14 import org.opendaylight.yangtools.yang.model.api.ChoiceSchemaNode;
15 import org.opendaylight.yangtools.yang.model.api.ContainerSchemaNode;
16 import org.opendaylight.yangtools.yang.model.api.DataNodeContainer;
17 import org.opendaylight.yangtools.yang.model.api.DataSchemaNode;
18 import org.opendaylight.yangtools.yang.model.api.GroupingDefinition;
19 import org.opendaylight.yangtools.yang.model.api.ListSchemaNode;
20 import org.opendaylight.yangtools.yang.model.api.Module;
21 import org.opendaylight.yangtools.yang.model.api.NotificationDefinition;
22 import org.opendaylight.yangtools.yang.model.api.RpcDefinition;
23 import org.opendaylight.yangtools.yang.model.api.TypeDefinition;
25 final class TypedefResolver {
26 private TypedefResolver() {
27 throw new UnsupportedOperationException();
30 static List<TypeDefinition<?>> getAllTypedefs(final Module module) {
31 final List<TypeDefinition<?>> ret = new ArrayList<>();
33 fillRecursively(ret, module);
35 for (NotificationDefinition notificationDefinition : module.getNotifications()) {
36 fillRecursively(ret, notificationDefinition);
39 for (RpcDefinition rpcDefinition : module.getRpcs()) {
40 ret.addAll(rpcDefinition.getTypeDefinitions());
41 fillRecursively(ret, rpcDefinition.getInput());
42 fillRecursively(ret, rpcDefinition.getOutput());
48 private static void fillRecursively(final List<TypeDefinition<?>> list, final DataNodeContainer container) {
49 final Collection<? extends DataSchemaNode> childNodes = container.getChildNodes();
50 if (childNodes != null) {
51 for (DataSchemaNode childNode : childNodes) {
52 if (!childNode.isAugmenting()) {
53 if (childNode instanceof ContainerSchemaNode) {
54 fillRecursively(list, (ContainerSchemaNode) childNode);
55 } else if (childNode instanceof ListSchemaNode) {
56 fillRecursively(list, (ListSchemaNode) childNode);
57 } else if (childNode instanceof ChoiceSchemaNode) {
58 for (final CaseSchemaNode caseNode : ((ChoiceSchemaNode) childNode).getCases().values()) {
59 fillRecursively(list, caseNode);
66 list.addAll(container.getTypeDefinitions());
68 final Collection<? extends GroupingDefinition> groupings = container.getGroupings();
69 if (groupings != null) {
70 for (GroupingDefinition grouping : groupings) {
71 fillRecursively(list, grouping);