1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
|
/*
* Copyright (C) 2001-2004 Bart Massey and Jamey Sharp.
* All Rights Reserved.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
* Except as contained in this notice, the names of the authors or their
* institutions shall not be used in advertising or otherwise to promote the
* sale, use or other dealings in this Software without prior written
* authorization from the authors.
*/
#ifndef __XCBINT_H
#define __XCBINT_H
/* Not simply (a <= b) because eventually the 32-bit sequence number
* will wrap, causing earlier sequence numbers to be higher than later
* ones for a brief but fatal period. (a and b must be unsigned.) */
#define _xcb_assert_sequence_less(a,b) assert((b) - (a) < 65536)
#define _xcb_assert_valid_sequence(c) do { \
_xcb_assert_sequence_less((c)->in.request_read, (c)->out.request_written); \
_xcb_assert_sequence_less((c)->out.request_written, (c)->out.request); \
} while(0)
enum workarounds {
WORKAROUND_NONE,
WORKAROUND_GLX_GET_FB_CONFIGS_BUG
};
/* xcb_list.c */
typedef struct _xcb_list _xcb_list;
typedef void (*XCBListFreeFunc)(void *);
_xcb_list *_xcb_list_new(void);
void _xcb_list_delete(_xcb_list *list, XCBListFreeFunc do_free);
int _xcb_list_insert(_xcb_list *list, void *data);
int _xcb_list_append(_xcb_list *list, void *data);
void *_xcb_list_peek_head(_xcb_list *list);
void *_xcb_list_remove_head(_xcb_list *list);
void *_xcb_list_remove(_xcb_list *list, int (*cmp)(const void *, const void *), const void *data);
void *_xcb_list_find(_xcb_list *list, int (*cmp)(const void *, const void *), const void *data);
typedef _xcb_list _xcb_queue;
_xcb_queue *_xcb_queue_new(void);
void _xcb_queue_delete(_xcb_queue *q, XCBListFreeFunc do_free);
int _xcb_queue_enqueue(_xcb_queue *q, void *data);
void *_xcb_queue_dequeue(_xcb_queue *q);
int _xcb_queue_is_empty(_xcb_queue *q);
typedef _xcb_list _xcb_map;
_xcb_map *_xcb_map_new(void);
void _xcb_map_delete(_xcb_map *q, XCBListFreeFunc do_free);
int _xcb_map_put(_xcb_map *q, unsigned int key, void *data);
void *_xcb_map_get(_xcb_map *q, unsigned int key);
void *_xcb_map_remove(_xcb_map *q, unsigned int key);
/* xcb_util.c */
/* Index of nearest 4-byte boundary following E. */
#define XCB_CEIL(E) (((E)+3)&~3)
#define XCB_PAD(i) ((4 - (i & 3)) & 3)
int _xcb_set_fd_flags(const int fd);
int _xcb_readn(const int fd, void *buf, const int buflen, int *count);
int _xcb_read_block(const int fd, void *buf, const size_t len);
int _xcb_write(const int fd, char (*buf)[], int *count);
int _xcb_writev(const int fd, struct iovec *vec, int count);
/* xcb_out.c */
typedef struct _xcb_out {
pthread_cond_t cond;
int writing;
char queue[4096];
int queue_len;
struct iovec *vec;
int vec_len;
void *last_request;
unsigned int request;
unsigned int request_written;
pthread_mutex_t reqlenlock;
CARD32 maximum_request_length;
} _xcb_out;
int _xcb_out_init(_xcb_out *out);
void _xcb_out_destroy(_xcb_out *out);
int _xcb_out_write(XCBConnection *c);
int _xcb_out_write_block(XCBConnection *c, struct iovec *vector, size_t count);
int _xcb_out_flush(XCBConnection *c);
/* xcb_in.c */
typedef struct _xcb_in {
pthread_cond_t event_cond;
int reading;
char queue[4096];
int queue_len;
unsigned int request_read;
_xcb_queue *current_reply;
_xcb_map *replies;
_xcb_queue *events;
_xcb_list *readers;
_xcb_queue *pending_replies;
} _xcb_in;
int _xcb_in_init(_xcb_in *in);
void _xcb_in_destroy(_xcb_in *in);
int _xcb_in_expect_reply(XCBConnection *c, unsigned int request, enum workarounds workaround);
int _xcb_in_read_packet(XCBConnection *c);
int _xcb_in_read(XCBConnection *c);
int _xcb_in_read_block(XCBConnection *c, void *buf, int nread);
/* xcb_xid.c */
typedef struct _xcb_xid {
pthread_mutex_t lock;
CARD32 last;
CARD32 base;
CARD32 max;
CARD32 inc;
} _xcb_xid;
int _xcb_xid_init(XCBConnection *c);
void _xcb_xid_destroy(XCBConnection *c);
/* xcb_ext.c */
typedef struct _xcb_ext {
pthread_mutex_t lock;
_xcb_map *extensions;
} _xcb_ext;
int _xcb_ext_init(XCBConnection *c);
void _xcb_ext_destroy(XCBConnection *c);
/* xcb_conn.c */
struct XCBConnection {
/* constant data */
XCBConnSetupSuccessRep *setup;
int fd;
/* I/O data */
pthread_mutex_t iolock;
_xcb_in in;
_xcb_out out;
/* misc data */
_xcb_ext ext;
_xcb_xid xid;
};
int _xcb_conn_wait(XCBConnection *c, const int should_write, pthread_cond_t *cond);
#endif
|
