| /bionic/libc/kernel/common/linux/ |
| tegra_avp.h | 25 int greedy; member in struct:tegra_avp_lib
|
| /external/llvm/test/CodeGen/ARM/ |
| str_pre-2.ll | 4 ; The greedy register allocator uses a single CSR here, invalidating the test.
|
| crash-greedy.ll | 1 ; RUN: llc < %s -regalloc=greedy -mcpu=cortex-a8 -relocation-model=pic -disable-fp-elim -verify-machineinstrs | FileCheck %s
3 ; ARM tests that crash or fail with the greedy register allocator.
|
| lsr-unfolded-offset.ll | 1 ; RUN: llc -regalloc=greedy < %s | FileCheck %s
|
| /external/v8/test/mjsunit/regress/ |
| regress-176.js | 41 "non-zero length match with greedy ? in (?:)");
44 "non-zero length match with non-greedy ? in (?:), o forces backtrack");
47 "non-zero length match with non-greedy ? in (?:), zero length match causes backtrack");
|
| /external/kernel-headers/original/linux/ |
| tegra_avp.h | 29 int greedy; member in struct:tegra_avp_lib
|
| /external/llvm/test/CodeGen/Blackfin/ |
| 2009-08-04-LowerExtract-Live.ll | 2 ; RUN: llc < %s -march=bfin -join-liveintervals=0 -verify-machineinstrs -regalloc=greedy
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
| regress-105972.js | 48 * The * operator is greedy, but *? is non-greedy: it will stop
64 * the string, so the non-greedy operator *? doesn't try to...
79 * the match will stop because the operator *? is non-greedy.
96 * the match will not stop since * is greedy. The match will
|
| regress-191479.js | 113 * Let's take all 7 sections above and make each quantifer non-greedy.
116 * the quantifier, but makes it non-greedy, which affects the results -
|
| /external/llvm/test/CodeGen/X86/ |
| constant-pool-remat-0.ll | 2 ; RUN: llc < %s -mtriple=x86_64-linux -regalloc=greedy | FileCheck %s
|
| inline-asm-error.ll | 3 ; RUN: not llc -march x86 -regalloc=greedy < %s 2> %t3
|
| 2008-09-18-inline-asm-2.ll | 4 ; RUN: llc < %s -march=x86 -regalloc=greedy | FileCheck %s
|
| /external/protobuf/gtest/xcode/Scripts/ |
| versiongenerate.py | 43 # brackets(e.g. "[1.0.1]") between "AC_INIT(" and ")". Do not be greedy
44 # (*? is the non-greedy flag) since that would pull in everything between
|
| /external/pcre/doc/ |
| pcresyntax.3 | 252 ? 0 or 1, greedy
255 * 0 or more, greedy
258 + 1 or more, greedy
262 {n,m} at least n, no more than m, greedy
265 {n,} n or more, greedy
|
| pcrematching.3 | 52 repetition branches are tried is controlled by the greedy or ungreedy nature of
58 the longest, or some intermediate length depends on the way the greedy and
103 1. Because the algorithm finds all possible matches, the greedy or ungreedy
104 nature of repetition quantifiers is not relevant. Greedy and ungreedy
|
| /libcore/luni/src/main/java/java/util/regex/ |
| Pattern.java | 117 * <p>Quantifiers are "greedy" by default, meaning that they will match the longest possible input
118 * sequence. There are also non-greedy quantifiers that match the shortest possible input sequence.
119 * They're same as the greedy ones but with a trailing {@code ?}:
121 * <tr> <td> *? </td> <td>Zero or more (non-greedy).</td> </tr>
122 * <tr> <td> ?? </td> <td>Zero or one (non-greedy).</td> </tr>
123 * <tr> <td> +? </td> <td>One or more (non-greedy).</td> </tr>
124 * <tr> <td> {<i>n</i>}? </td> <td>Exactly <i>n</i> (non-greedy).</td> </tr>
125 * <tr> <td> {<i>n,</i>}? </td> <td>At least <i>n</i> (non-greedy).</td> </tr>
126 * <tr> <td> {<i>n</i>,<i>m</i>}? </td> <td>At least <i>n</i> but not more than <i>m</i> (non-greedy).</td> </tr>
129 * backtracking. They're same as the greedy ones but with a trailing {@code +}
[all...] |
| /external/v8/test/mjsunit/ |
| greedy.js | 28 // Flags: --gc-greedy
|
| /external/chromium/testing/gtest/xcode/Scripts/ |
| versiongenerate.py | 72 # brackets(e.g. "[1.0.1]") between "AC_INIT(" and ")". Do not be greedy
73 # (*? is the non-greedy flag) since that would pull in everything between
|
| /external/pcre/doc/html/ |
| pcresyntax.html | 284 ? 0 or 1, greedy
287 * 0 or more, greedy
290 + 1 or more, greedy
294 {n,m} at least n, no more than m, greedy
297 {n,} n or more, greedy
|
| pcrematching.html | 72 repetition branches are tried is controlled by the greedy or ungreedy nature of
79 the longest, or some intermediate length depends on the way the greedy and
129 1. Because the algorithm finds all possible matches, the greedy or ungreedy
130 nature of repetition quantifiers is not relevant. Greedy and ungreedy
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| AccordionControl.java | 193 * @param greedy if true, grow vertically as much as possible
199 boolean greedy, boolean wrapChildren, Set<String> expand) {
263 greedy ? SWT.FILL : SWT.TOP, false, greedy, 1, 1);
|
| /external/v8/src/arm/ |
| regexp-macro-assembler-arm.h | 63 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/ia32/ |
| regexp-macro-assembler-ia32.h | 62 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/mips/ |
| regexp-macro-assembler-mips.h | 62 // A "greedy loop" is a loop that is both greedy and with a simple
|
| /external/v8/src/x64/ |
| regexp-macro-assembler-x64.h | 56 // A "greedy loop" is a loop that is both greedy and with a simple
|
