11 writes to M
System.Text.RegularExpressions (11)
System\Text\RegularExpressions\RegexNode.cs (11)
75
M
= m;
82
M
= m;
98
newNode.
M
= M - 1;
153
M
= min;
200
M
= N = 0;
209
M
= N = 0;
940
u.
M
= min = ((int.MaxValue - 1) / u.M < min) ? int.MaxValue : u.M * min;
1922
currentNode.
M
+= nextNode.M;
1936
currentNode.
M
++;
1963
currentNode.
M
+= matchingCharsInMulti;
2005
currentNode.
M
= nextNode.M + 1;
177 references to M
System.Text.RegularExpressions (177)
System\Text\RegularExpressions\RegexCompiler.cs (35)
1368
if (target.LoopNode.
M
> 0)
1383
Ldc(target.LoopNode.
M
);
2107
int capnum = RegexParser.MapCaptureNumber(node.
M
, _regexTree!.CaptureNumberSparseMapping);
2304
int capnum = RegexParser.MapCaptureNumber(node.
M
, _regexTree!.CaptureNumberSparseMapping);
2650
int capnum = RegexParser.MapCaptureNumber(node.
M
, _regexTree!.CaptureNumberSparseMapping);
3546
if (node.
M
== node.N)
3556
Debug.Assert(node.
M
< node.N);
3586
if (node.
M
> 0)
3589
Ldc(!rtl ? node.
M
: -node.
M
);
3816
if (node.
M
> 0)
3823
if (node.
M
== node.N || analysis.IsAtomicByAncestor(node))
3828
Debug.Assert(node.
M
< node.N);
3842
maxIterations = node.N - node.
M
;
4159
Debug.Assert(node.
M
< int.MaxValue, $"Unexpected M={node.
M
}");
4160
Debug.Assert(node.N >= node.
M
, $"Unexpected M={node.
M
}, N={node.N}");
4164
int minIterations = node.
M
;
4522
int iterations = node.
M
;
4673
if (node.
M
== node.N)
4680
if (node.
M
== 0 && node.N == 1)
4686
Debug.Assert(node.N > node.
M
);
4687
int minIterations = node.
M
;
4918
Debug.Assert(node.
M
== 0 && node.N == 1);
5007
Debug.Assert(node.
M
< int.MaxValue, $"Unexpected M={node.
M
}");
5008
Debug.Assert(node.
M
== node.N, $"Unexpected M={node.
M
} == N={node.N}");
5038
Ldc(node.
M
);
5045
Debug.Assert(node.
M
< int.MaxValue, $"Unexpected M={node.
M
}");
5046
Debug.Assert(node.N >= node.
M
, $"Unexpected M={node.
M
}, N={node.N}");
5050
int minIterations = node.
M
;
System\Text\RegularExpressions\RegexFindOptimizations.cs (1)
845
if ((i - prev - 1) < loopNode.
M
)
System\Text\RegularExpressions\RegexNode.cs (75)
92
Debug.Assert(
M
> 0);
98
newNode.M =
M
- 1;
182
N =
M
;
207
RegexNode loopAsChild = new(RegexNodeKind.Loop, Options,
M
, N);
218
N =
M
;
886
int min =
M
;
931
if (u.
M
== 0 && child.
M
> 1 || child.N < child.
M
* 2)
938
if (u.
M
> 0)
940
u.M = min = ((int.MaxValue - 1) / u.
M
< min) ? int.MaxValue : u.
M
* min;
965
child.MakeRep(u.Kind == RegexNodeKind.Lazyloop ? RegexNodeKind.Onelazy : RegexNodeKind.Oneloop, u.
M
, u.N);
990
u = u.
M
== 0 ? new RegexNode(RegexNodeKind.Empty, Options) : child;
1265
case RegexNodeKind.Oneloop or RegexNodeKind.Notoneloop or RegexNodeKind.Setloop or RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy or RegexNodeKind.Setlazy when required.
M
== required.N:
1284
required.
M
!= other.
M
||
1557
Debug.Assert(Kind is RegexNodeKind.One or RegexNodeKind.Multi || (IsOneFamily &&
M
> 0));
1643
case RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic or RegexNodeKind.Onelazy when node.
M
> 0:
1645
case RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic or RegexNodeKind.Notonelazy when node.
M
> 0:
1647
case RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic or RegexNodeKind.Setlazy when node.
M
> 0:
1655
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
> 0:
1907
if (nextNode.
M
> 0 &&
1917
if (!CanCombineCounts(currentNode.
M
, currentNode.N, nextNode.
M
, nextNode.N))
1922
currentNode.M += nextNode.
M
;
1934
if (CanCombineCounts(currentNode.
M
, currentNode.N, 1, 1))
1960
if (CanCombineCounts(currentNode.
M
, currentNode.N, matchingCharsInMulti, matchingCharsInMulti))
2002
if (CanCombineCounts(1, 1, nextNode.
M
, nextNode.N))
2005
currentNode.M = nextNode.
M
+ 1;
2486
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when subsequent.
M
> 0:
2541
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && node.Ch != subsequent.Ch:
2542
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when subsequent.
M
> 0 && node.Ch == subsequent.Ch:
2543
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
> 0 && !RegexCharClass.CharInClass(node.Ch, subsequent.Str!):
2547
case RegexNodeKind.Boundary when node.
M
> 0 && RegexCharClass.IsBoundaryWordChar(node.Ch):
2548
case RegexNodeKind.NonBoundary when node.
M
> 0 && !RegexCharClass.IsBoundaryWordChar(node.Ch):
2549
case RegexNodeKind.ECMABoundary when node.
M
> 0 && RegexCharClass.IsECMAWordChar(node.Ch):
2550
case RegexNodeKind.NonECMABoundary when node.
M
> 0 && !RegexCharClass.IsECMAWordChar(node.Ch):
2553
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && node.Ch != subsequent.Ch:
2554
case RegexNodeKind.Notonelazy or RegexNodeKind.Notoneloop or RegexNodeKind.Notoneloopatomic when subsequent.
M
== 0 && node.Ch == subsequent.Ch:
2555
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
== 0 && !RegexCharClass.CharInClass(node.Ch, subsequent.Str!):
2569
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && node.Ch == subsequent.Ch:
2574
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && node.Ch == subsequent.Ch:
2589
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && !RegexCharClass.CharInClass(subsequent.Ch, node.Str!):
2590
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
> 0 && !RegexCharClass.MayOverlap(node.Str!, subsequent.Str!):
2594
case RegexNodeKind.Boundary when node.
M
> 0 && RegexCharClass.IsSubsetOf(node.Str!, RegexCharClass.WordClass):
2595
case RegexNodeKind.NonBoundary when node.
M
> 0 && node.Str is RegexCharClass.NotWordClass or RegexCharClass.NotDigitClass:
2596
case RegexNodeKind.ECMABoundary when node.
M
> 0 && node.Str is RegexCharClass.ECMAWordClass or RegexCharClass.ECMADigitClass:
2597
case RegexNodeKind.NonECMABoundary when node.
M
> 0 && node.Str is RegexCharClass.NotECMAWordClass or RegexCharClass.NotDigitClass:
2600
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && !RegexCharClass.CharInClass(subsequent.Ch, node.Str!):
2601
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
== 0 && !RegexCharClass.MayOverlap(node.Str!, subsequent.Str!):
2636
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
> 0 && !CharInStartingOrEndingSet(subsequent.Ch):
2637
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
> 0 && !MayOverlapStartingOrEndingSet(subsequent.Str!):
2641
case RegexNodeKind.Boundary when node.
M
> 0 && RegexCharClass.IsSubsetOf(loopStartingSet, RegexCharClass.WordClass) && RegexCharClass.IsSubsetOf(loopEndingSet, RegexCharClass.WordClass):
2642
case RegexNodeKind.NonBoundary when node.
M
> 0 && (loopStartingSet is RegexCharClass.NotWordClass or RegexCharClass.NotDigitClass) && (loopEndingSet is RegexCharClass.NotWordClass or RegexCharClass.NotDigitClass):
2643
case RegexNodeKind.ECMABoundary when node.
M
> 0 && (loopStartingSet is RegexCharClass.ECMAWordClass or RegexCharClass.ECMADigitClass) && (loopEndingSet is RegexCharClass.ECMAWordClass or RegexCharClass.ECMADigitClass):
2644
case RegexNodeKind.NonECMABoundary when node.
M
> 0 && (loopStartingSet is RegexCharClass.NotECMAWordClass or RegexCharClass.NotDigitClass) && (loopEndingSet is RegexCharClass.NotECMAWordClass or RegexCharClass.NotDigitClass):
2647
case RegexNodeKind.Onelazy or RegexNodeKind.Oneloop or RegexNodeKind.Oneloopatomic when subsequent.
M
== 0 && !CharInStartingOrEndingSet(subsequent.Ch):
2648
case RegexNodeKind.Setlazy or RegexNodeKind.Setloop or RegexNodeKind.Setloopatomic when subsequent.
M
== 0 && !MayOverlapStartingOrEndingSet(subsequent.Str!):
2741
RegexNodeKind.Loop or RegexNodeKind.Lazyloop when
M
!= N => true,
2744
RegexNodeKind.Setloop or RegexNodeKind.Setlazy when
M
!= N => true,
2863
return
M
;
2868
return (int)Math.Min(int.MaxValue - 1, (long)
M
* Child(0).ComputeMinLength());
3159
(child.Kind is RegexNodeKind.Setloop or RegexNodeKind.Setlazy or RegexNodeKind.Setloopatomic && child.
M
== child.N))
3168
vsb.Append((char)(twoChars[0] | 0x20), child.Kind is RegexNodeKind.Set ? 1 : child.
M
);
3250
when node.
M
== node.N => true,
3518
sb.Append(' ').Append($"index = {
M
}");
3526
sb.Append(' ').Append($"index = {
M
}");
3558
(
M
== 0 && N == int.MaxValue) ? "*" :
3559
(
M
== 0 && N == 1) ? "?" :
3560
(
M
== 1 && N == int.MaxValue) ? "+" :
3561
(N == int.MaxValue) ? $"{{{
M
}, *}}" :
3562
(N ==
M
) ? $"{{{
M
}}}" :
3563
$"{{{
M
}, {N}}}");
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
"/>.
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
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:
959
return node.Kind is RegexNodeKind.One || node.
M
> 0 ? true : null;
977
return node.Kind is RegexNodeKind.Notone || node.
M
> 0 ? true : null;
996
node.Kind is RegexNodeKind.Set || node.
M
> 0 ? true :
1043
_ => node.
M
== 0 ? null : true,
1225
(nextChild.Kind is RegexNodeKind.Loop or RegexNodeKind.Lazyloop && nextChild.
M
>= 1))
1233
(nextChild.Kind is RegexNodeKind.Set || nextChild.
M
>= 1))
1303
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when node.
M
>= 1:
1362
case RegexNodeKind.Loop or RegexNodeKind.Lazyloop when leading && node.
M
>= 1:
System\Text\RegularExpressions\RegexReplacement.cs (1)
65
int slot = child.
M
;
System\Text\RegularExpressions\RegexWriter.cs (20)
254
Emit(RegexOpcode.TestBackreference, RegexParser.MapCaptureNumber(node.
M
, _tree.CaptureNumberSparseMapping));
314
if (node.N < int.MaxValue || node.
M
> 1)
315
Emit(node.
M
== 0 ? RegexOpcode.Nullcount : RegexOpcode.Setcount, node.
M
== 0 ? 0 : 1 - node.
M
);
317
Emit(node.
M
== 0 ? RegexOpcode.Nullmark : RegexOpcode.Setmark);
319
if (node.
M
== 0)
333
if (node.N < int.MaxValue || node.
M
> 1)
334
Emit(RegexOpcode.Branchcount + Lazy, _intStack.Pop(), node.N == int.MaxValue ? int.MaxValue : node.N - node.
M
);
338
if (node.
M
== 0)
348
Emit(RegexOpcode.Capturemark, RegexParser.MapCaptureNumber(node.
M
, _tree.CaptureNumberSparseMapping), RegexParser.MapCaptureNumber(node.N, _tree.CaptureNumberSparseMapping));
392
if (node.
M
> 0)
395
RegexOpcode.Onerep : RegexOpcode.Notonerep) | bits, node.Ch, node.
M
);
397
if (node.N > node.
M
)
399
Emit((RegexOpcode)node.Kind | bits, node.Ch, node.N == int.MaxValue ? int.MaxValue : node.N - node.
M
);
408
if (node.
M
> 0)
410
Emit(RegexOpcode.Setrep | bits, stringCode, node.
M
);
412
if (node.N > node.
M
)
414
Emit((RegexOpcode)node.Kind | bits, stringCode, (node.N == int.MaxValue) ? int.MaxValue : node.N - node.
M
);
428
Emit((RegexOpcode)node.Kind | bits, RegexParser.MapCaptureNumber(node.
M
, _tree.CaptureNumberSparseMapping));
System\Text\RegularExpressions\Symbolic\RegexNodeConverter.cs (4)
117
result.AddLast(_builder.CreateLoop(_builder.CreateSingleton(bdd), node.Kind is RegexNodeKind.Onelazy or RegexNodeKind.Notonelazy, node.
M
, node.N));
128
result.AddLast(_builder.CreateLoop(_builder.CreateSingleton(setBdd), node.Kind == RegexNodeKind.Setlazy, node.
M
, node.N));
260
result.AddLast(_builder.CreateLoop(body, node.Kind == RegexNodeKind.Lazyloop, node.
M
, node.N));
272
int captureNum = RegexParser.MapCaptureNumber(node.
M
, _captureSparseMapping);