137 references to Child
System.Text.RegularExpressions.Generator (137)
RegexGenerator.cs (1)
340
if (HasCaseInsensitiveBackReferences(node.
Child
(i)))
RegexGenerator.Emitter.cs (40)
70
DescribeExpressionAsXmlComment(writer, regexMethod.Tree.Root.
Child
(0), regexMethod); // skip implicit root capture
631
RegexNode root = rm.Tree.Root.
Child
(0);
1486
node = node.
Child
(0);
1696
if (rm.Analysis.MayBacktrack(node.
Child
(i)))
1718
if (node.
Child
(i).FindStartingLiteralNode(allowZeroWidth: false) is not RegexNode startingLiteralNode ||
1802
RegexNode child = node.
Child
(i);
1835
case RegexNodeKind.Concatenate when child.
Child
(0) == startingLiteralNode && (startingLiteralNode.Kind is RegexNodeKind.One or RegexNodeKind.Set or RegexNodeKind.Multi):
1843
RegexNode originalFirst = child.
Child
(0);
1845
child.
Child
(0).Kind is RegexNodeKind.Multi ?
1846
SliceOffMultiFirstChar(child.
Child
(0)) : // multi, so slice off the first character
2001
EmitNode(node.
Child
(i));
2197
RegexNode yesBranch = node.
Child
(0);
2198
RegexNode? noBranch = node.
Child
(1) is { Kind: not RegexNodeKind.Empty } childNo ? childNo : null;
2369
RegexNode condition = node.
Child
(0);
2373
RegexNode yesBranch = node.
Child
(1);
2374
RegexNode? noBranch = node.
Child
(2) is { Kind: not RegexNodeKind.Empty } childNo ? childNo : null;
2567
RegexNode child = node.
Child
(0);
2663
RegexNode child = node.
Child
(0);
2715
RegexNode child = node.
Child
(0);
2834
case RegexNodeKind.Atomic when !rm.Analysis.MayBacktrack(node.
Child
(0)):
2835
EmitNode(node.
Child
(0));
2936
Debug.Assert(rm.Analysis.MayBacktrack(node.
Child
(0)));
2963
Debug.Assert(rm.Analysis.MayBacktrack(node.
Child
(0)), "Expected child to potentially backtrack");
2977
EmitNode(node.
Child
(0), subsequent);
3038
RegexNode child = node.
Child
(i);
3091
EmitNode(node.
Child
(i), GetSubsequentOrDefault(i, node, subsequent), emitLengthChecksIfRequired: false);
3105
EmitNode(node.
Child
(i), GetSubsequentOrDefault(i, node, subsequent), emitLengthChecksIfRequired: emitLengthChecksIfRequired);
3118
RegexNode next = node.
Child
(i);
3708
RegexNode child = node.
Child
(0);
4301
Debug.Assert(!rm.Analysis.MayBacktrack(node.
Child
(0)), $"Expected non-backtracking node {node.Kind}");
4310
EmitNode(node.
Child
(0));
4321
RegexNode child = node.
Child
(0);
5568
RegexNodeKind.Atomic when node.
Child
(0).Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop or RegexNodeKind.Alternate => true,
5581
RegexNodeKind.ExpressionConditional when node.Parent.
Child
(0) == node => "Condition: ",
5582
RegexNodeKind.ExpressionConditional when node.Parent.
Child
(1) == node => "Matched: ",
5583
RegexNodeKind.ExpressionConditional when node.Parent.
Child
(2) == node => "Not Matched: ",
5585
RegexNodeKind.BackreferenceConditional when node.Parent.
Child
(0) == node => "Matched: ",
5586
RegexNodeKind.BackreferenceConditional when node.Parent.
Child
(1) == node => "Not Matched: ",
5613
DescribeExpressionAsXmlComment(writer, node.
Child
(i), rm, depth);
5615
node = node.
Child
(childCount - 1);
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexFindOptimizations.cs (1)
26
RegexFindOptimizations positiveLookaheadOpts = new(positiveLookahead.
Child
(0), options, isLeadingPartial: true);
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (59)
215
RegexNode child = node.
Child
(i);
369
RegexNode node = rootNode.
Child
(0); // skip implicit root capture node
376
node = node.
Child
(0);
381
node = node.
Child
(0);
441
node = node.
Child
(0);
452
RegexNode existingChild = node.
Child
(node.ChildCount() - 1);
473
node.
Child
(i).EliminateEndingBacktracking();
478
node = node.
Child
(0);
501
node = node.
Child
(0);
564
1 =>
Child
(0),
583
u = u.
Child
(0);
609
RegexNode child =
Child
(0);
613
child = atomic.
Child
(0);
746
child = atomic.
Child
(0);
777
RegexNode child = u.
Child
(0);
846
RegexNode child = u.
Child
(0);
933
return
Child
(0);
1104
RegexNode required = children[startingIndex].
Child
(0);
1124
RegexNode other = children[endingIndex].
Child
(0);
1317
ProcessOneOrMulti(branch.Kind == RegexNodeKind.Concatenate ? branch.
Child
(0) : branch, startingSpan);
1369
return alternation.ChildCount() == 1 ? alternation.
Child
(0) : alternation;
1382
RegexNode branch = Kind == RegexNodeKind.Concatenate ?
Child
(0) : this;
1419
node = node.
Child
(0);
1512
return
Child
(0);
1519
RegexNode child =
Child
(i);
1822
Child
(i).FindAndMakeLoopsAtomic();
1854
node = node.
Child
(node.ChildCount() - 1);
1921
ProcessNode(node.
Child
(b), subsequent);
1942
node = node.
Child
(0);
1947
node = node.
Child
(0);
1959
RegexNode lastConcatChild = node.
Child
(concatCount - 1);
1960
if (CanBeMadeAtomic(lastConcatChild, node.
Child
(0), iterateNullableSubsequent: false, allowLazy: false))
1989
if (
Child
(0).Kind == RegexNodeKind.Empty)
2036
RegexNode condition =
Child
(0);
2039
ReplaceChild(0, condition.
Child
(0));
2044
condition =
Child
(0);
2081
subsequent = subsequent.
Child
(0);
2107
if (!CanBeMadeAtomic(node, subsequent.
Child
(i), iterateNullableSubsequent, allowLazy: false))
2291
return (int)Math.Min(int.MaxValue - 1, (long)M *
Child
(0).ComputeMinLength());
2298
int min =
Child
(0).ComputeMinLength();
2301
min = Math.Min(min,
Child
(i).ComputeMinLength());
2308
return Math.Min(
Child
(0).ComputeMinLength(),
Child
(1).ComputeMinLength());
2312
return Math.Min(
Child
(1).ComputeMinLength(),
Child
(2).ComputeMinLength());
2321
sum +=
Child
(i).ComputeMinLength();
2331
return
Child
(0).ComputeMinLength();
2399
if (
Child
(0).ComputeMaxLength() is int childMaxLength)
2415
if (
Child
(0).ComputeMaxLength() is not int maxLength)
2422
if (
Child
(i).ComputeMaxLength() is not int next)
2438
return
Child
(i).ComputeMaxLength() is int yes &&
Child
(i + 1).ComputeMaxLength() is int no ?
2450
if (
Child
(i).ComputeMaxLength() is not int length)
2469
return
Child
(0).ComputeMaxLength();
2531
RegexNode child =
Child
(i);
2649
RegexNode child =
Child
(childIndex);
2657
child =
Child
(exclusiveEnd);
2825
if (ExceedsMaxDepthAllowedDepth(node.
Child
(i), allowedDepth - 1))
2858
curNode = curNode.
Child
(curChild);
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (35)
86
node = node.
Child
(0);
217
if (!FindPrefixesCore(node.
Child
(i), results, ignoreCase))
231
if (!FindPrefixesCore(node.
Child
(0), results, ignoreCase))
258
_ = FindPrefixesCore(node.
Child
(i), alternateBranchResults, ignoreCase);
368
if (!Process(node.
Child
(i), ref vsb))
385
Process(node.
Child
(0), ref vsb);
401
Process(node.
Child
(i), ref alternateSb);
445
if (!Process(node.
Child
(0), ref vsb))
456
return Process(node.
Child
(0), ref vsb);
494
node = node.
Child
(0);
684
return TryFindRawFixedSets(node.
Child
(0), results, ref distance, thorough);
693
TryFindRawFixedSets(node.
Child
(0), results, ref distance, thorough);
701
if (!TryFindRawFixedSets(node.
Child
(i), results, ref distance, thorough))
721
allSameSize &= TryFindRawFixedSets(node.
Child
(i), localResults, ref localDistance, thorough);
1022
return TryFindFirstCharClass(node.
Child
(0), ref cc);
1029
return TryFindFirstCharClass(node.
Child
(0), ref cc) switch
1045
bool? childResult = TryFindFirstCharClass(node.
Child
(i), ref cc);
1063
bool? childResult = TryFindFirstCharClass(node.
Child
(i), ref cc);
1081
return (TryFindFirstCharClass(node.
Child
(branchStart), ref cc), TryFindFirstCharClass(node.
Child
(branchStart + 1), ref cc)) switch
1116
node = node.
Child
(0);
1130
RegexNode firstChild = node.
Child
(0);
1133
firstChild = firstChild.
Child
(0);
1142
RegexNode nextChild = node.
Child
(1);
1150
nextChild = node.
Child
(2);
1203
nextChild = nextChild.
Child
(0);
1276
node = node.
Child
(0);
1282
FindLeadingPositiveLookahead(node.
Child
(0), ref positiveLookahead);
1290
if (!FindLeadingPositiveLookahead(node.
Child
(i), ref positiveLookahead))
1348
node = node.
Child
(0);
1363
RegexNode tmpChild = node.
Child
(i);
1393
if (node.
Child
(i).Kind is not (RegexNodeKind.Empty or RegexNodeKind.PositiveLookaround or RegexNodeKind.NegativeLookaround))
1395
child = node.
Child
(i);
1458
RegexNodeKind anchor = FindLeadingOrTrailingAnchor(node.
Child
(0), leading);
1469
if (FindLeadingOrTrailingAnchor(node.
Child
(i), leading) != anchor)
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexTreeAnalyzer.cs (1)
85
RegexNode child = node.
Child
(i);