933public void CallArithmeticOp(QilNodeType opType, XmlTypeCode code) { 942case QilNodeType.Add: Emit(OpCodes.Add); break; 943case QilNodeType.Subtract: Emit(OpCodes.Sub); break; 944case QilNodeType.Multiply: Emit(OpCodes.Mul); break; 945case QilNodeType.Divide: Emit(OpCodes.Div); break; 946case QilNodeType.Modulo: Emit(OpCodes.Rem); break; 947case QilNodeType.Negate: Emit(OpCodes.Neg); break; 954case QilNodeType.Add: meth = XmlILMethods.DecAdd; break; 955case QilNodeType.Subtract: meth = XmlILMethods.DecSub; break; 956case QilNodeType.Multiply: meth = XmlILMethods.DecMul; break; 957case QilNodeType.Divide: meth = XmlILMethods.DecDiv; break; 958case QilNodeType.Modulo: meth = XmlILMethods.DecRem; break; 959case QilNodeType.Negate: meth = XmlILMethods.DecNeg; break;

40case QilNodeType.Invoke: 48case QilNodeType.Loop: { 51if (ndLoop.Variable.NodeType == QilNodeType.Let || !ndLoop.Variable.Binding.XmlType.MaybeMany) 56case QilNodeType.Sequence: { 64case QilNodeType.Choice: { 72case QilNodeType.Conditional: { 80case QilNodeType.Nop:

53private QilNodeType nodeType; 72constrInfo = new XmlILConstructInfo(QilNodeType.Unknown); 103private XmlILConstructInfo(QilNodeType nodeType) { 252if (this.parentInfo != null && this.parentInfo.nodeType == QilNodeType.ElementCtor) 408if (ndConstr.NodeType == QilNodeType.Function) { 429if (ndConstr.NodeType != QilNodeType.Choice) 433if (ndConstr.NodeType != QilNodeType.RtfCtor) 438this.withinElem = (ndConstr.NodeType == QilNodeType.ElementCtor); 441case QilNodeType.DocumentCtor: this.xstates = PossibleXmlStates.WithinContent; break; 442case QilNodeType.ElementCtor: this.xstates = PossibleXmlStates.EnumAttrs; break; 443case QilNodeType.AttributeCtor: this.xstates = PossibleXmlStates.WithinAttr; break; 444case QilNodeType.NamespaceDecl: Debug.Assert(ndContent == null); break; 445case QilNodeType.TextCtor: Debug.Assert(ndContent == null); break; 446case QilNodeType.RawTextCtor: Debug.Assert(ndContent == null); break; 447case QilNodeType.CommentCtor: this.xstates = PossibleXmlStates.WithinComment; break; 448case QilNodeType.PICtor: this.xstates = PossibleXmlStates.WithinPI; break; 449case QilNodeType.XsltCopy: this.xstates = PossibleXmlStates.Any; break; 450case QilNodeType.XsltCopyOf: Debug.Assert(ndContent == null); break; 451case QilNodeType.Function: this.xstates = this.parentInfo.InitialStates; break; 452case QilNodeType.RtfCtor: this.xstates = PossibleXmlStates.WithinContent; break; 453case QilNodeType.Choice: this.xstates = PossibleXmlStates.Any; break; 460if (ndConstr.NodeType == QilNodeType.Choice) 464if (ndConstr.NodeType == QilNodeType.Function) 480case QilNodeType.For: 481case QilNodeType.Let: 482case QilNodeType.Parameter: 502case QilNodeType.Loop: AnalyzeLoop(nd as QilLoop, info); break; 503case QilNodeType.Sequence: AnalyzeSequence(nd as QilList, info); break; 504case QilNodeType.Conditional: AnalyzeConditional(nd as QilTernary, info); break; 505case QilNodeType.Choice: AnalyzeChoice(nd as QilChoice, info); break; 507case QilNodeType.Error: 508case QilNodeType.Warning: 513case QilNodeType.Nop: 516case QilNodeType.For: 517case QilNodeType.Let: 518case QilNodeType.Parameter: 733Debug.Assert(ndElem.NodeType == QilNodeType.ElementCtor); 766if (ndCopy.NodeType == QilNodeType.AttributeCtor) { 780if (ndAttr.Left.NodeType == QilNodeType.LiteralQName) { 882case QilNodeType.Loop: 887case QilNodeType.Sequence: 892case QilNodeType.Conditional: 898case QilNodeType.Choice: 906case QilNodeType.ElementCtor: 920case QilNodeType.AttributeCtor: 925case QilNodeType.NamespaceDecl: 929case QilNodeType.Nop: 950case QilNodeType.ElementCtor: 951case QilNodeType.AttributeCtor: 956nodeType = (nd.NodeType == QilNodeType.ElementCtor) ? XPathNodeType.Element : XPathNodeType.Attribute; 964Debug.Assert(nd.NodeType == QilNodeType.NamespaceDecl); 972if (nd.NodeType == QilNodeType.AttributeCtor && ns.Length == 0 || 997Debug.Assert(nd.NodeType != QilNodeType.NamespaceDecl || !this.nsmgr.HasNamespace(prefix) || this.nsmgr.LookupNamespace(prefix) == ns,

91case QilNodeType.QilExpression: 96case QilNodeType.ElementCtor: 101case QilNodeType.DocumentCtor: 124if (newNode.NodeType == QilNodeType.Let || newNode.NodeType == QilNodeType.For) { 161case QilNodeType.Error: 162case QilNodeType.Warning: 163case QilNodeType.XsltInvokeLateBound: 168case QilNodeType.XsltInvokeEarlyBound: 171goto case QilNodeType.XsltInvokeLateBound; 174case QilNodeType.Invoke: 177goto case QilNodeType.XsltInvokeLateBound; 187goto case QilNodeType.XsltInvokeLateBound; 201if (node.NodeType != QilNodeType.Let || !this.qil.GlobalVariableList.Contains(node)) 322local0.NodeType = QilNodeType.For; 337if (!( (local1).NodeType == QilNodeType.For )) { 345if (local1.NodeType == QilNodeType.For) { 389if (local1.NodeType == QilNodeType.True) { 397if (local1.NodeType == QilNodeType.False) { 405if (local2.NodeType == QilNodeType.True) { 413if (local2.NodeType == QilNodeType.False) { 443if (local1.NodeType == QilNodeType.True) { 451if (local1.NodeType == QilNodeType.False) { 459if (local2.NodeType == QilNodeType.True) { 467if (local2.NodeType == QilNodeType.False) { 488if (local1.NodeType == QilNodeType.True) { 496if (local1.NodeType == QilNodeType.False) { 522if (local1.NodeType == QilNodeType.True) { 530if (local1.NodeType == QilNodeType.False) { 538if (local2.NodeType == QilNodeType.True) { 539if (local3.NodeType == QilNodeType.False) { 548if (local2.NodeType == QilNodeType.False) { 549if (local3.NodeType == QilNodeType.True) { 558if (local1.NodeType == QilNodeType.Not) { 567if (local2.NodeType == QilNodeType.TextCtor) { 569if (local3.NodeType == QilNodeType.TextCtor) { 607if (local1.NodeType == QilNodeType.Sequence) { 625if ((!( IsDocOrderDistinct(local1) )) && (( IsStepPattern(local1, QilNodeType.XPathPreceding) ) || ( IsStepPattern(local1, QilNodeType.PrecedingSibling) ))) { 647if (nd.NodeType == QilNodeType.Sequence) 689if (local1.NodeType == QilNodeType.Sequence) { 699if (local2.NodeType == QilNodeType.Sequence) { 709if (local1.NodeType == QilNodeType.XmlContext) { 710if (local2.NodeType == QilNodeType.XmlContext) { 732if (( IsStepPattern(local1, QilNodeType.Content) ) || ( IsStepPattern(local1, QilNodeType.Union) )) { 733if ((( IsStepPattern(local2, QilNodeType.Content) ) || ( IsStepPattern(local2, QilNodeType.Union) )) && ( ( OptimizerPatterns.Read((QilNode) (local1)).GetArgument(OptimizerPatternArgument.StepInput) ) == ( OptimizerPatterns.Read((QilNode) (local2)).GetArgument(OptimizerPatternArgument.StepInput) ) )) { 771if (local1.NodeType == QilNodeType.Sequence) { 781if (local2.NodeType == QilNodeType.Sequence) { 791if (local1.NodeType == QilNodeType.XmlContext) { 792if (local2.NodeType == QilNodeType.XmlContext) { 836if (local1.NodeType == QilNodeType.Sequence) { 846if (local2.NodeType == QilNodeType.Sequence) { 864if (local1.NodeType == QilNodeType.XmlContext) { 865if (local2.NodeType == QilNodeType.XmlContext) { 987if (local1.NodeType == QilNodeType.LiteralDecimal) { 996if (local1.NodeType == QilNodeType.LiteralDouble) { 1005if (local1.NodeType == QilNodeType.LiteralInt32) { 1014if (local1.NodeType == QilNodeType.LiteralInt64) { 1046if (( IsLiteral((local2)) ) && ( CanFoldArithmetic(QilNodeType.Add, (QilLiteral) local1, (QilLiteral) local2) )) { 1049return Replace(XmlILOptimization.EliminateAdd, local0, FoldArithmetic(QilNodeType.Add, (QilLiteral) local1, (QilLiteral) local2) ); 1088if (( IsLiteral((local2)) ) && ( CanFoldArithmetic(QilNodeType.Subtract, (QilLiteral) local1, (QilLiteral) local2) )) { 1091return Replace(XmlILOptimization.EliminateSubtract, local0, FoldArithmetic(QilNodeType.Subtract, (QilLiteral) local1, (QilLiteral) local2) ); 1120if (( IsLiteral((local2)) ) && ( CanFoldArithmetic(QilNodeType.Multiply, (QilLiteral) local1, (QilLiteral) local2) )) { 1123return Replace(XmlILOptimization.EliminateMultiply, local0, FoldArithmetic(QilNodeType.Multiply, (QilLiteral) local1, (QilLiteral) local2) ); 1162if (( IsLiteral((local2)) ) && ( CanFoldArithmetic(QilNodeType.Divide, (QilLiteral) local1, (QilLiteral) local2) )) { 1165return Replace(XmlILOptimization.EliminateDivide, local0, FoldArithmetic(QilNodeType.Divide, (QilLiteral) local1, (QilLiteral) local2) ); 1194if (( IsLiteral((local2)) ) && ( CanFoldArithmetic(QilNodeType.Modulo, (QilLiteral) local1, (QilLiteral) local2) )) { 1197return Replace(XmlILOptimization.EliminateModulo, local0, FoldArithmetic(QilNodeType.Modulo, (QilLiteral) local1, (QilLiteral) local2) ); 1219if (local1.NodeType == QilNodeType.LiteralString) { 1256if (local1.NodeType == QilNodeType.LiteralString) { 1258if (local2.NodeType == QilNodeType.Sequence) { 1326return Replace(XmlILOptimization.EliminateNe, local0, FoldComparison(QilNodeType.Ne, local1, local2) ); 1342if (local1.NodeType == QilNodeType.XsltConvert) { 1345if (local4.NodeType == QilNodeType.LiteralType) { 1359if (local1.NodeType == QilNodeType.XsltGenerateId) { 1362if (local2.NodeType == QilNodeType.XsltGenerateId) { 1375if (local1.NodeType == QilNodeType.Length) { 1377if (local2.NodeType == QilNodeType.LiteralInt32) { 1389if (local1.NodeType == QilNodeType.Length) { 1390if (local2.NodeType == QilNodeType.LiteralInt32) { 1425return Replace(XmlILOptimization.EliminateEq, local0, FoldComparison(QilNodeType.Eq, local1, local2) ); 1441if (local1.NodeType == QilNodeType.XsltConvert) { 1444if (local4.NodeType == QilNodeType.LiteralType) { 1458if (local1.NodeType == QilNodeType.Add) { 1462if (( IsLiteral((local2)) ) && ( CanFoldArithmetic(QilNodeType.Subtract, (QilLiteral) local2, (QilLiteral) local4) )) { 1465return Replace(XmlILOptimization.NormalizeAddEq, local0, VisitEq(f.Eq(local3, FoldArithmetic(QilNodeType.Subtract, (QilLiteral) local2, (QilLiteral) local4) ))); 1472if (local1.NodeType == QilNodeType.XsltGenerateId) { 1475if (local2.NodeType == QilNodeType.XsltGenerateId) { 1488if (local1.NodeType == QilNodeType.XsltGenerateId) { 1491if (local2.NodeType == QilNodeType.StrConcat) { 1493if (local5.NodeType == QilNodeType.Loop) { 1496if (local6.NodeType == QilNodeType.For) { 1499if (local8.NodeType == QilNodeType.XsltGenerateId) { 1517if (local1.NodeType == QilNodeType.StrConcat) { 1519if (local4.NodeType == QilNodeType.Loop) { 1522if (local5.NodeType == QilNodeType.For) { 1525if (local7.NodeType == QilNodeType.XsltGenerateId) { 1528if (local2.NodeType == QilNodeType.XsltGenerateId) { 1546if (local1.NodeType == QilNodeType.Length) { 1548if (local3.NodeType == QilNodeType.Union) { 1552if (local2.NodeType == QilNodeType.LiteralInt32) { 1567if (local1.NodeType == QilNodeType.Length) { 1569if (local3.NodeType == QilNodeType.Union) { 1573if (local2.NodeType == QilNodeType.LiteralInt32) { 1588if (local1.NodeType == QilNodeType.Length) { 1589if (local2.NodeType == QilNodeType.LiteralInt32) { 1624return Replace(XmlILOptimization.EliminateGt, local0, FoldComparison(QilNodeType.Gt, local1, local2) ); 1640if (local1.NodeType == QilNodeType.XsltConvert) { 1643if (local4.NodeType == QilNodeType.LiteralType) { 1657if (local1.NodeType == QilNodeType.Length) { 1659if (local2.NodeType == QilNodeType.LiteralInt32) { 1671if (local1.NodeType == QilNodeType.Length) { 1672if (local2.NodeType == QilNodeType.LiteralInt32) { 1707return Replace(XmlILOptimization.EliminateGe, local0, FoldComparison(QilNodeType.Ge, local1, local2) ); 1723if (local1.NodeType == QilNodeType.XsltConvert) { 1726if (local4.NodeType == QilNodeType.LiteralType) { 1740if (local1.NodeType == QilNodeType.Length) { 1741if (local2.NodeType == QilNodeType.LiteralInt32) { 1776return Replace(XmlILOptimization.EliminateLt, local0, FoldComparison(QilNodeType.Lt, local1, local2) ); 1792if (local1.NodeType == QilNodeType.XsltConvert) { 1795if (local4.NodeType == QilNodeType.LiteralType) { 1809if (local1.NodeType == QilNodeType.Length) { 1810if (local2.NodeType == QilNodeType.LiteralInt32) { 1845return Replace(XmlILOptimization.EliminateLe, local0, FoldComparison(QilNodeType.Le, local1, local2) ); 1861if (local1.NodeType == QilNodeType.XsltConvert) { 1864if (local4.NodeType == QilNodeType.LiteralType) { 1878if (local1.NodeType == QilNodeType.Length) { 1879if (local2.NodeType == QilNodeType.LiteralInt32) { 1998if (local1.NodeType == QilNodeType.For) { 2000if (local3.NodeType == QilNodeType.For) { 2011if (local1.NodeType == QilNodeType.For) { 2013if (local3.NodeType == QilNodeType.Sequence) { 2025if (local2.NodeType == QilNodeType.Sequence) { 2044if (local1.NodeType == QilNodeType.For) { 2047if (local2.NodeType == QilNodeType.TextCtor) { 2058if ((( (local1).NodeType == QilNodeType.Let ) || ( ( ( (QilNode) (local1)[0] ).XmlType ).IsSingleton )) && ( !OptimizerPatterns.Read(local1).MatchesPattern(OptimizerPatternName.MaybeSideEffects) )) { 2068if (local2.NodeType == QilNodeType.Conditional) { 2072if (local4.NodeType == QilNodeType.Sequence) { 2085if (local2.NodeType == QilNodeType.Conditional) { 2090if (local5.NodeType == QilNodeType.Sequence) { 2102if (local1.NodeType == QilNodeType.For) { 2103if (local2.NodeType == QilNodeType.Conditional) { 2107if (local5.NodeType == QilNodeType.Sequence) { 2122if (local1.NodeType == QilNodeType.For) { 2123if (local2.NodeType == QilNodeType.Conditional) { 2128if (local6.NodeType == QilNodeType.Sequence) { 2142if (local2.NodeType == QilNodeType.Loop) { 2145if (local3.NodeType == QilNodeType.For) { 2158if (local1.NodeType == QilNodeType.For) { 2168if ( IsStepPattern(local2, QilNodeType.Root) ) { 2175if (local1.NodeType == QilNodeType.For) { 2178if ((( IsStepPattern(local2, QilNodeType.Content) ) || ( IsStepPattern(local2, QilNodeType.Union) )) && ( (local1) == ( OptimizerPatterns.Read((QilNode) (local2)).GetArgument(OptimizerPatternArgument.StepInput) ) )) { 2187if (local1.NodeType == QilNodeType.For) { 2189if (((( IsStepPattern(local2, QilNodeType.Attribute) ) || ( IsStepPattern(local2, QilNodeType.XPathNamespace) )) || ( OptimizerPatterns.Read((QilNode) (local2)).MatchesPattern(OptimizerPatternName.FilterAttributeKind) )) && ( (local1) == ( OptimizerPatterns.Read((QilNode) (local2)).GetArgument(OptimizerPatternArgument.StepInput) ) )) { 2197if (local1.NodeType == QilNodeType.For) { 2200if ((( IsStepPattern(local2, QilNodeType.Descendant) ) || ( IsStepPattern(local2, QilNodeType.DescendantOrSelf) )) && ( (local1) == ( OptimizerPatterns.Read((QilNode) (local2)).GetArgument(OptimizerPatternArgument.StepInput) ) )) { 2232if (local2.NodeType == QilNodeType.False) { 2241if (local2.NodeType == QilNodeType.True) { 2249if (local1.NodeType == QilNodeType.For) { 2251if (local3.NodeType == QilNodeType.Content) { 2253if (local2.NodeType == QilNodeType.And) { 2256if (local5.NodeType == QilNodeType.IsType) { 2260if (local7.NodeType == QilNodeType.LiteralType) { 2263if (local9.NodeType == QilNodeType.Eq) { 2266if (local10.NodeType == QilNodeType.NameOf) { 2269if (local12.NodeType == QilNodeType.LiteralQName) { 2287if (local1.NodeType == QilNodeType.For) { 2289if (local3.NodeType == QilNodeType.Loop) { 2303if (( !OptimizerPatterns.Read(local1).MatchesPattern(OptimizerPatternName.MaybeSideEffects) ) && (!( ( (QilNode) (local1)[0] ).NodeType == QilNodeType.OptimizeBarrier ))) { 2313if (local2.NodeType == QilNodeType.Eq) { 2316if (local3.NodeType == QilNodeType.PositionOf) { 2319if (local5.NodeType == QilNodeType.LiteralInt32) { 2330if (local2.NodeType == QilNodeType.Le) { 2333if (local3.NodeType == QilNodeType.PositionOf) { 2336if (local5.NodeType == QilNodeType.LiteralInt32) { 2347if (local2.NodeType == QilNodeType.Lt) { 2350if (local3.NodeType == QilNodeType.PositionOf) { 2353if (local5.NodeType == QilNodeType.LiteralInt32) { 2364if (local1.NodeType == QilNodeType.For) { 2372if (local1.NodeType == QilNodeType.For) { 2375if (local2.NodeType == QilNodeType.And) { 2378if (local4.NodeType == QilNodeType.IsType) { 2382if (local6.NodeType == QilNodeType.LiteralType) { 2385if (local8.NodeType == QilNodeType.Eq) { 2388if (local9.NodeType == QilNodeType.NameOf) { 2391if (local11.NodeType == QilNodeType.LiteralQName) { 2408if (local1.NodeType == QilNodeType.For) { 2411if (local2.NodeType == QilNodeType.IsType) { 2415if (local5.NodeType == QilNodeType.LiteralType) { 2429if (local1.NodeType == QilNodeType.For) { 2431if (local3.NodeType == QilNodeType.Content) { 2432if (local2.NodeType == QilNodeType.IsType) { 2436if (local6.NodeType == QilNodeType.LiteralType) { 2467if (local1.NodeType == QilNodeType.For) { 2484if (local1.NodeType == QilNodeType.XsltConvert) { 2487if (local4.NodeType == QilNodeType.LiteralType) { 2520if (local1.NodeType == QilNodeType.Loop) { 2523if (local2.NodeType == QilNodeType.For) { 2525if (local3.NodeType == QilNodeType.Loop) { 2528if (local5.NodeType == QilNodeType.DescendantOrSelf) { 2530if (local7.NodeType == QilNodeType.Filter) { 2533if ((( OptimizerPatterns.Read((QilNode) (local7)).MatchesPattern(OptimizerPatternName.FilterElements) ) || ( OptimizerPatterns.Read((QilNode) (local7)).MatchesPattern(OptimizerPatternName.FilterContentKind) )) && ( IsStepPattern(local7, QilNodeType.Content) )) { 2547if (local1.NodeType == QilNodeType.Loop) { 2550if (local2.NodeType == QilNodeType.For) { 2552if (local3.NodeType == QilNodeType.DescendantOrSelf) { 2554if (local5.NodeType == QilNodeType.Filter) { 2557if ((( OptimizerPatterns.Read((QilNode) (local5)).MatchesPattern(OptimizerPatternName.FilterElements) ) || ( OptimizerPatterns.Read((QilNode) (local5)).MatchesPattern(OptimizerPatternName.FilterContentKind) )) && ( IsStepPattern(local5, QilNodeType.Content) )) { 2570if (local1.NodeType == QilNodeType.Filter) { 2573if (local2.NodeType == QilNodeType.For) { 2588if (local1.NodeType == QilNodeType.Loop) { 2591if (local3.NodeType == QilNodeType.Filter) { 2594if (local4.NodeType == QilNodeType.For) { 2612if (local1.NodeType == QilNodeType.Loop) { 2615if (local2.NodeType == QilNodeType.For) { 2632if (local1.NodeType == QilNodeType.Loop) { 2635if ((!( IsDocOrderDistinct(local3) )) && ( IsStepPattern(local3, QilNodeType.PrecedingSibling) )) { 2644if (local1.NodeType == QilNodeType.Loop) { 2647if (local3.NodeType == QilNodeType.DocOrderDistinct) { 2649if (!( IsStepPattern(local4, QilNodeType.PrecedingSibling) )) { 2671if (local1.NodeType == QilNodeType.Loop) { 2674if (local2.NodeType == QilNodeType.For) { 2687if (local1.NodeType == QilNodeType.Loop) { 2689if (local3.NodeType == QilNodeType.Invoke) { 2711if (local2.NodeType == QilNodeType.Filter) { 2714if (local5.NodeType == QilNodeType.For) { 2716if (local7.NodeType == QilNodeType.Not) { 2718if (local8.NodeType == QilNodeType.IsEmpty) { 2720if (local9.NodeType == QilNodeType.Filter) { 2723if (local10.NodeType == QilNodeType.For) { 2725if (local12.NodeType == QilNodeType.Eq) { 2729if (local14.NodeType == QilNodeType.Parameter) { 2767if (local2.NodeType == QilNodeType.Filter) { 2770if (local5.NodeType == QilNodeType.For) { 2772if (local7.NodeType == QilNodeType.Eq) { 2775if (local9.NodeType == QilNodeType.Parameter) { 2806if (local1.NodeType == QilNodeType.Function) { 2808if (local4.NodeType == QilNodeType.Sequence) { 2824if (local1.NodeType == QilNodeType.Function) { 3310if (local1.NodeType == QilNodeType.TextCtor) { 3393if (local2.NodeType == QilNodeType.LiteralType) { 3404if (local2.NodeType == QilNodeType.LiteralType) { 3415if (local2.NodeType == QilNodeType.LiteralType) { 3441if (local2.NodeType == QilNodeType.LiteralType) { 3454if (local2.NodeType == QilNodeType.LiteralType) { 3466if (local2.NodeType == QilNodeType.LiteralType) { 3478if (local2.NodeType == QilNodeType.LiteralType) { 3491if (local2.NodeType == QilNodeType.LiteralType) { 3516if (local1.NodeType == QilNodeType.Sequence) { 3690if (local2.NodeType == QilNodeType.LiteralType) { 3702if (local2.NodeType == QilNodeType.LiteralType) { 3815return this.parent != null && this.parent.NodeType == QilNodeType.PositionOf; 3901if (nd.NodeType == QilNodeType.Let) 3904if (nd.NodeType == QilNodeType.Parameter) 3951case QilNodeType.ElementCtor: 3952case QilNodeType.AttributeCtor: 3953case QilNodeType.CommentCtor: 3954case QilNodeType.PICtor: 3955case QilNodeType.TextCtor: 3956case QilNodeType.RawTextCtor: 3957case QilNodeType.DocumentCtor: 3958case QilNodeType.NamespaceDecl: 3959case QilNodeType.XsltCopy: 3960case QilNodeType.XsltCopyOf: 3961case QilNodeType.Choice: 3964case QilNodeType.Loop: 3968case QilNodeType.Sequence: 3979case QilNodeType.Conditional: 3984case QilNodeType.Invoke: 3998case QilNodeType.True: 3999case QilNodeType.False: 4000case QilNodeType.LiteralString: 4001case QilNodeType.LiteralInt32: 4002case QilNodeType.LiteralInt64: 4003case QilNodeType.LiteralDouble: 4004case QilNodeType.LiteralDecimal: 4005case QilNodeType.LiteralQName: 4026if (nd.NodeType == QilNodeType.True) 4028else if (nd.NodeType == QilNodeType.False) 4030else if (nd.NodeType == QilNodeType.LiteralQName) 4042if (child.NodeType == QilNodeType.Sequence) 4057if (IsStepPattern(patt, QilNodeType.DescendantOrSelf) || IsStepPattern(patt, QilNodeType.Descendant) || 4058IsStepPattern(patt, QilNodeType.Content) || IsStepPattern(patt, QilNodeType.XPathPreceding) || 4059IsStepPattern(patt, QilNodeType.XPathFollowing) || IsStepPattern(patt, QilNodeType.FollowingSibling)) { 4077if (IsStepPattern(patt, QilNodeType.Ancestor) || IsStepPattern(patt, QilNodeType.AncestorOrSelf) || 4078IsStepPattern(patt, QilNodeType.XPathPreceding) || IsStepPattern(patt, QilNodeType.PrecedingSibling)) { 4090return FoldXsltConvert(ndLiteral, typTarget).NodeType != QilNodeType.XsltConvert; 4102if (ndDest.NodeType == QilNodeType.XsltConvert) 4107if (ndDest.NodeType == QilNodeType.XsltConvert) 4151private QilNode FoldComparison(QilNodeType opType, QilNode left, QilNode right) { 4160if (left.NodeType == QilNodeType.LiteralDouble) { 4163return (opType == QilNodeType.Ne) ? f.True() : f.False(); 4166if (opType == QilNodeType.Eq) 4169if (opType == QilNodeType.Ne) 4172if (left.NodeType == QilNodeType.LiteralString) { 4181case QilNodeType.Gt: return cmp > 0 ? f.True() : f.False(); 4182case QilNodeType.Ge: return cmp >= 0 ? f.True() : f.False(); 4183case QilNodeType.Lt: return cmp < 0 ? f.True() : f.False(); 4184case QilNodeType.Le: return cmp <= 0 ? f.True() : f.False(); 4195private bool CanFoldArithmetic(QilNodeType opType, QilLiteral left, QilLiteral right) { 4204private QilNode FoldArithmetic(QilNodeType opType, QilLiteral left, QilLiteral right) { 4211case QilNodeType.LiteralInt32: { 4216case QilNodeType.Add: return f.LiteralInt32(intLeft + intRight); 4217case QilNodeType.Subtract: return f.LiteralInt32(intLeft - intRight); 4218case QilNodeType.Multiply: return f.LiteralInt32(intLeft * intRight); 4219case QilNodeType.Divide: return f.LiteralInt32(intLeft / intRight); 4220case QilNodeType.Modulo: return f.LiteralInt32(intLeft % intRight); 4225case QilNodeType.LiteralInt64: { 4230case QilNodeType.Add: return f.LiteralInt64(lngLeft + lngRight); 4231case QilNodeType.Subtract: return f.LiteralInt64(lngLeft - lngRight); 4232case QilNodeType.Multiply: return f.LiteralInt64(lngLeft * lngRight); 4233case QilNodeType.Divide: return f.LiteralInt64(lngLeft / lngRight); 4234case QilNodeType.Modulo: return f.LiteralInt64(lngLeft % lngRight); 4239case QilNodeType.LiteralDecimal: { 4244case QilNodeType.Add: return f.LiteralDecimal(lngLeft + lngRight); 4245case QilNodeType.Subtract: return f.LiteralDecimal(lngLeft - lngRight); 4246case QilNodeType.Multiply: return f.LiteralDecimal(lngLeft * lngRight); 4247case QilNodeType.Divide: return f.LiteralDecimal(lngLeft / lngRight); 4248case QilNodeType.Modulo: return f.LiteralDecimal(lngLeft % lngRight); 4253case QilNodeType.LiteralDouble: { 4258case QilNodeType.Add: return f.LiteralDouble(lngLeft + lngRight); 4259case QilNodeType.Subtract: return f.LiteralDouble(lngLeft - lngRight); 4260case QilNodeType.Multiply: return f.LiteralDouble(lngLeft * lngRight); 4261case QilNodeType.Divide: return f.LiteralDouble(lngLeft / lngRight); 4262case QilNodeType.Modulo: return f.LiteralDouble(lngLeft % lngRight); 4276case QilNodeType.Add: return f.Add(left, right); 4277case QilNodeType.Subtract: return f.Subtract(left, right); 4278case QilNodeType.Multiply: return f.Multiply(left, right); 4279case QilNodeType.Divide: return f.Divide(left, right); 4280case QilNodeType.Modulo: return f.Modulo(left, right); 4307private bool IsStepPattern(QilNode nd, QilNodeType stepType) { 4314private bool IsStepPattern(OptimizerPatterns patt, QilNodeType stepType) { 4328if (nd.NodeType == QilNodeType.Function) { 4333Debug.Assert(nd.NodeType == QilNodeType.Let || nd.NodeType == QilNodeType.Parameter, "Unexpected type of a global");

85Debug.Assert(iter.NodeType == QilNodeType.Let || iter.NodeType == QilNodeType.Parameter); 180Debug.Assert(iter.NodeType == QilNodeType.Parameter, "Only parameters may not have a default value"); 208Debug.Assert(iter.NodeType == QilNodeType.Parameter); 822if (ndCond.Right.NodeType == QilNodeType.Sequence && ndCond.Right.Count == 0) { 1332this.helper.CallArithmeticOp(QilNodeType.Negate, ndNeg.XmlType.TypeCode); 1404if (delimiter.NodeType == QilNodeType.LiteralString && ((string) (QilLiteral) delimiter).Length == 0) { 1409if (listStrings.NodeType == QilNodeType.Sequence && listStrings.Count < 5) { 1443if (listStrings.NodeType == QilNodeType.Sequence) { 1516if (ndParsedTagName.Right.NodeType == QilNodeType.Sequence) 1581QilNodeType relOp = ndComp.NodeType; 1587if (relOp == QilNodeType.Eq || relOp == QilNodeType.Ne) { 1611if (relOp == QilNodeType.Eq || relOp == QilNodeType.Ne) { 1616ZeroCompare((relOp == QilNodeType.Eq) ? QilNodeType.Ne : QilNodeType.Eq, true); 1652ZeroCompare(QilNodeType.Ne, true); 1683ClrCompare(ndComp.NodeType == QilNodeType.Before ? QilNodeType.Lt : QilNodeType.Gt, XmlTypeCode.String); 1796case QilNodeType.Content: 1829case QilNodeType.Parent: 1834case QilNodeType.Ancestor: 1835case QilNodeType.AncestorOrSelf: 1837kinds, name, (step.NodeType == QilNodeType.Ancestor) ? TriState.False : TriState.True, null); 1840case QilNodeType.Descendant: 1841case QilNodeType.DescendantOrSelf: 1843kinds, name, (step.NodeType == QilNodeType.Descendant) ? TriState.False : TriState.True, null); 1846case QilNodeType.Preceding: 1851case QilNodeType.FollowingSibling: 1856case QilNodeType.PrecedingSibling: 1861case QilNodeType.NodeRange: 1866case QilNodeType.XPathFollowing: 1871case QilNodeType.XPathPreceding: 1961if (ndIter.NodeType == QilNodeType.For || ndIter.XmlType.IsSingleton) { 1965Debug.Assert(ndIter.NodeType == QilNodeType.Let || ndIter.NodeType == QilNodeType.Parameter); 2081Debug.Assert(ndIter.NodeType == QilNodeType.For); 2097Debug.Assert(ndSort.Variable.NodeType == QilNodeType.For); 2165if (ndKey.Collation.NodeType == QilNodeType.LiteralString) { 2266case QilNodeType.Content: 2271case QilNodeType.Descendant: 2272case QilNodeType.DescendantOrSelf: 2274kinds, name, (step.NodeType == QilNodeType.Descendant) ? TriState.False : TriState.True); 2277case QilNodeType.XPathFollowing: 2282case QilNodeType.FollowingSibling: 2287case QilNodeType.XPathPreceding: 2300case QilNodeType.Ancestor: 2301case QilNodeType.AncestorOrSelf: 2303kinds, name, (step.NodeType == QilNodeType.Ancestor) ? TriState.False : TriState.True, null); 2306case QilNodeType.PrecedingSibling: 2311case QilNodeType.XPathPreceding: 2887case QilNodeType.NameOf: 2896case QilNodeType.LocalNameOf: 2902case QilNodeType.NamespaceUriOf: 2908case QilNodeType.PrefixOf: 2964ZeroCompare(QilNodeType.Ne, true); 2986ZeroCompare(QilNodeType.Ne, true); 2996ZeroCompare(QilNodeType.Ne, true); 3082ZeroCompare(allowKinds ? QilNodeType.Ne : QilNodeType.Eq, false); 3087ClrCompare(allowKinds ? QilNodeType.Eq : QilNodeType.Ne, XmlTypeCode.Int); 3699Debug.Assert(ndDod.NodeType == QilNodeType.DocOrderDistinct && ndLoop != null); 3819if (ndName.NodeType == QilNodeType.LiteralQName) { 3861if (ndName.NodeType == QilNodeType.NameOf) { 3867else if (ndName.NodeType == QilNodeType.StrParseQName) { 3894private bool TryZeroCompare(QilNodeType relOp, QilNode ndFirst, QilNode ndSecond) { 3895Debug.Assert(relOp == QilNodeType.Eq || relOp == QilNodeType.Ne); 3898case QilNodeType.LiteralInt64: 3902case QilNodeType.LiteralInt32: 3906case QilNodeType.False: 3909case QilNodeType.True: 3911relOp = (relOp == QilNodeType.Eq) ? QilNodeType.Ne : QilNodeType.Eq; 3931private bool TryNameCompare(QilNodeType relOp, QilNode ndFirst, QilNode ndSecond) { 3932Debug.Assert(relOp == QilNodeType.Eq || relOp == QilNodeType.Ne); 3934if (ndFirst.NodeType == QilNodeType.NameOf) { 3936case QilNodeType.NameOf: 3937case QilNodeType.LiteralQName: { 3944if (ndSecond.NodeType == QilNodeType.LiteralQName) { 3954Debug.Assert(ndSecond.NodeType == QilNodeType.NameOf); 3962ZeroCompare((relOp == QilNodeType.Eq) ? QilNodeType.Ne : QilNodeType.Eq, true); 3976private void ClrCompare(QilNodeType relOp, XmlTypeCode code) { 3986case QilNodeType.Gt: opcode = OpCodes.Ble_Un; break; 3987case QilNodeType.Ge: opcode = OpCodes.Blt_Un; break; 3988case QilNodeType.Lt: opcode = OpCodes.Bge_Un; break; 3989case QilNodeType.Le: opcode = OpCodes.Bgt_Un; break; 3990case QilNodeType.Eq: opcode = OpCodes.Bne_Un; break; 3991case QilNodeType.Ne: opcode = OpCodes.Beq; break; 3998case QilNodeType.Gt: opcode = OpCodes.Ble; break; 3999case QilNodeType.Ge: opcode = OpCodes.Blt; break; 4000case QilNodeType.Lt: opcode = OpCodes.Bge; break; 4001case QilNodeType.Le: opcode = OpCodes.Bgt; break; 4002case QilNodeType.Eq: opcode = OpCodes.Bne_Un; break; 4003case QilNodeType.Ne: opcode = OpCodes.Beq; break; 4013case QilNodeType.Gt: opcode = OpCodes.Bgt; break; 4014case QilNodeType.Ge: opcode = OpCodes.Bge; break; 4015case QilNodeType.Lt: opcode = OpCodes.Blt; break; 4016case QilNodeType.Le: opcode = OpCodes.Ble; break; 4017case QilNodeType.Eq: opcode = OpCodes.Beq; break; 4018case QilNodeType.Ne: opcode = OpCodes.Bne_Un; break; 4028case QilNodeType.Gt: this.helper.Emit(OpCodes.Cgt); break; 4029case QilNodeType.Lt: this.helper.Emit(OpCodes.Clt); break; 4030case QilNodeType.Eq: this.helper.Emit(OpCodes.Ceq); break; 4033case QilNodeType.Ge: opcode = OpCodes.Bge_S; break; 4034case QilNodeType.Le: opcode = OpCodes.Ble_S; break; 4035case QilNodeType.Ne: opcode = OpCodes.Bne_Un_S; break; 4054private void ZeroCompare(QilNodeType relOp, bool isBoolVal) { 4056Debug.Assert(relOp == QilNodeType.Eq || relOp == QilNodeType.Ne); 4063this.helper.Emit((relOp == QilNodeType.Eq) ? OpCodes.Brfalse : OpCodes.Brtrue, this.iterCurr.LabelBranch); 4070this.helper.Emit((relOp == QilNodeType.Eq) ? OpCodes.Brtrue : OpCodes.Brfalse, this.iterCurr.LabelBranch); 4078if (!isBoolVal || relOp == QilNodeType.Eq) { 4082this.helper.Emit((relOp == QilNodeType.Eq) ? OpCodes.Brfalse : OpCodes.Brtrue, lblTrue); 4177case QilNodeType.ElementCtor: 4178case QilNodeType.TextCtor: 4179case QilNodeType.RawTextCtor: 4180case QilNodeType.PICtor: 4181case QilNodeType.CommentCtor: 4249private XPathNodeType QilConstructorToNodeType(QilNodeType typ) { 4251case QilNodeType.DocumentCtor: return XPathNodeType.Root; 4252case QilNodeType.ElementCtor: return XPathNodeType.Element; 4253case QilNodeType.TextCtor: return XPathNodeType.Text; 4254case QilNodeType.RawTextCtor: return XPathNodeType.Text; 4255case QilNodeType.PICtor: return XPathNodeType.ProcessingInstruction; 4256case QilNodeType.CommentCtor: return XPathNodeType.Comment; 4257case QilNodeType.AttributeCtor: return XPathNodeType.Attribute; 4258case QilNodeType.NamespaceDecl: return XPathNodeType.Namespace; 4551case QilNodeType.Let: 4552case QilNodeType.Parameter: 4553case QilNodeType.Invoke: 4554case QilNodeType.XsltInvokeLateBound: 4555case QilNodeType.XsltInvokeEarlyBound: 4558case QilNodeType.Filter: 4563case QilNodeType.DocOrderDistinct: 4571case QilNodeType.TypeAssert:

30public QilBinary(QilNodeType nodeType, QilNode left, QilNode right) : base(nodeType) {

30public QilChoice(QilNodeType nodeType, QilNode expression, QilNode branches) : base(nodeType, expression, branches) {

29public QilDataSource(QilNodeType nodeType, QilNode name, QilNode baseUri) : base(nodeType, name, baseUri) {

41public QilExpression(QilNodeType nodeType, QilNode root) : this(nodeType, root, new QilFactory()) { 47public QilExpression(QilNodeType nodeType, QilNode root, QilFactory factory) : base(nodeType) { 118get { return this.isDebug.NodeType == QilNodeType.True; }

34QilExpression n = new QilExpression(QilNodeType.QilExpression, root, factory); 123QilExpression n = new QilExpression(QilNodeType.QilExpression, root); 130QilList n = new QilList(QilNodeType.FunctionList); 137QilList n = new QilList(QilNodeType.GlobalVariableList); 144QilList n = new QilList(QilNodeType.GlobalParameterList); 151QilList n = new QilList(QilNodeType.ActualParameterList); 158QilList n = new QilList(QilNodeType.FormalParameterList); 165QilList n = new QilList(QilNodeType.SortKeyList); 172QilList n = new QilList(QilNodeType.BranchList); 179QilUnary n = new QilUnary(QilNodeType.OptimizeBarrier, child); 186QilNode n = new QilNode(QilNodeType.Unknown, xmlType); 199QilDataSource n = new QilDataSource(QilNodeType.DataSource, name, baseUri); 206QilUnary n = new QilUnary(QilNodeType.Nop, child); 213QilUnary n = new QilUnary(QilNodeType.Error, child); 220QilUnary n = new QilUnary(QilNodeType.Warning, child); 233QilIterator n = new QilIterator(QilNodeType.For, binding); 240QilIterator n = new QilIterator(QilNodeType.Let, binding); 247QilParameter n = new QilParameter(QilNodeType.Parameter, defaultValue, name, xmlType); 254QilUnary n = new QilUnary(QilNodeType.PositionOf, child); 267QilNode n = new QilNode(QilNodeType.True); 274QilNode n = new QilNode(QilNodeType.False); 281QilLiteral n = new QilLiteral(QilNodeType.LiteralString, value); 288QilLiteral n = new QilLiteral(QilNodeType.LiteralInt32, value); 295QilLiteral n = new QilLiteral(QilNodeType.LiteralInt64, value); 302QilLiteral n = new QilLiteral(QilNodeType.LiteralDouble, value); 309QilLiteral n = new QilLiteral(QilNodeType.LiteralDecimal, value); 316QilName n = new QilName(QilNodeType.LiteralQName, localName, namespaceUri, prefix); 323QilLiteral n = new QilLiteral(QilNodeType.LiteralType, value); 330QilLiteral n = new QilLiteral(QilNodeType.LiteralObject, value); 343QilBinary n = new QilBinary(QilNodeType.And, left, right); 350QilBinary n = new QilBinary(QilNodeType.Or, left, right); 357QilUnary n = new QilUnary(QilNodeType.Not, child); 370QilTernary n = new QilTernary(QilNodeType.Conditional, left, center, right); 377QilChoice n = new QilChoice(QilNodeType.Choice, expression, branches); 390QilUnary n = new QilUnary(QilNodeType.Length, child); 397QilList n = new QilList(QilNodeType.Sequence); 404QilBinary n = new QilBinary(QilNodeType.Union, left, right); 411QilBinary n = new QilBinary(QilNodeType.Intersection, left, right); 418QilBinary n = new QilBinary(QilNodeType.Difference, left, right); 425QilUnary n = new QilUnary(QilNodeType.Average, child); 432QilUnary n = new QilUnary(QilNodeType.Sum, child); 439QilUnary n = new QilUnary(QilNodeType.Minimum, child); 446QilUnary n = new QilUnary(QilNodeType.Maximum, child); 459QilUnary n = new QilUnary(QilNodeType.Negate, child); 466QilBinary n = new QilBinary(QilNodeType.Add, left, right); 473QilBinary n = new QilBinary(QilNodeType.Subtract, left, right); 480QilBinary n = new QilBinary(QilNodeType.Multiply, left, right); 487QilBinary n = new QilBinary(QilNodeType.Divide, left, right); 494QilBinary n = new QilBinary(QilNodeType.Modulo, left, right); 507QilUnary n = new QilUnary(QilNodeType.StrLength, child); 514QilStrConcat n = new QilStrConcat(QilNodeType.StrConcat, delimiter, values); 521QilBinary n = new QilBinary(QilNodeType.StrParseQName, left, right); 534QilBinary n = new QilBinary(QilNodeType.Ne, left, right); 541QilBinary n = new QilBinary(QilNodeType.Eq, left, right); 548QilBinary n = new QilBinary(QilNodeType.Gt, left, right); 555QilBinary n = new QilBinary(QilNodeType.Ge, left, right); 562QilBinary n = new QilBinary(QilNodeType.Lt, left, right); 569QilBinary n = new QilBinary(QilNodeType.Le, left, right); 582QilBinary n = new QilBinary(QilNodeType.Is, left, right); 589QilBinary n = new QilBinary(QilNodeType.After, left, right); 596QilBinary n = new QilBinary(QilNodeType.Before, left, right); 609QilLoop n = new QilLoop(QilNodeType.Loop, variable, body); 616QilLoop n = new QilLoop(QilNodeType.Filter, variable, body); 629QilLoop n = new QilLoop(QilNodeType.Sort, variable, body); 636QilSortKey n = new QilSortKey(QilNodeType.SortKey, key, collation); 643QilUnary n = new QilUnary(QilNodeType.DocOrderDistinct, child); 656QilFunction n = new QilFunction(QilNodeType.Function, arguments, definition, sideEffects, xmlType); 663QilInvoke n = new QilInvoke(QilNodeType.Invoke, function, arguments); 676QilUnary n = new QilUnary(QilNodeType.Content, child); 683QilBinary n = new QilBinary(QilNodeType.Attribute, left, right); 690QilUnary n = new QilUnary(QilNodeType.Parent, child); 697QilUnary n = new QilUnary(QilNodeType.Root, child); 704QilNode n = new QilNode(QilNodeType.XmlContext); 711QilUnary n = new QilUnary(QilNodeType.Descendant, child); 718QilUnary n = new QilUnary(QilNodeType.DescendantOrSelf, child); 725QilUnary n = new QilUnary(QilNodeType.Ancestor, child); 732QilUnary n = new QilUnary(QilNodeType.AncestorOrSelf, child); 739QilUnary n = new QilUnary(QilNodeType.Preceding, child); 746QilUnary n = new QilUnary(QilNodeType.FollowingSibling, child); 753QilUnary n = new QilUnary(QilNodeType.PrecedingSibling, child); 760QilBinary n = new QilBinary(QilNodeType.NodeRange, left, right); 767QilBinary n = new QilBinary(QilNodeType.Deref, left, right); 780QilBinary n = new QilBinary(QilNodeType.ElementCtor, left, right); 787QilBinary n = new QilBinary(QilNodeType.AttributeCtor, left, right); 794QilUnary n = new QilUnary(QilNodeType.CommentCtor, child); 801QilBinary n = new QilBinary(QilNodeType.PICtor, left, right); 808QilUnary n = new QilUnary(QilNodeType.TextCtor, child); 815QilUnary n = new QilUnary(QilNodeType.RawTextCtor, child); 822QilUnary n = new QilUnary(QilNodeType.DocumentCtor, child); 829QilBinary n = new QilBinary(QilNodeType.NamespaceDecl, left, right); 836QilBinary n = new QilBinary(QilNodeType.RtfCtor, left, right); 849QilUnary n = new QilUnary(QilNodeType.NameOf, child); 856QilUnary n = new QilUnary(QilNodeType.LocalNameOf, child); 863QilUnary n = new QilUnary(QilNodeType.NamespaceUriOf, child); 870QilUnary n = new QilUnary(QilNodeType.PrefixOf, child); 883QilTargetType n = new QilTargetType(QilNodeType.TypeAssert, source, targetType); 890QilTargetType n = new QilTargetType(QilNodeType.IsType, source, targetType); 897QilUnary n = new QilUnary(QilNodeType.IsEmpty, child); 910QilUnary n = new QilUnary(QilNodeType.XPathNodeValue, child); 917QilUnary n = new QilUnary(QilNodeType.XPathFollowing, child); 924QilUnary n = new QilUnary(QilNodeType.XPathPreceding, child); 931QilUnary n = new QilUnary(QilNodeType.XPathNamespace, child); 944QilUnary n = new QilUnary(QilNodeType.XsltGenerateId, child); 951QilInvokeLateBound n = new QilInvokeLateBound(QilNodeType.XsltInvokeLateBound, name, arguments); 958QilInvokeEarlyBound n = new QilInvokeEarlyBound(QilNodeType.XsltInvokeEarlyBound, name, clrMethod, arguments, xmlType); 965QilBinary n = new QilBinary(QilNodeType.XsltCopy, left, right); 972QilUnary n = new QilUnary(QilNodeType.XsltCopyOf, child); 979QilTargetType n = new QilTargetType(QilNodeType.XsltConvert, source, targetType);

36public QilFunction(QilNodeType nodeType, QilNode arguments, QilNode definition, QilNode sideEffects, XmlQueryType resultType) 97get { return this.sideEffects.NodeType == QilNodeType.True; } 98set { this.sideEffects.NodeType = value ? QilNodeType.True : QilNodeType.False; }

26public QilInvoke(QilNodeType nodeType, QilNode function, QilNode arguments) : base(nodeType, function, arguments) {

26public QilInvokeEarlyBound(QilNodeType nodeType, QilNode name, QilNode method, QilNode arguments, XmlQueryType resultType)

24public QilInvokeLateBound(QilNodeType nodeType, QilNode name, QilNode arguments) : base(nodeType, name, arguments) {

25public QilIterator(QilNodeType nodeType, QilNode binding) : base(nodeType) {

31public QilList(QilNodeType nodeType) : base(nodeType) { 50if (this.nodeType == QilNodeType.Sequence) { 56else if (this.nodeType == QilNodeType.BranchList) {

29public QilLiteral(QilNodeType nodeType, object value) : base(nodeType) {

30public QilLoop(QilNodeType nodeType, QilNode variable, QilNode body) : base(nodeType, variable, body) {

31public QilName(QilNodeType nodeType, string local, string uri, string prefix) : base(nodeType, null) {

26protected QilNodeType nodeType; 38public QilNode(QilNodeType nodeType) { 45public QilNode(QilNodeType nodeType, XmlQueryType xmlType) { 58public QilNodeType NodeType {

25public QilParameter(QilNodeType nodeType, QilNode defaultValue, QilNode name, XmlQueryType xmlType) : base(nodeType, defaultValue) {

236if (left.NodeType == QilNodeType.True || right.NodeType == QilNodeType.False) { 239if (left.NodeType == QilNodeType.False || right.NodeType == QilNodeType.True) { 254if (left.NodeType == QilNodeType.True || right.NodeType == QilNodeType.False) { 257if (left.NodeType == QilNodeType.False || right.NodeType == QilNodeType.True) { 267case QilNodeType.True: 269case QilNodeType.False: 271case QilNodeType.Not: 288case QilNodeType.True: 290case QilNodeType.False: 292case QilNodeType.Not: 496if (expr.NodeType == QilNodeType.True) { 520if (collection.NodeType == QilNodeType.DocOrderDistinct) { 533Debug.Assert(args.NodeType == QilNodeType.FormalParameterList); 537Debug.Assert(args.NodeType == QilNodeType.FormalParameterList); 542Debug.Assert(args.NodeType == QilNodeType.ActualParameterList);

31public QilReference(QilNodeType nodeType) : base(nodeType) {

40case QilNodeType.QilExpression: 48case QilNodeType.Function: 53case QilNodeType.Loop: 54case QilNodeType.Filter: 55case QilNodeType.Sort: 69case QilNodeType.QilExpression: 77case QilNodeType.Function: 82case QilNodeType.Loop: 83case QilNodeType.Filter: 84case QilNodeType.Sort:

27public QilSortKey(QilNodeType nodeType, QilNode key, QilNode collation) : base(nodeType, key, collation) {

27public QilStrConcat(QilNodeType nodeType, QilNode delimiter, QilNode values) : base(nodeType, delimiter, values) {

29public QilTargetType(QilNodeType nodeType, QilNode expr, QilNode targetType) : base(nodeType, expr, targetType) {

30public QilTernary(QilNodeType nodeType, QilNode left, QilNode center, QilNode right) : base(nodeType) {

32case QilNodeType.QilExpression: return CheckQilExpression((QilExpression)n); 33case QilNodeType.FunctionList: return CheckFunctionList((QilList)n); 34case QilNodeType.GlobalVariableList: return CheckGlobalVariableList((QilList)n); 35case QilNodeType.GlobalParameterList: return CheckGlobalParameterList((QilList)n); 36case QilNodeType.ActualParameterList: return CheckActualParameterList((QilList)n); 37case QilNodeType.FormalParameterList: return CheckFormalParameterList((QilList)n); 38case QilNodeType.SortKeyList: return CheckSortKeyList((QilList)n); 39case QilNodeType.BranchList: return CheckBranchList((QilList)n); 40case QilNodeType.OptimizeBarrier: return CheckOptimizeBarrier((QilUnary)n); 41case QilNodeType.Unknown: return CheckUnknown(n); 43case QilNodeType.DataSource: return CheckDataSource((QilDataSource)n); 44case QilNodeType.Nop: return CheckNop((QilUnary)n); 45case QilNodeType.Error: return CheckError((QilUnary)n); 46case QilNodeType.Warning: return CheckWarning((QilUnary)n); 48case QilNodeType.For: return CheckFor((QilIterator)n); 49case QilNodeType.Let: return CheckLet((QilIterator)n); 50case QilNodeType.Parameter: return CheckParameter((QilParameter)n); 51case QilNodeType.PositionOf: return CheckPositionOf((QilUnary)n); 53case QilNodeType.True: return CheckTrue(n); 54case QilNodeType.False: return CheckFalse(n); 55case QilNodeType.LiteralString: return CheckLiteralString((QilLiteral)n); 56case QilNodeType.LiteralInt32: return CheckLiteralInt32((QilLiteral)n); 57case QilNodeType.LiteralInt64: return CheckLiteralInt64((QilLiteral)n); 58case QilNodeType.LiteralDouble: return CheckLiteralDouble((QilLiteral)n); 59case QilNodeType.LiteralDecimal: return CheckLiteralDecimal((QilLiteral)n); 60case QilNodeType.LiteralQName: return CheckLiteralQName((QilName)n); 61case QilNodeType.LiteralType: return CheckLiteralType((QilLiteral)n); 62case QilNodeType.LiteralObject: return CheckLiteralObject((QilLiteral)n); 64case QilNodeType.And: return CheckAnd((QilBinary)n); 65case QilNodeType.Or: return CheckOr((QilBinary)n); 66case QilNodeType.Not: return CheckNot((QilUnary)n); 68case QilNodeType.Conditional: return CheckConditional((QilTernary)n); 69case QilNodeType.Choice: return CheckChoice((QilChoice)n); 71case QilNodeType.Length: return CheckLength((QilUnary)n); 72case QilNodeType.Sequence: return CheckSequence((QilList)n); 73case QilNodeType.Union: return CheckUnion((QilBinary)n); 74case QilNodeType.Intersection: return CheckIntersection((QilBinary)n); 75case QilNodeType.Difference: return CheckDifference((QilBinary)n); 76case QilNodeType.Average: return CheckAverage((QilUnary)n); 77case QilNodeType.Sum: return CheckSum((QilUnary)n); 78case QilNodeType.Minimum: return CheckMinimum((QilUnary)n); 79case QilNodeType.Maximum: return CheckMaximum((QilUnary)n); 81case QilNodeType.Negate: return CheckNegate((QilUnary)n); 82case QilNodeType.Add: return CheckAdd((QilBinary)n); 83case QilNodeType.Subtract: return CheckSubtract((QilBinary)n); 84case QilNodeType.Multiply: return CheckMultiply((QilBinary)n); 85case QilNodeType.Divide: return CheckDivide((QilBinary)n); 86case QilNodeType.Modulo: return CheckModulo((QilBinary)n); 88case QilNodeType.StrLength: return CheckStrLength((QilUnary)n); 89case QilNodeType.StrConcat: return CheckStrConcat((QilStrConcat)n); 90case QilNodeType.StrParseQName: return CheckStrParseQName((QilBinary)n); 92case QilNodeType.Ne: return CheckNe((QilBinary)n); 93case QilNodeType.Eq: return CheckEq((QilBinary)n); 94case QilNodeType.Gt: return CheckGt((QilBinary)n); 95case QilNodeType.Ge: return CheckGe((QilBinary)n); 96case QilNodeType.Lt: return CheckLt((QilBinary)n); 97case QilNodeType.Le: return CheckLe((QilBinary)n); 99case QilNodeType.Is: return CheckIs((QilBinary)n); 100case QilNodeType.After: return CheckAfter((QilBinary)n); 101case QilNodeType.Before: return CheckBefore((QilBinary)n); 103case QilNodeType.Loop: return CheckLoop((QilLoop)n); 104case QilNodeType.Filter: return CheckFilter((QilLoop)n); 106case QilNodeType.Sort: return CheckSort((QilLoop)n); 107case QilNodeType.SortKey: return CheckSortKey((QilSortKey)n); 108case QilNodeType.DocOrderDistinct: return CheckDocOrderDistinct((QilUnary)n); 110case QilNodeType.Function: return CheckFunction((QilFunction)n); 111case QilNodeType.Invoke: return CheckInvoke((QilInvoke)n); 113case QilNodeType.Content: return CheckContent((QilUnary)n); 114case QilNodeType.Attribute: return CheckAttribute((QilBinary)n); 115case QilNodeType.Parent: return CheckParent((QilUnary)n); 116case QilNodeType.Root: return CheckRoot((QilUnary)n); 117case QilNodeType.XmlContext: return CheckXmlContext(n); 118case QilNodeType.Descendant: return CheckDescendant((QilUnary)n); 119case QilNodeType.DescendantOrSelf: return CheckDescendantOrSelf((QilUnary)n); 120case QilNodeType.Ancestor: return CheckAncestor((QilUnary)n); 121case QilNodeType.AncestorOrSelf: return CheckAncestorOrSelf((QilUnary)n); 122case QilNodeType.Preceding: return CheckPreceding((QilUnary)n); 123case QilNodeType.FollowingSibling: return CheckFollowingSibling((QilUnary)n); 124case QilNodeType.PrecedingSibling: return CheckPrecedingSibling((QilUnary)n); 125case QilNodeType.NodeRange: return CheckNodeRange((QilBinary)n); 126case QilNodeType.Deref: return CheckDeref((QilBinary)n); 128case QilNodeType.ElementCtor: return CheckElementCtor((QilBinary)n); 129case QilNodeType.AttributeCtor: return CheckAttributeCtor((QilBinary)n); 130case QilNodeType.CommentCtor: return CheckCommentCtor((QilUnary)n); 131case QilNodeType.PICtor: return CheckPICtor((QilBinary)n); 132case QilNodeType.TextCtor: return CheckTextCtor((QilUnary)n); 133case QilNodeType.RawTextCtor: return CheckRawTextCtor((QilUnary)n); 134case QilNodeType.DocumentCtor: return CheckDocumentCtor((QilUnary)n); 135case QilNodeType.NamespaceDecl: return CheckNamespaceDecl((QilBinary)n); 136case QilNodeType.RtfCtor: return CheckRtfCtor((QilBinary)n); 138case QilNodeType.NameOf: return CheckNameOf((QilUnary)n); 139case QilNodeType.LocalNameOf: return CheckLocalNameOf((QilUnary)n); 140case QilNodeType.NamespaceUriOf: return CheckNamespaceUriOf((QilUnary)n); 141case QilNodeType.PrefixOf: return CheckPrefixOf((QilUnary)n); 143case QilNodeType.TypeAssert: return CheckTypeAssert((QilTargetType)n); 144case QilNodeType.IsType: return CheckIsType((QilTargetType)n); 145case QilNodeType.IsEmpty: return CheckIsEmpty((QilUnary)n); 147case QilNodeType.XPathNodeValue: return CheckXPathNodeValue((QilUnary)n); 148case QilNodeType.XPathFollowing: return CheckXPathFollowing((QilUnary)n); 149case QilNodeType.XPathPreceding: return CheckXPathPreceding((QilUnary)n); 150case QilNodeType.XPathNamespace: return CheckXPathNamespace((QilUnary)n); 152case QilNodeType.XsltGenerateId: return CheckXsltGenerateId((QilUnary)n); 153case QilNodeType.XsltInvokeLateBound: return CheckXsltInvokeLateBound((QilInvokeLateBound)n); 154case QilNodeType.XsltInvokeEarlyBound: return CheckXsltInvokeEarlyBound((QilInvokeEarlyBound)n); 155case QilNodeType.XsltCopy: return CheckXsltCopy((QilBinary)n); 156case QilNodeType.XsltCopyOf: return CheckXsltCopyOf((QilUnary)n); 157case QilNodeType.XsltConvert: return CheckXsltConvert((QilTargetType)n); 169Check(node[0].NodeType == QilNodeType.False || node[0].NodeType == QilNodeType.True, node, "IsDebug must either be True or False"); 172CheckClassAndNodeType(node[3], typeof(QilList), QilNodeType.GlobalParameterList); 173CheckClassAndNodeType(node[4], typeof(QilList), QilNodeType.GlobalVariableList); 175CheckClassAndNodeType(node[6], typeof(QilList), QilNodeType.FunctionList); 181CheckClassAndNodeType(child, typeof(QilFunction), QilNodeType.Function); 187CheckClassAndNodeType(child, typeof(QilIterator), QilNodeType.Let); 193CheckClassAndNodeType(child, typeof(QilParameter), QilNodeType.Parameter); 205CheckClassAndNodeType(child, typeof(QilParameter), QilNodeType.Parameter); 211CheckClassAndNodeType(child, typeof(QilSortKey), QilNodeType.SortKey); 366CheckClassAndNodeType(node.Branches, typeof(QilList), QilNodeType.BranchList); 538Check(node.Variable.NodeType == QilNodeType.For || node.Variable.NodeType == QilNodeType.Let, node, "Loop variable must be a For or Let iterator"); 541XmlQueryCardinality variableCard = node.Variable.NodeType == QilNodeType.Let ? XmlQueryCardinality.One : node.Variable.Binding.XmlType.Cardinality; 549Check(node.Variable.NodeType == QilNodeType.For || node.Variable.NodeType == QilNodeType.Let, node, "Filter variable must be a For or Let iterator"); 569CheckClassAndNodeType(node[0], typeof(QilIterator), QilNodeType.For); 570CheckClassAndNodeType(node[1], typeof(QilList), QilNodeType.SortKeyList); 594CheckClassAndNodeType(node[0], typeof(QilList), QilNodeType.FormalParameterList); 595Check(node[2].NodeType == QilNodeType.False || node[2].NodeType == QilNodeType.True, node, "SideEffects must either be True or False"); 745CheckClassAndNodeType(node.Right, typeof(QilLiteral), QilNodeType.LiteralString); 793CheckClassAndNodeType(node[1], typeof(QilLiteral), QilNodeType.LiteralType); 798CheckClassAndNodeType(node[1], typeof(QilLiteral), QilNodeType.LiteralType); 845CheckClassAndNodeType(node[1], typeof(QilList), QilNodeType.ActualParameterList); 883CheckClassAndNodeType(node[1], typeof(QilLiteral), QilNodeType.LiteralType); 913private void CheckClassAndNodeType(QilNode node, Type clrTypeClass, QilNodeType nodeType) { 962case QilNodeType.False: 965case QilNodeType.IsType: 971case QilNodeType.And: 979case QilNodeType.Eq: 982if (binary.Left.NodeType == QilNodeType.PositionOf) {

30public QilUnary(QilNodeType nodeType, QilNode child) : base(nodeType) {

62case QilNodeType.For: 63case QilNodeType.Let: 64case QilNodeType.Parameter: 67case QilNodeType.Loop: 68case QilNodeType.Filter: 69case QilNodeType.Sort: 73case QilNodeType.GlobalVariableList: 74case QilNodeType.GlobalParameterList: 75case QilNodeType.FormalParameterList: 83case QilNodeType.Function: 85return parent.NodeType == QilNodeType.Invoke; 104case QilNodeType.QilExpression: return VisitQilExpression((QilExpression)n); 105case QilNodeType.FunctionList: return VisitFunctionList((QilList)n); 106case QilNodeType.GlobalVariableList: return VisitGlobalVariableList((QilList)n); 107case QilNodeType.GlobalParameterList: return VisitGlobalParameterList((QilList)n); 108case QilNodeType.ActualParameterList: return VisitActualParameterList((QilList)n); 109case QilNodeType.FormalParameterList: return VisitFormalParameterList((QilList)n); 110case QilNodeType.SortKeyList: return VisitSortKeyList((QilList)n); 111case QilNodeType.BranchList: return VisitBranchList((QilList)n); 112case QilNodeType.OptimizeBarrier: return VisitOptimizeBarrier((QilUnary)n); 113case QilNodeType.Unknown: return VisitUnknown(n); 115case QilNodeType.DataSource: return VisitDataSource((QilDataSource)n); 116case QilNodeType.Nop: return VisitNop((QilUnary)n); 117case QilNodeType.Error: return VisitError((QilUnary)n); 118case QilNodeType.Warning: return VisitWarning((QilUnary)n); 120case QilNodeType.For: return VisitFor((QilIterator)n); 121case QilNodeType.Let: return VisitLet((QilIterator)n); 122case QilNodeType.Parameter: return VisitParameter((QilParameter)n); 123case QilNodeType.PositionOf: return VisitPositionOf((QilUnary)n); 125case QilNodeType.True: return VisitTrue(n); 126case QilNodeType.False: return VisitFalse(n); 127case QilNodeType.LiteralString: return VisitLiteralString((QilLiteral)n); 128case QilNodeType.LiteralInt32: return VisitLiteralInt32((QilLiteral)n); 129case QilNodeType.LiteralInt64: return VisitLiteralInt64((QilLiteral)n); 130case QilNodeType.LiteralDouble: return VisitLiteralDouble((QilLiteral)n); 131case QilNodeType.LiteralDecimal: return VisitLiteralDecimal((QilLiteral)n); 132case QilNodeType.LiteralQName: return VisitLiteralQName((QilName)n); 133case QilNodeType.LiteralType: return VisitLiteralType((QilLiteral)n); 134case QilNodeType.LiteralObject: return VisitLiteralObject((QilLiteral)n); 136case QilNodeType.And: return VisitAnd((QilBinary)n); 137case QilNodeType.Or: return VisitOr((QilBinary)n); 138case QilNodeType.Not: return VisitNot((QilUnary)n); 140case QilNodeType.Conditional: return VisitConditional((QilTernary)n); 141case QilNodeType.Choice: return VisitChoice((QilChoice)n); 143case QilNodeType.Length: return VisitLength((QilUnary)n); 144case QilNodeType.Sequence: return VisitSequence((QilList)n); 145case QilNodeType.Union: return VisitUnion((QilBinary)n); 146case QilNodeType.Intersection: return VisitIntersection((QilBinary)n); 147case QilNodeType.Difference: return VisitDifference((QilBinary)n); 148case QilNodeType.Average: return VisitAverage((QilUnary)n); 149case QilNodeType.Sum: return VisitSum((QilUnary)n); 150case QilNodeType.Minimum: return VisitMinimum((QilUnary)n); 151case QilNodeType.Maximum: return VisitMaximum((QilUnary)n); 153case QilNodeType.Negate: return VisitNegate((QilUnary)n); 154case QilNodeType.Add: return VisitAdd((QilBinary)n); 155case QilNodeType.Subtract: return VisitSubtract((QilBinary)n); 156case QilNodeType.Multiply: return VisitMultiply((QilBinary)n); 157case QilNodeType.Divide: return VisitDivide((QilBinary)n); 158case QilNodeType.Modulo: return VisitModulo((QilBinary)n); 160case QilNodeType.StrLength: return VisitStrLength((QilUnary)n); 161case QilNodeType.StrConcat: return VisitStrConcat((QilStrConcat)n); 162case QilNodeType.StrParseQName: return VisitStrParseQName((QilBinary)n); 164case QilNodeType.Ne: return VisitNe((QilBinary)n); 165case QilNodeType.Eq: return VisitEq((QilBinary)n); 166case QilNodeType.Gt: return VisitGt((QilBinary)n); 167case QilNodeType.Ge: return VisitGe((QilBinary)n); 168case QilNodeType.Lt: return VisitLt((QilBinary)n); 169case QilNodeType.Le: return VisitLe((QilBinary)n); 171case QilNodeType.Is: return VisitIs((QilBinary)n); 172case QilNodeType.After: return VisitAfter((QilBinary)n); 173case QilNodeType.Before: return VisitBefore((QilBinary)n); 175case QilNodeType.Loop: return VisitLoop((QilLoop)n); 176case QilNodeType.Filter: return VisitFilter((QilLoop)n); 178case QilNodeType.Sort: return VisitSort((QilLoop)n); 179case QilNodeType.SortKey: return VisitSortKey((QilSortKey)n); 180case QilNodeType.DocOrderDistinct: return VisitDocOrderDistinct((QilUnary)n); 182case QilNodeType.Function: return VisitFunction((QilFunction)n); 183case QilNodeType.Invoke: return VisitInvoke((QilInvoke)n); 185case QilNodeType.Content: return VisitContent((QilUnary)n); 186case QilNodeType.Attribute: return VisitAttribute((QilBinary)n); 187case QilNodeType.Parent: return VisitParent((QilUnary)n); 188case QilNodeType.Root: return VisitRoot((QilUnary)n); 189case QilNodeType.XmlContext: return VisitXmlContext(n); 190case QilNodeType.Descendant: return VisitDescendant((QilUnary)n); 191case QilNodeType.DescendantOrSelf: return VisitDescendantOrSelf((QilUnary)n); 192case QilNodeType.Ancestor: return VisitAncestor((QilUnary)n); 193case QilNodeType.AncestorOrSelf: return VisitAncestorOrSelf((QilUnary)n); 194case QilNodeType.Preceding: return VisitPreceding((QilUnary)n); 195case QilNodeType.FollowingSibling: return VisitFollowingSibling((QilUnary)n); 196case QilNodeType.PrecedingSibling: return VisitPrecedingSibling((QilUnary)n); 197case QilNodeType.NodeRange: return VisitNodeRange((QilBinary)n); 198case QilNodeType.Deref: return VisitDeref((QilBinary)n); 200case QilNodeType.ElementCtor: return VisitElementCtor((QilBinary)n); 201case QilNodeType.AttributeCtor: return VisitAttributeCtor((QilBinary)n); 202case QilNodeType.CommentCtor: return VisitCommentCtor((QilUnary)n); 203case QilNodeType.PICtor: return VisitPICtor((QilBinary)n); 204case QilNodeType.TextCtor: return VisitTextCtor((QilUnary)n); 205case QilNodeType.RawTextCtor: return VisitRawTextCtor((QilUnary)n); 206case QilNodeType.DocumentCtor: return VisitDocumentCtor((QilUnary)n); 207case QilNodeType.NamespaceDecl: return VisitNamespaceDecl((QilBinary)n); 208case QilNodeType.RtfCtor: return VisitRtfCtor((QilBinary)n); 210case QilNodeType.NameOf: return VisitNameOf((QilUnary)n); 211case QilNodeType.LocalNameOf: return VisitLocalNameOf((QilUnary)n); 212case QilNodeType.NamespaceUriOf: return VisitNamespaceUriOf((QilUnary)n); 213case QilNodeType.PrefixOf: return VisitPrefixOf((QilUnary)n); 215case QilNodeType.TypeAssert: return VisitTypeAssert((QilTargetType)n); 216case QilNodeType.IsType: return VisitIsType((QilTargetType)n); 217case QilNodeType.IsEmpty: return VisitIsEmpty((QilUnary)n); 219case QilNodeType.XPathNodeValue: return VisitXPathNodeValue((QilUnary)n); 220case QilNodeType.XPathFollowing: return VisitXPathFollowing((QilUnary)n); 221case QilNodeType.XPathPreceding: return VisitXPathPreceding((QilUnary)n); 222case QilNodeType.XPathNamespace: return VisitXPathNamespace((QilUnary)n); 224case QilNodeType.XsltGenerateId: return VisitXsltGenerateId((QilUnary)n); 225case QilNodeType.XsltInvokeLateBound: return VisitXsltInvokeLateBound((QilInvokeLateBound)n); 226case QilNodeType.XsltInvokeEarlyBound: return VisitXsltInvokeEarlyBound((QilInvokeEarlyBound)n); 227case QilNodeType.XsltCopy: return VisitXsltCopy((QilBinary)n); 228case QilNodeType.XsltCopyOf: return VisitXsltCopyOf((QilUnary)n); 229case QilNodeType.XsltConvert: return VisitXsltConvert((QilTargetType)n); 240case QilNodeType.For: return VisitForReference((QilIterator)n); 241case QilNodeType.Let: return VisitLetReference((QilIterator)n); 242case QilNodeType.Parameter: return VisitParameterReference((QilParameter)n); 244case QilNodeType.Function: return VisitFunctionReference((QilFunction)n);

101Debug.Assert(this.stk.Peek()[0].NodeType == QilNodeType.QilExpression, "Serialized qil tree did not contain a QilExpression node"); 202case QilNodeType.True: 203case QilNodeType.False: 204qil.IsDebug = list[i].NodeType == QilNodeType.True; 207case QilNodeType.FunctionList: 211case QilNodeType.GlobalVariableList: 215case QilNodeType.GlobalParameterList: 282Debug.Assert(r.LocalName == Enum.GetName(typeof(QilNodeType), nd.NodeType), "Id '" + id + "' is not not bound to a " + r.LocalName + " forward decl");

157if (node.NodeType == QilNodeType.Parameter) { 198this.writer.WriteStartElement(Enum.GetName(typeof(QilNodeType), n.NodeType)); 202if (n.NodeType == QilNodeType.Function) { 263this.writer.WriteStartElement("", Enum.GetName(typeof(QilNodeType), node.NodeType), "");

200Debug.Assert(ndParam.NodeType == QilNodeType.Parameter);

259if (left.NodeType == QilNodeType.Sequence) { 298if (qilAxis.NodeType == QilNodeType.Filter) { 392Debug.Assert(nodeset.NodeType == QilNodeType.DocOrderDistinct, 609static QilNodeType[] QilOperator = { 610/*Unknown */ QilNodeType.Unknown , 611/*Or */ QilNodeType.Or , 612/*And */ QilNodeType.And , 613/*Eq */ QilNodeType.Eq , 614/*Ne */ QilNodeType.Ne , 615/*Lt */ QilNodeType.Lt , 616/*Le */ QilNodeType.Le , 617/*Gt */ QilNodeType.Gt , 618/*Ge */ QilNodeType.Ge , 619/*Plus */ QilNodeType.Add , 620/*Minus */ QilNodeType.Subtract, 621/*Multiply */ QilNodeType.Multiply, 622/*Divide */ QilNodeType.Divide , 623/*Modulo */ QilNodeType.Modulo , 624/*UnaryMinus */ QilNodeType.Negate , 625/*Union */ QilNodeType.Sequence, 781Debug.Assert(unknown.NodeType == QilNodeType.Unknown);

122public QilNode InvokeEqualityOperator(QilNodeType op, QilNode left, QilNode right) { 123Debug.Assert(op == QilNodeType.Eq || op == QilNodeType.Ne); 129case QilNodeType.Eq: opCode = (double)XsltLibrary.ComparisonOperator.Eq; break; 137public QilNode InvokeRelationalOperator(QilNodeType op, QilNode left, QilNode right) { 138Debug.Assert(op == QilNodeType.Lt || op == QilNodeType.Le || op == QilNodeType.Gt || op == QilNodeType.Ge); 144case QilNodeType.Lt: opCode = (double)XsltLibrary.ComparisonOperator.Lt; break; 145case QilNodeType.Le: opCode = (double)XsltLibrary.ComparisonOperator.Le; break; 146case QilNodeType.Gt: opCode = (double)XsltLibrary.ComparisonOperator.Gt; break; 177n.NodeType == QilNodeType.True ? (QilNode) String("true") : 178n.NodeType == QilNodeType.False ? (QilNode) String("false") : 182return (n.NodeType == QilNodeType.LiteralDouble 206return (n.NodeType == QilNodeType.LiteralDouble 211return (n.NodeType == QilNodeType.LiteralString 230n.NodeType == QilNodeType.True ? (QilNode) Double(1) : 231n.NodeType == QilNodeType.False ? (QilNode) Double(0) :

77n.NodeType == QilNodeType.Union || 78n.NodeType == QilNodeType.DocOrderDistinct || 79n.NodeType == QilNodeType.Filter || 80n.NodeType == QilNodeType.Loop 89if (n.Variable.Binding.NodeType == QilNodeType.Root || n.Variable.Binding.NodeType == QilNodeType.Deref) { 93if (n.Variable.Binding.NodeType == QilNodeType.Content) {

159while (node.NodeType == QilNodeType.And) { 164if (!(node.NodeType == QilNodeType.IsType)) { 169if (!(isType.Left == iterator && isType.Right.NodeType == QilNodeType.LiteralType)) { 183if (lastAnd != null && lastAnd.Right.NodeType == QilNodeType.Eq) { 187if (eq.Left.NodeType == QilNodeType.NameOf && 188((QilUnary)eq.Left).Child == iterator && eq.Right.NodeType == QilNodeType.LiteralQName 375if (matcher.NodeType == QilNodeType.LiteralInt32) {

245if (init.NodeType == QilNodeType.Add) { 388Debug.Assert(nsList[i].NodeType == QilNodeType.NamespaceDecl); 389Debug.Assert(varList[i].NodeType == QilNodeType.NamespaceDecl); 556Debug.Assert(tmpl != null && tmpl.Function != null && tmpl.Function.Definition.NodeType == QilNodeType.Unknown); 648if (result.NodeType == QilNodeType.Sequence && result.Count == 0) { 754if (qilName.NodeType == QilNodeType.LiteralString && (qilNs == null || qilNs.NodeType == QilNodeType.LiteralString)) { 802if (qilName.NodeType == QilNodeType.LiteralString && (qilNs == null || qilNs.NodeType == QilNodeType.LiteralString)) { 914if (avtParts.NodeType == QilNodeType.Sequence) { 934if (qilName.NodeType == QilNodeType.LiteralString) { 1308} else if (result.NodeType == QilNodeType.LiteralString) { 1334} else if (lang.NodeType == QilNodeType.LiteralString) { 1346if (result.NodeType == QilNodeType.LiteralString) { 1416if (result.NodeType == QilNodeType.LiteralString) { 1520if (pattern.NodeType == QilNodeType.Error) { 1523} else if (pattern.NodeType == QilNodeType.Sequence) { 1682if (result.NodeType == QilNodeType.LiteralString) { 1714} else if (result.NodeType == QilNodeType.LiteralString) { 1739} else if (result.NodeType == QilNodeType.LiteralString) { 1802if (result.NodeType == QilNodeType.Sequence) { 2394Debug.Assert(let.NodeType == QilNodeType.Let);

85if (var.NodeType == QilNodeType.Parameter && varType.IsNode && varType.IsNotRtf && varType.MaybeMany && !varType.IsDod) { 346if (name.NodeType == QilNodeType.LiteralString) { 479if (formatName.NodeType == QilNodeType.LiteralString) { 501if (formatPicture.NodeType == QilNodeType.LiteralString) { 546if (name.NodeType == QilNodeType.LiteralString) { 566if (name.NodeType == QilNodeType.LiteralString) { 580if (name.NodeType == QilNodeType.LiteralString) {

58if (value.NodeType == QilNodeType.LiteralString) {

50Debug.Assert(filter.NodeType == QilNodeType.Filter, "XPathPatternBuilder expected to generate list of Filters on top level"); 52Debug.Assert(filter.Variable.Binding.NodeType == QilNodeType.Unknown); // fixupNode 81Debug.Assert(right.NodeType == QilNodeType.Filter, "LocationPathPattern must be compiled into a filter"); 82if (left.NodeType == QilNodeType.Sequence) { 86Debug.Assert(left.NodeType == QilNodeType.Filter, "LocationPathPattern must be compiled into a filter"); 175if (left.NodeType == QilNodeType.Nop) { 182Debug.Assert(left.NodeType == QilNodeType.Filter); 186if (right.NodeType == QilNodeType.Nop) { 193Debug.Assert(right.NodeType == QilNodeType.Filter); 267args.Count == 1 && args[0].NodeType == QilNodeType.LiteralString, 275args[0].NodeType == QilNodeType.LiteralString && args[1].NodeType == QilNodeType.LiteralString, 316Debug.Assert(parent.NodeType == QilNodeType.Filter); 335Debug.Assert(context.Variable.NodeType == QilNodeType.For, "It shouldn't be Let, becaus predicates in PatternBuilder don't produce cached tuples.");