Searched defs:prev (Results 151 - 175 of 904) sorted by relevance

1234567891011>>

/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dhash_table.c37 struct node *prev; member in struct:node
/external/chromium_org/third_party/protobuf/src/google/protobuf/compiler/java/
H A Djava_doc_comment.cc51 char prev = '*'; local
58 if (prev == '/') {
66 if (prev == '*') {
74 if (prev == '{') {
101 prev = c;
/external/chromium_org/third_party/protobuf/src/google/protobuf/stubs/
H A Datomicops_internals_mips_gcc.h55 Atomic32 prev, tmp; local
59 "ll %0, %5\n" // prev = *ptr
60 "bne %0, %3, 2f\n" // if (prev != old_value) goto 2
67 : "=&r" (prev), "=m" (*ptr), "=&r" (tmp)
70 return prev;
187 Atomic64 prev, tmp; local
191 "lld %0, %5\n" // prev = *ptr
192 "bne %0, %3, 2f\n" // if (prev != old_value) goto 2
199 : "=&r" (prev), "=m" (*ptr), "=&r" (tmp)
202 return prev;
[all...]
H A Datomicops_internals_x86_gcc.h58 Atomic32 prev; local
60 : "=a" (prev)
63 return prev;
182 Atomic64 prev; local
184 : "=a" (prev)
187 return prev;
/external/chromium_org/third_party/skia/src/gpu/effects/
H A DGrTextureStripAtlas.cpp287 uint32_t prev = 1 > fKeyTable.count() ? 0 : fKeyTable[0]->fKey; local
289 SkASSERT(prev < fKeyTable[i]->fKey);
291 prev = fKeyTable[i]->fKey;
/external/chromium_org/third_party/skia/tests/
H A DLListTest.cpp81 for (int i = 0; cur; ++i, cur = iter.prev()) {
226 Iter prev(iter);
229 prev.prev();
237 newItem.prev();
241 REPORTER_ASSERT(reporter, next.prev()->fID == iter.get()->fID);
243 if (prev.get()) {
244 REPORTER_ASSERT(reporter, prev.next()->fID == id);
253 REPORTER_ASSERT(reporter, next.prev()->fID == id);
255 if (prev
285 Iter prev = iter; local
[all...]
H A DPathOpsCubicLineIntersectionTest.cpp152 SkDPoint prev = cubic.ptAtT(cubicT * 2 - 1); local
154 double left[3] = { line.isLeft(prev), line.isLeft(sect), line.isLeft(cubic[3]) };
156 SkDebugf("{{%1.9g,%1.9g}, {%1.9g,%1.9g}},\n", prev.fX, prev.fY, sect.fX, sect.fY);
162 SkDebugf("prevD=%1.9g dist=%1.9g nextD=%1.9g\n", prev.distance(nextL),
/external/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dfts1_hash.h53 fts1HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:fts1HashElem
/external/chromium_org/third_party/sqlite/src/ext/fts3/
H A Dfts3_hash.h51 Fts3HashElem *next, *prev; /* Next and previous elements in the table */ member in struct:Fts3HashElem
/external/chromium_org/third_party/tcmalloc/chromium/src/base/
H A Datomicops-internals-macosx.h90 int64_t prev = OSAtomicCompareAndSwap64(oldValue, newValue, theValue); local
92 return prev;
H A Datomicops-internals-x86.h75 Atomic32 prev; local
77 : "=a" (prev)
80 return prev;
199 Atomic64 prev; local
201 : "=a" (prev)
204 return prev;
305 Atomic64 prev; local
311 : "=A" (prev) // as contents of ptr:
316 return prev;
/external/chromium_org/third_party/tcmalloc/vendor/src/base/
H A Datomicops-internals-macosx.h90 int64_t prev = OSAtomicCompareAndSwap64(oldValue, newValue, theValue); local
92 return prev;
H A Datomicops-internals-x86.h75 Atomic32 prev; local
77 : "=a" (prev)
80 return prev;
199 Atomic64 prev; local
201 : "=a" (prev)
204 return prev;
305 Atomic64 prev; local
311 : "=A" (prev) // as contents of ptr:
316 return prev;
/external/chromium_org/ui/app_list/
H A Dapp_list_item_list.cc60 AppListItem* prev = to_index > 0 ? app_list_items_[to_index - 1] : NULL; local
63 CHECK_NE(prev, next);
65 if (!prev) {
68 new_position = prev->position().CreateAfter();
73 if (prev->position().Equals(next->position()))
75 new_position = prev->position().CreateBetween(next->position());
80 << " Prev: " << (prev ? prev->position().ToDebugString() : "(none)")
226 AppListItem* prev = app_list_items_[index - 1]; local
229 if (!app_list_items_[last_index]->position().Equals(prev
[all...]
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_mutex.h106 u32 prev = atomic_fetch_sub(&state_, kWriteLock, memory_order_release); local
107 DCHECK_NE(prev & kWriteLock, 0);
108 (void)prev;
112 u32 prev = atomic_fetch_add(&state_, kReadLock, memory_order_acquire); local
113 if ((prev & kWriteLock) == 0)
119 u32 prev = atomic_fetch_sub(&state_, kReadLock, memory_order_release); local
120 DCHECK_EQ(prev & kWriteLock, 0);
121 DCHECK_GT(prev & ~kWriteLock, 0);
122 (void)prev;
158 u32 prev local
[all...]
/external/e2fsprogs/e2fsck/
H A Dmtrace.h143 size_t prev; /* Index of previous free cluster. */ member in struct:__anon20447::__anon20451
167 struct list *prev; member in struct:list
H A Dregion.c61 struct region_el *r, *new_region, *prev, *next; local
77 for (r = region->allocated, prev=NULL; r; prev = r, r = r->next) {
112 if (prev)
113 prev->next = new_region;
/external/e2fsprogs/lib/ext2fs/
H A Dinode_io.c118 struct inode_private_data *prev, *data = NULL; local
125 for (data = top_intern, prev = NULL; data;
126 prev = data, data = data->next)
131 if (prev)
132 prev->next = data->next;
/external/elfutils/0.153/libdw/
H A Dcfi.c67 Dwarf_Frame *prev)
74 copy->prev = prev;
330 Dwarf_Frame *prev = fs->prev; local
331 cfi_assert (prev != NULL);
333 fs = prev;
400 while (fs->prev != NULL)
402 Dwarf_Frame *prev = fs->prev; local
66 duplicate_frame_state(const Dwarf_Frame *original, Dwarf_Frame *prev) argument
[all...]
/external/fio/lib/
H A Dprio_tree.c78 struct prio_tree_node *first = NULL, *prev, *last = NULL; local
95 prev = last;
99 prev->left = last;
100 last->parent = prev;
/external/icu/icu4c/source/common/
H A Dlocutil.cpp149 int32_t prev, i; local
150 prev = 0;
152 i = id.indexOf((UChar)0x40, prev);
154 // no @ between prev and the rest of the string
155 id.extract(prev, INT32_MAX, buffer + prev, BUFLEN - prev, US_INV);
159 id.extract(prev, i - prev, buffer + prev, BUFLE
[all...]
/external/icu/icu4c/source/i18n/
H A Ducsdet.cpp166 UBool prev = csd->getStripTagsFlag(); local
170 return prev;
/external/icu/icu4c/source/tools/toolutil/
H A Dwritesrc.c231 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;
/external/libselinux/src/
H A Dstringrep.c161 struct discover_class_node *cur = discover_class_cache, *prev = NULL; local
172 prev = cur;
175 free(prev);
/external/libsepol/src/
H A Dhashtab.c69 hashtab_ptr_t prev, cur, newnode; local
75 prev = NULL;
78 prev = cur;
91 if (prev) {
92 newnode->next = prev->next;
93 prev->next = newnode;
141 hashtab_ptr_t prev, cur, newnode; local
147 prev = NULL;
150 prev = cur;
166 if (prev) {
[all...]

Completed in 3853 milliseconds

1234567891011>>