| /external/chromium_org/third_party/freetype/src/cache/ |
| ftcmru.c | 37 FTC_MruNode last = first->prev;
58 first->prev = node;
61 node->prev = last;
66 node->prev = node;
83 FTC_MruNode prev, next, last; local
102 prev = node->prev;
105 prev->next = next;
106 next->prev = prev;
126 FTC_MruNode prev, next; local
[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/freetype/src/cache/ |
| ftcmru.c | 37 FTC_MruNode last = first->prev;
58 first->prev = node;
61 node->prev = last;
66 node->prev = node;
83 FTC_MruNode prev, next, last; local
102 prev = node->prev;
105 prev->next = next;
106 next->prev = prev;
126 FTC_MruNode prev, next; local
[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...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/ |
| 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...] |
| 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...] |
| /external/llvm/include/llvm/ADT/ |
| ilist_node.h | 23 /// ilist_half_node - Base class that provides prev services for sentinels.
28 NodeTy *Prev;
30 NodeTy *getPrev() { return Prev; }
31 const NodeTy *getPrev() const { return Prev; }
32 void setPrev(NodeTy *P) { Prev = P; }
33 ilist_half_node() : Prev(nullptr) {}
39 /// ilist_node - Base class that provides next/prev services for nodes
59 NodeTy *Prev = this->getPrev();
62 if (!Prev->getNext())
65 return Prev;
[all...] |
| /system/core/include/cutils/ |
| atomic-x86_64.h | 83 int32_t prev; local
85 : "=a" (prev)
88 return prev != old_value;
132 int32_t prev, status; local
134 prev = *ptr;
135 status = android_atomic_cas(prev, prev & value, ptr);
137 return prev;
143 int32_t prev, status; local
145 prev = *ptr
[all...] |
| atomic-arm.h | 73 int32_t prev, status; local
82 : "=&r" (prev), "=&r" (status), "+m"(*ptr)
86 return prev != old_value;
109 int32_t prev, tmp, status; local
115 : "=&r" (prev), "=&r" (tmp),
120 return prev;
136 int32_t prev, tmp, status; local
142 : "=&r" (prev), "=&r" (tmp),
147 return prev;
153 int32_t prev, tmp, status local
[all...] |
| /bionic/libc/private/ |
| 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;
|
| /external/chromium_org/third_party/opus/src/src/ |
| opus_multistream.c | 57 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev)
60 i = (prev<0) ? 0 : prev+1;
69 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev)
72 i = (prev<0) ? 0 : prev+1;
81 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev)
84 i = (prev<0) ? 0 : prev+1;
|
| /external/libopus/src/ |
| opus_multistream.c | 57 int get_left_channel(const ChannelLayout *layout, int stream_id, int prev)
60 i = (prev<0) ? 0 : prev+1;
69 int get_right_channel(const ChannelLayout *layout, int stream_id, int prev)
72 i = (prev<0) ? 0 : prev+1;
81 int get_mono_channel(const ChannelLayout *layout, int stream_id, int prev)
84 i = (prev<0) ? 0 : prev+1;
|
| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL)
[all...] |
| /external/chromium_org/third_party/icu/source/i18n/ |
| bocsu.c | 112 * code points. Lexical order is preserved if "prev" is always moved
115 * Additionally, "prev" is moved from anywhere in the Unihan
123 int32_t c, prev; local
126 prev=0;
130 if(prev<0x4e00 || prev>=0xa000) {
131 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1;
137 prev=0x9fff-SLOPE_REACH_POS_2;
141 p=u_writeDiff(c-prev, p)
167 int32_t c, prev; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nouveau/ |
| 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 = r->prev
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| GroupedLinkedMap.java | 50 LinkedEntry<K, V> last = head.prev;
66 last = last.prev;
91 entry.prev = head;
99 entry.prev = head.prev;
105 entry.next.prev = entry;
106 entry.prev.next = entry;
110 entry.prev.next = entry.next;
111 entry.next.prev = entry.prev;
118 LinkedEntry<K, V> prev; field in class:GroupedLinkedMap.LinkedEntry
[all...] |
| /external/icu/icu4c/source/i18n/ |
| bocsu.cpp | 90 * code points. Lexical order is preserved if "prev" is always moved
93 * Additionally, "prev" is moved from anywhere in the Unihan
99 u_writeIdenticalLevelRun(UChar32 prev, const UChar *s, int32_t length, icu::ByteSink &sink) {
117 if(prev<0x4e00 || prev>=0xa000) {
118 prev=(prev&~0x7f)-SLOPE_REACH_NEG_1;
124 prev=0x9fff-SLOPE_REACH_POS_2;
131 prev=0;
133 p=u_writeDiff(c-prev, p)
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| 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 = r->prev
[all...] |
| /hardware/intel/img/libdrm/libdrm/nouveau/ |
| nouveau_resource.c | 68 heap->next->prev = r;
69 r->prev = heap;
97 new->prev = r->prev;
98 if (r->prev)
99 r->prev->next = new;
107 if (r->prev && !r->prev->in_use) {
108 r->prev->next = r->next;
110 r->next->prev = r->prev
[all...] |
| /external/chromium_org/v8/src/base/ |
| atomicops_internals_arm64_gcc.h | 28 Atomic32 prev; local
33 "ldxr %w[prev], %[ptr] \n\t" // Load the previous value.
34 "cmp %w[prev], %w[old_value] \n\t"
39 : [prev]"=&r" (prev),
47 return prev;
105 Atomic32 prev; local
107 prev = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
110 return prev;
116 Atomic32 prev; local
178 Atomic64 prev; local
255 Atomic64 prev; local
266 Atomic64 prev; local
[all...] |
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrMemoryPool.cpp | 81 BlockHeader* prev = block->fPrev; local
83 SkASSERT(prev);
84 prev->fNext = next;
86 next->fPrev = prev;
89 fTail = prev;
124 BlockHeader* prev = NULL; local
129 SkASSERT(prev == block->fPrev);
130 if (NULL != prev) {
131 SkASSERT(prev->fNext == block);
156 prev = block
[all...] |
| /external/skia/src/gpu/ |
| GrMemoryPool.cpp | 81 BlockHeader* prev = block->fPrev; local
83 SkASSERT(prev);
84 prev->fNext = next;
86 next->fPrev = prev;
89 fTail = prev;
124 BlockHeader* prev = NULL; local
129 SkASSERT(prev == block->fPrev);
130 if (NULL != prev) {
131 SkASSERT(prev->fNext == block);
156 prev = block
[all...] |
| /external/yaffs2/yaffs2/ |
| devextras.h | 49 * sometimes we already know the next/prev entries and we can
57 struct list_head *next, *prev; member in struct:list_head
66 (ptr)->next = (ptr); (ptr)->prev = (ptr); \
73 * the prev/next entries already!
76 struct list_head *prev,
79 next->prev = new;
81 new->prev = prev;
82 prev->next = new;
109 __list_add(new, head->prev, head)
[all...] |
| /external/chromium_org/third_party/skia/samplecode/ |
| TransitionView.h | 13 SkView* create_transition(SkView* prev, SkView* next, int direction);
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkAutoKern.h | 15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
|
