4 writes to _m
System (4)
regex\system\text\regularexpressions\RegexNode.cs (4)
150
_m
= m;
156
_m
= m;
176
_m
= min;
297
u.
_m
= min = ((Int32.MaxValue - 1) / u._m < min) ? Int32.MaxValue : u._m * min;
34 references to _m
System (34)
regex\system\text\regularexpressions\RegexFCD.cs (6)
87
if (curNode.
_m
> 0) {
88
string pref = String.Empty.PadRight(curNode.
_m
, curNode._ch);
416
if (node.
_m
== 0)
445
PushFC(new RegexFC(node._ch, false, node.
_m
== 0, ci));
450
PushFC(new RegexFC(node._ch, true, node.
_m
== 0, ci));
468
PushFC(new RegexFC(node._str, node.
_m
== 0, ci));
regex\system\text\regularexpressions\RegexNode.cs (7)
272
min =
_m
;
292
if (u.
_m
== 0 && child.
_m
> 1 || child._n < child.
_m
* 2)
296
if (u.
_m
> 0)
297
u._m = min = ((Int32.MaxValue - 1) / u.
_m
< min) ? Int32.MaxValue : u.
_m
* min;
regex\system\text\regularexpressions\RegexReplacement.cs (1)
57
slot = child.
_m
;
regex\system\text\regularexpressions\RegexWriter.cs (20)
355
Emit(RegexCode.Testref, MapCapnum(node.
_m
));
418
if (node._n < Int32.MaxValue || node.
_m
> 1)
419
Emit(node.
_m
== 0 ? RegexCode.Nullcount : RegexCode.Setcount, node.
_m
== 0 ? 0 : 1 - node.
_m
);
421
Emit(node.
_m
== 0 ? RegexCode.Nullmark : RegexCode.Setmark);
423
if (node.
_m
== 0) {
435
if (node._n < Int32.MaxValue || node.
_m
> 1)
436
Emit(RegexCode.Branchcount + Lazy, PopInt(), node._n == Int32.MaxValue ? Int32.MaxValue : node._n - node.
_m
);
440
if (node.
_m
== 0)
454
Emit(RegexCode.Capturemark, MapCapnum(node.
_m
), MapCapnum(node._n));
504
if (node.
_m
> 0)
506
RegexCode.Onerep : RegexCode.Notonerep) | bits, (int)node._ch, node.
_m
);
507
if (node._n > node.
_m
)
509
Int32.MaxValue : node._n - node.
_m
);
514
if (node.
_m
> 0)
515
Emit(RegexCode.Setrep | bits, StringCode(node._str), node.
_m
);
516
if (node._n > node.
_m
)
518
(node._n == Int32.MaxValue) ? Int32.MaxValue : node._n - node.
_m
);
530
Emit(node._type | bits, MapCapnum(node.
_m
));