| /xsrc/external/mit/libXi/dist/src/ |
| XFreeLst.c | 49 * XFreeDeviceList - free the input device list.
62 * Free the list of input devices.
66 XFreeDeviceList(XDeviceList *list)
68 if (list != NULL) {
69 XFree((list->name) - sizeof(XDeviceList));
70 XFree((XDeviceList *) list);
|
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
50 * Remove an element from list.
62 * Insert an element to the list head.
64 * \param list list.
67 #define insert_at_head(list, elem) \
69 (elem)->prev = list; \
70 (elem)->next = (list)->next; \
71 (list)->next->prev = elem;
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
50 * Remove an element from list.
62 * Insert an element to the list head.
64 * \param list list.
67 #define insert_at_head(list, elem) \
69 (elem)->prev = list; \
70 (elem)->next = (list)->next; \
71 (list)->next->prev = elem;
[all...] |
| /xsrc/external/mit/xf86-video-amdgpu/dist/src/ |
| simple_list.h | 5 * Intended to work with a list sentinel which is created as an empty
6 * list. Insert & delete are O(1).
45 * Remove an element from list.
56 * Insert an element to the list head.
58 * \param list list.
61 #define insert_at_head(list, elem) \
63 (elem)->prev = list; \
64 (elem)->next = (list)->next; \
65 (list)->next->prev = elem;
[all...] |
| /xsrc/external/mit/xf86-video-ati/dist/src/ |
| simple_list.h | 5 * Intended to work with a list sentinal which is created as an empty
6 * list. Insert & delete are O(1).
46 * Remove an element from list.
57 * Insert an element to the list head.
59 * \param list list.
62 #define insert_at_head(list, elem) \
64 (elem)->prev = list; \
65 (elem)->next = (list)->next; \
66 (list)->next->prev = elem;
[all...] |
| /xsrc/external/mit/xf86-video-ati-kms/dist/src/ |
| simple_list.h | 5 * Intended to work with a list sentinel which is created as an empty
6 * list. Insert & delete are O(1).
46 * Remove an element from list.
57 * Insert an element to the list head.
59 * \param list list.
62 #define insert_at_head(list, elem) \
64 (elem)->prev = list; \
65 (elem)->next = (list)->next; \
66 (list)->next->prev = elem;
[all...] |
| /xsrc/external/mit/libxcb/dist/src/ |
| xcb_list.c | 26 /* A generic implementation of a list of void-pointers. */
52 _xcb_map *list; local
53 list = malloc(sizeof(_xcb_map));
54 if(!list)
56 list->head = 0;
57 list->tail = &list->head;
58 return list;
61 void _xcb_map_delete(_xcb_map *list, xcb_list_free_func_t do_free)
63 if(!list)
[all...] |
| /xsrc/external/mit/xauth/dist/tests/ |
| 020-xauth-add-local.script | 13 # List the number of entries added
14 xauth list | wc -l | xargs echo
17 xauth list unix:0 | awk '{print $3}'
18 xauth list 127.0.0.1:1 | awk '{print $3}'
19 xauth list 127.0.0.1:2 | awk '{print $3}'
20 xauth list 127.0.0.1:3.6 | awk '{print $3}'
21 xauth list :4 | awk '{print $3}'
|
| /xsrc/external/mit/xf86-video-intel/dist/src/ |
| intel_list.h | 36 * @file Classic doubly-link circular list implementation.
37 * For real usage examples of the linked list, see the file test/list.c
40 * We need to keep a list of struct foo in the parent struct bar, i.e. what
49 * We need one list head in bar and a list element in all list_of_foos (both are of
50 * data type 'struct list').
54 * struct list list_of_foos;
60 * struct list entry;
64 * Now we initialize the list head
114 struct list { struct
[all...] |
| /xsrc/external/mit/fontconfig/dist/src/ |
| fcptrlist.c | 33 FcPtrListEntry *list; member in struct:_FcPtrList
36 const FcPtrList *list; member in struct:_FcPtrListIterPrivate
49 ret->list = NULL;
56 FcPtrListDestroy (FcPtrList *list)
60 if (list)
62 FcPtrListIterInit (list, &iter);
65 if (FcPtrListIterGetValue (list, &iter))
66 list->destroy_func (FcPtrListIterGetValue (list, &iter));
67 FcPtrListIterRemove (list, &iter)
[all...] |
| /xsrc/external/mit/libdrm/dist/tests/ |
| drmsl.c | 1 /* drmsl.c -- Skip list test
30 * This file contains a straightforward skip list implementation.n
47 static void print(void* list)
52 if (drmSLFirst(list, &key, &value)) {
55 } while (drmSLNext(list, &key, &value));
61 void *list; local
71 list = drmSLCreate();
76 drmSLInsert(list, keys[i], NULL);
80 if (drmSLFirst(list, &key, &value)) {
86 } while (drmSLNext(list, &key, &value))
138 void* list; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/frontends/nine/ |
| nine_shader.h | 134 nine_shader_variant_get(struct nine_shader_variant *list,
139 while (list->key != key && list->next)
140 list = list->next;
141 if (list->key == key) {
142 *const_ranges = list->const_ranges;
143 *const_used_size = list->const_used_size;
144 return list->cso;
150 nine_shader_variant_add(struct nine_shader_variant *list,
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/state_trackers/nine/ |
| nine_shader.h | 127 nine_shader_variant_get(struct nine_shader_variant *list,
132 while (list->key != key && list->next)
133 list = list->next;
134 if (list->key == key) {
135 *const_ranges = list->const_ranges;
136 *const_used_size = list->const_used_size;
137 return list->cso;
143 nine_shader_variant_add(struct nine_shader_variant *list,
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/ |
| radeon_list.c | 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value)
49 if (*list == NULL) {
50 *list = new_value;
54 for (temp = *list; temp->Next; temp = temp->Next);
60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value)
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list)
76 while (list) {
78 list = list->Next
[all...] |
| radeon_list.h | 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value);
41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value);
42 unsigned int rc_list_count(struct rc_list * list);
43 void rc_list_print(struct rc_list * list);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/ |
| radeon_list.c | 45 void rc_list_add(struct rc_list ** list, struct rc_list * new_value)
49 if (*list == NULL) {
50 *list = new_value;
54 for (temp = *list; temp->Next; temp = temp->Next);
60 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value)
62 if (*list == rm_value) {
63 *list = rm_value->Next;
73 unsigned int rc_list_count(struct rc_list * list)
76 while (list) {
78 list = list->Next
[all...] |
| radeon_list.h | 40 void rc_list_add(struct rc_list ** list, struct rc_list * new_value);
41 void rc_list_remove(struct rc_list ** list, struct rc_list * rm_value);
42 unsigned int rc_list_count(struct rc_list * list);
43 void rc_list_print(struct rc_list * list);
|
| /xsrc/external/mit/libdrm/dist/tests/radeon/ |
| radeon_ttm.c | 37 struct list_head list; local
42 list_inithead(&list);
50 list_add(&bo->list, &list);
52 LIST_FOR_EACH_ENTRY_SAFE(bo, tmp, &list, list) {
53 list_del(&bo->list);
|
| /xsrc/external/mit/libXaw/dist/src/ |
| List.c | 26 * List.c - List widget
28 * This is a List widget. It allows the user to select an item in a list and
52 #define HeightFree(w) !(((ListWidget)(w))->list.freedoms & HeightLock)
53 #define WidthFree(w) !(((ListWidget)(w))->list.freedoms & WidthLock)
54 #define LongestFree(w) !(((ListWidget)(w))->list.freedoms & LongestLock)
106 offset(list.foreground),
124 offset(list.font),
133 offset(list.fontset)
[all...] |
| /xsrc/external/mit/freetype/dist/src/cache/ |
| ftcmru.c | 168 FTC_MruList_Init( FTC_MruList list,
174 list->num_nodes = 0;
175 list->max_nodes = max_nodes;
176 list->nodes = NULL;
177 list->clazz = *clazz;
178 list->data = data;
179 list->memory = memory;
184 FTC_MruList_Reset( FTC_MruList list )
186 while ( list->nodes )
187 FTC_MruList_Remove( list, list->nodes )
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/include/ |
| list.h | 29 /* classic doubly-link circular list */
30 struct list { struct
31 struct list *next, *prev;
35 list_init(struct list *list)
37 list->next = list->prev = list;
41 __list_add(struct list *entry,
42 struct list *prev
[all...] |
| /xsrc/external/mit/xf86-video-intel-2014/dist/src/ |
| intel_list.h | 36 * @file Classic doubly-link circular list implementation.
37 * For real usage examples of the linked list, see the file test/list.c
40 * We need to keep a list of struct foo in the parent struct bar, i.e. what
49 * We need one list head in bar and a list element in all list_of_foos (both are of
50 * data type 'struct list').
54 * struct list list_of_foos;
60 * struct list entry;
64 * Now we initialize the list head
114 struct list { struct
[all...] |
| /xsrc/external/mit/libX11/dist/src/xkb/ |
| XKBList.c | 105 XkbComponentListPtr list; local
190 list = _XkbTypedCalloc(1, XkbComponentListRec);
193 return list;
198 list = _XkbTypedCalloc(1, XkbComponentListRec);
199 if (!list) {
203 list->num_keymaps = rep.nKeymaps;
204 list->num_keycodes = rep.nKeycodes;
205 list->num_types = rep.nTypes;
206 list->num_compat = rep.nCompatMaps;
207 list->num_symbols = rep.nSymbols
[all...] |
| /xsrc/external/mit/libX11/dist/src/ |
| ListExt.c | 39 char **list = NULL; local
58 list = Xmallocarray (rep.nExtensions, sizeof (char *));
65 if ((!list) || (!ch)) {
66 Xfree(list);
82 list[i] = ch+1; /* skip over length */
88 Xfree(list);
90 list = NULL;
93 list[i] = NULL;
100 return (list);
104 XFreeExtensionList (char **list)
[all...] |
| /xsrc/external/mit/xorg-server/dist/include/ |
| optionstr.h | 3 #include "list.h"
6 GenericListRec list; member in struct:_InputOption
|
