Code:
/ Dotnetfx_Vista_SP2 / Dotnetfx_Vista_SP2 / 8.0.50727.4016 / DEVDIV / depot / DevDiv / releases / whidbey / NetFxQFE / ndp / fx / src / XmlUtils / System / Xml / Xsl / QIL / QilValidationVisitor.cs / 1 / QilValidationVisitor.cs
//------------------------------------------------------------------------------ //// Copyright (c) Microsoft Corporation. All rights reserved. // //[....] //----------------------------------------------------------------------------- using System.Collections; using System.Diagnostics; namespace System.Xml.Xsl.Qil { using Res = System.Xml.Utils.Res; ///A internal class that validates QilExpression graphs. ////// QilValidationVisitor traverses the QilExpression graph once to enforce the following constraints: /// /// internal class QilValidationVisitor : QilScopedVisitor { private SubstitutionList subs = new SubstitutionList(); private QilTypeChecker typeCheck = new QilTypeChecker(); //----------------------------------------------- // Entry //----------------------------------------------- [Conditional("DEBUG")] public static void Validate(QilNode node) { Debug.Assert(node != null); new QilValidationVisitor().VisitAssumeReference(node); } protected QilValidationVisitor() {} #if DEBUG protected Hashtable allNodes = new ObjectHashtable(); protected Hashtable parents = new ObjectHashtable(); protected Hashtable scope = new ObjectHashtable(); //----------------------------------------------- // QilVisitor overrides //----------------------------------------------- protected override QilNode VisitChildren(QilNode parent) { if (this.parents.Contains(parent)) { // We have already visited the node that starts the infinite loop, but don't visit its children SetError(parent, "Infinite loop"); } else if (AddNode(parent)) { if (parent.XmlType == null) { SetError(parent, "Type information missing"); } else { XmlQueryType type = this.typeCheck.Check(parent); // if (!type.IsSubtypeOf(parent.XmlType)) SetError(parent, "Type information was not correctly inferred"); } this.parents.Add(parent, parent); for (int i = 0; i < parent.Count; i++) { if (parent[i] == null) { // Allow parameter name and default value to be null if (parent.NodeType == QilNodeType.Parameter) continue; // Do not allow null anywhere else in the graph else SetError(parent, "Child " + i + " must not be null"); } if (parent.NodeType == QilNodeType.GlobalVariableList || parent.NodeType == QilNodeType.GlobalParameterList || parent.NodeType == QilNodeType.FunctionList) { if (((QilReference) parent[i]).DebugName == null) SetError(parent[i], "DebugName must not be null"); } // If child is a reference, then call VisitReference instead of Visit in order to avoid circular visits. if (IsReference(parent, i)) VisitReference(parent[i]); else Visit(parent[i]); } this.parents.Remove(parent); } return parent; } //////
///- No circular references
///- No duplicate nodes (except for references)
///- No out-of-scope references
///- Type constraints on operands
///- Type constraints on operators
///- No null objects (except where allowed)
///- No Unknown node types
///When an error occurs, it marks the offending node with an annotation and continues checking, /// allowing the detection of multiple errors at once and printing the structure after validation. /// (In the case of circular references, it breaks the loop at the circular reference to allow the graph /// to print correctly.)
////// Ensure that the function or iterator reference is already in scope. /// protected override QilNode VisitReference(QilNode node) { if (!this.scope.Contains(node)) SetError(node, "Out-of-scope reference"); return node; } //----------------------------------------------- // QilScopedVisitor overrides //----------------------------------------------- ////// Add an iterator or function to scope if it hasn't been added already. /// protected override void BeginScope(QilNode node) { if (this.scope.Contains(node)) SetError(node, "Reference already in scope"); else this.scope.Add(node, node); } ////// Pop scope. /// protected override void EndScope(QilNode node) { this.scope.Remove(node); } //----------------------------------------------- // Helper methods //----------------------------------------------- private class ObjectHashtable : Hashtable { protected override bool KeyEquals(object item, object key) { return item == key; } } private bool AddNode(QilNode n) { if (!this.allNodes.Contains(n)) { this.allNodes.Add(n, n); return true; } else { SetError(n, "Duplicate " + n.NodeType + " node"); return false; } } #endif // DEBUG [Conditional("DEBUG")] internal static void SetError(QilNode n, string message) { message = Res.GetString(Res.Qil_Validation, message); #if QIL_TRACE_NODE_CREATION message += " ["+ n.NodeId + " (" + n.NodeType.ToString("G") + ")]"; #endif string s = n.Annotation as string; if (s != null) { message = s + "\n" + message; } n.Annotation = message; Debug.Assert(false, message); } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007. //------------------------------------------------------------------------------ //// Copyright (c) Microsoft Corporation. All rights reserved. // //[....] //----------------------------------------------------------------------------- using System.Collections; using System.Diagnostics; namespace System.Xml.Xsl.Qil { using Res = System.Xml.Utils.Res; ///A internal class that validates QilExpression graphs. ////// QilValidationVisitor traverses the QilExpression graph once to enforce the following constraints: /// /// internal class QilValidationVisitor : QilScopedVisitor { private SubstitutionList subs = new SubstitutionList(); private QilTypeChecker typeCheck = new QilTypeChecker(); //----------------------------------------------- // Entry //----------------------------------------------- [Conditional("DEBUG")] public static void Validate(QilNode node) { Debug.Assert(node != null); new QilValidationVisitor().VisitAssumeReference(node); } protected QilValidationVisitor() {} #if DEBUG protected Hashtable allNodes = new ObjectHashtable(); protected Hashtable parents = new ObjectHashtable(); protected Hashtable scope = new ObjectHashtable(); //----------------------------------------------- // QilVisitor overrides //----------------------------------------------- protected override QilNode VisitChildren(QilNode parent) { if (this.parents.Contains(parent)) { // We have already visited the node that starts the infinite loop, but don't visit its children SetError(parent, "Infinite loop"); } else if (AddNode(parent)) { if (parent.XmlType == null) { SetError(parent, "Type information missing"); } else { XmlQueryType type = this.typeCheck.Check(parent); // if (!type.IsSubtypeOf(parent.XmlType)) SetError(parent, "Type information was not correctly inferred"); } this.parents.Add(parent, parent); for (int i = 0; i < parent.Count; i++) { if (parent[i] == null) { // Allow parameter name and default value to be null if (parent.NodeType == QilNodeType.Parameter) continue; // Do not allow null anywhere else in the graph else SetError(parent, "Child " + i + " must not be null"); } if (parent.NodeType == QilNodeType.GlobalVariableList || parent.NodeType == QilNodeType.GlobalParameterList || parent.NodeType == QilNodeType.FunctionList) { if (((QilReference) parent[i]).DebugName == null) SetError(parent[i], "DebugName must not be null"); } // If child is a reference, then call VisitReference instead of Visit in order to avoid circular visits. if (IsReference(parent, i)) VisitReference(parent[i]); else Visit(parent[i]); } this.parents.Remove(parent); } return parent; } //////
///- No circular references
///- No duplicate nodes (except for references)
///- No out-of-scope references
///- Type constraints on operands
///- Type constraints on operators
///- No null objects (except where allowed)
///- No Unknown node types
///When an error occurs, it marks the offending node with an annotation and continues checking, /// allowing the detection of multiple errors at once and printing the structure after validation. /// (In the case of circular references, it breaks the loop at the circular reference to allow the graph /// to print correctly.)
////// Ensure that the function or iterator reference is already in scope. /// protected override QilNode VisitReference(QilNode node) { if (!this.scope.Contains(node)) SetError(node, "Out-of-scope reference"); return node; } //----------------------------------------------- // QilScopedVisitor overrides //----------------------------------------------- ////// Add an iterator or function to scope if it hasn't been added already. /// protected override void BeginScope(QilNode node) { if (this.scope.Contains(node)) SetError(node, "Reference already in scope"); else this.scope.Add(node, node); } ////// Pop scope. /// protected override void EndScope(QilNode node) { this.scope.Remove(node); } //----------------------------------------------- // Helper methods //----------------------------------------------- private class ObjectHashtable : Hashtable { protected override bool KeyEquals(object item, object key) { return item == key; } } private bool AddNode(QilNode n) { if (!this.allNodes.Contains(n)) { this.allNodes.Add(n, n); return true; } else { SetError(n, "Duplicate " + n.NodeType + " node"); return false; } } #endif // DEBUG [Conditional("DEBUG")] internal static void SetError(QilNode n, string message) { message = Res.GetString(Res.Qil_Validation, message); #if QIL_TRACE_NODE_CREATION message += " ["+ n.NodeId + " (" + n.NodeType.ToString("G") + ")]"; #endif string s = n.Annotation as string; if (s != null) { message = s + "\n" + message; } n.Annotation = message; Debug.Assert(false, message); } } } // File provided for Reference Use Only by Microsoft Corporation (c) 2007.
Link Menu
This book is available now!
Buy at Amazon US or
Buy at Amazon UK
- ListItemCollection.cs
- Image.cs
- ApplicationBuildProvider.cs
- BlockCollection.cs
- FileLogRecordEnumerator.cs
- ImageKeyConverter.cs
- ReferenceEqualityComparer.cs
- AnimationClock.cs
- TextServicesLoader.cs
- EntityContainerEntitySet.cs
- EntityDataSourceDesigner.cs
- SchemaAttDef.cs
- ArgumentOutOfRangeException.cs
- ConnectionPoint.cs
- CodeEntryPointMethod.cs
- ContainerVisual.cs
- SchemaMapping.cs
- DesignerActionPropertyItem.cs
- HMACRIPEMD160.cs
- CallContext.cs
- PointCollection.cs
- EventHandlersStore.cs
- ToolboxComponentsCreatedEventArgs.cs
- WindowsTreeView.cs
- DataPagerFieldItem.cs
- HttpRawResponse.cs
- SymDocumentType.cs
- Adorner.cs
- WorkflowDebuggerSteppingAttribute.cs
- SamlConditions.cs
- SecureConversationServiceElement.cs
- MemberDescriptor.cs
- TheQuery.cs
- OuterGlowBitmapEffect.cs
- PreservationFileWriter.cs
- InvariantComparer.cs
- TlsnegoTokenProvider.cs
- DispatcherOperation.cs
- FixedSOMFixedBlock.cs
- NamespaceCollection.cs
- RawStylusSystemGestureInputReport.cs
- AddingNewEventArgs.cs
- HttpCookiesSection.cs
- TreeNodeStyleCollection.cs
- GlyphRunDrawing.cs
- XmlConvert.cs
- Annotation.cs
- InfoCardSymmetricAlgorithm.cs
- WebBrowser.cs
- RC2CryptoServiceProvider.cs
- ClassData.cs
- Compiler.cs
- EventSourceCreationData.cs
- PropertyGrid.cs
- Pair.cs
- MenuItemStyle.cs
- JsonEncodingStreamWrapper.cs
- WebBrowser.cs
- TimeSpanHelper.cs
- FormatterServices.cs
- ContextMenuService.cs
- SqlNodeAnnotations.cs
- GcSettings.cs
- StartUpEventArgs.cs
- ThemeDirectoryCompiler.cs
- ServiceAuthorizationManager.cs
- CompositeControl.cs
- MediaCommands.cs
- HttpModule.cs
- Span.cs
- CapabilitiesPattern.cs
- PropertyDescriptorGridEntry.cs
- FieldNameLookup.cs
- SynchronousChannelMergeEnumerator.cs
- FlowNode.cs
- SqlEnums.cs
- ButtonBaseAdapter.cs
- AttributeProviderAttribute.cs
- EventWaitHandle.cs
- MethodCallExpression.cs
- VisualStyleRenderer.cs
- BezierSegment.cs
- RectConverter.cs
- TabletDeviceInfo.cs
- ObjectDataSourceDesigner.cs
- SerializationObjectManager.cs
- LabelDesigner.cs
- ShellProvider.cs
- WindowsTab.cs
- FixedSOMLineCollection.cs
- WindowsBrush.cs
- SafeMarshalContext.cs
- StyleBamlTreeBuilder.cs
- AttributeQuery.cs
- SHA512Managed.cs
- PeerMessageDispatcher.cs
- ListenerChannelContext.cs
- SHA256.cs
- DataPagerFieldItem.cs
- TextElement.cs