Lines Matching defs:fold
99 * with a multi-character fold. Things are complicated. For
124 * quickly tell if it has a distinct fold, and if so,
152 * node begins with a multi-char fold. Therefore we fold
162 if (fc < 0) { /* Save the first fold */
169 UV fold = toFOLD_utf8_safe(s, e, d, &len);
170 if (fc < 0) { /* Save the first fold */
171 fc = fold;
184 /* When we reach here 's' points to the fold of the first
187 * fold.
190 * multi-char fold */
195 else { /* Single char fold */
204 /* ... plus all the things that fold to it, which are found in
543 /* Under /li, any 0-255 could fold to any other 0-255, depending on
928 * fold. *min_subtract is set to the total delta number of characters of the
932 * an unfolded multi-char fold. This happens when it won't be known until
933 * runtime whether the fold is valid or not; namely
935 * target string being matched against turns out to be UTF-8 is that fold
944 * multi-character fold sequences. It's been wrong in Perl for a very long
950 * Both sides fold to "sss", but if the pattern is parsed to create a node that
960 * character folded sequences. Since a single character can fold into
971 * under /u, we fold it to 'ss' in regatom(), and in this routine, after
977 * the only case where there is a possible fold length change in non-UTF-8
984 * UTF-8. In addition to the 'ss' sequence where there is a possible fold
989 * fully fold at compile time, regexec.c can know that everything in an
993 * is because its fold requires UTF-8 to represent. Thus EXACTFUP nodes
1007 * when no fold in it depends on the UTF-8ness of the target string.)
1010 * validity of the fold won't be known until runtime, and so must remain
1028 * boolean indicating whether or not the node contains such a fold. When
1036 * folds are 1-1; and, for UTF-8 patterns, we pre-fold all other folds to
1282 * is problematic; likely a character whose fold definition
1288 * a multi-char fold assume everything is folded (otherwise the
1292 * don't completely fold the EXACTFL string. We skip the
1326 /* Examine the string for a multi-character fold sequence. UTF-8
1332 int count = 0; /* How many characters in a multi-char fold */
1334 if (! len) { /* Not a multi-char fold: get next char */
1339 { /* Here is a generic multi-char fold. */
1386 * fold to the ASCII range (and there are no existing ones in the
1410 * two characters for a multi-fold */
1417 if (! len) { /* Not a multi-char fold. */
2305 /* Replace a length 1 ASCII fold pair node with an ANYOFM node,
2666 /* Nor characters whose fold at run-time may be