/external/bzip2/ |
H A D | format.pl | 43 my ($prev, $curr, $str); 44 $prev = ''; $curr = ''; 47 print OUTFILE $prev; 48 $prev = $curr; 52 if ( $prev =~ /<programlisting>$|<screen>$/ ) { 53 chomp $prev; 54 $curr = join( '', $prev, "<![CDATA[", $curr ); 55 $prev = ''; 59 chomp $prev; 60 $curr = join( '', $prev, "]]>", [all...] |
/external/qemu/android/utils/ |
H A D | list.h | 32 ACList* prev; member in struct:ACList 39 list->next = list->prev = list; 55 entry->prev = list; 56 next->prev = entry; 63 ACList* const prev = list->prev; local 65 entry->prev = prev; 66 prev->next = entry; 67 list->prev 76 ACList* const prev = entry->prev; local [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/libusb-compat/libusb/ |
H A D | usbi.h | 29 ent->next->prev = ent; \ 32 ent->prev = NULL; \ 38 if (ent->prev) \ 39 ent->prev->next = ent->next; \ 43 ent->next->prev = ent->prev; \ 44 ent->prev = NULL; \
|
/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
H A D | ptw32_tkAssocDestroy.c | 65 ThreadKeyAssoc * prev, * next; local 68 prev = assoc->prevKey; 70 if (prev != NULL) 72 prev->nextKey = next; 76 next->prevKey = prev; 94 prev = assoc->prevThread; 96 if (prev != NULL) 98 prev->nextThread = next; 102 next->prevThread = prev;
|
/external/e2fsprogs/lib/ext2fs/ |
H A D | 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 24 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 35 * the prev/next entries already! 38 struct list_head * prev, 41 next->prev = new; 43 new->prev = prev; 44 prev->next = new; 60 __list_add(new, head->prev, hea 37 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument 70 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/linux-tools-perf/util/include/linux/ |
H A D | list.h | 26 begin->prev->next = end->next; 27 end->next->prev = begin->prev;
|
/external/kernel-headers/original/asm-generic/ |
H A D | mutex-xchg.h | 95 int prev = atomic_xchg(count, 0); local 97 if (unlikely(prev < 0)) { 100 * state. If while doing so we get back a prev value of 1 109 prev = atomic_xchg(count, prev); 110 if (prev < 0) 111 prev = 0; 115 return prev;
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \ 48 (elem)->prev->next = (elem)->next; \ 50 (elem)->prev = elem; \ 61 (elem)->prev = list; \ 63 (list)->next->prev = elem; \ 76 (elem)->prev = (list)->prev; \ 77 (list)->prev->next = elem; \ 78 (list)->prev [all...] |
H A D | u_double_list.h | 47 struct list_head *prev; member in struct:list_head 53 item->prev = item; 59 item->prev = list; 61 list->next->prev = item; 68 item->prev = list->prev; 69 list->prev->next = item; 70 list->prev = item; 75 to->prev = from->prev; [all...] |
/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/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_simple_list.h | 47 (elem)->next->prev = (elem)->prev; \ 48 (elem)->prev->next = (elem)->next; \ 50 (elem)->prev = elem; \ 61 (elem)->prev = list; \ 63 (list)->next->prev = elem; \ 76 (elem)->prev = (list)->prev; \ 77 (list)->prev->next = elem; \ 78 (list)->prev [all...] |
H A D | u_double_list.h | 47 struct list_head *prev; member in struct:list_head 53 item->prev = item; 59 item->prev = list; 61 list->next->prev = item; 68 item->prev = list->prev; 69 list->prev->next = item; 70 list->prev = item; 75 to->prev = from->prev; [all...] |
/external/mesa3d/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/e2fsprogs/lib/blkid/ |
H A D | list.h | 19 * sometimes we already know the next/prev entries and we can 25 struct list_head *next, *prev; member in struct:list_head 34 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 41 * the prev/next entries already! 44 struct list_head * prev, 47 next->prev = add; 49 add->prev = prev; 50 prev->next = add; 76 __list_add(add, head->prev, hea 43 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument 86 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/oprofile/libutil/ |
H A D | op_list.h | 19 * sometimes we already know the next/prev entries and we can 25 struct list_head * next, * prev; member in struct:list_head 37 ptr->prev = ptr; 44 * the prev/next entries already! 47 struct list_head * prev, 50 next->prev = new_entry; 52 new_entry->prev = prev; 53 prev->next = new_entry; 79 __list_add(new_entry, head->prev, hea 46 __list_add(struct list_head * new_entry, struct list_head * prev, struct list_head * next) argument 89 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
H A D | nouveau_heap.c | 77 heap->next->prev = r; 78 r->prev = heap; 106 new->prev = r->prev; 107 if (r->prev) 108 r->prev->next = new; 116 if (r->prev && !r->prev->in_use) { 117 r->prev->next = r->next; 119 r->next->prev [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/ |
H A D | nouveau_heap.c | 77 heap->next->prev = r; 78 r->prev = heap; 106 new->prev = r->prev; 107 if (r->prev) 108 r->prev->next = new; 116 if (r->prev && !r->prev->in_use) { 117 r->prev->next = r->next; 119 r->next->prev [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16) 16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
/external/skia/src/core/ |
H A D | SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16) 16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
/external/blktrace/btt/ |
H A D | 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/nex 55 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument 98 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/bison/build-aux/ |
H A D | Makefile.am | 19 prev-version.txt \
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/ |
H A D | intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local 49 prev = *tail; 54 (*tail)->prev = prev; 88 if (elem->prev) 89 elem->prev->next = elem->next; 91 elem->next->prev = elem->prev;
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
H A D | intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local 49 prev = *tail; 54 (*tail)->prev = prev; 88 if (elem->prev) 89 elem->prev->next = elem->next; 91 elem->next->prev = elem->prev;
|
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/ |
H A D | intel_resolve_map.c | 42 struct intel_resolve_map *prev = head; local 49 prev = *tail; 54 (*tail)->prev = prev; 88 if (elem->prev) 89 elem->prev->next = elem->next; 91 elem->next->prev = elem->prev;
|