| /external/llvm/lib/Support/ |
| regcomp.c | 991 # define REP(f, t) ((f)*8 + (t))
1000 switch (REP(MAP(from), MAP(to))) {
1001 case REP(0, 0): /* must be user doing this */
1004 case REP(0, 1): /* as x{1,1}? */
1005 case REP(0, N): /* as x{1,n}? */
1006 case REP(0, INF): /* as x{1,}? */
1016 case REP(1, 1): /* trivial case */
1019 case REP(1, N): /* as x?x{1,n-1} */
1031 case REP(1, INF): /* as x+ */
1035 case REP(N, N): /* as xx{m-1,n-1} *
[all...] |
| /ndk/sources/host-tools/ndk-stack/regex/ |
| regcomp.c | 947 # define REP(f, t) ((f)*8 + (t))
956 switch (REP(MAP(from), MAP(to))) {
957 case REP(0, 0): /* must be user doing this */
960 case REP(0, 1): /* as x{1,1}? */
961 case REP(0, N): /* as x{1,n}? */
962 case REP(0, INF): /* as x{1,}? */
972 case REP(1, 1): /* trivial case */
975 case REP(1, N): /* as x?x{1,n-1} */
987 case REP(1, INF): /* as x+ */
991 case REP(N, N): /* as xx{m-1,n-1} *
[all...] |
| /external/valgrind/VEX/test/ |
| test-amd64.c | 1163 #define TEST_STRING1(OP, size, DF, REP)\
1175 REP #OP size "\n\t"\
1182 REP #OP size, rsi, rdi, rax, rcx,\
1186 #define TEST_STRING(OP, REP)\
1187 TEST_STRING1(OP, "b", "", REP);\
1188 TEST_STRING1(OP, "w", "", REP);\
1189 TEST_STRING1(OP, "l", "", REP);\
1190 TEST_STRING1(OP, "b", "std", REP);\
1191 TEST_STRING1(OP, "w", "std", REP);\
1192 TEST_STRING1(OP, "l", "std", REP)
[all...] |
| test-i386.c | 1123 #define TEST_STRING1(OP, size, DF, REP)\
1135 REP #OP size "\n\t"\
1142 REP #OP size, esi, edi, eax, ecx,\
1146 #define TEST_STRING(OP, REP)\
1147 TEST_STRING1(OP, "b", "", REP);\
1148 TEST_STRING1(OP, "w", "", REP);\
1149 TEST_STRING1(OP, "l", "", REP);\
1150 TEST_STRING1(OP, "b", "std", REP);\
1151 TEST_STRING1(OP, "w", "std", REP);\
1152 TEST_STRING1(OP, "l", "std", REP)
[all...] |
| /prebuilts/go/darwin-x86/src/runtime/ |
| memclr_386.s | 17 // MOVOU seems always faster than REP STOSL.
126 REP
|
| memmove_amd64.s | 37 // REP instructions have a high startup cost, so we handle small sizes
38 // with some straightline code. The REP MOVSQ instruction is really fast
82 REP; MOVSQ
111 REP; MOVSQ
|
| asm_amd64p32.s | 364 REP;MOVSB; \
377 REP;MOVSB; \
634 REP
637 REP
|
| sys_windows_386.s | 25 REP; MOVSL
|
| sys_windows_amd64.s | 39 REP; MOVSQ
|
| asm_386.s | 415 REP;MOVSB; \
429 REP;MOVSB; \
[all...] |
| asm_amd64.s | 411 REP;MOVSB; \
424 REP;MOVSB; \
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| memclr_386.s | 17 // MOVOU seems always faster than REP STOSL.
126 REP
|
| memmove_amd64.s | 37 // REP instructions have a high startup cost, so we handle small sizes
38 // with some straightline code. The REP MOVSQ instruction is really fast
82 REP; MOVSQ
111 REP; MOVSQ
|
| asm_amd64p32.s | 364 REP;MOVSB; \
377 REP;MOVSB; \
634 REP
637 REP
|
| sys_windows_386.s | 25 REP; MOVSL
|
| sys_windows_amd64.s | 39 REP; MOVSQ
|
| asm_386.s | 415 REP;MOVSB; \
429 REP;MOVSB; \
[all...] |
| asm_amd64.s | 411 REP;MOVSB; \
424 REP;MOVSB; \
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| regcomp.c | 1141 # define REP(f, t) ((f)*8 + (t))
1156 switch (REP(MAP(from), MAP(to))) {
1157 case REP(0, 0): /* must be user doing this */
1160 case REP(0, 1): /* as x{1,1}? */
1161 case REP(0, N): /* as x{1,n}? */
1162 case REP(0, INF): /* as x{1,}? */
1172 case REP(1, 1): /* trivial case */
1175 case REP(1, N): /* as x?x{1,n-1} */
1187 case REP(1, INF): /* as x+ */
1191 case REP(N, N): /* as xx{m-1,n-1} *
[all...] |
| /external/llvm/lib/Target/X86/MCTargetDesc/ |
| X86BaseInfo.h | 454 // REP prefix
456 REP = 1 << REPShift,
|
| X86MCCodeEmitter.cpp | [all...] |
| /external/boringssl/src/ssl/test/runner/poly1305/ |
| poly1305_amd64.s | 284 REP; MOVSB
|
| /external/mesa3d/src/mesa/x86/ |
| assyntax.h | 594 #define REP CHOICE(rep ;, rep ;, repe)
[all...] |
