/external/chromium_org/third_party/boringssl/src/crypto/bn/ |
H A D | ctx.c | 71 struct bignum_pool_item *prev, *next; member in struct:bignum_pool_item 275 item->prev = p->tail; 308 p->current = p->current->prev;
|
/external/chromium_org/third_party/freetype/include/freetype/ |
H A D | fttypes.h | 534 /* prev :: The previous element in the list. NULL if first. */ 542 FT_ListNode prev; member in struct:FT_ListNodeRec_
|
/external/chromium_org/third_party/harfbuzz-ng/src/ |
H A D | hb-buffer-private.hh | 78 inline hb_glyph_info_t &prev (void) { return out_info[out_len - 1]; } function in struct:hb_buffer_t 79 inline hb_glyph_info_t prev (void) const { return info[out_len - 1]; } function in struct:hb_buffer_t
|
H A D | hb-ot-shape-complex-arabic.cc | 109 /* State 0: prev was U, not willing to join. */ 112 /* State 1: prev was R or ISOL/ALAPH, not willing to join. */ 115 /* State 2: prev was D/L in ISOL form, willing to join. */ 118 /* State 3: prev was D in FINA form, willing to join. */ 121 /* State 4: prev was FINA ALAPH, not willing to join. */ 124 /* State 5: prev was FIN2/FIN3 ALAPH, not willing to join. */ 127 /* State 6: prev was DALATH/RISH, not willing to join. */ 248 unsigned int prev = (unsigned int) -1, state = 0; local 274 if (entry->prev_action != NONE && prev != (unsigned int) -1) 275 info[prev] [all...] |
/external/chromium_org/third_party/icu/source/common/ |
H A D | ubidi_props.c | 67 uint8_t prev, jg; local 87 prev=0; 90 if(jg!=prev) { 92 prev=jg; 96 if(prev!=0) {
|
H A D | ucasemap.cpp | 264 int32_t prev, titleStart, titleLimit, idx, destIndex, length; local 281 prev=0; 285 while(prev<srcLength) { 305 * In this implementation, segment [prev..index[ into 3 parts: 306 * a) uncased characters (copy as-is) [prev..titleStart[ 310 if(prev<idx) { 311 /* find and copy uncased characters [prev..titleStart[ */ 312 titleStart=titleLimit=prev; 320 * only uncased characters in [prev..index[ 330 length=titleStart-prev; [all...] |
/external/chromium_org/third_party/icu/source/test/perf/unisetperf/ |
H A D | unisetperf.cpp | 108 int32_t prev; local 109 while((prev=start)<length) { 115 return prev; 194 int32_t start=0, prev; local 195 while((prev=start)<length) { 201 return prev;
|
/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | skiplist.h | 19 // (2) The contents of a Node except for the next/prev pointers are 25 // ... prev vs. next pointer ordering ... 125 // If prev is non-NULL, fills prev[level] with pointer to previous 127 Node* FindGreaterOrEqual(const Key& key, Node** prev) const; 212 // Instead of using explicit "prev" links, we just search for the 259 typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindGreaterOrEqual(const Key& key, Node** prev) 269 if (prev != NULL) prev[level] = x; 337 Node* prev[kMaxHeigh local [all...] |
/external/chromium_org/third_party/libxml/src/ |
H A D | error.c | 548 xmlNodePtr prev = baseptr; local 550 while (prev != NULL) { 551 if (prev->prev == NULL) 552 prev = prev->parent; 554 prev = prev->prev; 555 if (prev [all...] |
H A D | list.c | 34 struct _xmlLink *prev; member in struct:_xmlLink 61 (lk->prev)->next = lk->next; 62 (lk->next)->prev = lk->prev; 124 for(lk = l->sentinel->prev;lk != l->sentinel && l->linkCompare(lk->data, data) >0 ;lk = lk->prev); 207 l->sentinel->prev = l->sentinel; 288 lkPlace = lkPlace->prev; 290 (lkPlace->next)->prev = lkNew; 292 lkNew->prev [all...] |
/external/chromium_org/third_party/libxslt/libxslt/ |
H A D | keys.c | 382 xsltKeyDefPtr prev = style->keys; local 384 while (prev->next != NULL) 385 prev = prev->next; 387 prev->next = key;
|
/external/chromium_org/third_party/mesa/src/src/egl/main/ |
H A D | egldisplay.c | 434 _EGLResource *prev; local 436 prev = res->Display->ResourceLists[type]; 437 if (prev != res) { 438 while (prev) { 439 if (prev->Next == res) 441 prev = prev->Next; 443 assert(prev); 444 prev->Next = res->Next;
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_cache.c | 54 struct util_cache_entry *prev; member in struct:util_cache_entry 194 entry = cache->lru.prev; 197 util_cache_entry_destroy(cache, cache->lru.prev);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
H A D | lp_state_fs.h | 77 struct lp_fs_variant_list_item *next, *prev; member in struct:lp_fs_variant_list_item
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv30/ |
H A D | nv30_state_validate.c | 433 struct nv30_context *prev = nv30->screen->cur_ctx; local 435 if (prev) 436 nv30->state = prev->state;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.h | 68 Edge *prev[2]; member in class:nv50_ir::Graph::Edge 82 t = e = ((rev && first) ? first->prev[d] : first); 87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
H A D | r600_query.c | 302 struct r600_query_buffer *prev = rquery->buffer.previous; local 305 while (prev) { 306 struct r600_query_buffer *qbuf = prev; 307 prev = prev->previous; 339 struct r600_query_buffer *prev = rquery->buffer.previous; local 347 while (prev) { 348 struct r600_query_buffer *qbuf = prev; 349 prev = prev [all...] |
/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | list.h | 29 * contain no data. The head sentinel can be identified by its \c prev 34 * tail sentinel or the tail sentinel's \c prev poiner points to the head 45 * - A \c tail pointer that represents the \c prev pointer of the head 48 * - A \c tail_prev pointer that represents the \c prev pointer of the 51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL, 76 struct exec_node *prev; member in struct:exec_node 98 exec_node() : next(NULL), prev(NULL) 115 return prev; 120 return prev; 125 next->prev [all...] |
H A D | ralloc.c | 65 struct ralloc_header *prev; member in struct:ralloc_header 96 info->next->prev = info; 147 if (info->prev != NULL) 148 info->prev->next = info; 151 info->next->prev = info; 219 if (info->prev != NULL) 220 info->prev->next = info->next; 223 info->next->prev = info->prev; 226 info->prev [all...] |
/external/chromium_org/third_party/mesa/src/src/glx/ |
H A D | glxhash.c | 204 __glxHashBucketPtr prev = NULL; local 212 if (prev) { 214 prev->next = bucket->next; 224 prev = bucket;
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/ |
H A D | intel_batchbuffer.c | 327 struct cached_batch_item **prev = &intel->batch.cached_items, *item; local 332 while (*prev) { 335 item = *prev; 339 if (prev != &intel->batch.cached_items) { 340 *prev = item->next; 350 prev = &item->next;
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_schedule_instructions.cpp | 218 schedule_node *prev = (schedule_node *)n->prev; local 221 if (prev) { 222 while (!prev->is_head_sentinel()) { 223 add_dep(prev, n, 0); 224 prev = (schedule_node *)prev->prev; 354 exec_node *prev; local 355 for (node = instructions.get_tail(), prev [all...] |
H A D | intel_batchbuffer.c | 327 struct cached_batch_item **prev = &intel->batch.cached_items, *item; local 332 while (*prev) { 335 item = *prev; 339 if (prev != &intel->batch.cached_items) { 340 *prev = item->next; 350 prev = &item->next;
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
H A D | intel_batchbuffer.c | 327 struct cached_batch_item **prev = &intel->batch.cached_items, *item; local 332 while (*prev) { 335 item = *prev; 339 if (prev != &intel->batch.cached_items) { 340 *prev = item->next; 350 prev = &item->next;
|
/external/chromium_org/third_party/opus/src/src/ |
H A D | opus_multistream_decoder.c | 262 int chan, prev; local 263 prev = -1; 265 while ( (chan = get_left_channel(&st->layout, s, prev)) != -1) 269 prev = chan; 271 prev = -1; 273 while ( (chan = get_right_channel(&st->layout, s, prev)) != -1) 277 prev = chan; 280 int chan, prev; local 281 prev = -1; 283 while ( (chan = get_mono_channel(&st->layout, s, prev)) ! [all...] |