| /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;
87 ((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) {
42 bool dexReadAndVerifyClassDataHeader(const u1** pData, const u1* pLimit,
63 bool dexReadAndVerifyClassDataField(const u1** pData, const u1* pLimit,
84 bool dexReadAndVerifyClassDataMethod(const u1** pData, const u1* pLimit,
104 DexClassData* dexReadAndVerifyClassData(const u1** pData, const u1* pLimit)
[all...] |
| DexUtf.h | 85 u1 c = (u1) **pUtf8Ptr;
|
| InstrUtils.h | 89 typedef u1 InstructionWidth;
94 typedef u1 OpcodeFlags;
108 * Note: We use "u1*" here instead of the names of the enumerated
115 u1* formats; /* InstructionFormat elements */
116 u1* indexTypes; /* InstructionIndexType elements */
|
| /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 | 63 public void write(short u0, short u1) {
65 write(u1);
69 public void write(short u0, short u1, short u2) {
71 write(u1);
76 public void write(short u0, short u1, short u2, short u3) {
78 write(u1);
84 public void write(short u0, short u1, short u2, short u3, short u4) {
86 write(u1);
|
| /external/dexmaker/src/dx/java/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 | 63 public void write(short u0, short u1) {
65 write(u1);
69 public void write(short u0, short u1, short u2) {
71 write(u1);
76 public void write(short u0, short u1, short u2, short u3) {
78 write(u1);
84 public void write(short u0, short u1, short u2, short u3, short u4) {
86 write(u1);
|
| /external/clang/test/SemaTemplate/ |
| fun-template-def.cpp | 19 T f1(T t1, U u1, int i1)
22 t2 = i1 + u1;
23 ++u1;
24 u1++;
25 int i2 = u1;
27 i1 = t1[u1];
30 i1(u1, t1); // error
31 u1(i1, t1);
38 new int(t1, u1);
39 new (t1, u1) int
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GraphTest.cpp | 39 ListDigraph::Node* u1 = graph.addNode(); local
43 ASSERT_TRUE(NULL == u1->first_in);
44 ASSERT_TRUE(NULL == u1->first_out);
45 ASSERT_TRUE(u2 == u1->prev);
46 ASSERT_TRUE(NULL == u1->next);
51 ASSERT_TRUE(u1 == u2->next);
64 ASSERT_TRUE(NULL == u1->first_in);
65 ASSERT_TRUE(NULL == u1->first_out);
66 ASSERT_TRUE(u3 == u1->prev);
67 ASSERT_TRUE(NULL == u1->next)
86 ListDigraph::Node* u1 = graph.addNode(); local
133 ListDigraph::Node* u1 = graph.addNode(); local
180 ListDigraph::Node* u1 = graph.addNode(); local
200 ListDigraph::Node* u1 = graph.addNode(); local
220 ListDigraph::Node* u1 = graph.addNode(); local
246 ListDigraph::Node* u1 = graph.addNode(); local
272 ListDigraph::Node* u1 = graph.addNode(); local
298 ListDigraph::Node* u1 = graph.addNode(); local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/net/ |
| URLTest.java | 47 URL u1; field in class:URLTest
78 u1 = new URL("http://www.yahoo2.com:9999");
79 assertEquals("u1 returns a wrong protocol", "http", u1.getProtocol());
80 assertEquals("u1 returns a wrong host", "www.yahoo2.com", u1.getHost());
81 assertEquals("u1 returns a wrong port", 9999, u1.getPort());
82 assertTrue("u1 returns a wrong file", u1.getFile().equals(""))
240 URL u1 = null; local
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/bsdsrc/ |
| b_log.c | 368 volatile double u1;
398 /* case 1: u1 = u rounded to 2^-43 absolute. Since u < 2^-8,
399 * u1 has at most 35 bits, and F*u1 is exact, as F has < 8 bits.
403 u1 = u + 513, u1 -= 513;
406 * u1 = u to 24 bits.
409 u1 = u, TRUNC(u1);
410 u2 = (2.0*(f - F*u1) - u1*f) * g
437 volatile double u1; local
[all...] |
| /external/e2fsprogs/lib/uuid/ |
| compare.c | 40 #define UUCMP(u1,u2) if (u1 != u2) return((u1 < u2) ? -1 : 1);
|
| uuid.h | 58 #define UUID_DEFINE(name,u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15) \
59 static const uuid_t name __attribute__ ((unused)) = {u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15}
61 #define UUID_DEFINE(name,u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15) \
62 static const uuid_t name = {u0,u1,u2,u3,u4,u5,u6,u7,u8,u9,u10,u11,u12,u13,u14,u15}
|
| /external/clang/test/Parser/ |
| cxx-friend.cpp | 17 int u1; member in union:U
|
| /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/gallium/auxiliary/util/ |
| u_string.h | 112 unsigned char u1, u2; local
115 u1 = (unsigned char) *s1++;
117 if (u1 != u2)
118 return u1 - u2;
119 if (u1 == '\0')
128 unsigned char u1, u2; local
131 u1 = (unsigned char) *s1++;
133 if (u1 != u2)
134 return u1 - u2;
135 if (u1 == '\0'
[all...] |
| /external/v8/test/mjsunit/ |
| never-optimize.js | 43 %NeverOptimizeFunction(u1);
44 function u1() {
48 u1();
51 u1(); u1();
54 %OptimizeFunctionOnNextCall(u1);
57 u1(); u1();
61 assertUnoptimized(u1);
|
| /external/libcxx/test/std/utilities/utility/pairs/pair.piecewise/ |
| piecewise_construct.pass.cpp | 37 B(double d, unsigned u1, unsigned u2) : d_(d), u1_(u1), u2_(u2) {}
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/utility/pairs/pair.piecewise/ |
| piecewise_construct.pass.cpp | 37 B(double d, unsigned u1, unsigned u2) : d_(d), u1_(u1), u2_(u2) {}
|
