1 write to Next
Microsoft.CodeAnalysis.CSharp (1)
Generated\BoundNodes.xml.Generated.cs (1)
5055
this.
Next
= next;
24 references to Next
Microsoft.CodeAnalysis.CSharp (24)
Binder\PatternExplainer.cs (4)
56
BoundEvaluationDecisionDagNode e => (distance(e.
Next
), e.
Next
),
80
n = e.
Next
;
154
if (!exploreToNode(evaluation.
Next
, currentRequiresFalseWhenClause))
BoundTree\BoundDecisionDag.cs (2)
29
builder.Add(p.
Next
);
127
return p.Update(p.Evaluation, replacement[p.
Next
]);
BoundTree\BoundDecisionDagNode.cs (5)
26
return n1.Evaluation.Equals(n2.Evaluation) && n1.
Next
== n2.
Next
;
43
return Hash.Combine(n.Evaluation.GetHashCode(), RuntimeHelpers.GetHashCode(n.
Next
));
91
builder.Append(node.
Next
!= null
92
? $"[{node.
Next
.Id}]"
FlowAnalysis\NullableWalker_Patterns.cs (1)
585
gotoNodeWithCurrentState(p.
Next
, nodeBelievedReachable);
Generated\BoundNodes.xml.Generated.cs (4)
5066
if (evaluation != this.Evaluation || next != this.
Next
)
10292
this.Visit(node.
Next
);
11552
BoundDecisionDagNode next = (BoundDecisionDagNode)this.Visit(node.
Next
);
16112
new TreeDumperNode("next", null, new TreeDumperNode[] { Visit(node.
Next
, null) }),
Lowering\LocalRewriter\LocalRewriter.DecisionDagRewriter.cs (4)
82
notePredecessor(e.
Next
);
450
var whenTrue = evaluationNode.
Next
;
1215
if (nextNode != evaluationNode.
Next
)
1218
_loweredDecisionDag.Add(_factory.Goto(GetDagNodeLabel(evaluationNode.
Next
)));
Lowering\LocalRewriter\LocalRewriter.PatternLocalRewriter.cs (1)
667
return replacement[evalNode.
Next
];
Lowering\LocalRewriter\LocalRewriter_IsPatternOperator.cs (3)
72
node = e.
Next
;
251
node = evalNode.
Next
;
261
node = e.
Next
;