| /external/boringssl/src/ssl/pqueue/ |
| pqueue.c | 94 pqueue_s *pq = (pqueue_s *)OPENSSL_malloc(sizeof(pqueue_s)); local
95 if (pq == NULL) {
99 memset(pq, 0, sizeof(pqueue_s));
100 return pq;
103 void pqueue_free(pqueue_s *pq) {
104 if (pq == NULL) {
109 assert(pq->items == NULL);
110 OPENSSL_free(pq);
113 pitem *pqueue_peek(pqueue_s *pq) { return pq->items;
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_query.c | 52 struct llvmpipe_query *pq; local
56 pq = CALLOC_STRUCT( llvmpipe_query );
58 return (struct pipe_query *) pq;
65 struct llvmpipe_query *pq = llvmpipe_query(q); local
70 if (pq->fence) {
71 if (!lp_fence_issued(pq->fence))
74 if (!lp_fence_signalled(pq->fence))
75 lp_fence_wait(pq->fence);
77 lp_fence_reference(&pq->fence, NULL);
80 FREE(pq);
90 struct llvmpipe_query *pq = llvmpipe_query(q); local
125 struct llvmpipe_query *pq = llvmpipe_query(q); local
148 struct llvmpipe_query *pq = llvmpipe_query(q); local
[all...] |
| lp_setup.h | 146 struct llvmpipe_query *pq);
150 struct llvmpipe_query *pq);
|
| /external/mesa3d/src/gallium/state_trackers/vdpau/ |
| presentation.c | 44 vlVdpPresentationQueue *pq = NULL; local
61 pq = CALLOC(1, sizeof(vlVdpPresentationQueue));
62 if (!pq)
65 pq->device = dev;
66 pq->drawable = pqt->drawable;
69 if (!vl_compositor_init_state(&pq->cstate, dev->context)) {
76 *presentation_queue = vlAddDataHTAB(pq);
86 FREE(pq);
96 vlVdpPresentationQueue *pq; local
98 pq = vlGetDataHTAB(presentation_queue)
119 vlVdpPresentationQueue *pq; local
148 vlVdpPresentationQueue *pq; local
177 vlVdpPresentationQueue *pq; local
205 vlVdpPresentationQueue *pq; local
312 vlVdpPresentationQueue *pq; local
346 vlVdpPresentationQueue *pq; local
[all...] |
| /external/boringssl/src/include/openssl/ |
| pqueue.h | 89 /* pqueue_free frees |pq| but not any of the items it points to. Thus |pq| must
91 OPENSSL_EXPORT void pqueue_free(pqueue pq);
108 /* pqueue_peek returns the item with the smallest priority from |pq|, or NULL
110 OPENSSL_EXPORT pitem *pqueue_peek(pqueue pq);
114 OPENSSL_EXPORT pitem *pqueue_find(pqueue pq, uint8_t *prio64be);
119 /* pqueue_insert inserts |item| into |pq| and returns item. */
120 OPENSSL_EXPORT pitem *pqueue_insert(pqueue pq, pitem *item);
122 /* pqueue_pop takes the item with the least priority from |pq| and returns it,
123 * or NULL if |pq| is empty. *
[all...] |
| /prebuilts/go/darwin-x86/src/container/heap/ |
| example_pq_test.go | 24 func (pq PriorityQueue) Len() int { return len(pq) }
26 func (pq PriorityQueue) Less(i, j int) bool {
28 return pq[i].priority > pq[j].priority
31 func (pq PriorityQueue) Swap(i, j int) {
32 pq[i], pq[j] = pq[j], pq[i
[all...] |
| /prebuilts/go/linux-x86/src/container/heap/ |
| example_pq_test.go | 24 func (pq PriorityQueue) Len() int { return len(pq) }
26 func (pq PriorityQueue) Less(i, j int) bool {
28 return pq[i].priority > pq[j].priority
31 func (pq PriorityQueue) Swap(i, j int) {
32 pq[i], pq[j] = pq[j], pq[i
[all...] |
| /prebuilts/go/darwin-x86/test/bench/shootout/ |
| reverse-complement.c | 52 char *pj, *pq, *pr; // buffer pointers: inp,out,/out local
69 for (pq=qqq+1, pr=pqstop; ; pq++) { // LOOP: fill output buffer
72 if (pr <= (pq+61)) { // need to resize buffer
79 pq+=x; pr+=x; qqq+=x;
92 for (pq = qqq; pr<pqstop; ) { // LOOP: format output
94 __builtin_memmove(pq,pr,x); // move line to free space
95 pr+=x; pq+=x; *(pq++) = 0xA; // adjust pointers, add LF
97 fwrite(qqq, 1, pq-qqq, stdout); // output converted dat
[all...] |
| /prebuilts/go/linux-x86/test/bench/shootout/ |
| reverse-complement.c | 52 char *pj, *pq, *pr; // buffer pointers: inp,out,/out local
69 for (pq=qqq+1, pr=pqstop; ; pq++) { // LOOP: fill output buffer
72 if (pr <= (pq+61)) { // need to resize buffer
79 pq+=x; pr+=x; qqq+=x;
92 for (pq = qqq; pr<pqstop; ) { // LOOP: format output
94 __builtin_memmove(pq,pr,x); // move line to free space
95 pr+=x; pq+=x; *(pq++) = 0xA; // adjust pointers, add LF
97 fwrite(qqq, 1, pq-qqq, stdout); // output converted dat
[all...] |
| /external/mesa3d/src/mesa/state_tracker/ |
| st_cb_queryobj.c | 57 stq->pq = NULL;
72 if (stq->pq) {
73 pipe->destroy_query(pipe, stq->pq);
74 stq->pq = NULL;
111 if (stq->pq && stq->type != type) {
113 pipe->destroy_query(pipe, stq->pq);
114 stq->pq = NULL;
118 if (!stq->pq) {
119 stq->pq = pipe->create_query(pipe, type);
125 pipe->begin_query(pipe, stq->pq);
[all...] |
| st_cb_queryobj.h | 41 struct pipe_query *pq; member in struct:st_query_object
|
| st_cb_condrender.c | 79 st->render_condition = stq->pq;
82 pipe->render_condition(pipe, stq->pq, m);
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| PriorityQueueBenchmark.java | 31 private PriorityQueue<Integer> pq; field in class:PriorityQueueBenchmark
38 pq = new PriorityQueue<Integer>();
52 pq.add(allElements.get(i));
57 pq.add(allElements.get(i));
63 usepq = new PriorityQueue<Integer>(pq);
79 usepq = new PriorityQueue<Integer>(pq);
|
| /hardware/broadcom/wlan/bcmdhd/dhdutil/include/ |
| bcmutils.h | 168 #define PKTQ_PREC_ITER(pq, prec) for (prec = (pq)->num_prec - 1; prec >= 0; prec--)
287 #define pktq_psetmax(pq, prec, _max) ((pq)->q[prec].max = (_max))
288 #define pktq_pmax(pq, prec) ((pq)->q[prec].max)
289 #define pktq_plen(pq, prec) ((pq)->q[prec].len)
290 #define pktq_pavail(pq, prec) ((pq)->q[prec].max - (pq)->q[prec].len
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/scripts/ |
| rebuild_endpoints.py | 2 from pyquery import PyQuery as pq
24 return pq(raw_xml, parser='xml')
32 region = pq(region_elem, parser='xml')
|
| /external/mesa3d/src/gallium/drivers/nv30/ |
| nv30_query.c | 142 nv30_query_destroy(struct pipe_context *pipe, struct pipe_query *pq)
144 FREE(pq);
148 nv30_query_begin(struct pipe_context *pipe, struct pipe_query *pq)
151 struct nv30_query *q = nv30_query(pq);
177 nv30_query_end(struct pipe_context *pipe, struct pipe_query *pq)
181 struct nv30_query *q = nv30_query(pq);
198 nv30_query_result(struct pipe_context *pipe, struct pipe_query *pq,
202 struct nv30_query *q = nv30_query(pq);
235 struct pipe_query *pq, uint mode)
238 struct nv30_query *q = nv30_query(pq);
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/ |
| nv50_query.c | 92 nv50_query_destroy(struct pipe_context *pipe, struct pipe_query *pq)
94 nv50_query_allocate(nv50_context(pipe), nv50_query(pq), 0);
95 FREE(nv50_query(pq));
142 nv50_query_begin(struct pipe_context *pipe, struct pipe_query *pq)
146 struct nv50_query *q = nv50_query(pq);
195 nv50_query_end(struct pipe_context *pipe, struct pipe_query *pq)
199 struct nv50_query *q = nv50_query(pq);
246 nv50_query_result(struct pipe_context *pipe, struct pipe_query *pq,
250 struct nv50_query *q = nv50_query(pq);
308 nv84_query_fifo_wait(struct nouveau_pushbuf *push, struct pipe_query *pq)
[all...] |
| /hardware/broadcom/wlan/bcmdhd/dhdutil/ |
| bcmutils.c | 233 pktq_penq(struct pktq *pq, int prec, void *p)
237 ASSERT(prec >= 0 && prec < pq->num_prec);
240 ASSERT(!pktq_full(pq));
241 ASSERT(!pktq_pfull(pq, prec));
243 q = &pq->q[prec];
253 pq->len++;
255 if (pq->hi_prec < prec)
256 pq->hi_prec = (uint8)prec;
262 pktq_penq_head(struct pktq *pq, int prec, void *p)
266 ASSERT(prec >= 0 && prec < pq->num_prec)
[all...] |
| /external/skia/tests/ |
| TDPQueueTest.cpp | 102 SkTDPQueue<Dummy*, Dummy::LessP, Dummy::PQIndex> pq; local
104 pq.insert(&array[j]);
106 REPORTER_ASSERT(reporter, pq.count() == array.count());
113 while (pq.count()) {
115 Dummy* top = pq.peek();
124 Dummy* top = pq.peek();
126 pq.pop();
135 pq.remove(&array[item]);
145 pq.priorityDidChange(&array[item]);
|
| /external/llvm/include/llvm/CodeGen/ |
| LatencyPriorityQueue.h | 26 LatencyPriorityQueue *PQ;
27 explicit latency_sort(LatencyPriorityQueue *pq) : PQ(pq) {}
|
| ResourcePriorityQueue.h | 32 ResourcePriorityQueue *PQ;
33 explicit resource_sort(ResourcePriorityQueue *pq) : PQ(pq) {}
|
| /external/ceres-solver/internal/ceres/ |
| conjugate_gradients_solver.cc | 151 const double pq = p.dot(q); local
152 if ((pq <= 0) || IsInfinite(pq)) {
154 summary.message = StringPrintf("Numerical failure. p'q = %e.", pq);
158 const double alpha = rho / pq;
162 StringPrintf("Numerical failure. alpha = rho / pq = %e", alpha);
|
| /external/mesa3d/src/gallium/drivers/nvc0/ |
| nvc0_query.c | 91 nvc0_query_destroy(struct pipe_context *pipe, struct pipe_query *pq)
93 nvc0_query_allocate(nvc0_context(pipe), nvc0_query(pq), 0);
94 FREE(nvc0_query(pq));
181 nvc0_query_begin(struct pipe_context *pipe, struct pipe_query *pq)
185 struct nvc0_query *q = nvc0_query(pq);
253 nvc0_query_end(struct pipe_context *pipe, struct pipe_query *pq)
257 struct nvc0_query *q = nvc0_query(pq);
335 nvc0_query_result(struct pipe_context *pipe, struct pipe_query *pq,
339 struct nvc0_query *q = nvc0_query(pq);
409 nvc0_query_fifo_wait(struct nouveau_pushbuf *push, struct pipe_query *pq)
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| PriorityQueue.java | 59 * traversal, consider using {@code Arrays.sort(pq.toArray())}.
196 PriorityQueue<? extends E> pq = (PriorityQueue<? extends E>) c; local
197 this.comparator = (Comparator<? super E>) pq.comparator();
198 initFromPriorityQueue(pq);
824 private final PriorityQueue<E> pq; field in class:PriorityQueue.PriorityQueueSpliterator
830 PriorityQueueSpliterator(PriorityQueue<E> pq, int origin, int fence,
832 this.pq = pq;
841 expectedModCount = pq.modCount;
842 hi = fence = pq.size
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/Featherstone/ |
| btMultiBodyLink.h | 182 void updateCacheMultiDof(btScalar *pq = 0)
184 btScalar *pJointPos = (pq ? pq : &m_jointPos[0]);
|
