/external/libvpx/libvpx/nestegg/halloc/src/ |
hlist.h | 32 hlist_item_t * next; member in struct:hlist_head 37 hlist_item_t * next; member in struct:hlist_item 50 #define __hlist_init_item(i) { &hlist_null, &(i).next } 76 for (i = (h)->next; i != &hlist_null; i = i->next) 79 for (i = (h)->next, tmp = i->next; \ 81 i = tmp, tmp = i->next) 89 h->next = &hlist_null; 95 i->prev = &i->next; 101 hlist_item_t * next; local 112 hlist_item_t * next; local [all...] |
/external/llvm/lib/Transforms/Utils/ |
MetaRenamer.cpp | 33 unsigned long next; member in struct:__anon22319::PRNG 36 next = seed; 40 next = next * 1103515245 + 12345; 41 return (unsigned int)(next / 65536) % 32768;
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
draw_pipe.h | 15 * next paragraph) shall be included in all copies or substantial portions 59 struct draw_stage *next; /**< next stage in pipeline */ member in struct:draw_stage
|
/external/mesa3d/src/gallium/auxiliary/util/ |
u_dirty_surfaces.h | 14 * next paragraph) shall be included in all copies or substantial 59 struct list_head *p, *next; local 60 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next) 63 next = p->next; 72 struct list_head *p, *next; local 75 for(p = dss->dirty_list.next; p != &dss->dirty_list; p = next) 78 next = p->next [all...] |
u_mm.c | 44 for (p = heap->next; p != heap; p = p->next) { 87 heap->next = block; 93 block->next = heap; 113 /* break left [p, newblock, p->next], then p = newblock */ 123 newblock->next = p->next; 125 p->next->prev = newblock; 126 p->next = newblock; 137 /* break right, also [p, newblock, p->next] */ 290 struct mem_block *next = p->next; local [all...] |
u_slab.h | 11 * The above copyright notice and this permission notice (including the next 49 struct util_slab_page *prev, *next; member in struct:util_slab_page
|
/external/mesa3d/src/gallium/drivers/nouveau/ |
nouveau_fence.c | 96 screen->fence.tail->next = fence; 117 screen->fence.head = fence->next; 121 for (it = screen->fence.head; it && it->next != fence; it = it->next); 122 it->next = fence->next; 140 struct nouveau_fence *next = NULL; local 147 for (fence = screen->fence.head; fence; fence = next) { 148 next = fence->next; [all...] |
nouveau_fence.h | 21 struct nouveau_fence *next; member in struct:nouveau_fence
|
/external/mesa3d/src/gallium/drivers/rbug/ |
rbug_screen.h | 15 * next paragraph) shall be included in all copies or substantial portions 37 struct rbug_list *next; member in struct:rbug_list
|
/external/mesa3d/src/gallium/state_trackers/wgl/ |
stw_framebuffer.h | 15 * next paragraph) shall be included in all copies or substantial portions 107 struct stw_framebuffer *next; member in struct:stw_framebuffer
|
/external/mesa3d/src/glx/apple/ |
apple_glx_context.h | 70 struct apple_glx_context *previous, *next; member in struct:apple_glx_context
|
/external/mesa3d/src/mesa/drivers/windows/gdi/ |
wmesadef.h | 37 struct wmesa_framebuffer *next; member in struct:wmesa_framebuffer
|
/external/mesa3d/src/mesa/main/ |
mm.c | 42 for(p = heap->next; p != heap; p = p->next) { 78 heap->next = block; 84 block->next = heap; 104 /* break left [p, newblock, p->next], then p = newblock */ 114 newblock->next = p->next; 116 p->next->prev = newblock; 117 p->next = newblock; 128 /* break right, also [p, newblock, p->next] */ 277 struct mem_block *next = p->next; local [all...] |
simple_list.h | 45 struct simple_node *next; member in struct:simple_node 56 (elem)->next->prev = (elem)->prev; \ 57 (elem)->prev->next = (elem)->next; \ 69 (elem)->next = (list)->next; \ 70 (list)->next->prev = elem; \ 71 (list)->next = elem; \ 82 (elem)->next = list; \ 84 (list)->prev->next = elem; [all...] |
/external/mockito/src/org/mockito/internal/verification/checkers/ |
NonGreedyNumberOfInvocationsInOrderChecker.java | 39 Invocation next = finder.findFirstMatchingUnverifiedInvocation( invocations, wanted, context ); local 40 if( next == null ){ 43 marker.markVerified( next, wanted ); 44 context.markVerified( next ); 45 lastLocation = next.getLocation();
|
/external/nist-sip/java/gov/nist/javax/sip/header/ |
SIPObjectList.java | 90 GenericObject outerObj = (GenericObject) it1.next(); 92 Object innerObj = it2.next(); 125 * Get the next object of this list (assumes that first() has been 129 public GenericObject next() { method in class:SIPObjectList 130 return (SIPObject) super.next();
|
/external/nist-sip/java/gov/nist/javax/sip/parser/ims/ |
PUserDatabaseParser.java | 100 char next = this.lexer.getNextChar(); local 101 if (next!='>'&&next!='\n') 103 dbname.append(next);
|
/external/openssh/openbsd-compat/ |
fake-rfc2553.c | 112 struct addrinfo *next; local 115 next = ai->ai_next; 117 ai = next;
|
/external/oprofile/libutil++/ |
string_manip.cpp | 57 string next; local 64 next += sep; 66 next += '\\'; 69 result.push_back(next); 71 next.erase(next.begin(), next.end()); 73 next += ch; 77 if (!next.empty()) 78 result.push_back(next); [all...] |
/external/qemu/hw/ |
mips_timer.c | 35 uint64_t now, next; local 41 next = now + muldiv64(wait, get_ticks_per_sec(), TIMER_FREQ); 42 qemu_mod_timer(env->timer, next);
|
/external/qemu/ |
keymaps.h | 38 struct key_range *next; member in struct:key_range
|
/external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
SQLiteDatabaseTest.java | 43 assertThat(resultSet.next(), equalTo(true));
|
/external/skia/src/core/ |
SkTLS.cpp | 45 SkTLSRec* next = rec->fNext; local 47 rec = next; 109 SkTLSRec* next = curr->fNext; local 112 prev->fNext = next; 115 SkTLS::PlatformSetSpecific(next); 121 curr = next;
|
/external/skia/src/effects/ |
Sk1DPathEffect.cpp | 21 SkScalar delta = this->next(dst, distance, meas); 117 while ((verb = iter.next(srcP)) != SkPath::kDone_Verb) { 177 SkScalar SkPath1DPathEffect::next(SkPath* dst, SkScalar distance, function in class:SkPath1DPathEffect
|
Sk2DPathEffect.cpp | 36 for (; !iter.done(); iter.next()) { 59 this->next(dst, x++, y, path); 65 void Sk2DPathEffect::next(const SkPoint& loc, int u, int v, SkPath* dst) const {} function in class:Sk2DPathEffect 129 void SkPath2DPathEffect::next(const SkPoint& loc, int u, int v, function in class:SkPath2DPathEffect
|