| /xsrc/external/mit/libdrm/dist/ |
| H A D | libdrm_lists.h | 23 * next paragraph) shall be included in all copies or substantial portions 37 struct _drmMMListHead *next; member in struct:_drmMMListHead 43 (__item)->next = (__item); \ 49 (__item)->next = (__list)->next; \ 50 (__list)->next->prev = (__item); \ 51 (__list)->next = (__item); \ 56 (__item)->next = (__list); \ 58 (__list)->prev->next = (__item); \ 64 (__item)->prev->next [all...] |
| H A D | util_double_list.h | 23 * next paragraph) shall be included in all copies or substantial portions 44 struct list_head *next; member in struct:list_head 50 item->next = item; 56 item->next = list->next; 57 list->next->prev = item; 58 list->next = item; 63 item->next = list; 65 list->prev->next = item; 72 to->next [all...] |
| /xsrc/external/mit/xwd/dist/ |
| H A D | list.c | 5 and one to the next node in the list. The head of the list is 49 lp->next = NULL; 57 and the next pointer in the new node is set to NULL. 63 while (lp->next) { 64 lp = lp->next; 66 if ((lp->next = malloc(sizeof(list_item))) == NULL) { 70 lp->next->ptr.item = item; 71 lp->next->next = NULL; 87 lp->next [all...] |
| /xsrc/external/mit/xf86-video-vmware/dist/vmwgfx/ |
| H A D | wsbm_util.h | 18 struct _WsbmListHead *next; member in struct:_WsbmListHead 24 (__item)->next = (__item); \ 30 (__item)->next = (__list)->next; \ 31 (__list)->next->prev = (__item); \ 32 (__list)->next = (__item); \ 37 (__item)->next = (__list); \ 39 (__list)->prev->next = (__item); \ 45 (__item)->prev->next = (__item)->next; \ [all...] |
| /xsrc/external/mit/xorg-server.old/dist/include/ |
| H A D | list.h | 12 * The above copyright notice and this permission notice (including the next 31 struct list *next, *prev; member in struct:list 37 list->next = list->prev = list; 43 struct list *next) 45 next->prev = entry; 46 entry->next = next; 48 prev->next = entry; 54 __list_add(entry, head, head->next); 58 __list_del(struct list *prev, struct list *next) argument 41 __list_add(struct list * entry,struct list * prev,struct list * next) argument [all...] |
| /xsrc/external/mit/mkfontscale/dist/ |
| H A D | constlist.c | 38 for (current = first; current->next; current = current->next) 41 current->next = second; 59 first->next = NULL; 63 ConstListPtr next = malloc(sizeof(ConstListRec)); local in function:makeConstList 64 if (!next) { 68 next->value = a[i]; 69 next->next = NULL; 71 current->next 89 ConstListPtr next = old->next; local in function:destroyConstList [all...] |
| /xsrc/external/mit/xsm/dist/ |
| H A D | list.c | 36 l->next = l; 45 if(l->next->thing) return l->next; 52 if(l->next->thing) return l->next; 60 List *next; local in function:ListFreeAll 62 next = l->next; 64 l = next; 65 next 74 List *p, *next; local in function:ListFreeAllButHead [all...] |
| /xsrc/external/mit/xf86-video-amdgpu/dist/src/ |
| H A D | simple_list.h | 40 struct simple_node *next; member in struct:simple_node 51 (elem)->next->prev = (elem)->prev; \ 52 (elem)->prev->next = (elem)->next; \ 64 (elem)->next = (list)->next; \ 65 (list)->next->prev = elem; \ 66 (list)->next = elem; \ 77 (elem)->next = list; \ 79 (list)->prev->next [all...] |
| /xsrc/external/mit/xf86-video-ati/dist/src/ |
| H A D | simple_list.h | 41 struct simple_node *next; member in struct:simple_node 52 (elem)->next->prev = (elem)->prev; \ 53 (elem)->prev->next = (elem)->next; \ 65 (elem)->next = (list)->next; \ 66 (list)->next->prev = elem; \ 67 (list)->next = elem; \ 78 (elem)->next = list; \ 80 (list)->prev->next [all...] |
| /xsrc/external/mit/xf86-video-ati-kms/dist/src/ |
| H A D | simple_list.h | 41 struct simple_node *next; member in struct:simple_node 52 (elem)->next->prev = (elem)->prev; \ 53 (elem)->prev->next = (elem)->next; \ 65 (elem)->next = (list)->next; \ 66 (list)->next->prev = elem; \ 67 (list)->next = elem; \ 78 (elem)->next = list; \ 80 (list)->prev->next [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| H A D | 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; \ 70 (elem)->next = (list)->next; \ 71 (list)->next->prev = elem; \ 72 (list)->next = elem; \ 83 (elem)->next = list; \ 85 (list)->prev->next [all...] |
| H A D | list.h | 23 * next paragraph) shall be included in all copies or substantial portions 50 struct list_head *next; member in struct:list_head 56 item->next = item; 62 item->next = list->next; 63 list->next->prev = item; 64 list->next = item; 69 item->next = list; 71 list->prev->next = item; 83 to->next [all...] |
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| H A D | 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; \ 70 (elem)->next = (list)->next; \ 71 (list)->next->prev = elem; \ 72 (list)->next = elem; \ 83 (elem)->next = list; \ 85 (list)->prev->next [all...] |
| /xsrc/external/mit/ctwm/dist/ |
| H A D | win_ring.c | 5 * - If a window is not on the ring, its TwmWindow::ring.next and .prev 9 * - Corollary: if a window is the only one on the ring, .next and .prev 29 TwmWindow *next = win->ring.next; local in function:UnlinkWindowFromRing 38 // But if it is, prev/next should always exist. 40 assert(next != NULL); 45 * 3. If window was ring leader, set to next (or null) 47 * If the window is the only one in the ring, prev == next == win, 50 prev->ring.next = next; [all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/draw/ |
| H A D | draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions 151 struct draw_stage *next = draw->pipeline.rasterize; local in function:validate_pipeline 157 /* Set the validate's next stage to the rasterize stage, so that it 160 stage->next = next; 187 draw->pipeline.aaline->next = next; 188 next = draw->pipeline.aaline; 193 draw->pipeline.aapoint->next = next; [all...] |
| /xsrc/external/mit/libX11/dist/src/ |
| H A D | utlist.h | 37 * To use singly-linked lists, your structure must have a "next" pointer. 38 * To use doubly-linked lists, your structure must "prev" and "next" pointers. 44 * struct item *prev, *next; 67 (add)->next = head; \ 81 (head)->prev->next = (add); \ 83 (add)->next = NULL; \ 87 (head)->next = NULL; \ 96 (del)->next->prev = (del)->prev; \ 97 (head) = (del)->next; \ 99 (del)->prev->next [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/draw/ |
| H A D | draw_pipe_validate.c | 15 * next paragraph) shall be included in all copies or substantial portions 148 struct draw_stage *next = draw->pipeline.rasterize; local in function:validate_pipeline 154 /* Set the validate's next stage to the rasterize stage, so that it 157 stage->next = next; 184 draw->pipeline.aaline->next = next; 185 next = draw->pipeline.aaline; 190 draw->pipeline.aapoint->next = next; [all...] |
| /xsrc/external/mit/xf86-video-intel/dist/src/ |
| H A D | intel_list.h | 12 * The above copyright notice and this permission notice (including the next 96 * struct foo *iterator, *next; 97 * list_for_each_entry_safe(iterator, next, &bar.list_of_foos, entry) { 115 struct list *next, *prev; member in struct:list 129 list->next = list->prev = list; 135 struct list *next) 137 next->prev = entry; 138 entry->next = next; 140 prev->next 133 __list_add(struct list * entry,struct list * prev,struct list * next) argument 208 __list_del(struct list * prev,struct list * next) argument 413 __list_splice(const struct list * list,struct list * prev,struct list * next) argument [all...] |
| /xsrc/external/mit/xorg-server.old/dist/mi/ |
| H A D | mipoly.h | 91 struct _EdgeTableEntry *next; /* next in the list */ member in struct:_EdgeTableEntry 101 struct _ScanLineList *next; /* next in the list */ member in struct:_ScanLineList 121 struct _ScanLineListBlock *next; member in struct:_ScanLineListBlock 140 * x value to be ready for the next scanline. 147 pPrevAET->next = pAET->next; \ 148 pAET = pPrevAET->next; \ 156 pAET = pAET->next; \ [all...] |
| /xsrc/external/mit/xorg-server/dist/mi/ |
| H A D | mipoly.h | 90 struct _EdgeTableEntry *next; /* next in the list */ member in struct:_EdgeTableEntry 99 struct _ScanLineList *next; /* next in the list */ member in struct:_ScanLineList 117 struct _ScanLineListBlock *next; member in struct:_ScanLineListBlock 135 * x value to be ready for the next scanline. 142 pPrevAET->next = pAET->next; \ 143 pAET = pPrevAET->next; \ 151 pAET = pAET->next; \ [all...] |
| /xsrc/external/mit/glu/dist/src/libtess/ |
| H A D | dict.c | 51 head->next = head; 63 DictNode *node, *next; local in function:dictDeleteDict 65 for( node = dict->head.next; node != &dict->head; node = next ) { 66 next = node->next; 85 newNode->next = node->next; 86 node->next->prev = newNode; 88 node->next [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/ |
| H A D | nouveau_heap.c | 75 r->next = heap->next; 76 if (heap->next) 77 heap->next->prev = r; 79 heap->next = r; 85 heap = heap->next; 103 if (r->next && !r->next->in_use) { 104 struct nouveau_heap *new = r->next; 108 r->prev->next [all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/ |
| H A D | nouveau_heap.c | 75 r->next = heap->next; 76 if (heap->next) 77 heap->next->prev = r; 79 heap->next = r; 85 heap = heap->next; 103 if (r->next && !r->next->in_use) { 104 struct nouveau_heap *new = r->next; 108 r->prev->next [all...] |
| /xsrc/external/mit/libICE/dist/src/ |
| H A D | watch.c | 59 newWatchProc->next = NULL; 61 while (ptr && ptr->next) 62 ptr = ptr->next; 67 ptr->next = newWatchProc; 80 newWatchedConn->next = NULL; 106 currWatchProc = currWatchProc->next; 111 _IceWatchProc *nextWatchProc = currWatchProc->next; 117 _IceWatchedConnection *nextWatchedConn = watchedConn->next; 125 prevWatchProc->next = nextWatchProc; 147 while (watchedConn && watchedConn->next) [all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/nine/ |
| H A D | nine_shader.h | 11 * The above copyright notice and this permission notice (including the next 39 struct nine_range *ranges; /* single MALLOC, but next-pointers valid */ 119 struct nine_shader_variant *next; member in struct:nine_shader_variant 132 while (list->key != key && list->next) 133 list = list->next; 148 while (list->next) { 150 list = list->next; 152 list->next = MALLOC_STRUCT(nine_shader_variant); 153 if (!list->next) 155 list->next 175 struct nine_shader_variant_so *next; member in struct:nine_shader_variant_so 236 struct nine_shader_constant_combination *next; member in struct:nine_shader_constant_combination [all...] |