1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217
  
     | 
    
      /*
* JBoss, Home of Professional Open Source
* Copyright 2005, JBoss Inc., and individual contributors as indicated
* by the @authors tag. See the copyright.txt in the distribution for a
* full listing of individual contributors.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This software 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
*/
package org.jboss.ws.extensions.security;
import java.util.ArrayList;
import java.util.List;
import javax.xml.namespace.QName;
import org.w3c.dom.Element;
import org.w3c.dom.Node;
/**
 * @author Jason T. Greene
 * @version $Id: Util.java 1757 2006-12-22 15:40:24Z thomas.diesler@jboss.com $
 */
public class Util
{
   public static int count = 0;
   public static String assignWsuId(Element element)
   {
      String id = element.getAttributeNS(Constants.WSU_NS, Constants.ID);
      if (id == null || id.length() < 1)
      {
         id = generateId();
         element.setAttributeNS(Constants.WSU_NS, Constants.WSU_ID, id);
         addNamespace(element, Constants.WSU_PREFIX, Constants.WSU_NS);
      }
      return id;
   }
   public static Element getFirstChildElement(Node node)
   {
      Node child = node.getFirstChild();
      while (child != null && child.getNodeType() != Node.ELEMENT_NODE)
         child = child.getNextSibling();
      return (Element)child;
   }
   public static Element getNextSiblingElement(Element element)
   {
      Node sibling = element.getNextSibling();
      while (sibling != null && sibling.getNodeType() != Node.ELEMENT_NODE)
         sibling = sibling.getNextSibling();
      return (Element)sibling;
   }
   public static Element getPreviousSiblingElement(Element element)
   {
      Node sibling = element.getPreviousSibling();
      while (sibling != null && sibling.getNodeType() != Node.ELEMENT_NODE)
         sibling = sibling.getPreviousSibling();
      return (Element)sibling;
   }
   public static Element findElement(Element root, String localName, String namespace)
   {
      return findElement(root, new QName(namespace, localName));
   }
   public static Element findElement(Element root, QName name)
   {
      // Here lies your standard recusive DFS.....
      if (matchNode(root, name))
         return root;
      // Search children
      for (Node child = root.getFirstChild(); child != null; child = child.getNextSibling())
      {
         if (child.getNodeType() != Node.ELEMENT_NODE)
            continue;
         Node possibleMatch = findElement((Element)child, name);
         if (possibleMatch != null)
            return (Element)possibleMatch;
      }
      return null;
   }
   public static List<Node> findAllElements(Element root, QName name, boolean local)
   {
      List<Node> list = new ArrayList<Node>();
      if (matchNode(root, name, local))
         list.add(root);
      for (Node child = root.getFirstChild(); child != null; child = child.getNextSibling())
      {
         if (child.getNodeType() != Node.ELEMENT_NODE)
            continue;
         list.addAll(findAllElements((Element) child, name, local));
      }
      return list;
   }
   public static Element findElementByWsuId(Element root, String id)
   {
      // Here lies another standard recusive DFS.....
      if (id.equals(getWsuId(root)))
         return root;
      // Search children
      for (Node child = root.getFirstChild(); child != null; child = child.getNextSibling())
      {
         if (child.getNodeType() != Node.ELEMENT_NODE)
            continue;
         Node possibleMatch = findElementByWsuId((Element)child, id);
         if (possibleMatch != null)
            return (Element)possibleMatch;
      }
      return null;
   }
   public static Element findOrCreateSoapHeader(Element envelope)
   {
      String prefix = envelope.getPrefix();
      String uri = envelope.getNamespaceURI();
      QName name = new QName(uri, "Header");
      Element header = findElement(envelope, name);
      if (header == null)
      {
         header = envelope.getOwnerDocument().createElementNS(uri, prefix + ":Header");
         envelope.insertBefore(header, envelope.getFirstChild());
      }
      return header;
   }
   public static String getWsuId(Element element)
   {
      if (element.hasAttributeNS(Constants.WSU_NS, Constants.ID))
         return element.getAttributeNS(Constants.WSU_NS, Constants.ID);
      if (element.hasAttribute(Constants.ID))
      {
         String ns = element.getNamespaceURI();
         if (Constants.XML_SIGNATURE_NS.equals(ns) || Constants.XML_ENCRYPTION_NS.equals(ns))
            return element.getAttribute(Constants.ID);
      }
      return null;
   }
   public static boolean equalStrings(String string1, String string2)
   {
      if (string1 == null && string2 == null)
         return true;
      return string1 != null && string1.equals(string2);
   }
   public static boolean matchNode(Node node, QName name)
   {
      return matchNode(node, name, false);
   }
   public static boolean matchNode(Node node, QName name, boolean local)
   {
      return equalStrings(node.getLocalName(), name.getLocalPart())
          && (local || equalStrings(node.getNamespaceURI(), name.getNamespaceURI()));
   }
   public static String generateId()
   {
      return generateId("element");
   }
   public static void addNamespace(Element element, String prefix, String uri)
   {
      element.setAttributeNS(Constants.XMLNS_NS, "xmlns:" + prefix, uri);
   }
   public static String generateId(String prefix)
   {
      StringBuilder id = new StringBuilder();
      long time = System.currentTimeMillis();
      // reasonably gaurantee uniqueness
      synchronized (Util.class)
      {
         count++;
      }
      id.append(prefix).append("-").append(count).append("-").append(time).append("-").append(id.hashCode());
      return id.toString();
   }
}
 
     |