/external/okhttp/okio/src/main/java/okio/ |
H A D | Segment.java | 46 Segment prev; field in class:Segment 54 prev.next = next; 55 next.prev = prev; 57 prev = null; 66 segment.prev = this; 68 next.prev = segment; 93 prev.push(before); 111 if (prev == this) throw new IllegalStateException(); 112 if ((prev [all...] |
/external/pdfium/core/src/fxge/agg/agg23/ |
H A D | agg_shorten_path.h | 42 vertex_type& prev = vs[n - 1]; local 44 d = (prev.dist - s) / prev.dist; 45 FX_FLOAT x = prev.x + (last.x - prev.x) * d; 46 FX_FLOAT y = prev.y + (last.y - prev.y) * d; 49 if(!prev(last)) {
|
/external/qemu/android/utils/ |
H A D | list.h | 36 ACList* prev; member in struct:ACList 43 list->next = list->prev = list; 59 entry->prev = list; 60 next->prev = entry; 67 ACList* const prev = list->prev; local 69 entry->prev = prev; 70 prev->next = entry; 71 list->prev 80 ACList* const prev = entry->prev; local [all...] |
/external/skia/include/core/ |
H A D | SkThread.h | 53 int32_t prev; local 55 prev = *addr; 56 if (0 == prev) { 59 } while (!sk_atomic_cas(addr, prev, prev+1)); 60 return prev;
|
/external/skia/src/core/ |
H A D | SkRefDict.cpp | 46 Impl* prev = NULL; local 57 if (prev) { 58 prev->fNext = rec->fNext; 66 prev = rec;
|
/external/srec/seti/sltsEngine/include/ |
H A D | linklist.h | 26 struct LNode *prev; member in struct:LNode
|
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | ap_list.h | 15 /* 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
|
/external/wpa_supplicant_8/src/ap/ |
H A D | ap_list.h | 15 /* 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
|
/external/wpa_supplicant_8/wpa_supplicant/src/ap/ |
H A D | ap_list.h | 15 /* 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
|
/external/zopfli/src/zopfli/ |
H A D | hash.h | 31 unsigned short* prev; /* Index to index of prev. occurance of same hash. */ member in struct:ZopfliHash 39 unsigned short* prev2; /* Index to index of prev. occurance of same hash. */
|
/external/bison/lib/ |
H A D | fd-hook.c | 101 struct fd_hook *prev = link->private_prev; local 103 if (next != NULL && prev != NULL) 106 prev->private_next = next; 107 next->private_prev = prev;
|
/external/chromium_org/base/i18n/ |
H A D | break_iterator.h | 50 // // Region [iter.prev(), iter.pos()) contains a word. 113 // Returns the string between prev() and pos(). 119 size_t prev() const { return prev_; } function in class:base::i18n::BreakIterator
|
/external/chromium_org/chrome/app/ |
H A D | chrome_exe_main_win.cc | 84 int APIENTRY wWinMain(HINSTANCE instance, HINSTANCE prev, wchar_t*, int) { argument
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | bocsu.cpp | 90 * code points. Lexical order is preserved if "prev" is always moved 93 * Additionally, "prev" is moved from anywhere in the Unihan 103 UChar32 prev=0; local 118 if(prev<0x4e00 || prev>=0xa000) { 119 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1; 125 prev=0x9fff-SLOPE_REACH_POS_2; 130 p=u_writeDiff(c-prev, p); 131 prev [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_slab.h | 49 struct util_slab_page *prev, *next; member in struct:util_slab_page
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/rbug/ |
H A D | rbug_screen.h | 38 struct rbug_list *prev; member in struct:rbug_list
|
/external/chromium_org/third_party/mesa/src/src/mesa/main/ |
H A D | simple_list.h | 46 struct simple_node *prev; member in struct:simple_node 56 (elem)->next->prev = (elem)->prev; \ 57 (elem)->prev->next = (elem)->next; \ 68 (elem)->prev = list; \ 70 (list)->next->prev = elem; \ 83 (elem)->prev = (list)->prev; \ 84 (list)->prev->next = elem; \ 85 (list)->prev [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
H A D | prclist.h | 47 PRCList *prev; member in struct:PRCListStr 56 (_e)->prev = (_l)->prev; \ 57 (_l)->prev->next = (_e); \ 58 (_l)->prev = (_e); \ 67 (_e)->prev = (_l); \ 68 (_l)->next->prev = (_e); \ 81 ((_e)->prev) 95 #define PR_LIST_TAIL(_l) (_l)->prev 102 (_e)->prev [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLS.cpp | 107 SkTLSRec* prev = NULL; local 111 if (prev) { 112 prev->fNext = next; 120 prev = curr;
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | hash.h | 60 HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:HashElem
|
/external/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_atomic_clang.h | 81 Type prev = __sync_val_compare_and_swap(&a->val_dont_use, cmpv, xchg); local 82 if (prev == cmpv) 84 *cmp = prev;
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | unlink.c | 26 struct ext2_dir_entry *prev; member in struct:link_struct 40 struct ext2_dir_entry *prev; local 42 prev = ls->prev; 43 ls->prev = dirent; 60 prev->rec_len += dirent->rec_len; 90 ls.prev = 0;
|
/external/libvpx/libvpx/third_party/nestegg/halloc/src/ |
H A D | hlist.h | 38 hlist_item_t ** prev; member in struct:hlist_item 95 i->prev = &i->next; 105 next->prev = &i->next; 107 i->prev = &h->next; 116 next->prev = i->prev; 117 *i->prev = next; 125 *i->prev = i; 126 i->next->prev = &i->next; 132 h->next->prev [all...] |
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_slab.h | 49 struct util_slab_page *prev, *next; member in struct:util_slab_page
|
/external/mesa3d/src/gallium/drivers/rbug/ |
H A D | rbug_screen.h | 38 struct rbug_list *prev; member in struct:rbug_list
|