1 write to RootNode
Microsoft.CodeAnalysis.CSharp (1)
Generated\BoundNodes.xml.Generated.cs (1)
4899
this.
RootNode
= rootNode;
11 references to RootNode
Microsoft.CodeAnalysis.CSharp (11)
Binder\SwitchExpressionBinder.cs (1)
87
bool wasAcyclic = TopologicalSort.TryIterativeSort<BoundDecisionDagNode>(SpecializedCollections.SingletonEnumerable(decisionDag.
RootNode
), nonNullSuccessors, out var nodes);
BoundTree\BoundDecisionDag.cs (2)
72
bool wasAcyclic = TopologicalSort.TryIterativeSort<BoundDecisionDagNode>(SpecializedCollections.SingletonEnumerable(this.
RootNode
), Successors, out _topologicallySortedNodes);
108
var newRoot = replacement[this.
RootNode
];
FlowAnalysis\NullableWalker_Patterns.cs (1)
376
nodeStateMap.Add(decisionDag.
RootNode
, (state: PossiblyConditionalState.Create(this), believedReachable: true));
Generated\BoundNodes.xml.Generated.cs (4)
4909
if (rootNode != this.
RootNode
)
9928
this.Visit(node.
RootNode
);
11150
BoundDecisionDagNode rootNode = (BoundDecisionDagNode)this.Visit(node.
RootNode
);
15544
new TreeDumperNode("rootNode", null, new TreeDumperNode[] { Visit(node.
RootNode
, null) }),
Lowering\LocalRewriter\LocalRewriter_IsPatternOperator.cs (3)
20
if (canProduceLinearSequence(decisionDag.
RootNode
, whenTrueLabel: node.WhenTrueLabel, whenFalseLabel: node.WhenFalseLabel))
27
else if (IsFailureNode(decisionDag.
RootNode
, node.WhenFalseLabel))
230
var node = decisionDag.
RootNode
;