10 writes to M
System.Text.RegularExpressions.Generator (10)
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (10)
75
M
= m;
82
M
= m;
98
newNode.
M
= M - 1;
153
M
= min;
188
M
= N = 0;
826
u.
M
= min = ((int.MaxValue - 1) / u.M < min) ? int.MaxValue : u.M * min;
1684
currentNode.
M
+= nextNode.M;
1698
currentNode.
M
++;
1725
currentNode.
M
+= matchingCharsInMulti;
1767
currentNode.
M
= nextNode.M + 1;
161 references to M
System.Text.RegularExpressions.Generator (161)
RegexGenerator.Emitter.cs (55)
1377
if (target.LoopNode.
M
> 0)
1402
if (target.LoopNode.
M
> 0)
1423
if (target.LoopNode.
M
> 0)
1427
using (EmitBlock(writer, $"if ((i - prev - 1) < {target.LoopNode.
M
})"))
2118
int capnum = RegexParser.MapCaptureNumber(node.
M
, rm.Tree.CaptureNumberSparseMapping);
2130
writer.WriteLine($"// If the {DescribeCapture(node.
M
, rm)} hasn't matched, the backreference matches with RegexOptions.ECMAScript rules.");
2138
writer.WriteLine($"// If the {DescribeCapture(node.
M
, rm)} hasn't matched, the backreference doesn't match.");
2193
int capnum = RegexParser.MapCaptureNumber(node.
M
, rm.Tree.CaptureNumberSparseMapping);
2208
writer.WriteLine($"// The {DescribeCapture(node.
M
, rm)} captured a value. Match the first branch.");
2548
int capnum = RegexParser.MapCaptureNumber(node.
M
, rm.Tree.CaptureNumberSparseMapping);
3058
child.
M
== child.N &&
3059
child.
M
<= MaxUnrollSize)
3061
int repeatCount = child.Kind is RegexNodeKind.One or RegexNodeKind.Notone or RegexNodeKind.Set ? 1 : child.
M
;
3328
if (node.
M
== node.N)
3338
Debug.Assert(node.
M
< node.N);
3363
EmitAdd(writer, startingPos, !rtl ? node.
M
: -node.
M
);
3461
if (node.
M
> 0)
3468
if (node.
M
== node.N || rm.Analysis.IsAtomicByAncestor(node))
3473
if (node.
M
> 0)
3479
Debug.Assert(node.
M
< node.N);
3492
maxIterations = $"{node.N - node.
M
}";
3704
Debug.Assert(node.
M
< int.MaxValue, $"Unexpected M={node.
M
}");
3705
Debug.Assert(node.N >= node.
M
, $"Unexpected M={node.
M
}, N={node.N}");
3709
int minIterations = node.
M
;
4015
int iterations = node.
M
;
4130
if (node.
M
== node.N)
4137
if (node.
M
== 0 && node.N == 1)
4143
Debug.Assert(node.N > node.
M
);
4144
int minIterations = node.
M
;
4260
Debug.Assert(node.
M
== 0 && node.N == 1);
4298
Debug.Assert(node.
M
< int.MaxValue, $"Unexpected M={node.
M
}");
4299
Debug.Assert(node.
M
== node.N, $"Unexpected M={node.
M
} == N={node.N}");
4308
using (EmitBlock(writer, $"for (int {i} = 0; {i} < {node.
M
}; {i}++)"))
4318
Debug.Assert(node.
M
< int.MaxValue, $"Unexpected M={node.
M
}");
4319
Debug.Assert(node.N >= node.
M
, $"Unexpected M={node.
M
}, N={node.N}");
4323
int minIterations = node.
M
;
5469
RegexNodeKind.Capture when node.
M
== -1 && node.N != -1 => $"Non-capturing balancing group. Uncaptures the {DescribeCapture(node.N, rm)}.",
5470
RegexNodeKind.Capture when node.N != -1 => $"Balancing group. Captures the {DescribeCapture(node.
M
, rm)} and uncaptures the {DescribeCapture(node.N, rm)}.",
5471
RegexNodeKind.Capture when node.N == -1 => $"{DescribeCapture(node.
M
, rm)}.",
5478
RegexNodeKind.Loop or RegexNodeKind.Lazyloop => node.
M
== 0 && node.N == 1 ? $"Optional ({(node.Kind is RegexNodeKind.Loop ? "greedy" : "lazy")})." : $"Loop {DescribeLoop(node, rm)}{direction}.",
5488
RegexNodeKind.Backreference => $"Match the same text as matched by the {DescribeCapture(node.
M
, rm)}{direction}.",
5494
RegexNodeKind.BackreferenceConditional => $"Conditionally match one of two expressions depending on whether the {DescribeCapture(node.
M
, rm)} matched.",
5625
_ when node.
M
== node.N => "exactly",
5634
node.
M
== node.N ? $" {node.
M
} times" :
5635
(node.
M
, node.N) switch
5640
(_, int.MaxValue) => $" at least {node.
M
} times",
5643
_ => $" at least {node.
M
} and at most {node.N} times"
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNode.cs (63)
92
Debug.Assert(
M
> 0);
98
newNode.M =
M
- 1;
172
N =
M
;
492
node.N = node.
M
;
772
int min =
M
;
817
if (u.
M
== 0 && child.
M
> 1 || child.N < child.
M
* 2)
824
if (u.
M
> 0)
826
u.M = min = ((int.MaxValue - 1) / u.
M
< min) ? int.MaxValue : u.
M
* min;
852
child.MakeRep(u.Kind == RegexNodeKind.Lazyloop ? RegexNodeKind.Onelazy : RegexNodeKind.Oneloop, u.
M
, u.N);
1109
case RegexNodeKind.Oneloop or RegexNodeKind.Notoneloop or RegexNodeKind.Setloop or RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy or RegexNodeKind.Setlazy when required.
M
== required.N:
1127
required.
M
!= other.
M
||
1389
Debug.Assert(Kind is RegexNodeKind.One or RegexNodeKind.Multi || (IsOneFamily &&
M
> 0));
1405
case RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy when node.
M
> 0:
1407
case RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy when node.
M
> 0:
1409
case RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy when node.
M
> 0:
1417
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
> 0:
1669
if (nextNode.
M
> 0 &&
1679
if (!CanCombineCounts(currentNode.
M
, currentNode.N, nextNode.
M
, nextNode.N))
1684
currentNode.M += nextNode.
M
;
1696
if (CanCombineCounts(currentNode.
M
, currentNode.N, 1, 1))
1722
if (CanCombineCounts(currentNode.
M
, currentNode.N, matchingCharsInMulti, matchingCharsInMulti))
1764
if (CanCombineCounts(1, 1, nextNode.
M
, nextNode.N))
1767
currentNode.M = nextNode.
M
+ 1;
2080
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when subsequent.
M
> 0:
2127
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && node.Ch != subsequent.Ch:
2128
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when subsequent.
M
> 0 && node.Ch == subsequent.Ch:
2129
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
> 0 && !RegexCharClass.CharInClass(node.Ch, subsequent.Str!):
2135
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && node.Ch != subsequent.Ch:
2136
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when subsequent.
M
== 0 && node.Ch == subsequent.Ch:
2137
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
== 0 && !RegexCharClass.CharInClass(node.Ch, subsequent.Str!):
2138
case RegexNodeKind.Boundary when node.
M
> 0 && RegexCharClass.IsBoundaryWordChar(node.Ch):
2139
case RegexNodeKind.NonBoundary when node.
M
> 0 && !RegexCharClass.IsBoundaryWordChar(node.Ch):
2140
case RegexNodeKind.ECMABoundary when node.
M
> 0 && RegexCharClass.IsECMAWordChar(node.Ch):
2141
case RegexNodeKind.NonECMABoundary when node.
M
> 0 && !RegexCharClass.IsECMAWordChar(node.Ch):
2155
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && node.Ch == subsequent.Ch:
2160
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && node.Ch == subsequent.Ch:
2175
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && !RegexCharClass.CharInClass(subsequent.Ch, node.Str!):
2176
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
> 0 && !RegexCharClass.MayOverlap(node.Str!, subsequent.Str!):
2182
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && !RegexCharClass.CharInClass(subsequent.Ch, node.Str!):
2183
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
== 0 && !RegexCharClass.MayOverlap(node.Str!, subsequent.Str!):
2184
case RegexNodeKind.Boundary when node.
M
> 0 && node.Str is RegexCharClass.WordClass or RegexCharClass.DigitClass:
2185
case RegexNodeKind.NonBoundary when node.
M
> 0 && node.Str is RegexCharClass.NotWordClass or RegexCharClass.NotDigitClass:
2186
case RegexNodeKind.ECMABoundary when node.
M
> 0 && node.Str is RegexCharClass.ECMAWordClass or RegexCharClass.ECMADigitClass:
2187
case RegexNodeKind.NonECMABoundary when node.
M
> 0 && node.Str is RegexCharClass.NotECMAWordClass or RegexCharClass.NotDigitClass:
2286
return
M
;
2291
return (int)Math.Min(int.MaxValue - 1, (long)
M
* Child(0).ComputeMinLength());
2559
(child.Kind is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic && child.
M
== child.N))
2568
vsb.Append((char)(twoChars[0] | 0x20), child.Kind is RegexNodeKind.Set ? 1 : child.
M
);
2645
when node.
M
== node.N => true,
2905
sb.Append(' ').Append($"index = {
M
}");
2913
sb.Append(' ').Append($"index = {
M
}");
2945
(
M
== 0 && N == int.MaxValue) ? "*" :
2946
(
M
== 0 && N == 1) ? "?" :
2947
(
M
== 1 && N == int.MaxValue) ? "+" :
2948
(N == int.MaxValue) ? $"{{{
M
}, *}}" :
2949
(N ==
M
) ? $"{{{
M
}}}" :
2950
$"{{{
M
}, {N}}}");
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexNodeKind.cs (14)
31
/// The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
36
/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
40
/// <remarks>The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
45
/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
49
/// <remarks>The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
53
/// <remarks>The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.</remarks>
59
/// The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
65
/// The character is specified in <see cref="RegexNode.Ch"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
71
/// The <see cref="RegexCharClass"/> set string is specified in <see cref="RegexNode.Str"/>, the minimum number of iterations in <see cref="RegexNode.
M
"/>, and the maximum number of iterations in <see cref="RegexNode.N"/>.
77
/// <remarks>The capture group number referenced is stored in <see cref="RegexNode.
M
"/>.</remarks>
128
/// One and only one child, the expression in the loop. The minimum number of iterations is in <see cref="RegexNode.
M
"/>,
134
/// One and only one child, the expression in the loop. The minimum number of iterations is in <see cref="RegexNode.
M
"/>,
141
/// One and only one child, the expression in the capture. <see cref="RegexNode.
M
"/> is the number of the capture, and if a balancing
169
/// The referenced capture group number is stored in <see cref="RegexNode.
M
"/>.
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexOpcode.cs (1)
151
/// For quantified constructs with a minimum of zero (<see cref="RegexNode.
M
"/> == 0), this opcode pushes a counter
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexPrefixAnalyzer.cs (26)
114
int reps = node.Kind is RegexNodeKind.One ? 1 : Math.Min(node.
M
, MaxPrefixLength);
164
int reps = node.Kind is RegexNodeKind.Set ? 1 : Math.Min(node.
M
, MaxPrefixLength);
226
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
> 0:
228
int limit = Math.Min(node.
M
, MaxPrefixLength); // MaxPrefixLength here is somewhat arbitrary, as a single loop iteration could yield multiple chars
432
case RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy when node.
M
> 0:
434
int count = Math.Min(node.
M
, SingleCharIterationLimit);
439
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
> 0:
442
int limit = Math.Min(node.
M
, NodeIterationLimit);
493
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
> 0:
609
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when node.
M
> 0:
612
int minIterations = Math.Min(node.
M
, MaxLoopExpansion);
618
return i == node.
M
&& i == node.N;
641
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when node.
M
> 0:
643
int minIterations = Math.Min(node.
M
, MaxLoopExpansion);
649
return i == node.
M
&& i == node.N;
658
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when node.
M
== node.N:
659
distance += node.
M
;
686
case RegexNodeKind.Lazyloop or RegexNodeKind.Loop when node.
M
> 0:
950
return node.Kind is RegexNodeKind.One || node.
M
> 0 ? true : null;
968
return node.Kind is RegexNodeKind.Notone || node.
M
> 0 ? true : null;
987
node.Kind is RegexNodeKind.Set || node.
M
> 0 ? true :
1033
_ => node.
M
== 0 ? null : true,
1201
(nextChild.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop && nextChild.
M
>= 1))
1209
(nextChild.Kind is RegexNodeKind.Set || nextChild.
M
>= 1))
1279
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
>= 1:
1340
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when leading && node.
M
>= 1:
src\libraries\System.Text.RegularExpressions\src\System\Text\RegularExpressions\RegexTreeAnalyzer.cs (2)
50
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
!= node.N:
51
case RegexNodeKind.Oneloop or RegexNodeKind.Notoneloop or RegexNodeKind.Setloop or RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy or RegexNodeKind.Setlazy when node.
M
!= node.N: