1. /*
  2. * The Apache Software License, Version 1.1
  3. *
  4. *
  5. * Copyright (c) 1999 The Apache Software Foundation. All rights
  6. * reserved.
  7. *
  8. * Redistribution and use in source and binary forms, with or without
  9. * modification, are permitted provided that the following conditions
  10. * are met:
  11. *
  12. * 1. Redistributions of source code must retain the above copyright
  13. * notice, this list of conditions and the following disclaimer.
  14. *
  15. * 2. Redistributions in binary form must reproduce the above copyright
  16. * notice, this list of conditions and the following disclaimer in
  17. * the documentation and/or other materials provided with the
  18. * distribution.
  19. *
  20. * 3. The end-user documentation included with the redistribution,
  21. * if any, must include the following acknowledgment:
  22. * "This product includes software developed by the
  23. * Apache Software Foundation (http://www.apache.org/)."
  24. * Alternately, this acknowledgment may appear in the software itself,
  25. * if and wherever such third-party acknowledgments normally appear.
  26. *
  27. * 4. The names "Xalan" and "Apache Software Foundation" must
  28. * not be used to endorse or promote products derived from this
  29. * software without prior written permission. For written
  30. * permission, please contact apache@apache.org.
  31. *
  32. * 5. Products derived from this software may not be called "Apache",
  33. * nor may "Apache" appear in their name, without prior written
  34. * permission of the Apache Software Foundation.
  35. *
  36. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
  37. * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  38. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  39. * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
  40. * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  41. * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  42. * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
  43. * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  44. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
  45. * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
  46. * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  47. * SUCH DAMAGE.
  48. * ====================================================================
  49. *
  50. * This software consists of voluntary contributions made by many
  51. * individuals on behalf of the Apache Software Foundation and was
  52. * originally based on software copyright (c) 1999, Lotus
  53. * Development Corporation., http://www.lotus.com. For more
  54. * information on the Apache Software Foundation, please see
  55. * <http://www.apache.org/>.
  56. */
  57. package org.apache.xpath.patterns;
  58. import org.apache.xpath.XPathContext;
  59. import org.apache.xpath.objects.XObject;
  60. import org.apache.xml.dtm.DTM;
  61. import org.apache.xml.dtm.DTMFilter;
  62. import org.apache.xml.dtm.DTMAxisTraverser;
  63. import org.apache.xml.dtm.Axis;
  64. import org.apache.xpath.axes.WalkerFactory; // evil import.
  65. /**
  66. * Special context node pattern matcher.
  67. */
  68. public class ContextMatchStepPattern extends StepPattern
  69. {
  70. /**
  71. * Construct a ContextMatchStepPattern.
  72. *
  73. * @param whatToShow Bit set defined mainly by {@link org.w3c.dom.traversal.NodeFilter}.
  74. */
  75. public ContextMatchStepPattern(int axis, int paxis)
  76. {
  77. super(DTMFilter.SHOW_ALL, axis, paxis);
  78. }
  79. /**
  80. * Execute this pattern step, including predicates.
  81. *
  82. *
  83. * @param xctxt XPath runtime context.
  84. *
  85. * @return {@link org.apache.xpath.patterns.NodeTest#SCORE_NODETEST},
  86. * {@link org.apache.xpath.patterns.NodeTest#SCORE_NONE},
  87. * {@link org.apache.xpath.patterns.NodeTest#SCORE_NSWILD},
  88. * {@link org.apache.xpath.patterns.NodeTest#SCORE_QNAME}, or
  89. * {@link org.apache.xpath.patterns.NodeTest#SCORE_OTHER}.
  90. *
  91. * @throws javax.xml.transform.TransformerException
  92. */
  93. public XObject execute(XPathContext xctxt)
  94. throws javax.xml.transform.TransformerException
  95. {
  96. if (xctxt.getIteratorRoot() == xctxt.getCurrentNode())
  97. return getStaticScore();
  98. else
  99. return this.SCORE_NONE;
  100. }
  101. /**
  102. * Execute the match pattern step relative to another step.
  103. *
  104. *
  105. * @param xctxt The XPath runtime context.
  106. * NEEDSDOC @param prevStep
  107. *
  108. * @return {@link org.apache.xpath.patterns.NodeTest#SCORE_NODETEST},
  109. * {@link org.apache.xpath.patterns.NodeTest#SCORE_NONE},
  110. * {@link org.apache.xpath.patterns.NodeTest#SCORE_NSWILD},
  111. * {@link org.apache.xpath.patterns.NodeTest#SCORE_QNAME}, or
  112. * {@link org.apache.xpath.patterns.NodeTest#SCORE_OTHER}.
  113. *
  114. * @throws javax.xml.transform.TransformerException
  115. */
  116. public XObject executeRelativePathPattern(
  117. XPathContext xctxt, StepPattern prevStep)
  118. throws javax.xml.transform.TransformerException
  119. {
  120. XObject score = NodeTest.SCORE_NONE;
  121. int context = xctxt.getCurrentNode();
  122. DTM dtm = xctxt.getDTM(context);
  123. if (null != dtm)
  124. {
  125. int predContext = xctxt.getCurrentNode();
  126. DTMAxisTraverser traverser;
  127. int axis = m_axis;
  128. boolean needToTraverseAttrs = WalkerFactory.isDownwardAxisOfMany(axis);
  129. boolean iterRootIsAttr = (dtm.getNodeType(xctxt.getIteratorRoot())
  130. == DTM.ATTRIBUTE_NODE);
  131. if((Axis.PRECEDING == axis) && iterRootIsAttr)
  132. {
  133. axis = Axis.PRECEDINGANDANCESTOR;
  134. }
  135. traverser = dtm.getAxisTraverser(axis);
  136. for (int relative = traverser.first(context); DTM.NULL != relative;
  137. relative = traverser.next(context, relative))
  138. {
  139. try
  140. {
  141. xctxt.pushCurrentNode(relative);
  142. score = execute(xctxt);
  143. if (score != NodeTest.SCORE_NONE)
  144. {
  145. //score = executePredicates( xctxt, prevStep, SCORE_OTHER,
  146. // predContext, relative);
  147. if (executePredicates(xctxt, dtm, context))
  148. return score;
  149. score = NodeTest.SCORE_NONE;
  150. }
  151. if(needToTraverseAttrs && iterRootIsAttr
  152. && (DTM.ELEMENT_NODE == dtm.getNodeType(relative)))
  153. {
  154. int xaxis = Axis.ATTRIBUTE;
  155. for (int i = 0; i < 2; i++)
  156. {
  157. DTMAxisTraverser atraverser = dtm.getAxisTraverser(xaxis);
  158. for (int arelative = atraverser.first(relative);
  159. DTM.NULL != arelative;
  160. arelative = atraverser.next(relative, arelative))
  161. {
  162. try
  163. {
  164. xctxt.pushCurrentNode(arelative);
  165. score = execute(xctxt);
  166. if (score != NodeTest.SCORE_NONE)
  167. {
  168. //score = executePredicates( xctxt, prevStep, SCORE_OTHER,
  169. // predContext, arelative);
  170. if (score != NodeTest.SCORE_NONE)
  171. return score;
  172. }
  173. }
  174. finally
  175. {
  176. xctxt.popCurrentNode();
  177. }
  178. }
  179. xaxis = Axis.NAMESPACE;
  180. }
  181. }
  182. }
  183. finally
  184. {
  185. xctxt.popCurrentNode();
  186. }
  187. }
  188. }
  189. return score;
  190. }
  191. }