Searched refs:pq (Results 1 - 25 of 35) sorted by relevance

12

/external/skia/third_party/glu/libtess/
H A Dpriorityq-heap.h52 #define pqDeletePriorityQ(pq) __gl_pqHeapDeletePriorityQ(pq)
67 #define pqInit(pq) __gl_pqHeapInit(pq)
68 #define pqInsert(pq,key) __gl_pqHeapInsert(pq,key)
69 #define pqMinimum(pq) __gl_pqHeapMinimum(pq)
70 #define pqExtractMin(pq) __gl_pqHeapExtractMin(pq)
[all...]
H A Dpriorityq-sort.h66 #define pqDeletePriorityQ(pq) __gl_pqSortDeletePriorityQ(pq)
81 #define pqInit(pq) __gl_pqSortInit(pq)
82 #define pqInsert(pq,key) __gl_pqSortInsert(pq,key)
83 #define pqMinimum(pq) __gl_pqSortMinimum(pq)
84 #define pqExtractMin(pq) __gl_pqSortExtractMin(pq)
[all...]
H A Dpriorityq.c59 PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ )); local
60 if (pq == NULL) return NULL;
62 pq->heap = __gl_pqHeapNewPriorityQ( leq );
63 if (pq->heap == NULL) {
64 memFree(pq);
68 pq->keys = (PQHeapKey *)memAlloc( INIT_SIZE * sizeof(pq->keys[0]) );
69 if (pq->keys == NULL) {
70 __gl_pqHeapDeletePriorityQ(pq->heap);
71 memFree(pq);
180 pqInsert( PriorityQ *pq, PQkey keyNew ) argument
254 pqDelete( PriorityQ *pq, PQhandle curr ) argument
[all...]
H A Dpriorityq.h66 #define pqDeletePriorityQ(pq) __gl_pqSortDeletePriorityQ(pq)
81 #define pqInit(pq) __gl_pqSortInit(pq)
82 #define pqInsert(pq,key) __gl_pqSortInsert(pq,key)
83 #define pqMinimum(pq) __gl_pqSortMinimum(pq)
84 #define pqExtractMin(pq) __gl_pqSortExtractMin(pq)
[all...]
H A Dpriorityq-heap.c54 #define LEQ(x,y) (*pq->leq)(x,y)
64 PriorityQ *pq = (PriorityQ *)memAlloc( sizeof( PriorityQ )); local
65 if (pq == NULL) return NULL;
67 pq->size = 0;
68 pq->max = INIT_SIZE;
69 pq->nodes = (PQnode *)memAlloc( (INIT_SIZE + 1) * sizeof(pq->nodes[0]) );
70 if (pq->nodes == NULL) {
71 memFree(pq);
75 pq
100 FloatDown( PriorityQ *pq, long curr ) argument
130 FloatUp( PriorityQ *pq, long curr ) argument
167 pqInsert( PriorityQ *pq, PQkey keyNew ) argument
238 pqDelete( PriorityQ *pq, PQhandle hCurr ) argument
[all...]
H A Dsweep.c543 pqDelete( tess->pq, eUp->Org->pqHandle ); /* __gl_pqSortDelete */
750 eUp->Org->pqHandle = pqInsert( tess->pq, eUp->Org ); /* __gl_pqSortInsert */
752 pqDeletePriorityQ(tess->pq); /* __gl_pqSortDeletePriorityQ */
753 tess->pq = NULL;
1240 PriorityQ *pq; local
1244 pq = tess->pq = pqNewPriorityQ( (int (*)(PQkey, PQkey)) __gl_vertLeq );
1245 if (pq == NULL) return 0;
1249 v->pqHandle = pqInsert( pq, v ); /* __gl_pqSortInsert */
1252 if (v != vHead || !pqInit( pq ) ) { /* __gl_pqSortIni
[all...]
H A Dtess.h91 PriorityQ *pq; /* priority queue of vertex events */ member in struct:GLUtesselator
/external/openssl/crypto/pqueue/
H A Dpq_test.c66 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); ite
[all...]
H A Dpqueue.h82 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);
H A Dpqueue.c95 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) argument
105 if (pq == NULL) return;
107 OPENSSL_free(pq);
111 pqueue_insert(pqueue_s *pq, pitem *item) argument
115 if (pq->items == NULL)
117 pq
151 pqueue_peek(pqueue_s *pq) argument
157 pqueue_pop(pqueue_s *pq) argument
168 pqueue_find(pqueue_s *pq, unsigned char *prio64be) argument
203 pqueue_print(pqueue_s *pq) argument
219 pqueue_iterator(pqueue_s *pq) argument
241 pqueue_size(pqueue_s *pq) argument
[all...]
/external/srec/srec/crec/
H A Dpriority_q.c43 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) argument
55 FREE(pq);
60 void clear_priority_q(priority_q *pq) argument
70 get_word_token_list(priority_q *pq, word_token *word_token_array) argument
75 remove_non_end_word_from_q(srec *rec, priority_q *pq, word_token *word_token_array, nodeID end_node) argument
160 sanity_check_priority_q(priority_q* pq, word_token *word_token_array) argument
187 add_word_token_to_priority_q(priority_q *pq, wtokenID token_index_to_add, word_token *word_token_array) argument
327 get_priority_q_threshold(priority_q *pq, word_token *word_token_array) argument
[all...]
/external/openssl/include/openssl/
H A Dpqueue.h82 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);
/external/dropbear/libtomcrypt/src/pk/katja/
H A Dkatja_free.c28 key->qP, key->p, key->q, key->pq, NULL);
H A Dkatja_import.c38 &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);
H A Dkatja_make_key.c63 &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);
H A Dkatja_export.c45 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,
/external/srec/srec/include/
H A Dsrec.h324 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);
/external/llvm/include/llvm/CodeGen/
H A DLatencyPriorityQueue.h27 explicit latency_sort(LatencyPriorityQueue *pq) : PQ(pq) {} argument
H A DResourcePriorityQueue.h33 explicit resource_sort(ResourcePriorityQueue *pq) : PQ(pq) {} argument
/external/opencv/cv/src/
H A D_cvkdtree.hpp328 void pq_alternate(int alt_n, bbf_pqueue & pq, scalar_type dist) const { argument
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/
H A Dgen-tarball.in39 -o -name CVS -o -name \*.rej -o -name Makefile.pq \
/external/bouncycastle/src/main/java/org/bouncycastle/jce/provider/
H A DCertPathValidatorUtilities.java386 Set pq = new HashSet();
390 return pq;
404 pq.add(new PolicyQualifierInfo(bOut.toByteArray()));
414 return pq;
469 Set pq)
487 pq,
560 Set pq = null;
589 pq = getQualifierSet(pinfo.getPolicyQualifiers());
611 p_node, pq, id_p, ci);
465 processCertD1i( int index, List [] policyNodes, DERObjectIdentifier pOid, Set pq) argument
/external/clang/test/SemaCXX/
H A Doverload-call.cpp175 void test_quals_ranking(int * p, int volatile *pq, int * * pp, int * * * ppp) { argument
177 float* q2 = quals_rank1(pq);
189 quals_rank3(pq);
/external/qemu/slirp/
H A Dip_input.c320 struct ipasfrag *pq = q->ipf_prev; local
321 i = pq->ipf_off + pq->ipf_len - ip->ip_off;
/external/qemu/slirp-android/
H A Dip_input.c320 struct ipasfrag *pq = q->ipf_prev; local
321 i = pq->ipf_off + pq->ipf_len - ip->ip_off;

Completed in 289 milliseconds

12