2 * Copyright (c) 2015 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.data.impl.leafref;
10 import com.google.common.base.Optional;
11 import com.google.common.collect.Iterables;
12 import java.util.Collection;
13 import java.util.HashMap;
14 import java.util.HashSet;
15 import java.util.Iterator;
16 import java.util.LinkedList;
17 import java.util.List;
19 import java.util.Map.Entry;
21 import org.opendaylight.yangtools.yang.common.QName;
22 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier;
23 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.NodeIdentifierWithPredicates;
24 import org.opendaylight.yangtools.yang.data.api.YangInstanceIdentifier.PathArgument;
25 import org.opendaylight.yangtools.yang.data.api.schema.ChoiceNode;
26 import org.opendaylight.yangtools.yang.data.api.schema.DataContainerChild;
27 import org.opendaylight.yangtools.yang.data.api.schema.DataContainerNode;
28 import org.opendaylight.yangtools.yang.data.api.schema.LeafNode;
29 import org.opendaylight.yangtools.yang.data.api.schema.LeafSetEntryNode;
30 import org.opendaylight.yangtools.yang.data.api.schema.LeafSetNode;
31 import org.opendaylight.yangtools.yang.data.api.schema.MapEntryNode;
32 import org.opendaylight.yangtools.yang.data.api.schema.MapNode;
33 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNode;
34 import org.opendaylight.yangtools.yang.data.api.schema.NormalizedNodes;
35 import org.opendaylight.yangtools.yang.data.api.schema.UnkeyedListEntryNode;
36 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidate;
37 import org.opendaylight.yangtools.yang.data.api.schema.tree.DataTreeCandidateNode;
38 import org.opendaylight.yangtools.yang.data.api.schema.tree.ModificationType;
39 import org.opendaylight.yangtools.yang.model.api.SchemaPath;
40 import org.slf4j.Logger;
41 import org.slf4j.LoggerFactory;
43 public class LeafRefValidatation {
45 private static final Logger LOG = LoggerFactory.getLogger(LeafRefValidatation.class);
46 private static final String NEW_LINE = System.getProperty("line.separator");
47 private static final String FAILED = " -> FAILED";
48 private static final String SUCCESS = " -> OK";
50 private final DataTreeCandidate tree;
51 private final List<String> errorsMessages = new LinkedList<>();
52 private final Set<LeafRefContext> validatedLeafRefCtx = new HashSet<>();
54 private LeafRefValidatation(final DataTreeCandidate tree) {
58 public static void validate(final DataTreeCandidate tree, final LeafRefContext rootLeafRefCtx)
59 throws LeafRefDataValidationFailedException {
60 new LeafRefValidatation(tree).validate0(rootLeafRefCtx);
62 private void validate0(final LeafRefContext rootLeafRefCtx)
63 throws LeafRefDataValidationFailedException {
65 final DataTreeCandidateNode rootNode = tree.getRootNode();
67 final Collection<DataTreeCandidateNode> childNodes = rootNode.getChildNodes();
68 for (final DataTreeCandidateNode dataTreeCandidateNode : childNodes) {
70 final ModificationType modificationType = dataTreeCandidateNode
71 .getModificationType();
72 if (modificationType != ModificationType.UNMODIFIED) {
74 final PathArgument identifier = dataTreeCandidateNode.getIdentifier();
75 final QName childQName = identifier.getNodeType();
77 final LeafRefContext referencedByCtx = rootLeafRefCtx
78 .getReferencedChildByName(childQName);
79 final LeafRefContext referencingCtx = rootLeafRefCtx
80 .getReferencingChildByName(childQName);
81 if (referencedByCtx != null || referencingCtx != null) {
82 final YangInstanceIdentifier yangInstanceIdentifier = YangInstanceIdentifier
83 .create(dataTreeCandidateNode.getIdentifier());
84 validateNode(dataTreeCandidateNode, referencedByCtx,
85 referencingCtx, yangInstanceIdentifier);
91 if (!errorsMessages.isEmpty()) {
92 final StringBuilder message = new StringBuilder();
94 for (final String errorMessage : errorsMessages) {
95 message.append(errorMessage);
98 throw new LeafRefDataValidationFailedException(message.toString(),
104 private void validateNode(final DataTreeCandidateNode node,
105 final LeafRefContext referencedByCtx, final LeafRefContext referencingCtx,
106 final YangInstanceIdentifier current) {
108 if ((node.getModificationType() == ModificationType.WRITE)
109 && node.getDataAfter().isPresent()) {
110 final Optional<NormalizedNode<?, ?>> dataAfter = node.getDataAfter();
111 final NormalizedNode<?, ?> normalizedNode = dataAfter.get();
112 validateNodeData(normalizedNode, referencedByCtx, referencingCtx,
113 node.getModificationType(), current);
117 if (node.getModificationType() == ModificationType.DELETE
118 && referencedByCtx != null) {
119 final Optional<NormalizedNode<?, ?>> dataBefor = node.getDataBefore();
120 final NormalizedNode<?, ?> normalizedNode = dataBefor.get();
121 validateNodeData(normalizedNode, referencedByCtx, null,
122 node.getModificationType(), current);
126 final Collection<DataTreeCandidateNode> childNodes = node.getChildNodes();
127 for (final DataTreeCandidateNode childNode : childNodes) {
128 final ModificationType modificationType = childNode.getModificationType();
130 if (modificationType != ModificationType.UNMODIFIED) {
132 final LeafRefContext childReferencedByCtx = getReferencedByCtxChild(
133 referencedByCtx, childNode);
134 final LeafRefContext childReferencingCtx = getReferencingCtxChild(
135 referencingCtx, childNode);
137 if (childReferencedByCtx != null || childReferencingCtx != null) {
138 final YangInstanceIdentifier childYangInstanceIdentifier = current
139 .node(childNode.getIdentifier());
140 validateNode(childNode, childReferencedByCtx,
141 childReferencingCtx, childYangInstanceIdentifier);
149 private static LeafRefContext getReferencingCtxChild(
150 final LeafRefContext referencingCtx, final DataTreeCandidateNode childNode) {
152 LeafRefContext childReferencingCtx = null;
153 if (referencingCtx != null) {
154 final PathArgument identifier = childNode.getIdentifier();
155 final QName childQName = identifier.getNodeType();
157 childReferencingCtx = referencingCtx
158 .getReferencingChildByName(childQName);
160 if (childReferencingCtx == null) {
161 final NormalizedNode<?, ?> data = childNode.getDataAfter().get();
162 if (data instanceof MapEntryNode
163 || data instanceof UnkeyedListEntryNode) {
164 childReferencingCtx = referencingCtx;
169 return childReferencingCtx;
172 private static LeafRefContext getReferencedByCtxChild(
173 final LeafRefContext referencedByCtx, final DataTreeCandidateNode childNode) {
175 LeafRefContext childReferencedByCtx = null;
176 if (referencedByCtx != null) {
177 final PathArgument identifier = childNode.getIdentifier();
178 final QName childQName = identifier.getNodeType();
180 childReferencedByCtx = referencedByCtx
181 .getReferencedChildByName(childQName);
182 if (childReferencedByCtx == null) {
183 final NormalizedNode<?, ?> data = childNode.getDataAfter().get();
184 if (data instanceof MapEntryNode
185 || data instanceof UnkeyedListEntryNode) {
186 childReferencedByCtx = referencedByCtx;
191 return childReferencedByCtx;
194 private void validateNodeData(final NormalizedNode<?, ?> node,
195 final LeafRefContext referencedByCtx, final LeafRefContext referencingCtx,
196 final ModificationType modificationType, final YangInstanceIdentifier current) {
198 if (node instanceof LeafNode) {
199 final LeafNode<?> leaf = (LeafNode<?>) node;
201 if (referencedByCtx != null && referencedByCtx.isReferenced()) {
202 validateLeafRefTargetNodeData(leaf, referencedByCtx,
205 if (referencingCtx != null && referencingCtx.isReferencing()) {
206 validateLeafRefNodeData(leaf, referencingCtx, modificationType,
213 if (node instanceof LeafSetNode) {
214 final LeafSetNode<?> leafSet = (LeafSetNode<?>) node;
216 if (referencedByCtx == null && referencingCtx == null) {
220 final Iterable<? extends NormalizedNode<?, ?>> leafSetEntries = leafSet
222 for (final NormalizedNode<?, ?> leafSetEntry : leafSetEntries) {
223 if (referencedByCtx != null && referencedByCtx.isReferenced()) {
224 validateLeafRefTargetNodeData(leafSetEntry,
225 referencedByCtx, modificationType);
227 if (referencingCtx != null && referencingCtx.isReferencing()) {
228 validateLeafRefNodeData(leafSetEntry, referencingCtx,
229 modificationType, current);
236 if (node instanceof ChoiceNode) {
237 final ChoiceNode choice = (ChoiceNode) node;
238 final Iterable<DataContainerChild<? extends PathArgument, ?>> childs = choice
240 for (final DataContainerChild<? extends PathArgument, ?> dataContainerChild : childs) {
241 final QName qname = dataContainerChild.getNodeType();
243 LeafRefContext childReferencedByCtx = null;
244 LeafRefContext childReferencingCtx = null;
245 if (referencedByCtx != null) {
246 childReferencedByCtx = findReferencedByCtxUnderChoice(
247 referencedByCtx, qname);
249 if (referencingCtx != null) {
250 childReferencingCtx = findReferencingCtxUnderChoice(
251 referencingCtx, qname);
253 if (childReferencedByCtx != null || childReferencingCtx != null) {
254 final YangInstanceIdentifier childYangInstanceIdentifier = current
255 .node(dataContainerChild.getIdentifier());
256 validateNodeData(dataContainerChild, childReferencedByCtx,
257 childReferencingCtx, modificationType,
258 childYangInstanceIdentifier);
261 } else if (node instanceof DataContainerNode) {
262 final DataContainerNode<?> dataContainerNode = (DataContainerNode<?>) node;
263 final Iterable<DataContainerChild<? extends PathArgument, ?>> dataContainerChilds = dataContainerNode
266 for (final DataContainerChild<? extends PathArgument, ?> dataContainerChild : dataContainerChilds) {
267 final QName qname = dataContainerChild.getNodeType();
269 LeafRefContext childReferencedByCtx = null;
270 LeafRefContext childReferencingCtx = null;
271 if (referencedByCtx != null) {
272 childReferencedByCtx = referencedByCtx
273 .getReferencedChildByName(qname);
275 if (referencingCtx != null) {
276 childReferencingCtx = referencingCtx
277 .getReferencingChildByName(qname);
279 if (childReferencedByCtx != null || childReferencingCtx != null) {
280 final YangInstanceIdentifier childYangInstanceIdentifier = current
281 .node(dataContainerChild.getIdentifier());
282 validateNodeData(dataContainerChild, childReferencedByCtx,
283 childReferencingCtx, modificationType,
284 childYangInstanceIdentifier);
287 } else if (node instanceof MapNode) {
288 final MapNode map = (MapNode) node;
289 final Iterable<MapEntryNode> mapEntries = map.getValue();
290 for (final MapEntryNode mapEntry : mapEntries) {
291 final Iterable<DataContainerChild<? extends PathArgument, ?>> mapEntryNodes = mapEntry
293 final YangInstanceIdentifier mapEntryYangInstanceIdentifier = current
294 .node(mapEntry.getIdentifier());
295 for (final DataContainerChild<? extends PathArgument, ?> mapEntryNode : mapEntryNodes) {
296 final QName qname = mapEntryNode.getNodeType();
298 LeafRefContext childReferencedByCtx = null;
299 LeafRefContext childReferencingCtx = null;
300 if (referencedByCtx != null) {
301 childReferencedByCtx = referencedByCtx
302 .getReferencedChildByName(qname);
304 if (referencingCtx != null) {
305 childReferencingCtx = referencingCtx
306 .getReferencingChildByName(qname);
308 if (childReferencedByCtx != null
309 || childReferencingCtx != null) {
310 final YangInstanceIdentifier mapEntryNodeYangInstanceIdentifier = mapEntryYangInstanceIdentifier
311 .node(mapEntryNode.getIdentifier());
312 validateNodeData(mapEntryNode, childReferencedByCtx,
313 childReferencingCtx, modificationType,
314 mapEntryNodeYangInstanceIdentifier);
320 // FIXME if(node instance of UnkeyedListNode ...
323 private static LeafRefContext findReferencingCtxUnderChoice(
324 final LeafRefContext referencingCtx, final QName qname) {
326 final Map<QName, LeafRefContext> referencingChilds = referencingCtx
327 .getReferencingChilds();
328 final Set<Entry<QName, LeafRefContext>> childs = referencingChilds.entrySet();
329 for (final Entry<QName, LeafRefContext> child : childs) {
330 final LeafRefContext referencingChildByName = child.getValue()
331 .getReferencingChildByName(qname);
332 if (referencingChildByName != null) {
333 return referencingChildByName;
340 private static LeafRefContext findReferencedByCtxUnderChoice(
341 final LeafRefContext referencedByCtx, final QName qname) {
343 final Map<QName, LeafRefContext> referencedByChilds = referencedByCtx
344 .getReferencedByChilds();
345 final Set<Entry<QName, LeafRefContext>> childs = referencedByChilds
347 for (final Entry<QName, LeafRefContext> child : childs) {
348 final LeafRefContext referencedByChildByName = child.getValue()
349 .getReferencedChildByName(qname);
350 if (referencedByChildByName != null) {
351 return referencedByChildByName;
358 @SuppressWarnings("rawtypes")
359 private void validateLeafRefTargetNodeData(final NormalizedNode<?, ?> leaf,
360 final LeafRefContext referencedByCtx, final ModificationType modificationType) {
362 final StringBuilder header_log = new StringBuilder();
363 final StringBuilder log = new StringBuilder();
364 header_log.append("Operation [" + modificationType
365 + "] validate data of leafref TARGET node: name["
366 + referencedByCtx.getNodeName() + "] = value["
367 + leaf.getValue() + "]");
369 if (validatedLeafRefCtx.contains(referencedByCtx)) {
370 header_log.append(" -> SKIP: Already validated");
371 LOG.debug(header_log.toString());
375 final Map<QName, LeafRefContext> allReferencedByLeafRefCtxs = referencedByCtx
376 .getAllReferencedByLeafRefCtxs();
378 final Map<LeafRefContext, Set> leafRefsValues = new HashMap<>();
379 final Collection<LeafRefContext> leafrefs = allReferencedByLeafRefCtxs
381 for (final LeafRefContext leafRefContext : leafrefs) {
382 if (leafRefContext.isReferencing()) {
383 final Set<Object> values = new HashSet<>();
385 final SchemaPath leafRefNodeSchemaPath = leafRefContext
386 .getCurrentNodePath();
387 final LeafRefPath leafRefNodePath = LeafRefUtils
388 .schemaPathToLeafRefPath(leafRefNodeSchemaPath,
389 leafRefContext.getLeafRefContextModule());
390 final Iterable<QNameWithPredicate> pathFromRoot = leafRefNodePath
392 addValues(values, tree.getRootNode().getDataAfter(),
393 pathFromRoot, null, QNameWithPredicate.ROOT);
394 leafRefsValues.put(leafRefContext, values);
398 final Set<Object> leafRefTargetNodeValues = new HashSet<>();
399 final SchemaPath nodeSchemaPath = referencedByCtx.getCurrentNodePath();
400 final LeafRefPath nodePath = LeafRefUtils.schemaPathToLeafRefPath(
401 nodeSchemaPath, referencedByCtx.getLeafRefContextModule());
402 addValues(leafRefTargetNodeValues, tree.getRootNode().getDataAfter(),
403 nodePath.getPathFromRoot(), null, QNameWithPredicate.ROOT);
405 boolean valid = true;
406 final Set<Entry<LeafRefContext, Set>> entrySet = leafRefsValues
408 for (final Entry<LeafRefContext, Set> entry : entrySet) {
409 final LeafRefContext leafRefContext = entry.getKey();
410 final Set leafRefValuesSet = entry.getValue();
411 for (final Object leafRefsValue : leafRefValuesSet) {
412 if (!leafRefTargetNodeValues.contains(leafRefsValue)) {
414 final StringBuilder sb = createInvalidTargetMessage(leaf,
415 leafRefTargetNodeValues, leafRefContext,
417 log.append(NEW_LINE);
418 log.append(sb.toString());
422 errorsMessages.add(sb.toString());
426 log.append(NEW_LINE);
427 log.append("Valid leafref value [");
428 log.append(leafRefsValue);
435 header_log.append(valid ? SUCCESS : FAILED);
436 LOG.debug(header_log.append(log.toString()).toString());
438 validatedLeafRefCtx.add(referencedByCtx);
441 private static StringBuilder createInvalidTargetMessage(final NormalizedNode<?, ?> leaf,
442 final Set<?> leafRefTargetNodeValues, final LeafRefContext leafRefContext,
443 final Object leafRefsValue) {
444 final StringBuilder sb = new StringBuilder();
445 sb.append("Invalid leafref value [");
446 sb.append(leafRefsValue);
447 sb.append("] allowed values ");
448 sb.append(leafRefTargetNodeValues);
449 sb.append(" by validation of leafref TARGET node: ");
450 sb.append(leaf.getNodeType());
451 sb.append(" path of invalid LEAFREF node: ");
452 sb.append(leafRefContext.getCurrentNodePath());
453 sb.append(" leafRef target path: ");
454 sb.append(leafRefContext.getAbsoluteLeafRefTargetPath());
458 private void validateLeafRefNodeData(final NormalizedNode<?, ?> leaf,
459 final LeafRefContext referencingCtx, final ModificationType modificationType,
460 final YangInstanceIdentifier current) {
462 final StringBuilder headerLog = new StringBuilder();
463 final StringBuilder log = new StringBuilder();
465 headerLog.append("Operation [");
466 headerLog.append(modificationType);
467 headerLog.append("] validate data of LEAFREF node: name[");
468 headerLog.append(referencingCtx.getNodeName());
469 headerLog.append("] = value[");
470 headerLog.append(leaf.getValue());
471 headerLog.append(']');
473 final HashSet<Object> values = new HashSet<>();
474 final LeafRefPath targetPath = referencingCtx.getAbsoluteLeafRefTargetPath();
475 final Iterable<QNameWithPredicate> pathFromRoot = targetPath
478 addValues(values, tree.getRootNode().getDataAfter(), pathFromRoot,
479 current, QNameWithPredicate.ROOT);
481 if (!values.contains(leaf.getValue())) {
482 final StringBuilder sb = createInvalidLeafRefMessage(leaf,
483 referencingCtx, values);
484 errorsMessages.add(sb.toString());
486 headerLog.append(FAILED);
487 log.append(sb.toString());
489 headerLog.append(SUCCESS);
492 LOG.debug(headerLog.toString());
493 if (log.length() != 0) {
494 LOG.debug(log.toString());
498 private static StringBuilder createInvalidLeafRefMessage(
499 final NormalizedNode<?, ?> leaf, final LeafRefContext referencingCtx,
500 final Set<?> values) {
501 final StringBuilder sb = new StringBuilder();
502 sb.append("Invalid leafref value [");
503 sb.append(leaf.getValue());
504 sb.append("] allowed values ");
506 sb.append(" of LEAFREF node: ");
507 sb.append(leaf.getNodeType());
508 sb.append(" leafRef target path: ");
509 sb.append(referencingCtx.getAbsoluteLeafRefTargetPath());
514 private void addValues(final Set<Object> values,
515 final Optional<? extends NormalizedNode<?, ?>> optDataNode,
516 final Iterable<QNameWithPredicate> path, final YangInstanceIdentifier current,
517 final QNameWithPredicate previousQName) {
519 if (!optDataNode.isPresent()) {
522 final NormalizedNode<?, ?> node = optDataNode.get();
524 if (node instanceof LeafNode || node instanceof LeafSetEntryNode) {
525 values.add(node.getValue());
527 } else if (node instanceof LeafSetNode<?>) {
528 final LeafSetNode<?> leafSetNode = (LeafSetNode<?>) node;
529 final Iterable<? extends NormalizedNode<?, ?>> entries = leafSetNode
531 for (final NormalizedNode<?, ?> entry : entries) {
532 values.add(entry.getValue());
537 final Iterator<QNameWithPredicate> iterator = path.iterator();
538 if (!iterator.hasNext()) {
541 final QNameWithPredicate qnameWithPredicate = iterator.next();
542 final QName qName = qnameWithPredicate.getQName();
543 final PathArgument pathArgument = toPathArgument(qName);
545 if (node instanceof DataContainerNode) {
546 final DataContainerNode<?> dataContainerNode = (DataContainerNode<?>) node;
547 final Optional<DataContainerChild<? extends PathArgument, ?>> child = dataContainerNode
548 .getChild(pathArgument);
550 if (child.isPresent()) {
551 addValues(values, child, nextLevel(path), current,
554 final Iterable<ChoiceNode> choiceNodes = getChoiceNodes(dataContainerNode);
555 for (final ChoiceNode choiceNode : choiceNodes) {
556 addValues(values, Optional.of(choiceNode), path, current,
561 } else if (node instanceof MapNode) {
562 final MapNode map = (MapNode) node;
563 final List<QNamePredicate> qNamePredicates = previousQName
564 .getQNamePredicates();
565 if (qNamePredicates.isEmpty() || current == null) {
566 final Iterable<MapEntryNode> value = map.getValue();
567 for (final MapEntryNode mapEntryNode : value) {
568 final Optional<DataContainerChild<? extends PathArgument, ?>> child = mapEntryNode
569 .getChild(pathArgument);
571 if (child.isPresent()) {
572 addValues(values, child, nextLevel(path), current,
575 final Iterable<ChoiceNode> choiceNodes = getChoiceNodes(mapEntryNode);
576 for (final ChoiceNode choiceNode : choiceNodes) {
577 addValues(values, Optional.of(choiceNode), path,
578 current, qnameWithPredicate);
583 final Map<QName, Set<?>> keyValues = new HashMap<>();
585 final Iterator<QNamePredicate> predicates = qNamePredicates
587 while (predicates.hasNext()) {
588 final QNamePredicate predicate = predicates.next();
589 final QName identifier = predicate.getIdentifier();
590 final LeafRefPath predicatePathKeyExpression = predicate
591 .getPathKeyExpression();
593 final Set<?> pathKeyExprValues = getPathKeyExpressionValues(
594 predicatePathKeyExpression, current);
596 keyValues.put(identifier, pathKeyExprValues);
599 final Iterable<MapEntryNode> mapEntryNodes = map.getValue();
600 for (final MapEntryNode mapEntryNode : mapEntryNodes) {
601 if (isMatchingPredicate(mapEntryNode, keyValues)) {
602 final Optional<DataContainerChild<? extends PathArgument, ?>> child = mapEntryNode
603 .getChild(pathArgument);
605 if (child.isPresent()) {
606 addValues(values, child, nextLevel(path), current,
609 final Iterable<ChoiceNode> choiceNodes = getChoiceNodes(mapEntryNode);
610 for (final ChoiceNode choiceNode : choiceNodes) {
611 addValues(values, Optional.of(choiceNode),
612 path, current, qnameWithPredicate);
622 private static Iterable<ChoiceNode> getChoiceNodes(final DataContainerNode<?> dataContainerNode) {
624 final LinkedList<ChoiceNode> choiceNodes = new LinkedList<ChoiceNode>();
626 final Iterable<DataContainerChild<? extends PathArgument, ?>> childs = dataContainerNode
628 for (final DataContainerChild<? extends PathArgument, ?> child : childs) {
629 if (child instanceof ChoiceNode) {
630 choiceNodes.add((ChoiceNode) child);
636 private static boolean isMatchingPredicate(final MapEntryNode mapEntryNode,
637 final Map<QName, Set<?>> allowedKeyValues) {
639 final NodeIdentifierWithPredicates identifier = mapEntryNode.getIdentifier();
640 final Map<QName, Object> entryKeyValues = identifier.getKeyValues();
642 final Set<Entry<QName, Object>> entryKeyValueSet = entryKeyValues.entrySet();
643 for (final Entry<QName, Object> entryKeyValue : entryKeyValueSet) {
644 final QName key = entryKeyValue.getKey();
645 final Object value = entryKeyValue.getValue();
647 final Set<?> allowedValues = allowedKeyValues.get(key);
648 if (allowedValues != null && !allowedValues.contains(value)) {
657 private Set<?> getPathKeyExpressionValues(
658 final LeafRefPath predicatePathKeyExpression,
659 final YangInstanceIdentifier current) {
661 final Optional<NormalizedNode<?, ?>> parent = findParentNode(tree
662 .getRootNode().getDataAfter(), current);
664 final Iterable<QNameWithPredicate> predicatePathExpr = predicatePathKeyExpression
666 final Iterable<QNameWithPredicate> predicatePath = nextLevel(predicatePathExpr);
668 final Set<Object> values = new HashSet<>();
669 if (parent != null) {
670 addValues(values, parent, predicatePath, null,
671 QNameWithPredicate.ROOT);
677 private static Optional<NormalizedNode<?, ?>> findParentNode(
678 final Optional<NormalizedNode<?, ?>> root, final YangInstanceIdentifier path) {
679 Optional<NormalizedNode<?, ?>> currentNode = root;
680 final Iterator<PathArgument> pathIterator = path.getPathArguments()
682 while (pathIterator.hasNext()) {
683 final PathArgument childPathArgument = pathIterator.next();
684 if (pathIterator.hasNext() && currentNode.isPresent()) {
685 currentNode = NormalizedNodes.getDirectChild(currentNode.get(),
691 return Optional.absent();
694 private static Iterable<QNameWithPredicate> nextLevel(final Iterable<QNameWithPredicate> path) {
695 return Iterables.skip(path, 1);
698 private static PathArgument toPathArgument(final QName qName) {
699 return YangInstanceIdentifier.of(qName).getLastPathArgument();