| <HTML> |
| <BODY BGCOLOR="white"> |
| <PRE> |
| <FONT color="green">001</FONT> /*<a name="line.1"></a> |
| <FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a> |
| <FONT color="green">003</FONT> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a> |
| <FONT color="green">004</FONT> * distributed with this work for additional information<a name="line.4"></a> |
| <FONT color="green">005</FONT> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a> |
| <FONT color="green">006</FONT> * to you under the Apache License, Version 2.0 (the "License");<a name="line.6"></a> |
| <FONT color="green">007</FONT> * you may not use this file except in compliance with the License.<a name="line.7"></a> |
| <FONT color="green">008</FONT> * You may obtain a copy of the License at<a name="line.8"></a> |
| <FONT color="green">009</FONT> *<a name="line.9"></a> |
| <FONT color="green">010</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a> |
| <FONT color="green">011</FONT> *<a name="line.11"></a> |
| <FONT color="green">012</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a> |
| <FONT color="green">013</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a> |
| <FONT color="green">014</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a> |
| <FONT color="green">015</FONT> * See the License for the specific language governing permissions and<a name="line.15"></a> |
| <FONT color="green">016</FONT> * limitations under the License.<a name="line.16"></a> |
| <FONT color="green">017</FONT> */<a name="line.17"></a> |
| <FONT color="green">018</FONT> /*<a name="line.18"></a> |
| <FONT color="green">019</FONT> * $Id: WalkerFactory.java 469314 2006-10-30 23:31:59Z minchau $<a name="line.19"></a> |
| <FONT color="green">020</FONT> */<a name="line.20"></a> |
| <FONT color="green">021</FONT> package org.apache.xpath.axes;<a name="line.21"></a> |
| <FONT color="green">022</FONT> <a name="line.22"></a> |
| <FONT color="green">023</FONT> import org.apache.xalan.res.XSLMessages;<a name="line.23"></a> |
| <FONT color="green">024</FONT> import org.apache.xml.dtm.Axis;<a name="line.24"></a> |
| <FONT color="green">025</FONT> import org.apache.xml.dtm.DTMFilter;<a name="line.25"></a> |
| <FONT color="green">026</FONT> import org.apache.xml.dtm.DTMIterator;<a name="line.26"></a> |
| <FONT color="green">027</FONT> import org.apache.xpath.Expression;<a name="line.27"></a> |
| <FONT color="green">028</FONT> import org.apache.xpath.compiler.Compiler;<a name="line.28"></a> |
| <FONT color="green">029</FONT> import org.apache.xpath.compiler.FunctionTable;<a name="line.29"></a> |
| <FONT color="green">030</FONT> import org.apache.xpath.compiler.OpCodes;<a name="line.30"></a> |
| <FONT color="green">031</FONT> import org.apache.xpath.compiler.OpMap;<a name="line.31"></a> |
| <FONT color="green">032</FONT> import org.apache.xpath.objects.XNumber;<a name="line.32"></a> |
| <FONT color="green">033</FONT> import org.apache.xpath.patterns.ContextMatchStepPattern;<a name="line.33"></a> |
| <FONT color="green">034</FONT> import org.apache.xpath.patterns.FunctionPattern;<a name="line.34"></a> |
| <FONT color="green">035</FONT> import org.apache.xpath.patterns.NodeTest;<a name="line.35"></a> |
| <FONT color="green">036</FONT> import org.apache.xpath.patterns.StepPattern;<a name="line.36"></a> |
| <FONT color="green">037</FONT> import org.apache.xpath.res.XPATHErrorResources;<a name="line.37"></a> |
| <FONT color="green">038</FONT> <a name="line.38"></a> |
| <FONT color="green">039</FONT> /**<a name="line.39"></a> |
| <FONT color="green">040</FONT> * This class is both a factory for XPath location path expressions,<a name="line.40"></a> |
| <FONT color="green">041</FONT> * which are built from the opcode map output, and an analysis engine<a name="line.41"></a> |
| <FONT color="green">042</FONT> * for the location path expressions in order to provide optimization hints.<a name="line.42"></a> |
| <FONT color="green">043</FONT> */<a name="line.43"></a> |
| <FONT color="green">044</FONT> public class WalkerFactory<a name="line.44"></a> |
| <FONT color="green">045</FONT> {<a name="line.45"></a> |
| <FONT color="green">046</FONT> <a name="line.46"></a> |
| <FONT color="green">047</FONT> /**<a name="line.47"></a> |
| <FONT color="green">048</FONT> * This method is for building an array of possible levels<a name="line.48"></a> |
| <FONT color="green">049</FONT> * where the target element(s) could be found for a match.<a name="line.49"></a> |
| <FONT color="green">050</FONT> * @param lpi The owning location path iterator.<a name="line.50"></a> |
| <FONT color="green">051</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.51"></a> |
| <FONT color="green">052</FONT> * the XPath operations into an opcode map.<a name="line.52"></a> |
| <FONT color="green">053</FONT> * @param stepOpCodePos The opcode position for the step.<a name="line.53"></a> |
| <FONT color="green">054</FONT> *<a name="line.54"></a> |
| <FONT color="green">055</FONT> * @return non-null AxesWalker derivative.<a name="line.55"></a> |
| <FONT color="green">056</FONT> *<a name="line.56"></a> |
| <FONT color="green">057</FONT> * @throws javax.xml.transform.TransformerException<a name="line.57"></a> |
| <FONT color="green">058</FONT> * @xsl.usage advanced<a name="line.58"></a> |
| <FONT color="green">059</FONT> */<a name="line.59"></a> |
| <FONT color="green">060</FONT> static AxesWalker loadOneWalker(<a name="line.60"></a> |
| <FONT color="green">061</FONT> WalkingIterator lpi, Compiler compiler, int stepOpCodePos)<a name="line.61"></a> |
| <FONT color="green">062</FONT> throws javax.xml.transform.TransformerException<a name="line.62"></a> |
| <FONT color="green">063</FONT> {<a name="line.63"></a> |
| <FONT color="green">064</FONT> <a name="line.64"></a> |
| <FONT color="green">065</FONT> AxesWalker firstWalker = null;<a name="line.65"></a> |
| <FONT color="green">066</FONT> int stepType = compiler.getOp(stepOpCodePos);<a name="line.66"></a> |
| <FONT color="green">067</FONT> <a name="line.67"></a> |
| <FONT color="green">068</FONT> if (stepType != OpCodes.ENDOP)<a name="line.68"></a> |
| <FONT color="green">069</FONT> {<a name="line.69"></a> |
| <FONT color="green">070</FONT> <a name="line.70"></a> |
| <FONT color="green">071</FONT> // m_axesWalkers = new AxesWalker[1];<a name="line.71"></a> |
| <FONT color="green">072</FONT> // As we unwind from the recursion, create the iterators.<a name="line.72"></a> |
| <FONT color="green">073</FONT> firstWalker = createDefaultWalker(compiler, stepType, lpi, 0);<a name="line.73"></a> |
| <FONT color="green">074</FONT> <a name="line.74"></a> |
| <FONT color="green">075</FONT> firstWalker.init(compiler, stepOpCodePos, stepType);<a name="line.75"></a> |
| <FONT color="green">076</FONT> }<a name="line.76"></a> |
| <FONT color="green">077</FONT> <a name="line.77"></a> |
| <FONT color="green">078</FONT> return firstWalker;<a name="line.78"></a> |
| <FONT color="green">079</FONT> }<a name="line.79"></a> |
| <FONT color="green">080</FONT> <a name="line.80"></a> |
| <FONT color="green">081</FONT> /**<a name="line.81"></a> |
| <FONT color="green">082</FONT> * This method is for building an array of possible levels<a name="line.82"></a> |
| <FONT color="green">083</FONT> * where the target element(s) could be found for a match.<a name="line.83"></a> |
| <FONT color="green">084</FONT> * @param lpi The owning location path iterator object.<a name="line.84"></a> |
| <FONT color="green">085</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.85"></a> |
| <FONT color="green">086</FONT> * the XPath operations into an opcode map.<a name="line.86"></a> |
| <FONT color="green">087</FONT> * @param stepOpCodePos The opcode position for the step.<a name="line.87"></a> |
| <FONT color="green">088</FONT> * @param stepIndex The top-level step index withing the iterator.<a name="line.88"></a> |
| <FONT color="green">089</FONT> *<a name="line.89"></a> |
| <FONT color="green">090</FONT> * @return non-null AxesWalker derivative.<a name="line.90"></a> |
| <FONT color="green">091</FONT> *<a name="line.91"></a> |
| <FONT color="green">092</FONT> * @throws javax.xml.transform.TransformerException<a name="line.92"></a> |
| <FONT color="green">093</FONT> * @xsl.usage advanced<a name="line.93"></a> |
| <FONT color="green">094</FONT> */<a name="line.94"></a> |
| <FONT color="green">095</FONT> static AxesWalker loadWalkers(<a name="line.95"></a> |
| <FONT color="green">096</FONT> WalkingIterator lpi, Compiler compiler, int stepOpCodePos, int stepIndex)<a name="line.96"></a> |
| <FONT color="green">097</FONT> throws javax.xml.transform.TransformerException<a name="line.97"></a> |
| <FONT color="green">098</FONT> {<a name="line.98"></a> |
| <FONT color="green">099</FONT> <a name="line.99"></a> |
| <FONT color="green">100</FONT> int stepType;<a name="line.100"></a> |
| <FONT color="green">101</FONT> AxesWalker firstWalker = null;<a name="line.101"></a> |
| <FONT color="green">102</FONT> AxesWalker walker, prevWalker = null;<a name="line.102"></a> |
| <FONT color="green">103</FONT> <a name="line.103"></a> |
| <FONT color="green">104</FONT> int analysis = analyze(compiler, stepOpCodePos, stepIndex);<a name="line.104"></a> |
| <FONT color="green">105</FONT> <a name="line.105"></a> |
| <FONT color="green">106</FONT> while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos)))<a name="line.106"></a> |
| <FONT color="green">107</FONT> {<a name="line.107"></a> |
| <FONT color="green">108</FONT> walker = createDefaultWalker(compiler, stepOpCodePos, lpi, analysis);<a name="line.108"></a> |
| <FONT color="green">109</FONT> <a name="line.109"></a> |
| <FONT color="green">110</FONT> walker.init(compiler, stepOpCodePos, stepType);<a name="line.110"></a> |
| <FONT color="green">111</FONT> walker.exprSetParent(lpi);<a name="line.111"></a> |
| <FONT color="green">112</FONT> <a name="line.112"></a> |
| <FONT color="green">113</FONT> // walker.setAnalysis(analysis);<a name="line.113"></a> |
| <FONT color="green">114</FONT> if (null == firstWalker)<a name="line.114"></a> |
| <FONT color="green">115</FONT> {<a name="line.115"></a> |
| <FONT color="green">116</FONT> firstWalker = walker;<a name="line.116"></a> |
| <FONT color="green">117</FONT> }<a name="line.117"></a> |
| <FONT color="green">118</FONT> else<a name="line.118"></a> |
| <FONT color="green">119</FONT> {<a name="line.119"></a> |
| <FONT color="green">120</FONT> prevWalker.setNextWalker(walker);<a name="line.120"></a> |
| <FONT color="green">121</FONT> walker.setPrevWalker(prevWalker);<a name="line.121"></a> |
| <FONT color="green">122</FONT> }<a name="line.122"></a> |
| <FONT color="green">123</FONT> <a name="line.123"></a> |
| <FONT color="green">124</FONT> prevWalker = walker;<a name="line.124"></a> |
| <FONT color="green">125</FONT> stepOpCodePos = compiler.getNextStepPos(stepOpCodePos);<a name="line.125"></a> |
| <FONT color="green">126</FONT> <a name="line.126"></a> |
| <FONT color="green">127</FONT> if (stepOpCodePos < 0)<a name="line.127"></a> |
| <FONT color="green">128</FONT> break;<a name="line.128"></a> |
| <FONT color="green">129</FONT> }<a name="line.129"></a> |
| <FONT color="green">130</FONT> <a name="line.130"></a> |
| <FONT color="green">131</FONT> return firstWalker;<a name="line.131"></a> |
| <FONT color="green">132</FONT> }<a name="line.132"></a> |
| <FONT color="green">133</FONT> <a name="line.133"></a> |
| <FONT color="green">134</FONT> public static boolean isSet(int analysis, int bits)<a name="line.134"></a> |
| <FONT color="green">135</FONT> {<a name="line.135"></a> |
| <FONT color="green">136</FONT> return (0 != (analysis & bits));<a name="line.136"></a> |
| <FONT color="green">137</FONT> }<a name="line.137"></a> |
| <FONT color="green">138</FONT> <a name="line.138"></a> |
| <FONT color="green">139</FONT> public static void diagnoseIterator(String name, int analysis, Compiler compiler)<a name="line.139"></a> |
| <FONT color="green">140</FONT> {<a name="line.140"></a> |
| <FONT color="green">141</FONT> System.out.println(compiler.toString()+", "+name+", "<a name="line.141"></a> |
| <FONT color="green">142</FONT> + Integer.toBinaryString(analysis) + ", "<a name="line.142"></a> |
| <FONT color="green">143</FONT> + getAnalysisString(analysis));<a name="line.143"></a> |
| <FONT color="green">144</FONT> }<a name="line.144"></a> |
| <FONT color="green">145</FONT> <a name="line.145"></a> |
| <FONT color="green">146</FONT> /**<a name="line.146"></a> |
| <FONT color="green">147</FONT> * Create a new LocPathIterator iterator. The exact type of iterator<a name="line.147"></a> |
| <FONT color="green">148</FONT> * returned is based on an analysis of the XPath operations.<a name="line.148"></a> |
| <FONT color="green">149</FONT> *<a name="line.149"></a> |
| <FONT color="green">150</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.150"></a> |
| <FONT color="green">151</FONT> * the XPath operations into an opcode map.<a name="line.151"></a> |
| <FONT color="green">152</FONT> * @param opPos The position of the operation code for this itterator.<a name="line.152"></a> |
| <FONT color="green">153</FONT> *<a name="line.153"></a> |
| <FONT color="green">154</FONT> * @return non-null reference to a LocPathIterator or derivative.<a name="line.154"></a> |
| <FONT color="green">155</FONT> *<a name="line.155"></a> |
| <FONT color="green">156</FONT> * @throws javax.xml.transform.TransformerException<a name="line.156"></a> |
| <FONT color="green">157</FONT> */<a name="line.157"></a> |
| <FONT color="green">158</FONT> public static DTMIterator newDTMIterator(<a name="line.158"></a> |
| <FONT color="green">159</FONT> Compiler compiler, int opPos,<a name="line.159"></a> |
| <FONT color="green">160</FONT> boolean isTopLevel)<a name="line.160"></a> |
| <FONT color="green">161</FONT> throws javax.xml.transform.TransformerException<a name="line.161"></a> |
| <FONT color="green">162</FONT> {<a name="line.162"></a> |
| <FONT color="green">163</FONT> <a name="line.163"></a> |
| <FONT color="green">164</FONT> int firstStepPos = OpMap.getFirstChildPos(opPos);<a name="line.164"></a> |
| <FONT color="green">165</FONT> int analysis = analyze(compiler, firstStepPos, 0);<a name="line.165"></a> |
| <FONT color="green">166</FONT> boolean isOneStep = isOneStep(analysis);<a name="line.166"></a> |
| <FONT color="green">167</FONT> DTMIterator iter;<a name="line.167"></a> |
| <FONT color="green">168</FONT> <a name="line.168"></a> |
| <FONT color="green">169</FONT> // Is the iteration a one-step attribute pattern (i.e. select="@foo")?<a name="line.169"></a> |
| <FONT color="green">170</FONT> if (isOneStep && walksSelfOnly(analysis) && <a name="line.170"></a> |
| <FONT color="green">171</FONT> isWild(analysis) && !hasPredicate(analysis))<a name="line.171"></a> |
| <FONT color="green">172</FONT> {<a name="line.172"></a> |
| <FONT color="green">173</FONT> if (DEBUG_ITERATOR_CREATION)<a name="line.173"></a> |
| <FONT color="green">174</FONT> diagnoseIterator("SelfIteratorNoPredicate", analysis, compiler);<a name="line.174"></a> |
| <FONT color="green">175</FONT> <a name="line.175"></a> |
| <FONT color="green">176</FONT> // Then use a simple iteration of the attributes, with node test <a name="line.176"></a> |
| <FONT color="green">177</FONT> // and predicate testing.<a name="line.177"></a> |
| <FONT color="green">178</FONT> iter = new SelfIteratorNoPredicate(compiler, opPos, analysis);<a name="line.178"></a> |
| <FONT color="green">179</FONT> }<a name="line.179"></a> |
| <FONT color="green">180</FONT> // Is the iteration exactly one child step?<a name="line.180"></a> |
| <FONT color="green">181</FONT> else if (walksChildrenOnly(analysis) && isOneStep)<a name="line.181"></a> |
| <FONT color="green">182</FONT> {<a name="line.182"></a> |
| <FONT color="green">183</FONT> <a name="line.183"></a> |
| <FONT color="green">184</FONT> // Does the pattern specify *any* child with no predicate? (i.e. select="child::node()".<a name="line.184"></a> |
| <FONT color="green">185</FONT> if (isWild(analysis) && !hasPredicate(analysis))<a name="line.185"></a> |
| <FONT color="green">186</FONT> {<a name="line.186"></a> |
| <FONT color="green">187</FONT> if (DEBUG_ITERATOR_CREATION)<a name="line.187"></a> |
| <FONT color="green">188</FONT> diagnoseIterator("ChildIterator", analysis, compiler);<a name="line.188"></a> |
| <FONT color="green">189</FONT> <a name="line.189"></a> |
| <FONT color="green">190</FONT> // Use simple child iteration without any test.<a name="line.190"></a> |
| <FONT color="green">191</FONT> iter = new ChildIterator(compiler, opPos, analysis);<a name="line.191"></a> |
| <FONT color="green">192</FONT> }<a name="line.192"></a> |
| <FONT color="green">193</FONT> else<a name="line.193"></a> |
| <FONT color="green">194</FONT> {<a name="line.194"></a> |
| <FONT color="green">195</FONT> if (DEBUG_ITERATOR_CREATION)<a name="line.195"></a> |
| <FONT color="green">196</FONT> diagnoseIterator("ChildTestIterator", analysis, compiler);<a name="line.196"></a> |
| <FONT color="green">197</FONT> <a name="line.197"></a> |
| <FONT color="green">198</FONT> // Else use simple node test iteration with predicate test.<a name="line.198"></a> |
| <FONT color="green">199</FONT> iter = new ChildTestIterator(compiler, opPos, analysis);<a name="line.199"></a> |
| <FONT color="green">200</FONT> }<a name="line.200"></a> |
| <FONT color="green">201</FONT> }<a name="line.201"></a> |
| <FONT color="green">202</FONT> // Is the iteration a one-step attribute pattern (i.e. select="@foo")?<a name="line.202"></a> |
| <FONT color="green">203</FONT> else if (isOneStep && walksAttributes(analysis))<a name="line.203"></a> |
| <FONT color="green">204</FONT> {<a name="line.204"></a> |
| <FONT color="green">205</FONT> if (DEBUG_ITERATOR_CREATION)<a name="line.205"></a> |
| <FONT color="green">206</FONT> diagnoseIterator("AttributeIterator", analysis, compiler);<a name="line.206"></a> |
| <FONT color="green">207</FONT> <a name="line.207"></a> |
| <FONT color="green">208</FONT> // Then use a simple iteration of the attributes, with node test <a name="line.208"></a> |
| <FONT color="green">209</FONT> // and predicate testing.<a name="line.209"></a> |
| <FONT color="green">210</FONT> iter = new AttributeIterator(compiler, opPos, analysis);<a name="line.210"></a> |
| <FONT color="green">211</FONT> }<a name="line.211"></a> |
| <FONT color="green">212</FONT> else if(isOneStep && !walksFilteredList(analysis))<a name="line.212"></a> |
| <FONT color="green">213</FONT> {<a name="line.213"></a> |
| <FONT color="green">214</FONT> if( !walksNamespaces(analysis) <a name="line.214"></a> |
| <FONT color="green">215</FONT> && (walksInDocOrder(analysis) || isSet(analysis, BIT_PARENT)))<a name="line.215"></a> |
| <FONT color="green">216</FONT> {<a name="line.216"></a> |
| <FONT color="green">217</FONT> if (false || DEBUG_ITERATOR_CREATION)<a name="line.217"></a> |
| <FONT color="green">218</FONT> diagnoseIterator("OneStepIteratorForward", analysis, compiler);<a name="line.218"></a> |
| <FONT color="green">219</FONT> <a name="line.219"></a> |
| <FONT color="green">220</FONT> // Then use a simple iteration of the attributes, with node test <a name="line.220"></a> |
| <FONT color="green">221</FONT> // and predicate testing.<a name="line.221"></a> |
| <FONT color="green">222</FONT> iter = new OneStepIteratorForward(compiler, opPos, analysis);<a name="line.222"></a> |
| <FONT color="green">223</FONT> }<a name="line.223"></a> |
| <FONT color="green">224</FONT> else<a name="line.224"></a> |
| <FONT color="green">225</FONT> {<a name="line.225"></a> |
| <FONT color="green">226</FONT> if (false || DEBUG_ITERATOR_CREATION)<a name="line.226"></a> |
| <FONT color="green">227</FONT> diagnoseIterator("OneStepIterator", analysis, compiler);<a name="line.227"></a> |
| <FONT color="green">228</FONT> <a name="line.228"></a> |
| <FONT color="green">229</FONT> // Then use a simple iteration of the attributes, with node test <a name="line.229"></a> |
| <FONT color="green">230</FONT> // and predicate testing.<a name="line.230"></a> |
| <FONT color="green">231</FONT> iter = new OneStepIterator(compiler, opPos, analysis);<a name="line.231"></a> |
| <FONT color="green">232</FONT> }<a name="line.232"></a> |
| <FONT color="green">233</FONT> }<a name="line.233"></a> |
| <FONT color="green">234</FONT> <a name="line.234"></a> |
| <FONT color="green">235</FONT> // Analysis of "//center":<a name="line.235"></a> |
| <FONT color="green">236</FONT> // bits: 1001000000001010000000000000011<a name="line.236"></a> |
| <FONT color="green">237</FONT> // count: 3<a name="line.237"></a> |
| <FONT color="green">238</FONT> // root<a name="line.238"></a> |
| <FONT color="green">239</FONT> // child:node()<a name="line.239"></a> |
| <FONT color="green">240</FONT> // BIT_DESCENDANT_OR_SELF<a name="line.240"></a> |
| <FONT color="green">241</FONT> // It's highly possible that we should have a seperate bit set for <a name="line.241"></a> |
| <FONT color="green">242</FONT> // "//foo" patterns.<a name="line.242"></a> |
| <FONT color="green">243</FONT> // For at least the time being, we can't optimize patterns like <a name="line.243"></a> |
| <FONT color="green">244</FONT> // "//table[3]", because this has to be analyzed as <a name="line.244"></a> |
| <FONT color="green">245</FONT> // "/descendant-or-self::node()/table[3]" in order for the indexes <a name="line.245"></a> |
| <FONT color="green">246</FONT> // to work right.<a name="line.246"></a> |
| <FONT color="green">247</FONT> else if (isOptimizableForDescendantIterator(compiler, firstStepPos, 0)<a name="line.247"></a> |
| <FONT color="green">248</FONT> // && getStepCount(analysis) <= 3 <a name="line.248"></a> |
| <FONT color="green">249</FONT> // && walksDescendants(analysis) <a name="line.249"></a> |
| <FONT color="green">250</FONT> // && walksSubtreeOnlyFromRootOrContext(analysis)<a name="line.250"></a> |
| <FONT color="green">251</FONT> )<a name="line.251"></a> |
| <FONT color="green">252</FONT> {<a name="line.252"></a> |
| <FONT color="green">253</FONT> if (DEBUG_ITERATOR_CREATION)<a name="line.253"></a> |
| <FONT color="green">254</FONT> diagnoseIterator("DescendantIterator", analysis, compiler);<a name="line.254"></a> |
| <FONT color="green">255</FONT> <a name="line.255"></a> |
| <FONT color="green">256</FONT> iter = new DescendantIterator(compiler, opPos, analysis);<a name="line.256"></a> |
| <FONT color="green">257</FONT> }<a name="line.257"></a> |
| <FONT color="green">258</FONT> else<a name="line.258"></a> |
| <FONT color="green">259</FONT> { <a name="line.259"></a> |
| <FONT color="green">260</FONT> if(isNaturalDocOrder(compiler, firstStepPos, 0, analysis))<a name="line.260"></a> |
| <FONT color="green">261</FONT> {<a name="line.261"></a> |
| <FONT color="green">262</FONT> if (false || DEBUG_ITERATOR_CREATION)<a name="line.262"></a> |
| <FONT color="green">263</FONT> {<a name="line.263"></a> |
| <FONT color="green">264</FONT> diagnoseIterator("WalkingIterator", analysis, compiler);<a name="line.264"></a> |
| <FONT color="green">265</FONT> }<a name="line.265"></a> |
| <FONT color="green">266</FONT> <a name="line.266"></a> |
| <FONT color="green">267</FONT> iter = new WalkingIterator(compiler, opPos, analysis, true);<a name="line.267"></a> |
| <FONT color="green">268</FONT> }<a name="line.268"></a> |
| <FONT color="green">269</FONT> else<a name="line.269"></a> |
| <FONT color="green">270</FONT> {<a name="line.270"></a> |
| <FONT color="green">271</FONT> // if (DEBUG_ITERATOR_CREATION)<a name="line.271"></a> |
| <FONT color="green">272</FONT> // diagnoseIterator("MatchPatternIterator", analysis, compiler);<a name="line.272"></a> |
| <FONT color="green">273</FONT> //<a name="line.273"></a> |
| <FONT color="green">274</FONT> // return new MatchPatternIterator(compiler, opPos, analysis);<a name="line.274"></a> |
| <FONT color="green">275</FONT> if (DEBUG_ITERATOR_CREATION)<a name="line.275"></a> |
| <FONT color="green">276</FONT> diagnoseIterator("WalkingIteratorSorted", analysis, compiler);<a name="line.276"></a> |
| <FONT color="green">277</FONT> <a name="line.277"></a> |
| <FONT color="green">278</FONT> iter = new WalkingIteratorSorted(compiler, opPos, analysis, true);<a name="line.278"></a> |
| <FONT color="green">279</FONT> }<a name="line.279"></a> |
| <FONT color="green">280</FONT> }<a name="line.280"></a> |
| <FONT color="green">281</FONT> if(iter instanceof LocPathIterator)<a name="line.281"></a> |
| <FONT color="green">282</FONT> ((LocPathIterator)iter).setIsTopLevel(isTopLevel);<a name="line.282"></a> |
| <FONT color="green">283</FONT> <a name="line.283"></a> |
| <FONT color="green">284</FONT> return iter;<a name="line.284"></a> |
| <FONT color="green">285</FONT> }<a name="line.285"></a> |
| <FONT color="green">286</FONT> <a name="line.286"></a> |
| <FONT color="green">287</FONT> /**<a name="line.287"></a> |
| <FONT color="green">288</FONT> * Special purpose function to see if we can optimize the pattern for <a name="line.288"></a> |
| <FONT color="green">289</FONT> * a DescendantIterator.<a name="line.289"></a> |
| <FONT color="green">290</FONT> *<a name="line.290"></a> |
| <FONT color="green">291</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.291"></a> |
| <FONT color="green">292</FONT> * the XPath operations into an opcode map.<a name="line.292"></a> |
| <FONT color="green">293</FONT> * @param stepOpCodePos The opcode position for the step.<a name="line.293"></a> |
| <FONT color="green">294</FONT> *<a name="line.294"></a> |
| <FONT color="green">295</FONT> * @return 32 bits as an integer that give information about the location<a name="line.295"></a> |
| <FONT color="green">296</FONT> * path as a whole.<a name="line.296"></a> |
| <FONT color="green">297</FONT> *<a name="line.297"></a> |
| <FONT color="green">298</FONT> * @throws javax.xml.transform.TransformerException<a name="line.298"></a> |
| <FONT color="green">299</FONT> */<a name="line.299"></a> |
| <FONT color="green">300</FONT> public static int getAxisFromStep(<a name="line.300"></a> |
| <FONT color="green">301</FONT> Compiler compiler, int stepOpCodePos)<a name="line.301"></a> |
| <FONT color="green">302</FONT> throws javax.xml.transform.TransformerException<a name="line.302"></a> |
| <FONT color="green">303</FONT> {<a name="line.303"></a> |
| <FONT color="green">304</FONT> <a name="line.304"></a> |
| <FONT color="green">305</FONT> int stepType = compiler.getOp(stepOpCodePos);<a name="line.305"></a> |
| <FONT color="green">306</FONT> <a name="line.306"></a> |
| <FONT color="green">307</FONT> switch (stepType)<a name="line.307"></a> |
| <FONT color="green">308</FONT> {<a name="line.308"></a> |
| <FONT color="green">309</FONT> case OpCodes.FROM_FOLLOWING :<a name="line.309"></a> |
| <FONT color="green">310</FONT> return Axis.FOLLOWING;<a name="line.310"></a> |
| <FONT color="green">311</FONT> case OpCodes.FROM_FOLLOWING_SIBLINGS :<a name="line.311"></a> |
| <FONT color="green">312</FONT> return Axis.FOLLOWINGSIBLING;<a name="line.312"></a> |
| <FONT color="green">313</FONT> case OpCodes.FROM_PRECEDING :<a name="line.313"></a> |
| <FONT color="green">314</FONT> return Axis.PRECEDING;<a name="line.314"></a> |
| <FONT color="green">315</FONT> case OpCodes.FROM_PRECEDING_SIBLINGS :<a name="line.315"></a> |
| <FONT color="green">316</FONT> return Axis.PRECEDINGSIBLING;<a name="line.316"></a> |
| <FONT color="green">317</FONT> case OpCodes.FROM_PARENT :<a name="line.317"></a> |
| <FONT color="green">318</FONT> return Axis.PARENT;<a name="line.318"></a> |
| <FONT color="green">319</FONT> case OpCodes.FROM_NAMESPACE :<a name="line.319"></a> |
| <FONT color="green">320</FONT> return Axis.NAMESPACE;<a name="line.320"></a> |
| <FONT color="green">321</FONT> case OpCodes.FROM_ANCESTORS :<a name="line.321"></a> |
| <FONT color="green">322</FONT> return Axis.ANCESTOR;<a name="line.322"></a> |
| <FONT color="green">323</FONT> case OpCodes.FROM_ANCESTORS_OR_SELF :<a name="line.323"></a> |
| <FONT color="green">324</FONT> return Axis.ANCESTORORSELF;<a name="line.324"></a> |
| <FONT color="green">325</FONT> case OpCodes.FROM_ATTRIBUTES :<a name="line.325"></a> |
| <FONT color="green">326</FONT> return Axis.ATTRIBUTE;<a name="line.326"></a> |
| <FONT color="green">327</FONT> case OpCodes.FROM_ROOT :<a name="line.327"></a> |
| <FONT color="green">328</FONT> return Axis.ROOT;<a name="line.328"></a> |
| <FONT color="green">329</FONT> case OpCodes.FROM_CHILDREN :<a name="line.329"></a> |
| <FONT color="green">330</FONT> return Axis.CHILD;<a name="line.330"></a> |
| <FONT color="green">331</FONT> case OpCodes.FROM_DESCENDANTS_OR_SELF :<a name="line.331"></a> |
| <FONT color="green">332</FONT> return Axis.DESCENDANTORSELF;<a name="line.332"></a> |
| <FONT color="green">333</FONT> case OpCodes.FROM_DESCENDANTS :<a name="line.333"></a> |
| <FONT color="green">334</FONT> return Axis.DESCENDANT;<a name="line.334"></a> |
| <FONT color="green">335</FONT> case OpCodes.FROM_SELF :<a name="line.335"></a> |
| <FONT color="green">336</FONT> return Axis.SELF;<a name="line.336"></a> |
| <FONT color="green">337</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.337"></a> |
| <FONT color="green">338</FONT> case OpCodes.OP_FUNCTION :<a name="line.338"></a> |
| <FONT color="green">339</FONT> case OpCodes.OP_GROUP :<a name="line.339"></a> |
| <FONT color="green">340</FONT> case OpCodes.OP_VARIABLE :<a name="line.340"></a> |
| <FONT color="green">341</FONT> return Axis.FILTEREDLIST;<a name="line.341"></a> |
| <FONT color="green">342</FONT> }<a name="line.342"></a> |
| <FONT color="green">343</FONT> <a name="line.343"></a> |
| <FONT color="green">344</FONT> throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "<a name="line.344"></a> |
| <FONT color="green">345</FONT> //+ stepType);<a name="line.345"></a> |
| <FONT color="green">346</FONT> }<a name="line.346"></a> |
| <FONT color="green">347</FONT> <a name="line.347"></a> |
| <FONT color="green">348</FONT> /**<a name="line.348"></a> |
| <FONT color="green">349</FONT> * Get a corresponding BIT_XXX from an axis.<a name="line.349"></a> |
| <FONT color="green">350</FONT> * @param axis One of Axis.ANCESTOR, etc.<a name="line.350"></a> |
| <FONT color="green">351</FONT> * @return One of BIT_ANCESTOR, etc.<a name="line.351"></a> |
| <FONT color="green">352</FONT> */<a name="line.352"></a> |
| <FONT color="green">353</FONT> static public int getAnalysisBitFromAxes(int axis)<a name="line.353"></a> |
| <FONT color="green">354</FONT> {<a name="line.354"></a> |
| <FONT color="green">355</FONT> switch (axis) // Generate new traverser<a name="line.355"></a> |
| <FONT color="green">356</FONT> {<a name="line.356"></a> |
| <FONT color="green">357</FONT> case Axis.ANCESTOR :<a name="line.357"></a> |
| <FONT color="green">358</FONT> return BIT_ANCESTOR;<a name="line.358"></a> |
| <FONT color="green">359</FONT> case Axis.ANCESTORORSELF :<a name="line.359"></a> |
| <FONT color="green">360</FONT> return BIT_ANCESTOR_OR_SELF;<a name="line.360"></a> |
| <FONT color="green">361</FONT> case Axis.ATTRIBUTE :<a name="line.361"></a> |
| <FONT color="green">362</FONT> return BIT_ATTRIBUTE;<a name="line.362"></a> |
| <FONT color="green">363</FONT> case Axis.CHILD :<a name="line.363"></a> |
| <FONT color="green">364</FONT> return BIT_CHILD;<a name="line.364"></a> |
| <FONT color="green">365</FONT> case Axis.DESCENDANT :<a name="line.365"></a> |
| <FONT color="green">366</FONT> return BIT_DESCENDANT;<a name="line.366"></a> |
| <FONT color="green">367</FONT> case Axis.DESCENDANTORSELF :<a name="line.367"></a> |
| <FONT color="green">368</FONT> return BIT_DESCENDANT_OR_SELF;<a name="line.368"></a> |
| <FONT color="green">369</FONT> case Axis.FOLLOWING :<a name="line.369"></a> |
| <FONT color="green">370</FONT> return BIT_FOLLOWING;<a name="line.370"></a> |
| <FONT color="green">371</FONT> case Axis.FOLLOWINGSIBLING :<a name="line.371"></a> |
| <FONT color="green">372</FONT> return BIT_FOLLOWING_SIBLING;<a name="line.372"></a> |
| <FONT color="green">373</FONT> case Axis.NAMESPACE :<a name="line.373"></a> |
| <FONT color="green">374</FONT> case Axis.NAMESPACEDECLS :<a name="line.374"></a> |
| <FONT color="green">375</FONT> return BIT_NAMESPACE;<a name="line.375"></a> |
| <FONT color="green">376</FONT> case Axis.PARENT :<a name="line.376"></a> |
| <FONT color="green">377</FONT> return BIT_PARENT;<a name="line.377"></a> |
| <FONT color="green">378</FONT> case Axis.PRECEDING :<a name="line.378"></a> |
| <FONT color="green">379</FONT> return BIT_PRECEDING;<a name="line.379"></a> |
| <FONT color="green">380</FONT> case Axis.PRECEDINGSIBLING :<a name="line.380"></a> |
| <FONT color="green">381</FONT> return BIT_PRECEDING_SIBLING;<a name="line.381"></a> |
| <FONT color="green">382</FONT> case Axis.SELF :<a name="line.382"></a> |
| <FONT color="green">383</FONT> return BIT_SELF;<a name="line.383"></a> |
| <FONT color="green">384</FONT> case Axis.ALLFROMNODE :<a name="line.384"></a> |
| <FONT color="green">385</FONT> return BIT_DESCENDANT_OR_SELF;<a name="line.385"></a> |
| <FONT color="green">386</FONT> // case Axis.PRECEDINGANDANCESTOR :<a name="line.386"></a> |
| <FONT color="green">387</FONT> case Axis.DESCENDANTSFROMROOT :<a name="line.387"></a> |
| <FONT color="green">388</FONT> case Axis.ALL :<a name="line.388"></a> |
| <FONT color="green">389</FONT> case Axis.DESCENDANTSORSELFFROMROOT :<a name="line.389"></a> |
| <FONT color="green">390</FONT> return BIT_ANY_DESCENDANT_FROM_ROOT;<a name="line.390"></a> |
| <FONT color="green">391</FONT> case Axis.ROOT :<a name="line.391"></a> |
| <FONT color="green">392</FONT> return BIT_ROOT;<a name="line.392"></a> |
| <FONT color="green">393</FONT> case Axis.FILTEREDLIST :<a name="line.393"></a> |
| <FONT color="green">394</FONT> return BIT_FILTER;<a name="line.394"></a> |
| <FONT color="green">395</FONT> default :<a name="line.395"></a> |
| <FONT color="green">396</FONT> return BIT_FILTER;<a name="line.396"></a> |
| <FONT color="green">397</FONT> }<a name="line.397"></a> |
| <FONT color="green">398</FONT> }<a name="line.398"></a> |
| <FONT color="green">399</FONT> <a name="line.399"></a> |
| <FONT color="green">400</FONT> static boolean functionProximateOrContainsProximate(Compiler compiler, <a name="line.400"></a> |
| <FONT color="green">401</FONT> int opPos)<a name="line.401"></a> |
| <FONT color="green">402</FONT> {<a name="line.402"></a> |
| <FONT color="green">403</FONT> int endFunc = opPos + compiler.getOp(opPos + 1) - 1;<a name="line.403"></a> |
| <FONT color="green">404</FONT> opPos = OpMap.getFirstChildPos(opPos);<a name="line.404"></a> |
| <FONT color="green">405</FONT> int funcID = compiler.getOp(opPos);<a name="line.405"></a> |
| <FONT color="green">406</FONT> // System.out.println("funcID: "+funcID);<a name="line.406"></a> |
| <FONT color="green">407</FONT> // System.out.println("opPos: "+opPos);<a name="line.407"></a> |
| <FONT color="green">408</FONT> // System.out.println("endFunc: "+endFunc);<a name="line.408"></a> |
| <FONT color="green">409</FONT> switch(funcID)<a name="line.409"></a> |
| <FONT color="green">410</FONT> {<a name="line.410"></a> |
| <FONT color="green">411</FONT> case FunctionTable.FUNC_LAST:<a name="line.411"></a> |
| <FONT color="green">412</FONT> case FunctionTable.FUNC_POSITION:<a name="line.412"></a> |
| <FONT color="green">413</FONT> return true;<a name="line.413"></a> |
| <FONT color="green">414</FONT> default:<a name="line.414"></a> |
| <FONT color="green">415</FONT> opPos++;<a name="line.415"></a> |
| <FONT color="green">416</FONT> int i = 0;<a name="line.416"></a> |
| <FONT color="green">417</FONT> for (int p = opPos; p < endFunc; p = compiler.getNextOpPos(p), i++)<a name="line.417"></a> |
| <FONT color="green">418</FONT> {<a name="line.418"></a> |
| <FONT color="green">419</FONT> int innerExprOpPos = p+2;<a name="line.419"></a> |
| <FONT color="green">420</FONT> int argOp = compiler.getOp(innerExprOpPos);<a name="line.420"></a> |
| <FONT color="green">421</FONT> boolean prox = isProximateInnerExpr(compiler, innerExprOpPos);<a name="line.421"></a> |
| <FONT color="green">422</FONT> if(prox)<a name="line.422"></a> |
| <FONT color="green">423</FONT> return true;<a name="line.423"></a> |
| <FONT color="green">424</FONT> }<a name="line.424"></a> |
| <FONT color="green">425</FONT> <a name="line.425"></a> |
| <FONT color="green">426</FONT> }<a name="line.426"></a> |
| <FONT color="green">427</FONT> return false;<a name="line.427"></a> |
| <FONT color="green">428</FONT> }<a name="line.428"></a> |
| <FONT color="green">429</FONT> <a name="line.429"></a> |
| <FONT color="green">430</FONT> static boolean isProximateInnerExpr(Compiler compiler, int opPos)<a name="line.430"></a> |
| <FONT color="green">431</FONT> {<a name="line.431"></a> |
| <FONT color="green">432</FONT> int op = compiler.getOp(opPos);<a name="line.432"></a> |
| <FONT color="green">433</FONT> int innerExprOpPos = opPos+2;<a name="line.433"></a> |
| <FONT color="green">434</FONT> switch(op)<a name="line.434"></a> |
| <FONT color="green">435</FONT> {<a name="line.435"></a> |
| <FONT color="green">436</FONT> case OpCodes.OP_ARGUMENT:<a name="line.436"></a> |
| <FONT color="green">437</FONT> if(isProximateInnerExpr(compiler, innerExprOpPos))<a name="line.437"></a> |
| <FONT color="green">438</FONT> return true;<a name="line.438"></a> |
| <FONT color="green">439</FONT> break;<a name="line.439"></a> |
| <FONT color="green">440</FONT> case OpCodes.OP_VARIABLE:<a name="line.440"></a> |
| <FONT color="green">441</FONT> case OpCodes.OP_NUMBERLIT:<a name="line.441"></a> |
| <FONT color="green">442</FONT> case OpCodes.OP_LITERAL:<a name="line.442"></a> |
| <FONT color="green">443</FONT> case OpCodes.OP_LOCATIONPATH:<a name="line.443"></a> |
| <FONT color="green">444</FONT> break; // OK<a name="line.444"></a> |
| <FONT color="green">445</FONT> case OpCodes.OP_FUNCTION:<a name="line.445"></a> |
| <FONT color="green">446</FONT> boolean isProx = functionProximateOrContainsProximate(compiler, opPos);<a name="line.446"></a> |
| <FONT color="green">447</FONT> if(isProx)<a name="line.447"></a> |
| <FONT color="green">448</FONT> return true;<a name="line.448"></a> |
| <FONT color="green">449</FONT> break;<a name="line.449"></a> |
| <FONT color="green">450</FONT> case OpCodes.OP_GT:<a name="line.450"></a> |
| <FONT color="green">451</FONT> case OpCodes.OP_GTE:<a name="line.451"></a> |
| <FONT color="green">452</FONT> case OpCodes.OP_LT:<a name="line.452"></a> |
| <FONT color="green">453</FONT> case OpCodes.OP_LTE:<a name="line.453"></a> |
| <FONT color="green">454</FONT> case OpCodes.OP_EQUALS:<a name="line.454"></a> |
| <FONT color="green">455</FONT> int leftPos = OpMap.getFirstChildPos(op);<a name="line.455"></a> |
| <FONT color="green">456</FONT> int rightPos = compiler.getNextOpPos(leftPos);<a name="line.456"></a> |
| <FONT color="green">457</FONT> isProx = isProximateInnerExpr(compiler, leftPos);<a name="line.457"></a> |
| <FONT color="green">458</FONT> if(isProx)<a name="line.458"></a> |
| <FONT color="green">459</FONT> return true;<a name="line.459"></a> |
| <FONT color="green">460</FONT> isProx = isProximateInnerExpr(compiler, rightPos);<a name="line.460"></a> |
| <FONT color="green">461</FONT> if(isProx)<a name="line.461"></a> |
| <FONT color="green">462</FONT> return true;<a name="line.462"></a> |
| <FONT color="green">463</FONT> break;<a name="line.463"></a> |
| <FONT color="green">464</FONT> default:<a name="line.464"></a> |
| <FONT color="green">465</FONT> return true; // be conservative...<a name="line.465"></a> |
| <FONT color="green">466</FONT> }<a name="line.466"></a> |
| <FONT color="green">467</FONT> return false;<a name="line.467"></a> |
| <FONT color="green">468</FONT> }<a name="line.468"></a> |
| <FONT color="green">469</FONT> <a name="line.469"></a> |
| <FONT color="green">470</FONT> /**<a name="line.470"></a> |
| <FONT color="green">471</FONT> * Tell if the predicates need to have proximity knowledge.<a name="line.471"></a> |
| <FONT color="green">472</FONT> */<a name="line.472"></a> |
| <FONT color="green">473</FONT> public static boolean mightBeProximate(Compiler compiler, int opPos, int stepType)<a name="line.473"></a> |
| <FONT color="green">474</FONT> throws javax.xml.transform.TransformerException<a name="line.474"></a> |
| <FONT color="green">475</FONT> {<a name="line.475"></a> |
| <FONT color="green">476</FONT> <a name="line.476"></a> |
| <FONT color="green">477</FONT> boolean mightBeProximate = false;<a name="line.477"></a> |
| <FONT color="green">478</FONT> int argLen;<a name="line.478"></a> |
| <FONT color="green">479</FONT> <a name="line.479"></a> |
| <FONT color="green">480</FONT> switch (stepType)<a name="line.480"></a> |
| <FONT color="green">481</FONT> {<a name="line.481"></a> |
| <FONT color="green">482</FONT> case OpCodes.OP_VARIABLE :<a name="line.482"></a> |
| <FONT color="green">483</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.483"></a> |
| <FONT color="green">484</FONT> case OpCodes.OP_FUNCTION :<a name="line.484"></a> |
| <FONT color="green">485</FONT> case OpCodes.OP_GROUP :<a name="line.485"></a> |
| <FONT color="green">486</FONT> argLen = compiler.getArgLength(opPos);<a name="line.486"></a> |
| <FONT color="green">487</FONT> break;<a name="line.487"></a> |
| <FONT color="green">488</FONT> default :<a name="line.488"></a> |
| <FONT color="green">489</FONT> argLen = compiler.getArgLengthOfStep(opPos);<a name="line.489"></a> |
| <FONT color="green">490</FONT> }<a name="line.490"></a> |
| <FONT color="green">491</FONT> <a name="line.491"></a> |
| <FONT color="green">492</FONT> int predPos = compiler.getFirstPredicateOpPos(opPos);<a name="line.492"></a> |
| <FONT color="green">493</FONT> int count = 0;<a name="line.493"></a> |
| <FONT color="green">494</FONT> <a name="line.494"></a> |
| <FONT color="green">495</FONT> while (OpCodes.OP_PREDICATE == compiler.getOp(predPos))<a name="line.495"></a> |
| <FONT color="green">496</FONT> {<a name="line.496"></a> |
| <FONT color="green">497</FONT> count++;<a name="line.497"></a> |
| <FONT color="green">498</FONT> <a name="line.498"></a> |
| <FONT color="green">499</FONT> int innerExprOpPos = predPos+2;<a name="line.499"></a> |
| <FONT color="green">500</FONT> int predOp = compiler.getOp(innerExprOpPos);<a name="line.500"></a> |
| <FONT color="green">501</FONT> <a name="line.501"></a> |
| <FONT color="green">502</FONT> switch(predOp)<a name="line.502"></a> |
| <FONT color="green">503</FONT> {<a name="line.503"></a> |
| <FONT color="green">504</FONT> case OpCodes.OP_VARIABLE:<a name="line.504"></a> |
| <FONT color="green">505</FONT> return true; // Would need more smarts to tell if this could be a number or not!<a name="line.505"></a> |
| <FONT color="green">506</FONT> case OpCodes.OP_LOCATIONPATH:<a name="line.506"></a> |
| <FONT color="green">507</FONT> // OK.<a name="line.507"></a> |
| <FONT color="green">508</FONT> break;<a name="line.508"></a> |
| <FONT color="green">509</FONT> case OpCodes.OP_NUMBER:<a name="line.509"></a> |
| <FONT color="green">510</FONT> case OpCodes.OP_NUMBERLIT:<a name="line.510"></a> |
| <FONT color="green">511</FONT> return true; // that's all she wrote!<a name="line.511"></a> |
| <FONT color="green">512</FONT> case OpCodes.OP_FUNCTION:<a name="line.512"></a> |
| <FONT color="green">513</FONT> boolean isProx <a name="line.513"></a> |
| <FONT color="green">514</FONT> = functionProximateOrContainsProximate(compiler, innerExprOpPos);<a name="line.514"></a> |
| <FONT color="green">515</FONT> if(isProx)<a name="line.515"></a> |
| <FONT color="green">516</FONT> return true;<a name="line.516"></a> |
| <FONT color="green">517</FONT> break;<a name="line.517"></a> |
| <FONT color="green">518</FONT> case OpCodes.OP_GT:<a name="line.518"></a> |
| <FONT color="green">519</FONT> case OpCodes.OP_GTE:<a name="line.519"></a> |
| <FONT color="green">520</FONT> case OpCodes.OP_LT:<a name="line.520"></a> |
| <FONT color="green">521</FONT> case OpCodes.OP_LTE:<a name="line.521"></a> |
| <FONT color="green">522</FONT> case OpCodes.OP_EQUALS:<a name="line.522"></a> |
| <FONT color="green">523</FONT> int leftPos = OpMap.getFirstChildPos(innerExprOpPos);<a name="line.523"></a> |
| <FONT color="green">524</FONT> int rightPos = compiler.getNextOpPos(leftPos);<a name="line.524"></a> |
| <FONT color="green">525</FONT> isProx = isProximateInnerExpr(compiler, leftPos);<a name="line.525"></a> |
| <FONT color="green">526</FONT> if(isProx)<a name="line.526"></a> |
| <FONT color="green">527</FONT> return true;<a name="line.527"></a> |
| <FONT color="green">528</FONT> isProx = isProximateInnerExpr(compiler, rightPos);<a name="line.528"></a> |
| <FONT color="green">529</FONT> if(isProx)<a name="line.529"></a> |
| <FONT color="green">530</FONT> return true;<a name="line.530"></a> |
| <FONT color="green">531</FONT> break;<a name="line.531"></a> |
| <FONT color="green">532</FONT> default:<a name="line.532"></a> |
| <FONT color="green">533</FONT> return true; // be conservative...<a name="line.533"></a> |
| <FONT color="green">534</FONT> }<a name="line.534"></a> |
| <FONT color="green">535</FONT> <a name="line.535"></a> |
| <FONT color="green">536</FONT> predPos = compiler.getNextOpPos(predPos);<a name="line.536"></a> |
| <FONT color="green">537</FONT> }<a name="line.537"></a> |
| <FONT color="green">538</FONT> <a name="line.538"></a> |
| <FONT color="green">539</FONT> return mightBeProximate;<a name="line.539"></a> |
| <FONT color="green">540</FONT> }<a name="line.540"></a> |
| <FONT color="green">541</FONT> <a name="line.541"></a> |
| <FONT color="green">542</FONT> /**<a name="line.542"></a> |
| <FONT color="green">543</FONT> * Special purpose function to see if we can optimize the pattern for <a name="line.543"></a> |
| <FONT color="green">544</FONT> * a DescendantIterator.<a name="line.544"></a> |
| <FONT color="green">545</FONT> *<a name="line.545"></a> |
| <FONT color="green">546</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.546"></a> |
| <FONT color="green">547</FONT> * the XPath operations into an opcode map.<a name="line.547"></a> |
| <FONT color="green">548</FONT> * @param stepOpCodePos The opcode position for the step.<a name="line.548"></a> |
| <FONT color="green">549</FONT> * @param stepIndex The top-level step index withing the iterator.<a name="line.549"></a> |
| <FONT color="green">550</FONT> *<a name="line.550"></a> |
| <FONT color="green">551</FONT> * @return 32 bits as an integer that give information about the location<a name="line.551"></a> |
| <FONT color="green">552</FONT> * path as a whole.<a name="line.552"></a> |
| <FONT color="green">553</FONT> *<a name="line.553"></a> |
| <FONT color="green">554</FONT> * @throws javax.xml.transform.TransformerException<a name="line.554"></a> |
| <FONT color="green">555</FONT> */<a name="line.555"></a> |
| <FONT color="green">556</FONT> private static boolean isOptimizableForDescendantIterator(<a name="line.556"></a> |
| <FONT color="green">557</FONT> Compiler compiler, int stepOpCodePos, int stepIndex)<a name="line.557"></a> |
| <FONT color="green">558</FONT> throws javax.xml.transform.TransformerException<a name="line.558"></a> |
| <FONT color="green">559</FONT> {<a name="line.559"></a> |
| <FONT color="green">560</FONT> <a name="line.560"></a> |
| <FONT color="green">561</FONT> int stepType;<a name="line.561"></a> |
| <FONT color="green">562</FONT> int stepCount = 0;<a name="line.562"></a> |
| <FONT color="green">563</FONT> boolean foundDorDS = false;<a name="line.563"></a> |
| <FONT color="green">564</FONT> boolean foundSelf = false;<a name="line.564"></a> |
| <FONT color="green">565</FONT> boolean foundDS = false;<a name="line.565"></a> |
| <FONT color="green">566</FONT> <a name="line.566"></a> |
| <FONT color="green">567</FONT> int nodeTestType = OpCodes.NODETYPE_NODE;<a name="line.567"></a> |
| <FONT color="green">568</FONT> <a name="line.568"></a> |
| <FONT color="green">569</FONT> while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos)))<a name="line.569"></a> |
| <FONT color="green">570</FONT> {<a name="line.570"></a> |
| <FONT color="green">571</FONT> // The DescendantIterator can only do one node test. If there's more <a name="line.571"></a> |
| <FONT color="green">572</FONT> // than one, use another iterator.<a name="line.572"></a> |
| <FONT color="green">573</FONT> if(nodeTestType != OpCodes.NODETYPE_NODE && nodeTestType != OpCodes.NODETYPE_ROOT)<a name="line.573"></a> |
| <FONT color="green">574</FONT> return false;<a name="line.574"></a> |
| <FONT color="green">575</FONT> <a name="line.575"></a> |
| <FONT color="green">576</FONT> stepCount++;<a name="line.576"></a> |
| <FONT color="green">577</FONT> if(stepCount > 3)<a name="line.577"></a> |
| <FONT color="green">578</FONT> return false;<a name="line.578"></a> |
| <FONT color="green">579</FONT> <a name="line.579"></a> |
| <FONT color="green">580</FONT> boolean mightBeProximate = mightBeProximate(compiler, stepOpCodePos, stepType);<a name="line.580"></a> |
| <FONT color="green">581</FONT> if(mightBeProximate)<a name="line.581"></a> |
| <FONT color="green">582</FONT> return false;<a name="line.582"></a> |
| <FONT color="green">583</FONT> <a name="line.583"></a> |
| <FONT color="green">584</FONT> switch (stepType)<a name="line.584"></a> |
| <FONT color="green">585</FONT> {<a name="line.585"></a> |
| <FONT color="green">586</FONT> case OpCodes.FROM_FOLLOWING :<a name="line.586"></a> |
| <FONT color="green">587</FONT> case OpCodes.FROM_FOLLOWING_SIBLINGS :<a name="line.587"></a> |
| <FONT color="green">588</FONT> case OpCodes.FROM_PRECEDING :<a name="line.588"></a> |
| <FONT color="green">589</FONT> case OpCodes.FROM_PRECEDING_SIBLINGS :<a name="line.589"></a> |
| <FONT color="green">590</FONT> case OpCodes.FROM_PARENT :<a name="line.590"></a> |
| <FONT color="green">591</FONT> case OpCodes.OP_VARIABLE :<a name="line.591"></a> |
| <FONT color="green">592</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.592"></a> |
| <FONT color="green">593</FONT> case OpCodes.OP_FUNCTION :<a name="line.593"></a> |
| <FONT color="green">594</FONT> case OpCodes.OP_GROUP :<a name="line.594"></a> |
| <FONT color="green">595</FONT> case OpCodes.FROM_NAMESPACE :<a name="line.595"></a> |
| <FONT color="green">596</FONT> case OpCodes.FROM_ANCESTORS :<a name="line.596"></a> |
| <FONT color="green">597</FONT> case OpCodes.FROM_ANCESTORS_OR_SELF :<a name="line.597"></a> |
| <FONT color="green">598</FONT> case OpCodes.FROM_ATTRIBUTES :<a name="line.598"></a> |
| <FONT color="green">599</FONT> case OpCodes.MATCH_ATTRIBUTE :<a name="line.599"></a> |
| <FONT color="green">600</FONT> case OpCodes.MATCH_ANY_ANCESTOR :<a name="line.600"></a> |
| <FONT color="green">601</FONT> case OpCodes.MATCH_IMMEDIATE_ANCESTOR :<a name="line.601"></a> |
| <FONT color="green">602</FONT> return false;<a name="line.602"></a> |
| <FONT color="green">603</FONT> case OpCodes.FROM_ROOT :<a name="line.603"></a> |
| <FONT color="green">604</FONT> if(1 != stepCount)<a name="line.604"></a> |
| <FONT color="green">605</FONT> return false;<a name="line.605"></a> |
| <FONT color="green">606</FONT> break;<a name="line.606"></a> |
| <FONT color="green">607</FONT> case OpCodes.FROM_CHILDREN :<a name="line.607"></a> |
| <FONT color="green">608</FONT> if(!foundDS && !(foundDorDS && foundSelf))<a name="line.608"></a> |
| <FONT color="green">609</FONT> return false;<a name="line.609"></a> |
| <FONT color="green">610</FONT> break;<a name="line.610"></a> |
| <FONT color="green">611</FONT> case OpCodes.FROM_DESCENDANTS_OR_SELF :<a name="line.611"></a> |
| <FONT color="green">612</FONT> foundDS = true;<a name="line.612"></a> |
| <FONT color="green">613</FONT> case OpCodes.FROM_DESCENDANTS :<a name="line.613"></a> |
| <FONT color="green">614</FONT> if(3 == stepCount)<a name="line.614"></a> |
| <FONT color="green">615</FONT> return false;<a name="line.615"></a> |
| <FONT color="green">616</FONT> foundDorDS = true;<a name="line.616"></a> |
| <FONT color="green">617</FONT> break;<a name="line.617"></a> |
| <FONT color="green">618</FONT> case OpCodes.FROM_SELF :<a name="line.618"></a> |
| <FONT color="green">619</FONT> if(1 != stepCount)<a name="line.619"></a> |
| <FONT color="green">620</FONT> return false;<a name="line.620"></a> |
| <FONT color="green">621</FONT> foundSelf = true;<a name="line.621"></a> |
| <FONT color="green">622</FONT> break;<a name="line.622"></a> |
| <FONT color="green">623</FONT> default :<a name="line.623"></a> |
| <FONT color="green">624</FONT> throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "<a name="line.624"></a> |
| <FONT color="green">625</FONT> // + stepType);<a name="line.625"></a> |
| <FONT color="green">626</FONT> }<a name="line.626"></a> |
| <FONT color="green">627</FONT> <a name="line.627"></a> |
| <FONT color="green">628</FONT> nodeTestType = compiler.getStepTestType(stepOpCodePos);<a name="line.628"></a> |
| <FONT color="green">629</FONT> <a name="line.629"></a> |
| <FONT color="green">630</FONT> int nextStepOpCodePos = compiler.getNextStepPos(stepOpCodePos);<a name="line.630"></a> |
| <FONT color="green">631</FONT> <a name="line.631"></a> |
| <FONT color="green">632</FONT> if (nextStepOpCodePos < 0)<a name="line.632"></a> |
| <FONT color="green">633</FONT> break;<a name="line.633"></a> |
| <FONT color="green">634</FONT> <a name="line.634"></a> |
| <FONT color="green">635</FONT> if(OpCodes.ENDOP != compiler.getOp(nextStepOpCodePos))<a name="line.635"></a> |
| <FONT color="green">636</FONT> {<a name="line.636"></a> |
| <FONT color="green">637</FONT> if(compiler.countPredicates(stepOpCodePos) > 0)<a name="line.637"></a> |
| <FONT color="green">638</FONT> {<a name="line.638"></a> |
| <FONT color="green">639</FONT> return false;<a name="line.639"></a> |
| <FONT color="green">640</FONT> }<a name="line.640"></a> |
| <FONT color="green">641</FONT> }<a name="line.641"></a> |
| <FONT color="green">642</FONT> <a name="line.642"></a> |
| <FONT color="green">643</FONT> stepOpCodePos = nextStepOpCodePos;<a name="line.643"></a> |
| <FONT color="green">644</FONT> }<a name="line.644"></a> |
| <FONT color="green">645</FONT> <a name="line.645"></a> |
| <FONT color="green">646</FONT> return true;<a name="line.646"></a> |
| <FONT color="green">647</FONT> }<a name="line.647"></a> |
| <FONT color="green">648</FONT> <a name="line.648"></a> |
| <FONT color="green">649</FONT> /**<a name="line.649"></a> |
| <FONT color="green">650</FONT> * Analyze the location path and return 32 bits that give information about<a name="line.650"></a> |
| <FONT color="green">651</FONT> * the location path as a whole. See the BIT_XXX constants for meaning about<a name="line.651"></a> |
| <FONT color="green">652</FONT> * each of the bits.<a name="line.652"></a> |
| <FONT color="green">653</FONT> *<a name="line.653"></a> |
| <FONT color="green">654</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.654"></a> |
| <FONT color="green">655</FONT> * the XPath operations into an opcode map.<a name="line.655"></a> |
| <FONT color="green">656</FONT> * @param stepOpCodePos The opcode position for the step.<a name="line.656"></a> |
| <FONT color="green">657</FONT> * @param stepIndex The top-level step index withing the iterator.<a name="line.657"></a> |
| <FONT color="green">658</FONT> *<a name="line.658"></a> |
| <FONT color="green">659</FONT> * @return 32 bits as an integer that give information about the location<a name="line.659"></a> |
| <FONT color="green">660</FONT> * path as a whole.<a name="line.660"></a> |
| <FONT color="green">661</FONT> *<a name="line.661"></a> |
| <FONT color="green">662</FONT> * @throws javax.xml.transform.TransformerException<a name="line.662"></a> |
| <FONT color="green">663</FONT> */<a name="line.663"></a> |
| <FONT color="green">664</FONT> private static int analyze(<a name="line.664"></a> |
| <FONT color="green">665</FONT> Compiler compiler, int stepOpCodePos, int stepIndex)<a name="line.665"></a> |
| <FONT color="green">666</FONT> throws javax.xml.transform.TransformerException<a name="line.666"></a> |
| <FONT color="green">667</FONT> {<a name="line.667"></a> |
| <FONT color="green">668</FONT> <a name="line.668"></a> |
| <FONT color="green">669</FONT> int stepType;<a name="line.669"></a> |
| <FONT color="green">670</FONT> int stepCount = 0;<a name="line.670"></a> |
| <FONT color="green">671</FONT> int analysisResult = 0x00000000; // 32 bits of analysis<a name="line.671"></a> |
| <FONT color="green">672</FONT> <a name="line.672"></a> |
| <FONT color="green">673</FONT> while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos)))<a name="line.673"></a> |
| <FONT color="green">674</FONT> {<a name="line.674"></a> |
| <FONT color="green">675</FONT> stepCount++;<a name="line.675"></a> |
| <FONT color="green">676</FONT> <a name="line.676"></a> |
| <FONT color="green">677</FONT> // String namespace = compiler.getStepNS(stepOpCodePos);<a name="line.677"></a> |
| <FONT color="green">678</FONT> // boolean isNSWild = (null != namespace) <a name="line.678"></a> |
| <FONT color="green">679</FONT> // ? namespace.equals(NodeTest.WILD) : false;<a name="line.679"></a> |
| <FONT color="green">680</FONT> // String localname = compiler.getStepLocalName(stepOpCodePos);<a name="line.680"></a> |
| <FONT color="green">681</FONT> // boolean isWild = (null != localname) ? localname.equals(NodeTest.WILD) : false;<a name="line.681"></a> |
| <FONT color="green">682</FONT> boolean predAnalysis = analyzePredicate(compiler, stepOpCodePos,<a name="line.682"></a> |
| <FONT color="green">683</FONT> stepType);<a name="line.683"></a> |
| <FONT color="green">684</FONT> <a name="line.684"></a> |
| <FONT color="green">685</FONT> if (predAnalysis)<a name="line.685"></a> |
| <FONT color="green">686</FONT> analysisResult |= BIT_PREDICATE;<a name="line.686"></a> |
| <FONT color="green">687</FONT> <a name="line.687"></a> |
| <FONT color="green">688</FONT> switch (stepType)<a name="line.688"></a> |
| <FONT color="green">689</FONT> {<a name="line.689"></a> |
| <FONT color="green">690</FONT> case OpCodes.OP_VARIABLE :<a name="line.690"></a> |
| <FONT color="green">691</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.691"></a> |
| <FONT color="green">692</FONT> case OpCodes.OP_FUNCTION :<a name="line.692"></a> |
| <FONT color="green">693</FONT> case OpCodes.OP_GROUP :<a name="line.693"></a> |
| <FONT color="green">694</FONT> analysisResult |= BIT_FILTER;<a name="line.694"></a> |
| <FONT color="green">695</FONT> break;<a name="line.695"></a> |
| <FONT color="green">696</FONT> case OpCodes.FROM_ROOT :<a name="line.696"></a> |
| <FONT color="green">697</FONT> analysisResult |= BIT_ROOT;<a name="line.697"></a> |
| <FONT color="green">698</FONT> break;<a name="line.698"></a> |
| <FONT color="green">699</FONT> case OpCodes.FROM_ANCESTORS :<a name="line.699"></a> |
| <FONT color="green">700</FONT> analysisResult |= BIT_ANCESTOR;<a name="line.700"></a> |
| <FONT color="green">701</FONT> break;<a name="line.701"></a> |
| <FONT color="green">702</FONT> case OpCodes.FROM_ANCESTORS_OR_SELF :<a name="line.702"></a> |
| <FONT color="green">703</FONT> analysisResult |= BIT_ANCESTOR_OR_SELF;<a name="line.703"></a> |
| <FONT color="green">704</FONT> break;<a name="line.704"></a> |
| <FONT color="green">705</FONT> case OpCodes.FROM_ATTRIBUTES :<a name="line.705"></a> |
| <FONT color="green">706</FONT> analysisResult |= BIT_ATTRIBUTE;<a name="line.706"></a> |
| <FONT color="green">707</FONT> break;<a name="line.707"></a> |
| <FONT color="green">708</FONT> case OpCodes.FROM_NAMESPACE :<a name="line.708"></a> |
| <FONT color="green">709</FONT> analysisResult |= BIT_NAMESPACE;<a name="line.709"></a> |
| <FONT color="green">710</FONT> break;<a name="line.710"></a> |
| <FONT color="green">711</FONT> case OpCodes.FROM_CHILDREN :<a name="line.711"></a> |
| <FONT color="green">712</FONT> analysisResult |= BIT_CHILD;<a name="line.712"></a> |
| <FONT color="green">713</FONT> break;<a name="line.713"></a> |
| <FONT color="green">714</FONT> case OpCodes.FROM_DESCENDANTS :<a name="line.714"></a> |
| <FONT color="green">715</FONT> analysisResult |= BIT_DESCENDANT;<a name="line.715"></a> |
| <FONT color="green">716</FONT> break;<a name="line.716"></a> |
| <FONT color="green">717</FONT> case OpCodes.FROM_DESCENDANTS_OR_SELF :<a name="line.717"></a> |
| <FONT color="green">718</FONT> <a name="line.718"></a> |
| <FONT color="green">719</FONT> // Use a special bit to to make sure we get the right analysis of "//foo".<a name="line.719"></a> |
| <FONT color="green">720</FONT> if (2 == stepCount && BIT_ROOT == analysisResult)<a name="line.720"></a> |
| <FONT color="green">721</FONT> {<a name="line.721"></a> |
| <FONT color="green">722</FONT> analysisResult |= BIT_ANY_DESCENDANT_FROM_ROOT;<a name="line.722"></a> |
| <FONT color="green">723</FONT> }<a name="line.723"></a> |
| <FONT color="green">724</FONT> <a name="line.724"></a> |
| <FONT color="green">725</FONT> analysisResult |= BIT_DESCENDANT_OR_SELF;<a name="line.725"></a> |
| <FONT color="green">726</FONT> break;<a name="line.726"></a> |
| <FONT color="green">727</FONT> case OpCodes.FROM_FOLLOWING :<a name="line.727"></a> |
| <FONT color="green">728</FONT> analysisResult |= BIT_FOLLOWING;<a name="line.728"></a> |
| <FONT color="green">729</FONT> break;<a name="line.729"></a> |
| <FONT color="green">730</FONT> case OpCodes.FROM_FOLLOWING_SIBLINGS :<a name="line.730"></a> |
| <FONT color="green">731</FONT> analysisResult |= BIT_FOLLOWING_SIBLING;<a name="line.731"></a> |
| <FONT color="green">732</FONT> break;<a name="line.732"></a> |
| <FONT color="green">733</FONT> case OpCodes.FROM_PRECEDING :<a name="line.733"></a> |
| <FONT color="green">734</FONT> analysisResult |= BIT_PRECEDING;<a name="line.734"></a> |
| <FONT color="green">735</FONT> break;<a name="line.735"></a> |
| <FONT color="green">736</FONT> case OpCodes.FROM_PRECEDING_SIBLINGS :<a name="line.736"></a> |
| <FONT color="green">737</FONT> analysisResult |= BIT_PRECEDING_SIBLING;<a name="line.737"></a> |
| <FONT color="green">738</FONT> break;<a name="line.738"></a> |
| <FONT color="green">739</FONT> case OpCodes.FROM_PARENT :<a name="line.739"></a> |
| <FONT color="green">740</FONT> analysisResult |= BIT_PARENT;<a name="line.740"></a> |
| <FONT color="green">741</FONT> break;<a name="line.741"></a> |
| <FONT color="green">742</FONT> case OpCodes.FROM_SELF :<a name="line.742"></a> |
| <FONT color="green">743</FONT> analysisResult |= BIT_SELF;<a name="line.743"></a> |
| <FONT color="green">744</FONT> break;<a name="line.744"></a> |
| <FONT color="green">745</FONT> case OpCodes.MATCH_ATTRIBUTE :<a name="line.745"></a> |
| <FONT color="green">746</FONT> analysisResult |= (BIT_MATCH_PATTERN | BIT_ATTRIBUTE);<a name="line.746"></a> |
| <FONT color="green">747</FONT> break;<a name="line.747"></a> |
| <FONT color="green">748</FONT> case OpCodes.MATCH_ANY_ANCESTOR :<a name="line.748"></a> |
| <FONT color="green">749</FONT> analysisResult |= (BIT_MATCH_PATTERN | BIT_ANCESTOR);<a name="line.749"></a> |
| <FONT color="green">750</FONT> break;<a name="line.750"></a> |
| <FONT color="green">751</FONT> case OpCodes.MATCH_IMMEDIATE_ANCESTOR :<a name="line.751"></a> |
| <FONT color="green">752</FONT> analysisResult |= (BIT_MATCH_PATTERN | BIT_PARENT);<a name="line.752"></a> |
| <FONT color="green">753</FONT> break;<a name="line.753"></a> |
| <FONT color="green">754</FONT> default :<a name="line.754"></a> |
| <FONT color="green">755</FONT> throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "<a name="line.755"></a> |
| <FONT color="green">756</FONT> //+ stepType);<a name="line.756"></a> |
| <FONT color="green">757</FONT> }<a name="line.757"></a> |
| <FONT color="green">758</FONT> <a name="line.758"></a> |
| <FONT color="green">759</FONT> if (OpCodes.NODETYPE_NODE == compiler.getOp(stepOpCodePos + 3)) // child::node()<a name="line.759"></a> |
| <FONT color="green">760</FONT> {<a name="line.760"></a> |
| <FONT color="green">761</FONT> analysisResult |= BIT_NODETEST_ANY;<a name="line.761"></a> |
| <FONT color="green">762</FONT> }<a name="line.762"></a> |
| <FONT color="green">763</FONT> <a name="line.763"></a> |
| <FONT color="green">764</FONT> stepOpCodePos = compiler.getNextStepPos(stepOpCodePos);<a name="line.764"></a> |
| <FONT color="green">765</FONT> <a name="line.765"></a> |
| <FONT color="green">766</FONT> if (stepOpCodePos < 0)<a name="line.766"></a> |
| <FONT color="green">767</FONT> break;<a name="line.767"></a> |
| <FONT color="green">768</FONT> }<a name="line.768"></a> |
| <FONT color="green">769</FONT> <a name="line.769"></a> |
| <FONT color="green">770</FONT> analysisResult |= (stepCount & BITS_COUNT);<a name="line.770"></a> |
| <FONT color="green">771</FONT> <a name="line.771"></a> |
| <FONT color="green">772</FONT> return analysisResult;<a name="line.772"></a> |
| <FONT color="green">773</FONT> }<a name="line.773"></a> |
| <FONT color="green">774</FONT> <a name="line.774"></a> |
| <FONT color="green">775</FONT> /**<a name="line.775"></a> |
| <FONT color="green">776</FONT> * Tell if the given axis goes downword. Bogus name, if you can think of <a name="line.776"></a> |
| <FONT color="green">777</FONT> * a better one, please do tell. This really has to do with inverting <a name="line.777"></a> |
| <FONT color="green">778</FONT> * attribute axis.<a name="line.778"></a> |
| <FONT color="green">779</FONT> * @param axis One of Axis.XXX.<a name="line.779"></a> |
| <FONT color="green">780</FONT> * @return true if the axis is not a child axis and does not go up from <a name="line.780"></a> |
| <FONT color="green">781</FONT> * the axis root.<a name="line.781"></a> |
| <FONT color="green">782</FONT> */<a name="line.782"></a> |
| <FONT color="green">783</FONT> public static boolean isDownwardAxisOfMany(int axis)<a name="line.783"></a> |
| <FONT color="green">784</FONT> {<a name="line.784"></a> |
| <FONT color="green">785</FONT> return ((Axis.DESCENDANTORSELF == axis) ||<a name="line.785"></a> |
| <FONT color="green">786</FONT> (Axis.DESCENDANT == axis) <a name="line.786"></a> |
| <FONT color="green">787</FONT> || (Axis.FOLLOWING == axis) <a name="line.787"></a> |
| <FONT color="green">788</FONT> // || (Axis.FOLLOWINGSIBLING == axis) <a name="line.788"></a> |
| <FONT color="green">789</FONT> || (Axis.PRECEDING == axis) <a name="line.789"></a> |
| <FONT color="green">790</FONT> // || (Axis.PRECEDINGSIBLING == axis)<a name="line.790"></a> |
| <FONT color="green">791</FONT> );<a name="line.791"></a> |
| <FONT color="green">792</FONT> }<a name="line.792"></a> |
| <FONT color="green">793</FONT> <a name="line.793"></a> |
| <FONT color="green">794</FONT> /**<a name="line.794"></a> |
| <FONT color="green">795</FONT> * Read a <a href="http://www.w3.org/TR/xpath#location-paths">LocationPath</a><a name="line.795"></a> |
| <FONT color="green">796</FONT> * as a generalized match pattern. What this means is that the LocationPath<a name="line.796"></a> |
| <FONT color="green">797</FONT> * is read backwards, as a test on a given node, to see if it matches the<a name="line.797"></a> |
| <FONT color="green">798</FONT> * criteria of the selection, and ends up at the context node. Essentially,<a name="line.798"></a> |
| <FONT color="green">799</FONT> * this is a backwards query from a given node, to find the context node.<a name="line.799"></a> |
| <FONT color="green">800</FONT> * <p>So, the selection "foo/daz[2]" is, in non-abreviated expanded syntax,<a name="line.800"></a> |
| <FONT color="green">801</FONT> * "self::node()/following-sibling::foo/child::daz[position()=2]".<a name="line.801"></a> |
| <FONT color="green">802</FONT> * Taking this as a match pattern for a probable node, it works out to<a name="line.802"></a> |
| <FONT color="green">803</FONT> * "self::daz/parent::foo[child::daz[position()=2 and isPrevStepNode()]<a name="line.803"></a> |
| <FONT color="green">804</FONT> * precedingSibling::node()[isContextNodeOfLocationPath()]", adding magic<a name="line.804"></a> |
| <FONT color="green">805</FONT> * isPrevStepNode and isContextNodeOfLocationPath operations. Predicates in<a name="line.805"></a> |
| <FONT color="green">806</FONT> * the location path have to be executed by the following step,<a name="line.806"></a> |
| <FONT color="green">807</FONT> * because they have to know the context of their execution.<a name="line.807"></a> |
| <FONT color="green">808</FONT> *<a name="line.808"></a> |
| <FONT color="green">809</FONT> * @param mpi The MatchPatternIterator to which the steps will be attached.<a name="line.809"></a> |
| <FONT color="green">810</FONT> * @param compiler The compiler that holds the syntax tree/op map to<a name="line.810"></a> |
| <FONT color="green">811</FONT> * construct from.<a name="line.811"></a> |
| <FONT color="green">812</FONT> * @param stepOpCodePos The current op code position within the opmap.<a name="line.812"></a> |
| <FONT color="green">813</FONT> * @param stepIndex The top-level step index withing the iterator.<a name="line.813"></a> |
| <FONT color="green">814</FONT> *<a name="line.814"></a> |
| <FONT color="green">815</FONT> * @return A StepPattern object, which may contain relative StepPatterns.<a name="line.815"></a> |
| <FONT color="green">816</FONT> *<a name="line.816"></a> |
| <FONT color="green">817</FONT> * @throws javax.xml.transform.TransformerException<a name="line.817"></a> |
| <FONT color="green">818</FONT> */<a name="line.818"></a> |
| <FONT color="green">819</FONT> static StepPattern loadSteps(<a name="line.819"></a> |
| <FONT color="green">820</FONT> MatchPatternIterator mpi, Compiler compiler, int stepOpCodePos, <a name="line.820"></a> |
| <FONT color="green">821</FONT> int stepIndex)<a name="line.821"></a> |
| <FONT color="green">822</FONT> throws javax.xml.transform.TransformerException<a name="line.822"></a> |
| <FONT color="green">823</FONT> {<a name="line.823"></a> |
| <FONT color="green">824</FONT> if (DEBUG_PATTERN_CREATION)<a name="line.824"></a> |
| <FONT color="green">825</FONT> {<a name="line.825"></a> |
| <FONT color="green">826</FONT> System.out.println("================");<a name="line.826"></a> |
| <FONT color="green">827</FONT> System.out.println("loadSteps for: "+compiler.getPatternString());<a name="line.827"></a> |
| <FONT color="green">828</FONT> }<a name="line.828"></a> |
| <FONT color="green">829</FONT> int stepType;<a name="line.829"></a> |
| <FONT color="green">830</FONT> StepPattern step = null;<a name="line.830"></a> |
| <FONT color="green">831</FONT> StepPattern firstStep = null, prevStep = null;<a name="line.831"></a> |
| <FONT color="green">832</FONT> int analysis = analyze(compiler, stepOpCodePos, stepIndex);<a name="line.832"></a> |
| <FONT color="green">833</FONT> <a name="line.833"></a> |
| <FONT color="green">834</FONT> while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos)))<a name="line.834"></a> |
| <FONT color="green">835</FONT> {<a name="line.835"></a> |
| <FONT color="green">836</FONT> step = createDefaultStepPattern(compiler, stepOpCodePos, mpi, analysis,<a name="line.836"></a> |
| <FONT color="green">837</FONT> firstStep, prevStep);<a name="line.837"></a> |
| <FONT color="green">838</FONT> <a name="line.838"></a> |
| <FONT color="green">839</FONT> if (null == firstStep)<a name="line.839"></a> |
| <FONT color="green">840</FONT> {<a name="line.840"></a> |
| <FONT color="green">841</FONT> firstStep = step;<a name="line.841"></a> |
| <FONT color="green">842</FONT> }<a name="line.842"></a> |
| <FONT color="green">843</FONT> else<a name="line.843"></a> |
| <FONT color="green">844</FONT> {<a name="line.844"></a> |
| <FONT color="green">845</FONT> <a name="line.845"></a> |
| <FONT color="green">846</FONT> //prevStep.setNextWalker(step);<a name="line.846"></a> |
| <FONT color="green">847</FONT> step.setRelativePathPattern(prevStep);<a name="line.847"></a> |
| <FONT color="green">848</FONT> }<a name="line.848"></a> |
| <FONT color="green">849</FONT> <a name="line.849"></a> |
| <FONT color="green">850</FONT> prevStep = step;<a name="line.850"></a> |
| <FONT color="green">851</FONT> stepOpCodePos = compiler.getNextStepPos(stepOpCodePos);<a name="line.851"></a> |
| <FONT color="green">852</FONT> <a name="line.852"></a> |
| <FONT color="green">853</FONT> if (stepOpCodePos < 0)<a name="line.853"></a> |
| <FONT color="green">854</FONT> break;<a name="line.854"></a> |
| <FONT color="green">855</FONT> }<a name="line.855"></a> |
| <FONT color="green">856</FONT> <a name="line.856"></a> |
| <FONT color="green">857</FONT> int axis = Axis.SELF;<a name="line.857"></a> |
| <FONT color="green">858</FONT> int paxis = Axis.SELF;<a name="line.858"></a> |
| <FONT color="green">859</FONT> StepPattern tail = step;<a name="line.859"></a> |
| <FONT color="green">860</FONT> for (StepPattern pat = step; null != pat; <a name="line.860"></a> |
| <FONT color="green">861</FONT> pat = pat.getRelativePathPattern()) <a name="line.861"></a> |
| <FONT color="green">862</FONT> {<a name="line.862"></a> |
| <FONT color="green">863</FONT> int nextAxis = pat.getAxis();<a name="line.863"></a> |
| <FONT color="green">864</FONT> //int nextPaxis = pat.getPredicateAxis();<a name="line.864"></a> |
| <FONT color="green">865</FONT> pat.setAxis(axis);<a name="line.865"></a> |
| <FONT color="green">866</FONT> <a name="line.866"></a> |
| <FONT color="green">867</FONT> // The predicate axis can't be moved!!! Test Axes103<a name="line.867"></a> |
| <FONT color="green">868</FONT> // pat.setPredicateAxis(paxis);<a name="line.868"></a> |
| <FONT color="green">869</FONT> <a name="line.869"></a> |
| <FONT color="green">870</FONT> // If we have an attribute or namespace axis that went up, then <a name="line.870"></a> |
| <FONT color="green">871</FONT> // it won't find the attribute in the inverse, since the select-to-match<a name="line.871"></a> |
| <FONT color="green">872</FONT> // axes are not invertable (an element is a parent of an attribute, but <a name="line.872"></a> |
| <FONT color="green">873</FONT> // and attribute is not a child of an element).<a name="line.873"></a> |
| <FONT color="green">874</FONT> // If we don't do the magic below, then "@*/ancestor-or-self::*" gets<a name="line.874"></a> |
| <FONT color="green">875</FONT> // inverted for match to "self::*/descendant-or-self::@*/parent::node()",<a name="line.875"></a> |
| <FONT color="green">876</FONT> // which obviously won't work.<a name="line.876"></a> |
| <FONT color="green">877</FONT> // So we will rewrite this as:<a name="line.877"></a> |
| <FONT color="green">878</FONT> // "self::*/descendant-or-self::*/attribute::*/parent::node()"<a name="line.878"></a> |
| <FONT color="green">879</FONT> // Child has to be rewritten a little differently:<a name="line.879"></a> |
| <FONT color="green">880</FONT> // select: "@*/parent::*"<a name="line.880"></a> |
| <FONT color="green">881</FONT> // inverted match: "self::*/child::@*/parent::node()"<a name="line.881"></a> |
| <FONT color="green">882</FONT> // rewrite: "self::*/attribute::*/parent::node()"<a name="line.882"></a> |
| <FONT color="green">883</FONT> // Axes that go down in the select, do not have to have special treatment <a name="line.883"></a> |
| <FONT color="green">884</FONT> // in the rewrite. The following inverted match will still not select <a name="line.884"></a> |
| <FONT color="green">885</FONT> // anything.<a name="line.885"></a> |
| <FONT color="green">886</FONT> // select: "@*/child::*"<a name="line.886"></a> |
| <FONT color="green">887</FONT> // inverted match: "self::*/parent::@*/parent::node()"<a name="line.887"></a> |
| <FONT color="green">888</FONT> // Lovely business, this.<a name="line.888"></a> |
| <FONT color="green">889</FONT> // -sb<a name="line.889"></a> |
| <FONT color="green">890</FONT> int whatToShow = pat.getWhatToShow();<a name="line.890"></a> |
| <FONT color="green">891</FONT> if(whatToShow == DTMFilter.SHOW_ATTRIBUTE || <a name="line.891"></a> |
| <FONT color="green">892</FONT> whatToShow == DTMFilter.SHOW_NAMESPACE)<a name="line.892"></a> |
| <FONT color="green">893</FONT> {<a name="line.893"></a> |
| <FONT color="green">894</FONT> int newAxis = (whatToShow == DTMFilter.SHOW_ATTRIBUTE) ? <a name="line.894"></a> |
| <FONT color="green">895</FONT> Axis.ATTRIBUTE : Axis.NAMESPACE;<a name="line.895"></a> |
| <FONT color="green">896</FONT> if(isDownwardAxisOfMany(axis))<a name="line.896"></a> |
| <FONT color="green">897</FONT> {<a name="line.897"></a> |
| <FONT color="green">898</FONT> StepPattern attrPat = new StepPattern(whatToShow, <a name="line.898"></a> |
| <FONT color="green">899</FONT> pat.getNamespace(),<a name="line.899"></a> |
| <FONT color="green">900</FONT> pat.getLocalName(),<a name="line.900"></a> |
| <FONT color="green">901</FONT> //newAxis, pat.getPredicateAxis);<a name="line.901"></a> |
| <FONT color="green">902</FONT> newAxis, 0); // don't care about the predicate axis<a name="line.902"></a> |
| <FONT color="green">903</FONT> XNumber score = pat.getStaticScore();<a name="line.903"></a> |
| <FONT color="green">904</FONT> pat.setNamespace(null);<a name="line.904"></a> |
| <FONT color="green">905</FONT> pat.setLocalName(NodeTest.WILD);<a name="line.905"></a> |
| <FONT color="green">906</FONT> attrPat.setPredicates(pat.getPredicates());<a name="line.906"></a> |
| <FONT color="green">907</FONT> pat.setPredicates(null);<a name="line.907"></a> |
| <FONT color="green">908</FONT> pat.setWhatToShow(DTMFilter.SHOW_ELEMENT);<a name="line.908"></a> |
| <FONT color="green">909</FONT> StepPattern rel = pat.getRelativePathPattern();<a name="line.909"></a> |
| <FONT color="green">910</FONT> pat.setRelativePathPattern(attrPat);<a name="line.910"></a> |
| <FONT color="green">911</FONT> attrPat.setRelativePathPattern(rel);<a name="line.911"></a> |
| <FONT color="green">912</FONT> attrPat.setStaticScore(score);<a name="line.912"></a> |
| <FONT color="green">913</FONT> <a name="line.913"></a> |
| <FONT color="green">914</FONT> // This is needed to inverse a following pattern, because of the <a name="line.914"></a> |
| <FONT color="green">915</FONT> // wacky Xalan rules for following from an attribute. See axes108.<a name="line.915"></a> |
| <FONT color="green">916</FONT> // By these rules, following from an attribute is not strictly <a name="line.916"></a> |
| <FONT color="green">917</FONT> // inverseable.<a name="line.917"></a> |
| <FONT color="green">918</FONT> if(Axis.PRECEDING == pat.getAxis())<a name="line.918"></a> |
| <FONT color="green">919</FONT> pat.setAxis(Axis.PRECEDINGANDANCESTOR);<a name="line.919"></a> |
| <FONT color="green">920</FONT> <a name="line.920"></a> |
| <FONT color="green">921</FONT> else if(Axis.DESCENDANT == pat.getAxis())<a name="line.921"></a> |
| <FONT color="green">922</FONT> pat.setAxis(Axis.DESCENDANTORSELF);<a name="line.922"></a> |
| <FONT color="green">923</FONT> <a name="line.923"></a> |
| <FONT color="green">924</FONT> pat = attrPat;<a name="line.924"></a> |
| <FONT color="green">925</FONT> }<a name="line.925"></a> |
| <FONT color="green">926</FONT> else if(Axis.CHILD == pat.getAxis())<a name="line.926"></a> |
| <FONT color="green">927</FONT> {<a name="line.927"></a> |
| <FONT color="green">928</FONT> // In this case just change the axis.<a name="line.928"></a> |
| <FONT color="green">929</FONT> // pat.setWhatToShow(whatToShow);<a name="line.929"></a> |
| <FONT color="green">930</FONT> pat.setAxis(Axis.ATTRIBUTE);<a name="line.930"></a> |
| <FONT color="green">931</FONT> }<a name="line.931"></a> |
| <FONT color="green">932</FONT> }<a name="line.932"></a> |
| <FONT color="green">933</FONT> axis = nextAxis;<a name="line.933"></a> |
| <FONT color="green">934</FONT> //paxis = nextPaxis;<a name="line.934"></a> |
| <FONT color="green">935</FONT> tail = pat;<a name="line.935"></a> |
| <FONT color="green">936</FONT> }<a name="line.936"></a> |
| <FONT color="green">937</FONT> <a name="line.937"></a> |
| <FONT color="green">938</FONT> if(axis < Axis.ALL)<a name="line.938"></a> |
| <FONT color="green">939</FONT> {<a name="line.939"></a> |
| <FONT color="green">940</FONT> StepPattern selfPattern = new ContextMatchStepPattern(axis, paxis);<a name="line.940"></a> |
| <FONT color="green">941</FONT> // We need to keep the new nodetest from affecting the score...<a name="line.941"></a> |
| <FONT color="green">942</FONT> XNumber score = tail.getStaticScore();<a name="line.942"></a> |
| <FONT color="green">943</FONT> tail.setRelativePathPattern(selfPattern);<a name="line.943"></a> |
| <FONT color="green">944</FONT> tail.setStaticScore(score);<a name="line.944"></a> |
| <FONT color="green">945</FONT> selfPattern.setStaticScore(score);<a name="line.945"></a> |
| <FONT color="green">946</FONT> } <a name="line.946"></a> |
| <FONT color="green">947</FONT> <a name="line.947"></a> |
| <FONT color="green">948</FONT> if (DEBUG_PATTERN_CREATION)<a name="line.948"></a> |
| <FONT color="green">949</FONT> {<a name="line.949"></a> |
| <FONT color="green">950</FONT> System.out.println("Done loading steps: "+step.toString());<a name="line.950"></a> |
| <FONT color="green">951</FONT> <a name="line.951"></a> |
| <FONT color="green">952</FONT> System.out.println("");<a name="line.952"></a> |
| <FONT color="green">953</FONT> }<a name="line.953"></a> |
| <FONT color="green">954</FONT> return step; // start from last pattern?? //firstStep;<a name="line.954"></a> |
| <FONT color="green">955</FONT> }<a name="line.955"></a> |
| <FONT color="green">956</FONT> <a name="line.956"></a> |
| <FONT color="green">957</FONT> /**<a name="line.957"></a> |
| <FONT color="green">958</FONT> * Create a StepPattern that is contained within a LocationPath.<a name="line.958"></a> |
| <FONT color="green">959</FONT> *<a name="line.959"></a> |
| <FONT color="green">960</FONT> *<a name="line.960"></a> |
| <FONT color="green">961</FONT> * @param compiler The compiler that holds the syntax tree/op map to<a name="line.961"></a> |
| <FONT color="green">962</FONT> * construct from.<a name="line.962"></a> |
| <FONT color="green">963</FONT> * @param stepOpCodePos The current op code position within the opmap.<a name="line.963"></a> |
| <FONT color="green">964</FONT> * @param mpi The MatchPatternIterator to which the steps will be attached.<a name="line.964"></a> |
| <FONT color="green">965</FONT> * @param analysis 32 bits of analysis, from which the type of AxesWalker<a name="line.965"></a> |
| <FONT color="green">966</FONT> * may be influenced.<a name="line.966"></a> |
| <FONT color="green">967</FONT> * @param tail The step that is the first step analyzed, but the last <a name="line.967"></a> |
| <FONT color="green">968</FONT> * step in the relative match linked list, i.e. the tail.<a name="line.968"></a> |
| <FONT color="green">969</FONT> * May be null.<a name="line.969"></a> |
| <FONT color="green">970</FONT> * @param head The step that is the current head of the relative <a name="line.970"></a> |
| <FONT color="green">971</FONT> * match step linked list.<a name="line.971"></a> |
| <FONT color="green">972</FONT> * May be null.<a name="line.972"></a> |
| <FONT color="green">973</FONT> *<a name="line.973"></a> |
| <FONT color="green">974</FONT> * @return the head of the list.<a name="line.974"></a> |
| <FONT color="green">975</FONT> *<a name="line.975"></a> |
| <FONT color="green">976</FONT> * @throws javax.xml.transform.TransformerException<a name="line.976"></a> |
| <FONT color="green">977</FONT> */<a name="line.977"></a> |
| <FONT color="green">978</FONT> private static StepPattern createDefaultStepPattern(<a name="line.978"></a> |
| <FONT color="green">979</FONT> Compiler compiler, int opPos, MatchPatternIterator mpi, <a name="line.979"></a> |
| <FONT color="green">980</FONT> int analysis, StepPattern tail, StepPattern head)<a name="line.980"></a> |
| <FONT color="green">981</FONT> throws javax.xml.transform.TransformerException<a name="line.981"></a> |
| <FONT color="green">982</FONT> {<a name="line.982"></a> |
| <FONT color="green">983</FONT> <a name="line.983"></a> |
| <FONT color="green">984</FONT> int stepType = compiler.getOp(opPos);<a name="line.984"></a> |
| <FONT color="green">985</FONT> boolean simpleInit = false;<a name="line.985"></a> |
| <FONT color="green">986</FONT> boolean prevIsOneStepDown = true;<a name="line.986"></a> |
| <FONT color="green">987</FONT> <a name="line.987"></a> |
| <FONT color="green">988</FONT> int whatToShow = compiler.getWhatToShow(opPos);<a name="line.988"></a> |
| <FONT color="green">989</FONT> StepPattern ai = null;<a name="line.989"></a> |
| <FONT color="green">990</FONT> int axis, predicateAxis;<a name="line.990"></a> |
| <FONT color="green">991</FONT> <a name="line.991"></a> |
| <FONT color="green">992</FONT> switch (stepType)<a name="line.992"></a> |
| <FONT color="green">993</FONT> {<a name="line.993"></a> |
| <FONT color="green">994</FONT> case OpCodes.OP_VARIABLE :<a name="line.994"></a> |
| <FONT color="green">995</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.995"></a> |
| <FONT color="green">996</FONT> case OpCodes.OP_FUNCTION :<a name="line.996"></a> |
| <FONT color="green">997</FONT> case OpCodes.OP_GROUP :<a name="line.997"></a> |
| <FONT color="green">998</FONT> prevIsOneStepDown = false;<a name="line.998"></a> |
| <FONT color="green">999</FONT> <a name="line.999"></a> |
| <FONT color="green">1000</FONT> Expression expr;<a name="line.1000"></a> |
| <FONT color="green">1001</FONT> <a name="line.1001"></a> |
| <FONT color="green">1002</FONT> switch (stepType)<a name="line.1002"></a> |
| <FONT color="green">1003</FONT> {<a name="line.1003"></a> |
| <FONT color="green">1004</FONT> case OpCodes.OP_VARIABLE :<a name="line.1004"></a> |
| <FONT color="green">1005</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.1005"></a> |
| <FONT color="green">1006</FONT> case OpCodes.OP_FUNCTION :<a name="line.1006"></a> |
| <FONT color="green">1007</FONT> case OpCodes.OP_GROUP :<a name="line.1007"></a> |
| <FONT color="green">1008</FONT> expr = compiler.compile(opPos);<a name="line.1008"></a> |
| <FONT color="green">1009</FONT> break;<a name="line.1009"></a> |
| <FONT color="green">1010</FONT> default :<a name="line.1010"></a> |
| <FONT color="green">1011</FONT> expr = compiler.compile(opPos + 2);<a name="line.1011"></a> |
| <FONT color="green">1012</FONT> }<a name="line.1012"></a> |
| <FONT color="green">1013</FONT> <a name="line.1013"></a> |
| <FONT color="green">1014</FONT> axis = Axis.FILTEREDLIST;<a name="line.1014"></a> |
| <FONT color="green">1015</FONT> predicateAxis = Axis.FILTEREDLIST;<a name="line.1015"></a> |
| <FONT color="green">1016</FONT> ai = new FunctionPattern(expr, axis, predicateAxis);<a name="line.1016"></a> |
| <FONT color="green">1017</FONT> simpleInit = true;<a name="line.1017"></a> |
| <FONT color="green">1018</FONT> break;<a name="line.1018"></a> |
| <FONT color="green">1019</FONT> case OpCodes.FROM_ROOT :<a name="line.1019"></a> |
| <FONT color="green">1020</FONT> whatToShow = DTMFilter.SHOW_DOCUMENT<a name="line.1020"></a> |
| <FONT color="green">1021</FONT> | DTMFilter.SHOW_DOCUMENT_FRAGMENT;<a name="line.1021"></a> |
| <FONT color="green">1022</FONT> <a name="line.1022"></a> |
| <FONT color="green">1023</FONT> axis = Axis.ROOT;<a name="line.1023"></a> |
| <FONT color="green">1024</FONT> predicateAxis = Axis.ROOT;<a name="line.1024"></a> |
| <FONT color="green">1025</FONT> ai = new StepPattern(DTMFilter.SHOW_DOCUMENT | <a name="line.1025"></a> |
| <FONT color="green">1026</FONT> DTMFilter.SHOW_DOCUMENT_FRAGMENT,<a name="line.1026"></a> |
| <FONT color="green">1027</FONT> axis, predicateAxis);<a name="line.1027"></a> |
| <FONT color="green">1028</FONT> break;<a name="line.1028"></a> |
| <FONT color="green">1029</FONT> case OpCodes.FROM_ATTRIBUTES :<a name="line.1029"></a> |
| <FONT color="green">1030</FONT> whatToShow = DTMFilter.SHOW_ATTRIBUTE;<a name="line.1030"></a> |
| <FONT color="green">1031</FONT> axis = Axis.PARENT;<a name="line.1031"></a> |
| <FONT color="green">1032</FONT> predicateAxis = Axis.ATTRIBUTE;<a name="line.1032"></a> |
| <FONT color="green">1033</FONT> // ai = new StepPattern(whatToShow, Axis.SELF, Axis.SELF);<a name="line.1033"></a> |
| <FONT color="green">1034</FONT> break;<a name="line.1034"></a> |
| <FONT color="green">1035</FONT> case OpCodes.FROM_NAMESPACE :<a name="line.1035"></a> |
| <FONT color="green">1036</FONT> whatToShow = DTMFilter.SHOW_NAMESPACE;<a name="line.1036"></a> |
| <FONT color="green">1037</FONT> axis = Axis.PARENT;<a name="line.1037"></a> |
| <FONT color="green">1038</FONT> predicateAxis = Axis.NAMESPACE;<a name="line.1038"></a> |
| <FONT color="green">1039</FONT> // ai = new StepPattern(whatToShow, axis, predicateAxis);<a name="line.1039"></a> |
| <FONT color="green">1040</FONT> break;<a name="line.1040"></a> |
| <FONT color="green">1041</FONT> case OpCodes.FROM_ANCESTORS :<a name="line.1041"></a> |
| <FONT color="green">1042</FONT> axis = Axis.DESCENDANT;<a name="line.1042"></a> |
| <FONT color="green">1043</FONT> predicateAxis = Axis.ANCESTOR;<a name="line.1043"></a> |
| <FONT color="green">1044</FONT> break;<a name="line.1044"></a> |
| <FONT color="green">1045</FONT> case OpCodes.FROM_CHILDREN :<a name="line.1045"></a> |
| <FONT color="green">1046</FONT> axis = Axis.PARENT;<a name="line.1046"></a> |
| <FONT color="green">1047</FONT> predicateAxis = Axis.CHILD;<a name="line.1047"></a> |
| <FONT color="green">1048</FONT> break;<a name="line.1048"></a> |
| <FONT color="green">1049</FONT> case OpCodes.FROM_ANCESTORS_OR_SELF :<a name="line.1049"></a> |
| <FONT color="green">1050</FONT> axis = Axis.DESCENDANTORSELF;<a name="line.1050"></a> |
| <FONT color="green">1051</FONT> predicateAxis = Axis.ANCESTORORSELF;<a name="line.1051"></a> |
| <FONT color="green">1052</FONT> break;<a name="line.1052"></a> |
| <FONT color="green">1053</FONT> case OpCodes.FROM_SELF :<a name="line.1053"></a> |
| <FONT color="green">1054</FONT> axis = Axis.SELF;<a name="line.1054"></a> |
| <FONT color="green">1055</FONT> predicateAxis = Axis.SELF;<a name="line.1055"></a> |
| <FONT color="green">1056</FONT> break;<a name="line.1056"></a> |
| <FONT color="green">1057</FONT> case OpCodes.FROM_PARENT :<a name="line.1057"></a> |
| <FONT color="green">1058</FONT> axis = Axis.CHILD;<a name="line.1058"></a> |
| <FONT color="green">1059</FONT> predicateAxis = Axis.PARENT;<a name="line.1059"></a> |
| <FONT color="green">1060</FONT> break;<a name="line.1060"></a> |
| <FONT color="green">1061</FONT> case OpCodes.FROM_PRECEDING_SIBLINGS :<a name="line.1061"></a> |
| <FONT color="green">1062</FONT> axis = Axis.FOLLOWINGSIBLING;<a name="line.1062"></a> |
| <FONT color="green">1063</FONT> predicateAxis = Axis.PRECEDINGSIBLING;<a name="line.1063"></a> |
| <FONT color="green">1064</FONT> break;<a name="line.1064"></a> |
| <FONT color="green">1065</FONT> case OpCodes.FROM_PRECEDING :<a name="line.1065"></a> |
| <FONT color="green">1066</FONT> axis = Axis.FOLLOWING;<a name="line.1066"></a> |
| <FONT color="green">1067</FONT> predicateAxis = Axis.PRECEDING;<a name="line.1067"></a> |
| <FONT color="green">1068</FONT> break;<a name="line.1068"></a> |
| <FONT color="green">1069</FONT> case OpCodes.FROM_FOLLOWING_SIBLINGS :<a name="line.1069"></a> |
| <FONT color="green">1070</FONT> axis = Axis.PRECEDINGSIBLING;<a name="line.1070"></a> |
| <FONT color="green">1071</FONT> predicateAxis = Axis.FOLLOWINGSIBLING;<a name="line.1071"></a> |
| <FONT color="green">1072</FONT> break;<a name="line.1072"></a> |
| <FONT color="green">1073</FONT> case OpCodes.FROM_FOLLOWING :<a name="line.1073"></a> |
| <FONT color="green">1074</FONT> axis = Axis.PRECEDING;<a name="line.1074"></a> |
| <FONT color="green">1075</FONT> predicateAxis = Axis.FOLLOWING;<a name="line.1075"></a> |
| <FONT color="green">1076</FONT> break;<a name="line.1076"></a> |
| <FONT color="green">1077</FONT> case OpCodes.FROM_DESCENDANTS_OR_SELF :<a name="line.1077"></a> |
| <FONT color="green">1078</FONT> axis = Axis.ANCESTORORSELF;<a name="line.1078"></a> |
| <FONT color="green">1079</FONT> predicateAxis = Axis.DESCENDANTORSELF;<a name="line.1079"></a> |
| <FONT color="green">1080</FONT> break;<a name="line.1080"></a> |
| <FONT color="green">1081</FONT> case OpCodes.FROM_DESCENDANTS :<a name="line.1081"></a> |
| <FONT color="green">1082</FONT> axis = Axis.ANCESTOR;<a name="line.1082"></a> |
| <FONT color="green">1083</FONT> predicateAxis = Axis.DESCENDANT;<a name="line.1083"></a> |
| <FONT color="green">1084</FONT> break;<a name="line.1084"></a> |
| <FONT color="green">1085</FONT> default :<a name="line.1085"></a> |
| <FONT color="green">1086</FONT> throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "<a name="line.1086"></a> |
| <FONT color="green">1087</FONT> //+ stepType);<a name="line.1087"></a> |
| <FONT color="green">1088</FONT> }<a name="line.1088"></a> |
| <FONT color="green">1089</FONT> if(null == ai)<a name="line.1089"></a> |
| <FONT color="green">1090</FONT> {<a name="line.1090"></a> |
| <FONT color="green">1091</FONT> whatToShow = compiler.getWhatToShow(opPos); // %REVIEW%<a name="line.1091"></a> |
| <FONT color="green">1092</FONT> ai = new StepPattern(whatToShow, compiler.getStepNS(opPos),<a name="line.1092"></a> |
| <FONT color="green">1093</FONT> compiler.getStepLocalName(opPos),<a name="line.1093"></a> |
| <FONT color="green">1094</FONT> axis, predicateAxis);<a name="line.1094"></a> |
| <FONT color="green">1095</FONT> }<a name="line.1095"></a> |
| <FONT color="green">1096</FONT> <a name="line.1096"></a> |
| <FONT color="green">1097</FONT> if (false || DEBUG_PATTERN_CREATION)<a name="line.1097"></a> |
| <FONT color="green">1098</FONT> {<a name="line.1098"></a> |
| <FONT color="green">1099</FONT> System.out.print("new step: "+ ai);<a name="line.1099"></a> |
| <FONT color="green">1100</FONT> System.out.print(", axis: " + Axis.getNames(ai.getAxis()));<a name="line.1100"></a> |
| <FONT color="green">1101</FONT> System.out.print(", predAxis: " + Axis.getNames(ai.getAxis()));<a name="line.1101"></a> |
| <FONT color="green">1102</FONT> System.out.print(", what: ");<a name="line.1102"></a> |
| <FONT color="green">1103</FONT> System.out.print(" ");<a name="line.1103"></a> |
| <FONT color="green">1104</FONT> ai.debugWhatToShow(ai.getWhatToShow());<a name="line.1104"></a> |
| <FONT color="green">1105</FONT> }<a name="line.1105"></a> |
| <FONT color="green">1106</FONT> <a name="line.1106"></a> |
| <FONT color="green">1107</FONT> int argLen = compiler.getFirstPredicateOpPos(opPos);<a name="line.1107"></a> |
| <FONT color="green">1108</FONT> <a name="line.1108"></a> |
| <FONT color="green">1109</FONT> ai.setPredicates(compiler.getCompiledPredicates(argLen));<a name="line.1109"></a> |
| <FONT color="green">1110</FONT> <a name="line.1110"></a> |
| <FONT color="green">1111</FONT> return ai;<a name="line.1111"></a> |
| <FONT color="green">1112</FONT> }<a name="line.1112"></a> |
| <FONT color="green">1113</FONT> <a name="line.1113"></a> |
| <FONT color="green">1114</FONT> /**<a name="line.1114"></a> |
| <FONT color="green">1115</FONT> * Analyze a step and give information about it's predicates. Right now this<a name="line.1115"></a> |
| <FONT color="green">1116</FONT> * just returns true or false if the step has a predicate.<a name="line.1116"></a> |
| <FONT color="green">1117</FONT> *<a name="line.1117"></a> |
| <FONT color="green">1118</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.1118"></a> |
| <FONT color="green">1119</FONT> * the XPath operations into an opcode map.<a name="line.1119"></a> |
| <FONT color="green">1120</FONT> * @param opPos The opcode position for the step.<a name="line.1120"></a> |
| <FONT color="green">1121</FONT> * @param stepType The type of step, one of OP_GROUP, etc.<a name="line.1121"></a> |
| <FONT color="green">1122</FONT> *<a name="line.1122"></a> |
| <FONT color="green">1123</FONT> * @return true if step has a predicate.<a name="line.1123"></a> |
| <FONT color="green">1124</FONT> *<a name="line.1124"></a> |
| <FONT color="green">1125</FONT> * @throws javax.xml.transform.TransformerException<a name="line.1125"></a> |
| <FONT color="green">1126</FONT> */<a name="line.1126"></a> |
| <FONT color="green">1127</FONT> static boolean analyzePredicate(Compiler compiler, int opPos, int stepType)<a name="line.1127"></a> |
| <FONT color="green">1128</FONT> throws javax.xml.transform.TransformerException<a name="line.1128"></a> |
| <FONT color="green">1129</FONT> {<a name="line.1129"></a> |
| <FONT color="green">1130</FONT> <a name="line.1130"></a> |
| <FONT color="green">1131</FONT> int argLen;<a name="line.1131"></a> |
| <FONT color="green">1132</FONT> <a name="line.1132"></a> |
| <FONT color="green">1133</FONT> switch (stepType)<a name="line.1133"></a> |
| <FONT color="green">1134</FONT> {<a name="line.1134"></a> |
| <FONT color="green">1135</FONT> case OpCodes.OP_VARIABLE :<a name="line.1135"></a> |
| <FONT color="green">1136</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.1136"></a> |
| <FONT color="green">1137</FONT> case OpCodes.OP_FUNCTION :<a name="line.1137"></a> |
| <FONT color="green">1138</FONT> case OpCodes.OP_GROUP :<a name="line.1138"></a> |
| <FONT color="green">1139</FONT> argLen = compiler.getArgLength(opPos);<a name="line.1139"></a> |
| <FONT color="green">1140</FONT> break;<a name="line.1140"></a> |
| <FONT color="green">1141</FONT> default :<a name="line.1141"></a> |
| <FONT color="green">1142</FONT> argLen = compiler.getArgLengthOfStep(opPos);<a name="line.1142"></a> |
| <FONT color="green">1143</FONT> }<a name="line.1143"></a> |
| <FONT color="green">1144</FONT> <a name="line.1144"></a> |
| <FONT color="green">1145</FONT> int pos = compiler.getFirstPredicateOpPos(opPos);<a name="line.1145"></a> |
| <FONT color="green">1146</FONT> int nPredicates = compiler.countPredicates(pos);<a name="line.1146"></a> |
| <FONT color="green">1147</FONT> <a name="line.1147"></a> |
| <FONT color="green">1148</FONT> return (nPredicates > 0) ? true : false;<a name="line.1148"></a> |
| <FONT color="green">1149</FONT> }<a name="line.1149"></a> |
| <FONT color="green">1150</FONT> <a name="line.1150"></a> |
| <FONT color="green">1151</FONT> /**<a name="line.1151"></a> |
| <FONT color="green">1152</FONT> * Create the proper Walker from the axes type.<a name="line.1152"></a> |
| <FONT color="green">1153</FONT> *<a name="line.1153"></a> |
| <FONT color="green">1154</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.1154"></a> |
| <FONT color="green">1155</FONT> * the XPath operations into an opcode map.<a name="line.1155"></a> |
| <FONT color="green">1156</FONT> * @param opPos The opcode position for the step.<a name="line.1156"></a> |
| <FONT color="green">1157</FONT> * @param lpi The owning location path iterator.<a name="line.1157"></a> |
| <FONT color="green">1158</FONT> * @param analysis 32 bits of analysis, from which the type of AxesWalker<a name="line.1158"></a> |
| <FONT color="green">1159</FONT> * may be influenced.<a name="line.1159"></a> |
| <FONT color="green">1160</FONT> *<a name="line.1160"></a> |
| <FONT color="green">1161</FONT> * @return non-null reference to AxesWalker derivative.<a name="line.1161"></a> |
| <FONT color="green">1162</FONT> * @throws RuntimeException if the input is bad.<a name="line.1162"></a> |
| <FONT color="green">1163</FONT> */<a name="line.1163"></a> |
| <FONT color="green">1164</FONT> private static AxesWalker createDefaultWalker(Compiler compiler, int opPos,<a name="line.1164"></a> |
| <FONT color="green">1165</FONT> WalkingIterator lpi, int analysis)<a name="line.1165"></a> |
| <FONT color="green">1166</FONT> {<a name="line.1166"></a> |
| <FONT color="green">1167</FONT> <a name="line.1167"></a> |
| <FONT color="green">1168</FONT> AxesWalker ai = null;<a name="line.1168"></a> |
| <FONT color="green">1169</FONT> int stepType = compiler.getOp(opPos);<a name="line.1169"></a> |
| <FONT color="green">1170</FONT> <a name="line.1170"></a> |
| <FONT color="green">1171</FONT> /*<a name="line.1171"></a> |
| <FONT color="green">1172</FONT> System.out.println("0: "+compiler.getOp(opPos));<a name="line.1172"></a> |
| <FONT color="green">1173</FONT> System.out.println("1: "+compiler.getOp(opPos+1));<a name="line.1173"></a> |
| <FONT color="green">1174</FONT> System.out.println("2: "+compiler.getOp(opPos+2));<a name="line.1174"></a> |
| <FONT color="green">1175</FONT> System.out.println("3: "+compiler.getOp(opPos+3));<a name="line.1175"></a> |
| <FONT color="green">1176</FONT> System.out.println("4: "+compiler.getOp(opPos+4));<a name="line.1176"></a> |
| <FONT color="green">1177</FONT> System.out.println("5: "+compiler.getOp(opPos+5));<a name="line.1177"></a> |
| <FONT color="green">1178</FONT> */<a name="line.1178"></a> |
| <FONT color="green">1179</FONT> boolean simpleInit = false;<a name="line.1179"></a> |
| <FONT color="green">1180</FONT> int totalNumberWalkers = (analysis & BITS_COUNT);<a name="line.1180"></a> |
| <FONT color="green">1181</FONT> boolean prevIsOneStepDown = true;<a name="line.1181"></a> |
| <FONT color="green">1182</FONT> <a name="line.1182"></a> |
| <FONT color="green">1183</FONT> switch (stepType)<a name="line.1183"></a> |
| <FONT color="green">1184</FONT> {<a name="line.1184"></a> |
| <FONT color="green">1185</FONT> case OpCodes.OP_VARIABLE :<a name="line.1185"></a> |
| <FONT color="green">1186</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.1186"></a> |
| <FONT color="green">1187</FONT> case OpCodes.OP_FUNCTION :<a name="line.1187"></a> |
| <FONT color="green">1188</FONT> case OpCodes.OP_GROUP :<a name="line.1188"></a> |
| <FONT color="green">1189</FONT> prevIsOneStepDown = false;<a name="line.1189"></a> |
| <FONT color="green">1190</FONT> <a name="line.1190"></a> |
| <FONT color="green">1191</FONT> if (DEBUG_WALKER_CREATION)<a name="line.1191"></a> |
| <FONT color="green">1192</FONT> System.out.println("new walker: FilterExprWalker: " + analysis<a name="line.1192"></a> |
| <FONT color="green">1193</FONT> + ", " + compiler.toString());<a name="line.1193"></a> |
| <FONT color="green">1194</FONT> <a name="line.1194"></a> |
| <FONT color="green">1195</FONT> ai = new FilterExprWalker(lpi);<a name="line.1195"></a> |
| <FONT color="green">1196</FONT> simpleInit = true;<a name="line.1196"></a> |
| <FONT color="green">1197</FONT> break;<a name="line.1197"></a> |
| <FONT color="green">1198</FONT> case OpCodes.FROM_ROOT :<a name="line.1198"></a> |
| <FONT color="green">1199</FONT> ai = new AxesWalker(lpi, Axis.ROOT);<a name="line.1199"></a> |
| <FONT color="green">1200</FONT> break;<a name="line.1200"></a> |
| <FONT color="green">1201</FONT> case OpCodes.FROM_ANCESTORS :<a name="line.1201"></a> |
| <FONT color="green">1202</FONT> prevIsOneStepDown = false;<a name="line.1202"></a> |
| <FONT color="green">1203</FONT> ai = new ReverseAxesWalker(lpi, Axis.ANCESTOR);<a name="line.1203"></a> |
| <FONT color="green">1204</FONT> break;<a name="line.1204"></a> |
| <FONT color="green">1205</FONT> case OpCodes.FROM_ANCESTORS_OR_SELF :<a name="line.1205"></a> |
| <FONT color="green">1206</FONT> prevIsOneStepDown = false;<a name="line.1206"></a> |
| <FONT color="green">1207</FONT> ai = new ReverseAxesWalker(lpi, Axis.ANCESTORORSELF);<a name="line.1207"></a> |
| <FONT color="green">1208</FONT> break;<a name="line.1208"></a> |
| <FONT color="green">1209</FONT> case OpCodes.FROM_ATTRIBUTES :<a name="line.1209"></a> |
| <FONT color="green">1210</FONT> ai = new AxesWalker(lpi, Axis.ATTRIBUTE);<a name="line.1210"></a> |
| <FONT color="green">1211</FONT> break;<a name="line.1211"></a> |
| <FONT color="green">1212</FONT> case OpCodes.FROM_NAMESPACE :<a name="line.1212"></a> |
| <FONT color="green">1213</FONT> ai = new AxesWalker(lpi, Axis.NAMESPACE);<a name="line.1213"></a> |
| <FONT color="green">1214</FONT> break;<a name="line.1214"></a> |
| <FONT color="green">1215</FONT> case OpCodes.FROM_CHILDREN :<a name="line.1215"></a> |
| <FONT color="green">1216</FONT> ai = new AxesWalker(lpi, Axis.CHILD);<a name="line.1216"></a> |
| <FONT color="green">1217</FONT> break;<a name="line.1217"></a> |
| <FONT color="green">1218</FONT> case OpCodes.FROM_DESCENDANTS :<a name="line.1218"></a> |
| <FONT color="green">1219</FONT> prevIsOneStepDown = false;<a name="line.1219"></a> |
| <FONT color="green">1220</FONT> ai = new AxesWalker(lpi, Axis.DESCENDANT);<a name="line.1220"></a> |
| <FONT color="green">1221</FONT> break;<a name="line.1221"></a> |
| <FONT color="green">1222</FONT> case OpCodes.FROM_DESCENDANTS_OR_SELF :<a name="line.1222"></a> |
| <FONT color="green">1223</FONT> prevIsOneStepDown = false;<a name="line.1223"></a> |
| <FONT color="green">1224</FONT> ai = new AxesWalker(lpi, Axis.DESCENDANTORSELF);<a name="line.1224"></a> |
| <FONT color="green">1225</FONT> break;<a name="line.1225"></a> |
| <FONT color="green">1226</FONT> case OpCodes.FROM_FOLLOWING :<a name="line.1226"></a> |
| <FONT color="green">1227</FONT> prevIsOneStepDown = false;<a name="line.1227"></a> |
| <FONT color="green">1228</FONT> ai = new AxesWalker(lpi, Axis.FOLLOWING);<a name="line.1228"></a> |
| <FONT color="green">1229</FONT> break;<a name="line.1229"></a> |
| <FONT color="green">1230</FONT> case OpCodes.FROM_FOLLOWING_SIBLINGS :<a name="line.1230"></a> |
| <FONT color="green">1231</FONT> prevIsOneStepDown = false;<a name="line.1231"></a> |
| <FONT color="green">1232</FONT> ai = new AxesWalker(lpi, Axis.FOLLOWINGSIBLING);<a name="line.1232"></a> |
| <FONT color="green">1233</FONT> break;<a name="line.1233"></a> |
| <FONT color="green">1234</FONT> case OpCodes.FROM_PRECEDING :<a name="line.1234"></a> |
| <FONT color="green">1235</FONT> prevIsOneStepDown = false;<a name="line.1235"></a> |
| <FONT color="green">1236</FONT> ai = new ReverseAxesWalker(lpi, Axis.PRECEDING);<a name="line.1236"></a> |
| <FONT color="green">1237</FONT> break;<a name="line.1237"></a> |
| <FONT color="green">1238</FONT> case OpCodes.FROM_PRECEDING_SIBLINGS :<a name="line.1238"></a> |
| <FONT color="green">1239</FONT> prevIsOneStepDown = false;<a name="line.1239"></a> |
| <FONT color="green">1240</FONT> ai = new ReverseAxesWalker(lpi, Axis.PRECEDINGSIBLING);<a name="line.1240"></a> |
| <FONT color="green">1241</FONT> break;<a name="line.1241"></a> |
| <FONT color="green">1242</FONT> case OpCodes.FROM_PARENT :<a name="line.1242"></a> |
| <FONT color="green">1243</FONT> prevIsOneStepDown = false;<a name="line.1243"></a> |
| <FONT color="green">1244</FONT> ai = new ReverseAxesWalker(lpi, Axis.PARENT);<a name="line.1244"></a> |
| <FONT color="green">1245</FONT> break;<a name="line.1245"></a> |
| <FONT color="green">1246</FONT> case OpCodes.FROM_SELF :<a name="line.1246"></a> |
| <FONT color="green">1247</FONT> ai = new AxesWalker(lpi, Axis.SELF);<a name="line.1247"></a> |
| <FONT color="green">1248</FONT> break;<a name="line.1248"></a> |
| <FONT color="green">1249</FONT> default :<a name="line.1249"></a> |
| <FONT color="green">1250</FONT> throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "<a name="line.1250"></a> |
| <FONT color="green">1251</FONT> //+ stepType);<a name="line.1251"></a> |
| <FONT color="green">1252</FONT> }<a name="line.1252"></a> |
| <FONT color="green">1253</FONT> <a name="line.1253"></a> |
| <FONT color="green">1254</FONT> if (simpleInit)<a name="line.1254"></a> |
| <FONT color="green">1255</FONT> {<a name="line.1255"></a> |
| <FONT color="green">1256</FONT> ai.initNodeTest(DTMFilter.SHOW_ALL);<a name="line.1256"></a> |
| <FONT color="green">1257</FONT> }<a name="line.1257"></a> |
| <FONT color="green">1258</FONT> else<a name="line.1258"></a> |
| <FONT color="green">1259</FONT> {<a name="line.1259"></a> |
| <FONT color="green">1260</FONT> int whatToShow = compiler.getWhatToShow(opPos);<a name="line.1260"></a> |
| <FONT color="green">1261</FONT> <a name="line.1261"></a> |
| <FONT color="green">1262</FONT> /*<a name="line.1262"></a> |
| <FONT color="green">1263</FONT> System.out.print("construct: ");<a name="line.1263"></a> |
| <FONT color="green">1264</FONT> NodeTest.debugWhatToShow(whatToShow);<a name="line.1264"></a> |
| <FONT color="green">1265</FONT> System.out.println("or stuff: "+(whatToShow & (DTMFilter.SHOW_ATTRIBUTE<a name="line.1265"></a> |
| <FONT color="green">1266</FONT> | DTMFilter.SHOW_ELEMENT<a name="line.1266"></a> |
| <FONT color="green">1267</FONT> | DTMFilter.SHOW_PROCESSING_INSTRUCTION)));<a name="line.1267"></a> |
| <FONT color="green">1268</FONT> */<a name="line.1268"></a> |
| <FONT color="green">1269</FONT> if ((0 == (whatToShow<a name="line.1269"></a> |
| <FONT color="green">1270</FONT> & (DTMFilter.SHOW_ATTRIBUTE | DTMFilter.SHOW_NAMESPACE | DTMFilter.SHOW_ELEMENT<a name="line.1270"></a> |
| <FONT color="green">1271</FONT> | DTMFilter.SHOW_PROCESSING_INSTRUCTION))) || (whatToShow == DTMFilter.SHOW_ALL))<a name="line.1271"></a> |
| <FONT color="green">1272</FONT> ai.initNodeTest(whatToShow);<a name="line.1272"></a> |
| <FONT color="green">1273</FONT> else<a name="line.1273"></a> |
| <FONT color="green">1274</FONT> {<a name="line.1274"></a> |
| <FONT color="green">1275</FONT> ai.initNodeTest(whatToShow, compiler.getStepNS(opPos),<a name="line.1275"></a> |
| <FONT color="green">1276</FONT> compiler.getStepLocalName(opPos));<a name="line.1276"></a> |
| <FONT color="green">1277</FONT> }<a name="line.1277"></a> |
| <FONT color="green">1278</FONT> }<a name="line.1278"></a> |
| <FONT color="green">1279</FONT> <a name="line.1279"></a> |
| <FONT color="green">1280</FONT> return ai;<a name="line.1280"></a> |
| <FONT color="green">1281</FONT> }<a name="line.1281"></a> |
| <FONT color="green">1282</FONT> <a name="line.1282"></a> |
| <FONT color="green">1283</FONT> public static String getAnalysisString(int analysis)<a name="line.1283"></a> |
| <FONT color="green">1284</FONT> {<a name="line.1284"></a> |
| <FONT color="green">1285</FONT> StringBuffer buf = new StringBuffer();<a name="line.1285"></a> |
| <FONT color="green">1286</FONT> buf.append("count: "+getStepCount(analysis)+" ");<a name="line.1286"></a> |
| <FONT color="green">1287</FONT> if((analysis & BIT_NODETEST_ANY) != 0)<a name="line.1287"></a> |
| <FONT color="green">1288</FONT> {<a name="line.1288"></a> |
| <FONT color="green">1289</FONT> buf.append("NTANY|");<a name="line.1289"></a> |
| <FONT color="green">1290</FONT> }<a name="line.1290"></a> |
| <FONT color="green">1291</FONT> if((analysis & BIT_PREDICATE) != 0)<a name="line.1291"></a> |
| <FONT color="green">1292</FONT> {<a name="line.1292"></a> |
| <FONT color="green">1293</FONT> buf.append("PRED|");<a name="line.1293"></a> |
| <FONT color="green">1294</FONT> }<a name="line.1294"></a> |
| <FONT color="green">1295</FONT> if((analysis & BIT_ANCESTOR) != 0)<a name="line.1295"></a> |
| <FONT color="green">1296</FONT> {<a name="line.1296"></a> |
| <FONT color="green">1297</FONT> buf.append("ANC|");<a name="line.1297"></a> |
| <FONT color="green">1298</FONT> }<a name="line.1298"></a> |
| <FONT color="green">1299</FONT> if((analysis & BIT_ANCESTOR_OR_SELF) != 0)<a name="line.1299"></a> |
| <FONT color="green">1300</FONT> {<a name="line.1300"></a> |
| <FONT color="green">1301</FONT> buf.append("ANCOS|");<a name="line.1301"></a> |
| <FONT color="green">1302</FONT> }<a name="line.1302"></a> |
| <FONT color="green">1303</FONT> if((analysis & BIT_ATTRIBUTE) != 0)<a name="line.1303"></a> |
| <FONT color="green">1304</FONT> {<a name="line.1304"></a> |
| <FONT color="green">1305</FONT> buf.append("ATTR|");<a name="line.1305"></a> |
| <FONT color="green">1306</FONT> }<a name="line.1306"></a> |
| <FONT color="green">1307</FONT> if((analysis & BIT_CHILD) != 0)<a name="line.1307"></a> |
| <FONT color="green">1308</FONT> {<a name="line.1308"></a> |
| <FONT color="green">1309</FONT> buf.append("CH|");<a name="line.1309"></a> |
| <FONT color="green">1310</FONT> }<a name="line.1310"></a> |
| <FONT color="green">1311</FONT> if((analysis & BIT_DESCENDANT) != 0)<a name="line.1311"></a> |
| <FONT color="green">1312</FONT> {<a name="line.1312"></a> |
| <FONT color="green">1313</FONT> buf.append("DESC|");<a name="line.1313"></a> |
| <FONT color="green">1314</FONT> }<a name="line.1314"></a> |
| <FONT color="green">1315</FONT> if((analysis & BIT_DESCENDANT_OR_SELF) != 0)<a name="line.1315"></a> |
| <FONT color="green">1316</FONT> {<a name="line.1316"></a> |
| <FONT color="green">1317</FONT> buf.append("DESCOS|");<a name="line.1317"></a> |
| <FONT color="green">1318</FONT> }<a name="line.1318"></a> |
| <FONT color="green">1319</FONT> if((analysis & BIT_FOLLOWING) != 0)<a name="line.1319"></a> |
| <FONT color="green">1320</FONT> {<a name="line.1320"></a> |
| <FONT color="green">1321</FONT> buf.append("FOL|");<a name="line.1321"></a> |
| <FONT color="green">1322</FONT> }<a name="line.1322"></a> |
| <FONT color="green">1323</FONT> if((analysis & BIT_FOLLOWING_SIBLING) != 0)<a name="line.1323"></a> |
| <FONT color="green">1324</FONT> {<a name="line.1324"></a> |
| <FONT color="green">1325</FONT> buf.append("FOLS|");<a name="line.1325"></a> |
| <FONT color="green">1326</FONT> }<a name="line.1326"></a> |
| <FONT color="green">1327</FONT> if((analysis & BIT_NAMESPACE) != 0)<a name="line.1327"></a> |
| <FONT color="green">1328</FONT> {<a name="line.1328"></a> |
| <FONT color="green">1329</FONT> buf.append("NS|");<a name="line.1329"></a> |
| <FONT color="green">1330</FONT> }<a name="line.1330"></a> |
| <FONT color="green">1331</FONT> if((analysis & BIT_PARENT) != 0)<a name="line.1331"></a> |
| <FONT color="green">1332</FONT> {<a name="line.1332"></a> |
| <FONT color="green">1333</FONT> buf.append("P|");<a name="line.1333"></a> |
| <FONT color="green">1334</FONT> }<a name="line.1334"></a> |
| <FONT color="green">1335</FONT> if((analysis & BIT_PRECEDING) != 0)<a name="line.1335"></a> |
| <FONT color="green">1336</FONT> {<a name="line.1336"></a> |
| <FONT color="green">1337</FONT> buf.append("PREC|");<a name="line.1337"></a> |
| <FONT color="green">1338</FONT> }<a name="line.1338"></a> |
| <FONT color="green">1339</FONT> if((analysis & BIT_PRECEDING_SIBLING) != 0)<a name="line.1339"></a> |
| <FONT color="green">1340</FONT> {<a name="line.1340"></a> |
| <FONT color="green">1341</FONT> buf.append("PRECS|");<a name="line.1341"></a> |
| <FONT color="green">1342</FONT> }<a name="line.1342"></a> |
| <FONT color="green">1343</FONT> if((analysis & BIT_SELF) != 0)<a name="line.1343"></a> |
| <FONT color="green">1344</FONT> {<a name="line.1344"></a> |
| <FONT color="green">1345</FONT> buf.append(".|");<a name="line.1345"></a> |
| <FONT color="green">1346</FONT> }<a name="line.1346"></a> |
| <FONT color="green">1347</FONT> if((analysis & BIT_FILTER) != 0)<a name="line.1347"></a> |
| <FONT color="green">1348</FONT> {<a name="line.1348"></a> |
| <FONT color="green">1349</FONT> buf.append("FLT|");<a name="line.1349"></a> |
| <FONT color="green">1350</FONT> }<a name="line.1350"></a> |
| <FONT color="green">1351</FONT> if((analysis & BIT_ROOT) != 0)<a name="line.1351"></a> |
| <FONT color="green">1352</FONT> {<a name="line.1352"></a> |
| <FONT color="green">1353</FONT> buf.append("R|");<a name="line.1353"></a> |
| <FONT color="green">1354</FONT> }<a name="line.1354"></a> |
| <FONT color="green">1355</FONT> return buf.toString();<a name="line.1355"></a> |
| <FONT color="green">1356</FONT> }<a name="line.1356"></a> |
| <FONT color="green">1357</FONT> <a name="line.1357"></a> |
| <FONT color="green">1358</FONT> /** Set to true for diagnostics about walker creation */<a name="line.1358"></a> |
| <FONT color="green">1359</FONT> static final boolean DEBUG_PATTERN_CREATION = false;<a name="line.1359"></a> |
| <FONT color="green">1360</FONT> <a name="line.1360"></a> |
| <FONT color="green">1361</FONT> /** Set to true for diagnostics about walker creation */<a name="line.1361"></a> |
| <FONT color="green">1362</FONT> static final boolean DEBUG_WALKER_CREATION = false;<a name="line.1362"></a> |
| <FONT color="green">1363</FONT> <a name="line.1363"></a> |
| <FONT color="green">1364</FONT> /** Set to true for diagnostics about iterator creation */<a name="line.1364"></a> |
| <FONT color="green">1365</FONT> static final boolean DEBUG_ITERATOR_CREATION = false;<a name="line.1365"></a> |
| <FONT color="green">1366</FONT> <a name="line.1366"></a> |
| <FONT color="green">1367</FONT> public static boolean hasPredicate(int analysis)<a name="line.1367"></a> |
| <FONT color="green">1368</FONT> {<a name="line.1368"></a> |
| <FONT color="green">1369</FONT> return (0 != (analysis & BIT_PREDICATE));<a name="line.1369"></a> |
| <FONT color="green">1370</FONT> }<a name="line.1370"></a> |
| <FONT color="green">1371</FONT> <a name="line.1371"></a> |
| <FONT color="green">1372</FONT> public static boolean isWild(int analysis)<a name="line.1372"></a> |
| <FONT color="green">1373</FONT> {<a name="line.1373"></a> |
| <FONT color="green">1374</FONT> return (0 != (analysis & BIT_NODETEST_ANY));<a name="line.1374"></a> |
| <FONT color="green">1375</FONT> }<a name="line.1375"></a> |
| <FONT color="green">1376</FONT> <a name="line.1376"></a> |
| <FONT color="green">1377</FONT> public static boolean walksAncestors(int analysis)<a name="line.1377"></a> |
| <FONT color="green">1378</FONT> {<a name="line.1378"></a> |
| <FONT color="green">1379</FONT> return isSet(analysis, BIT_ANCESTOR | BIT_ANCESTOR_OR_SELF);<a name="line.1379"></a> |
| <FONT color="green">1380</FONT> }<a name="line.1380"></a> |
| <FONT color="green">1381</FONT> <a name="line.1381"></a> |
| <FONT color="green">1382</FONT> public static boolean walksAttributes(int analysis)<a name="line.1382"></a> |
| <FONT color="green">1383</FONT> {<a name="line.1383"></a> |
| <FONT color="green">1384</FONT> return (0 != (analysis & BIT_ATTRIBUTE));<a name="line.1384"></a> |
| <FONT color="green">1385</FONT> }<a name="line.1385"></a> |
| <FONT color="green">1386</FONT> <a name="line.1386"></a> |
| <FONT color="green">1387</FONT> public static boolean walksNamespaces(int analysis)<a name="line.1387"></a> |
| <FONT color="green">1388</FONT> {<a name="line.1388"></a> |
| <FONT color="green">1389</FONT> return (0 != (analysis & BIT_NAMESPACE));<a name="line.1389"></a> |
| <FONT color="green">1390</FONT> } <a name="line.1390"></a> |
| <FONT color="green">1391</FONT> <a name="line.1391"></a> |
| <FONT color="green">1392</FONT> public static boolean walksChildren(int analysis)<a name="line.1392"></a> |
| <FONT color="green">1393</FONT> {<a name="line.1393"></a> |
| <FONT color="green">1394</FONT> return (0 != (analysis & BIT_CHILD));<a name="line.1394"></a> |
| <FONT color="green">1395</FONT> }<a name="line.1395"></a> |
| <FONT color="green">1396</FONT> <a name="line.1396"></a> |
| <FONT color="green">1397</FONT> public static boolean walksDescendants(int analysis)<a name="line.1397"></a> |
| <FONT color="green">1398</FONT> {<a name="line.1398"></a> |
| <FONT color="green">1399</FONT> return isSet(analysis, BIT_DESCENDANT | BIT_DESCENDANT_OR_SELF);<a name="line.1399"></a> |
| <FONT color="green">1400</FONT> }<a name="line.1400"></a> |
| <FONT color="green">1401</FONT> <a name="line.1401"></a> |
| <FONT color="green">1402</FONT> public static boolean walksSubtree(int analysis)<a name="line.1402"></a> |
| <FONT color="green">1403</FONT> {<a name="line.1403"></a> |
| <FONT color="green">1404</FONT> return isSet(analysis, BIT_DESCENDANT | BIT_DESCENDANT_OR_SELF | BIT_CHILD);<a name="line.1404"></a> |
| <FONT color="green">1405</FONT> }<a name="line.1405"></a> |
| <FONT color="green">1406</FONT> <a name="line.1406"></a> |
| <FONT color="green">1407</FONT> public static boolean walksSubtreeOnlyMaybeAbsolute(int analysis)<a name="line.1407"></a> |
| <FONT color="green">1408</FONT> {<a name="line.1408"></a> |
| <FONT color="green">1409</FONT> return walksSubtree(analysis)<a name="line.1409"></a> |
| <FONT color="green">1410</FONT> && !walksExtraNodes(analysis) <a name="line.1410"></a> |
| <FONT color="green">1411</FONT> && !walksUp(analysis) <a name="line.1411"></a> |
| <FONT color="green">1412</FONT> && !walksSideways(analysis) <a name="line.1412"></a> |
| <FONT color="green">1413</FONT> ;<a name="line.1413"></a> |
| <FONT color="green">1414</FONT> }<a name="line.1414"></a> |
| <FONT color="green">1415</FONT> <a name="line.1415"></a> |
| <FONT color="green">1416</FONT> public static boolean walksSubtreeOnly(int analysis)<a name="line.1416"></a> |
| <FONT color="green">1417</FONT> {<a name="line.1417"></a> |
| <FONT color="green">1418</FONT> return walksSubtreeOnlyMaybeAbsolute(analysis) <a name="line.1418"></a> |
| <FONT color="green">1419</FONT> && !isAbsolute(analysis) <a name="line.1419"></a> |
| <FONT color="green">1420</FONT> ;<a name="line.1420"></a> |
| <FONT color="green">1421</FONT> }<a name="line.1421"></a> |
| <FONT color="green">1422</FONT> <a name="line.1422"></a> |
| <FONT color="green">1423</FONT> public static boolean walksFilteredList(int analysis)<a name="line.1423"></a> |
| <FONT color="green">1424</FONT> {<a name="line.1424"></a> |
| <FONT color="green">1425</FONT> return isSet(analysis, BIT_FILTER);<a name="line.1425"></a> |
| <FONT color="green">1426</FONT> }<a name="line.1426"></a> |
| <FONT color="green">1427</FONT> <a name="line.1427"></a> |
| <FONT color="green">1428</FONT> public static boolean walksSubtreeOnlyFromRootOrContext(int analysis)<a name="line.1428"></a> |
| <FONT color="green">1429</FONT> {<a name="line.1429"></a> |
| <FONT color="green">1430</FONT> return walksSubtree(analysis)<a name="line.1430"></a> |
| <FONT color="green">1431</FONT> && !walksExtraNodes(analysis) <a name="line.1431"></a> |
| <FONT color="green">1432</FONT> && !walksUp(analysis) <a name="line.1432"></a> |
| <FONT color="green">1433</FONT> && !walksSideways(analysis) <a name="line.1433"></a> |
| <FONT color="green">1434</FONT> && !isSet(analysis, BIT_FILTER) <a name="line.1434"></a> |
| <FONT color="green">1435</FONT> ;<a name="line.1435"></a> |
| <FONT color="green">1436</FONT> }<a name="line.1436"></a> |
| <FONT color="green">1437</FONT> <a name="line.1437"></a> |
| <FONT color="green">1438</FONT> public static boolean walksInDocOrder(int analysis)<a name="line.1438"></a> |
| <FONT color="green">1439</FONT> {<a name="line.1439"></a> |
| <FONT color="green">1440</FONT> return (walksSubtreeOnlyMaybeAbsolute(analysis)<a name="line.1440"></a> |
| <FONT color="green">1441</FONT> || walksExtraNodesOnly(analysis)<a name="line.1441"></a> |
| <FONT color="green">1442</FONT> || walksFollowingOnlyMaybeAbsolute(analysis)) <a name="line.1442"></a> |
| <FONT color="green">1443</FONT> && !isSet(analysis, BIT_FILTER) <a name="line.1443"></a> |
| <FONT color="green">1444</FONT> ;<a name="line.1444"></a> |
| <FONT color="green">1445</FONT> }<a name="line.1445"></a> |
| <FONT color="green">1446</FONT> <a name="line.1446"></a> |
| <FONT color="green">1447</FONT> public static boolean walksFollowingOnlyMaybeAbsolute(int analysis)<a name="line.1447"></a> |
| <FONT color="green">1448</FONT> {<a name="line.1448"></a> |
| <FONT color="green">1449</FONT> return isSet(analysis, BIT_SELF | BIT_FOLLOWING_SIBLING | BIT_FOLLOWING)<a name="line.1449"></a> |
| <FONT color="green">1450</FONT> && !walksSubtree(analysis) <a name="line.1450"></a> |
| <FONT color="green">1451</FONT> && !walksUp(analysis) <a name="line.1451"></a> |
| <FONT color="green">1452</FONT> && !walksSideways(analysis) <a name="line.1452"></a> |
| <FONT color="green">1453</FONT> ;<a name="line.1453"></a> |
| <FONT color="green">1454</FONT> }<a name="line.1454"></a> |
| <FONT color="green">1455</FONT> <a name="line.1455"></a> |
| <FONT color="green">1456</FONT> public static boolean walksUp(int analysis)<a name="line.1456"></a> |
| <FONT color="green">1457</FONT> {<a name="line.1457"></a> |
| <FONT color="green">1458</FONT> return isSet(analysis, BIT_PARENT | BIT_ANCESTOR | BIT_ANCESTOR_OR_SELF);<a name="line.1458"></a> |
| <FONT color="green">1459</FONT> }<a name="line.1459"></a> |
| <FONT color="green">1460</FONT> <a name="line.1460"></a> |
| <FONT color="green">1461</FONT> public static boolean walksSideways(int analysis)<a name="line.1461"></a> |
| <FONT color="green">1462</FONT> {<a name="line.1462"></a> |
| <FONT color="green">1463</FONT> return isSet(analysis, BIT_FOLLOWING | BIT_FOLLOWING_SIBLING | <a name="line.1463"></a> |
| <FONT color="green">1464</FONT> BIT_PRECEDING | BIT_PRECEDING_SIBLING);<a name="line.1464"></a> |
| <FONT color="green">1465</FONT> }<a name="line.1465"></a> |
| <FONT color="green">1466</FONT> <a name="line.1466"></a> |
| <FONT color="green">1467</FONT> public static boolean walksExtraNodes(int analysis)<a name="line.1467"></a> |
| <FONT color="green">1468</FONT> {<a name="line.1468"></a> |
| <FONT color="green">1469</FONT> return isSet(analysis, BIT_NAMESPACE | BIT_ATTRIBUTE);<a name="line.1469"></a> |
| <FONT color="green">1470</FONT> }<a name="line.1470"></a> |
| <FONT color="green">1471</FONT> <a name="line.1471"></a> |
| <FONT color="green">1472</FONT> public static boolean walksExtraNodesOnly(int analysis)<a name="line.1472"></a> |
| <FONT color="green">1473</FONT> {<a name="line.1473"></a> |
| <FONT color="green">1474</FONT> return walksExtraNodes(analysis)<a name="line.1474"></a> |
| <FONT color="green">1475</FONT> && !isSet(analysis, BIT_SELF) <a name="line.1475"></a> |
| <FONT color="green">1476</FONT> && !walksSubtree(analysis) <a name="line.1476"></a> |
| <FONT color="green">1477</FONT> && !walksUp(analysis) <a name="line.1477"></a> |
| <FONT color="green">1478</FONT> && !walksSideways(analysis) <a name="line.1478"></a> |
| <FONT color="green">1479</FONT> && !isAbsolute(analysis) <a name="line.1479"></a> |
| <FONT color="green">1480</FONT> ;<a name="line.1480"></a> |
| <FONT color="green">1481</FONT> }<a name="line.1481"></a> |
| <FONT color="green">1482</FONT> <a name="line.1482"></a> |
| <FONT color="green">1483</FONT> public static boolean isAbsolute(int analysis)<a name="line.1483"></a> |
| <FONT color="green">1484</FONT> {<a name="line.1484"></a> |
| <FONT color="green">1485</FONT> return isSet(analysis, BIT_ROOT | BIT_FILTER);<a name="line.1485"></a> |
| <FONT color="green">1486</FONT> }<a name="line.1486"></a> |
| <FONT color="green">1487</FONT> <a name="line.1487"></a> |
| <FONT color="green">1488</FONT> public static boolean walksChildrenOnly(int analysis)<a name="line.1488"></a> |
| <FONT color="green">1489</FONT> {<a name="line.1489"></a> |
| <FONT color="green">1490</FONT> return walksChildren(analysis)<a name="line.1490"></a> |
| <FONT color="green">1491</FONT> && !isSet(analysis, BIT_SELF)<a name="line.1491"></a> |
| <FONT color="green">1492</FONT> && !walksExtraNodes(analysis)<a name="line.1492"></a> |
| <FONT color="green">1493</FONT> && !walksDescendants(analysis) <a name="line.1493"></a> |
| <FONT color="green">1494</FONT> && !walksUp(analysis) <a name="line.1494"></a> |
| <FONT color="green">1495</FONT> && !walksSideways(analysis) <a name="line.1495"></a> |
| <FONT color="green">1496</FONT> && (!isAbsolute(analysis) || isSet(analysis, BIT_ROOT))<a name="line.1496"></a> |
| <FONT color="green">1497</FONT> ;<a name="line.1497"></a> |
| <FONT color="green">1498</FONT> }<a name="line.1498"></a> |
| <FONT color="green">1499</FONT> <a name="line.1499"></a> |
| <FONT color="green">1500</FONT> public static boolean walksChildrenAndExtraAndSelfOnly(int analysis)<a name="line.1500"></a> |
| <FONT color="green">1501</FONT> {<a name="line.1501"></a> |
| <FONT color="green">1502</FONT> return walksChildren(analysis)<a name="line.1502"></a> |
| <FONT color="green">1503</FONT> && !walksDescendants(analysis) <a name="line.1503"></a> |
| <FONT color="green">1504</FONT> && !walksUp(analysis) <a name="line.1504"></a> |
| <FONT color="green">1505</FONT> && !walksSideways(analysis) <a name="line.1505"></a> |
| <FONT color="green">1506</FONT> && (!isAbsolute(analysis) || isSet(analysis, BIT_ROOT))<a name="line.1506"></a> |
| <FONT color="green">1507</FONT> ;<a name="line.1507"></a> |
| <FONT color="green">1508</FONT> }<a name="line.1508"></a> |
| <FONT color="green">1509</FONT> <a name="line.1509"></a> |
| <FONT color="green">1510</FONT> public static boolean walksDescendantsAndExtraAndSelfOnly(int analysis)<a name="line.1510"></a> |
| <FONT color="green">1511</FONT> {<a name="line.1511"></a> |
| <FONT color="green">1512</FONT> return !walksChildren(analysis)<a name="line.1512"></a> |
| <FONT color="green">1513</FONT> && walksDescendants(analysis) <a name="line.1513"></a> |
| <FONT color="green">1514</FONT> && !walksUp(analysis) <a name="line.1514"></a> |
| <FONT color="green">1515</FONT> && !walksSideways(analysis) <a name="line.1515"></a> |
| <FONT color="green">1516</FONT> && (!isAbsolute(analysis) || isSet(analysis, BIT_ROOT))<a name="line.1516"></a> |
| <FONT color="green">1517</FONT> ;<a name="line.1517"></a> |
| <FONT color="green">1518</FONT> }<a name="line.1518"></a> |
| <FONT color="green">1519</FONT> <a name="line.1519"></a> |
| <FONT color="green">1520</FONT> public static boolean walksSelfOnly(int analysis)<a name="line.1520"></a> |
| <FONT color="green">1521</FONT> {<a name="line.1521"></a> |
| <FONT color="green">1522</FONT> return isSet(analysis, BIT_SELF) <a name="line.1522"></a> |
| <FONT color="green">1523</FONT> && !walksSubtree(analysis) <a name="line.1523"></a> |
| <FONT color="green">1524</FONT> && !walksUp(analysis) <a name="line.1524"></a> |
| <FONT color="green">1525</FONT> && !walksSideways(analysis) <a name="line.1525"></a> |
| <FONT color="green">1526</FONT> && !isAbsolute(analysis) <a name="line.1526"></a> |
| <FONT color="green">1527</FONT> ;<a name="line.1527"></a> |
| <FONT color="green">1528</FONT> }<a name="line.1528"></a> |
| <FONT color="green">1529</FONT> <a name="line.1529"></a> |
| <FONT color="green">1530</FONT> <a name="line.1530"></a> |
| <FONT color="green">1531</FONT> public static boolean walksUpOnly(int analysis)<a name="line.1531"></a> |
| <FONT color="green">1532</FONT> {<a name="line.1532"></a> |
| <FONT color="green">1533</FONT> return !walksSubtree(analysis) <a name="line.1533"></a> |
| <FONT color="green">1534</FONT> && walksUp(analysis) <a name="line.1534"></a> |
| <FONT color="green">1535</FONT> && !walksSideways(analysis) <a name="line.1535"></a> |
| <FONT color="green">1536</FONT> && !isAbsolute(analysis) <a name="line.1536"></a> |
| <FONT color="green">1537</FONT> ;<a name="line.1537"></a> |
| <FONT color="green">1538</FONT> }<a name="line.1538"></a> |
| <FONT color="green">1539</FONT> <a name="line.1539"></a> |
| <FONT color="green">1540</FONT> public static boolean walksDownOnly(int analysis)<a name="line.1540"></a> |
| <FONT color="green">1541</FONT> {<a name="line.1541"></a> |
| <FONT color="green">1542</FONT> return walksSubtree(analysis) <a name="line.1542"></a> |
| <FONT color="green">1543</FONT> && !walksUp(analysis) <a name="line.1543"></a> |
| <FONT color="green">1544</FONT> && !walksSideways(analysis) <a name="line.1544"></a> |
| <FONT color="green">1545</FONT> && !isAbsolute(analysis) <a name="line.1545"></a> |
| <FONT color="green">1546</FONT> ;<a name="line.1546"></a> |
| <FONT color="green">1547</FONT> }<a name="line.1547"></a> |
| <FONT color="green">1548</FONT> <a name="line.1548"></a> |
| <FONT color="green">1549</FONT> public static boolean walksDownExtraOnly(int analysis)<a name="line.1549"></a> |
| <FONT color="green">1550</FONT> {<a name="line.1550"></a> |
| <FONT color="green">1551</FONT> return walksSubtree(analysis) && walksExtraNodes(analysis)<a name="line.1551"></a> |
| <FONT color="green">1552</FONT> && !walksUp(analysis) <a name="line.1552"></a> |
| <FONT color="green">1553</FONT> && !walksSideways(analysis) <a name="line.1553"></a> |
| <FONT color="green">1554</FONT> && !isAbsolute(analysis) <a name="line.1554"></a> |
| <FONT color="green">1555</FONT> ;<a name="line.1555"></a> |
| <FONT color="green">1556</FONT> }<a name="line.1556"></a> |
| <FONT color="green">1557</FONT> <a name="line.1557"></a> |
| <FONT color="green">1558</FONT> public static boolean canSkipSubtrees(int analysis)<a name="line.1558"></a> |
| <FONT color="green">1559</FONT> {<a name="line.1559"></a> |
| <FONT color="green">1560</FONT> return isSet(analysis, BIT_CHILD) | walksSideways(analysis);<a name="line.1560"></a> |
| <FONT color="green">1561</FONT> }<a name="line.1561"></a> |
| <FONT color="green">1562</FONT> <a name="line.1562"></a> |
| <FONT color="green">1563</FONT> public static boolean canCrissCross(int analysis)<a name="line.1563"></a> |
| <FONT color="green">1564</FONT> {<a name="line.1564"></a> |
| <FONT color="green">1565</FONT> // This could be done faster. Coded for clarity.<a name="line.1565"></a> |
| <FONT color="green">1566</FONT> if(walksSelfOnly(analysis))<a name="line.1566"></a> |
| <FONT color="green">1567</FONT> return false;<a name="line.1567"></a> |
| <FONT color="green">1568</FONT> else if(walksDownOnly(analysis) && !canSkipSubtrees(analysis))<a name="line.1568"></a> |
| <FONT color="green">1569</FONT> return false;<a name="line.1569"></a> |
| <FONT color="green">1570</FONT> else if(walksChildrenAndExtraAndSelfOnly(analysis))<a name="line.1570"></a> |
| <FONT color="green">1571</FONT> return false;<a name="line.1571"></a> |
| <FONT color="green">1572</FONT> else if(walksDescendantsAndExtraAndSelfOnly(analysis))<a name="line.1572"></a> |
| <FONT color="green">1573</FONT> return false;<a name="line.1573"></a> |
| <FONT color="green">1574</FONT> else if(walksUpOnly(analysis))<a name="line.1574"></a> |
| <FONT color="green">1575</FONT> return false;<a name="line.1575"></a> |
| <FONT color="green">1576</FONT> else if(walksExtraNodesOnly(analysis))<a name="line.1576"></a> |
| <FONT color="green">1577</FONT> return false;<a name="line.1577"></a> |
| <FONT color="green">1578</FONT> else if(walksSubtree(analysis) <a name="line.1578"></a> |
| <FONT color="green">1579</FONT> && (walksSideways(analysis) <a name="line.1579"></a> |
| <FONT color="green">1580</FONT> || walksUp(analysis) <a name="line.1580"></a> |
| <FONT color="green">1581</FONT> || canSkipSubtrees(analysis)))<a name="line.1581"></a> |
| <FONT color="green">1582</FONT> return true;<a name="line.1582"></a> |
| <FONT color="green">1583</FONT> else<a name="line.1583"></a> |
| <FONT color="green">1584</FONT> return false;<a name="line.1584"></a> |
| <FONT color="green">1585</FONT> }<a name="line.1585"></a> |
| <FONT color="green">1586</FONT> <a name="line.1586"></a> |
| <FONT color="green">1587</FONT> /**<a name="line.1587"></a> |
| <FONT color="green">1588</FONT> * Tell if the pattern can be 'walked' with the iteration steps in natural <a name="line.1588"></a> |
| <FONT color="green">1589</FONT> * document order, without duplicates.<a name="line.1589"></a> |
| <FONT color="green">1590</FONT> *<a name="line.1590"></a> |
| <FONT color="green">1591</FONT> * @param analysis The general analysis of the pattern.<a name="line.1591"></a> |
| <FONT color="green">1592</FONT> *<a name="line.1592"></a> |
| <FONT color="green">1593</FONT> * @return true if the walk can be done in natural order.<a name="line.1593"></a> |
| <FONT color="green">1594</FONT> *<a name="line.1594"></a> |
| <FONT color="green">1595</FONT> * @throws javax.xml.transform.TransformerException<a name="line.1595"></a> |
| <FONT color="green">1596</FONT> */<a name="line.1596"></a> |
| <FONT color="green">1597</FONT> static public boolean isNaturalDocOrder(int analysis)<a name="line.1597"></a> |
| <FONT color="green">1598</FONT> {<a name="line.1598"></a> |
| <FONT color="green">1599</FONT> if(canCrissCross(analysis) || isSet(analysis, BIT_NAMESPACE) ||<a name="line.1599"></a> |
| <FONT color="green">1600</FONT> walksFilteredList(analysis))<a name="line.1600"></a> |
| <FONT color="green">1601</FONT> return false;<a name="line.1601"></a> |
| <FONT color="green">1602</FONT> <a name="line.1602"></a> |
| <FONT color="green">1603</FONT> if(walksInDocOrder(analysis))<a name="line.1603"></a> |
| <FONT color="green">1604</FONT> return true;<a name="line.1604"></a> |
| <FONT color="green">1605</FONT> <a name="line.1605"></a> |
| <FONT color="green">1606</FONT> return false;<a name="line.1606"></a> |
| <FONT color="green">1607</FONT> }<a name="line.1607"></a> |
| <FONT color="green">1608</FONT> <a name="line.1608"></a> |
| <FONT color="green">1609</FONT> /**<a name="line.1609"></a> |
| <FONT color="green">1610</FONT> * Tell if the pattern can be 'walked' with the iteration steps in natural <a name="line.1610"></a> |
| <FONT color="green">1611</FONT> * document order, without duplicates.<a name="line.1611"></a> |
| <FONT color="green">1612</FONT> *<a name="line.1612"></a> |
| <FONT color="green">1613</FONT> * @param compiler non-null reference to compiler object that has processed<a name="line.1613"></a> |
| <FONT color="green">1614</FONT> * the XPath operations into an opcode map.<a name="line.1614"></a> |
| <FONT color="green">1615</FONT> * @param stepOpCodePos The opcode position for the step.<a name="line.1615"></a> |
| <FONT color="green">1616</FONT> * @param stepIndex The top-level step index withing the iterator.<a name="line.1616"></a> |
| <FONT color="green">1617</FONT> * @param analysis The general analysis of the pattern.<a name="line.1617"></a> |
| <FONT color="green">1618</FONT> *<a name="line.1618"></a> |
| <FONT color="green">1619</FONT> * @return true if the walk can be done in natural order.<a name="line.1619"></a> |
| <FONT color="green">1620</FONT> *<a name="line.1620"></a> |
| <FONT color="green">1621</FONT> * @throws javax.xml.transform.TransformerException<a name="line.1621"></a> |
| <FONT color="green">1622</FONT> */<a name="line.1622"></a> |
| <FONT color="green">1623</FONT> private static boolean isNaturalDocOrder(<a name="line.1623"></a> |
| <FONT color="green">1624</FONT> Compiler compiler, int stepOpCodePos, int stepIndex, int analysis)<a name="line.1624"></a> |
| <FONT color="green">1625</FONT> throws javax.xml.transform.TransformerException<a name="line.1625"></a> |
| <FONT color="green">1626</FONT> {<a name="line.1626"></a> |
| <FONT color="green">1627</FONT> if(canCrissCross(analysis))<a name="line.1627"></a> |
| <FONT color="green">1628</FONT> return false;<a name="line.1628"></a> |
| <FONT color="green">1629</FONT> <a name="line.1629"></a> |
| <FONT color="green">1630</FONT> // Namespaces can present some problems, so just punt if we're looking for <a name="line.1630"></a> |
| <FONT color="green">1631</FONT> // these.<a name="line.1631"></a> |
| <FONT color="green">1632</FONT> if(isSet(analysis, BIT_NAMESPACE))<a name="line.1632"></a> |
| <FONT color="green">1633</FONT> return false;<a name="line.1633"></a> |
| <FONT color="green">1634</FONT> <a name="line.1634"></a> |
| <FONT color="green">1635</FONT> // The following, preceding, following-sibling, and preceding sibling can <a name="line.1635"></a> |
| <FONT color="green">1636</FONT> // be found in doc order if we get to this point, but if they occur <a name="line.1636"></a> |
| <FONT color="green">1637</FONT> // together, they produce <a name="line.1637"></a> |
| <FONT color="green">1638</FONT> // duplicates, so it's better for us to eliminate this case so we don't <a name="line.1638"></a> |
| <FONT color="green">1639</FONT> // have to check for duplicates during runtime if we're using a <a name="line.1639"></a> |
| <FONT color="green">1640</FONT> // WalkingIterator.<a name="line.1640"></a> |
| <FONT color="green">1641</FONT> if(isSet(analysis, BIT_FOLLOWING | BIT_FOLLOWING_SIBLING) && <a name="line.1641"></a> |
| <FONT color="green">1642</FONT> isSet(analysis, BIT_PRECEDING | BIT_PRECEDING_SIBLING))<a name="line.1642"></a> |
| <FONT color="green">1643</FONT> return false;<a name="line.1643"></a> |
| <FONT color="green">1644</FONT> <a name="line.1644"></a> |
| <FONT color="green">1645</FONT> // OK, now we have to check for select="@*/axis::*" patterns, which <a name="line.1645"></a> |
| <FONT color="green">1646</FONT> // can also cause duplicates to happen. But select="axis*/@::*" patterns <a name="line.1646"></a> |
| <FONT color="green">1647</FONT> // are OK, as are select="@foo/axis::*" patterns.<a name="line.1647"></a> |
| <FONT color="green">1648</FONT> // Unfortunately, we can't do this just via the analysis bits.<a name="line.1648"></a> |
| <FONT color="green">1649</FONT> <a name="line.1649"></a> |
| <FONT color="green">1650</FONT> int stepType;<a name="line.1650"></a> |
| <FONT color="green">1651</FONT> int stepCount = 0;<a name="line.1651"></a> |
| <FONT color="green">1652</FONT> boolean foundWildAttribute = false;<a name="line.1652"></a> |
| <FONT color="green">1653</FONT> <a name="line.1653"></a> |
| <FONT color="green">1654</FONT> // Steps that can traverse anything other than down a <a name="line.1654"></a> |
| <FONT color="green">1655</FONT> // subtree or that can produce duplicates when used in <a name="line.1655"></a> |
| <FONT color="green">1656</FONT> // combonation are counted with this variable.<a name="line.1656"></a> |
| <FONT color="green">1657</FONT> int potentialDuplicateMakingStepCount = 0;<a name="line.1657"></a> |
| <FONT color="green">1658</FONT> <a name="line.1658"></a> |
| <FONT color="green">1659</FONT> while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos)))<a name="line.1659"></a> |
| <FONT color="green">1660</FONT> { <a name="line.1660"></a> |
| <FONT color="green">1661</FONT> stepCount++;<a name="line.1661"></a> |
| <FONT color="green">1662</FONT> <a name="line.1662"></a> |
| <FONT color="green">1663</FONT> switch (stepType)<a name="line.1663"></a> |
| <FONT color="green">1664</FONT> {<a name="line.1664"></a> |
| <FONT color="green">1665</FONT> case OpCodes.FROM_ATTRIBUTES :<a name="line.1665"></a> |
| <FONT color="green">1666</FONT> case OpCodes.MATCH_ATTRIBUTE :<a name="line.1666"></a> |
| <FONT color="green">1667</FONT> if(foundWildAttribute) // Maybe not needed, but be safe.<a name="line.1667"></a> |
| <FONT color="green">1668</FONT> return false;<a name="line.1668"></a> |
| <FONT color="green">1669</FONT> <a name="line.1669"></a> |
| <FONT color="green">1670</FONT> // This doesn't seem to work as a test for wild card. Hmph.<a name="line.1670"></a> |
| <FONT color="green">1671</FONT> // int nodeTestType = compiler.getStepTestType(stepOpCodePos); <a name="line.1671"></a> |
| <FONT color="green">1672</FONT> <a name="line.1672"></a> |
| <FONT color="green">1673</FONT> String localName = compiler.getStepLocalName(stepOpCodePos);<a name="line.1673"></a> |
| <FONT color="green">1674</FONT> // System.err.println("localName: "+localName);<a name="line.1674"></a> |
| <FONT color="green">1675</FONT> if(localName.equals("*"))<a name="line.1675"></a> |
| <FONT color="green">1676</FONT> {<a name="line.1676"></a> |
| <FONT color="green">1677</FONT> foundWildAttribute = true;<a name="line.1677"></a> |
| <FONT color="green">1678</FONT> }<a name="line.1678"></a> |
| <FONT color="green">1679</FONT> break;<a name="line.1679"></a> |
| <FONT color="green">1680</FONT> case OpCodes.FROM_FOLLOWING :<a name="line.1680"></a> |
| <FONT color="green">1681</FONT> case OpCodes.FROM_FOLLOWING_SIBLINGS :<a name="line.1681"></a> |
| <FONT color="green">1682</FONT> case OpCodes.FROM_PRECEDING :<a name="line.1682"></a> |
| <FONT color="green">1683</FONT> case OpCodes.FROM_PRECEDING_SIBLINGS :<a name="line.1683"></a> |
| <FONT color="green">1684</FONT> case OpCodes.FROM_PARENT :<a name="line.1684"></a> |
| <FONT color="green">1685</FONT> case OpCodes.OP_VARIABLE :<a name="line.1685"></a> |
| <FONT color="green">1686</FONT> case OpCodes.OP_EXTFUNCTION :<a name="line.1686"></a> |
| <FONT color="green">1687</FONT> case OpCodes.OP_FUNCTION :<a name="line.1687"></a> |
| <FONT color="green">1688</FONT> case OpCodes.OP_GROUP :<a name="line.1688"></a> |
| <FONT color="green">1689</FONT> case OpCodes.FROM_NAMESPACE :<a name="line.1689"></a> |
| <FONT color="green">1690</FONT> case OpCodes.FROM_ANCESTORS :<a name="line.1690"></a> |
| <FONT color="green">1691</FONT> case OpCodes.FROM_ANCESTORS_OR_SELF : <a name="line.1691"></a> |
| <FONT color="green">1692</FONT> case OpCodes.MATCH_ANY_ANCESTOR :<a name="line.1692"></a> |
| <FONT color="green">1693</FONT> case OpCodes.MATCH_IMMEDIATE_ANCESTOR :<a name="line.1693"></a> |
| <FONT color="green">1694</FONT> case OpCodes.FROM_DESCENDANTS_OR_SELF :<a name="line.1694"></a> |
| <FONT color="green">1695</FONT> case OpCodes.FROM_DESCENDANTS :<a name="line.1695"></a> |
| <FONT color="green">1696</FONT> if(potentialDuplicateMakingStepCount > 0)<a name="line.1696"></a> |
| <FONT color="green">1697</FONT> return false;<a name="line.1697"></a> |
| <FONT color="green">1698</FONT> potentialDuplicateMakingStepCount++;<a name="line.1698"></a> |
| <FONT color="green">1699</FONT> case OpCodes.FROM_ROOT :<a name="line.1699"></a> |
| <FONT color="green">1700</FONT> case OpCodes.FROM_CHILDREN :<a name="line.1700"></a> |
| <FONT color="green">1701</FONT> case OpCodes.FROM_SELF :<a name="line.1701"></a> |
| <FONT color="green">1702</FONT> if(foundWildAttribute)<a name="line.1702"></a> |
| <FONT color="green">1703</FONT> return false;<a name="line.1703"></a> |
| <FONT color="green">1704</FONT> break;<a name="line.1704"></a> |
| <FONT color="green">1705</FONT> default :<a name="line.1705"></a> |
| <FONT color="green">1706</FONT> throw new RuntimeException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_NULL_ERROR_HANDLER, new Object[]{Integer.toString(stepType)})); //"Programmer's assertion: unknown opcode: "<a name="line.1706"></a> |
| <FONT color="green">1707</FONT> // + stepType);<a name="line.1707"></a> |
| <FONT color="green">1708</FONT> }<a name="line.1708"></a> |
| <FONT color="green">1709</FONT> <a name="line.1709"></a> |
| <FONT color="green">1710</FONT> int nextStepOpCodePos = compiler.getNextStepPos(stepOpCodePos);<a name="line.1710"></a> |
| <FONT color="green">1711</FONT> <a name="line.1711"></a> |
| <FONT color="green">1712</FONT> if (nextStepOpCodePos < 0)<a name="line.1712"></a> |
| <FONT color="green">1713</FONT> break;<a name="line.1713"></a> |
| <FONT color="green">1714</FONT> <a name="line.1714"></a> |
| <FONT color="green">1715</FONT> stepOpCodePos = nextStepOpCodePos;<a name="line.1715"></a> |
| <FONT color="green">1716</FONT> }<a name="line.1716"></a> |
| <FONT color="green">1717</FONT> <a name="line.1717"></a> |
| <FONT color="green">1718</FONT> return true;<a name="line.1718"></a> |
| <FONT color="green">1719</FONT> }<a name="line.1719"></a> |
| <FONT color="green">1720</FONT> <a name="line.1720"></a> |
| <FONT color="green">1721</FONT> public static boolean isOneStep(int analysis)<a name="line.1721"></a> |
| <FONT color="green">1722</FONT> {<a name="line.1722"></a> |
| <FONT color="green">1723</FONT> return (analysis & BITS_COUNT) == 0x00000001;<a name="line.1723"></a> |
| <FONT color="green">1724</FONT> }<a name="line.1724"></a> |
| <FONT color="green">1725</FONT> <a name="line.1725"></a> |
| <FONT color="green">1726</FONT> public static int getStepCount(int analysis)<a name="line.1726"></a> |
| <FONT color="green">1727</FONT> {<a name="line.1727"></a> |
| <FONT color="green">1728</FONT> return (analysis & BITS_COUNT);<a name="line.1728"></a> |
| <FONT color="green">1729</FONT> }<a name="line.1729"></a> |
| <FONT color="green">1730</FONT> <a name="line.1730"></a> |
| <FONT color="green">1731</FONT> /**<a name="line.1731"></a> |
| <FONT color="green">1732</FONT> * First 8 bits are the number of top-level location steps. Hopefully<a name="line.1732"></a> |
| <FONT color="green">1733</FONT> * there will never be more that 255 location steps!!!<a name="line.1733"></a> |
| <FONT color="green">1734</FONT> */<a name="line.1734"></a> |
| <FONT color="green">1735</FONT> public static final int BITS_COUNT = 0x000000FF;<a name="line.1735"></a> |
| <FONT color="green">1736</FONT> <a name="line.1736"></a> |
| <FONT color="green">1737</FONT> /** 4 bits are reserved for future use. */<a name="line.1737"></a> |
| <FONT color="green">1738</FONT> public static final int BITS_RESERVED = 0x00000F00;<a name="line.1738"></a> |
| <FONT color="green">1739</FONT> <a name="line.1739"></a> |
| <FONT color="green">1740</FONT> /** Bit is on if the expression contains a top-level predicate. */<a name="line.1740"></a> |
| <FONT color="green">1741</FONT> public static final int BIT_PREDICATE = (0x00001000);<a name="line.1741"></a> |
| <FONT color="green">1742</FONT> <a name="line.1742"></a> |
| <FONT color="green">1743</FONT> /** Bit is on if any of the walkers contain an ancestor step. */<a name="line.1743"></a> |
| <FONT color="green">1744</FONT> public static final int BIT_ANCESTOR = (0x00001000 << 1);<a name="line.1744"></a> |
| <FONT color="green">1745</FONT> <a name="line.1745"></a> |
| <FONT color="green">1746</FONT> /** Bit is on if any of the walkers contain an ancestor-or-self step. */<a name="line.1746"></a> |
| <FONT color="green">1747</FONT> public static final int BIT_ANCESTOR_OR_SELF = (0x00001000 << 2);<a name="line.1747"></a> |
| <FONT color="green">1748</FONT> <a name="line.1748"></a> |
| <FONT color="green">1749</FONT> /** Bit is on if any of the walkers contain an attribute step. */<a name="line.1749"></a> |
| <FONT color="green">1750</FONT> public static final int BIT_ATTRIBUTE = (0x00001000 << 3);<a name="line.1750"></a> |
| <FONT color="green">1751</FONT> <a name="line.1751"></a> |
| <FONT color="green">1752</FONT> /** Bit is on if any of the walkers contain a child step. */<a name="line.1752"></a> |
| <FONT color="green">1753</FONT> public static final int BIT_CHILD = (0x00001000 << 4);<a name="line.1753"></a> |
| <FONT color="green">1754</FONT> <a name="line.1754"></a> |
| <FONT color="green">1755</FONT> /** Bit is on if any of the walkers contain a descendant step. */<a name="line.1755"></a> |
| <FONT color="green">1756</FONT> public static final int BIT_DESCENDANT = (0x00001000 << 5);<a name="line.1756"></a> |
| <FONT color="green">1757</FONT> <a name="line.1757"></a> |
| <FONT color="green">1758</FONT> /** Bit is on if any of the walkers contain a descendant-or-self step. */<a name="line.1758"></a> |
| <FONT color="green">1759</FONT> public static final int BIT_DESCENDANT_OR_SELF = (0x00001000 << 6);<a name="line.1759"></a> |
| <FONT color="green">1760</FONT> <a name="line.1760"></a> |
| <FONT color="green">1761</FONT> /** Bit is on if any of the walkers contain a following step. */<a name="line.1761"></a> |
| <FONT color="green">1762</FONT> public static final int BIT_FOLLOWING = (0x00001000 << 7);<a name="line.1762"></a> |
| <FONT color="green">1763</FONT> <a name="line.1763"></a> |
| <FONT color="green">1764</FONT> /** Bit is on if any of the walkers contain a following-sibiling step. */<a name="line.1764"></a> |
| <FONT color="green">1765</FONT> public static final int BIT_FOLLOWING_SIBLING = (0x00001000 << 8);<a name="line.1765"></a> |
| <FONT color="green">1766</FONT> <a name="line.1766"></a> |
| <FONT color="green">1767</FONT> /** Bit is on if any of the walkers contain a namespace step. */<a name="line.1767"></a> |
| <FONT color="green">1768</FONT> public static final int BIT_NAMESPACE = (0x00001000 << 9);<a name="line.1768"></a> |
| <FONT color="green">1769</FONT> <a name="line.1769"></a> |
| <FONT color="green">1770</FONT> /** Bit is on if any of the walkers contain a parent step. */<a name="line.1770"></a> |
| <FONT color="green">1771</FONT> public static final int BIT_PARENT = (0x00001000 << 10);<a name="line.1771"></a> |
| <FONT color="green">1772</FONT> <a name="line.1772"></a> |
| <FONT color="green">1773</FONT> /** Bit is on if any of the walkers contain a preceding step. */<a name="line.1773"></a> |
| <FONT color="green">1774</FONT> public static final int BIT_PRECEDING = (0x00001000 << 11);<a name="line.1774"></a> |
| <FONT color="green">1775</FONT> <a name="line.1775"></a> |
| <FONT color="green">1776</FONT> /** Bit is on if any of the walkers contain a preceding-sibling step. */<a name="line.1776"></a> |
| <FONT color="green">1777</FONT> public static final int BIT_PRECEDING_SIBLING = (0x00001000 << 12);<a name="line.1777"></a> |
| <FONT color="green">1778</FONT> <a name="line.1778"></a> |
| <FONT color="green">1779</FONT> /** Bit is on if any of the walkers contain a self step. */<a name="line.1779"></a> |
| <FONT color="green">1780</FONT> public static final int BIT_SELF = (0x00001000 << 13);<a name="line.1780"></a> |
| <FONT color="green">1781</FONT> <a name="line.1781"></a> |
| <FONT color="green">1782</FONT> /**<a name="line.1782"></a> |
| <FONT color="green">1783</FONT> * Bit is on if any of the walkers contain a filter (i.e. id(), extension<a name="line.1783"></a> |
| <FONT color="green">1784</FONT> * function, etc.) step.<a name="line.1784"></a> |
| <FONT color="green">1785</FONT> */<a name="line.1785"></a> |
| <FONT color="green">1786</FONT> public static final int BIT_FILTER = (0x00001000 << 14);<a name="line.1786"></a> |
| <FONT color="green">1787</FONT> <a name="line.1787"></a> |
| <FONT color="green">1788</FONT> /** Bit is on if any of the walkers contain a root step. */<a name="line.1788"></a> |
| <FONT color="green">1789</FONT> public static final int BIT_ROOT = (0x00001000 << 15);<a name="line.1789"></a> |
| <FONT color="green">1790</FONT> <a name="line.1790"></a> |
| <FONT color="green">1791</FONT> /**<a name="line.1791"></a> |
| <FONT color="green">1792</FONT> * If any of these bits are on, the expression may likely traverse outside<a name="line.1792"></a> |
| <FONT color="green">1793</FONT> * the given subtree.<a name="line.1793"></a> |
| <FONT color="green">1794</FONT> */<a name="line.1794"></a> |
| <FONT color="green">1795</FONT> public static final int BITMASK_TRAVERSES_OUTSIDE_SUBTREE = (BIT_NAMESPACE // ??<a name="line.1795"></a> |
| <FONT color="green">1796</FONT> | BIT_PRECEDING_SIBLING<a name="line.1796"></a> |
| <FONT color="green">1797</FONT> | BIT_PRECEDING<a name="line.1797"></a> |
| <FONT color="green">1798</FONT> | BIT_FOLLOWING_SIBLING<a name="line.1798"></a> |
| <FONT color="green">1799</FONT> | BIT_FOLLOWING<a name="line.1799"></a> |
| <FONT color="green">1800</FONT> | BIT_PARENT // except parent of attrs.<a name="line.1800"></a> |
| <FONT color="green">1801</FONT> | BIT_ANCESTOR_OR_SELF<a name="line.1801"></a> |
| <FONT color="green">1802</FONT> | BIT_ANCESTOR<a name="line.1802"></a> |
| <FONT color="green">1803</FONT> | BIT_FILTER<a name="line.1803"></a> |
| <FONT color="green">1804</FONT> | BIT_ROOT);<a name="line.1804"></a> |
| <FONT color="green">1805</FONT> <a name="line.1805"></a> |
| <FONT color="green">1806</FONT> /**<a name="line.1806"></a> |
| <FONT color="green">1807</FONT> * Bit is on if any of the walkers can go backwards in document<a name="line.1807"></a> |
| <FONT color="green">1808</FONT> * order from the context node.<a name="line.1808"></a> |
| <FONT color="green">1809</FONT> */<a name="line.1809"></a> |
| <FONT color="green">1810</FONT> public static final int BIT_BACKWARDS_SELF = (0x00001000 << 16);<a name="line.1810"></a> |
| <FONT color="green">1811</FONT> <a name="line.1811"></a> |
| <FONT color="green">1812</FONT> /** Found "//foo" pattern */<a name="line.1812"></a> |
| <FONT color="green">1813</FONT> public static final int BIT_ANY_DESCENDANT_FROM_ROOT = (0x00001000 << 17);<a name="line.1813"></a> |
| <FONT color="green">1814</FONT> <a name="line.1814"></a> |
| <FONT color="green">1815</FONT> /**<a name="line.1815"></a> |
| <FONT color="green">1816</FONT> * Bit is on if any of the walkers contain an node() test. This is<a name="line.1816"></a> |
| <FONT color="green">1817</FONT> * really only useful if the count is 1.<a name="line.1817"></a> |
| <FONT color="green">1818</FONT> */<a name="line.1818"></a> |
| <FONT color="green">1819</FONT> public static final int BIT_NODETEST_ANY = (0x00001000 << 18);<a name="line.1819"></a> |
| <FONT color="green">1820</FONT> <a name="line.1820"></a> |
| <FONT color="green">1821</FONT> // can't go higher than 18!<a name="line.1821"></a> |
| <FONT color="green">1822</FONT> <a name="line.1822"></a> |
| <FONT color="green">1823</FONT> /** Bit is on if the expression is a match pattern. */<a name="line.1823"></a> |
| <FONT color="green">1824</FONT> public static final int BIT_MATCH_PATTERN = (0x00001000 << 19);<a name="line.1824"></a> |
| <FONT color="green">1825</FONT> }<a name="line.1825"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </PRE> |
| </BODY> |
| </HTML> |
