Searched refs:prev (Results 276 - 300 of 1047) sorted by relevance

<<11121314151617181920>>

/external/harfbuzz_ng/src/
H A Dhb-utf-private.hh110 prev (const uint8_t *text, function in struct:hb_utf_t
172 prev (const uint16_t *text, function in struct:hb_utf_t
230 prev (const uint32_t *text, function in struct:hb_utf_t
H A Dhb-ot-shape-complex-arabic.cc109 /* 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
274 if (entry->prev_action != NONE && prev != (unsigned int) -1)
275 info[prev]
[all...]
/external/jemalloc/src/
H A Dchunk.c331 extent_node_t *node, *prev; local
381 prev = extent_tree_ad_prev(chunks_ad, node);
382 if (prev != NULL && (void *)((uintptr_t)extent_node_addr_get(prev) +
383 extent_node_size_get(prev)) == chunk) {
389 extent_tree_szad_remove(chunks_szad, prev);
390 extent_tree_ad_remove(chunks_ad, prev);
391 arena_chunk_cache_maybe_remove(arena, prev, cache);
394 extent_node_addr_set(node, extent_node_addr_get(prev));
395 extent_node_size_set(node, extent_node_size_get(prev)
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h68 Edge *prev[2]; member in class:nv50_ir::Graph::Edge
82 t = e = ((rev && first) ? first->prev[d] : first);
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
/external/selinux/libsepol/src/
H A Davtab.c92 avtab_insert_node(avtab_t * h, int hvalue, avtab_ptr_t prev, avtab_key_t * key, argument
118 if (prev) {
119 newnode->next = prev->next;
120 prev->next = newnode;
133 avtab_ptr_t prev, cur, newnode; local
141 for (prev = NULL, cur = h->htable[hvalue];
142 cur; prev = cur, cur = cur->next) {
162 newnode = avtab_insert_node(h, hvalue, prev, key, datum);
177 avtab_ptr_t prev, cur, newnode; local
184 for (prev
[all...]
H A Dsidtab.c46 sidtab_node_t *prev, *cur, *newnode; local
52 prev = NULL;
55 prev = cur;
73 if (prev) {
74 newnode->next = prev->next;
75 prev->next = newnode;
/external/skia/src/core/
H A DSkRegion_path.cpp457 Edge* prev = edge;
462 path->moveTo(SkIntToScalar(prev->fX), SkIntToScalar(prev->fY0));
463 prev->fFlags = 0;
465 if (prev->fX != edge->fX || prev->fY1 != edge->fY0) { // skip collinear
466 path->lineTo(SkIntToScalar(prev->fX), SkIntToScalar(prev->fY1)); // V
469 prev = edge;
472 prev
[all...]
H A DSkDeque.cpp266 // Like next, prev actually returns the current element pointed to by fPos and
268 void* SkDeque::Iter::prev() { function in class:SkDeque::Iter
272 char* prev = pos - fElemSize; local
273 SkASSERT(prev >= fCurBlock->fBegin - fElemSize);
274 if (prev < fCurBlock->fBegin) { // exhausted this chunk, move to prior
278 prev = fCurBlock ? fCurBlock->fEnd - fElemSize : NULL;
280 fPos = prev;
/external/skia/src/pathops/
H A DSkOpCoincidence.cpp285 SkOpSpanBase* oNext = flipped ? oStart->prev() : oStart->next();
302 SkCoincidentSpans* prev = NULL; local
307 if (prev) {
308 prev->fNext = next;
314 prev = coin;
329 SkOpSpan* prev = start->prev(); local
331 if (prev && (oppPtT = prev->contains(oppSegment))) {
332 double midT = (prev
[all...]
H A DSkOpSpan.h95 SkOpPtT* prev();
203 void initBase(SkOpSegment* parent, SkOpSpan* prev, double t, const SkPoint& pt);
220 SkOpSpan* prev() const { function in class:SkOpSpanBase
250 void setPrev(SkOpSpan* prev) { argument
251 fPrev = prev;
368 void init(SkOpSegment* parent, SkOpSpan* prev, double t, const SkPoint& pt);
H A DSkOpSegment.h70 angle->set(&fTail, fTail.prev());
197 SkOpSpan* insert(SkOpSpan* prev, SkChunkAlloc* allocator) { argument
199 SkOpSpanBase* next = prev->next();
200 result->setPrev(prev);
201 prev->setNext(result);
265 const SkOpSegment* prev() const { function in class:SkOpSegment
306 void setPrev(SkOpSegment* prev) { argument
307 fPrev = prev;
/external/skia/tools/
H A DCrashHandler.cpp91 void (*prev)(int) = signal(kSignals[i], handler);
92 if (prev != SIG_DFL) {
93 signal(kSignals[i], prev);
/external/wpa_supplicant_8/wpa_supplicant/
H A Dctrl_iface_named_pipe.c63 struct wpa_ctrl_dst *next, *prev; member in struct:wpa_ctrl_dst
211 dst->next->prev = dst;
242 if (dst->prev)
243 dst->prev->next = dst->next;
247 dst->next->prev = dst->prev;
543 struct wpa_global_dst *next, *prev; member in struct:wpa_global_dst
643 dst->next->prev = dst;
674 if (dst->prev)
675 dst->prev
[all...]
/external/clang/utils/
H A Dtoken-delta.py175 prev = None
177 if prev is None or j != prev + 1:
178 if prev:
179 sys.stderr.write('%d][' % prev)
182 prev = j
/external/selinux/libsepol/cil/src/
H A Dcil_symtab.c171 struct cil_complex_symtab_node *prev = NULL; local
182 for (prev = NULL, curr = symtab->htable[hash]; curr != NULL;
183 prev = curr, curr = curr->next) {
210 if (prev != NULL) {
211 node->next = prev->next;
212 prev->next = node;
/external/skia/src/gpu/
H A DGrBufferAllocPool.cpp275 BufferBlock& prev = fBlocks.fromBack(1); local
276 if (prev.fBuffer->isMapped()) {
277 UNMAP_BUFFER(prev);
279 this->flushCpuData(prev, prev.fBuffer->gpuMemorySize() - prev.fBytesFree);
H A DGrAAConvexTessellator.cpp125 int prev = fBisectors.count() - 1; local
126 for (int cur = 0; cur < fBisectors.count(); prev = cur, ++cur) {
127 fBisectors[cur] = fNorms[cur] + fNorms[prev];
403 int prev = numPts - 1; local
407 SkPoint temp = fNorms[prev];
445 this->addTri(prev, newIdx0, cur);
446 this->addTri(prev, lastPerpIdx, newIdx0);
453 prev = cur;
657 int prev = fPts.count() - 1; local
658 for (int cur = 0; cur < fPts.count(); prev
675 SkPoint prev = tess.point(fPts[0].fIndex) - tess.point(fPts.top().fIndex); local
[all...]
/external/e2fsprogs/debugfs/
H A Dextent_cmds.ct38 previous, prev, p;
/external/e2fsprogs/e2fsck/
H A Dmtrace.h143 size_t prev; /* Index of previous free cluster. */ member in struct:__anon3830::__anon3834
167 struct list *prev; member in struct:list
/external/emma/core/java12/com/vladium/util/
H A DSoftValueMap.java307 for (SoftEntry entry = buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next)
313 if (prev == null) // head of the list
319 prev.m_next = entry.m_next;
558 for (SoftEntry entry = m_buckets [bucketIndex], prev = null; entry != null; prev = entry, entry = entry.m_next)
562 if (prev == null) // head of the list
568 prev.m_next = entry.m_next;
/external/icu/icu4c/source/common/
H A Ducasemap.cpp264 int32_t prev, titleStart, titleLimit, idx, destIndex, length; local
281 prev=0;
285 while(prev<srcLength) {
305 * In this implementation, segment [prev..index[ into 3 parts:
306 * a) uncased characters (copy as-is) [prev..titleStart[
310 if(prev<idx) {
311 /* find and copy uncased characters [prev..titleStart[ */
312 titleStart=titleLimit=prev;
320 * only uncased characters in [prev..index[
330 length=titleStart-prev;
[all...]
/external/icu/icu4c/source/i18n/
H A Duitercollationiterator.cpp214 UChar32 prev = U_SENTINEL;
216 CollationFCD::hasTccc(prev = iter.previous(&iter))) {
218 if(prev >= 0) {
228 if(prev < 0) {
229 prev = iter.previous(&iter);
231 if(U16_IS_LEAD(prev)) {
232 return U16_GET_SUPPLEMENTARY(prev, c);
235 if(prev >= 0) {
/external/lldb/source/Plugins/DynamicLoader/POSIX-DYLD/
H A DDYLDRendezvous.h135 lldb::addr_t prev; ///< Address of previous so_entry. member in struct:DYLDRendezvous::SOEntry
149 prev = 0;
/external/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp128 if (Best != std::prev(Queue.end()))
137 if (I != std::prev(Queue.end()))
/external/llvm/unittests/Support/
H A DIteratorTest.cpp55 EXPECT_EQ(K, std::prev(I));
96 EXPECT_EQ(K, std::prev(I));

Completed in 715 milliseconds

<<11121314151617181920>>