| /dalvik/dexgen/src/com/android/dexgen/rop/code/ |
| BasicBlockList.java | 112 BasicBlock one = (BasicBlock) getOrNull0(i); local
113 if (one != null) {
114 result += one.getInsns().size();
132 BasicBlock one = (BasicBlock) getOrNull0(i); local
133 if (one != null) {
134 InsnList insns = one.getInsns();
178 BasicBlock one = get(i); local
179 InsnList insns = one.getInsns();
185 * Returns an instance that is identical to this one, except that
198 BasicBlock one = (BasicBlock) get0(i) local
[all...] |
| /dalvik/dx/src/com/android/dx/dex/file/ |
| MixedItemSection.java | 163 * same item to more than one instance, nor to add the same items
186 * (which may not be the one passed in). This will add the item if no
278 OffsettedItem one = items.get(i); local
279 one.addContents(file);
309 OffsettedItem one = items.get(i); local
311 int placedAt = one.place(this, outAt);
315 one);
318 outAt = placedAt + one.writeSize();
321 "...while placing " + one);
336 for (OffsettedItem one : items)
[all...] |
| /dalvik/dx/src/com/android/dx/rop/code/ |
| BasicBlockList.java | 112 BasicBlock one = (BasicBlock) getOrNull0(i); local
113 if (one != null) {
114 result += one.getInsns().size();
132 BasicBlock one = (BasicBlock) getOrNull0(i); local
133 if (one != null) {
134 InsnList insns = one.getInsns();
177 BasicBlock one = get(i); local
178 InsnList insns = one.getInsns();
184 * Returns an instance that is identical to this one, except that
197 BasicBlock one = (BasicBlock) get0(i) local
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| MixedItemSection.java | 164 * same item to more than one instance, nor to add the same items
187 * (which may not be the one passed in). This will add the item if no
279 OffsettedItem one = items.get(i); local
280 one.addContents(file);
310 OffsettedItem one = items.get(i); local
312 int placedAt = one.place(this, outAt);
316 one);
319 outAt = placedAt + one.writeSize();
322 "...while placing " + one);
337 for (OffsettedItem one : items)
[all...] |
| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| BasicBlockList.java | 112 BasicBlock one = (BasicBlock) getOrNull0(i); local
113 if (one != null) {
114 result += one.getInsns().size();
132 BasicBlock one = (BasicBlock) getOrNull0(i); local
133 if (one != null) {
134 InsnList insns = one.getInsns();
177 BasicBlock one = get(i); local
178 InsnList insns = one.getInsns();
184 * Returns an instance that is identical to this one, except that
197 BasicBlock one = (BasicBlock) get0(i) local
[all...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 100 int one = 1; local
109 ib[1].reset(&one);
123 id[2].reset(&one);
131 ie[2].reset(&one);
140 ig[2].reset(&one);
141 ig[3].reset(&one);
149 ih[1].reset(&one);
150 ih[2].reset(&one);
158 ii[1].reset(&one);
159 ii[2].reset(&one);
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.unique/ |
| unique.pass.cpp | 100 int one = 1; local
109 ib[1].reset(&one);
123 id[2].reset(&one);
131 ie[2].reset(&one);
140 ig[2].reset(&one);
141 ig[3].reset(&one);
149 ih[1].reset(&one);
150 ih[2].reset(&one);
158 ii[1].reset(&one);
159 ii[2].reset(&one);
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/ |
| ByteCatchList.java | 107 Item one = get(i); local
108 if (one.covers(pc) && typeNotFound(one, resultArr, resultSz)) {
109 resultArr[resultSz] = one;
142 CstType one = arr[i].getExceptionClass(); local
143 if ((one == type) || (one == CstType.OBJECT)) {
200 * Returns a rop-style catches list equivalent to this one.
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| ByteCatchList.java | 107 Item one = get(i); local
108 if (one.covers(pc) && typeNotFound(one, resultArr, resultSz)) {
109 resultArr[resultSz] = one;
142 CstType one = arr[i].getExceptionClass(); local
143 if ((one == type) || (one == CstType.OBJECT)) {
200 * Returns a rop-style catches list equivalent to this one.
|
| /external/chromium_org/v8/test/mjsunit/ |
| array-functions-prototype.js | 35 var proto = { length:3, 0:'zero', 1:'one', 2:'two' }
41 Array.prototype[1] = 'one';
73 // 'one' in V8 and KJS.
74 assertEquals('one', array[0]);
75 assertEquals('one', nonArray[0]);
106 // instead of 'one'.
107 assertEquals('one', array[2]);
108 assertEquals('one', nonArray[2]);
133 // instead of 'one'.
134 assertEquals('one', array[0])
[all...] |
| smi-ops-inlined.js | 32 const ONE = 1;
61 assertEquals(SMI_MAX + ONE, Add1(SMI_MAX), "smimax + 1");
62 assertEquals(SMI_MAX + ONE, Add1Reversed(SMI_MAX), "1 + smimax");
63 assertEquals(42 + ONE, Add1(OBJ_42)); // non-smi
64 assertEquals(42 + ONE, Add1Reversed(OBJ_42)); // non-smi
94 assertEquals(SMI_MIN - ONE, Sub1(SMI_MIN)); // overflow
95 assertEquals(ONE - SMI_MIN, Sub1Reversed(SMI_MIN)); // overflow
96 assertEquals(42 - ONE, Sub1(OBJ_42)); // non-smi
97 assertEquals(ONE - 42, Sub1Reversed(OBJ_42)); // non-smi
442 var one = 1
[all...] |
| smi-ops.js | 30 const ONE = 1;
59 assertEquals(SMI_MAX + ONE, Add1(SMI_MAX), "smimax + 1");
60 assertEquals(SMI_MAX + ONE, Add1Reversed(SMI_MAX), "1 + smimax");
61 assertEquals(42 + ONE, Add1(OBJ_42)); // non-smi
62 assertEquals(42 + ONE, Add1Reversed(OBJ_42)); // non-smi
92 assertEquals(SMI_MIN - ONE, Sub1(SMI_MIN)); // overflow
93 assertEquals(ONE - SMI_MIN, Sub1Reversed(SMI_MIN)); // overflow
94 assertEquals(42 - ONE, Sub1(OBJ_42)); // non-smi
95 assertEquals(ONE - 42, Sub1Reversed(OBJ_42)); // non-smi
449 var one = 1
[all...] |
| keyed-call-ic.js | 54 F.prototype.one = function() {return 'one'; }
59 ['one', 'one', 'one', 'one', 'two', 'two', 'one', 'three', 'one', 'two'];
112 key = 'one';
161 var m = 'one';
[all...] |
| keyed-call-generic.js | 73 function one () { return 1; } function
76 var fixed_array = [zero, one, two];
78 var dict_array = [ zero, one, two ];
81 var fast_prop = { zero: zero, one: one, two: two };
83 var normal_prop = { zero: zero, one: one, two: two };
88 var first3str = ['zero', 'one', 'two'];
113 testException([zero, one, /* hole */ ], [0, 1, 2], [false, false, true]);
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_lgamma_r.c | 73 * Note: one should avoid compute pi*(-x) directly in the
92 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable
195 case 4: y = __kernel_sin(pi*(one-y),zero,0); break;
217 if((ix|lx)==0) return one/zero;
226 return one/zero;
228 if(t==zero) return one/zero; /* -integer */
240 if(ix>=0x3FE76944) {y = one-x; i= 0;}
241 else if(ix>=0x3FCDA661) {y= x-(tc-one); i=1;}
247 else {y=x-one;i=2;}
266 p2 = one+y*(v1+y*(v2+y*(v3+y*(v4+y*v5))))
[all...] |
| e_lgammaf_r.c | 25 one = 1.0000000000e+00, /* 0x3f800000 */ variable
128 case 4: y = __kernel_sindf(pi*(one-y)); break;
150 if(ix==0) return one/zero;
159 return one/zero;
161 if(t==zero) return one/zero; /* -integer */
173 if(ix>=0x3f3b4a20) {y = one-x; i= 0;}
174 else if(ix>=0x3e6d3308) {y= x-(tc-one); i=1;}
180 else {y=x-one;i=2;}
199 p2 = one+y*(v1+y*(v2+y*(v3+y*(v4+y*v5))));
207 q = one+y*(r1+y*(r2+y*(r3+y*(r4+y*(r5+y*r6)))))
[all...] |
| /external/fdlibm/ |
| e_lgamma_r.c | 70 * Note: one should avoid compute pi*(-x) directly in the
91 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable
197 case 4: y = __kernel_sin(pi*(one-y),zero,0); break;
223 if((ix|lx)==0) return one/zero;
232 return one/zero;
234 if(t==zero) return one/zero; /* -integer */
246 if(ix>=0x3FE76944) {y = one-x; i= 0;}
247 else if(ix>=0x3FCDA661) {y= x-(tc-one); i=1;}
253 else {y=x-one;i=2;}
272 p2 = one+y*(v1+y*(v2+y*(v3+y*(v4+y*v5))))
[all...] |
| /external/stlport/test/unit/ |
| string_test.cpp | 640 string s("one two three one two three");
641 CPPUNIT_ASSERT( s.find("one") == 0 );
653 CPPUNIT_ASSERT( s.find("one", string::npos) == npos_local );
763 string s("one two three one two three");
784 string s("one two three one two three");
802 string s("one two three one two three")
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| string_test.cpp | 640 string s("one two three one two three");
641 CPPUNIT_ASSERT( s.find("one") == 0 );
653 CPPUNIT_ASSERT( s.find("one", string::npos) == npos_local );
763 string s("one two three one two three");
784 string s("one two three one two three");
802 string s("one two three one two three")
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| string_test.cpp | 640 string s("one two three one two three");
641 CPPUNIT_ASSERT( s.find("one") == 0 );
653 CPPUNIT_ASSERT( s.find("one", string::npos) == npos_local );
763 string s("one two three one two three");
784 string s("one two three one two three");
802 string s("one two three one two three")
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| Intersections.cpp | 92 int Intersections::insert(double one, double two, const _Point& pt) {
98 if (roughly_equal(oldOne, one) && roughly_equal(oldTwo, two)) {
99 if ((precisely_zero(one) && !precisely_zero(oldOne))
100 || (precisely_equal(one, 1) && !precisely_equal(oldOne, 1))
103 fT[0][index] = one;
111 SkDebugf("%s t=%1.9g pts roughly equal\n", __FUNCTION__, one);
114 if (fT[0][index] > one) {
128 fT[0][index] = one;
134 void Intersections::remove(double one, double two, const _Point& startPt, const _Point& endPt) {
136 if (!(fIsCoincident[0] & (1 << index)) && (between(one, fT[fSwap][index], two
[all...] |
| /external/chromium_org/tools/clang/plugins/ |
| ChromeClassTester.cpp | 20 bool starts_with(const std::string& one, const std::string& two) {
21 return one.compare(0, two.size(), two) == 0;
24 std::string lstrip(const std::string& one, const std::string& two) {
25 if (starts_with(one, two))
26 return one.substr(two.size());
27 return one;
30 bool ends_with(const std::string& one, const std::string& two) {
31 if (two.size() > one.size())
34 return one.compare(one.size() - two.size(), two.size(), two) == 0
[all...] |
| /external/llvm/test/MC/AsmParser/ |
| floating-literals.s | 60 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
64 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
68 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one exponent digit
72 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one significand digit
76 # CHECK-ERROR: invalid hexadecimal floating-point constant: expected at least one significand digit
|
| /external/skia/experimental/Intersection/ |
| Intersections.cpp | 92 int Intersections::insert(double one, double two, const _Point& pt) {
98 if (roughly_equal(oldOne, one) && roughly_equal(oldTwo, two)) {
99 if ((precisely_zero(one) && !precisely_zero(oldOne))
100 || (precisely_equal(one, 1) && !precisely_equal(oldOne, 1))
103 fT[0][index] = one;
111 SkDebugf("%s t=%1.9g pts roughly equal\n", __FUNCTION__, one);
114 if (fT[0][index] > one) {
128 fT[0][index] = one;
134 void Intersections::remove(double one, double two, const _Point& startPt, const _Point& endPt) {
136 if (!(fIsCoincident[0] & (1 << index)) && (between(one, fT[fSwap][index], two
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerTest.java | 2 * Licensed to the Apache Software Foundation (ASF) under one or more
31 BigInteger one = new BigInteger("1", 10); field in class:BigIntegerTest
220 assertTrue("0=1", !zero.equals(one));
222 assertTrue("1=-1", !one.equals(minusOne));
232 assertTrue("Smaller number returned >= 0", one.compareTo(two) < 0);
233 assertTrue("Larger number returned >= 0", two.compareTo(one) > 0);
234 assertTrue("Equal numbers did not return 0", one.compareTo(one) == 0);
236 two.negate().compareTo(one) < 0);
274 assertTrue("0+1", zero.add(one).equals(one))
[all...] |
