| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 119 struct hash_node *hn = (struct hash_node *) node; local
121 if ((*ht->compare)(hn->key, key) == 0) {
122 return hn;
132 struct hash_node *hn = get_node(ht, key); local
134 return (hn == NULL) ? NULL : hn->data;
158 struct hash_node *hn; local
161 hn = (struct hash_node *) node;
163 if ((*ht->compare)(hn->key, key) == 0) {
164 hn->data = data
201 struct hash_node *hn = (struct hash_node *) node; local
[all...] |
| /external/freetype/src/gzip/ |
| inftrees.c | 95 local int huft_build( /* b, n, s, d, e, t, m, hp, hn, v) */
104 uInt *hn, /* hufts used in space */
238 if (*hn + z > MANY) /* (note: doesn't matter for fixed) */
240 u[h] = q = hp + *hn;
241 *hn += z;
308 uInt hn = 0; /* hufts used in space */ local
314 tb, bb, hp, &hn, v);
340 uInt hn = 0; /* hufts used in space */ local
348 r = huft_build(c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v);
363 r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v)
[all...] |
| /external/libvorbis/lib/ |
| floor1.c | 643 int hn=hineighbor[sortpos]; local
646 if(memo[ln]!=hn){
649 int hsortpos=look->reverse_index[hn];
650 memo[ln]=hn;
655 int hx=info->postlist[hn];
657 int hy=post_Y(fit_valueA,fit_valueB,hn);
690 fit_valueA[hn]=hy1;
691 if(hn==1)fit_valueB[hn]=hy1;
696 if(hineighbor[j]==hn)
725 int hn=look->hineighbor[i-2]; local
807 int hn=look->hineighbor[i-2]; local
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| LinkedTransferQueue.java | 912 Node hn = h.next; local
[all...] |
| SynchronousQueue.java | 753 QNode hn = h.next; // Absorb cancelled first node as head local
754 if (hn != null && hn.isCancelled()) {
755 advanceHead(h, hn);
[all...] |
| ConcurrentHashMap.java | 1788 Node<K,V> ln, hn; local
[all...] |
