| /frameworks/native/libs/binder/ |
| MemoryDealer.cpp | 63 newNode->prev = node;
66 else node->next->prev = newNode;
71 newNode->prev = node->prev;
73 if (node->prev == 0) mFirst = newNode;
74 else node->prev->next = newNode;
75 node->prev = newNode;
81 newNode->prev = newNode->next = 0;
83 newNode->prev = 0;
85 mFirst->prev = newNode
147 mutable chunk_t* prev; member in struct:android::SimpleBestFitAllocator::chunk_t
[all...] |
| /external/chromium_org/third_party/harfbuzz-ng/src/ |
| hb-ot-shape-complex-arabic.cc | 136 /* State 0: prev was U, not willing to join. */
139 /* State 1: prev was R or ISOL/ALAPH, not willing to join. */
142 /* State 2: prev was D/L in ISOL form, willing to join. */
145 /* State 3: prev was D in FINA form, willing to join. */
148 /* State 4: prev was FINA ALAPH, not willing to join. */
151 /* State 5: prev was FIN2/FIN3 ALAPH, not willing to join. */
154 /* State 6: prev was DALATH/RISH, not willing to join. */
252 unsigned int prev = (unsigned int) -1, state = 0; local
281 if (entry->prev_action != NONE && prev != (unsigned int) -1)
282 for (; prev < i; prev++
[all...] |
| /hardware/intel/img/libdrm/tests/ |
| dristat.c | 186 drmStatsT prev, curr; local
192 if (drmGetStats(fd, &prev)) return;
194 for (j = 0; j < prev.count; j++) {
196 printf(prev.data[j].long_format, prev.data[j].long_name);
197 if (prev.data[j].isvalue) printf(" 0x%08lx\n", prev.data[j].value);
198 else printf(" %10lu\n", prev.data[j].value);
204 for (j = 0; j < prev.count; j++)
205 if (!prev.data[j].verbose)
[all...] |
| /external/compiler-rt/lib/tsan/rtl/ |
| tsan_mutex.cc | 247 uptr prev = atomic_fetch_sub(&state_, kWriteLock, memory_order_release); local
248 (void)prev;
249 DCHECK_NE(prev & kWriteLock, 0);
259 uptr prev = atomic_fetch_add(&state_, kReadLock, memory_order_acquire); local
260 if ((prev & kWriteLock) == 0)
263 prev = atomic_load(&state_, memory_order_acquire);
264 if ((prev & kWriteLock) == 0) {
274 uptr prev = atomic_fetch_sub(&state_, kReadLock, memory_order_release); local
275 (void)prev;
276 DCHECK_EQ(prev & kWriteLock, 0)
[all...] |
| /hardware/qcom/display/msm8960/liboverlay/ |
| overlayMdssRot.cpp | 149 // if the prev mem is valid, we need to close
150 if(mMem.prev().valid()) {
153 // tearing when prev.close is called.
154 if(!mMem.prev().close()) {
155 ALOGE("%s error in closing prev rot mem", __FUNCTION__);
194 OVASSERT(!mMem.prev().valid(), "Prev should not be valid");
196 // ++mMem will make curr to be prev, and prev will be curr
236 ovutils::memset0(mMem.prev().mRotOffset)
[all...] |
| /hardware/qcom/display/msm8974/liboverlay/ |
| overlayMdpRot.cpp | 193 OVASSERT(!mMem.prev().valid(), "Prev should not be valid");
195 // ++mMem will make curr to be prev, and prev will be curr
212 ovutils::memset0(mMem.prev().mRotOffset);
214 mMem.prev().mCurrOffset = 0;
237 // if the prev mem is valid, we need to close
238 if(mMem.prev().valid()) {
241 // tearing when prev.close is called.
242 if(!mMem.prev().close())
[all...] |
| /external/chromium_org/third_party/tcmalloc/chromium/src/base/ |
| low_level_alloc.cc | 136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
140 AllocList *e, AllocList **prev) {
145 prev[level] = p;
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
150 // Insert element *e into AllocList *head. Set prev[] as LLA_SkiplistSearch.
154 AllocList **prev) {
155 LLA_SkiplistSearch(head, e, prev);
156 for (; head->levels < e->levels; head->levels++) { // extend prev pointers
157 prev[head->levels] = head; // to all *e's levels
160 e->next[i] = prev[i]->next[i]
387 AllocList *prev[kMaxLevel]; local
405 AllocList *prev[kMaxLevel]; local
477 AllocList *prev[kMaxLevel]; local
[all...] |
| /external/chromium_org/third_party/tcmalloc/vendor/src/base/ |
| low_level_alloc.cc | 136 // For 0 <= i < head->levels, set prev[i] to "no_greater", where no_greater
140 AllocList *e, AllocList **prev) {
145 prev[level] = p;
147 return (head->levels == 0) ? 0 : prev[0]->next[0];
150 // Insert element *e into AllocList *head. Set prev[] as LLA_SkiplistSearch.
154 AllocList **prev) {
155 LLA_SkiplistSearch(head, e, prev);
156 for (; head->levels < e->levels; head->levels++) { // extend prev pointers
157 prev[head->levels] = head; // to all *e's levels
160 e->next[i] = prev[i]->next[i]
387 AllocList *prev[kMaxLevel]; local
405 AllocList *prev[kMaxLevel]; local
477 AllocList *prev[kMaxLevel]; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineRegisterInfo.cpp | 180 // Prev pointers are circular, so Head->Prev == Last.
184 MO->Contents.Reg.Prev = MO;
191 // Insert MO between Last and Head in the circular Prev chain.
192 MachineOperand *Last = Head->Contents.Reg.Prev;
195 Head->Contents.Reg.Prev = MO;
196 MO->Contents.Reg.Prev = Last;
220 MachineOperand *Prev = MO->Contents.Reg.Prev;
222 // Prev links are circular, next link is NULL instead of looping back to Head
[all...] |
| /external/chromium_org/third_party/icu/source/test/cintltst/ |
| bocu1tst.c | 55 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
59 * "prev" is reset for C0 controls but not for space.
62 /* initial value for "prev": middle of the ASCII range */
225 int32_t prev, count, diff; member in struct:Bocu1Rx
255 /* compute new prev */
366 int32_t prev; local
373 prev=*pPrev;
374 if(prev==0) {
376 prev=*pPrev=BOCU1_ASCII_PREV;
393 * are encoded with the difference c-prev
530 int32_t prev, c, count; local
712 int32_t c, prev, i; local
791 uint8_t prev[5], level[5]; local
[all...] |
| /external/icu/icu4c/source/test/cintltst/ |
| bocu1tst.c | 56 * Additionally, "prev" is moved from anywhere in the Unihan and Hangul
60 * "prev" is reset for C0 controls but not for space.
63 /* initial value for "prev": middle of the ASCII range */
226 int32_t prev, count, diff; member in struct:Bocu1Rx
256 /* compute new prev */
367 int32_t prev; local
374 prev=*pPrev;
375 if(prev==0) {
377 prev=*pPrev=BOCU1_ASCII_PREV;
394 * are encoded with the difference c-prev
531 int32_t prev, c, count; local
713 int32_t c, prev, i; local
792 uint8_t prev[5], level[5]; local
[all...] |
| /external/chromium_org/chrome/browser/ui/app_list/search/ |
| tokenized_string.cc | 36 const size_t word_start = break_iter.prev();
40 mappings_.push_back(gfx::Range(word_start + term_iter.prev(),
|
| /external/chromium_org/net/data/cache_tests/list_loop/ |
| contents.txt | 36 prev: 0x90000004
57 prev: 0x90000004
78 prev: 0x90000001
99 prev: 0x90000007
120 prev: 0x90000006
141 prev: 0x90000005
162 prev: 0x90000003
183 prev: 0x90000002
|
| /external/chromium_org/third_party/WebKit/Source/wtf/ |
| DoublyLinkedList.h | 39 T* prev() const;
49 template<typename T> inline void DoublyLinkedListNode<T>::setPrev(T* prev)
51 static_cast<T*>(this)->m_prev = prev;
59 template<typename T> inline T* DoublyLinkedListNode<T>::prev() const function in class:WTF::DoublyLinkedListNode
164 if (node->prev()) {
166 node->prev()->setNext(node->next());
174 node->next()->setPrev(node->prev());
177 m_tail = node->prev();
|
| /external/chromium_org/third_party/skia/samplecode/ |
| TransitionView.cpp | 31 TransitionView(SkView* prev, SkView* next, int direction) : fInterp(4, 2){
34 fPrev = prev;
80 SkView* prev = fPrev; local
81 prev->ref();
90 SkASSERT(1 == prev->getRefCnt());
91 prev->unref();
197 SkView* create_transition(SkView* prev, SkView* next, int direction) {
202 return SkNEW_ARGS(TransitionView, (prev, next, direction));
|
| /external/libcxx/test/iterators/iterator.primitives/iterator.operations/ |
| Android.mk | 19 test_name := iterators/iterator.primitives/iterator.operations/prev
20 test_src := prev.pass.cpp
|
| /external/libunwind/src/mi/ |
| dyn-register.c | 38 di->prev = NULL;
40 di->next->prev = di;
|
| /external/lzma/CPP/7zip/Archive/Common/ |
| ItemNameUtils.cpp | 43 LPCSTR prev =
49 return (*prev == '/');
|
| /external/skia/samplecode/ |
| TransitionView.cpp | 31 TransitionView(SkView* prev, SkView* next, int direction) : fInterp(4, 2){
34 fPrev = prev;
80 SkView* prev = fPrev; local
81 prev->ref();
90 SkASSERT(1 == prev->getRefCnt());
91 prev->unref();
197 SkView* create_transition(SkView* prev, SkView* next, int direction) {
202 return SkNEW_ARGS(TransitionView, (prev, next, direction));
|
| /external/valgrind/main/docs/lib/ |
| vg-html-chunk.xsl | 14 <xsl:param name="prev" select="/foo"/>
22 <xsl:variable name="row2" select="count($prev) > 0
29 <xsl:if test="count($prev)>0">
34 <!-- prev -->
36 <xsl:if test="count($prev)>0">
40 <xsl:with-param name="object" select="$prev"/>
43 <img src="images/prev.png" width="18" height="21" border="0">
46 <xsl:with-param name="key">nav-prev</xsl:with-param>
|
| /external/wpa_supplicant_8/src/ap/ |
| ap_list.h | 15 /* Note: next/prev pointers are updated whenever a new beacon is
19 struct ap_info *prev; /* previous entry in AP list */ member in struct:ap_info
|
| /external/zopfli/src/zopfli/ |
| hash.c | 34 h->prev = (unsigned short*)malloc(sizeof(*h->prev) * window_size);
40 h->prev[i] = i; /* If prev[j] == j, then prev[j] is uninitialized. */
68 free(h->prev);
102 h->prev[hpos] = h->head[h->val];
104 else h->prev[hpos] = hpos;
|
| /frameworks/base/libs/hwui/font/ |
| FontUtil.h | 61 #define AUTO_KERN(prev, next) (((next) - (prev) + 32) >> 6 << 16)
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/ |
| next_prior.hpp | 24 // const std::list<T>::iterator prev = boost::prior(p);
25 // const std::list<T>::iterator next = boost::next(prev, 2);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/ |
| compute_memory_pool.c | 239 chunk.prev = chunk.next = NULL;
274 if (item->prev) {
275 item->prev->next = next;
282 next->prev = item->prev;
285 item->prev = end_p;
328 item->prev = NULL;
334 item->prev = pos;
339 item->next->prev = item;
361 if (item->prev) {
[all...] |
