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