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