HomeSort by relevance Sort by last modified time
    Searched full:prev (Results 476 - 500 of 3406) sorted by null

<<11121314151617181920>>

  /external/mesa3d/src/mesa/drivers/dri/i965/
brw_fs_schedule_instructions.cpp 218 schedule_node *prev = (schedule_node *)n->prev; local
221 if (prev) {
222 while (!prev->is_head_sentinel()) {
223 add_dep(prev, n, 0);
224 prev = (schedule_node *)prev->prev;
354 exec_node *prev; local
355 for (node = instructions.get_tail(), prev = node->prev
    [all...]
  /system/core/adb/
usb_libusb.c 45 usb_handle *prev; member in struct:usb_handle
63 .prev = &handle_list,
213 h->next->prev = h->prev;
214 h->prev->next = h->next;
215 h->prev = NULL;
237 h->next->prev = h->prev;
238 h->prev->next = h->next;
239 h->prev = NULL
    [all...]
  /external/chromium_org/third_party/skia/src/core/
SkDeque.cpp 266 // 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;
SkMatrixClipStateMgr.h 184 MatrixClipState(MatrixClipState* prev, int flags)
185 : fPrev(prev)
189 if (NULL == prev) {
203 fLayerID = prev->fLayerID;
206 fMatrixInfoStorage = *prev->fMatrixInfo;
209 fMatrixInfo = prev->fMatrixInfo;
216 fClipInfo = prev->fClipInfo;
221 fMCStateID = prev->fMCStateID;
223 fExpectedDepth = prev->fExpectedDepth;
  /external/llvm/lib/Option/
Option.cpp 143 const char *Prev = Str;
148 if (Prev != Str) {
149 char *Value = new char[Str - Prev + 1];
150 memcpy(Value, Prev, Str - Prev);
151 Value[Str - Prev] = '\0';
158 Prev = Str + 1;
  /external/pixman/
Makefile.am 72 ensure-prev:
73 @if [[ "$(PREV)" == "" ]]; then \
75 echo "You must set the PREV variable on the make command line to" && \
79 echo " make PREV=0.7.3" && \
84 release-check: ensure-prev release-verify-newer release-remove-old distcheck
96 release-publish-message: $(HASHFILES) ensure-prev
131 @git log --no-merges "$(PACKAGE)-$(PREV)".."$(PACKAGE)-$(VERSION)" | git shortlog | awk '{ printf "\t"; print ; }' | cut -b1-80
  /external/skia/src/core/
SkDeque.cpp 266 // 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;
SkMatrixClipStateMgr.h 184 MatrixClipState(MatrixClipState* prev, int flags)
185 : fPrev(prev)
189 if (NULL == prev) {
203 fLayerID = prev->fLayerID;
206 fMatrixInfoStorage = *prev->fMatrixInfo;
209 fMatrixInfo = prev->fMatrixInfo;
216 fClipInfo = prev->fClipInfo;
221 fMCStateID = prev->fMCStateID;
223 fExpectedDepth = prev->fExpectedDepth;
  /external/chromium_org/third_party/sfntly/cpp/src/test/tinyxml/
tinyxml.cpp 142 prev = 0;
201 node->prev = lastChild;
248 node->prev = beforeThis->prev;
249 if ( beforeThis->prev )
251 beforeThis->prev->next = node;
258 beforeThis->prev = node;
280 node->prev = afterThis;
284 afterThis->next->prev = node;
317 node->prev = replaceThis->prev
    [all...]
  /external/sfntly/cpp/src/test/tinyxml/
tinyxml.cpp 142 prev = 0;
201 node->prev = lastChild;
248 node->prev = beforeThis->prev;
249 if ( beforeThis->prev )
251 beforeThis->prev->next = node;
258 beforeThis->prev = node;
280 node->prev = afterThis;
284 afterThis->next->prev = node;
317 node->prev = replaceThis->prev
    [all...]
  /external/chromium_org/third_party/sqlite/src/src/
mem3.c 89 u32 prev; /* Index in mem3.aPool[] of previous free chunk */ member in struct:Mem3Block::__anon19406::__anon19408
149 u32 prev = mem3.aPool[i].u.list.prev; local
151 if( prev==0 ){
154 mem3.aPool[prev].u.list.next = next;
157 mem3.aPool[next].u.list.prev = prev;
160 mem3.aPool[i].u.list.prev = 0;
190 mem3.aPool[i].u.list.prev = 0;
192 mem3.aPool[*pRoot].u.list.prev = i
316 u32 iNext, prev, size, i, x; local
    [all...]
  /external/opencv/cv/src/
cvinpaint.cpp 72 struct CvHeapElem* prev; member in struct:CvHeapElem
99 head->prev = NULL;
104 mem[i].prev = mem+i-1;
111 tail->prev = mem+i-1;
132 while (tmp->prev->T>T) tmp = tmp->prev;
134 add->prev->next = add->next;
135 add->next->prev = add->prev;
137 add->prev = tmp->prev
    [all...]
  /external/srec/portable/src/
phashtable.c 43 PHashTableEntry *prev; member in struct:PHashTableEntry_t
192 if (entry->prev == NULL)
195 entry->prev->next = entry->next;
198 entry->next->prev = entry->prev;
310 if (entry->prev != NULL)
311 entry->prev->next = next;
316 next->prev = entry->prev;
320 entry->prev = NULL
    [all...]
  /frameworks/base/core/java/android/os/
MessageQueue.java 264 Message prev = null; local
268 prev = p;
272 if (prev != null) { // invariant: p == prev.next
274 prev.next = msg;
287 Message prev = null; local
290 prev = p;
298 if (prev != null) {
299 prev.next = p.next;
346 Message prev; local
    [all...]
  /external/chromium_org/chrome/tools/profile_reset/
jtl_parser_unittest.cc 260 {"prev().foo1(\"\");next(true);", "foo1", "[\"\"]", true},
261 {"prev().foo2(\" \");next(true);", "foo2", "[\" \"]", true},
262 {"prev().foo3(\",\",true);next(true);", "foo3", "[\",\",true]", true},
263 {"prev().foo4(\")\",true);next(true);", "foo4", "[\")\",true]", true},
264 {"prev().foo5(\";\",true);next(true);", "foo5", "[\";\",true]", true},
265 {"prev().foo6(\"/\",true).next(true);", "foo6", "[\"/\",true]", false},
266 {"prev().foo7(\"//\",true).next(true);", "foo7", "[\"//\",true]", false},
267 {"prev().foo8(\".\",true).next(true);", "foo8", "[\".\",true]", false},
274 ExpectNextOperation(parser.get(), "prev", "[]", false);
  /external/chromium_org/third_party/mesa/src/src/egl/main/
egldisplay.c 434 _EGLResource *prev; local
436 prev = res->Display->ResourceLists[type];
437 if (prev != res) {
438 while (prev) {
439 if (prev->Next == res)
441 prev = prev->Next;
443 assert(prev);
444 prev->Next = res->Next;
  /external/chromium_org/third_party/openssl/openssl/crypto/engine/
eng_list.c 71 * "prev" pointer in each ENGINE is to save excessive list iteration,
129 e->prev = NULL;
145 e->prev = engine_list_tail;
179 e->next->prev = e->prev;
180 if(e->prev)
181 e->prev->next = e->next;
186 engine_list_tail = e->prev;
256 ret = e->prev;
  /external/chromium_org/third_party/sqlite/src/test/
autoindex1.test 229 (SELECT s.sheep_no, prev.flock_no, prev.owner_person_id,
230 s.date_of_registration, prev.owner_change_date
231 FROM sheep s JOIN flock_owner prev ON s.registering_flock =
232 prev.flock_no
233 AND (prev.owner_change_date <= s.date_of_registration || ' 00:00:00')
236 WHERE prev.flock_no = later.flock_no
237 AND later.owner_change_date > prev.owner_change_date
244 1 1 1 {SEARCH TABLE flock_owner AS prev USING INDEX sqlite_autoindex_flock_owner_1 (flock_no=? AND owner_change_date<?) (~2 rows)}
  /external/mesa3d/src/egl/main/
egldisplay.c 434 _EGLResource *prev; local
436 prev = res->Display->ResourceLists[type];
437 if (prev != res) {
438 while (prev) {
439 if (prev->Next == res)
441 prev = prev->Next;
443 assert(prev);
444 prev->Next = res->Next;
  /external/openssl/crypto/engine/
eng_list.c 71 * "prev" pointer in each ENGINE is to save excessive list iteration,
129 e->prev = NULL;
145 e->prev = engine_list_tail;
179 e->next->prev = e->prev;
180 if(e->prev)
181 e->prev->next = e->next;
186 engine_list_tail = e->prev;
256 ret = e->prev;
  /hardware/ti/omap3/dspbridge/inc/
list.h 64 struct LST_ELEM *prev; member in struct:LST_ELEM
95 * "empty" element, because its "next" and "prev" pointers point at
162 * "prev" pointer of the next element after the head point at the tail
179 * "prev" pointer) to the tail of the list, this list is circular.
258 * Sets new element's "prev" pointer to the address previously held by
259 * the head element's prev pointer. This is the previous tail member of
261 * Sets the new head's prev pointer to the address of the element.
265 * Sets head's prev pointer to the address of the new element.
280 * "prev" pointer points at the tail of the list), the list is circular.
  /hardware/ti/omap3/dspbridge/libbridge/inc/
list.h 64 struct LST_ELEM *prev; member in struct:LST_ELEM
95 * "empty" element, because its "next" and "prev" pointers point at
162 * "prev" pointer of the next element after the head point at the tail
179 * "prev" pointer) to the tail of the list, this list is circular.
258 * Sets new element's "prev" pointer to the address previously held by
259 * the head element's prev pointer. This is the previous tail member of
261 * Sets the new head's prev pointer to the address of the element.
265 * Sets head's prev pointer to the address of the new element.
280 * "prev" pointer points at the tail of the list), the list is circular.
  /system/extras/showmap/
showmap.c 40 static int parse_header(const char* line, const mapinfo* prev, mapinfo** mi) {
59 if (prev && start == prev->end && is_library(prev->name)) {
63 strlcpy(name, prev->name, sizeof(name));
126 mapinfo *prev = NULL; local
149 if (prev) {
150 prev->next = map;
158 prev = current;
  /bootable/recovery/minadbd/
transport.c 32 .prev = &transport_list,
450 t->next->prev = t->prev;
451 t->prev->next = t->next;
501 t->prev = transport_list.prev;
502 t->next->prev = t;
503 t->prev->next = t;
506 t->disconnects.next = t->disconnects.prev = &t->disconnects;
583 dis->prev = dis->next->prev
    [all...]
  /development/samples/ApiDemos/src/com/example/android/apis/graphics/
ColorFilters.java 48 private static void addToTheRight(Drawable curr, Drawable prev) {
49 Rect r = prev.getBounds();
74 Drawable prev = mDrawable; local
78 addToTheRight(mDrawables[i], prev);
79 prev = mDrawables[i];

Completed in 1094 milliseconds

<<11121314151617181920>>