HomeSort by relevance Sort by last modified time
    Searched refs:COUNT (Results 1 - 25 of 32) sorted by null

1 2

  /packages/experimental/RpcPerformance/
rpcperftest.cpp 29 static const int COUNT = 10000;
82 for (int i = 0; i < COUNT; i++) {
94 COUNT, seconds, 1000.0 * seconds / COUNT);
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
BitmapMesh.java 38 private static final int COUNT = (WIDTH + 1) * (HEIGHT + 1);
41 private final float[] mVerts = new float[COUNT*2];
42 private final float[] mOrig = new float[COUNT*2];
89 for (int i = 0; i < COUNT*2; i += 2) {
  /external/openssl/crypto/rc2/
rc2speed.c 176 long count; local
196 count=10;
201 count*=2;
203 for (i=count; i; i--)
207 ca=count/512;
208 cb=count;
209 cc=count*8/BUFSIZE+1;
211 #define COND(d) (count != (d))
212 #define COUNT(d) (d)
215 #define COUNT(d) (count
    [all...]
  /development/tools/axl/
axl.py 131 COUNT = 0
137 if (not(DropOnce.COUNT & 1)):
143 DropOnce.COUNT += 1
158 COUNT = 0
161 if not PipeDrop.COUNT % 3:
166 PipeDrop.COUNT += 1
170 PipeDrop.COUNT += 1
188 self.count = 0
192 self.count += len(data)
193 if self.count == 190890
    [all...]
  /external/openssl/crypto/des/
speed.c 181 long count; local
203 count=10;
208 count*=2;
210 for (i=count; i; i--)
214 ca=count;
215 cb=count*3;
216 cc=count*3*8/BUFSIZE+1;
217 cd=count*8/BUFSIZE+1;
218 ce=count/20+1;
220 #define COND(d) (count != (d)
    [all...]
des_opts.c 405 for (count=0,run=1; COND(cb); count++) \
411 fprintf(stderr,"%ld %s's in %.2f second\n",count,name,tm[index]); \
412 tm[index]=((double)COUNT(cb))/tm[index];
420 long count; local
452 count=10;
457 count*=2;
459 for (i=count; i; i--)
463 ca=count;
464 cb=count*3
    [all...]
  /external/openssl/crypto/rc4/
rc4speed.c 176 long count; local
196 count=10;
201 count*=2;
203 for (i=count; i; i--)
207 ca=count/512;
208 cc=count*8/BUFSIZE+1;
210 #define COND(d) (count != (d))
211 #define COUNT(d) (d)
214 #define COUNT(d) (count)
    [all...]
  /external/clearsilver/util/test/
net_test.c 16 #define COUNT 10000
141 err = uListInit(&stuff, COUNT, 0);
143 for (x = 0; x < COUNT; x++)
  /external/oprofile/libop/
op_xml_out.h 41 COUNT,
  /external/qemu/hw/
dma.c 51 #define COUNT 1
139 r->now[COUNT] = 0;
165 val = (r->base[COUNT] << d->dshift) - r->now[COUNT];
167 val = r->now[ADDR] + r->now[COUNT] * dir;
349 r->now[COUNT], (r->base[COUNT] + 1) << ncont);
350 r->now[COUNT] = n;
351 ldebug ("dma_pos %d size %d\n", n, (r->base[COUNT] + 1) << ncont);
  /frameworks/base/obex/javax/obex/
HeaderSet.java 48 * Represents the OBEX Count header. This allows the connection statement to
51 * The value of <code>COUNT</code> is 0xC0 (192).
53 public static final int COUNT = 0xC0;
254 case COUNT:
260 throw new IllegalArgumentException("Count must be a Long");
264 throw new IllegalArgumentException("Count must be between 0 and 0xFFFFFFFF");
447 case COUNT:
507 out.write(COUNT);
ObexHelper.java 360 // Count Header
361 intHeader = (Long)headImpl.getHeader(HeaderSet.COUNT);
363 out.write((byte)HeaderSet.COUNT);
367 headImpl.setHeader(HeaderSet.COUNT, null);
    [all...]
  /frameworks/base/core/java/android/hardware/
SensorManager.java     [all...]
  /frameworks/base/libs/ui/
EventRecurrence.cpp 20 count(0),
63 COUNT,
104 { COUNT_text, SIZ(COUNT_text), COUNT },
242 int count = 1; local
245 count++;
249 int* list = new int[count];
272 *countOut = count;
327 postprocess_byday(int count, int* byday, int** bydayNum)
329 int* bdn = new int[count];
331 for (int i=0; i<count; i++)
    [all...]
  /packages/apps/Bluetooth/src/com/android/bluetooth/opp/
