mirror of
https://github.com/openjdk/jdk.git
synced 2025-08-28 15:24:43 +02:00
8187443: Forest Consolidation: Move files to unified layout
Reviewed-by: darcy, ihse
This commit is contained in:
parent
270fe13182
commit
3789983e89
56923 changed files with 3 additions and 15727 deletions
|
@ -0,0 +1,109 @@
|
|||
/*
|
||||
* Copyright (c) 2015, 2016, Oracle and/or its affiliates. All rights reserved.
|
||||
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||||
*
|
||||
* This code is free software; you can redistribute it and/or modify it
|
||||
* under the terms of the GNU General Public License version 2 only, as
|
||||
* published by the Free Software Foundation. Oracle designates this
|
||||
* particular file as subject to the "Classpath" exception as provided
|
||||
* by Oracle in the LICENSE file that accompanied this code.
|
||||
*
|
||||
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||||
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||||
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||||
* version 2 for more details (a copy is included in the LICENSE file that
|
||||
* accompanied this code).
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License version
|
||||
* 2 along with this work; if not, write to the Free Software Foundation,
|
||||
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||||
*
|
||||
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||||
* or visit www.oracle.com if you need additional information or have any
|
||||
* questions.
|
||||
*/
|
||||
|
||||
package sun.security.util;
|
||||
|
||||
import java.security.AccessController;
|
||||
import java.security.AlgorithmConstraints;
|
||||
import java.security.PrivilegedAction;
|
||||
import java.security.Security;
|
||||
import java.util.Set;
|
||||
|
||||
/**
|
||||
* The class contains common functionality for algorithm constraints classes.
|
||||
*/
|
||||
public abstract class AbstractAlgorithmConstraints
|
||||
implements AlgorithmConstraints {
|
||||
|
||||
protected final AlgorithmDecomposer decomposer;
|
||||
|
||||
protected AbstractAlgorithmConstraints(AlgorithmDecomposer decomposer) {
|
||||
this.decomposer = decomposer;
|
||||
}
|
||||
|
||||
// Get algorithm constraints from the specified security property.
|
||||
static String[] getAlgorithms(String propertyName) {
|
||||
String property = AccessController.doPrivileged(
|
||||
new PrivilegedAction<String>() {
|
||||
@Override
|
||||
public String run() {
|
||||
return Security.getProperty(propertyName);
|
||||
}
|
||||
});
|
||||
|
||||
String[] algorithmsInProperty = null;
|
||||
if (property != null && !property.isEmpty()) {
|
||||
// remove double quote marks from beginning/end of the property
|
||||
if (property.length() >= 2 && property.charAt(0) == '"' &&
|
||||
property.charAt(property.length() - 1) == '"') {
|
||||
property = property.substring(1, property.length() - 1);
|
||||
}
|
||||
algorithmsInProperty = property.split(",");
|
||||
for (int i = 0; i < algorithmsInProperty.length; i++) {
|
||||
algorithmsInProperty[i] = algorithmsInProperty[i].trim();
|
||||
}
|
||||
}
|
||||
|
||||
// map the disabled algorithms
|
||||
if (algorithmsInProperty == null) {
|
||||
algorithmsInProperty = new String[0];
|
||||
}
|
||||
return algorithmsInProperty;
|
||||
}
|
||||
|
||||
static boolean checkAlgorithm(String[] algorithms, String algorithm,
|
||||
AlgorithmDecomposer decomposer) {
|
||||
if (algorithm == null || algorithm.length() == 0) {
|
||||
throw new IllegalArgumentException("No algorithm name specified");
|
||||
}
|
||||
|
||||
Set<String> elements = null;
|
||||
for (String item : algorithms) {
|
||||
if (item == null || item.isEmpty()) {
|
||||
continue;
|
||||
}
|
||||
|
||||
// check the full name
|
||||
if (item.equalsIgnoreCase(algorithm)) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// decompose the algorithm into sub-elements
|
||||
if (elements == null) {
|
||||
elements = decomposer.decompose(algorithm);
|
||||
}
|
||||
|
||||
// check the items of the algorithm
|
||||
for (String element : elements) {
|
||||
if (item.equalsIgnoreCase(element)) {
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue