| /xsrc/external/mit/libX11/dist/src/ |
| utlist.h | 39 * Either way, the pointer to the head of the list must be initialized to NULL.
65 #define DL_PREPEND(head,add) \
67 (add)->next = head; \
68 if (head) { \
69 (add)->prev = (head)->prev; \
70 (head)->prev = (add); \
74 (head) = (add); \
77 #define DL_APPEND(head,add) \
79 if (head) { \
80 (add)->prev = (head)->prev;
[all...] |
| Sync.c | 46 if (discard && dpy->head) {
49 for (qelt=dpy->head; qelt; qelt=qelt->next)
53 dpy->qfree = (_XQEvent *)dpy->head;
54 dpy->head = dpy->tail = NULL;
|
| NextEvent.c | 49 if (dpy->head == NULL)
51 qelt = dpy->head;
|
| PeekEvent.c | 45 if (dpy->head == NULL)
47 *event = (dpy->head)->event;
|
| /xsrc/external/mit/xterm/dist/ |
| gen-charsets.pl | 167 my @head = @{ $_[0] };
170 $head[ $#head + 1 ] = $note[$n];
172 return @head;
176 my @head = @{ $_[0] };
178 $head[ $#head + 1 ] = " */";
192 return &add_text( \@head, $notes );
212 my @head = @{ $_[0] };
219 @head = &add( \@head, "" )
[all...] |
| /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/ |
| monoPolyPart.cc | 58 if (compV2InX(v->getPrev()->head(), v->head()) == -1 &&
59 compV2InX(v->getNext()->head(), v->head()) == -1)
70 if (compV2InX(v->getPrev()->head(), v->head()) == 1 &&
71 compV2InX(v->getNext()->head(), v->head()) == 1)
97 if(compV2InY(topV->head(), tempV->head())<0)
[all...] |
| partitionX.cc | 51 Real* T = v->head();
52 Real* P = v->getPrev()->head();
53 Real* N = v->getNext()->head();
69 Real* A = v->getPrev()->head();
70 Real* B = v->head();
94 //printf("isCusp,%f,%f\n", v->head()[0], v->head()[1]);
140 Int is_minimal = ((compV2InX(cusp->head(), cusp->tail()) == -1)? 1:0);
145 if(compV2InX(cusp->head(), temp->head()) == 1
[all...] |
| /xsrc/external/mit/xf86-video-intel/dist/src/ |
| intel_list.h | 49 * We need one list head in bar and a list element in all list_of_foos (both are of
64 * Now we initialize the list head:
106 * to-be-linked struct. struct list is required for both the head of the
111 * There are no requirements for a list head, any struct list can be a list
112 * head.
144 * Insert a new element after the given list head. The new element does not
147 * head → some element → ...
149 * head → new element → older element → ...
156 * @param head The existing list.
159 list_add(struct list *entry, struct list *head)
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/include/ |
| list.h | 52 list_add(struct list *entry, struct list *head)
54 __list_add(entry, head, head->next);
72 list_is_empty(const struct list *head)
74 return head->next == head;
92 #define list_for_each_entry(pos, head, member) \
93 for (pos = __container_of((head)->next, pos, member); \
94 &pos->member != (head); \
97 #define list_for_each_entry_safe(pos, tmp, head, member)
[all...] |
| /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/xf86-video-intel-2014/dist/src/ |
| intel_list.h | 49 * We need one list head in bar and a list element in all list_of_foos (both are of
64 * Now we initialize the list head:
106 * to-be-linked struct. struct list is required for both the head of the
111 * There are no requirements for a list head, any struct list can be a list
112 * head.
144 * Insert a new element after the given list head. The new element does not
147 * head → some element → ...
149 * head → new element → older element → ...
156 * @param head The existing list.
159 list_add(struct list *entry, struct list *head)
[all...] |
| /xsrc/external/mit/libdrm/dist/intel/ |
| uthash.h | 119 #define HASH_FIND_BYHASHVALUE(hh,head,keyptr,keylen,hashval,out) \
122 if (head) { \
124 HASH_TO_BKT(hashval, (head)->hh.tbl->num_buckets, _hf_bkt); \
125 if (HASH_BLOOM_TEST((head)->hh.tbl, hashval) != 0) { \
126 HASH_FIND_IN_BKT((head)->hh.tbl, hh, (head)->hh.tbl->buckets[ _hf_bkt ], keyptr, keylen, hashval, out); \
131 #define HASH_FIND(hh,head,keyptr,keylen,out) \
135 HASH_FIND_BYHASHVALUE(hh, head, keyptr, keylen, _hf_hashv, out); \
172 #define HASH_MAKE_TABLE(hh,head) \
174 (head)->hh.tbl = (UT_hash_table*)uthash_malloc(
[all...] |
| /xsrc/external/mit/libFS/dist/src/ |
| FSNextEv.c | 63 if (svr->head == NULL)
65 qelt = svr->head;
68 if ((svr->head = qelt->next) == NULL)
|
| FSSync.c | 69 if (discard && svr->head) {
71 _FSqfree = (_FSQEvent *) svr->head;
72 svr->head = svr->tail = NULL;
|
| /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/gallium/drivers/r300/compiler/ |
| memory_pool.c | 65 pool->head = (unsigned char*)(newblock + 1);
76 if (pool->head + bytes > pool->end)
79 assert(pool->head + bytes <= pool->end);
81 ptr = pool->head;
83 pool->head += bytes;
84 pool->head = (unsigned char*)(((unsigned long)pool->head + POOL_ALIGN - 1) & ~(POOL_ALIGN - 1));
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/ |
| memory_pool.c | 65 pool->head = (unsigned char*)(newblock + 1);
76 if (pool->head + bytes > pool->end)
79 assert(pool->head + bytes <= pool->end);
81 ptr = pool->head;
83 pool->head += bytes;
84 pool->head = (unsigned char*)(((unsigned long)pool->head + POOL_ALIGN - 1) & ~(POOL_ALIGN - 1));
|
| /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/MesaLib/dist/src/util/ |
| u_vector.c | 30 * A dynamically growable, circular buffer. Elements are added at head and
31 * removed from tail. head and tail are free-running uint32_t indices and we
33 * number of bytes in the queue is always head - tail, even in case of
48 vector->head = 0;
63 if (vector->head - vector->tail == vector->size) {
82 assert(vector->tail <= split && split < vector->head);
86 vector->head - split);
93 assert(vector->head - vector->tail < vector->size);
95 offset = vector->head & (vector->size - 1);
96 vector->head += vector->element_size
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| u_vector.c | 30 * A dynamically growable, circular buffer. Elements are added at head and
31 * removed from tail. head and tail are free-running uint32_t indices and we
33 * number of bytes in the queue is always head - tail, even in case of
43 vector->head = 0;
58 if (vector->head - vector->tail == vector->size) {
77 assert(vector->tail <= split && split < vector->head);
81 vector->head - split);
88 assert(vector->head - vector->tail < vector->size);
90 offset = vector->head & (vector->size - 1);
91 vector->head += vector->element_size
[all...] |
| list.h | 187 #define LIST_FOR_EACH_ENTRY(pos, head, member) \
188 for (pos = NULL, pos = container_of((head)->next, pos, member); \
189 &pos->member != (head); \
192 #define LIST_FOR_EACH_ENTRY_SAFE(pos, storage, head, member) \
193 for (pos = NULL, pos = container_of((head)->next, pos, member), \
195 &pos->member != (head); \
198 #define LIST_FOR_EACH_ENTRY_SAFE_REV(pos, storage, head, member) \
199 for (pos = NULL, pos = container_of((head)->prev, pos, member), \
201 &pos->member != (head); \
204 #define LIST_FOR_EACH_ENTRY_FROM(pos, start, head, member)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/ |
| swr_scratch.cpp | 58 space->head = (void *)space->base;
63 if (((uint8_t *)space->head + size)
65 space->head = space->base;
68 ptr = space->head;
69 space->head = (uint8_t *)space->head + size;
|
| /xsrc/external/mit/xorg-server/dist/include/ |
| list.h | 45 * We need one list head in bar and a list element in all list_of_foos (both are of
60 * Now we initialize the list head:
102 * to-be-linked struct. struct xorg_list is required for both the head of the
107 * There are no requirements for a list head, any struct xorg_list can be a list
108 * head.
139 * Insert a new element after the given list head. The new element does not
142 * head → some element → ...
144 * head → new element → older element → ...
151 * @param head The existing list.
154 xorg_list_add(struct xorg_list *entry, struct xorg_list *head)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/pipebuffer/ |
| pb_slab.c | 41 * However, when the head becomes full we purposefully keep it around
58 list_del(&entry->head); /* remove from reclaim list */
59 list_add(&entry->head, &slab->free);
63 if (!list_is_linked(&slab->head)) {
65 list_addtail(&slab->head, &group->slabs);
69 list_del(&slab->head);
81 LIST_FOR_EACH_ENTRY_SAFE(entry, next, &slabs->reclaim, head) {
139 list_is_empty(&LIST_ENTRY(struct pb_slab, group->slabs.next, head)->free))
144 slab = LIST_ENTRY(struct pb_slab, group->slabs.next, head);
148 list_del(&slab->head);
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/pipebuffer/ |
| pb_slab.c | 41 * However, when the head becomes full we purposefully keep it around
58 LIST_DEL(&entry->head); /* remove from reclaim list */
59 LIST_ADD(&entry->head, &slab->free);
63 if (!slab->head.next) {
65 LIST_ADDTAIL(&slab->head, &group->slabs);
69 LIST_DEL(&slab->head);
79 LIST_ENTRY(struct pb_slab_entry, slabs->reclaim.next, head);
118 LIST_IS_EMPTY(&LIST_ENTRY(struct pb_slab, group->slabs.next, head)->free))
123 slab = LIST_ENTRY(struct pb_slab, group->slabs.next, head);
127 LIST_DEL(&slab->head);
[all...] |
