HomeSort by: relevance | last modified time | path
    Searched defs:head (Results 1 - 25 of 213) sorted by relevancy

1 2 3 4 5 6 7 8 9

  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/
memory_pool.h 38 unsigned char * head; member in struct:memory_pool
  /xsrc/external/mit/MesaLib/dist/src/mapi/
u_execmem.c 44 static unsigned int head = 0; variable
136 if (head + size > EXEC_MAP_SIZE)
140 addr = exec_mem + head;
141 head += size;
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/
memory_pool.h 38 unsigned char * head; member in struct:memory_pool
  /xsrc/external/mit/MesaLib/dist/src/util/
sparse_array.h 98 /** Head of the list
106 uint64_t head; variable
u_fifo.h 33 size_t head; member in struct:util_fifo
45 fifo->head = 0;
60 if (++fifo->head >= fifo->size)
61 fifo->head = 0;
63 array[fifo->head] = ptr;
u_vector.h 50 uint32_t head; member in struct:u_vector
77 return (queue->head - queue->tail) / queue->element_size;
83 assert(vector->tail < vector->head);
85 ((vector->head - vector->element_size) &
104 elem = (void *)((char *)(queue)->data + (__u_vector_offset & ((queue)->size - 1))), __u_vector_offset != (queue)->head; \
  /xsrc/external/mit/MesaLib.old/dist/src/mapi/
u_execmem.c 44 static unsigned int head = 0; variable
132 if (head + size > EXEC_MAP_SIZE)
136 addr = exec_mem + head;
137 head += size;
  /xsrc/external/mit/ctwm/dist/
functions_warp.c 181 TwmWindow *r, *head; local
184 head = Scr->RingLeader;
186 else if(!(head = Scr->Ring)) {
191 for(r = head->ring.next; r != head; r = r->ring.next) {
198 for(r = head->ring.prev; r != head; r = r->ring.prev) {
208 * on that window (but the window is head), and we want f.warpring
215 if(r != head
  /xsrc/external/mit/glu/dist/src/libnurbs/internals/
bin.h 46 Arc_ptr head;/*first arc on list */ member in class:Bin
54 inline int isnonempty( void ) { return (head ? 1 : 0); }
65 * Bin::addarc - add an Arc_ptr to head of linked list of Arc_ptr
72 jarc->link = head;
73 head = jarc;
84 Arc_ptr jarc = head;
86 if( jarc ) head = jarc->link;
117 current = head;
  /xsrc/external/mit/glu/dist/src/libtess/
dict.c 44 DictNode *head; local
48 head = &dict->head;
50 head->key = NULL;
51 head->next = head;
52 head->prev = head;
65 for( node = dict->head.next; node != &dict->head; node = next )
    [all...]
  /xsrc/external/mit/MesaLib/dist/src/compiler/nir/
nir_worklist.c 91 unsigned head = w->start; local
96 BITSET_CLEAR(w->blocks_present, w->blocks[head]->index);
97 return w->blocks[head];
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/llvmpipe/
lp_scene_queue.c 56 /* These values wrap around, so that head == tail means empty. When used
60 unsigned head; member in struct:lp_scene_queue
96 /** Remove first lp_scene from head of queue */
104 while (queue->head == queue->tail)
107 if (queue->head == queue->tail) {
113 struct lp_scene *scene = queue->scenes[queue->head++ % SCENE_QUEUE_SIZE];
129 while (queue->tail - queue->head >= SCENE_QUEUE_SIZE)
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/swr/
swr_fence.h 44 struct swr_fence_work head; member in struct:swr_fence::__anon2038
swr_scratch.h 28 void *head; member in struct:swr_scratch_space
  /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
nir_worklist.c 91 unsigned head = w->start; local
96 BITSET_CLEAR(w->blocks_present, w->blocks[head]->index);
97 return w->blocks[head];
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/util/
u_fifo.h 33 size_t head; member in struct:util_fifo
45 fifo->head = 0;
60 if (++fifo->head >= fifo->size)
61 fifo->head = 0;
63 array[fifo->head] = ptr;
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/
swr_fence.h 44 struct swr_fence_work head; member in struct:swr_fence::__anon4467
swr_scratch.h 28 void *head; member in struct:swr_scratch_space
  /xsrc/external/mit/MesaLib.old/dist/src/util/
u_vector.h 45 uint32_t head; member in struct:u_vector
59 return (queue->head - queue->tail) / queue->element_size;
65 assert(vector->tail < vector->head);
67 ((vector->head - vector->element_size) &
90 elem = (void *)((char *)(queue)->data + (__u_vector_offset & ((queue)->size - 1))), __u_vector_offset < (queue)->head; \
  /xsrc/external/mit/libXcomposite/dist/src/
xcompositeint.h 66 XCompositeExtDisplayInfo *head; /* start of the list */ member in struct:_XCompositeExtInfo
  /xsrc/external/mit/libXdamage/dist/src/
xdamageint.h 43 XDamageExtDisplayInfo *head; /* start of the list */ member in struct:_XDamageExtInfo
  /xsrc/external/mit/libXfixes/dist/src/
Xfixesint.h 44 XFixesExtDisplayInfo *head; /* start of the list */ member in struct:_XFixesExtInfo
  /xsrc/external/mit/libxcb/dist/src/
xcb_list.c 44 node *head; member in struct:_xcb_map
56 list->head = 0;
57 list->tail = &list->head;
65 while(list->head)
67 node *cur = list->head;
70 list->head = cur->next;
92 for(cur = &list->head; *cur; cur = &(*cur)->next)
  /xsrc/external/mit/xcb-util/dist/property/
xcb_property.h 63 xcb_property_handler_node_t *head; member in struct:xcb_property_handlers
  /xsrc/external/mit/xcb-util/dist/reply/
xcb_reply.h 63 struct xcb_reply_node *head; member in struct:xcb_reply_handlers

Completed in 14 milliseconds

1 2 3 4 5 6 7 8 9