| /external/clang/utils/ABITest/layout/ |
| Makefile | 3 # COUNT can be over-ridden to change the number of tests generated per
9 COUNT := 1000
65 $(ABITESTGEN) $(TESTARGS) -o $@ --min=$(shell expr $* '*' $(COUNT)) --count=$(COUNT)
|
| /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);
|
| /dalvik/tests/061-out-of-memory/src/ |
| Main.java | 34 final int COUNT = 32768*32768 + 4;
35 int[] tooBig = new int[COUNT];
|
| /external/chromium/chrome/browser/first_run/ |
| try_chrome_dialog_view.h | 48 COUNT
|
| /external/skia/bench/ |
| RegionContainBench.cpp | 28 COUNT = 10,
34 return SkIRect::MakeXYWH(0, i*H/COUNT, w, H/COUNT);
42 for (int i = 0; i < COUNT; i++) {
|
| /external/valgrind/main/none/tests/ |
| tls.c | 9 #define COUNT 10
58 for(i = 0; i < COUNT; i++) {
|
| /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/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/ |
| Settings.java | 50 static final int COUNT = 0x9;
62 private final int[] values = new int[COUNT];
169 for (int i = 0; i < COUNT; i++) {
|
| /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/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...] |
| /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...] |
| /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/llvm/lib/Target/R600/ |
| R600Defines.h | 81 COUNT
84 const static int ALUOpTable[3][R600Operands::COUNT] = {
|
| /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);
|
| /external/chromium/base/ |
| tracked_objects.h | 55 // count of instances constructed.
82 // death count, as well as accumulate the lifetime duration of the instance as
123 // birth thread, death thread, and location, along with the count of such
128 // statistics (birth count, durations, etc. etc.).
138 // 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/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;
350 r->now[COUNT], (r->base[COUNT] + 1) << ncont);
351 r->now[COUNT] = n;
353 ldebug ("dma_pos %d size %d\n", n, (r->base[COUNT] + 1) << ncont);
|
| /frameworks/base/core/java/android/hardware/ |
| LegacySensorManager.java | 370 private static final int COUNT = 12;
372 private static final float PREDICTION_TIME = (SENSORS_RATE_MS*COUNT/1000.0f)*PREDICTION_RATIO;
373 private float mV[] = new float[COUNT*2];
374 private long mT[] = new long[COUNT*2];
378 mIndex = COUNT;
391 * by COUNT values, so that we don't have to copy the array
395 if (mIndex >= COUNT*2)
396 mIndex = COUNT;
399 mV[mIndex-COUNT] = v;
400 mT[mIndex-COUNT] = time
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ConcurrentHashMultisetTest.java | 69 final int COUNT = 12;
70 expect(backingMap.get(KEY)).andReturn(new AtomicInteger(COUNT));
73 assertEquals(COUNT, multiset.count(KEY));
81 assertEquals(0, multiset.count(KEY));
95 final int COUNT = 400;
101 assertEquals(0, multiset.add(KEY, COUNT));
339 assertEquals(2, multiset.count(2));
373 assertEquals(1, multiset.count(s1));
374 assertEquals(0, multiset.count(s2))
[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/PerformanceTests/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...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| 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...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| 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...] |
| /external/opencv/cv/src/ |
| cvlkpyramid.cpp | 268 int count, CvSize winSize, int level,
354 if( count == 0 )
360 if( count < 0 )
374 CV_CALL( status = _status = (char*)cvAlloc( count*sizeof(_status[0]) ));
399 CV_CALL( error = _error = (float*)cvAlloc( count*sizeof(_error[0]) ));
401 for( i = 0; i < count; i++ )
405 (const float*)featuresA, (float*)featuresB, status, error, count,
409 for( i = 0; i < count; i++ )
428 memset( status, 1, count );
430 memset( error, 0, count*sizeof(error[0]) )
1161 int count_x, count_y, count; local
[all...] |
