1 write to RootNode
Microsoft.CodeAnalysis.CSharp (1)
Generated\BoundNodes.xml.Generated.cs (1)
5051
this.
RootNode
= rootNode;
12 references to RootNode
Microsoft.CodeAnalysis.CSharp (12)
Binder\SwitchExpressionBinder.cs (1)
98
bool wasAcyclic = TopologicalSort.TryIterativeSort(decisionDag.
RootNode
, addNonNullSuccessors, out var nodes);
BoundTree\BoundDecisionDag.cs (2)
78
bool wasAcyclic = TopologicalSort.TryIterativeSort(this.
RootNode
, AddSuccessors, out _topologicallySortedNodes);
114
var newRoot = replacement[this.
RootNode
];
FlowAnalysis\NullableWalker_Patterns.cs (1)
419
nodeStateMap.Add(decisionDag.
RootNode
, (state: PossiblyConditionalState.Create(this), believedReachable: true));
Generated\BoundNodes.xml.Generated.cs (4)
5063
if (rootNode != this.
RootNode
|| suitableForLowering != this.SuitableForLowering)
10563
this.Visit(node.
RootNode
);
11949
BoundDecisionDagNode rootNode = (BoundDecisionDagNode)this.Visit(node.
RootNode
);
16631
new TreeDumperNode("rootNode", null, new TreeDumperNode[] { Visit(node.
RootNode
, null) }),
Lowering\LocalRewriter\LocalRewriter_IsPatternOperator.cs (4)
27
if (canProduceLinearSequence(decisionDag.
RootNode
, whenTrueLabel: node.WhenTrueLabel, whenFalseLabel: node.WhenFalseLabel))
32
else if (IsFailureNode(decisionDag.
RootNode
, node.WhenFalseLabel))
42
decisionDag.
RootNode
,
272
var node = decisionDag.
RootNode
;