📄 interpreter.java
字号:
/*
* Copyright (c) 2006, University of Kent
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
*
* Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 1. Neither the name of the University of Kent nor the names of its
* contributors may be used to endorse or promote products derived from this
* software without specific prior written permission.
*
* 2. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED.
*
* 3. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* 4. YOU AGREE THAT THE EXCLUSIONS IN PARAGRAPHS 2 AND 3 ABOVE ARE REASONABLE
* IN THE CIRCUMSTANCES. IN PARTICULAR, YOU ACKNOWLEDGE (1) THAT THIS
* SOFTWARE HAS BEEN MADE AVAILABLE TO YOU FREE OF CHARGE, (2) THAT THIS
* SOFTWARE IS NOT "PRODUCT" QUALITY, BUT HAS BEEN PRODUCED BY A RESEARCH
* GROUP WHO DESIRE TO MAKE THIS SOFTWARE FREELY AVAILABLE TO PEOPLE WHO WISH
* TO USE IT, AND (3) THAT BECAUSE THIS SOFTWARE IS NOT OF "PRODUCT" QUALITY
* IT IS INEVITABLE THAT THERE WILL BE BUGS AND ERRORS, AND POSSIBLY MORE
* SERIOUS FAULTS, IN THIS SOFTWARE.
*
* 5. This license is governed, except to the extent that local laws
* necessarily apply, by the laws of England and Wales.
*/
/*
* Interpreter.java
*
* Created on 10 April 2006, 11:22
*
* To change this template, choose Tools | Template Manager
* and open the template in the editor.
*/
package issrg.web.service;
import org.w3c.dom.*;
import java.util.ArrayList;
import java.util.Iterator;
/**
*
* @author ls97
*/
public class Interpreter {
public static int PUSH = 0;
public static int PULL = 1;
public static int INDETERMINATE = 2;
private Node context;
/** Creates a new instance of Interpreter */
public Interpreter(Node contextIn) {
this.context = contextIn;
}
/**
* return a valid subject DN; otherwise an empty string is returned
*
*/
public int getModel() {
if (this.context.getNodeName().equals("wst:RequestSecurityToken")) {
NodeList list = this.context.getChildNodes();
for (int i=0; i<list.getLength();i++) {
Node node = list.item(i);
if (node.getNodeName().equals("wst:Claims")) {
NamedNodeMap map = node.getAttributes();
for (int k=0; k<map.getLength(); k++) {
Node statement = map.item(k);
if (statement.getNodeName().equals("Dialect")) {
String value = statement.getNodeValue();
if (value.equals("urn:oasis:names:tc:SAML:2.0:assertion:AttributeStatementType"))
return this.PUSH;
if (value.equals("urn:oasis:names:tc:SAML:2.0:assertion:AuthnStatementType"))
return this.PULL;
}
}
}
}
}
return this.INDETERMINATE;
}
private Node getSamlAssertion() {
NodeList nodes=this.context.getChildNodes();
for (int i=0; i<nodes.getLength();i++) {
Node node = nodes.item(i);
if (Text.class.isAssignableFrom(node.getClass())) continue;
if (node.getNodeName().equals("wst:Claims")) {
NodeList children = node.getChildNodes();
for (int l=0; l<children.getLength(); l++) {
Node child = children.item(l);
if (Text.class.isAssignableFrom(child.getClass())) continue;
if (child.getNodeName().equals("saml:Assertion")) return child;
}
}
}
return null;
}
public String getSubjectDN() {
Node assertion = this.getSamlAssertion();
if (assertion==null) return null;
NodeList children = assertion.getChildNodes();
for (int i=0; i<children.getLength(); i++) {
Node node = children.item(i);
if (Text.class.isAssignableFrom(node.getClass())) continue;
if (node.getNodeName().equals("saml:Subject")) {
NodeList j = node.getChildNodes();
for (int k=0; k<j.getLength(); k++) {
Node gN = j.item(k);
if (Text.class.isAssignableFrom(gN.getClass())) continue;
if (gN.getNodeName().equals("saml:NameID")) {
NodeList fL = gN.getChildNodes();
if (fL.getLength()==1) {
Node fN = fL.item(0);
if (Text.class.isAssignableFrom(fN.getClass())) {
Text text = (Text)fN;
String str = text.getWholeText();
return str.trim();
}
}
}
}
}
}
return null;
}
private String getBinaryCertificate(Node nodeIn) {
String buf = null;
if (!nodeIn.getNodeName().equals("wsse:BinarySecurityToken")) return null;
NodeList nodes=nodeIn.getChildNodes();
if (nodes.getLength()==1){
Node child = nodes.item(0);
if (Text.class.isAssignableFrom(child.getClass())) {
String result = ((Text)child).getNodeValue();
buf = result.trim();
return buf;
}
}
return buf;
}
public String getContextRef() {
if (this.context.getNodeName().equals("wst:RequestSecurityToken")) {
NamedNodeMap nodeMap = this.context.getAttributes();
for (int i=0;i<nodeMap.getLength();i++) {
Node node = nodeMap.item(i);
if (node.getNodeName().equals("Context")) return node.getNodeValue();
}
}
return null;
}
public AttributeStatement[] getAttributeStatements() {
ArrayList statements = new ArrayList();
Node assertion = this.getSamlAssertion();
NodeList nodes = assertion.getChildNodes();
for (int i=0; i<nodes.getLength(); i++) {
Node node = nodes.item(i);
if (Text.class.isAssignableFrom(node.getClass())) continue;
if (node.getNodeName().equals("saml:AttributeStatement")) {
AttributeStatement attStatement = new AttributeStatement();
ArrayList list = new ArrayList();
NodeList children = node.getChildNodes();
for (int l=0;l<children.getLength();l++) {
Node ggchild = children.item(l);
if (Text.class.isAssignableFrom(ggchild.getClass())) continue;
if (ggchild.getNodeName().equals("saml:Attribute")) {
NamedNodeMap map = ggchild.getAttributes();
for (int m=0;m<map.getLength();m++) {
Node att = map.item(m);
if (att.getNodeName().equals("Name")) {
if (att.getNodeValue().equals("Repository")) {
NodeList gggNodes = ggchild.getChildNodes();
for (int n=0;n<gggNodes.getLength();n++) {
Node gggnode = gggNodes.item(n);
if (Text.class.isAssignableFrom(gggnode.getClass())) continue;
if (gggnode.getNodeName().equals("saml:AttributeValue")) {
NodeList soapNodes = gggnode.getChildNodes();
if (soapNodes.getLength()==1) {
Node soap = soapNodes.item(0);
if (Text.class.isAssignableFrom(soap.getClass())) {
String result = ((Text)soap).getNodeValue();
attStatement.setRepository(result.trim());
}
}
}
}
} else if (att.getNodeValue().equals("X509AttributeCertificate")) {
NodeList gggNodes = ggchild.getChildNodes();
for (int n=0;n<gggNodes.getLength();n++) {
Node gggnode = gggNodes.item(n);
if (Text.class.isAssignableFrom(gggnode.getClass())) continue;
if (gggnode.getNodeName().equals("saml:AttributeValue")) {
NodeList soapNodes = gggnode.getChildNodes();
for (int j=0; j<soapNodes.getLength(); j++) {
Node value = soapNodes.item(j);
if (Text.class.isAssignableFrom(value.getClass())) continue;
list.add(this.getBinaryCertificate(value));
}
}
}
}
}
}
}
}
String[] binary = new String[list.size()];
binary = (String[])list.toArray(binary);
attStatement.setBinaryTokens(binary);
statements.add(attStatement);
}
}
AttributeStatement [] as = new AttributeStatement[statements.size()];
as = (AttributeStatement[])statements.toArray(as);
return as;
}
public SubjectAttributeReference[] getSubAttrRefs() {
ArrayList references = new ArrayList();
Node assertion = this.getSamlAssertion();
NodeList nodes = assertion.getChildNodes();
for (int i=0; i<nodes.getLength(); i++) {
Node node = nodes.item(i);
if (Text.class.isAssignableFrom(node.getClass())) continue;
if (node.getNodeName().equals("saml:Advice")) {
ArrayList list = new ArrayList();
NodeList children = node.getChildNodes();
for (int l=0;l<children.getLength();l++) {
Node ggchild = children.item(l);
if (Text.class.isAssignableFrom(ggchild.getClass())) continue;
if (ggchild.getNodeName().equals("SubjectAttributeReferenceAdvice")) {
NodeList gggNodes = ggchild.getChildNodes();
for (int m=0;m<gggNodes.getLength();m++) {
Node gggnode = gggNodes.item(m);
if (Text.class.isAssignableFrom(gggnode.getClass())) continue;
if (gggnode.getNodeName().equals("ogsa-saml2:SubjectAttributeReference")) {
NamedNodeMap map = gggnode.getAttributes();
for (int n=0; n<map.getLength(); n++) {
Node attr = map.item(n);
if (attr.getNodeName().equals("Reference")) {
String uri = attr.getNodeValue();
NodeList attrChildren = attr.getChildNodes();
ArrayList atts = new ArrayList();
for (int j=0; j<attrChildren.getLength(); j++) {
Node g4Node = attrChildren.item(j);
if (Text.class.isAssignableFrom(g4Node.getClass())) continue;
if (g4Node.getNodeName().equals("saml:AttributeDesignator")) {
NamedNodeMap attOfAttrDes = g4Node.getAttributes();
for (int k=0; k<attOfAttrDes.getLength(); k++) {
Node attType = attOfAttrDes.item(k);
if (attType.getNodeName().equals("AttributeName")) {
atts.add(attType.getNodeValue());
}
}
}
}
String[] attNames = new String[atts.size()];
attNames = (String[])atts.toArray(attNames);
SubjectAttributeReference subAttRef = new SubjectAttributeReference(uri,attNames);
references.add(subAttRef);
}
}
}
}
}
}
}
}
SubjectAttributeReference [] sar = new SubjectAttributeReference[references.size()];
sar = (SubjectAttributeReference[])references.toArray(sar);
return sar;
}
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -