Searched refs:prev (Results 1 - 25 of 857) sorted by relevance

1234567891011>>

/xsrc/external/mit/xorg-server.old/dist/hw/dmx/input/
H A DChkNotMaskEv.c72 register _XQEvent *prev, *qelt; local in function:XCheckNotMaskEvent
77 prev = NULL;
79 for (qelt = prev ? prev->next : dpy->head;
81 prev = qelt, qelt = qelt->next) {
85 _XDeq(dpy, prev, qelt);
90 if (prev)
91 qe_serial = prev->qserial_num;
100 if (prev && prev
[all...]
/xsrc/external/mit/libX11/dist/src/
H A DChkTypEv.c43 register _XQEvent *prev, *qelt; local in function:XCheckTypedEvent
52 prev = NULL;
54 for (qelt = prev ? prev->next : dpy->head;
56 prev = qelt, qelt = qelt->next) {
59 _XDeq(dpy, prev, qelt);
65 if (prev)
66 qe_serial = prev->qserial_num;
75 if (prev && prev
[all...]
H A DChkTypWEv.c44 register _XQEvent *prev, *qelt; local in function:XCheckTypedWindowEvent
53 prev = NULL;
55 for (qelt = prev ? prev->next : dpy->head;
57 prev = qelt, qelt = qelt->next) {
61 _XDeq(dpy, prev, qelt);
67 if (prev)
68 qe_serial = prev->qserial_num;
77 if (prev && prev
[all...]
H A DIfEvent.c48 register _XQEvent *qelt, *prev; local in function:XIfEvent
56 prev = NULL;
58 for (qelt = prev ? prev->next : dpy->head;
60 prev = qelt, qelt = qelt->next) {
64 _XDeq(dpy, prev, qelt);
71 if (prev)
72 qe_serial = prev->qserial_num;
74 if (prev && prev
[all...]
H A Dutlist.h38 * To use doubly-linked lists, your structure must "prev" and "next" pointers.
44 * struct item *prev, *next;
69 (add)->prev = (head)->prev; \
70 (head)->prev = (add); \
72 (add)->prev = (add); \
80 (add)->prev = (head)->prev; \
81 (head)->prev->next = (add); \
82 (head)->prev
[all...]
H A DPeekIfEv.c49 register _XQEvent *prev, *qelt; local in function:XPeekIfEvent
57 prev = NULL;
59 for (qelt = prev ? prev->next : dpy->head;
61 prev = qelt, qelt = qelt->next) {
75 if (prev)
76 qe_serial = prev->qserial_num;
78 if (prev && prev->qserial_num != qe_serial)
80 prev
[all...]
H A DChkIfEv.c48 register _XQEvent *prev, *qelt; local in function:XCheckIfEvent
57 prev = NULL;
59 for (qelt = prev ? prev->next : dpy->head;
61 prev = qelt, qelt = qelt->next) {
65 _XDeq(dpy, prev, qelt);
72 if (prev)
73 qe_serial = prev->qserial_num;
82 if (prev && prev
[all...]
H A DChkMaskEv.c49 register _XQEvent *prev, *qelt; local in function:XCheckMaskEvent
58 prev = NULL;
60 for (qelt = prev ? prev->next : dpy->head;
62 prev = qelt, qelt = qelt->next) {
69 _XDeq(dpy, prev, qelt);
74 if (prev)
75 qe_serial = prev->qserial_num;
84 if (prev && prev
[all...]
H A DChkWinEv.c49 register _XQEvent *prev, *qelt; local in function:XCheckWindowEvent
58 prev = NULL;
60 for (qelt = prev ? prev->next : dpy->head;
62 prev = qelt, qelt = qelt->next) {
70 _XDeq(dpy, prev, qelt);
75 if (prev)
76 qe_serial = prev->qserial_num;
85 if (prev && prev
[all...]
H A DMaskEvent.c49 register _XQEvent *prev, *qelt; local in function:XMaskEvent
57 prev = NULL;
59 for (qelt = prev ? prev->next : dpy->head;
61 prev = qelt, qelt = qelt->next) {
68 _XDeq(dpy, prev, qelt);
73 if (prev)
74 qe_serial = prev->qserial_num;
76 if (prev && prev
[all...]
H A DWinEvent.c52 register _XQEvent *prev, *qelt; local in function:XWindowEvent
60 prev = NULL;
62 for (qelt = prev ? prev->next : dpy->head;
64 prev = qelt, qelt = qelt->next) {
72 _XDeq(dpy, prev, qelt);
77 if (prev)
78 qe_serial = prev->qserial_num;
80 if (prev && prev
[all...]
/xsrc/external/mit/xf86-video-vmware/dist/vmwgfx/
H A Dwsbm_util.h17 struct _WsbmListHead *prev; member in struct:_WsbmListHead
23 (__item)->prev = (__item); \
29 (__item)->prev = (__list); \
31 (__list)->next->prev = (__item); \
38 (__item)->prev = (__list)->prev; \
39 (__list)->prev->next = (__item); \
40 (__list)->prev = (__item); \
45 (__item)->prev->next = (__item)->next; \
46 (__item)->next->prev
[all...]
/xsrc/external/mit/xorg-server/dist/hw/kdrive/src/
H A Dkinfo.c33 KdCardInfo *ci, **prev; local in function:KdCardInfoAdd
38 for (prev = &kdCardInfo; *prev; prev = &(*prev)->next);
39 *prev = ci;
62 KdCardInfo **prev; local in function:KdCardInfoDispose
64 for (prev = &kdCardInfo; *prev; prev
75 KdScreenInfo *si, **prev; local in function:KdScreenInfoAdd
93 KdScreenInfo **prev; local in function:KdScreenInfoDispose
[all...]
/xsrc/external/mit/libdrm/dist/
H A Dlibdrm_lists.h36 struct _drmMMListHead *prev; member in struct:_drmMMListHead
42 (__item)->prev = (__item); \
48 (__item)->prev = (__list); \
50 (__list)->next->prev = (__item); \
57 (__item)->prev = (__list)->prev; \
58 (__list)->prev->next = (__item); \
59 (__list)->prev = (__item); \
64 (__item)->prev->next = (__item)->next; \
65 (__item)->next->prev
[all...]
H A Dutil_double_list.h43 struct list_head *prev; member in struct:list_head
49 item->prev = item;
55 item->prev = list;
57 list->next->prev = item;
64 item->prev = list->prev;
65 list->prev->next = item;
66 list->prev = item;
71 to->prev = from->prev;
[all...]
/xsrc/external/mit/xf86-video-intel/dist/src/
H A Dintel_list.h115 struct list *next, *prev; member in struct:list
129 list->next = list->prev = list;
134 struct list *prev,
137 next->prev = entry;
139 entry->prev = prev;
140 prev->next = entry;
167 __list_add(entry, head->prev, head);
174 new->next->prev = new;
175 new->prev
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/hw/kdrive/src/
H A Dkinfo.c34 KdCardInfo *ci, **prev; local in function:KdCardInfoAdd
39 for (prev = &kdCardInfo; *prev; prev = &(*prev)->next);
40 *prev = ci;
63 KdCardInfo **prev; local in function:KdCardInfoDispose
65 for (prev = &kdCardInfo; *prev; prev
77 KdScreenInfo *si, **prev; local in function:KdScreenInfoAdd
95 KdScreenInfo **prev; local in function:KdScreenInfoDispose
137 InputOption *option, *prev = NULL; local in function:KdFreePointer
[all...]
/xsrc/external/mit/ctwm/dist/
H A Dwin_ring.c5 * - 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
28 TwmWindow *prev = win->ring.prev; local in function:UnlinkWindowFromRing
38 // But if it is, prev/next should always exist.
39 assert(prev != NULL);
47 * If the window is the only one in the ring, prev == next == win,
50 prev->ring.next = next;
51 next->ring.prev = prev;
[all...]
/xsrc/external/mit/xf86-video-intel-2014/dist/src/
H A Dintel_list.h115 struct list *next, *prev; member in struct:list
129 list->next = list->prev = list;
134 struct list *prev,
137 next->prev = entry;
139 entry->prev = prev;
140 prev->next = entry;
167 __list_add(entry, head->prev, head);
174 new->next->prev = new;
175 new->prev
133 __list_add(struct list * entry,struct list * prev,struct list * next) argument
208 __list_del(struct list * prev,struct list * next) argument
[all...]
/xsrc/external/mit/xf86-video-amdgpu/dist/src/
H A Dsimple_list.h41 struct simple_node *prev; member in struct:simple_node
51 (elem)->next->prev = (elem)->prev; \
52 (elem)->prev->next = (elem)->next; \
63 (elem)->prev = list; \
65 (list)->next->prev = elem; \
78 (elem)->prev = (list)->prev; \
79 (list)->prev->next = elem; \
80 (list)->prev
[all...]
/xsrc/external/mit/xf86-video-ati/dist/src/
H A Dsimple_list.h42 struct simple_node *prev; member in struct:simple_node
52 (elem)->next->prev = (elem)->prev; \
53 (elem)->prev->next = (elem)->next; \
64 (elem)->prev = list; \
66 (list)->next->prev = elem; \
79 (elem)->prev = (list)->prev; \
80 (list)->prev->next = elem; \
81 (list)->prev
[all...]
/xsrc/external/mit/xf86-video-ati-kms/dist/src/
H A Dsimple_list.h42 struct simple_node *prev; member in struct:simple_node
52 (elem)->next->prev = (elem)->prev; \
53 (elem)->prev->next = (elem)->next; \
64 (elem)->prev = list; \
66 (list)->next->prev = elem; \
79 (elem)->prev = (list)->prev; \
80 (list)->prev->next = elem; \
81 (list)->prev
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/util/
H A Dsimple_list.h46 struct simple_node *prev; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->prev = list; \
71 (list)->next->prev = elem; \
84 (elem)->prev = (list)->prev; \
85 (list)->prev->next = elem; \
86 (list)->prev
[all...]
/xsrc/external/mit/MesaLib/dist/src/util/
H A Dsimple_list.h46 struct simple_node *prev; member in struct:simple_node
56 (elem)->next->prev = (elem)->prev; \
57 (elem)->prev->next = (elem)->next; \
69 (elem)->prev = list; \
71 (list)->next->prev = elem; \
84 (elem)->prev = (list)->prev; \
85 (list)->prev->next = elem; \
86 (list)->prev
[all...]
/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_opt_barriers.c33 nir_intrinsic_instr *prev = NULL; local in function:nir_opt_combine_memory_barriers_impl
37 prev = NULL;
44 prev = NULL;
48 if (prev && combine_cb(prev, current, data)) {
52 prev = current;

Completed in 28 milliseconds

1234567891011>>