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