Lines Matching refs:code
100 UErrorCode &e) // Error Code
251 // The pattern has now been read and processed, and the compiled code generated.
533 // 8. code for parenthesized stuff.
575 // 4. code for parenthesized stuff.
577 // 6. BACKTRACK // code in block succeeded, so neg. lookahead fails.
617 // 6 <code for LookBehind expression>
670 // 7 <code for LookBehind expression>
714 // Perl inline-condtionals. (?{perl code}a|b) We're not perl, no way to do them.
762 // Check for simple constructs, which may get special optimized code.
767 // Emit optimized code for [char set]+
780 // Emit Optimized code for .+ operations.
802 // extra loop-breaking code.
805 // Emit the code sequence that can handle it.
816 // Simpler code when the repeated body must match something non-empty
858 // This code is less than ideal, with two jmps instead of one, because we can only
910 // Emit optimized code for a [char set]*
923 // Emit Optimized code for .* operations.
941 // Emit general case code for this *
948 // extra loop-breaking code.
963 // Put together the save state op store it into the compiled code.
1031 // Finished scanning a normal {lower,upper} interval. Generate the code for it.
1038 // Finished scanning a Possessive {lower,upper}+ interval. Generate the code for it.
1046 // Produce normal looping code.
1049 // Surround the just-emitted normal looping code with a STO_SP ... LD_SP
1072 // Finished scanning a non-greedy {lower,upper}? interval. Generate the code for it.
1266 // the compiled code for it.
1797 // supplementary code point resulting from both halves of the pair.
1831 // emitONE_CHAR emit a ONE_CHAR op into the generated code.
1895 // Find the position of the last code point in the string (might be a surrogate pair)
1901 // The string should always be at least two code points long, meaning that there
1934 // compiled pattern code.
1941 UVector32 *code = fRXPat->fCompiledPat;
1942 U_ASSERT(where>0 && where < code->size());
1945 code->insertElementAt(nop, where, *fStatus);
1950 for (loc=0; loc<code->size(); loc++) {
1951 int32_t op = code->elementAti(loc);
1965 code->setElementAt(op, loc);
1973 U_ASSERT(x < code->size());
2019 // No slot for STATE_SAVE was pre-reserved in the compiled code.
2268 // The set contains only a single code point. Put it into
2291 // compileInterval Generate the code for a {min, max} style interval quantifier.
2292 // Except for the specific opcodes used, the code is the same
2296 // The code for interval loops has this form:
2309 // four slots in the compiled code. Reserve them.
2325 // compilation of something later on causes the code to grow and the target
2336 // Goes at end of the block being looped over, so just append to the code so far.
2354 // Too big to inline. Fail, which will cause looping code to be generated.
2370 // the one copy of the code already generated is just fine.
2784 // Keep track of the nesting depth of look-around blocks. Boilerplate code for
2891 // Length is in 16 bit code units, not code points.
2897 // start and end are the range of p-code operations to be
2974 // Ops that match a minimum of one character (one or two 16 bit code units.)
3155 // Length is in 16 bit code units, not code points.
3235 // Ops that match a max of one character (possibly two 16 bit code units.)
3383 // stripNOPs Remove any NOP operations from the compiled pattern code.
3385 // code generation to provide locations that may be patched later.
3398 // Make a first pass over the code, computing the amount that things
3399 // will be offset at each location in the original code.
3410 // Make a second pass over the code, removing the NOPs by moving following
3411 // code up, and patching operands that refer to code locations that
3431 // These are instructions with operands that refer to code locations.
3956 // This is common code underlying both \p{...} ane [:...:] expressions.
4004 // This code should be removed when ICU properties support the Java compatibility names
