Searched refs:prev (Results 26 - 50 of 1447) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/skia/src/core/
H A DSkAutoKern.h15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
H A DSkLazyFnPtr.h54 F prev = (F)sk_atomic_cas(&fPtr, NULL, (void*)fn); local
56 // If prev != NULL, someone snuck in and set fPtr concurrently.
57 // If prev == NULL, we did write fn to fPtr.
58 return prev != NULL ? prev : fn;
/external/libopus/src/
H A Dopus_multistream.c57 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;
/external/skia/samplecode/
H A DTransitionView.h13 SkView* create_transition(SkView* prev, SkView* next, int direction);
/external/skia/src/core/
H A DSkAutoKern.h15 #define SkAutoKern_AdjustF(prev, next) (((next) - (prev) + 32) >> 6 << 16)
16 #define SkAutoKern_AdjustS(prev, next) SkIntToScalar(((next) - (prev) + 32) >> 6)
H A DSkLazyFnPtr.h54 F prev = (F)sk_atomic_cas(&fPtr, NULL, (void*)fn); local
56 // If prev != NULL, someone snuck in and set fPtr concurrently.
57 // If prev == NULL, we did write fn to fPtr.
58 return prev != NULL ? prev : fn;
/external/blktrace/btt/
H A Dlist.h35 struct list_head *next, *prev; member in struct:list_head
46 list->prev = list;
53 * the prev/next entries already!
56 struct list_head *prev,
59 next->prev = new;
61 new->prev = prev;
62 prev->next = new;
88 __list_add(new, head->prev, head);
92 * Delete a list entry by making the prev/nex
55 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
98 __list_del(struct list_head * prev, struct list_head * next) argument
[all...]
/external/f2fs-tools/include/
H A Dlist.h14 struct list_head *next, *prev; member in struct:list_head
25 list->prev = list;
29 struct list_head *prev,
32 next->prev = new;
34 new->prev = prev;
35 prev->next = new;
45 __list_add(new, head->prev, head);
48 static inline void __list_del(struct list_head * prev, struct list_head * next) argument
50 next->prev
28 __list_add(struct list_head *new, struct list_head *prev, struct list_head *next) argument
[all...]
/external/fio/
H A Dflist.h22 * 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/bison/build-aux/
H A DMakefile.am19 prev-version.txt \
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i915/
H A Dintel_resolve_map.c42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
H A Dintel_resolve_map.c42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.c42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
/external/libunwind/src/mi/
H A Ddyn-register.c38 di->prev = NULL;
40 di->next->prev = di;
/external/mesa3d/src/mesa/drivers/dri/i915/
H A Dintel_resolve_map.c42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
/external/mesa3d/src/mesa/drivers/dri/i965/
H A Dintel_resolve_map.c42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
/external/mesa3d/src/mesa/drivers/dri/intel/
H A Dintel_resolve_map.c42 struct intel_resolve_map *prev = head; local
49 prev = *tail;
54 (*tail)->prev = prev;
88 if (elem->prev)
89 elem->prev->next = elem->next;
91 elem->next->prev = elem->prev;
/external/pdfium/core/src/fxge/agg/agg23/
H A Dagg_shorten_path.h42 vertex_type& prev = vs[n - 1]; local
44 d = (prev.dist - s) / prev.dist;
45 FX_FLOAT x = prev.x + (last.x - prev.x) * d;
46 FX_FLOAT y = prev.y + (last.y - prev.y) * d;
49 if(!prev(last)) {
/external/libnl/include/netlink/
H A Dlist.h18 struct nl_list_head * prev; member in struct:nl_list_head
24 list->prev = list;
28 struct nl_list_head *prev,
31 prev->next = obj;
32 obj->prev = prev;
33 next->prev = obj;
40 __nl_list_add(obj, head->prev, head);
51 obj->next->prev = obj->prev;
27 __nl_list_add(struct nl_list_head *obj, struct nl_list_head *prev, struct nl_list_head *next) argument
[all...]
/external/chromium_org/net/disk_cache/memory/
H A Dmem_rankings.cc29 MemEntryImpl* prev = node->prev(); local
36 tail_ = prev;
38 if (prev)
39 prev->set_next(next);
42 next->set_prev(prev);
64 return node->prev();
/external/chromium_org/chrome/browser/resources/cryptotoken/
H A Drequestqueue.js36 this.prev = null;
81 token.prev = this.tail_;
93 token.next.prev = token.prev;
95 if (token.prev) {
96 token.prev.next = token.next;
103 this.head_.prev = null;
106 this.tail_ = token.prev;
110 token.prev = token.next = null;
/external/chromium_org/third_party/boringssl/src/crypto/x509v3/
H A Dtabtest.c72 int i, prev = -1, bad = 0; local
80 if((*tmp)->ext_nid < prev) bad = 1;
81 prev = (*tmp)->ext_nid;
/external/okhttp/okio/src/main/java/okio/
H A DSegment.java46 Segment prev; field in class:Segment
54 prev.next = next;
55 next.prev = prev;
57 prev = null;
66 segment.prev = this;
68 next.prev = segment;
93 prev.push(before);
111 if (prev == this) throw new IllegalStateException();
112 if ((prev
[all...]
/external/openssl/crypto/x509v3/
H A Dtabtest.c71 int i, prev = -1, bad = 0; local
78 if((*tmp)->ext_nid < prev) bad = 1;
79 prev = (*tmp)->ext_nid;
/external/qemu/util/
H A Dqemu-error.c66 assert(!loc->prev);
67 loc->prev = cur_loc;
81 loc->prev = NULL;
91 assert(cur_loc == loc && loc->prev);
92 cur_loc = loc->prev;
93 loc->prev = NULL;
103 loc->prev = NULL;
112 Location *prev = cur_loc->prev; local
113 assert(!loc->prev);
[all...]

Completed in 1819 milliseconds

1234567891011>>