/external/icu/icu4c/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/icu/icu4c/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/javassist/src/main/javassist/bytecode/stackmap/ |
H A D | MapMaker.java | 309 TypedBlock prev = blocks[0]; 310 int offsetDelta = prev.length; 311 if (prev.incoming > 0) { // the first instruction is a branch target. 320 int diffL = stackMapDiff(prev.numLocals, prev.localsTypes, 322 toStackMapBody(writer, bb, diffL, offsetDelta, prev); 324 prev = bb; 336 private boolean isTarget(TypedBlock cur, TypedBlock prev) { argument 343 return prev.stop; 347 int diffL, int offsetDelta, TypedBlock prev) { 346 toStackMapBody(StackMapTable.Writer writer, TypedBlock bb, int diffL, int offsetDelta, TypedBlock prev) argument [all...] |
/external/jemalloc/src/ |
H A D | chunk.c | 262 extent_node_t *xnode, *node, *prev, *xprev, key; local 274 /* Use xprev to implement conditional deferred deallocation of prev. */ 313 prev = extent_tree_ad_prev(chunks_ad, node); 314 if (prev != NULL && (void *)((uintptr_t)prev->addr + prev->size) == 321 extent_tree_szad_remove(chunks_szad, prev); 322 extent_tree_ad_remove(chunks_ad, prev); 325 node->addr = prev->addr; 326 node->size += prev [all...] |
/external/libcxxabi/src/Unwind/ |
H A D | Unwind-sjlj.c | 39 struct _Unwind_FunctionContext *prev; member in struct:_Unwind_FunctionContext 60 fc->prev = __Unwind_SjLj_GetTopOfFunctionStack(); 68 __Unwind_SjLj_SetTopOfFunctionStack(fc->prev); 78 for (bool handlerNotFound = true; handlerNotFound; c = c->prev) { 186 c = c->prev; 259 c = c->prev;
|
/external/libedit/src/ |
H A D | map.c | 1211 int prev, i; local 1214 prev = 0; 1216 if (el->el_map.key[prev] == el->el_map.key[i]) 1218 map_print_some_keys(el, el->el_map.key, prev, i - 1); 1219 prev = i; 1221 map_print_some_keys(el, el->el_map.key, prev, i - 1); 1224 prev = 0; 1226 if (el->el_map.alt[prev] == el->el_map.alt[i]) 1228 map_print_some_keys(el, el->el_map.alt, prev, i - 1); 1229 prev [all...] |
/external/libopus/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...] |
/external/libsepol/src/ |
H A D | avtab.c | 59 avtab_insert_node(avtab_t * h, int hvalue, avtab_ptr_t prev, avtab_key_t * key, argument 69 if (prev) { 70 newnode->next = prev->next; 71 prev->next = newnode; 84 avtab_ptr_t prev, cur, newnode; local 92 for (prev = NULL, cur = h->htable[hvalue]; 93 cur; prev = cur, cur = cur->next) { 110 newnode = avtab_insert_node(h, hvalue, prev, key, datum); 125 avtab_ptr_t prev, cur, newnode; local 132 for (prev [all...] |
H A D | ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; local 26 prev = 0; 50 if (prev) 51 prev->next = new; 54 prev = new; 173 ebitmap_node_t *n, *new, *prev; local 177 prev = 0; 188 if (prev) 189 prev->next = new; 192 prev 250 ebitmap_node_t *n, *prev, *new; local [all...] |
/external/libxml2/ |
H A D | error.c | 557 xmlNodePtr prev = baseptr; local 559 while (prev != NULL) { 560 if (prev->prev == NULL) 561 prev = prev->parent; 563 prev = prev->prev; 564 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/linux-tools-perf/perf-3.12.0/tools/perf/util/ |
H A D | cpumap.c | 49 int n, cpu, prev; local 53 prev = -1; 58 if (prev >= 0) { 59 int new_max = nr_cpus + cpu - prev - 1; 69 while (++prev < cpu) 70 tmp_cpus[nr_cpus++] = prev; 82 prev = cpu; 84 prev = -1;
|
H A D | evlist.h | 23 unsigned int prev; member in struct:perf_mmap 163 return list_entry(evlist->entries.prev, struct perf_evsel, node);
|
/external/lldb/source/Plugins/DynamicLoader/POSIX-DYLD/ |
H A D | DYLDRendezvous.h | 135 lldb::addr_t prev; ///< Address of previous so_entry. member in struct:DYLDRendezvous::SOEntry 149 prev = 0;
|
/external/llvm/bindings/python/llvm/ |
H A D | core.py | 243 self.function = self.function.prev 280 def prev(self): member in class:Function 311 self.bb = self.bb.prev 336 def prev(self): member in class:BasicBlock 388 self.inst = self.inst.prev 411 def prev(self): member in class:Instruction
|
/external/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/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/mesa3d/src/glx/ |
H A D | glxhash.c | 204 __glxHashBucketPtr prev = NULL; local 212 if (prev) { 214 prev->next = bucket->next; 224 prev = bucket;
|