/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/swiftshader/third_party/LLVM/lib/Target/Alpha/ |
H A D | AlphaLLRP.cpp | 51 MachineInstr* prev[3] = {0,0,0}; local 60 prev[0] = prev[1] = prev[2] = 0; //Slots cleared at fetch boundary 71 if (prev[0] && 72 prev[0]->getOperand(2).getReg() == MI->getOperand(2).getReg()&& 73 prev[0]->getOperand(1).getImm() == MI->getOperand(1).getImm()){ 74 prev[0] = prev[1]; 75 prev[ [all...] |
/external/ltp/utils/ffsb-6.0-rc2/ |
H A D | list.c | 12 list->prev = list; 16 struct list_head *prev, struct list_head *next) 18 next->prev = new; 20 new->prev = prev; 21 prev->next = new; 24 void __list_del(struct list_head *prev, struct list_head *next) argument 26 next->prev = prev; 27 prev 15 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument [all...] |
H A D | cirlist.c | 43 cl->head->prev = cl->head; 48 assert(cl->head->prev == cl->head); 50 cl->head->prev = new; 52 new->prev = cl->head; 55 assert(cl->head->prev != cl->head); 58 new->prev = (cl->head)->prev; 59 cl->head->prev->next = new; 60 cl->head->prev = new; 78 assert(cl->head->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/libdrm/ |
H A D | 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 [all...] |
H A D | util_double_list.h | 43 struct list_head *prev; member in struct:list_head 49 item->prev = item; 55 item->prev = list; 57 list->next->prev = item; 64 item->prev = list->prev; 65 list->prev->next = item; 66 list->prev = item; 71 to->prev = from->prev; [all...] |
/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/python/cpython2/Lib/test/crashers/ |
H A D | borrowed_ref_1.py | 26 prev = None variable 29 prev = (prev,) variable in class:D
|
/external/syslinux/gpxe/src/include/gpxe/ |
H A D | list.h | 22 * sometimes we already know the next/prev entries and we can 29 struct list_head *prev; member in struct:list_head 38 (ptr)->next = (ptr); (ptr)->prev = (ptr); \ 45 * the prev/next entries already! 48 struct list_head *prev, 50 next->prev = new; 52 new->prev = prev; 53 prev->next = new; 69 assert ( (head)->next->prev 47 __list_add( struct list_head *new, struct list_head *prev, struct list_head *next ) argument 100 __list_del( struct list_head * prev, struct list_head * next ) argument [all...] |
/external/adhd/cras/src/common/ |
H A D | utlist.h | 39 * To use doubly-linked lists, your structure must "prev" and "next" pointers. 45 * struct item *prev, *next; 147 (add)->prev = (head)->prev; \ 148 (head)->prev = (add); \ 150 (add)->prev = (add); \ 157 (add)->prev = (head)->prev; \ 158 (head)->prev->next = (add); \ 159 (head)->prev [all...] |
/external/selinux/python/sepolicy/ |
H A D | sepolicy-bash-completion.sh | 65 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]} 100 if [ "$prev" = "-P" -o "$prev" = "--policy" ]; then 108 if [ "$prev" = "-b" -o "$prev" = "--boolean" ]; then 115 if [ "$prev" = "-s" -o "$prev" = "--source" -o "$prev" = "-t" -o "$prev" = "--target" ]; then 118 elif [ "$prev" [all...] |
/external/mesa3d/src/util/ |
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; \ 69 (elem)->prev = list; \ 71 (list)->next->prev = elem; \ 84 (elem)->prev = (list)->prev; \ 85 (list)->prev->next = elem; \ 86 (list)->prev [all...] |
H A D | list.h | 48 struct list_head *prev; member in struct:list_head 54 item->prev = item; 60 item->prev = list; 62 list->next->prev = item; 69 item->prev = list->prev; 70 list->prev->next = item; 71 list->prev = item; 81 to->prev = from->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/fio/ |
H A D | 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, hea 46 __flist_add(struct flist_head *new_entry, struct flist_head *prev, struct flist_head *next) argument 83 __flist_del(struct flist_head *prev, struct flist_head * next) argument 122 __flist_splice(const struct flist_head *list, struct flist_head *prev, struct flist_head *next) argument [all...] |
/external/libcxx/test/std/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/selinux/policycoreutils/setsebool/ |
H A D | setsebool-bash-completion.sh | 30 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]} 33 if [ "$verb" = "" -a "$prev" = "setsebool" -o "$prev" = "-P" ]; then 43 local cur=${COMP_WORDS[COMP_CWORD]} prev=${COMP_WORDS[COMP_CWORD-1]} 46 if [ "$verb" = "" -a "$prev" == "getsebool" ]; then 50 if [ "$verb" = "" -a "$prev" != "-a" ]; then
|
/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/syslinux/core/thread/ |
H A D | exit_thread.c | 14 curr->list.prev->next = curr->list.next; 15 curr->list.next->prev = curr->list.prev;
|
/external/libopus/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;
|