| /external/dexmaker/src/dx/java/com/android/dx/rop/code/ |
| InsnList.java | 105 * Returns an instance that is identical to this one, except that
118 Insn one = (Insn) get0(i); local
119 if (one != null) {
120 result.set0(i, one.withRegisterOffset(delta));
|
| 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/fdlibm/ |
| s_modf.c | 27 static const double one = 1.0; variable
29 static double one = 1.0; variable
63 *iptr = x*one;
|
| e_asin.c | 52 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable
87 if(huge+x>one) return x;/* return x with inexact if x!=0*/
91 q = one+t*(qS1+t*(qS2+t*(qS3+t*qS4)));
96 w = one-ieee_fabs(x);
99 q = one+t*(qS1+t*(qS2+t*(qS3+t*qS4)));
|
| 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/webkit/Source/JavaScriptCore/tests/mozilla/js1_2/operator/ |
| strictEquality.js | 57 var anObject = { one:1 , two:2 };
62 testcases[count++] = new TestCase( SECTION, "(anObject === { one:1 , two:2 }) ",
63 false, (anObject === { one:1 , two:2 }));
65 testcases[count++] = new TestCase( SECTION, "({ one:1 , two:2 } === anObject) ",
66 false, ({ one:1 , two:2 } === anObject));
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Regress/ |
| regress-103602.js | 32 * the terms of any one of the NPL, the GPL or the LGPL.
72 sEval = 'const one = 1';
88 sEval = 'const one = 2;';
109 one = 2;
115 actual = one;
121 actual = (one = 2);
|
| /bionic/libm/upstream-freebsd/lib/msun/bsdsrc/ |
| b_tgamma.c | 126 static const double zero = 0., one = 1.0, tiny = 1e-300; variable
145 u.a = one - tiny; /* raise inexact */
146 return (one/x);
162 z = one/(x*x);
167 u.a -= one;
190 y = x - one;
191 ym1 = y - one;
198 yy.a = r.a - one;
202 for (ym1 = y-one; ym1 > LEFT + x0; y = ym1--, yy.a--) {
230 t = (one-x0); t += x
[all...] |
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| e_asin.c | 53 one = 1.00000000000000000000e+00, /* 0x3FF00000, 0x00000000 */ variable
86 if(huge+x>one) return x;/* return x with inexact if x!=0*/
90 q = one+t*(qS1+t*(qS2+t*(qS3+t*qS4)));
95 w = one-fabs(x);
98 q = one+t*(qS1+t*(qS2+t*(qS3+t*qS4)));
|
| e_sqrt.c | 20 * | Use the hardware sqrt if you have one |
35 * To compute q from q , one checks whether
64 * One may easily use induction to prove (4) and (5).
69 * After generating the 53 bits result, we compute one more bit.
92 static const double one = 1.0, tiny=1.0e-300; variable
172 z = one-tiny; /* trigger inexact flag */
173 if (z>=one) {
174 z = one+tiny;
176 else if (z>one) {
205 The second one uses reciproot iterations to avoid division, bu
[all...] |
| 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/webkit/Source/JavaScriptCore/wtf/ |
| Bitmap.h | 57 static const WordType one = 1; member in class:WTF::Bitmap
71 return !!(bits[n / wordSize] & (one << (n % wordSize)));
77 bits[n / wordSize] |= (one << (n % wordSize));
83 WordType mask = one << (n % wordSize);
93 bits[n / wordSize] &= ~(one << (n % wordSize));
|
| /dalvik/dexgen/src/com/android/dexgen/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...] |
| /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 | 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...] |
| /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...] |
| /ndk/sources/cxx-stl/llvm-libc++/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/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...] |
| /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...] |
