Thu, 12 Oct 2017 19:44:07 +0800
merge
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. Oracle designates this |
aoqi@0 | 8 | * particular file as subject to the "Classpath" exception as provided |
aoqi@0 | 9 | * by Oracle in the LICENSE file that accompanied this code. |
aoqi@0 | 10 | * |
aoqi@0 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 15 | * accompanied this code). |
aoqi@0 | 16 | * |
aoqi@0 | 17 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 20 | * |
aoqi@0 | 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 22 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 23 | * questions. |
aoqi@0 | 24 | */ |
aoqi@0 | 25 | |
aoqi@0 | 26 | package com.sun.xml.internal.ws.policy; |
aoqi@0 | 27 | |
aoqi@0 | 28 | import com.sun.xml.internal.ws.policy.privateutil.PolicyLogger; |
aoqi@0 | 29 | import java.util.Collection; |
aoqi@0 | 30 | import java.util.LinkedList; |
aoqi@0 | 31 | import java.util.List; |
aoqi@0 | 32 | import java.util.Queue; |
aoqi@0 | 33 | import com.sun.xml.internal.ws.policy.privateutil.LocalizationMessages; |
aoqi@0 | 34 | import com.sun.xml.internal.ws.policy.sourcemodel.wspolicy.NamespaceVersion; |
aoqi@0 | 35 | import java.util.ArrayList; |
aoqi@0 | 36 | |
aoqi@0 | 37 | /** |
aoqi@0 | 38 | * The instance of this class is intended to provide policy intersection mechanism. |
aoqi@0 | 39 | * |
aoqi@0 | 40 | * @author Marek Potociar (marek.potociar@sun.com) |
aoqi@0 | 41 | */ |
aoqi@0 | 42 | public final class PolicyIntersector { |
aoqi@0 | 43 | static enum CompatibilityMode { |
aoqi@0 | 44 | STRICT, |
aoqi@0 | 45 | LAX |
aoqi@0 | 46 | } |
aoqi@0 | 47 | |
aoqi@0 | 48 | private static final PolicyIntersector STRICT_INTERSECTOR = new PolicyIntersector(CompatibilityMode.STRICT); |
aoqi@0 | 49 | private static final PolicyIntersector LAX_INTERSECTOR = new PolicyIntersector(CompatibilityMode.LAX); |
aoqi@0 | 50 | private static final PolicyLogger LOGGER = PolicyLogger.getLogger(PolicyIntersector.class); |
aoqi@0 | 51 | |
aoqi@0 | 52 | private CompatibilityMode mode; |
aoqi@0 | 53 | |
aoqi@0 | 54 | /** |
aoqi@0 | 55 | * Prevents direct instantiation of this class from outside |
aoqi@0 | 56 | * @param intersectionMode intersection mode |
aoqi@0 | 57 | */ |
aoqi@0 | 58 | private PolicyIntersector(CompatibilityMode intersectionMode) { |
aoqi@0 | 59 | this.mode = intersectionMode; |
aoqi@0 | 60 | } |
aoqi@0 | 61 | |
aoqi@0 | 62 | /** |
aoqi@0 | 63 | * Returns a strict policy intersector that can be used to intersect group of policies. |
aoqi@0 | 64 | * |
aoqi@0 | 65 | * @return policy intersector instance. |
aoqi@0 | 66 | */ |
aoqi@0 | 67 | public static PolicyIntersector createStrictPolicyIntersector() { |
aoqi@0 | 68 | return PolicyIntersector.STRICT_INTERSECTOR; |
aoqi@0 | 69 | } |
aoqi@0 | 70 | |
aoqi@0 | 71 | /** |
aoqi@0 | 72 | * Returns a strict policy intersector that can be used to intersect group of policies. |
aoqi@0 | 73 | * |
aoqi@0 | 74 | * @return policy intersector instance. |
aoqi@0 | 75 | */ |
aoqi@0 | 76 | public static PolicyIntersector createLaxPolicyIntersector() { |
aoqi@0 | 77 | return PolicyIntersector.LAX_INTERSECTOR; |
aoqi@0 | 78 | } |
aoqi@0 | 79 | |
aoqi@0 | 80 | /** |
aoqi@0 | 81 | * Performs intersection on the input collection of policies and returns the resulting (intersected) policy. If input policy |
aoqi@0 | 82 | * collection contains only a single policy instance, no intersection is performed and the instance is directly returned |
aoqi@0 | 83 | * as a method call result. |
aoqi@0 | 84 | * |
aoqi@0 | 85 | * @param policies collection of policies to be intersected. Must not be {@code null} nor empty, otherwise exception is thrown. |
aoqi@0 | 86 | * @return intersected policy as a result of perfromed policy intersection. A {@code null} value is never returned. |
aoqi@0 | 87 | * |
aoqi@0 | 88 | * @throws IllegalArgumentException in case {@code policies} argument is either {@code null} or empty collection. |
aoqi@0 | 89 | */ |
aoqi@0 | 90 | public Policy intersect(final Policy... policies) { |
aoqi@0 | 91 | if (policies == null || policies.length == 0) { |
aoqi@0 | 92 | throw LOGGER.logSevereException(new IllegalArgumentException(LocalizationMessages.WSP_0056_NEITHER_NULL_NOR_EMPTY_POLICY_COLLECTION_EXPECTED())); |
aoqi@0 | 93 | } else if (policies.length == 1) { |
aoqi@0 | 94 | return policies[0]; |
aoqi@0 | 95 | } |
aoqi@0 | 96 | |
aoqi@0 | 97 | // check for "null" and "empty" policy: if such policy is found return "null" policy, |
aoqi@0 | 98 | // or if all policies are "empty", return "empty" policy |
aoqi@0 | 99 | boolean found = false; |
aoqi@0 | 100 | boolean allPoliciesEmpty = true; |
aoqi@0 | 101 | NamespaceVersion latestVersion = null; |
aoqi@0 | 102 | for (Policy tested : policies) { |
aoqi@0 | 103 | if (tested.isEmpty()) { |
aoqi@0 | 104 | found = true; |
aoqi@0 | 105 | } else { |
aoqi@0 | 106 | if (tested.isNull()) { |
aoqi@0 | 107 | found = true; |
aoqi@0 | 108 | } |
aoqi@0 | 109 | allPoliciesEmpty = false; |
aoqi@0 | 110 | } |
aoqi@0 | 111 | if (latestVersion == null) { |
aoqi@0 | 112 | latestVersion = tested.getNamespaceVersion(); |
aoqi@0 | 113 | } else if (latestVersion.compareTo(tested.getNamespaceVersion()) < 0) { |
aoqi@0 | 114 | latestVersion = tested.getNamespaceVersion(); |
aoqi@0 | 115 | } |
aoqi@0 | 116 | |
aoqi@0 | 117 | if (found && !allPoliciesEmpty) { |
aoqi@0 | 118 | return Policy.createNullPolicy(latestVersion, null, null); |
aoqi@0 | 119 | } |
aoqi@0 | 120 | } |
aoqi@0 | 121 | latestVersion = (latestVersion != null) ? latestVersion : NamespaceVersion.getLatestVersion(); |
aoqi@0 | 122 | if (allPoliciesEmpty) { |
aoqi@0 | 123 | return Policy.createEmptyPolicy(latestVersion, null, null); |
aoqi@0 | 124 | } |
aoqi@0 | 125 | |
aoqi@0 | 126 | // simple tests didn't lead to final answer => let's performe some intersecting ;) |
aoqi@0 | 127 | final List<AssertionSet> finalAlternatives = new LinkedList<AssertionSet>(policies[0].getContent()); |
aoqi@0 | 128 | final Queue<AssertionSet> testedAlternatives = new LinkedList<AssertionSet>(); |
aoqi@0 | 129 | final List<AssertionSet> alternativesToMerge = new ArrayList<AssertionSet>(2); |
aoqi@0 | 130 | for (int i = 1; i < policies.length; i++) { |
aoqi@0 | 131 | final Collection<AssertionSet> currentAlternatives = policies[i].getContent(); |
aoqi@0 | 132 | |
aoqi@0 | 133 | testedAlternatives.clear(); |
aoqi@0 | 134 | testedAlternatives.addAll(finalAlternatives); |
aoqi@0 | 135 | finalAlternatives.clear(); |
aoqi@0 | 136 | |
aoqi@0 | 137 | AssertionSet testedAlternative; |
aoqi@0 | 138 | while ((testedAlternative = testedAlternatives.poll()) != null) { |
aoqi@0 | 139 | for (AssertionSet currentAlternative : currentAlternatives) { |
aoqi@0 | 140 | if (testedAlternative.isCompatibleWith(currentAlternative, this.mode)) { |
aoqi@0 | 141 | alternativesToMerge.add(testedAlternative); |
aoqi@0 | 142 | alternativesToMerge.add(currentAlternative); |
aoqi@0 | 143 | finalAlternatives.add(AssertionSet.createMergedAssertionSet(alternativesToMerge)); |
aoqi@0 | 144 | alternativesToMerge.clear(); |
aoqi@0 | 145 | } |
aoqi@0 | 146 | } |
aoqi@0 | 147 | } |
aoqi@0 | 148 | } |
aoqi@0 | 149 | |
aoqi@0 | 150 | return Policy.createPolicy(latestVersion, null, null, finalAlternatives); |
aoqi@0 | 151 | } |
aoqi@0 | 152 | } |