| /external/ltp/utils/ffsb-6.0-rc2/ |
| 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)
26 next->prev = prev;
27 prev->next = next
[all...] |
| /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...] |
| /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/google/marlin/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/swiftshader/third_party/LLVM/lib/Target/Alpha/ |
| 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[1] = prev[2]
[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; \
|
| /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...] |
| 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/ |
| 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...] |
| /device/google/contexthub/firmware/os/inc/ |
| list.h | 24 struct link_t *prev, *next; member in struct:link_t
34 link_t list = { .prev = &list, .next = &list }
38 list->prev = list->next = list;
46 item->prev = list->prev;
48 list->prev->next = item;
49 list->prev = item;
54 item->prev->next = item->next;
55 item->next->prev = item->prev;
[all...] |
| /external/adhd/cras/src/common/ |
| 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 = (add);
[all...] |
| /external/selinux/python/sepolicy/ |
| 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" = "-c" -o "$prev" = "--class" ]; the
[all...] |
| /external/mesa3d/src/util/ |
| 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 = elem;
[all...] |
| /external/skia/src/core/ |
| SkScanPriv.h | 61 EdgeType* prev = edge->fPrev; local
62 while (prev->fPrev && prev->fX > x) {
63 prev = prev->fPrev;
65 if (prev->fNext != edge) {
67 insert_edge_after(edge, prev);
76 static EdgeType* backward_insert_start(EdgeType* prev, SkFixed x) {
77 while (prev->fPrev && prev->fX > x)
[all...] |
| /external/skqp/src/core/ |
| SkScanPriv.h | 61 EdgeType* prev = edge->fPrev; local
62 while (prev->fPrev && prev->fX > x) {
63 prev = prev->fPrev;
65 if (prev->fNext != edge) {
67 insert_edge_after(edge, prev);
76 static EdgeType* backward_insert_start(EdgeType* prev, SkFixed x) {
77 while (prev->fPrev && prev->fX > x)
[all...] |
| /external/u-boot/scripts/kconfig/ |
| list.h | 25 struct list_head *next, *prev; member in struct:list_head
80 * the prev/next entries already!
83 struct list_head *prev,
86 next->prev = _new;
88 _new->prev = prev;
89 prev->next = _new;
102 __list_add(_new, head->prev, head);
106 * Delete a list entry by making the prev/next entries
110 * the prev/next entries already
[all...] |
| /external/e2fsprogs/lib/blkid/ |
| list.h | 27 * sometimes we already know the next/prev entries and we can
33 struct list_head *next, *prev; member in struct:list_head
39 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
46 * the prev/next entries already!
49 struct list_head * prev,
52 next->prev = add;
54 add->prev = prev;
55 prev->next = add;
81 __list_add(add, head->prev, head)
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.permutation.generators/ |
| 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));
|
| 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()));
|
| 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));
|
| 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/ |
| 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
|
