Commit | Line | Data |
---|---|---|
b5a0ac70 | 1 | /* Event loop machinery for GDB, the GNU debugger. |
b6ba6518 | 2 | Copyright 1999, 2000, 2001 Free Software Foundation, Inc. |
b5a0ac70 SS |
3 | Written by Elena Zannoni <ezannoni@cygnus.com> of Cygnus Solutions. |
4 | ||
5 | This file is part of GDB. | |
6 | ||
7 | This program is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 2 of the License, or | |
10 | (at your option) any later version. | |
11 | ||
12 | This program is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with this program; if not, write to the Free Software | |
c5aa993b JM |
19 | Foundation, Inc., 59 Temple Place - Suite 330, |
20 | Boston, MA 02111-1307, USA. */ | |
b5a0ac70 | 21 | |
b5a0ac70 | 22 | #include "defs.h" |
9e0b60a8 JM |
23 | #include "top.h" |
24 | #include "event-loop.h" | |
c2c6d25f | 25 | #include "event-top.h" |
409a3f64 | 26 | |
b5a0ac70 | 27 | #ifdef HAVE_POLL |
409a3f64 | 28 | #if defined (HAVE_POLL_H) |
9e0b60a8 | 29 | #include <poll.h> |
409a3f64 AC |
30 | #elif defined (HAVE_SYS_POLL_H) |
31 | #include <sys/poll.h> | |
32 | #endif | |
44f45770 | 33 | #endif |
409a3f64 | 34 | |
9e0b60a8 | 35 | #include <sys/types.h> |
27b82ed2 | 36 | #include "gdb_string.h" |
b5a0ac70 | 37 | #include <errno.h> |
c2c6d25f JM |
38 | #include <sys/time.h> |
39 | ||
40 | /* Type of the mask arguments to select. */ | |
41 | ||
58a2c44a EZ |
42 | #ifndef HAVE_POLL |
43 | #ifdef NO_FD_SET | |
44 | /* All this stuff below is not required if select is used as God(tm) | |
45 | intended, with the FD_* macros. Are there any implementations of | |
46 | select which don't have FD_SET and other standard FD_* macros? I | |
47 | don't think there are, but if I'm wrong, we need to catch them. */ | |
48 | #error FD_SET must be defined if select function is to be used! | |
49 | ||
c2c6d25f JM |
50 | #ifndef _AIX |
51 | typedef long fd_mask; | |
52 | #endif | |
53 | #if defined(_IBMR2) | |
54 | #define SELECT_MASK void | |
55 | #else | |
56 | #define SELECT_MASK int | |
58a2c44a | 57 | #endif /* !_IBMR2 */ |
c2c6d25f JM |
58 | |
59 | /* Define "NBBY" (number of bits per byte) if it's not already defined. */ | |
60 | ||
61 | #ifndef NBBY | |
62 | #define NBBY 8 | |
63 | #endif | |
64 | ||
c2c6d25f JM |
65 | /* Define the number of fd_masks in an fd_set */ |
66 | ||
67 | #ifndef FD_SETSIZE | |
68 | #ifdef OPEN_MAX | |
69 | #define FD_SETSIZE OPEN_MAX | |
70 | #else | |
71 | #define FD_SETSIZE 256 | |
72 | #endif | |
73 | #endif | |
74 | #if !defined(howmany) | |
75 | #define howmany(x, y) (((x)+((y)-1))/(y)) | |
76 | #endif | |
77 | #ifndef NFDBITS | |
78 | #define NFDBITS NBBY*sizeof(fd_mask) | |
79 | #endif | |
80 | #define MASK_SIZE howmany(FD_SETSIZE, NFDBITS) | |
81 | ||
58a2c44a EZ |
82 | #endif /* NO_FD_SET */ |
83 | #endif /* !HAVE_POLL */ | |
84 | ||
c2c6d25f JM |
85 | |
86 | typedef struct gdb_event gdb_event; | |
87 | typedef void (event_handler_func) (int); | |
88 | ||
89 | /* Event for the GDB event system. Events are queued by calling | |
90 | async_queue_event and serviced later on by gdb_do_one_event. An | |
91 | event can be, for instance, a file descriptor becoming ready to be | |
92 | read. Servicing an event simply means that the procedure PROC will | |
93 | be called. We have 2 queues, one for file handlers that we listen | |
94 | to in the event loop, and one for the file handlers+events that are | |
95 | ready. The procedure PROC associated with each event is always the | |
96 | same (handle_file_event). Its duty is to invoke the handler | |
97 | associated with the file descriptor whose state change generated | |
fd0e48ca | 98 | the event, plus doing other cleanups and such. */ |
c2c6d25f JM |
99 | |
100 | struct gdb_event | |
101 | { | |
102 | event_handler_func *proc; /* Procedure to call to service this event. */ | |
103 | int fd; /* File descriptor that is ready. */ | |
104 | struct gdb_event *next_event; /* Next in list of events or NULL. */ | |
105 | }; | |
106 | ||
107 | /* Information about each file descriptor we register with the event | |
108 | loop. */ | |
109 | ||
110 | typedef struct file_handler | |
111 | { | |
112 | int fd; /* File descriptor. */ | |
113 | int mask; /* Events we want to monitor: POLLIN, etc. */ | |
114 | int ready_mask; /* Events that have been seen since | |
115 | the last time. */ | |
6426a772 | 116 | handler_func *proc; /* Procedure to call when fd is ready. */ |
c2c6d25f | 117 | gdb_client_data client_data; /* Argument to pass to proc. */ |
6426a772 | 118 | int error; /* Was an error detected on this fd? */ |
c2c6d25f JM |
119 | struct file_handler *next_file; /* Next registered file descriptor. */ |
120 | } | |
121 | file_handler; | |
122 | ||
123 | /* PROC is a function to be invoked when the READY flag is set. This | |
124 | happens when there has been a signal and the corresponding signal | |
125 | handler has 'triggered' this async_signal_handler for | |
126 | execution. The actual work to be done in response to a signal will | |
127 | be carried out by PROC at a later time, within process_event. This | |
128 | provides a deferred execution of signal handlers. | |
129 | Async_init_signals takes care of setting up such an | |
130 | asyn_signal_handler for each interesting signal. */ | |
131 | typedef struct async_signal_handler | |
132 | { | |
133 | int ready; /* If ready, call this handler from the main event loop, | |
134 | using invoke_async_handler. */ | |
135 | struct async_signal_handler *next_handler; /* Ptr to next handler */ | |
6426a772 | 136 | sig_handler_func *proc; /* Function to call to do the work */ |
c2c6d25f JM |
137 | gdb_client_data client_data; /* Argument to async_handler_func */ |
138 | } | |
139 | async_signal_handler; | |
140 | ||
b5a0ac70 SS |
141 | |
142 | /* Event queue: | |
143 | - the first event in the queue is the head of the queue. | |
144 | It will be the next to be serviced. | |
145 | - the last event in the queue | |
146 | ||
147 | Events can be inserted at the front of the queue or at the end of | |
148 | the queue. Events will be extracted from the queue for processing | |
149 | starting from the head. Therefore, events inserted at the head of | |
adf40b2e | 150 | the queue will be processed in a last in first out fashion, while |
b5a0ac70 SS |
151 | those inserted at the tail of the queue will be processed in a first |
152 | in first out manner. All the fields are NULL if the queue is | |
153 | empty. */ | |
154 | ||
155 | static struct | |
156 | { | |
157 | gdb_event *first_event; /* First pending event */ | |
158 | gdb_event *last_event; /* Last pending event */ | |
159 | } | |
160 | event_queue; | |
161 | ||
162 | /* Gdb_notifier is just a list of file descriptors gdb is interested in. | |
163 | These are the input file descriptor, and the target file | |
164 | descriptor. We have two flavors of the notifier, one for platforms | |
165 | that have the POLL function, the other for those that don't, and | |
166 | only support SELECT. Each of the elements in the gdb_notifier list is | |
167 | basically a description of what kind of events gdb is interested | |
168 | in, for each fd. */ | |
169 | ||
392a587b | 170 | /* As of 1999-04-30 only the input file descriptor is registered with the |
b5a0ac70 SS |
171 | event loop. */ |
172 | ||
44f45770 | 173 | /* Do we use poll or select ? */ |
b5a0ac70 | 174 | #ifdef HAVE_POLL |
44f45770 EZ |
175 | #define USE_POLL 1 |
176 | #else | |
177 | #define USE_POLL 0 | |
178 | #endif /* HAVE_POLL */ | |
179 | ||
180 | static unsigned char use_poll = USE_POLL; | |
b5a0ac70 SS |
181 | |
182 | static struct | |
183 | { | |
184 | /* Ptr to head of file handler list. */ | |
185 | file_handler *first_file_handler; | |
186 | ||
44f45770 | 187 | #ifdef HAVE_POLL |
b5a0ac70 SS |
188 | /* Ptr to array of pollfd structures. */ |
189 | struct pollfd *poll_fds; | |
190 | ||
c2c6d25f | 191 | /* Timeout in milliseconds for calls to poll(). */ |
44f45770 EZ |
192 | int poll_timeout; |
193 | #endif | |
b5a0ac70 SS |
194 | |
195 | /* Masks to be used in the next call to select. | |
196 | Bits are set in response to calls to create_file_handler. */ | |
58a2c44a | 197 | fd_set check_masks[3]; |
b5a0ac70 SS |
198 | |
199 | /* What file descriptors were found ready by select. */ | |
58a2c44a | 200 | fd_set ready_masks[3]; |
b5a0ac70 | 201 | |
44f45770 EZ |
202 | /* Number of file descriptors to monitor. (for poll) */ |
203 | /* Number of valid bits (highest fd value + 1). (for select) */ | |
b5a0ac70 SS |
204 | int num_fds; |
205 | ||
c2c6d25f | 206 | /* Time structure for calls to select(). */ |
44f45770 | 207 | struct timeval select_timeout; |
c2c6d25f | 208 | |
44f45770 | 209 | /* Flag to tell whether the timeout should be used. */ |
c2c6d25f | 210 | int timeout_valid; |
6426a772 | 211 | } |
b5a0ac70 SS |
212 | gdb_notifier; |
213 | ||
c2c6d25f JM |
214 | /* Structure associated with a timer. PROC will be executed at the |
215 | first occasion after WHEN. */ | |
216 | struct gdb_timer | |
217 | { | |
218 | struct timeval when; | |
219 | int timer_id; | |
220 | struct gdb_timer *next; | |
6426a772 JM |
221 | timer_handler_func *proc; /* Function to call to do the work */ |
222 | gdb_client_data client_data; /* Argument to async_handler_func */ | |
c2c6d25f JM |
223 | } |
224 | gdb_timer; | |
225 | ||
226 | /* List of currently active timers. It is sorted in order of | |
6426a772 | 227 | increasing timers. */ |
c2c6d25f JM |
228 | static struct |
229 | { | |
230 | /* Pointer to first in timer list. */ | |
231 | struct gdb_timer *first_timer; | |
232 | ||
2acceee2 | 233 | /* Id of the last timer created. */ |
c2c6d25f JM |
234 | int num_timers; |
235 | } | |
236 | timer_list; | |
237 | ||
b5a0ac70 SS |
238 | /* All the async_signal_handlers gdb is interested in are kept onto |
239 | this list. */ | |
240 | static struct | |
241 | { | |
242 | /* Pointer to first in handler list. */ | |
c5aa993b JM |
243 | async_signal_handler *first_handler; |
244 | ||
b5a0ac70 | 245 | /* Pointer to last in handler list. */ |
c5aa993b | 246 | async_signal_handler *last_handler; |
b5a0ac70 SS |
247 | } |
248 | sighandler_list; | |
249 | ||
fd0e48ca | 250 | /* Are any of the handlers ready? Check this variable using |
b5a0ac70 SS |
251 | check_async_ready. This is used by process_event, to determine |
252 | whether or not to invoke the invoke_async_signal_handler | |
253 | function. */ | |
254 | static int async_handler_ready = 0; | |
255 | ||
6426a772 | 256 | static void create_file_handler (int fd, int mask, handler_func * proc, gdb_client_data client_data); |
c2c6d25f JM |
257 | static void invoke_async_signal_handler (void); |
258 | static void handle_file_event (int event_file_desc); | |
259 | static int gdb_wait_for_event (void); | |
11cf8741 | 260 | static int gdb_do_one_event (void *data); |
c2c6d25f | 261 | static int check_async_ready (void); |
6426a772 JM |
262 | static void async_queue_event (gdb_event * event_ptr, queue_position position); |
263 | static gdb_event *create_file_event (int fd); | |
c2c6d25f JM |
264 | static int process_event (void); |
265 | static void handle_timer_event (int dummy); | |
266 | static void poll_timers (void); | |
b5a0ac70 SS |
267 | \f |
268 | ||
269 | /* Insert an event object into the gdb event queue at | |
270 | the specified position. | |
271 | POSITION can be head or tail, with values TAIL, HEAD. | |
272 | EVENT_PTR points to the event to be inserted into the queue. | |
273 | The caller must allocate memory for the event. It is freed | |
274 | after the event has ben handled. | |
275 | Events in the queue will be processed head to tail, therefore, | |
276 | events inserted at the head of the queue will be processed | |
277 | as last in first out. Event appended at the tail of the queue | |
278 | will be processed first in first out. */ | |
279 | static void | |
6426a772 | 280 | async_queue_event (gdb_event * event_ptr, queue_position position) |
b5a0ac70 SS |
281 | { |
282 | if (position == TAIL) | |
283 | { | |
284 | /* The event will become the new last_event. */ | |
285 | ||
286 | event_ptr->next_event = NULL; | |
287 | if (event_queue.first_event == NULL) | |
288 | event_queue.first_event = event_ptr; | |
289 | else | |
290 | event_queue.last_event->next_event = event_ptr; | |
291 | event_queue.last_event = event_ptr; | |
292 | } | |
293 | else if (position == HEAD) | |
294 | { | |
295 | /* The event becomes the new first_event. */ | |
296 | ||
297 | event_ptr->next_event = event_queue.first_event; | |
298 | if (event_queue.first_event == NULL) | |
299 | event_queue.last_event = event_ptr; | |
300 | event_queue.first_event = event_ptr; | |
301 | } | |
302 | } | |
303 | ||
cff3e48b JM |
304 | /* Create a file event, to be enqueued in the event queue for |
305 | processing. The procedure associated to this event is always | |
306 | handle_file_event, which will in turn invoke the one that was | |
307 | associated to FD when it was registered with the event loop. */ | |
c2c6d25f JM |
308 | static gdb_event * |
309 | create_file_event (int fd) | |
cff3e48b JM |
310 | { |
311 | gdb_event *file_event_ptr; | |
312 | ||
313 | file_event_ptr = (gdb_event *) xmalloc (sizeof (gdb_event)); | |
314 | file_event_ptr->proc = handle_file_event; | |
315 | file_event_ptr->fd = fd; | |
316 | return (file_event_ptr); | |
317 | } | |
318 | ||
b5a0ac70 SS |
319 | /* Process one event. |
320 | The event can be the next one to be serviced in the event queue, | |
321 | or an asynchronous event handler can be invoked in response to | |
322 | the reception of a signal. | |
323 | If an event was processed (either way), 1 is returned otherwise | |
324 | 0 is returned. | |
325 | Scan the queue from head to tail, processing therefore the high | |
326 | priority events first, by invoking the associated event handler | |
327 | procedure. */ | |
328 | static int | |
c2c6d25f | 329 | process_event (void) |
b5a0ac70 SS |
330 | { |
331 | gdb_event *event_ptr, *prev_ptr; | |
332 | event_handler_func *proc; | |
333 | int fd; | |
334 | ||
335 | /* First let's see if there are any asynchronous event handlers that | |
336 | are ready. These would be the result of invoking any of the | |
337 | signal handlers. */ | |
338 | ||
339 | if (check_async_ready ()) | |
340 | { | |
341 | invoke_async_signal_handler (); | |
342 | return 1; | |
343 | } | |
344 | ||
345 | /* Look in the event queue to find an event that is ready | |
346 | to be processed. */ | |
347 | ||
348 | for (event_ptr = event_queue.first_event; event_ptr != NULL; | |
349 | event_ptr = event_ptr->next_event) | |
350 | { | |
351 | /* Call the handler for the event. */ | |
352 | ||
353 | proc = event_ptr->proc; | |
354 | fd = event_ptr->fd; | |
355 | ||
356 | /* Let's get rid of the event from the event queue. We need to | |
357 | do this now because while processing the event, the proc | |
358 | function could end up calling 'error' and therefore jump out | |
359 | to the caller of this function, gdb_do_one_event. In that | |
360 | case, we would have on the event queue an event wich has been | |
361 | processed, but not deleted. */ | |
362 | ||
363 | if (event_queue.first_event == event_ptr) | |
364 | { | |
365 | event_queue.first_event = event_ptr->next_event; | |
366 | if (event_ptr->next_event == NULL) | |
367 | event_queue.last_event = NULL; | |
368 | } | |
369 | else | |
370 | { | |
371 | prev_ptr = event_queue.first_event; | |
372 | while (prev_ptr->next_event != event_ptr) | |
373 | prev_ptr = prev_ptr->next_event; | |
374 | ||
375 | prev_ptr->next_event = event_ptr->next_event; | |
376 | if (event_ptr->next_event == NULL) | |
377 | event_queue.last_event = prev_ptr; | |
378 | } | |
b8c9b27d | 379 | xfree (event_ptr); |
b5a0ac70 | 380 | |
44f45770 | 381 | /* Now call the procedure associated with the event. */ |
b5a0ac70 SS |
382 | (*proc) (fd); |
383 | return 1; | |
384 | } | |
385 | ||
386 | /* this is the case if there are no event on the event queue. */ | |
387 | return 0; | |
388 | } | |
389 | ||
390 | /* Process one high level event. If nothing is ready at this time, | |
391 | wait for something to happen (via gdb_wait_for_event), then process | |
11cf8741 JM |
392 | it. Returns >0 if something was done otherwise returns <0 (this |
393 | can happen if there are no event sources to wait for). If an error | |
fd0e48ca | 394 | occurs catch_errors() which calls this function returns zero. */ |
11cf8741 | 395 | |
085dd6e6 | 396 | static int |
11cf8741 | 397 | gdb_do_one_event (void *data) |
b5a0ac70 | 398 | { |
11cf8741 JM |
399 | /* Any events already waiting in the queue? */ |
400 | if (process_event ()) | |
401 | { | |
402 | return 1; | |
403 | } | |
7e5cd2de | 404 | |
11cf8741 JM |
405 | /* Are any timers that are ready? If so, put an event on the queue. */ |
406 | poll_timers (); | |
7e5cd2de | 407 | |
11cf8741 JM |
408 | /* Wait for a new event. If gdb_wait_for_event returns -1, |
409 | we should get out because this means that there are no | |
410 | event sources left. This will make the event loop stop, | |
411 | and the application exit. */ | |
7e5cd2de | 412 | |
11cf8741 JM |
413 | if (gdb_wait_for_event () < 0) |
414 | { | |
415 | return -1; | |
416 | } | |
7e5cd2de | 417 | |
11cf8741 JM |
418 | /* Handle any new events occurred while waiting. */ |
419 | if (process_event ()) | |
420 | { | |
421 | return 1; | |
422 | } | |
7e5cd2de | 423 | |
11cf8741 JM |
424 | /* If gdb_wait_for_event has returned 1, it means that one |
425 | event has been handled. We break out of the loop. */ | |
426 | return 1; | |
427 | } | |
428 | ||
429 | /* Start up the event loop. This is the entry point to the event loop | |
430 | from the command loop. */ | |
b5a0ac70 | 431 | |
11cf8741 JM |
432 | void |
433 | start_event_loop (void) | |
434 | { | |
435 | /* Loop until there is nothing to do. This is the entry point to the | |
436 | event loop engine. gdb_do_one_event, called via catch_errors() | |
437 | will process one event for each invocation. It blocks waits for | |
438 | an event and then processes it. >0 when an event is processed, 0 | |
439 | when catch_errors() caught an error and <0 when there are no | |
440 | longer any event sources registered. */ | |
b5a0ac70 SS |
441 | while (1) |
442 | { | |
11cf8741 JM |
443 | int result = catch_errors (gdb_do_one_event, 0, "", RETURN_MASK_ALL); |
444 | if (result < 0) | |
445 | break; | |
446 | if (result == 0) | |
b5a0ac70 | 447 | { |
085dd6e6 JM |
448 | /* FIXME: this should really be a call to a hook that is |
449 | interface specific, because interfaces can display the | |
450 | prompt in their own way. */ | |
b5a0ac70 SS |
451 | display_gdb_prompt (0); |
452 | /* Maybe better to set a flag to be checked somewhere as to | |
453 | whether display the prompt or not. */ | |
454 | } | |
455 | } | |
085dd6e6 JM |
456 | |
457 | /* We are done with the event loop. There are no more event sources | |
458 | to listen to. So we exit GDB. */ | |
459 | return; | |
460 | } | |
b5a0ac70 SS |
461 | \f |
462 | ||
085dd6e6 JM |
463 | /* Wrapper function for create_file_handler, so that the caller |
464 | doesn't have to know implementation details about the use of poll | |
465 | vs. select. */ | |
c5aa993b | 466 | void |
6426a772 | 467 | add_file_handler (int fd, handler_func * proc, gdb_client_data client_data) |
085dd6e6 JM |
468 | { |
469 | #ifdef HAVE_POLL | |
44f45770 EZ |
470 | struct pollfd fds; |
471 | #endif | |
472 | ||
473 | if (use_poll) | |
474 | { | |
475 | #ifdef HAVE_POLL | |
476 | /* Check to see if poll () is usable. If not, we'll switch to | |
7e5cd2de EZ |
477 | use select. This can happen on systems like |
478 | m68k-motorola-sys, `poll' cannot be used to wait for `stdin'. | |
479 | On m68k-motorola-sysv, tty's are not stream-based and not | |
480 | `poll'able. */ | |
481 | fds.fd = fd; | |
482 | fds.events = POLLIN; | |
483 | if (poll (&fds, 1, 0) == 1 && (fds.revents & POLLNVAL)) | |
484 | use_poll = 0; | |
44f45770 | 485 | #else |
8e65ff28 AC |
486 | internal_error (__FILE__, __LINE__, |
487 | "use_poll without HAVE_POLL"); | |
44f45770 EZ |
488 | #endif /* HAVE_POLL */ |
489 | } | |
490 | if (use_poll) | |
491 | { | |
492 | #ifdef HAVE_POLL | |
493 | create_file_handler (fd, POLLIN, proc, client_data); | |
085dd6e6 | 494 | #else |
8e65ff28 AC |
495 | internal_error (__FILE__, __LINE__, |
496 | "use_poll without HAVE_POLL"); | |
085dd6e6 | 497 | #endif |
44f45770 EZ |
498 | } |
499 | else | |
500 | create_file_handler (fd, GDB_READABLE | GDB_EXCEPTION, proc, client_data); | |
085dd6e6 JM |
501 | } |
502 | ||
b5a0ac70 SS |
503 | /* Add a file handler/descriptor to the list of descriptors we are |
504 | interested in. | |
505 | FD is the file descriptor for the file/stream to be listened to. | |
506 | For the poll case, MASK is a combination (OR) of | |
507 | POLLIN, POLLRDNORM, POLLRDBAND, POLLPRI, POLLOUT, POLLWRNORM, | |
508 | POLLWRBAND: these are the events we are interested in. If any of them | |
509 | occurs, proc should be called. | |
510 | For the select case, MASK is a combination of READABLE, WRITABLE, EXCEPTION. | |
511 | PROC is the procedure that will be called when an event occurs for | |
512 | FD. CLIENT_DATA is the argument to pass to PROC. */ | |
085dd6e6 | 513 | static void |
6426a772 | 514 | create_file_handler (int fd, int mask, handler_func * proc, gdb_client_data client_data) |
b5a0ac70 SS |
515 | { |
516 | file_handler *file_ptr; | |
517 | ||
b5a0ac70 SS |
518 | /* Do we already have a file handler for this file? (We may be |
519 | changing its associated procedure). */ | |
520 | for (file_ptr = gdb_notifier.first_file_handler; file_ptr != NULL; | |
521 | file_ptr = file_ptr->next_file) | |
522 | { | |
523 | if (file_ptr->fd == fd) | |
524 | break; | |
525 | } | |
526 | ||
c2c6d25f | 527 | /* It is a new file descriptor. Add it to the list. Otherwise, just |
6426a772 | 528 | change the data associated with it. */ |
b5a0ac70 SS |
529 | if (file_ptr == NULL) |
530 | { | |
531 | file_ptr = (file_handler *) xmalloc (sizeof (file_handler)); | |
532 | file_ptr->fd = fd; | |
533 | file_ptr->ready_mask = 0; | |
534 | file_ptr->next_file = gdb_notifier.first_file_handler; | |
535 | gdb_notifier.first_file_handler = file_ptr; | |
536 | } | |
537 | file_ptr->proc = proc; | |
538 | file_ptr->client_data = client_data; | |
539 | file_ptr->mask = mask; | |
540 | ||
44f45770 EZ |
541 | if (use_poll) |
542 | { | |
b5a0ac70 | 543 | #ifdef HAVE_POLL |
44f45770 EZ |
544 | gdb_notifier.num_fds++; |
545 | if (gdb_notifier.poll_fds) | |
546 | gdb_notifier.poll_fds = | |
547 | (struct pollfd *) realloc (gdb_notifier.poll_fds, | |
7e5cd2de | 548 | (gdb_notifier.num_fds) * sizeof (struct pollfd)); |
44f45770 EZ |
549 | else |
550 | gdb_notifier.poll_fds = | |
551 | (struct pollfd *) xmalloc (sizeof (struct pollfd)); | |
552 | (gdb_notifier.poll_fds + gdb_notifier.num_fds - 1)->fd = fd; | |
553 | (gdb_notifier.poll_fds + gdb_notifier.num_fds - 1)->events = mask; | |
554 | (gdb_notifier.poll_fds + gdb_notifier.num_fds - 1)->revents = 0; | |
555 | #else | |
8e65ff28 AC |
556 | internal_error (__FILE__, __LINE__, |
557 | "use_poll without HAVE_POLL"); | |
44f45770 EZ |
558 | #endif /* HAVE_POLL */ |
559 | } | |
b5a0ac70 | 560 | else |
44f45770 EZ |
561 | { |
562 | if (mask & GDB_READABLE) | |
563 | FD_SET (fd, &gdb_notifier.check_masks[0]); | |
564 | else | |
565 | FD_CLR (fd, &gdb_notifier.check_masks[0]); | |
b5a0ac70 | 566 | |
44f45770 EZ |
567 | if (mask & GDB_WRITABLE) |
568 | FD_SET (fd, &gdb_notifier.check_masks[1]); | |
569 | else | |
570 | FD_CLR (fd, &gdb_notifier.check_masks[1]); | |
b5a0ac70 | 571 | |
44f45770 EZ |
572 | if (mask & GDB_EXCEPTION) |
573 | FD_SET (fd, &gdb_notifier.check_masks[2]); | |
574 | else | |
575 | FD_CLR (fd, &gdb_notifier.check_masks[2]); | |
b5a0ac70 | 576 | |
44f45770 EZ |
577 | if (gdb_notifier.num_fds <= fd) |
578 | gdb_notifier.num_fds = fd + 1; | |
579 | } | |
b5a0ac70 SS |
580 | } |
581 | ||
582 | /* Remove the file descriptor FD from the list of monitored fd's: | |
583 | i.e. we don't care anymore about events on the FD. */ | |
584 | void | |
c2c6d25f | 585 | delete_file_handler (int fd) |
b5a0ac70 SS |
586 | { |
587 | file_handler *file_ptr, *prev_ptr = NULL; | |
58a2c44a EZ |
588 | int i; |
589 | #ifdef HAVE_POLL | |
590 | int j; | |
b5a0ac70 | 591 | struct pollfd *new_poll_fds; |
b5a0ac70 SS |
592 | #endif |
593 | ||
594 | /* Find the entry for the given file. */ | |
595 | ||
596 | for (file_ptr = gdb_notifier.first_file_handler; file_ptr != NULL; | |
597 | file_ptr = file_ptr->next_file) | |
598 | { | |
599 | if (file_ptr->fd == fd) | |
600 | break; | |
601 | } | |
602 | ||
603 | if (file_ptr == NULL) | |
604 | return; | |
605 | ||
44f45770 EZ |
606 | if (use_poll) |
607 | { | |
b5a0ac70 | 608 | #ifdef HAVE_POLL |
44f45770 | 609 | /* Create a new poll_fds array by copying every fd's information but the |
7e5cd2de | 610 | one we want to get rid of. */ |
b5a0ac70 | 611 | |
44f45770 EZ |
612 | new_poll_fds = |
613 | (struct pollfd *) xmalloc ((gdb_notifier.num_fds - 1) * sizeof (struct pollfd)); | |
b5a0ac70 | 614 | |
44f45770 | 615 | for (i = 0, j = 0; i < gdb_notifier.num_fds; i++) |
b5a0ac70 | 616 | { |
44f45770 EZ |
617 | if ((gdb_notifier.poll_fds + i)->fd != fd) |
618 | { | |
619 | (new_poll_fds + j)->fd = (gdb_notifier.poll_fds + i)->fd; | |
620 | (new_poll_fds + j)->events = (gdb_notifier.poll_fds + i)->events; | |
621 | (new_poll_fds + j)->revents = (gdb_notifier.poll_fds + i)->revents; | |
622 | j++; | |
623 | } | |
b5a0ac70 | 624 | } |
b8c9b27d | 625 | xfree (gdb_notifier.poll_fds); |
44f45770 EZ |
626 | gdb_notifier.poll_fds = new_poll_fds; |
627 | gdb_notifier.num_fds--; | |
628 | #else | |
8e65ff28 AC |
629 | internal_error (__FILE__, __LINE__, |
630 | "use_poll without HAVE_POLL"); | |
44f45770 | 631 | #endif /* HAVE_POLL */ |
b5a0ac70 | 632 | } |
44f45770 EZ |
633 | else |
634 | { | |
635 | if (file_ptr->mask & GDB_READABLE) | |
636 | FD_CLR (fd, &gdb_notifier.check_masks[0]); | |
637 | if (file_ptr->mask & GDB_WRITABLE) | |
638 | FD_CLR (fd, &gdb_notifier.check_masks[1]); | |
639 | if (file_ptr->mask & GDB_EXCEPTION) | |
640 | FD_CLR (fd, &gdb_notifier.check_masks[2]); | |
b5a0ac70 | 641 | |
44f45770 | 642 | /* Find current max fd. */ |
b5a0ac70 | 643 | |
44f45770 | 644 | if ((fd + 1) == gdb_notifier.num_fds) |
b5a0ac70 | 645 | { |
44f45770 EZ |
646 | gdb_notifier.num_fds--; |
647 | for (i = gdb_notifier.num_fds; i; i--) | |
648 | { | |
649 | if (FD_ISSET (i - 1, &gdb_notifier.check_masks[0]) | |
650 | || FD_ISSET (i - 1, &gdb_notifier.check_masks[1]) | |
651 | || FD_ISSET (i - 1, &gdb_notifier.check_masks[2])) | |
652 | break; | |
653 | } | |
654 | gdb_notifier.num_fds = i; | |
b5a0ac70 SS |
655 | } |
656 | } | |
b5a0ac70 | 657 | |
cff3e48b JM |
658 | /* Deactivate the file descriptor, by clearing its mask, |
659 | so that it will not fire again. */ | |
660 | ||
661 | file_ptr->mask = 0; | |
662 | ||
b5a0ac70 SS |
663 | /* Get rid of the file handler in the file handler list. */ |
664 | if (file_ptr == gdb_notifier.first_file_handler) | |
665 | gdb_notifier.first_file_handler = file_ptr->next_file; | |
666 | else | |
667 | { | |
668 | for (prev_ptr = gdb_notifier.first_file_handler; | |
9e0b60a8 | 669 | prev_ptr->next_file != file_ptr; |
b5a0ac70 SS |
670 | prev_ptr = prev_ptr->next_file) |
671 | ; | |
672 | prev_ptr->next_file = file_ptr->next_file; | |
673 | } | |
b8c9b27d | 674 | xfree (file_ptr); |
b5a0ac70 SS |
675 | } |
676 | ||
677 | /* Handle the given event by calling the procedure associated to the | |
678 | corresponding file handler. Called by process_event indirectly, | |
679 | through event_ptr->proc. EVENT_FILE_DESC is file descriptor of the | |
680 | event in the front of the event queue. */ | |
681 | static void | |
c2c6d25f | 682 | handle_file_event (int event_file_desc) |
b5a0ac70 SS |
683 | { |
684 | file_handler *file_ptr; | |
c2c6d25f JM |
685 | int mask; |
686 | #ifdef HAVE_POLL | |
687 | int error_mask; | |
688 | int error_mask_returned; | |
689 | #endif | |
b5a0ac70 SS |
690 | |
691 | /* Search the file handler list to find one that matches the fd in | |
692 | the event. */ | |
693 | for (file_ptr = gdb_notifier.first_file_handler; file_ptr != NULL; | |
694 | file_ptr = file_ptr->next_file) | |
695 | { | |
696 | if (file_ptr->fd == event_file_desc) | |
697 | { | |
698 | /* With poll, the ready_mask could have any of three events | |
699 | set to 1: POLLHUP, POLLERR, POLLNVAL. These events cannot | |
700 | be used in the requested event mask (events), but they | |
701 | can be returned in the return mask (revents). We need to | |
702 | check for those event too, and add them to the mask which | |
703 | will be passed to the handler. */ | |
704 | ||
705 | /* See if the desired events (mask) match the received | |
706 | events (ready_mask). */ | |
707 | ||
44f45770 | 708 | if (use_poll) |
c2c6d25f | 709 | { |
44f45770 EZ |
710 | #ifdef HAVE_POLL |
711 | error_mask = POLLHUP | POLLERR | POLLNVAL; | |
712 | mask = (file_ptr->ready_mask & file_ptr->mask) | | |
713 | (file_ptr->ready_mask & error_mask); | |
714 | error_mask_returned = mask & error_mask; | |
715 | ||
716 | if (error_mask_returned != 0) | |
717 | { | |
718 | /* Work in progress. We may need to tell somebody what | |
719 | kind of error we had. */ | |
720 | if (error_mask_returned & POLLHUP) | |
721 | printf_unfiltered ("Hangup detected on fd %d\n", file_ptr->fd); | |
722 | if (error_mask_returned & POLLERR) | |
723 | printf_unfiltered ("Error detected on fd %d\n", file_ptr->fd); | |
724 | if (error_mask_returned & POLLNVAL) | |
725 | printf_unfiltered ("Invalid or non-`poll'able fd %d\n", file_ptr->fd); | |
726 | file_ptr->error = 1; | |
727 | } | |
728 | else | |
729 | file_ptr->error = 0; | |
730 | #else | |
8e65ff28 AC |
731 | internal_error (__FILE__, __LINE__, |
732 | "use_poll without HAVE_POLL"); | |
44f45770 | 733 | #endif /* HAVE_POLL */ |
6426a772 JM |
734 | } |
735 | else | |
c2c6d25f | 736 | { |
44f45770 EZ |
737 | if (file_ptr->ready_mask & GDB_EXCEPTION) |
738 | { | |
739 | printf_unfiltered ("Exception condition detected on fd %d\n", file_ptr->fd); | |
740 | file_ptr->error = 1; | |
741 | } | |
742 | else | |
743 | file_ptr->error = 0; | |
744 | mask = file_ptr->ready_mask & file_ptr->mask; | |
c2c6d25f | 745 | } |
b5a0ac70 SS |
746 | |
747 | /* Clear the received events for next time around. */ | |
748 | file_ptr->ready_mask = 0; | |
749 | ||
750 | /* If there was a match, then call the handler. */ | |
751 | if (mask != 0) | |
2acceee2 | 752 | (*file_ptr->proc) (file_ptr->error, file_ptr->client_data); |
b5a0ac70 SS |
753 | break; |
754 | } | |
755 | } | |
756 | } | |
757 | ||
758 | /* Called by gdb_do_one_event to wait for new events on the | |
759 | monitored file descriptors. Queue file events as they are | |
760 | detected by the poll. | |
761 | If there are no events, this function will block in the | |
762 | call to poll. | |
763 | Return -1 if there are no files descriptors to monitor, | |
764 | otherwise return 0. */ | |
765 | static int | |
c2c6d25f | 766 | gdb_wait_for_event (void) |
b5a0ac70 SS |
767 | { |
768 | file_handler *file_ptr; | |
769 | gdb_event *file_event_ptr; | |
0f71a2f6 JM |
770 | int num_found = 0; |
771 | int i; | |
b5a0ac70 | 772 | |
7be570e7 JM |
773 | /* Make sure all output is done before getting another event. */ |
774 | gdb_flush (gdb_stdout); | |
775 | gdb_flush (gdb_stderr); | |
776 | ||
b5a0ac70 SS |
777 | if (gdb_notifier.num_fds == 0) |
778 | return -1; | |
779 | ||
44f45770 EZ |
780 | if (use_poll) |
781 | { | |
b5a0ac70 | 782 | #ifdef HAVE_POLL |
44f45770 EZ |
783 | num_found = |
784 | poll (gdb_notifier.poll_fds, | |
785 | (unsigned long) gdb_notifier.num_fds, | |
786 | gdb_notifier.timeout_valid ? gdb_notifier.poll_timeout : -1); | |
787 | ||
788 | /* Don't print anything if we get out of poll because of a | |
7e5cd2de | 789 | signal. */ |
44f45770 EZ |
790 | if (num_found == -1 && errno != EINTR) |
791 | perror_with_name ("Poll"); | |
792 | #else | |
8e65ff28 AC |
793 | internal_error (__FILE__, __LINE__, |
794 | "use_poll without HAVE_POLL"); | |
44f45770 EZ |
795 | #endif /* HAVE_POLL */ |
796 | } | |
797 | else | |
c2c6d25f | 798 | { |
44f45770 EZ |
799 | gdb_notifier.ready_masks[0] = gdb_notifier.check_masks[0]; |
800 | gdb_notifier.ready_masks[1] = gdb_notifier.check_masks[1]; | |
801 | gdb_notifier.ready_masks[2] = gdb_notifier.check_masks[2]; | |
802 | num_found = select (gdb_notifier.num_fds, | |
7e5cd2de EZ |
803 | &gdb_notifier.ready_masks[0], |
804 | &gdb_notifier.ready_masks[1], | |
805 | &gdb_notifier.ready_masks[2], | |
44f45770 EZ |
806 | gdb_notifier.timeout_valid |
807 | ? &gdb_notifier.select_timeout : NULL); | |
808 | ||
809 | /* Clear the masks after an error from select. */ | |
810 | if (num_found == -1) | |
811 | { | |
812 | FD_ZERO (&gdb_notifier.ready_masks[0]); | |
813 | FD_ZERO (&gdb_notifier.ready_masks[1]); | |
814 | FD_ZERO (&gdb_notifier.ready_masks[2]); | |
815 | /* Dont print anything is we got a signal, let gdb handle it. */ | |
816 | if (errno != EINTR) | |
817 | perror_with_name ("Select"); | |
818 | } | |
c2c6d25f | 819 | } |
b5a0ac70 SS |
820 | |
821 | /* Enqueue all detected file events. */ | |
822 | ||
44f45770 EZ |
823 | if (use_poll) |
824 | { | |
b5a0ac70 | 825 | #ifdef HAVE_POLL |
44f45770 EZ |
826 | for (i = 0; (i < gdb_notifier.num_fds) && (num_found > 0); i++) |
827 | { | |
828 | if ((gdb_notifier.poll_fds + i)->revents) | |
829 | num_found--; | |
830 | else | |
831 | continue; | |
b5a0ac70 | 832 | |
44f45770 EZ |
833 | for (file_ptr = gdb_notifier.first_file_handler; |
834 | file_ptr != NULL; | |
835 | file_ptr = file_ptr->next_file) | |
836 | { | |
837 | if (file_ptr->fd == (gdb_notifier.poll_fds + i)->fd) | |
838 | break; | |
839 | } | |
840 | ||
841 | if (file_ptr) | |
842 | { | |
843 | /* Enqueue an event only if this is still a new event for | |
7e5cd2de | 844 | this fd. */ |
44f45770 EZ |
845 | if (file_ptr->ready_mask == 0) |
846 | { | |
847 | file_event_ptr = create_file_event (file_ptr->fd); | |
848 | async_queue_event (file_event_ptr, TAIL); | |
849 | } | |
850 | } | |
b5a0ac70 | 851 | |
44f45770 EZ |
852 | file_ptr->ready_mask = (gdb_notifier.poll_fds + i)->revents; |
853 | } | |
854 | #else | |
8e65ff28 AC |
855 | internal_error (__FILE__, __LINE__, |
856 | "use_poll without HAVE_POLL"); | |
44f45770 EZ |
857 | #endif /* HAVE_POLL */ |
858 | } | |
859 | else | |
860 | { | |
b5a0ac70 | 861 | for (file_ptr = gdb_notifier.first_file_handler; |
44f45770 | 862 | (file_ptr != NULL) && (num_found > 0); |
b5a0ac70 SS |
863 | file_ptr = file_ptr->next_file) |
864 | { | |
44f45770 EZ |
865 | int mask = 0; |
866 | ||
867 | if (FD_ISSET (file_ptr->fd, &gdb_notifier.ready_masks[0])) | |
868 | mask |= GDB_READABLE; | |
869 | if (FD_ISSET (file_ptr->fd, &gdb_notifier.ready_masks[1])) | |
870 | mask |= GDB_WRITABLE; | |
871 | if (FD_ISSET (file_ptr->fd, &gdb_notifier.ready_masks[2])) | |
872 | mask |= GDB_EXCEPTION; | |
873 | ||
874 | if (!mask) | |
875 | continue; | |
876 | else | |
877 | num_found--; | |
b5a0ac70 | 878 | |
b5a0ac70 SS |
879 | /* Enqueue an event only if this is still a new event for |
880 | this fd. */ | |
44f45770 | 881 | |
b5a0ac70 SS |
882 | if (file_ptr->ready_mask == 0) |
883 | { | |
cff3e48b | 884 | file_event_ptr = create_file_event (file_ptr->fd); |
b5a0ac70 SS |
885 | async_queue_event (file_event_ptr, TAIL); |
886 | } | |
44f45770 | 887 | file_ptr->ready_mask = mask; |
b5a0ac70 | 888 | } |
b5a0ac70 | 889 | } |
b5a0ac70 SS |
890 | return 0; |
891 | } | |
892 | \f | |
893 | ||
894 | /* Create an asynchronous handler, allocating memory for it. | |
895 | Return a pointer to the newly created handler. | |
896 | This pointer will be used to invoke the handler by | |
897 | invoke_async_signal_handler. | |
898 | PROC is the function to call with CLIENT_DATA argument | |
899 | whenever the handler is invoked. */ | |
900 | async_signal_handler * | |
6426a772 | 901 | create_async_signal_handler (sig_handler_func * proc, gdb_client_data client_data) |
b5a0ac70 SS |
902 | { |
903 | async_signal_handler *async_handler_ptr; | |
904 | ||
905 | async_handler_ptr = | |
906 | (async_signal_handler *) xmalloc (sizeof (async_signal_handler)); | |
907 | async_handler_ptr->ready = 0; | |
908 | async_handler_ptr->next_handler = NULL; | |
909 | async_handler_ptr->proc = proc; | |
910 | async_handler_ptr->client_data = client_data; | |
911 | if (sighandler_list.first_handler == NULL) | |
912 | sighandler_list.first_handler = async_handler_ptr; | |
913 | else | |
914 | sighandler_list.last_handler->next_handler = async_handler_ptr; | |
915 | sighandler_list.last_handler = async_handler_ptr; | |
916 | return async_handler_ptr; | |
917 | } | |
918 | ||
919 | /* Mark the handler (ASYNC_HANDLER_PTR) as ready. This information will | |
920 | be used when the handlers are invoked, after we have waited for | |
921 | some event. The caller of this function is the interrupt handler | |
922 | associated with a signal. */ | |
923 | void | |
6426a772 | 924 | mark_async_signal_handler (async_signal_handler * async_handler_ptr) |
b5a0ac70 SS |
925 | { |
926 | ((async_signal_handler *) async_handler_ptr)->ready = 1; | |
927 | async_handler_ready = 1; | |
928 | } | |
929 | ||
930 | /* Call all the handlers that are ready. */ | |
931 | static void | |
c2c6d25f | 932 | invoke_async_signal_handler (void) |
b5a0ac70 SS |
933 | { |
934 | async_signal_handler *async_handler_ptr; | |
935 | ||
936 | if (async_handler_ready == 0) | |
937 | return; | |
938 | async_handler_ready = 0; | |
939 | ||
940 | /* Invoke ready handlers. */ | |
941 | ||
942 | while (1) | |
943 | { | |
c5aa993b | 944 | for (async_handler_ptr = sighandler_list.first_handler; |
b5a0ac70 SS |
945 | async_handler_ptr != NULL; |
946 | async_handler_ptr = async_handler_ptr->next_handler) | |
947 | { | |
948 | if (async_handler_ptr->ready) | |
949 | break; | |
950 | } | |
951 | if (async_handler_ptr == NULL) | |
952 | break; | |
953 | async_handler_ptr->ready = 0; | |
954 | (*async_handler_ptr->proc) (async_handler_ptr->client_data); | |
955 | } | |
956 | ||
957 | return; | |
958 | } | |
959 | ||
960 | /* Delete an asynchronous handler (ASYNC_HANDLER_PTR). | |
961 | Free the space allocated for it. */ | |
962 | void | |
6426a772 | 963 | delete_async_signal_handler (async_signal_handler ** async_handler_ptr) |
b5a0ac70 SS |
964 | { |
965 | async_signal_handler *prev_ptr; | |
966 | ||
43ff13b4 | 967 | if (sighandler_list.first_handler == (*async_handler_ptr)) |
b5a0ac70 | 968 | { |
43ff13b4 | 969 | sighandler_list.first_handler = (*async_handler_ptr)->next_handler; |
b5a0ac70 SS |
970 | if (sighandler_list.first_handler == NULL) |
971 | sighandler_list.last_handler = NULL; | |
972 | } | |
973 | else | |
974 | { | |
975 | prev_ptr = sighandler_list.first_handler; | |
43ff13b4 | 976 | while (prev_ptr->next_handler != (*async_handler_ptr) && prev_ptr) |
b5a0ac70 | 977 | prev_ptr = prev_ptr->next_handler; |
43ff13b4 JM |
978 | prev_ptr->next_handler = (*async_handler_ptr)->next_handler; |
979 | if (sighandler_list.last_handler == (*async_handler_ptr)) | |
b5a0ac70 SS |
980 | sighandler_list.last_handler = prev_ptr; |
981 | } | |
b8c9b27d | 982 | xfree ((*async_handler_ptr)); |
43ff13b4 | 983 | (*async_handler_ptr) = NULL; |
b5a0ac70 SS |
984 | } |
985 | ||
986 | /* Is it necessary to call invoke_async_signal_handler? */ | |
987 | static int | |
c2c6d25f | 988 | check_async_ready (void) |
b5a0ac70 SS |
989 | { |
990 | return async_handler_ready; | |
991 | } | |
c2c6d25f | 992 | |
c2c6d25f JM |
993 | /* Create a timer that will expire in MILLISECONDS from now. When the |
994 | timer is ready, PROC will be executed. At creation, the timer is | |
995 | aded to the timers queue. This queue is kept sorted in order of | |
6426a772 | 996 | increasing timers. Return a handle to the timer struct. */ |
c2c6d25f | 997 | int |
6426a772 | 998 | create_timer (int milliseconds, timer_handler_func * proc, gdb_client_data client_data) |
c2c6d25f JM |
999 | { |
1000 | struct gdb_timer *timer_ptr, *timer_index, *prev_timer; | |
1001 | struct timeval time_now, delta; | |
1002 | ||
1003 | /* compute seconds */ | |
1004 | delta.tv_sec = milliseconds / 1000; | |
1005 | /* compute microseconds */ | |
6426a772 JM |
1006 | delta.tv_usec = (milliseconds % 1000) * 1000; |
1007 | ||
c2c6d25f JM |
1008 | gettimeofday (&time_now, NULL); |
1009 | ||
1010 | timer_ptr = (struct gdb_timer *) xmalloc (sizeof (gdb_timer)); | |
1011 | timer_ptr->when.tv_sec = time_now.tv_sec + delta.tv_sec; | |
1012 | timer_ptr->when.tv_usec = time_now.tv_usec + delta.tv_usec; | |
1013 | /* carry? */ | |
6426a772 | 1014 | if (timer_ptr->when.tv_usec >= 1000000) |
c2c6d25f JM |
1015 | { |
1016 | timer_ptr->when.tv_sec += 1; | |
1017 | timer_ptr->when.tv_usec -= 1000000; | |
1018 | } | |
1019 | timer_ptr->proc = proc; | |
1020 | timer_ptr->client_data = client_data; | |
6426a772 | 1021 | timer_list.num_timers++; |
c2c6d25f JM |
1022 | timer_ptr->timer_id = timer_list.num_timers; |
1023 | ||
1024 | /* Now add the timer to the timer queue, making sure it is sorted in | |
1025 | increasing order of expiration. */ | |
1026 | ||
6426a772 JM |
1027 | for (timer_index = timer_list.first_timer; |
1028 | timer_index != NULL; | |
c2c6d25f JM |
1029 | timer_index = timer_index->next) |
1030 | { | |
1031 | /* If the seconds field is greater or if it is the same, but the | |
1032 | microsecond field is greater. */ | |
6426a772 | 1033 | if ((timer_index->when.tv_sec > timer_ptr->when.tv_sec) || |
c2c6d25f JM |
1034 | ((timer_index->when.tv_sec == timer_ptr->when.tv_sec) |
1035 | && (timer_index->when.tv_usec > timer_ptr->when.tv_usec))) | |
1036 | break; | |
1037 | } | |
6426a772 | 1038 | |
c2c6d25f JM |
1039 | if (timer_index == timer_list.first_timer) |
1040 | { | |
1041 | timer_ptr->next = timer_list.first_timer; | |
1042 | timer_list.first_timer = timer_ptr; | |
1043 | ||
1044 | } | |
1045 | else | |
1046 | { | |
6426a772 JM |
1047 | for (prev_timer = timer_list.first_timer; |
1048 | prev_timer->next != timer_index; | |
c2c6d25f JM |
1049 | prev_timer = prev_timer->next) |
1050 | ; | |
6426a772 | 1051 | |
c2c6d25f JM |
1052 | prev_timer->next = timer_ptr; |
1053 | timer_ptr->next = timer_index; | |
1054 | } | |
1055 | ||
1056 | gdb_notifier.timeout_valid = 0; | |
1057 | return timer_ptr->timer_id; | |
1058 | } | |
1059 | ||
1060 | /* There is a chance that the creator of the timer wants to get rid of | |
1061 | it before it expires. */ | |
1062 | void | |
1063 | delete_timer (int id) | |
1064 | { | |
1065 | struct gdb_timer *timer_ptr, *prev_timer = NULL; | |
1066 | ||
1067 | /* Find the entry for the given timer. */ | |
1068 | ||
1069 | for (timer_ptr = timer_list.first_timer; timer_ptr != NULL; | |
1070 | timer_ptr = timer_ptr->next) | |
1071 | { | |
1072 | if (timer_ptr->timer_id == id) | |
1073 | break; | |
1074 | } | |
1075 | ||
1076 | if (timer_ptr == NULL) | |
1077 | return; | |
1078 | /* Get rid of the timer in the timer list. */ | |
1079 | if (timer_ptr == timer_list.first_timer) | |
1080 | timer_list.first_timer = timer_ptr->next; | |
1081 | else | |
1082 | { | |
1083 | for (prev_timer = timer_list.first_timer; | |
1084 | prev_timer->next != timer_ptr; | |
1085 | prev_timer = prev_timer->next) | |
1086 | ; | |
1087 | prev_timer->next = timer_ptr->next; | |
1088 | } | |
b8c9b27d | 1089 | xfree (timer_ptr); |
c2c6d25f JM |
1090 | |
1091 | gdb_notifier.timeout_valid = 0; | |
1092 | } | |
1093 | ||
1094 | /* When a timer event is put on the event queue, it will be handled by | |
1095 | this function. Just call the assiciated procedure and delete the | |
1096 | timer event from the event queue. Repeat this for each timer that | |
6426a772 | 1097 | has expired. */ |
c2c6d25f JM |
1098 | static void |
1099 | handle_timer_event (int dummy) | |
1100 | { | |
1101 | struct timeval time_now; | |
1102 | struct gdb_timer *timer_ptr, *saved_timer; | |
6426a772 | 1103 | |
c2c6d25f JM |
1104 | gettimeofday (&time_now, NULL); |
1105 | timer_ptr = timer_list.first_timer; | |
1106 | ||
1107 | while (timer_ptr != NULL) | |
1108 | { | |
6426a772 JM |
1109 | if ((timer_ptr->when.tv_sec > time_now.tv_sec) || |
1110 | ((timer_ptr->when.tv_sec == time_now.tv_sec) && | |
c2c6d25f JM |
1111 | (timer_ptr->when.tv_usec > time_now.tv_usec))) |
1112 | break; | |
1113 | ||
1114 | /* Get rid of the timer from the beginning of the list. */ | |
1115 | timer_list.first_timer = timer_ptr->next; | |
1116 | saved_timer = timer_ptr; | |
1117 | timer_ptr = timer_ptr->next; | |
1118 | /* Call the procedure associated with that timer. */ | |
c4093a6a | 1119 | (*saved_timer->proc) (saved_timer->client_data); |
b8c9b27d | 1120 | xfree (saved_timer); |
c2c6d25f JM |
1121 | } |
1122 | ||
1123 | gdb_notifier.timeout_valid = 0; | |
1124 | } | |
6426a772 | 1125 | |
c2c6d25f JM |
1126 | /* Check whether any timers in the timers queue are ready. If at least |
1127 | one timer is ready, stick an event onto the event queue. Even in | |
1128 | case more than one timer is ready, one event is enough, because the | |
1129 | handle_timer_event() will go through the timers list and call the | |
1130 | procedures associated with all that have expired. Update the | |
6426a772 | 1131 | timeout for the select() or poll() as well. */ |
c2c6d25f JM |
1132 | static void |
1133 | poll_timers (void) | |
1134 | { | |
1135 | struct timeval time_now, delta; | |
1136 | gdb_event *event_ptr; | |
6426a772 | 1137 | |
2acceee2 | 1138 | if (timer_list.first_timer != NULL) |
c2c6d25f JM |
1139 | { |
1140 | gettimeofday (&time_now, NULL); | |
1141 | delta.tv_sec = timer_list.first_timer->when.tv_sec - time_now.tv_sec; | |
1142 | delta.tv_usec = timer_list.first_timer->when.tv_usec - time_now.tv_usec; | |
1143 | /* borrow? */ | |
1144 | if (delta.tv_usec < 0) | |
1145 | { | |
1146 | delta.tv_sec -= 1; | |
1147 | delta.tv_usec += 1000000; | |
1148 | } | |
6426a772 | 1149 | |
c2c6d25f | 1150 | /* Oops it expired already. Tell select / poll to return |
2f16bb32 | 1151 | immediately. (Cannot simply test if delta.tv_sec is negative |
7e5cd2de | 1152 | because time_t might be unsigned.) */ |
2f16bb32 EZ |
1153 | if (timer_list.first_timer->when.tv_sec < time_now.tv_sec |
1154 | || (timer_list.first_timer->when.tv_sec == time_now.tv_sec | |
1155 | && timer_list.first_timer->when.tv_usec < time_now.tv_usec)) | |
c2c6d25f JM |
1156 | { |
1157 | delta.tv_sec = 0; | |
1158 | delta.tv_usec = 0; | |
1159 | } | |
1160 | ||
1161 | if (delta.tv_sec == 0 && delta.tv_usec == 0) | |
1162 | { | |
1163 | event_ptr = (gdb_event *) xmalloc (sizeof (gdb_event)); | |
1164 | event_ptr->proc = handle_timer_event; | |
1165 | event_ptr->fd = timer_list.first_timer->timer_id; | |
1166 | async_queue_event (event_ptr, TAIL); | |
1167 | } | |
1168 | ||
1169 | /* Now we need to update the timeout for select/ poll, because we | |
6426a772 | 1170 | don't want to sit there while this timer is expiring. */ |
44f45770 EZ |
1171 | if (use_poll) |
1172 | { | |
c2c6d25f | 1173 | #ifdef HAVE_POLL |
44f45770 | 1174 | gdb_notifier.poll_timeout = delta.tv_sec * 1000; |
c2c6d25f | 1175 | #else |
8e65ff28 AC |
1176 | internal_error (__FILE__, __LINE__, |
1177 | "use_poll without HAVE_POLL"); | |
44f45770 EZ |
1178 | #endif /* HAVE_POLL */ |
1179 | } | |
1180 | else | |
1181 | { | |
1182 | gdb_notifier.select_timeout.tv_sec = delta.tv_sec; | |
1183 | gdb_notifier.select_timeout.tv_usec = delta.tv_usec; | |
1184 | } | |
c2c6d25f JM |
1185 | gdb_notifier.timeout_valid = 1; |
1186 | } | |
6426a772 | 1187 | else |
c2c6d25f JM |
1188 | gdb_notifier.timeout_valid = 0; |
1189 | } |