| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/wgl/ |
| stw_tls.h | 15 * next paragraph) shall be included in all copies or substantial portions
39 struct stw_tls_data *next; member in struct:stw_tls_data
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/nouveau/ |
| nouveau_mm.h | 11 struct nouveau_mm_allocation *next; member in struct:nouveau_mm_allocation
|
| nouveau_heap.h | 42 * just free the "next" node, until there is no next node. This should assure
48 struct nouveau_heap *next; member in struct:nouveau_heap
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/wgl/ |
| stw_tls.h | 15 * next paragraph) shall be included in all copies or substantial portions
39 struct stw_tls_data *next; member in struct:stw_tls_data
|
| /xsrc/external/mit/ctwm/dist/ |
| list.h | 21 name_list *next; /* pointer to the next name */ member in struct:name_list
|
| 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
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/drivers/softpipe/ |
| sp_quad_pipe.h | 15 * next paragraph) shall be included in all copies or substantial portions
47 struct quad_stage *next; member in struct:quad_stage
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/softpipe/ |
| sp_quad_pipe.h | 15 * next paragraph) shall be included in all copies or substantial portions
47 struct quad_stage *next; member in struct:quad_stage
|
| /xsrc/external/mit/glu/dist/src/libnurbs/nurbtess/ |
| sampledLine.h | 65 sampledLine* next; member in class:sampledLine
|
| /xsrc/external/mit/mkfontscale/dist/ |
| 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
64 if (!next) {
68 next->value = a[i];
69 next->next = NULL;
71 current->next = next
89 ConstListPtr next = old->next; local
[all...] |
| constlist.h | 28 struct _ConstList *next; member in struct:_ConstList
|
| list.h | 32 struct _List *next; member in struct:_List
|
| /xsrc/external/mit/xkbcomp/dist/ |
| misc.h | 35 struct _CommonInfo *next; member in struct:_CommonInfo
|
| /xsrc/external/mit/xorg-server/dist/hw/xquartz/xpr/ |
| x-list.h | 40 x_list *next; member in struct:x_list_struct
|
| /xsrc/external/mit/xorg-server/dist/include/ |
| glx_extinit.h | 40 __GLXprovider *next; member in struct:__GLXprovider
|
| /xsrc/external/mit/xorg-server.old/dist/config/ |
| config-backends.h | 11 * The above copyright notice and this permission notice (including the next
52 struct config_dbus_core_hook *next; member in struct:config_dbus_core_hook
|
| /xsrc/external/mit/xorg-server.old/dist/hw/xquartz/xpr/ |
| x-list.h | 39 x_list *next; member in struct:x_list_struct
|
| /xsrc/external/mit/xsm/dist/ |
| list.h | 33 struct _List *next; member in struct:_List
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| ir3_remove_unreachable.c | 11 * The above copyright notice and this permission notice (including the next
99 assert(block->node.next != &ir->block_list);
100 struct ir3_block *next = LIST_ENTRY(struct ir3_block, block->node.next, node); local
102 pred->physical_successors[1] = next;
104 pred->physical_successors[0] = next;
105 ir3_block_add_physical_predecessor(next, pred);
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/auxiliary/draw/ |
| draw_vs_llvm.c | 15 * next paragraph) shall be included in all copies or substantial portions
75 struct draw_llvm_variant_list_item *next = next_elem(li); local
77 li = next;
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/nouveau/ |
| nouveau_heap.h | 42 * just free the "next" node, until there is no next node. This should assure
48 struct nouveau_heap *next; member in struct:nouveau_heap
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| bi_scoreboard.c | 11 * The above copyright notice and this permission notice (including the next
103 bi_clause *next = bi_next_clause(ctx, block, clause); local
104 if (next)
105 next->dependencies |= (1 << slot);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/auxiliary/draw/ |
| draw_vs_llvm.c | 15 * next paragraph) shall be included in all copies or substantial portions
73 struct draw_llvm_variant_list_item *next = next_elem(li); local
75 li = next;
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/swr/ |
| swr_fence_work.h | 37 struct swr_fence_work *next; member in struct:swr_fence_work
|
| /xsrc/external/mit/brotli/dist/c/enc/ |
| backward_references_hq.h | 53 |next| is assigned the offset to next node on the path. */
57 /* Offset to the next node on the path. Equals to command_length() of the
58 next node on the path. For last node equals to BROTLI_UINT32_MAX */
59 uint32_t next; member in union:ZopfliNode::__anon5332
60 /* Node position that provides next distance for distance cache. */
|
