/external/chromium-trace/catapult/tracing/test_data/ |
D | ddms_calculator_start.trace | 3425 SLOW 7�.�_� 3426 16~qv�� 3428 i7q-��� 3431 ���q\и� 3434 v�q�� 3435 �o�q���� 3439 Sq��� 3440 Sq� �� 3441 �Wq�,�� 3443 �t�q�A�� [all …]
|
/external/libcxx/src/ |
D | hash.cpp | 209 const std::size_t q = n / p; in __next_prime() local 210 if (q < p) in __next_prime() 212 if (n == q * p) in __next_prime() 220 std::size_t q = n / i; in __next_prime() local 221 if (q < i) in __next_prime() 223 if (n == q * i) in __next_prime() 227 q = n / i; in __next_prime() 228 if (q < i) in __next_prime() 230 if (n == q * i) in __next_prime() 234 q = n / i; in __next_prime() [all …]
|
/external/svox/pico/lib/ |
D | picosig2.c | 2085 picoos_int32 *q = sig_inObj->int_vec34; in init_rand() local 2090 q[0] = -2198; in init_rand() 2092 q[1] = 3226; in init_rand() 2094 q[2] = -845; in init_rand() 2096 q[3] = -1227; in init_rand() 2098 q[4] = -3480; in init_rand() 2100 q[5] = -1325; in init_rand() 2102 q[6] = 2089; in init_rand() 2104 q[7] = -468; in init_rand() 2106 q[8] = 711; in init_rand() [all …]
|
/external/mesa3d/src/gallium/drivers/nvc0/ |
D | nvc0_query.c | 59 nvc0_query_allocate(struct nvc0_context *nvc0, struct nvc0_query *q, int size) in nvc0_query_allocate() argument 64 if (q->bo) { in nvc0_query_allocate() 65 nouveau_bo_ref(NULL, &q->bo); in nvc0_query_allocate() 66 if (q->mm) { in nvc0_query_allocate() 67 if (q->state == NVC0_QUERY_STATE_READY) in nvc0_query_allocate() 68 nouveau_mm_free(q->mm); in nvc0_query_allocate() 71 nouveau_mm_free_work, q->mm); in nvc0_query_allocate() 75 q->mm = nouveau_mm_allocate(screen->base.mm_GART, size, &q->bo, &q->base); in nvc0_query_allocate() 76 if (!q->bo) in nvc0_query_allocate() 78 q->offset = q->base; in nvc0_query_allocate() [all …]
|
/external/mesa3d/src/gallium/drivers/nv50/ |
D | nv50_query.c | 60 nv50_query_allocate(struct nv50_context *nv50, struct nv50_query *q, int size) in nv50_query_allocate() argument 65 if (q->bo) { in nv50_query_allocate() 66 nouveau_bo_ref(NULL, &q->bo); in nv50_query_allocate() 67 if (q->mm) { in nv50_query_allocate() 68 if (q->ready) in nv50_query_allocate() 69 nouveau_mm_free(q->mm); in nv50_query_allocate() 72 q->mm); in nv50_query_allocate() 76 q->mm = nouveau_mm_allocate(screen->base.mm_GART, size, &q->bo, &q->base); in nv50_query_allocate() 77 if (!q->bo) in nv50_query_allocate() 79 q->offset = q->base; in nv50_query_allocate() [all …]
|
/external/avahi/avahi-core/ |
D | querier.c | 52 void avahi_querier_free(AvahiQuerier *q) { in avahi_querier_free() argument 53 assert(q); in avahi_querier_free() 55 AVAHI_LLIST_REMOVE(AvahiQuerier, queriers, q->interface->queriers, q); in avahi_querier_free() 56 avahi_hashmap_remove(q->interface->queriers_by_key, q->key); in avahi_querier_free() 58 avahi_key_unref(q->key); in avahi_querier_free() 59 avahi_time_event_free(q->time_event); in avahi_querier_free() 61 avahi_free(q); in avahi_querier_free() 65 AvahiQuerier *q = userdata; in querier_elapse_callback() local 68 assert(q); in querier_elapse_callback() 70 if (q->n_used <= 0) { in querier_elapse_callback() [all …]
|
D | timeeventq.c | 60 static AvahiTimeEvent* time_event_queue_root(AvahiTimeEventQueue *q) { in time_event_queue_root() argument 61 assert(q); in time_event_queue_root() 63 return q->prioq->root ? q->prioq->root->data : NULL; in time_event_queue_root() 66 static void update_timeout(AvahiTimeEventQueue *q) { in update_timeout() argument 68 assert(q); in update_timeout() 70 if ((e = time_event_queue_root(q))) in update_timeout() 71 q->poll_api->timeout_update(q->timeout, &e->expiry); in update_timeout() 73 q->poll_api->timeout_update(q->timeout, NULL); in update_timeout() 77 AvahiTimeEventQueue *q = userdata; in expiration_event() local 80 if ((e = time_event_queue_root(q))) { in expiration_event() [all …]
|
D | prioq.c | 32 AvahiPrioQueue *q; in avahi_prio_queue_new() local 35 if (!(q = avahi_new(AvahiPrioQueue, 1))) in avahi_prio_queue_new() 38 q->root = q->last = NULL; in avahi_prio_queue_new() 39 q->n_nodes = 0; in avahi_prio_queue_new() 40 q->compare = compare; in avahi_prio_queue_new() 42 return q; in avahi_prio_queue_new() 45 void avahi_prio_queue_free(AvahiPrioQueue *q) { in avahi_prio_queue_free() argument 46 assert(q); in avahi_prio_queue_free() 48 while (q->last) in avahi_prio_queue_free() 49 avahi_prio_queue_remove(q, q->last); in avahi_prio_queue_free() [all …]
|
/external/icu/android_icu4j/src/main/tests/android/icu/dev/test/rbbi/ |
D | RBBIAPITest.java | 167 int p, q; in TestFirstNextFollowing() local 176 q = wordIter1.next(9); in TestFirstNextFollowing() 177 doTest(testString, p, q, 20, "This is a word break"); in TestFirstNextFollowing() 178 p = q; in TestFirstNextFollowing() 179 q = wordIter1.next(); in TestFirstNextFollowing() 180 doTest(testString, p, q, 21, "."); in TestFirstNextFollowing() 181 p = q; in TestFirstNextFollowing() 182 q = wordIter1.next(3); in TestFirstNextFollowing() 183 doTest(testString, p, q, 28, " Isn't "); in TestFirstNextFollowing() 184 p = q; in TestFirstNextFollowing() [all …]
|
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/rbbi/ |
D | RBBIAPITest.java | 163 int p, q; in TestFirstNextFollowing() local 172 q = wordIter1.next(9); in TestFirstNextFollowing() 173 doTest(testString, p, q, 20, "This is a word break"); in TestFirstNextFollowing() 174 p = q; in TestFirstNextFollowing() 175 q = wordIter1.next(); in TestFirstNextFollowing() 176 doTest(testString, p, q, 21, "."); in TestFirstNextFollowing() 177 p = q; in TestFirstNextFollowing() 178 q = wordIter1.next(3); in TestFirstNextFollowing() 179 doTest(testString, p, q, 28, " Isn't "); in TestFirstNextFollowing() 180 p = q; in TestFirstNextFollowing() [all …]
|
/external/selinux/checkpolicy/ |
D | queue.c | 15 queue_t q; in queue_create() local 17 q = (queue_t) malloc(sizeof(struct queue_info)); in queue_create() 18 if (q == NULL) in queue_create() 21 q->head = q->tail = NULL; in queue_create() 23 return q; in queue_create() 26 int queue_insert(queue_t q, queue_element_t e) in queue_insert() argument 30 if (!q) in queue_insert() 40 if (q->head == NULL) { in queue_insert() 41 q->head = q->tail = newnode; in queue_insert() 43 q->tail->next = newnode; in queue_insert() [all …]
|
/external/libvpx/libvpx/vp8/common/x86/ |
D | idct_blk_mmx.c | 16 extern void vp8_dequantize_b_impl_mmx(short *sq, short *dq, short *q); 27 (short *q, short *dq, in vp8_dequant_idct_add_y_block_mmx() argument 35 vp8_dequant_idct_add_mmx (q, dq, dst, stride); in vp8_dequant_idct_add_y_block_mmx() 38 vp8_dc_only_idct_add_mmx (q[0]*dq[0], dst, stride, dst, stride); in vp8_dequant_idct_add_y_block_mmx() 39 memset(q, 0, 2 * sizeof(q[0])); in vp8_dequant_idct_add_y_block_mmx() 43 vp8_dequant_idct_add_mmx (q+16, dq, dst+4, stride); in vp8_dequant_idct_add_y_block_mmx() 46 vp8_dc_only_idct_add_mmx (q[16]*dq[0], dst+4, stride, in vp8_dequant_idct_add_y_block_mmx() 48 memset(q + 16, 0, 2 * sizeof(q[0])); in vp8_dequant_idct_add_y_block_mmx() 52 vp8_dequant_idct_add_mmx (q+32, dq, dst+8, stride); in vp8_dequant_idct_add_y_block_mmx() 55 vp8_dc_only_idct_add_mmx (q[32]*dq[0], dst+8, stride, in vp8_dequant_idct_add_y_block_mmx() [all …]
|
/external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
D | TestFastQueue.java | 39 FastQueue<String> q = new FastQueue<String>(); in testQueueNoRemove() local 40 q.add("a"); in testQueueNoRemove() 41 q.add("b"); in testQueueNoRemove() 42 q.add("c"); in testQueueNoRemove() 43 q.add("d"); in testQueueNoRemove() 44 q.add("e"); in testQueueNoRemove() 46 String found = q.toString(); in testQueueNoRemove() 51 FastQueue<String> q = new FastQueue<String>(); in testQueueThenRemoveAll() local 52 q.add("a"); in testQueueThenRemoveAll() 53 q.add("b"); in testQueueThenRemoveAll() [all …]
|
/external/mesa3d/src/mesa/main/ |
D | queryobj.c | 50 struct gl_query_object *q = MALLOC_STRUCT(gl_query_object); in _mesa_new_query_object() local 52 if (q) { in _mesa_new_query_object() 53 q->Id = id; in _mesa_new_query_object() 54 q->Result = 0; in _mesa_new_query_object() 55 q->Active = GL_FALSE; in _mesa_new_query_object() 56 q->Ready = GL_TRUE; /* correct, see spec */ in _mesa_new_query_object() 58 return q; in _mesa_new_query_object() 67 _mesa_begin_query(struct gl_context *ctx, struct gl_query_object *q) in _mesa_begin_query() argument 78 _mesa_end_query(struct gl_context *ctx, struct gl_query_object *q) in _mesa_end_query() argument 80 q->Ready = GL_TRUE; in _mesa_end_query() [all …]
|
/external/compiler-rt/test/msan/ |
D | signal_stress_test.cc | 30 void **volatile q = &p; in SignalHandler() local 32 *q, *q, *q, *q, *q, in SignalHandler() 33 *q, *q, *q, *q, *q); in SignalHandler() 48 void **volatile q = &p; in main() local 57 *q, *q, *q, *q, *q, in main() 58 *q, *q, *q, *q, *q, in main() 59 *q, *q, *q, *q, *q, in main() 60 *q, *q, *q, *q, *q); in main()
|
/external/guava/guava-tests/test/com/google/common/collect/ |
D | QueuesTest.java | 71 private static <T> int drain(BlockingQueue<T> q, Collection<? super T> buffer, int maxElements, in drain() argument 74 ? Queues.drain(q, buffer, maxElements, timeout, unit) in drain() 75 : Queues.drainUninterruptibly(q, buffer, maxElements, timeout, unit); in drain() 79 for (BlockingQueue<Object> q : blockingQueues()) { in testMultipleProducers() 80 testMultipleProducers(q); in testMultipleProducers() 84 private void testMultipleProducers(BlockingQueue<Object> q) in testMultipleProducers() argument 87 threadPool.submit(new Producer(q, 20)); in testMultipleProducers() 88 threadPool.submit(new Producer(q, 20)); in testMultipleProducers() 89 threadPool.submit(new Producer(q, 20)); in testMultipleProducers() 90 threadPool.submit(new Producer(q, 20)); in testMultipleProducers() [all …]
|
/external/mesa3d/src/gallium/state_trackers/clover/api/ |
D | transfer.cpp | 38 validate_base(cl_command_queue q, cl_uint num_deps, const cl_event *deps) { in validate_base() argument 39 if (!q) in validate_base() 47 return &ev->ctx != &q->ctx; in validate_base() 57 validate_obj(cl_command_queue q, cl_mem obj) { in validate_obj() argument 61 if (&obj->ctx != &q->ctx) in validate_obj() 74 get(cl_command_queue q, void *obj, cl_map_flags flags, in get() 82 get(cl_command_queue q, const void *obj, cl_map_flags flags, in get() 90 get(cl_command_queue q, memory_obj *obj, cl_map_flags flags, in get() 92 return { *q, obj->resource(q), flags, true, { offset }, { size }}; in get() 102 soft_copy_op(cl_command_queue q, in soft_copy_op() argument [all …]
|
/external/libvpx/libvpx/vp8/common/arm/armv6/ |
D | idct_blk_v6.c | 15 void vp8_dequant_idct_add_y_block_v6(short *q, short *dq, in vp8_dequant_idct_add_y_block_v6() argument 24 vp8_dequant_idct_add_v6 (q, dq, dst, stride); in vp8_dequant_idct_add_y_block_v6() 27 vp8_dc_only_idct_add_v6 (q[0]*dq[0], dst, stride, dst, stride); in vp8_dequant_idct_add_y_block_v6() 28 ((int *)q)[0] = 0; in vp8_dequant_idct_add_y_block_v6() 32 vp8_dequant_idct_add_v6 (q+16, dq, dst+4, stride); in vp8_dequant_idct_add_y_block_v6() 35 vp8_dc_only_idct_add_v6 (q[16]*dq[0], dst+4, stride, dst+4, stride); in vp8_dequant_idct_add_y_block_v6() 36 ((int *)(q+16))[0] = 0; in vp8_dequant_idct_add_y_block_v6() 40 vp8_dequant_idct_add_v6 (q+32, dq, dst+8, stride); in vp8_dequant_idct_add_y_block_v6() 43 vp8_dc_only_idct_add_v6 (q[32]*dq[0], dst+8, stride, dst+8, stride); in vp8_dequant_idct_add_y_block_v6() 44 ((int *)(q+32))[0] = 0; in vp8_dequant_idct_add_y_block_v6() [all …]
|
/external/valgrind/VEX/test/ |
D | fsave.c | 16 int q; in isFPLsbs() local 17 q = 0; if (i == q || i == q+1) return 1; in isFPLsbs() 18 q = 10; if (i == q || i == q+1) return 1; in isFPLsbs() 19 q = 20; if (i == q || i == q+1) return 1; in isFPLsbs() 20 q = 30; if (i == q || i == q+1) return 1; in isFPLsbs() 21 q = 40; if (i == q || i == q+1) return 1; in isFPLsbs() 22 q = 50; if (i == q || i == q+1) return 1; in isFPLsbs() 23 q = 60; if (i == q || i == q+1) return 1; in isFPLsbs() 24 q = 70; if (i == q || i == q+1) return 1; in isFPLsbs()
|
D | frstor.c | 27 int q; in isFPLsbs() local 28 q = 0; if (i == q || i == q+1) return 1; in isFPLsbs() 29 q = 10; if (i == q || i == q+1) return 1; in isFPLsbs() 30 q = 20; if (i == q || i == q+1) return 1; in isFPLsbs() 31 q = 30; if (i == q || i == q+1) return 1; in isFPLsbs() 32 q = 40; if (i == q || i == q+1) return 1; in isFPLsbs() 33 q = 50; if (i == q || i == q+1) return 1; in isFPLsbs() 34 q = 60; if (i == q || i == q+1) return 1; in isFPLsbs() 35 q = 70; if (i == q || i == q+1) return 1; in isFPLsbs()
|
D | fxsave.c | 75 int q; in isFPLsbs() local 76 q = 32; if (i == q || i == q+1) return 1; in isFPLsbs() 77 q = 48; if (i == q || i == q+1) return 1; in isFPLsbs() 78 q = 64; if (i == q || i == q+1) return 1; in isFPLsbs() 79 q = 80; if (i == q || i == q+1) return 1; in isFPLsbs() 80 q = 96; if (i == q || i == q+1) return 1; in isFPLsbs() 81 q = 112; if (i == q || i == q+1) return 1; in isFPLsbs() 82 q = 128; if (i == q || i == q+1) return 1; in isFPLsbs() 83 q = 144; if (i == q || i == q+1) return 1; in isFPLsbs()
|
/external/mesa3d/src/gallium/drivers/nv30/ |
D | nv30_query.c | 110 struct nv30_query *q = CALLOC_STRUCT(nv30_query); in nv30_query_create() local 111 if (!q) in nv30_query_create() 114 q->type = type; in nv30_query_create() 116 switch (q->type) { in nv30_query_create() 119 q->enable = 0x0000; in nv30_query_create() 120 q->report = 1; in nv30_query_create() 123 q->enable = NV30_3D_QUERY_ENABLE; in nv30_query_create() 124 q->report = 1; in nv30_query_create() 130 q->enable = 0x1804; in nv30_query_create() 131 q->report = 2 + (q->type - NV30_QUERY_ZCULL_0); in nv30_query_create() [all …]
|
/external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
D | pop.pass.cpp | 19 std::queue<int> q; in main() local 20 assert(q.size() == 0); in main() 21 q.push(1); in main() 22 q.push(2); in main() 23 q.push(3); in main() 24 assert(q.size() == 3); in main() 25 assert(q.front() == 1); in main() 26 assert(q.back() == 3); in main() 27 q.pop(); in main() 28 assert(q.size() == 2); in main() [all …]
|
/external/valgrind/memcheck/tests/x86/ |
D | fxsave.c | 76 int q; in isFPLsbs() local 77 q = 32; if (i == q || i == q+1) return 1; in isFPLsbs() 78 q = 48; if (i == q || i == q+1) return 1; in isFPLsbs() 79 q = 64; if (i == q || i == q+1) return 1; in isFPLsbs() 80 q = 80; if (i == q || i == q+1) return 1; in isFPLsbs() 81 q = 96; if (i == q || i == q+1) return 1; in isFPLsbs() 82 q = 112; if (i == q || i == q+1) return 1; in isFPLsbs() 83 q = 128; if (i == q || i == q+1) return 1; in isFPLsbs() 84 q = 144; if (i == q || i == q+1) return 1; in isFPLsbs()
|
/external/mdnsresponder/mDNSCore/ |
D | uDNS.c | 164 mDNSexport void PenalizeDNSServer(mDNS *const m, DNSQuestion *q) in PenalizeDNSServer() argument 167 DNSServer *orig = q->qDNSServer; in PenalizeDNSServer() 177 if (!q->qDNSServer) in PenalizeDNSServer() 179 …lizeDNSServer: ERROR!! Null DNS server for %##s (%s) %d", q->qname.c, DNSTypeName(q->qtype), q->un… in PenalizeDNSServer() 184 …&q->qDNSServer->addr, mDNSVal16(q->qDNSServer->port), q->qDNSServer->domain.c, q, q->qname.c, DNST… in PenalizeDNSServer() 185 q->SuppressUnusable); in PenalizeDNSServer() 200 if (q->qtype == kDNSType_PTR) in PenalizeDNSServer() 206 LogInfo("PenalizeDNSServer: Penalizing question type %d", q->qtype); in PenalizeDNSServer() 207 q->qDNSServer->penaltyTime = NonZeroTime(m->timenow + DNSSERVER_PENALTY_TIME); in PenalizeDNSServer() 216 new = GetServerForQuestion(m, q); in PenalizeDNSServer() [all …]
|