/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/libunwind/src/mi/ |
H A D | dyn-cancel.c | 35 if (di->prev) 36 di->prev->next = di->next; 41 di->next->prev = di->prev; 45 di->next = di->prev = NULL;
|
/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/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 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, hea 34 __list_add(struct list_head * new, struct list_head * prev, struct list_head * next) argument 67 __list_del(struct list_head * prev, struct list_head * next) argument [all...] |
/external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/ |
H A D | list.h | 18 begin->prev->next = end->next; 19 end->next->prev = begin->prev;
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | InsnList.java | 228 next.prev = insn;
232 AbstractInsnNode prev = location.prev;
233 insn.prev = prev;
234 if (prev != null) {
235 prev.next = insn;
247 location.prev = null;
269 insn.prev = last;
297 elem.prev 567 AbstractInsnNode prev; field in class:InsnList.InsnListIterator [all...] |
/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 31 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 38 * the prev/next entries already! 41 struct list_head * prev, 44 next->prev = add; 46 add->prev = prev; 47 prev->next = add; 73 __list_add(add, head->prev, hea 40 __list_add(struct list_head * add, struct list_head * prev, struct list_head * next) argument 83 __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/libcxx/test/algorithms/alg.sorting/alg.permutation.generators/ |
H A D | next_permutation.pass.cpp | 39 int prev[sa]; local 46 std::copy(ia, ia+e, prev); 51 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e)); 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e));
|
H A D | next_permutation_comp.pass.cpp | 41 int prev[sa]; local 48 std::copy(ia, ia+e, prev); 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C())); 55 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C()));
|
H A D | prev_permutation.pass.cpp | 39 int prev[sa]; local 46 std::copy(ia, ia+e, prev); 51 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e)); 53 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e));
|
H A D | prev_permutation_comp.pass.cpp | 41 int prev[sa]; local 48 std::copy(ia, ia+e, prev); 53 assert(std::lexicographical_compare(ia, ia+e, prev, prev+e, C())); 55 assert(std::lexicographical_compare(prev, prev+e, ia, ia+e, C()));
|
/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/opus/src/src/ |
H A D | opus_multistream.c | 57 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev) argument 60 i = (prev<0) ? 0 : prev+1; 69 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev) argument 72 i = (prev<0) ? 0 : prev+1; 81 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev) argument 84 i = (prev<0) ? 0 : prev+1;
|
/external/chromium_org/third_party/skia/samplecode/ |
H A D | TransitionView.h | 13 SkView* create_transition(SkView* prev, SkView* next, int direction);
|