| /external/clang/test/Misc/ |
| error-limit.c | 8 struct s2{}; struct
9 struct s2{}; struct
14 // CHECK-NOT: 9:8: error: redefinition of 's2'
|
| /external/clang/test/Parser/ |
| struct-recursion.c | 6 struct s1 { struct s2 *A; };
7 struct s2 { struct s1 *B; }; struct
11 struct s2 b;
|
| /bionic/libc/string/ |
| strcoll.c | 37 strcoll(const char *s1, const char *s2)
39 return strcmp(s1, s2);
|
| strcmp.c | 45 strcmp(const char *s1, const char *s2)
47 while (*s1 == *s2++)
50 return (*(unsigned char *)s1 - *(unsigned char *)--s2);
|
| strncmp.c | 39 strncmp(const char *s1, const char *s2, size_t n)
44 if (*s1 != *s2++)
45 return (*(unsigned char *)s1 - *(unsigned char *)--s2);
|
| /dalvik/vm/mterp/c/ |
| OP_AGET_SHORT.cpp | 1 HANDLE_OP_AGET(OP_AGET_SHORT, "-short", s2, )
|
| OP_APUT_SHORT.cpp | 1 HANDLE_OP_APUT(OP_APUT_SHORT, "-short", s2, )
|
| OP_INT_TO_SHORT.cpp | 1 HANDLE_INT_TO_SMALL(OP_INT_TO_SHORT, "short", s2) /* want sign bit */
|
| /external/valgrind/main/none/tests/s390x/ |
| insert.h | 6 #define INSERT_REG_MEM(insn, s1, s2) \
14 : "d" (tmp), "Q" (s2) \
16 printf(#insn " %16.16lX <- %16.16lX = %16.16lX\n", s1, s2, tmp); \
19 #define INSERT_REG_IMM(insn, s1, s2) \
23 asm volatile( insn(2,s2) \
30 printf(#insn " %16.16lX <- %16.16lX = %16.16lX\n", s1, (unsigned long) 0x##s2, v); \
34 #define memsweep(i, s2) \
36 INSERT_REG_MEM(i, 0ul, s2); \
37 INSERT_REG_MEM(i, 1ul, s2); \
38 INSERT_REG_MEM(i, 0xfffful, s2); \
[all...] |
| add.c | 18 static void do_regmem_insns(unsigned long s2)
20 memsweep(a, s2, 0);
21 memsweep(ah, s2, 0);
22 memsweep(ag, s2, 0);
23 memsweep(agf, s2, 0);
24 memsweep(al, s2, 0);
25 memsweep(alg, s2, 0);
26 memsweep(agf, s2, 0);
27 memsweep(algf, s2, 0);
28 regsweep(ar, s2, 0)
[all...] |
| sub.c | 5 static void do_regmem_insns(unsigned long s2)
7 memsweep(s, s2, 0);
8 memsweep(sh, s2, 0);
9 memsweep(sg, s2, 0);
10 memsweep(sgf, s2, 0);
11 memsweep(sl, s2, 0);
12 memsweep(slg, s2, 0);
13 memsweep(sgf, s2, 0);
14 memsweep(slgf, s2, 0);
15 regsweep(sr, s2, 0)
[all...] |
| and.h | 6 #define AND_REG_MEM(insn, s1, s2) \
14 : "d" (tmp), "Q" (s2) \
16 printf(#insn " + %16.16lX & %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
19 #define AND_REG_REG(insn, s1, s2) \
27 : "d" (tmp), "d" (s2) \
29 printf(#insn " + %16.16lX & %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
32 #define AND_REG_IMM(insn, s1, s2) \
36 asm volatile( insn(2,s2) \
43 printf(#insn " + %16.16lX & %16.16lX = %16.16lX (cc=%d)\n", s1, (unsigned long) 0x##s2, v, cc); \
46 #define AND_MEM_IMM(insn, s1, s2) \
[all...] |
| or.h | 6 #define OR_REG_MEM(insn, s1, s2) \
14 : "d" (tmp), "Q" (s2) \
16 printf(#insn " %16.16lX | %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
19 #define OR_REG_REG(insn, s1, s2) \
27 : "d" (tmp), "d" (s2) \
29 printf(#insn " %16.16lX | %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
32 #define OR_REG_IMM(insn, s1, s2) \
36 asm volatile( insn(2,s2) \
43 printf(#insn " %16.16lX | %16.16lX = %16.16lX (cc=%d)\n", s1, (unsigned long) 0x##s2, v, cc); \
46 #define OR_MEM_IMM(insn, s1, s2) \
[all...] |
| xor.h | 6 #define XOR_REG_MEM(insn, s1, s2) \
14 : "d" (tmp), "Q" (s2) \
16 printf(#insn " %16.16lX ^ %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
19 #define XOR_REG_REG(insn, s1, s2) \
27 : "d" (tmp), "d" (s2) \
29 printf(#insn " %16.16lX ^ %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
32 #define XOR_REG_IMM(insn, s1, s2) \
36 asm volatile( insn(2,s2) \
43 printf(#insn " %16.16lX ^ %16.16lX = %16.16lX (cc=%d)\n", s1, (unsigned long) 0x##s2, v, cc); \
46 #define XOR_MEM_IMM(insn, s1, s2) \
[all...] |
| add.h | 6 #define ADD_REG_MEM(insn, s1, s2, CARRY) \
16 : "d" (tmp), "Q" (s2) \
18 printf(#insn " " #CARRY " + %16.16lX + %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
21 #define ADD_REG_REG(insn, s1, s2, CARRY) \
31 : "d" (tmp), "d" (s2) \
33 printf(#insn " " #CARRY " + %16.16lX + %16.16lX = %16.16lX (cc=%d)\n", s1, s2, tmp, cc); \
36 #define ADD_REG_IMM(insn, s1, s2, CARRY) \
42 #insn " %0," #s2 "\n" \
48 printf(#insn " " #CARRY " + %16.16lX + %16.16lX = %16.16lX (cc=%d)\n", s1, (unsigned long) s2, tmp, cc); \
51 #define ADD_MEM_IMM(insn, s1, s2, CARRY)
[all...] |
| /system/core/sh/ |
| mystring.h | 44 #define equal(s1, s2) (strcmp(s1, s2) == 0)
45 #define scopy(s1, s2) ((void)strcpy(s2, s1))
|
| /external/webkit/Source/JavaScriptCore/wtf/ |
| StringExtras.cpp | 34 int strcasecmp(const char* s1, const char* s2)
36 while (toASCIIUpper(*s1) == toASCIIUpper(*s2)) {
40 s2++;
43 return toASCIIUpper(*s1) - toASCIIUpper(*s2);
46 int strncasecmp(const char* s1, const char* s2, size_t len)
48 while (len > 0 && toASCIIUpper(*s1) == toASCIIUpper(*s2)) {
52 s2++;
59 return toASCIIUpper(*s1) - toASCIIUpper(*s2);
|
| /bionic/libc/wchar/ |
| wcscmp.c | 48 wcscmp(const wchar_t *s1, const wchar_t *s2)
51 while (*s1 == *s2++)
55 return (*(const unsigned int *)s1 - *(const unsigned int *)--s2);
|
| wcscasecmp.c | 34 wcscasecmp(const wchar_t *s1, const wchar_t *s2)
38 for (; *s1; s1++, s2++) {
40 c2 = towlower(*s2);
44 return (-*s2);
|
| wmemcmp.c | 40 wmemcmp(const wchar_t *s1, const wchar_t *s2, size_t n)
45 if (*s1 != *s2) {
47 return *s1 > *s2 ? 1 : -1;
50 s2++;
|
| /gdk/build/awk/ |
| check-awk.awk | 33 s2=substr(s1,RSTART,RLENGTH)
34 if (s2 != "world") {
35 print "Fail substr="s2
|
| /ndk/build/awk/ |
| check-awk.awk | 33 s2=substr(s1,RSTART,RLENGTH)
34 if (s2 != "world") {
35 print "Fail substr="s2
|
| /external/clang/test/CodeGen/ |
| mms-bitfields.c | 10 struct s2 { struct
13 } s2; variable in typeref:struct:s2
15 // CHECK: %struct.s2 = type { i32, [4 x i8], [4 x i64] }
|
| 2002-03-11-LargeCharInString.c | 3 int strcmp(const char *s1, const char *s2);
|
| 2002-04-09-StructRetVal.c | 5 short s1, s2; member in struct:S
|
