Searched refs:prev (Results 226 - 250 of 1447) sorted by relevance

1234567891011>>

/external/skia/src/gpu/
H A DGrTMultiMap.h61 ValueList* prev = NULL; local
63 prev = list;
72 } else if (NULL != prev) {
73 prev->fNext = NULL;
/external/wpa_supplicant_8/hostapd/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info
H A Dieee802_11_auth.c67 struct hostapd_cached_radius_acl *prev; local
70 prev = acl_cache;
72 hostapd_acl_cache_free_entry(prev);
343 struct hostapd_cached_radius_acl *prev, *entry, *tmp; local
345 prev = NULL;
353 if (prev)
354 prev->next = entry->next;
364 prev = entry;
373 struct hostapd_acl_query_data *prev, *entry, *tmp; local
375 prev
482 struct hostapd_acl_query_data *query, *prev; local
619 struct hostapd_acl_query_data *query, *prev; local
639 struct hostapd_sta_wpa_psk_short *prev = psk; local
[all...]
/external/wpa_supplicant_8/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info
H A Dieee802_11_auth.c67 struct hostapd_cached_radius_acl *prev; local
70 prev = acl_cache;
72 hostapd_acl_cache_free_entry(prev);
343 struct hostapd_cached_radius_acl *prev, *entry, *tmp; local
345 prev = NULL;
353 if (prev)
354 prev->next = entry->next;
364 prev = entry;
373 struct hostapd_acl_query_data *prev, *entry, *tmp; local
375 prev
482 struct hostapd_acl_query_data *query, *prev; local
619 struct hostapd_acl_query_data *query, *prev; local
639 struct hostapd_sta_wpa_psk_short *prev = psk; local
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/ap/
H A Dap_list.h15 /* Note: next/prev pointers are updated whenever a new beacon is
19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info
H A Dieee802_11_auth.c67 struct hostapd_cached_radius_acl *prev; local
70 prev = acl_cache;
72 hostapd_acl_cache_free_entry(prev);
343 struct hostapd_cached_radius_acl *prev, *entry, *tmp; local
345 prev = NULL;
353 if (prev)
354 prev->next = entry->next;
364 prev = entry;
373 struct hostapd_acl_query_data *prev, *entry, *tmp; local
375 prev
482 struct hostapd_acl_query_data *query, *prev; local
619 struct hostapd_acl_query_data *query, *prev; local
639 struct hostapd_sta_wpa_psk_short *prev = psk; local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_util.h106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
113 (__item)->prev = (__item); \
119 (__item)->prev = (__list)->prev; \
120 (__list)->prev->next = (__item); \
121 (__list)->prev = (__item); \
126 (__item)->prev
156 Item *prev; member in class:nv50_ir::DLList::Item
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_util.h106 // WARNING: do not use a->prev/next for __item or __list
110 (__item)->prev->next = (__item)->next; \
111 (__item)->next->prev = (__item)->prev; \
113 (__item)->prev = (__item); \
119 (__item)->prev = (__list)->prev; \
120 (__list)->prev->next = (__item); \
121 (__list)->prev = (__item); \
126 (__item)->prev
156 Item *prev; member in class:nv50_ir::DLList::Item
[all...]
/external/javassist/src/main/javassist/bytecode/stackmap/
H A DMapMaker.java309 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/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dft_hash.c212 pNew->prev = pHead->prev;
213 if( pHead->prev ){ pHead->prev->next = pNew; }
215 pHead->prev = pNew;
218 if( pH->first ){ pH->first->prev = pNew; }
219 pNew->prev = 0;
288 if( elem->prev ){
289 elem->prev->next = elem->next;
294 elem->next->prev
[all...]
H A Dfts1_hash.c170 pNew->prev = pHead->prev;
171 if( pHead->prev ){ pHead->prev->next = pNew; }
173 pHead->prev = pNew;
176 if( pH->first ){ pH->first->prev = pNew; }
177 pNew->prev = 0;
246 if( elem->prev ){
247 elem->prev->next = elem->next;
252 elem->next->prev
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts2/
H A Dfts2_hash.c175 pNew->prev = pHead->prev;
176 if( pHead->prev ){ pHead->prev->next = pNew; }
178 pHead->prev = pNew;
181 if( pH->first ){ pH->first->prev = pNew; }
182 pNew->prev = 0;
251 if( elem->prev ){
252 elem->prev->next = elem->next;
257 elem->next->prev
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts3/
H A Dfts3_hash.c175 pNew->prev = pHead->prev;
176 if( pHead->prev ){ pHead->prev->next = pNew; }
178 pHead->prev = pNew;
181 if( pH->first ){ pH->first->prev = pNew; }
182 pNew->prev = 0;
254 if( elem->prev ){
255 elem->prev->next = elem->next;
260 elem->next->prev
[all...]
/external/jemalloc/src/
H A Dchunk.c262 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/libusb/libusb/
H A Dlibusbi.h40 struct list_head *prev, *next; member in struct:list_head
71 entry->prev = entry->next = entry;
77 entry->prev = head;
79 head->next->prev = entry;
87 entry->prev = head->prev;
89 head->prev->next = entry;
90 head->prev = entry;
95 entry->next->prev = entry->prev;
[all...]
/external/apache-xml/src/main/java/org/apache/xalan/templates/
H A DElemTemplateElement.java372 ElemTemplateElement prev = childETE.getPreviousSiblingElem();
374 prev.m_nextSibling = childETE.m_nextSibling;
404 ElemTemplateElement prev =
407 if (null != prev)
408 prev.m_nextSibling = newChildElem;
449 Node prev = null;
457 if(null != prev)
458 ((ElemTemplateElement)prev).m_nextSibling =
463 continue; // prev remains the same.
467 if(null != prev)
[all...]
/external/chromium_org/third_party/sqlite/src/src/
H A Dmem3.c89 u32 prev; /* Index in mem3.aPool[] of previous free chunk */ member in struct:Mem3Block::__anon15490::__anon15492
149 u32 prev = mem3.aPool[i].u.list.prev; local
151 if( prev==0 ){
154 mem3.aPool[prev].u.list.next = next;
157 mem3.aPool[next].u.list.prev = prev;
160 mem3.aPool[i].u.list.prev = 0;
190 mem3.aPool[i].u.list.prev = 0;
192 mem3.aPool[*pRoot].u.list.prev
316 u32 iNext, prev, size, i, x; local
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DSkAntiEdge.cpp434 static inline void swap_edges(SkAntiEdge* prev, SkAntiEdge* next) { argument
435 SkASSERT(prev->fNext == next && next->fPrev == prev);
437 // remove prev from the list
438 prev->fPrev->fNext = next;
439 next->fPrev = prev->fPrev;
441 // insert prev after next
442 prev->fNext = next->fNext;
443 next->fNext->fPrev = prev;
444 next->fNext = prev;
452 SkAntiEdge* prev = edge->fPrev; local
505 SkAntiEdge* prev = fEdges.begin(); local
[all...]
/external/skia/experimental/Intersection/
H A DSkAntiEdge.cpp434 static inline void swap_edges(SkAntiEdge* prev, SkAntiEdge* next) { argument
435 SkASSERT(prev->fNext == next && next->fPrev == prev);
437 // remove prev from the list
438 prev->fPrev->fNext = next;
439 next->fPrev = prev->fPrev;
441 // insert prev after next
442 prev->fNext = next->fNext;
443 next->fNext->fPrev = prev;
444 next->fNext = prev;
452 SkAntiEdge* prev = edge->fPrev; local
505 SkAntiEdge* prev = fEdges.begin(); local
[all...]
/external/jpeg/
H A Dltmain.sh69 prev=
88 if test -n "$prev"; then
89 case "$prev" in
91 eval "$prev=\"\$$prev \$arg\""
94 eval "$prev=\$arg"
98 prev=
135 --mode) prevopt="--mode" prev=mode ;;
144 prev=execute_dlfiles
386 prev
[all...]
/external/qemu/distrib/jpeg-6b/
H A Dltmain.sh69 prev=
88 if test -n "$prev"; then
89 case "$prev" in
91 eval "$prev=\"\$$prev \$arg\""
94 eval "$prev=\$arg"
98 prev=
135 --mode) prevopt="--mode" prev=mode ;;
144 prev=execute_dlfiles
386 prev
[all...]
/external/bison/lib/
H A Dobstack.c181 chunk->prev = 0;
229 chunk->prev = 0;
263 new_chunk->prev = old_chunk;
298 new_chunk->prev = old_chunk->prev;
331 plp = lp->prev;
355 plp = lp->prev;
386 for (lp = h->chunk; lp != 0; lp = lp->prev)
/external/chromium-trace/trace-viewer/src/ui/
H A Dlist_view.js121 var prev = this.selectedElement.previousSibling;
122 if (prev) {
123 prev.selected = true;
124 prev.scrollIntoView(false);
/external/chromium_org/third_party/libvpx/source/libvpx/vpx_mem/memory_manager/
H A Dhmm_base.c29 to_remove->prev->next = to_remove->next;
32 to_remove->next->prev = to_remove->prev;
56 ptr_rec_ptr->prev = bin_front_ptr;
61 ptr_rec_ptr->next->prev = ptr_rec_ptr;
348 (((ACCESS) ? AUDIT_BLOCK_AS_EXPR(PTR_REC_TO_HEAD(H)) : 0), (H)->prev)
353 #define AVL_GET_GREATER(H, ACCESS) ((H)->prev)
358 #define AVL_SET_GREATER(H, GH) (H)->prev = (GH);

Completed in 6258 milliseconds

1234567891011>>