| /external/mesa3d/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...] |
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/util/ |
| TryListBuilder.java | 57 listEnd.prev = listStart;
100 public MutableTryBlock<EH> prev = null; field in class:TryListBuilder.MutableTryBlock
140 next.prev = prev;
141 prev.next = next;
151 next.prev = tryBlock;
153 tryBlock.prev = this;
158 prev.next = tryBlock;
159 tryBlock.prev = prev;
[all...] |
| /external/icu/icu4c/source/layout/ |
| IndicReordering.cpp | 597 le_int32 IndicReordering::findSyllable(const IndicClassTable *classTable, const LEUnicode *chars, le_int32 prev, le_int32 charCount)
599 le_int32 cursor = prev;
650 le_int32 i, prev = 0; local
653 while (prev < charCount) {
654 le_int32 syllable = findSyllable(classTable, chars, prev, charCount);
664 if (markStart != prev && classTable->isVowelModifier(chars[markStart - 1])) {
671 while (output.noteMatra(classTable, chars[matra], matra, tagArray1, !lastInWord) && matra != prev) {
677 switch (classTable->getCharClass(chars[prev]) & CF_CLASS_MASK) {
684 for (i = prev; i < syllable; i += 1) {
692 output.writeChar(C_DOTTED_CIRCLE, prev, tagArray1)
[all...] |
| /external/tinyxml/ |
| tinyxml.cpp | 150 prev = 0;
197 node->prev = lastChild;
231 node->prev = beforeThis->prev;
232 if ( beforeThis->prev )
234 beforeThis->prev->next = node;
241 beforeThis->prev = node;
256 node->prev = afterThis;
260 afterThis->next->prev = node;
282 node->prev = replaceThis->prev
[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;
|
| /bionic/libc/bionic/ |
| pthread_atfork.cpp | 34 atfork_t* prev; member in struct:atfork_t
61 for (atfork_t* it = g_atfork_list.last; it != NULL; it = it->prev) {
102 entry->prev = g_atfork_list.last;
103 if (entry->prev != NULL) {
104 entry->prev->next = entry;
|
| /external/guava/guava-tests/test/com/google/common/cache/ |
| CacheTesting.java | 210 * that the next/prev links in the expiration queue are correct, and that the queue is ordered
224 ReferenceEntry<?, ?> prev = null; local
227 if (prev != null) {
228 assertSame(prev, current.getPreviousInWriteQueue());
229 assertSame(prev.getNextInWriteQueue(), current);
230 assertTrue(prev.getWriteTime() <= current.getWriteTime());
236 prev = current;
246 ReferenceEntry<?, ?> prev = null; local
249 if (prev != null) {
250 assertSame(prev, current.getPreviousInAccessQueue())
[all...] |
| /external/zlib/src/contrib/amd64/ |
| amd64-match.S | 33 #define prev rcx define
79 printf("#define dsPrev (%3u)(%%rdi)\n",(int)(((char*)&(s->prev))-((char*)s)));
224 /* Posf *prev = s->prev; */
228 mov dsPrev, %prev
242 * } while ((cur_match = prev[cur_match & wmask]) > limit
251 movzwl (%prev, %curmatch, 2), %curmatchd
264 /* %scan is the string under scrutiny, and %prev to the string we */
272 lea MAX_MATCH_8(%scan, %scanalign), %prev
276 prefetcht1 (%prev, %rdx
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/ |
| RootInputStream.java | 38 private int prev = -1; field in class:RootInputStream
79 if (prev == '\r' && b == '\n') {
82 prev = b;
97 if (prev == '\r' && b[i] == '\n') {
100 prev = b[i];
|
| /external/llvm/include/llvm/ADT/ |
| SparseMultiSet.h | 85 /// circular in Prev indices, and INVALID-terminated in Next indices. This
93 unsigned Prev;
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
105 return Prev == INVALID;
108 /// Since the list is circular in Prev, all non-tombstone nodes have a valid
109 /// Prev.
110 bool isValid() const { return Prev != INVALID; }
144 return Dense[D.Prev].isTail();
152 return &Dense[N.Prev] == &N;
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next)
[all...] |
| /frameworks/compile/mclinker/lib/ADT/GraphLite/ |
| ListDigraph.cpp | 17 : prev(NULL), next(NULL), first_in(NULL), first_out(NULL) {
51 result->prev = NULL;
56 m_pNodeHead->prev = result;
102 pNode.next->prev = pNode.prev;
105 if (NULL != pNode.prev) {
106 pNode.prev->next = pNode.next;
108 else { // pNode.prev is NULL => pNode is the head
130 pNode.prev = NULL;
132 m_pFreeNodeHead->prev = &pNode
[all...] |
| /external/libedit/doc/ |
| editrc.5.roff | 301 .It Ic vi-paste-prev
303 .It Ic vi-prev-space-word
305 .It Ic vi-prev-word
345 .It Ic vi-delete-prev-char
349 .It Ic vi-kill-line-prev
351 .It Ic vi-search-prev
357 .It Ic vi-repeat-search-prev
361 .It Ic vi-prev-char
365 .It Ic vi-to-prev-char
369 .It Ic vi-repeat-prev-cha
[all...] |
| /external/linux-tools-perf/perf-3.12.0/tools/perf/scripts/python/ |
| sched-migration.py | 102 def sched_switch(self, prev, prev_state, next):
106 and prev in self.tasks:
110 event = RunqueueEventSleep(prev)
113 if prev in self.tasks:
115 next_tasks.remove(prev)
117 next_tasks.append(prev)
160 def __init__(self, start, prev):
162 self.prev = prev
166 if prev is not None
[all...] |
| /external/qemu/android/skin/ |
| image.c | 215 SkinImage* prev; member in struct:SkinImage
265 image->next = image->prev = image;
365 cache->mru_head.next = cache->mru_head.prev = &cache->mru_head;
393 image->prev->next = image->next;
394 image->next->prev = image->prev;
406 SkinImage* prev = image->prev; local
410 prev->next = next;
411 next->prev = prev
433 SkinImage* prev = image->prev; local
[all...] |
| /prebuilts/libs/libedit/share/man/man5/ |
| editrc.5 | 301 .It Ic vi-paste-prev
303 .It Ic vi-prev-space-word
305 .It Ic vi-prev-word
345 .It Ic vi-delete-prev-char
349 .It Ic vi-kill-line-prev
351 .It Ic vi-search-prev
357 .It Ic vi-repeat-search-prev
361 .It Ic vi-prev-char
365 .It Ic vi-to-prev-char
369 .It Ic vi-repeat-prev-cha
[all...] |
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| AtomicDoubleArrayTest.java | 182 double prev = 0.0; local
185 assertBitEquals(prev, aa.get(i));
187 assertBitEquals(prev, aa.get(i));
188 assertTrue(aa.compareAndSet(i, prev, x));
190 prev = x;
222 double prev = 0.0; local
225 assertBitEquals(prev, aa.get(i));
227 assertBitEquals(prev, aa.get(i));
228 while (!aa.weakCompareAndSet(i, prev, x)) {
232 prev = x
243 double prev = 0.0; local
[all...] |
| /external/harfbuzz_ng/src/ |
| hb-ot-shape-complex-arabic.cc | 109 /* State 0: prev was U, not willing to join. */
112 /* State 1: prev was R or ISOL/ALAPH, not willing to join. */
115 /* State 2: prev was D/L in ISOL form, willing to join. */
118 /* State 3: prev was D in FINA form, willing to join. */
121 /* State 4: prev was FINA ALAPH, not willing to join. */
124 /* State 5: prev was FIN2/FIN3 ALAPH, not willing to join. */
127 /* State 6: prev was DALATH/RISH, not willing to join. */
248 unsigned int prev = (unsigned int) -1, state = 0; local
275 if (entry->prev_action != NONE && prev != (unsigned int) -1)
276 info[prev].arabic_shaping_action() = entry->prev_action
[all...] |
| /external/bison/lib/ |
| lbitset.c | 64 struct lbitset_elt_struct *prev; /* Previous element. */ member in struct:lbitset_elt_struct
169 lbitset_elt *prev = elt->prev; local
171 if (prev)
172 prev->next = next;
175 next->prev = prev;
180 LBITSET_TAIL (bset) = prev;
192 else if (prev)
194 bset->b.cdata = prev->words
450 lbitset_elt *prev; local
[all...] |
| /system/core/adb/ |
| transport.c | 32 .prev = &transport_list,
37 .prev = &pending_list,
599 t->next->prev = t->prev;
600 t->prev->next = t->next;
655 t->next->prev = t->prev;
656 t->prev->next = t->next;
659 t->prev = transport_list.prev;
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GraphTest.cpp | 50 ASSERT_TRUE(u2 == u1->prev);
55 ASSERT_TRUE(u3 == u2->prev);
61 ASSERT_TRUE(NULL == u3->prev);
71 ASSERT_TRUE(u3 == u1->prev);
77 ASSERT_TRUE(NULL == u3->prev);
81 ASSERT_TRUE(NULL == u2->prev);
98 ASSERT_TRUE(u2 == u1->prev);
103 ASSERT_TRUE(u3 == u2->prev);
109 ASSERT_TRUE(NULL == u3->prev);
119 ASSERT_TRUE(NULL == u1->prev);
[all...] |
| /external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/ |
| pthread_mutex_consistent.c | 127 robust->prev = NULL;
133 robust->prev = NULL;
135 (*list)->prev = robust;
152 robust->next->prev = robust->prev;
154 if (robust->prev != NULL)
156 robust->prev->next = robust->next;
|
| /external/chromium_org/third_party/bintrees/bintrees/ |
| walker.py | 186 prev = None
193 if (prev is None) or (node.key > prev.key):
194 prev = node
197 if prev:
198 return prev.key, prev.value
|
| /external/icu/icu4c/source/tools/toolutil/ |
| writesrc.c | 231 int prev2, prev, c; local
236 prev2=prev=-1;
245 (col>=24 && prev2>=0x20 && prev==0) ||
247 (col>=16 && (prev==0 || prev>=0x20) && 0<c && c<0x20)
256 prev2=prev;
257 prev=c;
|
| /hardware/qcom/media/mm-video-legacy/vidc/vdec/inc/ |
| Map.h | 41 node* prev; member in struct:Map::node
44 data(t), data2(t2), prev(p), next(n) {}
145 if( tail->prev )
146 tail->prev->next = tail;
180 tmp->prev = NULL;
191 tmp->prev = NULL;
200 tmp->next->prev = prevnode->next;
|
| /hardware/qcom/media/mm-video-v4l2/vidc/vdec/inc/ |
| Map.h | 40 node* prev; member in struct:Map::node
43 data(t), data2(t2), prev(p), next(n) {}
151 if ( tail->prev )
152 tail->prev->next = tail;
184 tmp->prev = NULL;
195 tmp->prev = NULL;
204 tmp->next->prev = prevnode->next;
|
