HomeSort by relevance Sort by last modified time
    Searched refs:prev (Results 1 - 25 of 1211) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/bzip2/
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, "]]>", $curr )
    [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...]
  /bionic/libc/arch-arm/bionic/
atomics_arm.c 70 int prev; local
72 prev = *ptr;
73 } while (__sync_val_compare_and_swap(ptr, prev, _new) != prev);
74 return prev;
  /external/libunwind/src/mi/
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;
  /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...]
bionic_atomic_arm.h 33 int32_t prev, status; local
43 : "=&r" (prev), "=&r" (status), "+m"(*ptr)
47 return prev != old_value;
52 int32_t prev, status; local
57 : "=&r" (prev), "=&r" (status), "+m" (*ptr)
61 return prev;
66 int32_t prev, tmp, status; local
72 : "=&r" (prev), "=&r" (tmp), "=&r" (status), "+m"(*ptr)
76 return prev;
bionic_atomic_arm64.h 46 int32_t prev, status; local
52 : "=&r" (prev), "=&r" (status), "+o" (*ptr)
55 return prev;
60 int32_t prev, tmp, status; local
66 : "=&r" (prev), "=&r" (tmp), "=&r" (status), "+m"(*ptr)
69 return prev;
  /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...]
  /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/libusb-compat/libusb/
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/
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/
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...]
  /external/linux-tools-perf/perf-3.12.0/tools/perf/util/include/linux/
list.h 18 begin->prev->next = end->next;
19 end->next->prev = begin->prev;
  /external/mockito/cglib-and-asm/src/org/mockito/asm/tree/
InsnList.java 228 next.prev = insn;
232 AbstractInsnNode prev = location.prev; local
233 insn.prev = prev;
234 if (prev != null) {
235 prev.next = insn;
247 location.prev = null;
269 insn.prev = last;
297 elem.prev = last;
435 AbstractInsnNode prev = location.prev; local
468 AbstractInsnNode prev = location .prev; local
496 AbstractInsnNode prev = insn.prev; local
567 AbstractInsnNode prev; field in class:InsnList.InsnListIterator
    [all...]
  /development/ndk/platforms/android-3/include/sys/
atomics.h 59 int prev; local
61 prev = *ptr;
62 } while (__sync_val_compare_and_swap(ptr, prev, _new) != prev);
63 return prev;
  /development/ndk/platforms/android-9/arch-mips/include/asm/
system.h 32 #define __mips_mt_fpaff_switch_to(prev) do { (void) (prev); } while (0)
34 #define switch_to(prev, next, last) do { __mips_mt_fpaff_switch_to(prev); if (cpu_has_dsp) __save_dsp(prev); (last) = resume(prev, next, task_thread_info(next)); } while (0)
35 #define finish_arch_switch(prev) do { if (cpu_has_dsp) __restore_dsp(current); if (cpu_has_userlocal) write_c0_userlocal(current_thread_info()->tp_value); } while (0)
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
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 = elem;
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
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 = elem;
    [all...]
  /external/mesa3d/src/gallium/auxiliary/util/
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 = elem;
    [all...]
  /external/mesa3d/src/mesa/main/
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 = elem;
    [all...]
  /external/e2fsprogs/lib/blkid/
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, head)
    [all...]
  /external/oprofile/libutil/
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, head)
    [all...]

Completed in 1478 milliseconds

1 2 3 4 5 6 7 8 91011>>