| /external/openssl/crypto/pqueue/ |
| pq_test.c | 66 pqueue pq; local
68 pq = pqueue_new();
71 pqueue_insert(pq, item);
74 pqueue_insert(pq, item);
77 pqueue_insert(pq, item);
79 item = pqueue_find(pq, 1);
82 item = pqueue_find(pq, 2);
85 item = pqueue_find(pq, 3);
88 pqueue_print(pq);
90 for(item = pqueue_pop(pq); item != NULL; item = pqueue_pop(pq)
[all...] |
| pqueue.h | 82 void pqueue_free(pqueue pq);
84 pitem *pqueue_insert(pqueue pq, pitem *item);
85 pitem *pqueue_peek(pqueue pq);
86 pitem *pqueue_pop(pqueue pq);
87 pitem *pqueue_find(pqueue pq, unsigned char *prio64be);
88 pitem *pqueue_iterator(pqueue pq);
91 void pqueue_print(pqueue pq);
92 int pqueue_size(pqueue pq);
|
| pqueue.c | 95 pqueue_s *pq = (pqueue_s *) OPENSSL_malloc(sizeof(pqueue_s)); local
96 if (pq == NULL) return NULL;
98 memset(pq, 0x00, sizeof(pqueue_s));
99 return pq;
103 pqueue_free(pqueue_s *pq)
105 if (pq == NULL) return;
107 OPENSSL_free(pq);
111 pqueue_insert(pqueue_s *pq, pitem *item)
115 if (pq->items == NULL)
117 pq->items = item
[all...] |
| /external/srec/srec/crec/ |
| priority_q.c | 43 priority_q *pq; local
45 pq = (priority_q*) CALLOC(1, sizeof(priority_q), "search.srec.priority_q");
46 pq->max_cost_in_q = MAXcostdata;
47 pq->word_token_list = MAXwordID;
48 pq->max_in_q = (miscdata)max_n;
49 pq->num_in_q = 0;
50 return pq;
53 void free_priority_q(priority_q* pq)
55 FREE(pq);
60 void clear_priority_q(priority_q *pq)
[all...] |
| /external/openssl/include/openssl/ |
| pqueue.h | 82 void pqueue_free(pqueue pq);
84 pitem *pqueue_insert(pqueue pq, pitem *item);
85 pitem *pqueue_peek(pqueue pq);
86 pitem *pqueue_pop(pqueue pq);
87 pitem *pqueue_find(pqueue pq, unsigned char *prio64be);
88 pitem *pqueue_iterator(pqueue pq);
91 void pqueue_print(pqueue pq);
92 int pqueue_size(pqueue pq);
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| PriorityQueueBenchmark.java | 31 private PriorityQueue<Integer> pq; field in class:PriorityQueueBenchmark
37 pq = new PriorityQueue<Integer>();
51 pq.add(allElements.get(i));
56 pq.add(allElements.get(i));
62 usepq = new PriorityQueue<Integer>(pq);
78 usepq = new PriorityQueue<Integer>(pq);
|
| /external/dropbear/libtomcrypt/src/pk/katja/ |
| katja_free.c | 28 key->qP, key->p, key->q, key->pq, NULL);
|
| katja_import.c | 38 &key->dP, &key->qP, &key->p, &key->q, &key->pq, NULL)) != CRYPT_OK) {
59 LTC_ASN1_INTEGER, 1UL, key->pq,
72 key->qP, key->p, key->q, key->pq, NULL);
|
| katja_make_key.c | 63 &key->qP, &key->p, &key->q, &key->pq, NULL)) != CRYPT_OK) {
67 /* n=p^2q and 1/n mod pq */
70 if ((err = mp_mul(key->p, key->q, key->pq)) != CRYPT_OK) { goto error2; } /* tmp1 = pq */
71 if ((err = mp_mul(key->pq, key->p, key->N)) != CRYPT_OK) { goto error2; } /* N = p^2q */
75 if ((err = mp_invmod( key->N, key->d, key->d)) != CRYPT_OK) { goto error2; } /* key->d = 1/N mod pq */
90 mp_clear_multi( key->d, key->N, key->dQ, key->dP, key->qP, key->p, key->q, key->pq, NULL);
|
| katja_export.c | 45 Version, n, d, p, q, d mod (p-1), d mod (q - 1), 1/q mod p, pq
56 LTC_ASN1_INTEGER, 1UL, key->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/srec/srec/include/ |
| srec.h | 324 void free_priority_q(priority_q* pq);
325 void clear_priority_q(priority_q *pq);
326 wtokenID get_word_token_list(priority_q *pq, word_token *word_token_array);
327 wtokenID add_word_token_to_priority_q(priority_q *pq, wtokenID token_index_to_add, word_token *word_token_array);
328 void remove_non_end_word_from_q(srec *rec, priority_q *pq, word_token *word_token_array, nodeID end_node);
329 costdata get_priority_q_threshold(priority_q *pq, word_token *word_token_array);
|
| /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...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| multiseq_selection.h | 270 pq(lrcomp);
274 pq.push(std::make_pair(S(i)[b[i]], i));
276 for (; skew != 0 && !pq.empty(); --skew)
278 int source = pq.top().second;
279 pq.pop();
285 pq.push(std::make_pair(S(source)[b[source]], source));
293 lexicographic<value_type, int, Comparator> > pq(lcomp);
297 pq.push(std::make_pair(S(i)[a[i] - 1], i));
301 int source = pq.top().second;
302 pq.pop()
[all...] |
| /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 | 152 double pq = p.dot(q); local
154 if ((pq <= 0) || IsInfinite(pq)) {
155 LOG(ERROR) << "Numerical failure. pq = " << pq;
160 double alpha = rho / pq;
|
| /external/opencv/cv/src/ |
| _cvkdtree.hpp | 328 void pq_alternate(int alt_n, bbf_pqueue & pq, scalar_type dist) const {
333 pq.push_back(bbf_node(alt_n, dist));
334 push_heap(pq.begin(), pq.end());
340 int bbf_branch(int i, const __desctype * d, bbf_pqueue & pq) const {
344 pq_alternate(n.right, pq, n.boundary - d[n.dim]);
347 pq_alternate(n.left, pq, d[n.dim] - n.boundary);
|
| /external/e2fsprogs/util/ |
| gen-tarball.in | 39 -o -name CVS -o -name \*.rej -o -name Makefile.pq \
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| CertPathValidatorUtilities.java | 380 Set pq = new HashSet(); local
384 return pq;
398 pq.add(new PolicyQualifierInfo(bOut.toByteArray()));
408 return pq;
463 Set pq)
481 pq,
555 Set pq = null; local
582 pq = getQualifierSet(pinfo.getPolicyQualifiers());
604 p_node, pq, id_p, ci);
[all...] |
| /external/clang/test/SemaCXX/ |
| overload-call.cpp | 175 void test_quals_ranking(int * p, int volatile *pq, int * * pp, int * * * ppp) {
177 float* q2 = quals_rank1(pq);
189 quals_rank3(pq);
|
| /external/bluetooth/bluedroid/bta/av/ |
| bta_av_main.c | 1093 BUFFER_Q *pq; local
[all...] |
| /external/qemu/slirp/ |
| ip_input.c | 320 struct ipasfrag *pq = q->ipf_prev; local
321 i = pq->ipf_off + pq->ipf_len - ip->ip_off;
|
| /external/qemu/slirp-android/ |
| ip_input.c | 320 struct ipasfrag *pq = q->ipf_prev; local
321 i = pq->ipf_off + pq->ipf_len - ip->ip_off;
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| PriorityBlockingQueue.java | 33 * {@code Arrays.sort(pq.toArray())}. Also, method {@code drainTo}
215 PriorityBlockingQueue<? extends E> pq = local
217 this.comparator = (Comparator<? super E>) pq.comparator();
219 if (pq.getClass() == PriorityBlockingQueue.class) // exact match
|
