HomeSort by relevance Sort by last modified time
    Searched full:prev (Results 626 - 650 of 3406) sorted by null

<<21222324252627282930>>

  /prebuilts/ndk/9/platforms/android-8/arch-arm/usr/include/linux/
skbuff.h 48 struct sk_buff *prev; member in struct:sk_buff_head
106 struct sk_buff *prev; member in struct:sk_buff
  /prebuilts/ndk/9/platforms/android-9/arch-arm/usr/include/linux/
skbuff.h 48 struct sk_buff *prev; member in struct:sk_buff_head
106 struct sk_buff *prev; member in struct:sk_buff
  /prebuilts/ndk/9/platforms/android-9/arch-mips/usr/include/linux/
skbuff.h 48 struct sk_buff *prev; member in struct:sk_buff_head
106 struct sk_buff *prev; member in struct:sk_buff
  /prebuilts/ndk/9/platforms/android-9/arch-x86/usr/include/linux/
skbuff.h 48 struct sk_buff *prev; member in struct:sk_buff_head
106 struct sk_buff *prev; member in struct:sk_buff
  /external/wpa_supplicant_8/src/radius/
radius_client.c 389 struct radius_msg_list *entry, *prev, *tmp; local
402 prev = NULL;
407 if (prev)
408 prev->next = entry->next;
423 prev = NULL;
441 prev = entry;
542 struct radius_msg_list *entry, *prev; local
575 prev = NULL;
577 prev = entry;
580 if (prev) {
592 struct radius_msg_list *entry, *prev, *tmp; local
865 struct radius_msg_list *entry, *prev, *_remove; local
905 struct radius_msg_list *entry, *prev, *tmp; local
1386 struct radius_msg_list *entry, *prev, *tmp; local
    [all...]
  /bootable/recovery/minadbd/
fdevent.c 99 .prev = &list_pending,
479 node->prev = list->prev;
480 node->prev->next = node;
481 list->prev = node;
486 node->prev->next = node->next;
487 node->next->prev = node->prev;
489 node->prev = 0;
500 list->next->prev = list
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
ft_hash.c 212 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 = elem->prev
    [all...]
fts1_hash.c 170 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 = elem->prev
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2_hash.c 175 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 = elem->prev
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3_hash.c 175 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 = elem->prev
    [all...]
  /prebuilts/misc/common/swig/include/2.0.11/
swigrun.swg 200 struct swig_cast_info *prev; /* pointer to the previous cast */
273 iter->prev->next = iter->next;
275 iter->next->prev = iter->prev;
277 iter->prev = 0;
278 if (ty->cast) ty->cast->prev = iter;
300 iter->prev->next = iter->next;
302 iter->next->prev = iter->prev;
304 iter->prev = 0
    [all...]
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/email/
quoprimime.py 220 prev = None
226 prev = c
233 prev = c
241 if prev and prev in ' \t':
244 prev = quote(prev)
245 if len(encoded_line) + len(prev) > maxlinelen:
246 encoded_body += encoded_line + '=' + eol + prev
248 encoded_body += encoded_line + prev
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/email/
quoprimime.py 220 prev = None
226 prev = c
233 prev = c
241 if prev and prev in ' \t':
244 prev = quote(prev)
245 if len(encoded_line) + len(prev) > maxlinelen:
246 encoded_body += encoded_line + '=' + eol + prev
248 encoded_body += encoded_line + prev
    [all...]
  /system/core/adb/
fdevent.c 90 .prev = &list_pending,
470 node->prev = list->prev;
471 node->prev->next = node;
472 list->prev = node;
477 node->prev->next = node->next;
478 node->next->prev = node->prev;
480 node->prev = 0;
491 list->next->prev = list
    [all...]
  /external/chromium_org/third_party/icu/source/common/
utrie2.cpp 519 UChar32 c, prev, highStart; local
553 prev=start;
589 if(i2Block==prevI2Block && (c-prev)>=UTRIE2_CP_PER_INDEX_1_ENTRY) {
603 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
607 prev=c;
626 if(block==prevBlock && (c-prev)>=UTRIE2_DATA_BLOCK_LENGTH) {
635 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
638 prev=c
    [all...]
utrie.c 1063 UChar32 c, prev local
    [all...]
  /external/chromium_org/third_party/libxml/src/
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->type == XML_XINCLUDE_START)
    [all...]
  /external/icu/icu4c/source/common/
utrie2.cpp 552 UChar32 c, prev, highStart; local
588 prev=start;
624 if(i2Block==prevI2Block && (c-prev)>=UTRIE2_CP_PER_INDEX_1_ENTRY) {
638 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
642 prev=c;
661 if(block==prevBlock && (c-prev)>=UTRIE2_DATA_BLOCK_LENGTH) {
670 if(prev<c && !enumRange(context, prev, c-1, prevValue)) {
673 prev=c
    [all...]
utrie.cpp 1063 UChar32 c, prev local
    [all...]
  /external/libxml2/
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->type == XML_XINCLUDE_START)
    [all...]
  /external/llvm/include/llvm/ADT/
ilist.h 20 // that the nodes contain next/prev pointers. This list replacement does not
27 // of this, users of the direct next/prev links will see an extra link on the
32 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
34 // prev links.
53 /// that provides default next/prev implementations for common operations.
62 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); }
73 /// strategy. The sentinel is stored in the prev field of ilist's Head.
133 // can change what next/prev fields are used to store the links...
294 /// holds the next/prev pointers. The only state of the list itself is a singl
    [all...]
  /external/wpa_supplicant_8/src/eap_peer/
eap_fast_pac.c 90 struct eap_fast_pac *pac, *prev; local
93 prev = NULL;
98 if (prev == NULL)
101 prev->next = pac->next;
107 prev = pac;
672 struct eap_fast_pac *pac, *prev; local
676 prev = NULL;
683 prev = pac;
687 if (count <= max_len || prev == NULL)
691 prev->next = NULL
756 struct eap_fast_pac *pac, *prev; local
    [all...]
  /bionic/libc/kernel/uapi/linux/netfilter/
xt_limit.h 29 unsigned long prev; member in struct:xt_rateinfo
  /bionic/libc/kernel/uapi/linux/netfilter_bridge/
ebt_limit.h 29 unsigned long prev; member in struct:ebt_limit_info
  /bionic/libc/upstream-netbsd/lib/libc/isc/
eventlib_p.h 87 struct evConn * prev; member in struct:evConn
120 struct evFile * prev; member in struct:evFile
142 struct evStream *prev, *next; member in struct:evStream
164 struct evWaitList * prev; member in struct:evWaitList

Completed in 768 milliseconds

<<21222324252627282930>>