HomeSort by relevance Sort by last modified time
    Searched defs:next (Results 1476 - 1500 of 3921) sorted by null

<<51525354555657585960>>

  /external/llvm/include/llvm/ADT/
STLExtras.h 145 // next/prior - These functions unlike std::advance do not modify the
148 // next(myIt) returns copy of myIt incremented once
149 // next(myIt, n) returns copy of myIt incremented n times
154 inline ItTy next(ItTy it, Dist n) function in namespace:llvm
161 inline ItTy next(ItTy it) function in namespace:llvm
  /external/llvm/lib/Analysis/
PathProfileInfo.cpp 125 for( BLEdgeIterator next = node->succBegin(),
126 end = node->succEnd(); next != end; next++ ) {
127 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges
128 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges
129 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber
130 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one?
131 best = *next;
143 BallLarusEdge* next = getNextEdge(currentNode, increment); local
145 increment -= next->getWeight()
182 BallLarusEdge* next = getNextEdge(currentNode, increment); local
    [all...]
  /external/llvm/runtime/libprofile/
PathProfiling.c 36 struct pathHashEntry_s* next; member in struct:pathHashEntry_s
145 hashEntry = hashEntry->next;
170 hashEntry = hashEntry->next;
176 hashEntry->next = hashTable->hashBins[index];
  /external/mesa3d/src/egl/main/
egldriver.c 17 * next paragraph) shall be included in all copies or substantial portions
377 const char *cur, *next; local
382 next = strchr(cur, ':');
383 len = (next) ? next - cur : strlen(cur);
388 cur = (next) ? next + 1 : NULL;
  /external/mesa3d/src/gallium/auxiliary/pipebuffer/
pb_buffer_fenced.c 15 * next paragraph) shall be included in all copies or substantial portions
200 struct list_head *curr, *next; local
206 curr = fenced_mgr->unfenced.next;
207 next = curr->next;
216 curr = next;
217 next = curr->next;
220 curr = fenced_mgr->fenced.next;
221 next = curr->next
400 struct list_head *curr, *next; local
459 struct list_head *curr, *next; local
    [all...]
pb_bufmgr_debug.c 15 * next paragraph) shall be included in all copies or substantial portions
345 struct list_head *curr, *next; local
348 curr = mgr->list.next;
349 next = curr->next;
357 curr = next;
358 next = curr->next;
  /external/mesa3d/src/gallium/drivers/llvmpipe/
lp_scene.h 15 * next paragraph) shall be included in all copies or substantial portions
76 struct cmd_block *next; member in struct:cmd_block
87 struct data_block *next; member in struct:data_block
lp_state_fs.h 23 * next paragraph) shall be included in all copies or substantial portions
77 struct lp_fs_variant_list_item *next, *prev; member in struct:lp_fs_variant_list_item
  /external/mesa3d/src/gallium/drivers/nouveau/
