| /dalvik/libdex/ |
| Leb128.cpp | 32 int readAndVerifyUnsignedLeb128(const u1** pStream, const u1* limit,
34 const u1* ptr = *pStream;
54 int readAndVerifySignedLeb128(const u1** pStream, const u1* limit,
56 const u1* ptr = *pStream;
|
| DexOptData.h | 34 bool dexParseOptData(const u1* data, size_t length, DexFile* pDexFile);
|
| DexClass.h | 62 bool dexReadAndVerifyClassDataHeader(const u1** pData, const u1* pLimit,
76 bool dexReadAndVerifyClassDataField(const u1** pData, const u1* pLimit,
90 bool dexReadAndVerifyClassDataMethod(const u1** pData, const u1* pLimit,
103 DexClassData* dexReadAndVerifyClassData(const u1** pData, const u1* pLimit);
121 DEX_INLINE void dexReadClassDataHeader(const u1** pData,
136 DEX_INLINE void dexReadClassDataField(const u1** pData, DexField* pField
[all...] |
| DexOptData.cpp | 39 const u1* start = (const u1*) pOptHeader + pOptHeader->depsOffset;
40 const u1* end = (const u1*) pOptHeader +
49 bool dexParseOptData(const u1* data, size_t length, DexFile* pDexFile)
54 u4 optLength = (const u1*) pOptEnd - (const u1*) pOptStart;
86 const u4 offset = ((const u1*) pOpt) - data;
92 const u1* pOptData = (const u1*) (pOpt + 2)
[all...] |
| Leb128.h | 31 DEX_INLINE int readUnsignedLeb128(const u1** pStream) {
32 const u1* ptr = *pStream;
66 DEX_INLINE int readSignedLeb128(const u1** pStream) {
67 const u1* ptr = *pStream;
113 int readAndVerifyUnsignedLeb128(const u1** pStream, const u1* limit,
125 int readAndVerifySignedLeb128(const u1** pStream, const u1* limit, bool* okay);
133 DEX_INLINE u1* writeUnsignedLeb128(u1* ptr, u4 data
[all...] |
| DexCatch.cpp | 31 const u1* baseData = dexGetCatchHandlerData(pCode);
32 const u1* data = baseData;
45 const u1* data = dexGetCatchHandlerData(pCode);
|
| DexClass.cpp | 28 static bool verifyUlebs(const u1* pData, const u1* pLimit, u4 count) {
41 bool dexReadAndVerifyClassDataHeader(const u1** pData, const u1* pLimit,
62 bool dexReadAndVerifyClassDataField(const u1** pData, const u1* pLimit,
83 bool dexReadAndVerifyClassDataMethod(const u1** pData, const u1* pLimit,
103 DexClassData* dexReadAndVerifyClassData(const u1** pData, const u1* pLimit)
[all...] |
| /dalvik/dx/src/com/android/dx/io/instructions/ |
| CodeOutput.java | 31 public void write(short u0, short u1);
36 public void write(short u0, short u1, short u2);
41 public void write(short u0, short u1, short u2, short u3);
46 public void write(short u0, short u1, short u2, short u3, short u4);
|
| ShortArrayCodeOutput.java | 65 public void write(short u0, short u1) {
67 write(u1);
72 public void write(short u0, short u1, short u2) {
74 write(u1);
80 public void write(short u0, short u1, short u2, short u3) {
82 write(u1);
89 public void write(short u0, short u1, short u2, short u3, short u4) {
91 write(u1);
|
| /external/clang/test/SemaTemplate/ |
| fun-template-def.cpp | 24 T f1(T t1, U u1, int i1)
27 t2 = i1 + u1;
28 ++u1;
29 u1++;
30 int i2 = u1;
32 i1 = t1[u1];
35 i1(u1, t1); // error
36 u1(i1, t1);
43 new int(t1, u1);
44 new (t1, u1) int
[all...] |
| /external/linux-kselftest/tools/testing/selftests/proc/ |
| proc-uptime-001.c | 28 uint64_t start, u0, u1, i0, i1; local
37 proc_uptime(fd, &u1, &i1);
38 assert(u1 >= u0);
40 u0 = u1;
42 } while (u1 - start < 100);
|
| proc-uptime-002.c | 48 uint64_t u0, u1, i0, i1; local
71 proc_uptime(fd, &u1, &i1);
72 assert(u1 >= u0);
74 u0 = u1;
|
| /external/python/cpython3/Objects/stringlib/ |
| replace.h | 9 Py_UCS4 u1, Py_UCS4 u2, Py_ssize_t maxcount)
21 if (*s != u1) {
23 /* search u1 in a dummy loop */
27 if (*s == u1)
30 /* if u1 was not found for attempts iterations,
34 s = memchr(s, u1, end - s);
39 STRINGLIB_CHAR ch1 = (STRINGLIB_CHAR) u1;
|
| /bionic/libm/upstream-freebsd/lib/msun/bsdsrc/ |
| b_log.c | 369 volatile double u1;
399 /* case 1: u1 = u rounded to 2^-43 absolute. Since u < 2^-8,
400 * u1 has at most 35 bits, and F*u1 is exact, as F has < 8 bits.
404 u1 = u + 513, u1 -= 513;
407 * u1 = u to 24 bits.
410 u1 = u, TRUNC(u1);
411 u2 = (2.0*(f - F*u1) - u1*f) * g
438 volatile double u1; local
[all...] |
| /external/e2fsprogs/lib/uuid/ |
| compare.c | 41 #define UUCMP(u1,u2) if (u1 != u2) return((u1 < u2) ? -1 : 1);
|
| /external/ltp/testcases/kernel/fs/fs-bench/ |
| boxmuler.c | 8 double u1, u2, z; local
19 u1 = ((double)(random() % 1000000)) / 1000000;
21 z = sqrt(-2.0 * log(u1)) * cos(M_2PI * u2);
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Tools/unicode/ |
| comparecodecs.py | 35 u1 = c.decode(encoding1)
37 u1 = u'<undefined>'
42 if u1 != u2:
44 (i, u1, u2)
|
| /external/ltp/testcases/kernel/syscalls/syscall/ |
| syscall01.c | 50 uid_t u1, u2; local
52 u1 = getuid();
55 if (u1 == u2) {
59 u1, u2);
|
| /external/python/cpython2/Tools/unicode/ |
| comparecodecs.py | 35 u1 = c.decode(encoding1)
37 u1 = u'<undefined>'
42 if u1 != u2:
44 (i, u1, u2)
|
| /external/python/cpython3/Tools/unicode/ |
| comparecodecs.py | 35 u1 = c.decode(encoding1)
37 u1 = '<undefined>'
42 if u1 != u2:
44 (i, u1, u2))
|
| /external/tensorflow/tensorflow/core/kernels/ |
| cross_op.h | 37 auto u1 = in0_data.template chip<1>(0); local
46 s2.device(d) = u3 * v1 - u1 * v3;
47 s3.device(d) = u1 * v2 - u2 * v1;
|
| /external/clang/test/CodeGen/ |
| mcu-struct-return.c | 9 union U1 {
10 } u1; variable in typeref:union:U1
38 union U1 foo1() { return u1; }
43 struct S1 bar3(union U1 u) { return s1; }
52 union U1 x1 = foo1();
|
| /external/clang/test/Sema/ |
| type-spec-struct-union.c | 11 } u1; member in struct:S1
15 if (s1->u1.x == s2) return 1;
16 if (s1->u1.y == s3) return 1;
22 if (s1->u1.x == s2) return 1; /* expected-warning {{comparison of distinct pointer types ('struct S2 *' and 'struct S2 *')}} */
|
| /external/mesa3d/src/util/ |
| u_string.h | 161 unsigned char u1, u2; local
164 u1 = (unsigned char) *s1++;
166 if (u1 != u2)
167 return u1 - u2;
168 if (u1 == '\0')
177 unsigned char u1, u2; local
180 u1 = (unsigned char) *s1++;
182 if (u1 != u2)
183 return u1 - u2;
184 if (u1 == '\0'
[all...] |
| /external/python/cpython3/Modules/_decimal/libmpdec/ |
| difradix2.c | 81 mpd_uint_t u0, u1, v0, v1; local
102 u1 = a[j+1];
108 a[j+1] = addmod(u1, v1, umod);
109 v1 = submod(u1, v1, umod);
129 u1 = a[m+r];
135 a[m+r] = addmod(u1, v1, umod);
136 v1 = submod(u1, v1, umod);
151 u1 = a[m+r+j];
157 a[m+r+j] = addmod(u1, v1, umod);
158 v1 = submod(u1, v1, umod)
[all...] |
