Searched refs:repetitions (Results 1 – 17 of 17) sorted by relevance
261 static HuffmanTreeToken* CodeRepeatedValues(int repetitions, in CodeRepeatedValues() argument269 --repetitions; in CodeRepeatedValues()271 while (repetitions >= 1) { in CodeRepeatedValues()272 if (repetitions < 3) { in CodeRepeatedValues()274 for (i = 0; i < repetitions; ++i) { in CodeRepeatedValues()280 } else if (repetitions < 7) { in CodeRepeatedValues()282 tokens->extra_bits = repetitions - 3; in CodeRepeatedValues()289 repetitions -= 6; in CodeRepeatedValues()295 static HuffmanTreeToken* CodeRepeatedZeros(int repetitions, in CodeRepeatedZeros() argument297 while (repetitions >= 1) { in CodeRepeatedZeros()[all …]
444 int32_t repetitions; in TestfgetsBuffers() local462 for (repetitions = 0; repetitions < 16; repetitions++) { in TestfgetsBuffers()481 if (readSize != expectedSize*repetitions) { in TestfgetsBuffers()482 …_err("Buffer is the wrong size. Got %d Expected %d\n", u_strlen(buffer), expectedSize*repetitions); in TestfgetsBuffers()484 if (buffer[(expectedSize*repetitions) + 1] != 0xBEEF) { in TestfgetsBuffers()504 for (repetitions = 0; repetitions < 16; repetitions++) { in TestfgetsBuffers()526 if (readSize != expectedSize*repetitions) { in TestfgetsBuffers()527 …_err("Buffer is the wrong size. Got %d Expected %d\n", u_strlen(buffer), expectedSize*repetitions); in TestfgetsBuffers()529 if (buffer[(expectedSize*repetitions) + 1] != 0xBEEF) { in TestfgetsBuffers()546 for (repetitions = 0; repetitions < 1; repetitions++) { in TestfgetsBuffers()[all …]
33 for (var repetitions = 0; repetitions < 20; repetitions++) {
10 ,x g/^Possessive repetitions:/d
39 Possessive repetitions:
80 # Ensure that there are no repetitions in the current compile options.
561 # repetitions.
68 void getIfPresent(int repetitions) { in getIfPresent() argument69 for (int i = 0; i < repetitions; ++i) { in getIfPresent()
415 and OP_KETRMAX are used for indefinite repetitions, minimally or maximally416 respectively (see below for possessive repetitions). All three are followed by
560 34. Auto-detect and optimize limited repetitions in JIT.565 36. In the interpreter, maximizing pattern repetitions for characters and1005 repetitions, e.g. [^a]{3}, with and without PCRE_CASELESS.
435 way so that results are repeatable across repetitions.
654 The repetitions may be mirrored from the original shader.
4903 alternatives and repetitions in the pattern. These are encoded in the9345 each of the repetitions can be independently maintained.)9349 ticularly if such repetitions are nested, the memory usage can become
META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF ...
1773 future extensions that will make those repetitions more
27162 # Figure repetitions