/external/pdfium/core/src/fxcodec/jbig2/ |
JBig2_ArithIntDecoder.cpp | 19 int PREV, V;
22 PREV = 1;
23 S = pArithDecoder->DECODE(IAx + PREV);
24 PREV = (PREV << 1) | S;
25 D = pArithDecoder->DECODE(IAx + PREV);
26 PREV = (PREV << 1) | D;
28 D = pArithDecoder->DECODE(IAx + PREV);
29 PREV = (PREV << 1) | D; [all...] |
/hardware/intel/common/libwsbm/src/ |
wsbm_util.h | 17 struct _WsbmListHead *prev; member in struct:_WsbmListHead 23 (__item)->prev = (__item); \ 29 (__item)->prev = (__list); \ 31 (__list)->next->prev = (__item); \ 38 (__item)->prev = (__list)->prev; \ 39 (__list)->prev->next = (__item); \ 40 (__list)->prev = (__item); \ 45 (__item)->prev->next = (__item)->next; \ 46 (__item)->next->prev = (__item)->prev; [all...] |
/external/e2fsprogs/lib/ext2fs/ |
kernel-list.h | 9 * sometimes we already know the next/prev entries and we can 15 struct list_head *next, *prev; member in struct:list_head 21 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 32 * the prev/next entries already! 35 struct list_head * prev, 38 next->prev = new; 40 new->prev = prev; 41 prev->next = new; 57 __list_add(new, head->prev, head) [all...] |
/device/asus/flo/camera/QCamera2/stack/common/ |
cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list 49 ptr->prev = ptr; 55 struct cam_list *prev = head->prev; local 57 head->prev = item; 59 item->prev = prev; 60 prev->next = item; 67 item->prev = node->prev; 74 struct cam_list *prev = ptr->prev; local [all...] |
/device/lge/hammerhead/camera/QCamera2/stack/common/ |
cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list 49 ptr->prev = ptr; 55 struct cam_list *prev = head->prev; local 57 head->prev = item; 59 item->prev = prev; 60 prev->next = item; 67 item->prev = node->prev; 74 struct cam_list *prev = ptr->prev; local [all...] |
/device/moto/shamu/camera/QCamera2/stack/common/ |
cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list 49 ptr->prev = ptr; 55 struct cam_list *prev = head->prev; local 57 head->prev = item; 59 item->prev = prev; 60 prev->next = item; 67 item->prev = node->prev; 74 struct cam_list *prev = ptr->prev; local [all...] |
/hardware/intel/img/libdrm/libdrm/ |
libdrm_lists.h | 36 struct _drmMMListHead *prev; member in struct:_drmMMListHead 42 (__item)->prev = (__item); \ 48 (__item)->prev = (__list); \ 50 (__list)->next->prev = (__item); \ 57 (__item)->prev = (__list)->prev; \ 58 (__list)->prev->next = (__item); \ 59 (__list)->prev = (__item); \ 64 (__item)->prev->next = (__item)->next; \ 65 (__item)->next->prev = (__item)->prev; [all...] |
/bionic/libc/private/ |
bionic_atomic_mips.h | 37 int32_t prev, status; local 39 " ll %[prev], 0(%[ptr]) \n" 40 " bne %[old_value], %[prev], 2f \n" 44 : [prev]"=&r"(prev), [status]"=&r"(status), "+m"(*ptr) 47 return prev != old_value; 52 int32_t prev, status; local 54 " ll %[prev], 0(%[ptr]) \n" 57 : [prev]"=&r"(prev), [status]"=&r"(status), "+m"(*ptr 65 int32_t prev, status; local [all...] |
/system/core/include/cutils/ |
atomic-mips.h | 75 int32_t prev, status; local 78 " ll %[prev], (%[ptr])\n" 80 " bne %[prev], %[old], 9f\n" 84 : [prev] "=&r" (prev), [status] "=&r" (status) 88 return prev != old_value; 114 int32_t prev, status; local 118 " ll %[prev], (%[ptr])\n" 119 " addu %[status], %[prev], %[inc]\n" 121 : [status] "=&r" (status), [prev] "=&r" (prev 143 int32_t prev, status; local 160 int32_t prev, status; local [all...] |
atomic-mips64.h | 68 int32_t prev, status; local 71 " ll %[prev], (%[ptr])\n" 73 " bne %[prev], %[old], 9f\n" 77 : [prev] "=&r" (prev), [status] "=&r" (status) 81 return prev != old_value; 106 int32_t prev, status; local 110 " ll %[prev], (%[ptr])\n" 111 " addu %[status], %[prev], %[inc]\n" 113 : [status] "=&r" (status), [prev] "=&r" (prev 135 int32_t prev, status; local 152 int32_t prev, status; local [all...] |
list.h | 29 struct listnode *prev; member in struct:listnode 38 .prev = &name, \ 45 for (node = (list)->prev; node != (list); node = node->prev) 55 node->prev = node; 61 item->prev = head->prev; 62 head->prev->next = item; 63 head->prev = item; 69 item->prev = head [all...] |
atomic-x86.h | 75 int32_t prev; local 77 : "=a" (prev) 80 return prev != old_value; 126 int32_t prev, status; local 128 prev = *ptr; 129 status = android_atomic_cas(prev, prev & value, ptr); 131 return prev; 137 int32_t prev, status; local 139 prev = *ptr [all...] |
/external/qemu/android/utils/ |
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 = entry 80 ACList* const prev = entry->prev; local [all...] |
/external/f2fs-tools/include/ |
list.h | 14 struct list_head *next, *prev; member in struct:list_head 25 list->prev = list; 29 struct list_head *prev, 32 next->prev = new; 34 new->prev = prev; 35 prev->next = new; 45 __list_add(new, head->prev, head); 48 static inline void __list_del(struct list_head * prev, struct list_head * next) 50 next->prev = prev [all...] |
/hardware/intel/common/wrs_omxil_core/utils/src/ |
list.c | 26 entry->prev = NULL; 79 while (list->prev) 80 list = list->prev; 113 struct list *prev; local 116 prev = entry->prev; 117 if (prev) 118 prev->next = new; 119 new->prev = prev; 195 struct list *prev, *next; local [all...] |
/device/lge/mako/camera/QCamera/stack/common/ |
cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list 49 ptr->prev = ptr; 55 struct cam_list *prev = head->prev; local 57 head->prev = item; 59 item->prev = prev; 60 prev->next = item; 65 struct cam_list *prev = ptr->prev; local [all...] |
/device/moto/shamu/camera/QCamera/stack/common/ |
cam_list.h | 43 struct cam_list *next, *prev; member in struct:cam_list 49 ptr->prev = ptr; 55 struct cam_list *prev = head->prev; local 57 head->prev = item; 59 item->prev = prev; 60 prev->next = item; 65 struct cam_list *prev = ptr->prev; local [all...] |
/external/libnl/include/netlink/ |
list.h | 18 struct nl_list_head * prev; member in struct:nl_list_head 24 list->prev = list; 28 struct nl_list_head *prev, 31 prev->next = obj; 32 obj->prev = prev; 33 next->prev = obj; 40 __nl_list_add(obj, head->prev, head); 51 obj->next->prev = obj->prev; [all...] |
/external/chromium_org/net/disk_cache/memory/ |
mem_rankings.cc | 29 MemEntryImpl* prev = node->prev(); local 36 tail_ = prev; 38 if (prev) 39 prev->set_next(next); 42 next->set_prev(prev); 64 return node->prev();
|
/external/wpa_supplicant_8/src/utils/ |
list.h | 17 struct dl_list *prev; member in struct:dl_list 23 list->prev = list; 29 item->prev = list; 30 list->next->prev = item; 36 dl_list_add(list->prev, item); 41 item->next->prev = item->prev; 42 item->prev->next = item->next; 44 item->prev = NULL; 74 dl_list_entry((list)->prev, type, member) [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
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->next = (_e)->next; [all...] |
/external/blktrace/btt/ |
list.h | 35 struct list_head *next, *prev; member in struct:list_head 46 list->prev = list; 53 * the prev/next entries already! 56 struct list_head *prev, 59 next->prev = new; 61 new->prev = prev; 62 prev->next = new; 88 __list_add(new, head->prev, head); 92 * Delete a list entry by making the prev/next entrie [all...] |
/external/chromium_org/third_party/skia/src/views/ |
SkTagList.cpp | 34 SkTagList* prev = NULL; 42 if (prev) 43 prev->fNext = next; 49 prev = rec;
|
/external/fio/ |
flist.h | 22 * sometimes we already know the next/prev entries and we can 28 struct flist_head *next, *prev; member in struct:flist_head 37 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 44 * the prev/next entries already! 47 struct flist_head *prev, 50 next->prev = new_entry; 52 new_entry->prev = prev; 53 prev->next = new_entry; 73 __flist_add(new_entry, head->prev, head) [all...] |
/external/skia/src/views/ |
SkTagList.cpp | 34 SkTagList* prev = NULL; 42 if (prev) 43 prev->fNext = next; 49 prev = rec;
|