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.sal.binding.yang.types;
10 import java.util.ArrayList;
11 import java.util.Collection;
12 import java.util.List;
14 import org.opendaylight.yangtools.yang.model.api.ChoiceCaseNode;
15 import org.opendaylight.yangtools.yang.model.api.ChoiceSchemaNode;
16 import org.opendaylight.yangtools.yang.model.api.ContainerSchemaNode;
17 import org.opendaylight.yangtools.yang.model.api.DataNodeContainer;
18 import org.opendaylight.yangtools.yang.model.api.DataSchemaNode;
19 import org.opendaylight.yangtools.yang.model.api.GroupingDefinition;
20 import org.opendaylight.yangtools.yang.model.api.ListSchemaNode;
21 import org.opendaylight.yangtools.yang.model.api.Module;
22 import org.opendaylight.yangtools.yang.model.api.NotificationDefinition;
23 import org.opendaylight.yangtools.yang.model.api.RpcDefinition;
24 import org.opendaylight.yangtools.yang.model.api.TypeDefinition;
26 final class TypedefResolver {
27 private TypedefResolver() {
28 throw new UnsupportedOperationException();
31 static List<TypeDefinition<?>> getAllTypedefs(final Module module) {
32 final List<TypeDefinition<?>> ret = new ArrayList<>();
34 fillRecursively(ret, module);
36 final Set<NotificationDefinition> notifications = module.getNotifications();
37 for (NotificationDefinition notificationDefinition : notifications) {
38 fillRecursively(ret, notificationDefinition);
41 final Set<RpcDefinition> rpcs = module.getRpcs();
42 for (RpcDefinition rpcDefinition : rpcs) {
43 ret.addAll(rpcDefinition.getTypeDefinitions());
44 ContainerSchemaNode input = rpcDefinition.getInput();
46 fillRecursively(ret, input);
48 ContainerSchemaNode output = rpcDefinition.getInput();
50 fillRecursively(ret, output);
57 private static void fillRecursively(final List<TypeDefinition<?>> list, final DataNodeContainer container) {
58 final Collection<DataSchemaNode> childNodes = container.getChildNodes();
59 if (childNodes != null) {
60 for (DataSchemaNode childNode : childNodes) {
61 if (!childNode.isAugmenting()) {
62 if (childNode instanceof ContainerSchemaNode) {
63 fillRecursively(list, (ContainerSchemaNode) childNode);
64 } else if (childNode instanceof ListSchemaNode) {
65 fillRecursively(list, (ListSchemaNode) childNode);
66 } else if (childNode instanceof ChoiceSchemaNode) {
67 final Set<ChoiceCaseNode> cases = ((ChoiceSchemaNode) childNode).getCases();
69 for (final ChoiceCaseNode caseNode : cases) {
70 fillRecursively(list, caseNode);
78 list.addAll(container.getTypeDefinitions());
80 final Set<GroupingDefinition> groupings = container.getGroupings();
81 if (groupings != null) {
82 for (GroupingDefinition grouping : groupings) {
83 fillRecursively(list, grouping);