Constants.java 228 Log.v(TAG, "COUNT : " + hs.getHeader(HeaderSet.COUNT));
  /external/oprofile/daemon/
opd_ibs_macro.h 202 * the fetch latency, which is a 16-bit cycle count, and the fetch page size
247 * 15:0 IbsCompToRetCtr: macro-op completion to retire count
251 /** 31:16 tag_to_retire_cycles : macro-op tag to retire count. */
355 * derived event count by one.
361 * derived event count by the specified count value.
363 #define AGG_IBS_COUNT(EV, COUNT) opd_log_ibs_count(EV, trans, COUNT)
  /external/chromium/base/
tracked_objects.cc 188 "<li><b>count</b> Number of instances seen."
451 ThreadData::ThreadSafeDownCounter::ThreadSafeDownCounter(size_t count)
452 : remaining_count_(count) {
495 Snapshot::Snapshot(const BirthOnThread& birth_on_thread, int count)
498 death_data_(DeathData(count)) {
731 case COUNT:
732 if (left.count() != right.count())
733 return left.count() > right.count(); // Sort large at front of vector
    [all...]
tracked_objects.h 54 // count of instances constructed.
81 // death count, as well as accumulate the lifetime duration of the instance as
122 // birth thread, death thread, and location, along with the count of such
127 // statistics (birth count, durations, etc. etc.).
137 // a specific consecutive set of Snapshots? What was the total birth count for
189 // When we have a birth we update the count for this BirhPLace.
219 explicit DeathData(int count) : count_(count), square_duration_(0) {}
224 int count() const { return count_; } function in class:tracked_objects::DeathData
259 Snapshot(const BirthOnThread& birth_on_thread, int count);
269 int count() const { return death_data_.count(); } function in class:tracked_objects::Snapshot
    [all...]
  /external/chromium/third_party/icu/source/test/cintltst/
cnumtst.c     [all...]
  /external/icu4c/test/cintltst/
cnumtst.c     [all...]
  /external/chromium/third_party/icu/source/test/intltest/
dtfmttst.cpp 112 ids_length = ids->count(status);
356 const int32_t COUNT = 4;
357 DateFormat* dateFormats[COUNT];
396 assertTrue("data size", EXPECTED_LENGTH == COUNT * UDAT_FIELD_COUNT);
399 for (j = 0, exp = 0; j < COUNT; ++j) {
421 for (i=0; i<COUNT; ++i) {
    [all...]
  /external/icu4c/test/intltest/
dtfmttst.cpp 112 ids_length = ids->count(status);
356 const int32_t COUNT = 4;
357 DateFormat* dateFormats[COUNT];
396 assertTrue("data size", EXPECTED_LENGTH == COUNT * UDAT_FIELD_COUNT);
399 for (j = 0, exp = 0; j < COUNT; ++j) {
448 for (i=0; i<COUNT; ++i) {
    [all...]
  /external/webkit/WebKit/android/nav/
CacheBuilder.cpp 362 int count = 1; local
384 focusIndex = count;
409 int parentIndex = ParentIndex(node, count, node->parentNode());
455 snprintf(scratch, sizeof(scratch), "// %d: ", count);
472 count++;
489 DUMP_NAV_LOGD("}; // focusables = %d\n", count - 1);
491 DUMP_NAV_LOGD("static int TEST%s_RECT_COUNT = %d;\n\n", name, count - 1);
494 count = 1;
503 int nodeIndex = count++;
631 int CacheBuilder::Debug::ParentIndex(Node* node, int count, Node* parent)
2001 int count = ++s->mNumberCount; local
    [all...]
  /external/v8/benchmarks/
richards.js 49 scheduler.addIdleTask(ID_IDLE, 0, null, COUNT);
80 var COUNT = 1000;
86 * correct run so if the actual queue or hold count is different from
124 * @param {int} count the number of times to schedule the task
126 Scheduler.prototype.addIdleTask = function (id, priority, queue, count) {
127 this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
365 * @param {int} count the number of times this task should be scheduled
368 function IdleTask(scheduler, v1, count) {
371 this.count = count;
    [all...]
  /external/webkit/SunSpider/tests/v8-v4/
v8-richards.js 44 scheduler.addIdleTask(ID_IDLE, 0, null, COUNT);
75 var COUNT = 1000;
81 * correct run so if the actual queue or hold count is different from
119 * @param {int} count the number of times to schedule the task
121 Scheduler.prototype.addIdleTask = function (id, priority, queue, count) {
122 this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
360 * @param {int} count the number of times this task should be scheduled
363 function IdleTask(scheduler, v1, count) {
366 this.count = count;
    [all...]

Completed in 2644 milliseconds

1 2