Searched refs:s2 (Results 1 - 25 of 1148) sorted by relevance

1234567891011>>

/external/clang/test/Misc/
H A Derror-limit.c8 struct s2{}; struct
9 struct s2{}; struct
14 // CHECK-NOT: 9:8: error: redefinition of 's2'
/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1919169.js30 var s2 = "s2";
33 var res = 1 + s2;
34 s2 = 2;
/external/clang/test/Parser/
H A Dstruct-recursion.c6 struct s1 { struct s2 *A; };
7 struct s2 { struct s1 *B; }; struct
11 struct s2 b;
/external/v8/test/mjsunit/regress/
H A Dregress-1919169.js30 var s2 = "s2";
33 var res = 1 + s2;
34 s2 = 2;
/external/valgrind/main/none/tests/s390x/
H A Dinsert.h6 #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...]
H A Dadd.c18 static void do_regmem_insns(unsigned long s2) argument
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,
[all...]
H A Dsub.c5 static void do_regmem_insns(unsigned long s2) argument
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,
[all...]
H A Dand.h6 #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...]
H A Dor.h6 #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...]
H A Dxor.h6 #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...]
H A Dadd.h6 #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, CARR
[all...]
H A Dsub.h6 #define SUB_REG_MEM(insn, s1, s2, NOBORROW) \
16 : "d" (tmp), "Q" (s2) \
18 printf(#insn " %16.16lX - %16.16lX - %d = %16.16lX (cc=%d)\n", s1, s2, !NOBORROW, tmp, cc); \
21 #define SUB_REG_REG(insn, s1, s2, NOBORROW) \
31 : "d" (tmp), "d" (s2) \
33 printf(#insn " %16.16lX - %16.16lX - %d = %16.16lX (cc=%d)\n", s1, s2, !NOBORROW, tmp, cc); \
36 #define SUB_REG_IMM(insn, s1, s2, NOBORROW) \
42 insn(2,s2) \
49 printf(#insn " %16.16lX - %16.16lX - %d = %16.16lX (cc=%d)\n", s1, (unsigned long) 0x00000000##s2, !NOBORROW, v, cc); \
52 #define memsweep(i, s2, carryse
[all...]
/external/chromium_org/third_party/cld/base/
H A Dstring_util.h15 // Compare the two strings s1 and s2 without regard to case using
16 // the current locale; returns 0 if they are equal, 1 if s1 > s2, and -1 if
17 // s2 > s1 according to a lexicographic comparison.
18 inline int strcasecmp(const char* s1, const char* s2) { argument
19 return _stricmp(s1, s2);
22 inline int strcasecmp(const char* s1, const char* s2) {
23 return ::strcasecmp(s1, s2);
/external/chromium_org/third_party/mesa/src/src/egl/main/
H A Deglstring.c45 char *s2 = malloc(l + 1); local
46 if (s2)
47 strcpy(s2, s);
48 return s2;
/external/mesa3d/src/egl/main/
H A Deglstring.c45 char *s2 = malloc(l + 1); local
46 if (s2)
47 strcpy(s2, s);
48 return s2;
/external/chromium_org/v8/test/mjsunit/
H A Dshifts.js37 var s2 = -1; variable
38 assertEquals(0xffffffff, (s2 >>> 0));
/external/v8/test/mjsunit/
H A Dshifts.js37 var s2 = -1; variable
38 assertEquals(0xffffffff, (s2 >>> 0));
/external/clang/test/CodeGen/
H A Dmms-bitfields.c10 struct s2 { struct
13 } s2; variable in typeref:struct:s2
15 // CHECK: %struct.s2 = type { i32, [4 x i8], [4 x i64] }
H A D2002-03-11-LargeCharInString.c3 int strcmp(const char *s1, const char *s2);
H A D2002-04-09-StructRetVal.c5 short s1, s2; member in struct:S
H A Dms_struct.c11 struct s2 { struct
14 } ATTR s2; variable in typeref:struct:s2
16 // CHECK: %struct.s2 = type { i32, [4 x i8], [4 x i64] }
/external/clang/test/PCH/
H A Dchanged-files.c3 const char *s2 = m0; variable
/external/valgrind/main/memcheck/tests/
H A Dmemcmptest.c8 char *s1, *s2; variable
12 s2 = malloc(10); strcpy(s2,"fooble");
13 if (memcmp(s1, s2, 8) != 0)
/external/bison/lib/
H A Dstreq.h35 streq9 (const char *s1, const char *s2) argument
37 return strcmp (s1 + 9, s2 + 9) == 0;
41 streq8 (const char *s1, const char *s2, char s28) argument
48 return streq9 (s1, s2);
55 streq7 (const char *s1, const char *s2, char s27, char s28) argument
62 return streq8 (s1, s2, s28);
69 streq6 (const char *s1, const char *s2, char s26, char s27, char s28) argument
76 return streq7 (s1, s2, s27, s28);
83 streq5 (const char *s1, const char *s2, char s25, char s26, char s27, char s28) argument
90 return streq6 (s1, s2, s2
97 streq4(const char *s1, const char *s2, char s24, char s25, char s26, char s27, char s28) argument
111 streq3(const char *s1, const char *s2, char s23, char s24, char s25, char s26, char s27, char s28) argument
125 streq2(const char *s1, const char *s2, char s22, char s23, char s24, char s25, char s26, char s27, char s28) argument
139 streq1(const char *s1, const char *s2, char s21, char s22, char s23, char s24, char s25, char s26, char s27, char s28) argument
153 streq0(const char *s1, const char *s2, char s20, char s21, char s22, char s23, char s24, char s25, char s26, char s27, char s28) argument
[all...]
H A Dc-strcase.h42 extern int c_strcasecmp (const char *s1, const char *s2) _GL_ATTRIBUTE_PURE;
47 extern int c_strncasecmp (const char *s1, const char *s2, size_t n)

Completed in 265 milliseconds

1234567891011>>