| /external/chromium_org/v8/test/cctest/compiler/ |
| test-phi-reducer.cc | 99 Node* one = R.Int32Constant(1); local
103 Node* singles[] = {zero, one, oneish, param};
113 Node* one = R.Int32Constant(1); local
117 Node* singles[] = {zero, one, oneish, param};
143 Node* one = R.Int32Constant(1); local
147 Node* singles[] = {zero, one, oneish, param};
177 Node* one = R.Int32Constant(1); local
181 Node* singles[] = {zero, one, oneish, param};
220 Node* one = R.Int32Constant(1); local
224 Node* singles[] = {zero, one, oneish, param}
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| ConcurrentModTest.java | 2 * Licensed to the Apache Software Foundation (ASF) under one or more
36 Double one = new Double(1.0); local
40 al.add(one);
80 Double one = new Double(1.0); local
84 al.add(one);
110 Double one = new Double(1.0); local
114 al.add(one);
140 Double one = new Double(1.0); local
144 al.add(one);
206 Double one = new Double(1.0) local
[all...] |
| /packages/apps/PhoneCommon/src/com/android/phone/common/dialpad/ |
| DialpadView.java | 74 private final int[] mButtonIds = new int[] {R.id.zero, R.id.one, R.id.two, R.id.three,
165 final DialpadKeyButton one = (DialpadKeyButton) findViewById(R.id.one); local
166 one.setLongHoverContentDescription(
287 case R.id.one: return KEY_FRAME_DURATION * 9;
295 case R.id.one: return KEY_FRAME_DURATION * 1;
312 case R.id.one: return KEY_FRAME_DURATION * 1;
343 case R.id.one:
361 case R.id.one:
380 case R.id.one
[all...] |
| /external/chromium_org/third_party/skia/src/pathops/ |
| SkIntersections.h | 100 int insertSwap(double one, double two, const SkDPoint& pt) {
102 return insert(two, one, pt);
104 return insert(one, two, pt);
220 void cubicInsert(double one, double two, const SkDPoint& pt, const SkDCubic& c1,
232 int insert(double one, double two, const SkDPoint& pt);
233 void insertNear(double one, double two, const SkDPoint& pt1, const SkDPoint& pt2);
235 void insertCoincident(double one, double two, const SkDPoint& pt);
|
| /external/qemu/distrib/sdl-1.2.15/src/video/ |
| e_pow.h | 114 if((iy|ly)==0) return one;
152 if(hy<0) return one/x; else return x;
166 if(hy<0) z = one/z; /* z = (1/|x|) */
186 /* over/underflow if x is not close to one */
215 v = one/(ax+bp[k]);
248 s = one; /* s (sign of result -ve**odd) = -1 else = 1 */
250 s = -one;/* (-ve)**(odd int) */
296 z = one-(r-z);
|
| /external/skia/src/pathops/ |
| SkIntersections.h | 100 int insertSwap(double one, double two, const SkDPoint& pt) {
102 return insert(two, one, pt);
104 return insert(one, two, pt);
220 void cubicInsert(double one, double two, const SkDPoint& pt, const SkDCubic& c1,
232 int insert(double one, double two, const SkDPoint& pt);
233 void insertNear(double one, double two, const SkDPoint& pt1, const SkDPoint& pt2);
235 void insertCoincident(double one, double two, const SkDPoint& pt);
|
| /external/chromium_org/v8/test/webkit/fast/js/kde/ |
| operators.js | 206 var one = 1; variable
211 shouldBe("8 >> one", "4");
216 shouldBe("(-2200000000 >> one) << one", "2094967296");
217 shouldBe("Infinity >> one", "0");
218 shouldBe("Infinity << one", "0");
219 shouldBe("Infinity >>> one", "0");
220 shouldBe("NaN >> one", "0");
221 shouldBe("NaN << one", "0");
222 shouldBe("NaN >>> one", "0")
[all...] |
| /external/oprofile/events/i386/nehalem/ |
| events | 11 event:0x3c counters:0,1,2,2 um:one minimum:6000 name:UNHALTED_REFERENCE_CYCLES : Unhalted reference cycles
23 event:0x07 counters:0,1,2,3 um:one minimum:6000 name:PARTIAL_ADDRESS_ALIAS : Counts false dependency due to partial address aliasing
34 event:0x17 counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITES : Counts the number of instructions written into the instruction queue every cycle.
36 event:0x19 counters:0,1,2,3 um:one minimum:6000 name:TWO_UOP_INSTS_DECODED : An instruction that generates two uops was decoded
38 event:0x1E counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITE_CYCLES : This event counts the number of cycles during which instructions are written to the instruction queue. Dividing this counter by the number of instructions written to the instruction queue (INST_QUEUE_WRITES) yields the average number of instructions decoded each cycle. If this number is less than four and the pipe stalls, this indicates that the decoder is failing to decode enough instructions per cycle to sustain the 4-wide pipeline.
45 event:0x3D counters:0,1,2,3 um:one minimum:6000 name:UOPS_DECODED_DEC0 : Counts micro-ops decoded by decoder 0.
52 event:0x4C counters:0,1,2,3 um:one minimum:6000 name:LOAD_HIT_PRE : Counts load operations sent to the L1 data cache while a previous SSE prefetch instruction to the same cache line has started prefetching but has not yet finished.
53 event:0x4D counters:0,1,2,3 um:one minimum:6000 name:SFENCE_CYCLES : Counts store fence cycles
57 event:0x52 counters:0,1,2,3 um:one minimum:6000 name:L1D_CACHE_PREFETCH_LOCK_FB_HIT : Counts the number of cacheable load lock speculated instructions accepted into the fill buffer.
58 event:0x53 counters:0,1,2,3 um:one minimum:6000 name:L1D_CACHE_LOCK_FB_HIT : Counts the number of cacheable load lock speculated or r (…)
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| EdgeWalker_TestUtility.cpp | 172 static void scaleMatrix(const SkPath& one, const SkPath& two, SkMatrix& scale) {
173 SkRect larger = one.getBounds();
231 static int pathsDrawTheSame(const SkPath& one, const SkPath& two, SkBitmap& bits, SkPath& scaledOne,
234 scaleMatrix(one, two, scale);
235 one.transform(scale, &scaledOne);
240 bool drawAsciiPaths(const SkPath& one, const SkPath& two, bool drawPaths) {
244 const SkRect& bounds1 = one.getBounds();
265 canvas.drawPath(one, paint);
288 static void showSimplifiedPath(const SkPath& one, const SkPath& two,
290 showPath(one, "original:")
[all...] |
| /external/skia/experimental/Intersection/ |
| EdgeWalker_TestUtility.cpp | 172 static void scaleMatrix(const SkPath& one, const SkPath& two, SkMatrix& scale) {
173 SkRect larger = one.getBounds();
231 static int pathsDrawTheSame(const SkPath& one, const SkPath& two, SkBitmap& bits, SkPath& scaledOne,
234 scaleMatrix(one, two, scale);
235 one.transform(scale, &scaledOne);
240 bool drawAsciiPaths(const SkPath& one, const SkPath& two, bool drawPaths) {
244 const SkRect& bounds1 = one.getBounds();
265 canvas.drawPath(one, paint);
288 static void showSimplifiedPath(const SkPath& one, const SkPath& two,
290 showPath(one, "original:")
[all...] |
| /external/elfutils/0.153/src/ |
| ldscript.y | 64 static struct version *merge_versions (struct version *one,
184 /* First little optimization. If there is only one
378 /* First little optimization. If there is only one
670 merge_versions (struct version *one, struct version *two)
676 if (one->local_names == NULL)
677 one->local_names = two->local_names;
680 two->local_names->next = one->local_names->next;
681 one->local_names = one->local_names->next = two->local_names;
686 if (one->global_names == NULL
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| SynchronousQueueTest.java | 47 assertFalse(q.offer(one));
59 q.add(one);
138 q.put(one);
150 try { assertSame(one, q.take()); }
462 assertFalse(q.offer(one));
464 assertTrue(q.offer(one, LONG_DELAY_MS, MILLISECONDS));
471 assertSame(one, q.take());
490 assertSame(one, q.poll(LONG_DELAY_MS, MILLISECONDS));
497 q.put(one);
546 q.put(one);
[all...] |
| ConcurrentSkipListSubMapTest.java | 23 map.put(one, "A");
31 return map.subMap(one, true, seven, false);
53 return map.tailMap(one, true);
89 assertTrue(map.containsKey(one));
108 assertEquals("A", (String)map.get(one));
110 assertNull(empty.get(one));
128 assertEquals(one, map.firstKey());
146 assertTrue(s.contains(one));
161 assertEquals(last, one);
236 (e.getKey().equals(one) && e.getValue().equals("A")) |
[all...] |
| TreeSubMapTest.java | 21 map.put(one, "A");
29 return map.subMap(one, true, seven, false);
35 return map.tailMap(one, true);
87 assertTrue(map.containsKey(one));
106 assertEquals("A", (String)map.get(one));
108 assertNull(empty.get(one));
126 assertEquals(one, map.firstKey());
144 assertTrue(s.contains(one));
159 assertEquals(last, one);
192 (e.getKey().equals(one) && e.getValue().equals("A")) |
[all...] |
| /external/chromium_org/net/quic/ |
| quic_time_test.cc | 141 const QuicTime one = zero.Add(QuicTime::Delta::FromSeconds(1)); local
143 EXPECT_TRUE(zero <= one);
144 EXPECT_TRUE(one <= one);
145 EXPECT_FALSE(one <= zero);
|
| /external/chromium_org/third_party/openmax_dl/dl/sp/src/arm/neon/ |
| omxSP_FFTInv_CCSToR_F32_Sfs_s.S | 133 @// one must be the same as dScale[0]!
135 #define one S4.F32 define
263 VMOV one, 1.0
264 VDIV one, one, fN @ one = dScale[0] = 1 / fftSize
|
| /external/clang/test/SemaCXX/ |
| cxx0x-initializer-constructor.cpp | 3 struct one { char c[1]; }; struct
134 one ov1(B); // expected-note {{not viable: cannot convert initializer list}}
139 static_assert(sizeof(ov1({{1, 1.0}, 2, {3, 4}})) == sizeof(one), "bad overload");
143 one ov2(int);
145 static_assert(sizeof(ov2({1})) == sizeof(one), "bad overload"); // list -> int ranks as identity
|
| cxx0x-initializer-stdinitializerlist.cpp | 45 struct one { char c[1]; }; struct
83 one overloaded(std::initializer_list<int>);
86 static_assert(sizeof(overloaded({1, 2, 3})) == sizeof(one), "bad overload");
93 one ov2(std::initializer_list<int>); // expected-note {{candidate}}
96 static_assert(sizeof(ov2({1, 2, 3})) == sizeof(one), "bad overload");
|
| /external/chromium_org/third_party/codesighs/ |
| maptsvdifftool.c | 37 * the terms of any one of the MPL, the GPL or the LGPL.
210 ModuleStats* one = (ModuleStats*)in1; local
213 int oneSize = (one->mSize.mCode + one->mSize.mData);
226 retval = strcmp(one->mModule, two->mModule);
244 SegmentStats* one = (SegmentStats*)in1; local
247 if(one->mSize < two->mSize)
251 else if(one->mSize > two->mSize)
257 retval = strcmp(one->mSegment, two->mSegment);
258 if(0 > one->mSize && 0 > two->mSize
275 ObjectStats* one = (ObjectStats*)in1; local
306 SymbolStats* one = (SymbolStats*)in1; local
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/code/form/ |
| Form3rc.java | 67 * Add one to properly represent a list-final
136 RegisterSpec one = regs.get(i); local
137 if (one.getReg() != next) {
140 next += one.getCategory();
|
| /external/chromium_org/sync/syncable/ |
| model_type_unittest.cc | 116 syncer::ModelTypeSet one(BOOKMARKS);
122 one.Equals(ModelTypeSetFromString(ModelTypeSetToString(one))));
|
| /external/chromium_org/third_party/angle/src/libGLESv2/renderer/ |
| vertexconversion.h | 136 static T one() { return static_cast<T>(1); } function in struct:rx::SimpleDefaultValues
144 static T one() { return std::numeric_limits<T>::max(); } function in struct:rx::NormalizedDefaultValues
172 copyComponent(out, ein, 3, static_cast<OutputType>(DefaultValueRule::one()));
|
| /external/chromium_org/third_party/mesa/src/docs/ |
| MESA_multithread_makecurrent.spec | 38 ensuring that the glFlush happens in one thread before another
67 In addition, a rendering context can be current for only one
71 only one thread at a time. A direct rendering context may be
107 threads, then binds a different context/thread in one of them?
114 threads, then binds None/None in one of them?
120 then destroys the context in one of them?
|
| /external/chromium_org/third_party/skia/src/opts/ |
| SkBitmapProcState_matrix_neon.h | 233 SkFixed one PREAMBLE_PARAM_Y) {
236 return (i << 14) | (TILEY_PROCF((f + one), max));
240 SkFixed one PREAMBLE_PARAM_X) {
243 return (i << 14) | (TILEX_PROCF((f + one), max));
247 SkFixed one PREAMBLE_PARAM_X) {
251 wide_one = vdupq_n_s32(one);
268 SkFixed one PREAMBLE_PARAM_X) {
272 wide_one = vdupq_n_s32(one);
297 const SkFixed one = s.fFilterOneX; local
310 fx = SkScalarToFractionalInt(pt.fX) - (SkFixedToFractionalInt(one) >> 1)
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
| sampler_test.cc | 526 uint64_t one = 1; local
528 uint64_t sample_parameter_array[4] = {0, 1, one<<19, one<<58};
551 * (sample_parameter/(one<<24) + 1);
566 CHECK_LE(largest_sample_step, one<<63);
577 uint64_t one = 1; local
578 // The next number should be (one << 48) - 1
579 uint64_t max_value = (one << 48) - 1;
580 uint64_t x = (one << 55);
596 uint64_t one = 1 local
[all...] |
