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