nouveau_mm.c 178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head);
183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head);
202 alloc->next = NULL;
262 struct mm_slab *slab, *next; local
264 LIST_FOR_EACH_ENTRY_SAFE(slab, next, head, head) {
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_bb.cpp 60 for (ArrayList::Iterator it = allInsns.iterator(); !it.end(); it.next())
63 for (ArrayList::Iterator it = allLValues.iterator(); !it.end(); it.next())
66 for (ArrayList::Iterator BBs = allBBlocks.iterator(); !BBs.end(); BBs.next())
97 for (Instruction *i = getFirst(); i; i = i->next)
102 for (Graph::EdgeIterator it = cfg.outgoing(); !it.end(); it.next()) {
120 assert(inst->next == 0 && inst->prev == 0);
154 assert(inst->next == 0 && inst->prev == 0);
186 assert(p->next == 0 && p->prev == 0);
201 p->next = q;
204 p->prev->next = p
478 Instruction *insn, *next; local
    [all...]
nv50_ir_graph.cpp 40 for (IteratorRef it = safeIteratorDFS(); !it->end(); it->next())
56 prev[0]->next[0] = next[0];
57 next[0]->prev[0] = prev[0];
59 origin->out = (next[0] == this) ? NULL : next[0];
64 prev[1]->next[1] = next[1];
65 next[1]->prev[1] = prev[1];
67 target->in = (next[1] == this) ? NULL : next[1]
234 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::DFSIterator
280 virtual void next() { if (pos < count) ++pos; } function in class:nv50_ir::CFGIterator
418 Node *next = NULL; local
    [all...]
nv50_ir_graph.h 67 Edge *next[2]; // next edge outgoing/incident from/to origin/target member in class:nv50_ir::Graph::Edge
85 virtual void next() function in class:nv50_ir::Graph::EdgeIterator
87 Graph::Edge *n = (rev ? e->prev[d] : e->next[d]);
220 for (EdgeIterator ei = incident(); !ei.end(); ei.next())
  /external/mesa3d/src/gallium/drivers/nv50/
nv50_screen.h 50 int next; member in struct:nv50_screen::__anon23149
56 int next; member in struct:nv50_screen::__anon23150
  /external/mesa3d/src/gallium/drivers/nvc0/
nvc0_screen.h 46 int next; member in struct:nvc0_screen::__anon23159
52 int next; member in struct:nvc0_screen::__anon23160
  /external/mesa3d/src/gallium/drivers/softpipe/
sp_state.h 15 * next paragraph) shall be included in all copies or substantial portions
94 struct sp_fragment_shader_variant *next; member in struct:sp_fragment_shader_variant
  /external/mesa3d/src/gallium/drivers/svga/
svga_resource_buffer_upload.c 288 assert(sbuf->head.prev && sbuf->head.next);
291 sbuf->head.next = sbuf->head.prev = NULL;
591 assert(!sbuf->head.prev && !sbuf->head.next);
630 struct list_head *curr, *next; local
633 curr = svga->dirty_buffers.next;
634 next = curr->next;
643 curr = next;
644 next = curr->next;
    [all...]
  /external/mesa3d/src/gallium/drivers/svga/svgadump/
svga_dump.c 1485 const uint8_t *next = body + size; local
1791 const uint8_t *next = commands; local
    [all...]
  /external/mesa3d/src/gallium/state_trackers/egl/x11/
glxinit.c 86 __GLcontextModes *const next = modes->next; local
89 modes = next;
99 __GLcontextModes **next; local
102 next = &base;
104 *next = (__GLcontextModes *) Xmalloc(size);
105 if (*next == NULL) {
111 memset(*next, 0, size);
112 (*next)->visualID = GLX_DONT_CARE;
113 (*next)->visualType = GLX_DONT_CARE
    [all...]
x11_screen.c 400 __GLcontextModes **next; local
403 next = &base;
405 *next = (__GLcontextModes *) CALLOC(1, size);
406 if (*next == NULL) {
411 next = &((*next)->next);
424 __GLcontextModes *next = modes->next; local
426 modes = next;
    [all...]
  /external/mesa3d/src/gallium/state_trackers/wgl/
stw_framebuffer.c 15 * next paragraph) shall be included in all copies or substantial portions
55 for (fb = stw_dev->fb_head; fb != NULL; fb = fb->next)
85 link = &(*link)->next;
87 *link = fb->next;
88 fb->next = NULL;
304 fb->next = stw_dev->fb_head;
364 struct stw_framebuffer *next; local
373 next = fb->next;
378 fb = next;
    [all...]
  /external/mesa3d/src/gallium/tools/trace/
parse.py 16 # next paragraph) shall be included in all copies or substantial portions
106 def next(self): member in class:XmlTokenizer
153 self.token = self.tokenizer.next()
  /external/mesa3d/src/gbm/backends/dri/
gbm_dri.c 11 * The above copyright notice and this permission notice (including the next
173 char path[PATH_MAX], *search_paths, *p, *next, *end; local
185 for (p = search_paths; p < end && dri->driver == NULL; p = next + 1) {
187 next = strchr(p, ':');
188 if (next == NULL)
189 next = end;
191 len = next - p;
  /external/mesa3d/src/glsl/
list.h 11 * The above copyright notice and this permission notice (including the next
31 * \c next pointer being \c NULL.
33 * A list is empty if either the head sentinel's \c next pointer points to the
43 * - A \c head pointer that represents the \c next pointer of the
46 * sentinel node and the \c next pointer of the tail sentinel node. This
51 * Therefore, if \c head->next is \c NULL or \c tail_prev->prev is \c NULL,
75 struct exec_node *next; member in struct:exec_node
98 exec_node() : next(NULL), prev(NULL)
105 return next;
110 return next;
229 void next() function in class:iterator
251 void next() function in class:exec_list_iterator
    [all...]
ralloc.c 11 * The above copyright notice and this permission notice (including the next
66 struct ralloc_header *next; member in struct:ralloc_header
92 info->next = parent->child;
95 if (info->next != NULL)
96 info->next->prev = info;
148 info->prev->next = info;
150 if (info->next != NULL)
151 info->next->prev = info;
155 for (child = info->child; child != NULL; child = child->next)
217 info->parent->child = info->next;
    [all...]
  /external/mesa3d/src/glx/apple/
apple_glx_drawable.h 139 /*END*/ struct apple_glx_drawable *previous, *next; member in struct:apple_glx_drawable

Completed in 330 milliseconds

<<51525354555657585960>>