HomeSort by relevance Sort by last modified time
    Searched refs:prev (Results 1 - 25 of 2791) 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/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;
  /device/huawei/angler/camera/QCamera2/stack/common/
cam_list.h 45 struct cam_list *next, *prev; member in struct:cam_list
51 ptr->prev = ptr;
57 struct cam_list *prev = head->prev; local
59 head->prev = item;
61 item->prev = prev;
62 prev->next = item;
69 item->prev = node->prev;
76 struct cam_list *prev = ptr->prev; local
    [all...]
  /device/lge/bullhead/camera/QCamera2/stack/common/
cam_list.h 45 struct cam_list *next, *prev; member in struct:cam_list
51 ptr->prev = ptr;
57 struct cam_list *prev = head->prev; local
59 head->prev = item;
61 item->prev = prev;
62 prev->next = item;
69 item->prev = node->prev;
76 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/qcom/camera/QCamera2/stack/common/
cam_list.h 44 struct cam_list *next, *prev; member in struct:cam_list
50 ptr->prev = ptr;
56 struct cam_list *prev = head->prev; local
58 head->prev = item;
60 item->prev = prev;
61 prev->next = item;
68 item->prev = node->prev;
75 struct cam_list *prev = ptr->prev; local
    [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; \
  /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/c-ares/
ares_llist.c 28 head->prev = head;
35 node->prev = NULL;
42 return ((head->next == head) && (head->prev == head));
49 new_node->prev = old_node->prev;
50 old_node->prev->next = new_node;
51 old_node->prev = new_node;
57 node->prev->next = node->next;
58 node->next->prev = node->prev;
    [all...]
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
mb_utils.cpp 25 void PutSKIPPED_MB(uint8 *comp, uint8 *prev, int width)
34 temp0 = (int32 *)prev;
43 prev += width;
45 temp0 = (int32 *)prev;
54 prev += width;
56 temp0 = (int32 *)prev;
65 prev += width;
67 temp0 = (int32 *)prev;
75 prev += width;
86 void PutSKIPPED_B(uint8 *comp, uint8 *prev, int width
    [all...]
get_pred_outside.cpp 113 #define PAD_CORNER { temp = *prev; \
133 #define PAD_ROW { temp = *((uint32*)prev); \
134 temp2 = *((uint32*)(prev+4)); \
152 #define PAD_EXTRA_4x8 { temp = *((uint32*)(prev+8)); \
162 #define PAD_COL { temp = *prev; \
166 temp = *(prev+=16); \
170 temp = *(prev+=16); \
174 temp = *(prev+=16); \
178 temp = *(prev+=16); \
182 temp = *(prev+=16);
255 uint8 *prev; \/* pointers to adjacent pixels in the *\/ local
    [all...]
  /external/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...]
  /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...]
  /libcore/luni/src/main/java/java/util/concurrent/atomic/
AtomicIntegerFieldUpdater.java 142 int prev; local
144 prev = get(obj);
145 } while (!compareAndSet(obj, prev, newValue));
146 return prev;
157 int prev, next; local
159 prev = get(obj);
160 next = prev + 1;
161 } while (!compareAndSet(obj, prev, next));
162 return prev;
173 int prev, next local
190 int prev, next; local
206 int prev, next; local
222 int prev, next; local
239 int prev, next; local
259 int prev, next; local
279 int prev, next; local
304 int prev, next; local
329 int prev, next; local
    [all...]
  /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...]
  /system/core/include/cutils/
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...]
  /bionic/libc/include/android/
legacy_sys_atomics_inlines.h 55 int prev; local
57 prev = *ptr;
58 } while (__sync_val_compare_and_swap(ptr, prev, _new) != prev);
59 return prev;
  /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;
  /prebuilts/ndk/current/platforms/android-12/arch-arm/usr/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;
  /prebuilts/ndk/current/platforms/android-12/arch-mips/usr/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;
  /prebuilts/ndk/current/platforms/android-12/arch-x86/usr/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;
  /prebuilts/ndk/current/platforms/android-13/arch-arm/usr/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;
  /prebuilts/ndk/current/platforms/android-13/arch-mips/usr/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;

Completed in 1083 milliseconds

1 2 3 4 5 6 7 8 91011>>