1 write to Next
Microsoft.CodeAnalysis.CSharp (1)
Generated\BoundNodes.xml.Generated.cs (1)
5096
this.
Next
= next;
25 references to Next
Microsoft.CodeAnalysis.CSharp (25)
Binder\PatternExplainer.cs (5)
63
distanceInfo = (Math.Max(reachabilityInfo?.Contains(new NullableWalker.DecisionDagReachabilityInfo(e, whenTrue: true)) == false ? infinity : 0, distance(e.
Next
)), e.
Next
);
102
n = e.
Next
;
203
if (evaluation.
Next
is not null)
206
stack.Push(evaluation.
Next
);
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)
536
gotoNodeWithCurrentState(p.
Next
, nodeBelievedReachable, from: p, whenTrueBranch: true);
Generated\BoundNodes.xml.Generated.cs (4)
5107
if (evaluation != this.Evaluation || next != this.
Next
)
10568
this.Visit(node.
Next
);
11954
BoundDecisionDagNode next = (BoundDecisionDagNode)this.Visit(node.
Next
);
16638
new TreeDumperNode("next", null, new TreeDumperNode[] { Visit(node.
Next
, null) }),
Lowering\LocalRewriter\LocalRewriter_IsPatternOperator.cs (3)
72
node = e.
Next
;
251
node = evalNode.
Next
;
261
node = e.
Next
;
Lowering\LocalRewriter\LocalRewriter.DecisionDagRewriter.cs (4)
82
notePredecessor(e.
Next
);
450
var whenTrue = evaluationNode.
Next
;
1223
if (nextNode != evaluationNode.
Next
)
1226
_loweredDecisionDag.Add(_factory.Goto(GetDagNodeLabel(evaluationNode.
Next
)));
Lowering\LocalRewriter\LocalRewriter.PatternLocalRewriter.cs (1)
702
return replacement[evalNode.
Next
];