1 /*
2 * Server-side message queues
3 *
4 * Copyright (C) 2000 Alexandre Julliard
5 *
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
10 *
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
15 *
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
19 */
20
21 #include "config.h"
22 #include "wine/port.h"
23
24 #include <assert.h>
25 #include <stdarg.h>
26 #include <stdio.h>
27 #include <stdlib.h>
28
29 #include "ntstatus.h"
30 #define WIN32_NO_STATUS
31 #include "windef.h"
32 #include "winbase.h"
33 #include "wingdi.h"
34 #include "winuser.h"
35 #include "winternl.h"
36
37 #include "handle.h"
38 #include "file.h"
39 #include "thread.h"
40 #include "process.h"
41 #include "request.h"
42 #include "user.h"
43
44 #define WM_NCMOUSEFIRST WM_NCMOUSEMOVE
45 #define WM_NCMOUSELAST (WM_NCMOUSEFIRST+(WM_MOUSELAST-WM_MOUSEFIRST))
46
47 enum message_kind { SEND_MESSAGE, POST_MESSAGE };
48 #define NB_MSG_KINDS (POST_MESSAGE+1)
49
50
51 struct message_result
52 {
53 struct list sender_entry; /* entry in sender list */
54 struct message *msg; /* message the result is for */
55 struct message_result *recv_next; /* next in receiver list */
56 struct msg_queue *sender; /* sender queue */
57 struct msg_queue *receiver; /* receiver queue */
58 int replied; /* has it been replied to? */
59 unsigned int error; /* error code to pass back to sender */
60 unsigned long result; /* reply result */
61 struct message *callback_msg; /* message to queue for callback */
62 void *data; /* message reply data */
63 unsigned int data_size; /* size of message reply data */
64 struct timeout_user *timeout; /* result timeout */
65 };
66
67 struct message
68 {
69 struct list entry; /* entry in message list */
70 enum message_type type; /* message type */
71 user_handle_t win; /* window handle */
72 unsigned int msg; /* message code */
73 unsigned long wparam; /* parameters */
74 unsigned long lparam; /* parameters */
75 unsigned long info; /* extra info */
76 int x; /* x position */
77 int y; /* y position */
78 unsigned int time; /* message time */
79 void *data; /* message data for sent messages */
80 unsigned int data_size; /* size of message data */
81 unsigned int unique_id; /* unique id for nested hw message waits */
82 struct message_result *result; /* result in sender queue */
83 };
84
85 struct timer
86 {
87 struct list entry; /* entry in timer list */
88 timeout_t when; /* next expiration */
89 unsigned int rate; /* timer rate in ms */
90 user_handle_t win; /* window handle */
91 unsigned int msg; /* message to post */
92 unsigned long id; /* timer id */
93 unsigned long lparam; /* lparam for message */
94 };
95
96 struct thread_input
97 {
98 struct object obj; /* object header */
99 struct desktop *desktop; /* desktop that this thread input belongs to */
100 user_handle_t focus; /* focus window */
101 user_handle_t capture; /* capture window */
102 user_handle_t active; /* active window */
103 user_handle_t menu_owner; /* current menu owner window */
104 user_handle_t move_size; /* current moving/resizing window */
105 user_handle_t caret; /* caret window */
106 rectangle_t caret_rect; /* caret rectangle */
107 int caret_hide; /* caret hide count */
108 int caret_state; /* caret on/off state */
109 struct list msg_list; /* list of hardware messages */
110 unsigned char keystate[256]; /* state of each key */
111 };
112
113 struct msg_queue
114 {
115 struct object obj; /* object header */
116 struct fd *fd; /* optional file descriptor to poll */
117 unsigned int wake_bits; /* wakeup bits */
118 unsigned int wake_mask; /* wakeup mask */
119 unsigned int changed_bits; /* changed wakeup bits */
120 unsigned int changed_mask; /* changed wakeup mask */
121 int paint_count; /* pending paint messages count */
122 int quit_message; /* is there a pending quit message? */
123 int exit_code; /* exit code of pending quit message */
124 struct list msg_list[NB_MSG_KINDS]; /* lists of messages */
125 struct list send_result; /* stack of sent messages waiting for result */
126 struct list callback_result; /* list of callback messages waiting for result */
127 struct message_result *recv_result; /* stack of received messages waiting for result */
128 struct list pending_timers; /* list of pending timers */
129 struct list expired_timers; /* list of expired timers */
130 unsigned long next_timer_id; /* id for the next timer with a 0 window */
131 struct timeout_user *timeout; /* timeout for next timer to expire */
132 struct thread_input *input; /* thread input descriptor */
133 struct hook_table *hooks; /* hook table */
134 timeout_t last_get_msg; /* time of last get message call */
135 };
136
137 static void msg_queue_dump( struct object *obj, int verbose );
138 static int msg_queue_add_queue( struct object *obj, struct wait_queue_entry *entry );
139 static void msg_queue_remove_queue( struct object *obj, struct wait_queue_entry *entry );
140 static int msg_queue_signaled( struct object *obj, struct thread *thread );
141 static int msg_queue_satisfied( struct object *obj, struct thread *thread );
142 static void msg_queue_destroy( struct object *obj );
143 static void msg_queue_poll_event( struct fd *fd, int event );
144 static void thread_input_dump( struct object *obj, int verbose );
145 static void thread_input_destroy( struct object *obj );
146 static void timer_callback( void *private );
147
148 static const struct object_ops msg_queue_ops =
149 {
150 sizeof(struct msg_queue), /* size */
151 msg_queue_dump, /* dump */
152 no_get_type, /* get_type */
153 msg_queue_add_queue, /* add_queue */
154 msg_queue_remove_queue, /* remove_queue */
155 msg_queue_signaled, /* signaled */
156 msg_queue_satisfied, /* satisfied */
157 no_signal, /* signal */
158 no_get_fd, /* get_fd */
159 no_map_access, /* map_access */
160 default_get_sd, /* get_sd */
161 default_set_sd, /* set_sd */
162 no_lookup_name, /* lookup_name */
163 no_open_file, /* open_file */
164 no_close_handle, /* close_handle */
165 msg_queue_destroy /* destroy */
166 };
167
168 static const struct fd_ops msg_queue_fd_ops =
169 {
170 NULL, /* get_poll_events */
171 msg_queue_poll_event, /* poll_event */
172 NULL, /* flush */
173 NULL, /* get_fd_type */
174 NULL, /* ioctl */
175 NULL, /* queue_async */
176 NULL, /* reselect_async */
177 NULL /* cancel async */
178 };
179
180
181 static const struct object_ops thread_input_ops =
182 {
183 sizeof(struct thread_input), /* size */
184 thread_input_dump, /* dump */
185 no_get_type, /* get_type */
186 no_add_queue, /* add_queue */
187 NULL, /* remove_queue */
188 NULL, /* signaled */
189 NULL, /* satisfied */
190 no_signal, /* signal */
191 no_get_fd, /* get_fd */
192 no_map_access, /* map_access */
193 default_get_sd, /* get_sd */
194 default_set_sd, /* set_sd */
195 no_lookup_name, /* lookup_name */
196 no_open_file, /* open_file */
197 no_close_handle, /* close_handle */
198 thread_input_destroy /* destroy */
199 };
200
201 /* pointer to input structure of foreground thread */
202 static struct thread_input *foreground_input;
203 static unsigned int last_input_time;
204
205 static void free_message( struct message *msg );
206
207 /* set the caret window in a given thread input */
208 static void set_caret_window( struct thread_input *input, user_handle_t win )
209 {
210 if (!win || win != input->caret)
211 {
212 input->caret_rect.left = 0;
213 input->caret_rect.top = 0;
214 input->caret_rect.right = 0;
215 input->caret_rect.bottom = 0;
216 }
217 input->caret = win;
218 input->caret_hide = 1;
219 input->caret_state = 0;
220 }
221
222 /* create a thread input object */
223 static struct thread_input *create_thread_input( struct thread *thread )
224 {
225 struct thread_input *input;
226
227 if ((input = alloc_object( &thread_input_ops )))
228 {
229 input->focus = 0;
230 input->capture = 0;
231 input->active = 0;
232 input->menu_owner = 0;
233 input->move_size = 0;
234 list_init( &input->msg_list );
235 set_caret_window( input, 0 );
236 memset( input->keystate, 0, sizeof(input->keystate) );
237
238 if (!(input->desktop = get_thread_desktop( thread, 0 /* FIXME: access rights */ )))
239 {
240 release_object( input );
241 return NULL;
242 }
243 }
244 return input;
245 }
246
247 /* release the thread input data of a given thread */
248 static inline void release_thread_input( struct thread *thread )
249 {
250 struct thread_input *input = thread->queue->input;
251
252 if (!input) return;
253 release_object( input );
254 thread->queue->input = NULL;
255 }
256
257 /* create a message queue object */
258 static struct msg_queue *create_msg_queue( struct thread *thread, struct thread_input *input )
259 {
260 struct msg_queue *queue;
261 int i;
262
263 if (!input && !(input = create_thread_input( thread ))) return NULL;
264 if ((queue = alloc_object( &msg_queue_ops )))
265 {
266 queue->fd = NULL;
267 queue->wake_bits = 0;
268 queue->wake_mask = 0;
269 queue->changed_bits = 0;
270 queue->changed_mask = 0;
271 queue->paint_count = 0;
272 queue->quit_message = 0;
273 queue->recv_result = NULL;
274 queue->next_timer_id = 0x7fff;
275 queue->timeout = NULL;
276 queue->input = (struct thread_input *)grab_object( input );
277 queue->hooks = NULL;
278 queue->last_get_msg = current_time;
279 list_init( &queue->send_result );
280 list_init( &queue->callback_result );
281 list_init( &queue->pending_timers );
282 list_init( &queue->expired_timers );
283 for (i = 0; i < NB_MSG_KINDS; i++) list_init( &queue->msg_list[i] );
284
285 thread->queue = queue;
286 if (!thread->process->queue)
287 thread->process->queue = (struct msg_queue *)grab_object( queue );
288 }
289 release_object( input );
290 return queue;
291 }
292
293 /* free the message queue of a thread at thread exit */
294 void free_msg_queue( struct thread *thread )
295 {
296 struct process *process = thread->process;
297
298 remove_thread_hooks( thread );
299 if (!thread->queue) return;
300 if (process->queue == thread->queue) /* is it the process main queue? */
301 {
302 release_object( process->queue );
303 process->queue = NULL;
304 if (process->idle_event)
305 {
306 set_event( process->idle_event );
307 release_object( process->idle_event );
308 process->idle_event = NULL;
309 }
310 }
311 release_object( thread->queue );
312 thread->queue = NULL;
313 }
314
315 /* get the hook table for a given thread */
316 struct hook_table *get_queue_hooks( struct thread *thread )
317 {
318 if (!thread->queue) return NULL;
319 return thread->queue->hooks;
320 }
321
322 /* set the hook table for a given thread, allocating the queue if needed */
323 void set_queue_hooks( struct thread *thread, struct hook_table *hooks )
324 {
325 struct msg_queue *queue = thread->queue;
326 if (!queue && !(queue = create_msg_queue( thread, NULL ))) return;
327 if (queue->hooks) release_object( queue->hooks );
328 queue->hooks = hooks;
329 }
330
331 /* check the queue status */
332 static inline int is_signaled( struct msg_queue *queue )
333 {
334 return ((queue->wake_bits & queue->wake_mask) || (queue->changed_bits & queue->changed_mask));
335 }
336
337 /* set some queue bits */
338 static inline void set_queue_bits( struct msg_queue *queue, unsigned int bits )
339 {
340 queue->wake_bits |= bits;
341 queue->changed_bits |= bits;
342 if (is_signaled( queue )) wake_up( &queue->obj, 0 );
343 }
344
345 /* clear some queue bits */
346 static inline void clear_queue_bits( struct msg_queue *queue, unsigned int bits )
347 {
348 queue->wake_bits &= ~bits;
349 queue->changed_bits &= ~bits;
350 }
351
352 /* check whether msg is a keyboard message */
353 static inline int is_keyboard_msg( struct message *msg )
354 {
355 return (msg->msg >= WM_KEYFIRST && msg->msg <= WM_KEYLAST);
356 }
357
358 /* check if message is matched by the filter */
359 static inline int check_msg_filter( unsigned int msg, unsigned int first, unsigned int last )
360 {
361 return (msg >= first && msg <= last);
362 }
363
364 /* check whether a message filter contains at least one potential hardware message */
365 static inline int filter_contains_hw_range( unsigned int first, unsigned int last )
366 {
367 /* hardware message ranges are (in numerical order):
368 * WM_NCMOUSEFIRST .. WM_NCMOUSELAST
369 * WM_KEYFIRST .. WM_KEYLAST
370 * WM_MOUSEFIRST .. WM_MOUSELAST
371 */
372 if (last < WM_NCMOUSEFIRST) return 0;
373 if (first > WM_NCMOUSELAST && last < WM_KEYFIRST) return 0;
374 if (first > WM_KEYLAST && last < WM_MOUSEFIRST) return 0;
375 if (first > WM_MOUSELAST) return 0;
376 return 1;
377 }
378
379 /* get the QS_* bit corresponding to a given hardware message */
380 static inline int get_hardware_msg_bit( struct message *msg )
381 {
382 if (msg->msg == WM_MOUSEMOVE || msg->msg == WM_NCMOUSEMOVE) return QS_MOUSEMOVE;
383 if (is_keyboard_msg( msg )) return QS_KEY;
384 return QS_MOUSEBUTTON;
385 }
386
387 /* get the current thread queue, creating it if needed */
388 static inline struct msg_queue *get_current_queue(void)
389 {
390 struct msg_queue *queue = current->queue;
391 if (!queue) queue = create_msg_queue( current, NULL );
392 return queue;
393 }
394
395 /* get a (pseudo-)unique id to tag hardware messages */
396 static inline unsigned int get_unique_id(void)
397 {
398 static unsigned int id;
399 if (!++id) id = 1; /* avoid an id of 0 */
400 return id;
401 }
402
403 /* try to merge a message with the last in the list; return 1 if successful */
404 static int merge_message( struct thread_input *input, const struct message *msg )
405 {
406 struct message *prev;
407 struct list *ptr = list_tail( &input->msg_list );
408
409 if (!ptr) return 0;
410 prev = LIST_ENTRY( ptr, struct message, entry );
411 if (prev->result) return 0;
412 if (prev->win && msg->win && prev->win != msg->win) return 0;
413 if (prev->msg != msg->msg) return 0;
414 if (prev->type != msg->type) return 0;
415 /* now we can merge it */
416 prev->wparam = msg->wparam;
417 prev->lparam = msg->lparam;
418 prev->x = msg->x;
419 prev->y = msg->y;
420 prev->time = msg->time;
421 prev->info = msg->info;
422 return 1;
423 }
424
425 /* free a result structure */
426 static void free_result( struct message_result *result )
427 {
428 if (result->timeout) remove_timeout_user( result->timeout );
429 free( result->data );
430 if (result->callback_msg) free_message( result->callback_msg );
431 free( result );
432 }
433
434 /* remove the result from the sender list it is on */
435 static inline void remove_result_from_sender( struct message_result *result )
436 {
437 assert( result->sender );
438
439 list_remove( &result->sender_entry );
440 result->sender = NULL;
441 if (!result->receiver) free_result( result );
442 }
443
444 /* store the message result in the appropriate structure */
445 static void store_message_result( struct message_result *res, unsigned long result,
446 unsigned int error )
447 {
448 res->result = result;
449 res->error = error;
450 res->replied = 1;
451 if (res->timeout)
452 {
453 remove_timeout_user( res->timeout );
454 res->timeout = NULL;
455 }
456 if (res->sender)
457 {
458 if (res->callback_msg)
459 {
460 /* queue the callback message in the sender queue */
461 struct callback_msg_data *data = res->callback_msg->data;
462 data->result = result;
463 list_add_tail( &res->sender->msg_list[SEND_MESSAGE], &res->callback_msg->entry );
464 set_queue_bits( res->sender, QS_SENDMESSAGE );
465 res->callback_msg = NULL;
466 remove_result_from_sender( res );
467 }
468 else
469 {
470 /* wake sender queue if waiting on this result */
471 if (list_head(&res->sender->send_result) == &res->sender_entry)
472 set_queue_bits( res->sender, QS_SMRESULT );
473 }
474 }
475
476 }
477
478 /* free a message when deleting a queue or window */
479 static void free_message( struct message *msg )
480 {
481 struct message_result *result = msg->result;
482 if (result)
483 {
484 result->msg = NULL;
485 if (result->sender)
486 {
487 result->receiver = NULL;
488 store_message_result( result, 0, STATUS_ACCESS_DENIED /*FIXME*/ );
489 }
490 else free_result( result );
491 }
492 free( msg->data );
493 free( msg );
494 }
495
496 /* remove (and free) a message from a message list */
497 static void remove_queue_message( struct msg_queue *queue, struct message *msg,
498 enum message_kind kind )
499 {
500 list_remove( &msg->entry );
501 switch(kind)
502 {
503 case SEND_MESSAGE:
504 if (list_empty( &queue->msg_list[kind] )) clear_queue_bits( queue, QS_SENDMESSAGE );
505 break;
506 case POST_MESSAGE:
507 if (list_empty( &queue->msg_list[kind] ) && !queue->quit_message)
508 clear_queue_bits( queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
509 break;
510 }
511 free_message( msg );
512 }
513
514 /* message timed out without getting a reply */
515 static void result_timeout( void *private )
516 {
517 struct message_result *result = private;
518
519 assert( !result->replied );
520
521 result->timeout = NULL;
522
523 if (result->msg) /* not received yet */
524 {
525 struct message *msg = result->msg;
526
527 result->msg = NULL;
528 msg->result = NULL;
529 remove_queue_message( result->receiver, msg, SEND_MESSAGE );
530 result->receiver = NULL;
531 if (!result->sender)
532 {
533 free_result( result );
534 return;
535 }
536 }
537
538 store_message_result( result, 0, STATUS_TIMEOUT );
539 }
540
541 /* allocate and fill a message result structure */
542 static struct message_result *alloc_message_result( struct msg_queue *send_queue,
543 struct msg_queue *recv_queue,
544 struct message *msg, timeout_t timeout )
545 {
546 struct message_result *result = mem_alloc( sizeof(*result) );
547 if (result)
548 {
549 result->msg = msg;
550 result->sender = send_queue;
551 result->receiver = recv_queue;
552 result->replied = 0;
553 result->data = NULL;
554 result->data_size = 0;
555 result->timeout = NULL;
556
557 if (msg->type == MSG_CALLBACK)
558 {
559 struct message *callback_msg = mem_alloc( sizeof(*callback_msg) );
560
561 if (!callback_msg)
562 {
563 free( result );
564 return NULL;
565 }
566 callback_msg->type = MSG_CALLBACK_RESULT;
567 callback_msg->win = msg->win;
568 callback_msg->msg = msg->msg;
569 callback_msg->wparam = 0;
570 callback_msg->lparam = 0;
571 callback_msg->time = get_tick_count();
572 callback_msg->x = 0;
573 callback_msg->y = 0;
574 callback_msg->info = 0;
575 callback_msg->result = NULL;
576 /* steal the data from the original message */
577 callback_msg->data = msg->data;
578 callback_msg->data_size = msg->data_size;
579 msg->data = NULL;
580 msg->data_size = 0;
581
582 result->callback_msg = callback_msg;
583 list_add_head( &send_queue->callback_result, &result->sender_entry );
584 }
585 else
586 {
587 result->callback_msg = NULL;
588 list_add_head( &send_queue->send_result, &result->sender_entry );
589 }
590
591 if (timeout != TIMEOUT_INFINITE)
592 result->timeout = add_timeout_user( timeout, result_timeout, result );
593 }
594 return result;
595 }
596
597 /* receive a message, removing it from the sent queue */
598 static void receive_message( struct msg_queue *queue, struct message *msg,
599 struct get_message_reply *reply )
600 {
601 struct message_result *result = msg->result;
602
603 reply->total = msg->data_size;
604 if (msg->data_size > get_reply_max_size())
605 {
606 set_error( STATUS_BUFFER_OVERFLOW );
607 return;
608 }
609 reply->type = msg->type;
610 reply->win = msg->win;
611 reply->msg = msg->msg;
612 reply->wparam = msg->wparam;
613 reply->lparam = msg->lparam;
614 reply->x = msg->x;
615 reply->y = msg->y;
616 reply->time = msg->time;
617 reply->info = msg->info;
618
619 if (msg->data) set_reply_data_ptr( msg->data, msg->data_size );
620
621 list_remove( &msg->entry );
622 /* put the result on the receiver result stack */
623 if (result)
624 {
625 result->msg = NULL;
626 result->recv_next = queue->recv_result;
627 queue->recv_result = result;
628 }
629 free( msg );
630 if (list_empty( &queue->msg_list[SEND_MESSAGE] )) clear_queue_bits( queue, QS_SENDMESSAGE );
631 }
632
633 /* set the result of the current received message */
634 static void reply_message( struct msg_queue *queue, unsigned long result,
635 unsigned int error, int remove, const void *data, data_size_t len )
636 {
637 struct message_result *res = queue->recv_result;
638
639 if (remove)
640 {
641 queue->recv_result = res->recv_next;
642 res->receiver = NULL;
643 if (!res->sender) /* no one waiting for it */
644 {
645 free_result( res );
646 return;
647 }
648 }
649 if (!res->replied)
650 {
651 if (len && (res->data = memdup( data, len ))) res->data_size = len;
652 store_message_result( res, result, error );
653 }
654 }
655
656 /* retrieve a posted message */
657 static int get_posted_message( struct msg_queue *queue, user_handle_t win,
658 unsigned int first, unsigned int last, unsigned int flags,
659 struct get_message_reply *reply )
660 {
661 struct message *msg;
662
663 /* check against the filters */
664 LIST_FOR_EACH_ENTRY( msg, &queue->msg_list[POST_MESSAGE], struct message, entry )
665 {
666 if (win && msg->win && msg->win != win && !is_child_window( win, msg->win )) continue;
667 if (!check_msg_filter( msg->msg, first, last )) continue;
668 goto found; /* found one */
669 }
670 return 0;
671
672 /* return it to the app */
673 found:
674 reply->total = msg->data_size;
675 if (msg->data_size > get_reply_max_size())
676 {
677 set_error( STATUS_BUFFER_OVERFLOW );
678 return 1;
679 }
680 reply->type = msg->type;
681 reply->win = msg->win;
682 reply->msg = msg->msg;
683 reply->wparam = msg->wparam;
684 reply->lparam = msg->lparam;
685 reply->x = msg->x;
686 reply->y = msg->y;
687 reply->time = msg->time;
688 reply->info = msg->info;
689
690 if (flags & PM_REMOVE)
691 {
692 if (msg->data)
693 {
694 set_reply_data_ptr( msg->data, msg->data_size );
695 msg->data = NULL;
696 msg->data_size = 0;
697 }
698 remove_queue_message( queue, msg, POST_MESSAGE );
699 }
700 else if (msg->data) set_reply_data( msg->data, msg->data_size );
701
702 return 1;
703 }
704
705 static int get_quit_message( struct msg_queue *queue, unsigned int flags,
706 struct get_message_reply *reply )
707 {
708 if (queue->quit_message)
709 {
710 reply->total = 0;
711 reply->type = MSG_POSTED;
712 reply->win = NULL;
713 reply->msg = WM_QUIT;
714 reply->wparam = queue->exit_code;
715 reply->lparam = 0;
716 reply->x = 0;
717 reply->y = 0;
718 reply->time = get_tick_count();
719 reply->info = 0;
720
721 if (flags & PM_REMOVE)
722 {
723 queue->quit_message = 0;
724 if (list_empty( &queue->msg_list[POST_MESSAGE] ))
725 clear_queue_bits( queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
726 }
727 return 1;
728 }
729 else
730 return 0;
731 }
732
733 /* empty a message list and free all the messages */
734 static void empty_msg_list( struct list *list )
735 {
736 struct list *ptr;
737
738 while ((ptr = list_head( list )) != NULL)
739 {
740 struct message *msg = LIST_ENTRY( ptr, struct message, entry );
741 list_remove( &msg->entry );
742 free_message( msg );
743 }
744 }
745
746 /* cleanup all pending results when deleting a queue */
747 static void cleanup_results( struct msg_queue *queue )
748 {
749 struct list *entry;
750
751 while ((entry = list_head( &queue->send_result )) != NULL)
752 {
753 remove_result_from_sender( LIST_ENTRY( entry, struct message_result, sender_entry ) );
754 }
755
756 while ((entry = list_head( &queue->callback_result )) != NULL)
757 {
758 remove_result_from_sender( LIST_ENTRY( entry, struct message_result, sender_entry ) );
759 }
760
761 while (queue->recv_result)
762 reply_message( queue, 0, STATUS_ACCESS_DENIED /*FIXME*/, 1, NULL, 0 );
763 }
764
765 /* check if the thread owning the queue is hung (not checking for messages) */
766 static int is_queue_hung( struct msg_queue *queue )
767 {
768 struct wait_queue_entry *entry;
769
770 if (current_time - queue->last_get_msg <= 5 * TICKS_PER_SEC)
771 return 0; /* less than 5 seconds since last get message -> not hung */
772
773 LIST_FOR_EACH_ENTRY( entry, &queue->obj.wait_queue, struct wait_queue_entry, entry )
774 {
775 if (entry->thread->queue == queue)
776 return 0; /* thread is waiting on queue -> not hung */
777 }
778 return 1;
779 }
780
781 static int msg_queue_add_queue( struct object *obj, struct wait_queue_entry *entry )
782 {
783 struct msg_queue *queue = (struct msg_queue *)obj;
784 struct process *process = entry->thread->process;
785
786 /* a thread can only wait on its own queue */
787 if (entry->thread->queue != queue)
788 {
789 set_error( STATUS_ACCESS_DENIED );
790 return 0;
791 }
792 /* if waiting on the main process queue, set the idle event */
793 if (process->queue == queue)
794 {
795 if (process->idle_event) set_event( process->idle_event );
796 }
797 if (queue->fd && list_empty( &obj->wait_queue )) /* first on the queue */
798 set_fd_events( queue->fd, POLLIN );
799 add_queue( obj, entry );
800 return 1;
801 }
802
803 static void msg_queue_remove_queue(struct object *obj, struct wait_queue_entry *entry )
804 {
805 struct msg_queue *queue = (struct msg_queue *)obj;
806 struct process *process = entry->thread->process;
807
808 remove_queue( obj, entry );
809 if (queue->fd && list_empty( &obj->wait_queue )) /* last on the queue is gone */
810 set_fd_events( queue->fd, 0 );
811
812 assert( entry->thread->queue == queue );
813
814 /* if waiting on the main process queue, reset the idle event */
815 if (process->queue == queue)
816 {
817 if (process->idle_event) reset_event( process->idle_event );
818 }
819 }
820
821 static void msg_queue_dump( struct object *obj, int verbose )
822 {
823 struct msg_queue *queue = (struct msg_queue *)obj;
824 fprintf( stderr, "Msg queue bits=%x mask=%x\n",
825 queue->wake_bits, queue->wake_mask );
826 }
827
828 static int msg_queue_signaled( struct object *obj, struct thread *thread )
829 {
830 struct msg_queue *queue = (struct msg_queue *)obj;
831 int ret = 0;
832
833 if (queue->fd)
834 {
835 if ((ret = check_fd_events( queue->fd, POLLIN )))
836 /* stop waiting on select() if we are signaled */
837 set_fd_events( queue->fd, 0 );
838 else if (!list_empty( &obj->wait_queue ))
839 /* restart waiting on poll() if we are no longer signaled */
840 set_fd_events( queue->fd, POLLIN );
841 }
842 return ret || is_signaled( queue );
843 }
844
845 static int msg_queue_satisfied( struct object *obj, struct thread *thread )
846 {
847 struct msg_queue *queue = (struct msg_queue *)obj;
848 queue->wake_mask = 0;
849 queue->changed_mask = 0;
850 return 0; /* Not abandoned */
851 }
852
853 static void msg_queue_destroy( struct object *obj )
854 {
855 struct msg_queue *queue = (struct msg_queue *)obj;
856 struct list *ptr;
857 int i;
858
859 cleanup_results( queue );
860 for (i = 0; i < NB_MSG_KINDS; i++) empty_msg_list( &queue->msg_list[i] );
861
862 while ((ptr = list_head( &queue->pending_timers )))
863 {
864 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
865 list_remove( &timer->entry );
866 free( timer );
867 }
868 while ((ptr = list_head( &queue->expired_timers )))
869 {
870 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
871 list_remove( &timer->entry );
872 free( timer );
873 }
874 if (queue->timeout) remove_timeout_user( queue->timeout );
875 if (queue->input) release_object( queue->input );
876 if (queue->hooks) release_object( queue->hooks );
877 if (queue->fd) release_object( queue->fd );
878 }
879
880 static void msg_queue_poll_event( struct fd *fd, int event )
881 {
882 struct msg_queue *queue = get_fd_user( fd );
883 assert( queue->obj.ops == &msg_queue_ops );
884
885 if (event & (POLLERR | POLLHUP)) set_fd_events( fd, -1 );
886 wake_up( &queue->obj, 0 );
887 }
888
889 static void thread_input_dump( struct object *obj, int verbose )
890 {
891 struct thread_input *input = (struct thread_input *)obj;
892 fprintf( stderr, "Thread input focus=%p capture=%p active=%p\n",
893 input->focus, input->capture, input->active );
894 }
895
896 static void thread_input_destroy( struct object *obj )
897 {
898 struct thread_input *input = (struct thread_input *)obj;
899
900 if (foreground_input == input) foreground_input = NULL;
901 empty_msg_list( &input->msg_list );
902 if (input->desktop) release_object( input->desktop );
903 }
904
905 /* fix the thread input data when a window is destroyed */
906 static inline void thread_input_cleanup_window( struct msg_queue *queue, user_handle_t window )
907 {
908 struct thread_input *input = queue->input;
909
910 if (window == input->focus) input->focus = 0;
911 if (window == input->capture) input->capture = 0;
912 if (window == input->active) input->active = 0;
913 if (window == input->menu_owner) input->menu_owner = 0;
914 if (window == input->move_size) input->move_size = 0;
915 if (window == input->caret) set_caret_window( input, 0 );
916 }
917
918 /* check if the specified window can be set in the input data of a given queue */
919 static int check_queue_input_window( struct msg_queue *queue, user_handle_t window )
920 {
921 struct thread *thread;
922 int ret = 0;
923
924 if (!window) return 1; /* we can always clear the data */
925
926 if ((thread = get_window_thread( window )))
927 {
928 ret = (queue->input == thread->queue->input);
929 if (!ret) set_error( STATUS_ACCESS_DENIED );
930 release_object( thread );
931 }
932 else set_error( STATUS_INVALID_HANDLE );
933
934 return ret;
935 }
936
937 /* make sure the specified thread has a queue */
938 int init_thread_queue( struct thread *thread )
939 {
940 if (thread->queue) return 1;
941 return (create_msg_queue( thread, NULL ) != NULL);
942 }
943
944 /* attach two thread input data structures */
945 int attach_thread_input( struct thread *thread_from, struct thread *thread_to )
946 {
947 struct desktop *desktop;
948 struct thread_input *input;
949
950 if (!thread_to->queue && !(thread_to->queue = create_msg_queue( thread_to, NULL ))) return 0;
951 if (!(desktop = get_thread_desktop( thread_from, 0 ))) return 0;
952 input = (struct thread_input *)grab_object( thread_to->queue->input );
953 if (input->desktop != desktop)
954 {
955 set_error( STATUS_ACCESS_DENIED );
956 release_object( input );
957 release_object( desktop );
958 return 0;
959 }
960 release_object( desktop );
961
962 if (thread_from->queue)
963 {
964 release_thread_input( thread_from );
965 thread_from->queue->input = input;
966 }
967 else
968 {
969 if (!(thread_from->queue = create_msg_queue( thread_from, input ))) return 0;
970 }
971 memset( input->keystate, 0, sizeof(input->keystate) );
972 return 1;
973 }
974
975 /* detach two thread input data structures */
976 void detach_thread_input( struct thread *thread_from )
977 {
978 struct thread_input *input;
979
980 if ((input = create_thread_input( thread_from )))
981 {
982 release_thread_input( thread_from );
983 thread_from->queue->input = input;
984 }
985 }
986
987
988 /* set the next timer to expire */
989 static void set_next_timer( struct msg_queue *queue )
990 {
991 struct list *ptr;
992
993 if (queue->timeout)
994 {
995 remove_timeout_user( queue->timeout );
996 queue->timeout = NULL;
997 }
998 if ((ptr = list_head( &queue->pending_timers )))
999 {
1000 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
1001 queue->timeout = add_timeout_user( timer->when, timer_callback, queue );
1002 }
1003 /* set/clear QS_TIMER bit */
1004 if (list_empty( &queue->expired_timers ))
1005 clear_queue_bits( queue, QS_TIMER );
1006 else
1007 set_queue_bits( queue, QS_TIMER );
1008 }
1009
1010 /* find a timer from its window and id */
1011 static struct timer *find_timer( struct msg_queue *queue, user_handle_t win,
1012 unsigned int msg, unsigned long id )
1013 {
1014 struct list *ptr;
1015
1016 /* we need to search both lists */
1017
1018 LIST_FOR_EACH( ptr, &queue->pending_timers )
1019 {
1020 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
1021 if (timer->win == win && timer->msg == msg && timer->id == id) return timer;
1022 }
1023 LIST_FOR_EACH( ptr, &queue->expired_timers )
1024 {
1025 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
1026 if (timer->win == win && timer->msg == msg && timer->id == id) return timer;
1027 }
1028 return NULL;
1029 }
1030
1031 /* callback for the next timer expiration */
1032 static void timer_callback( void *private )
1033 {
1034 struct msg_queue *queue = private;
1035 struct list *ptr;
1036
1037 queue->timeout = NULL;
1038 /* move on to the next timer */
1039 ptr = list_head( &queue->pending_timers );
1040 list_remove( ptr );
1041 list_add_tail( &queue->expired_timers, ptr );
1042 set_next_timer( queue );
1043 }
1044
1045 /* link a timer at its rightful place in the queue list */
1046 static void link_timer( struct msg_queue *queue, struct timer *timer )
1047 {
1048 struct list *ptr;
1049
1050 for (ptr = queue->pending_timers.next; ptr != &queue->pending_timers; ptr = ptr->next)
1051 {
1052 struct timer *t = LIST_ENTRY( ptr, struct timer, entry );
1053 if (t->when >= timer->when) break;
1054 }
1055 list_add_before( ptr, &timer->entry );
1056 }
1057
1058 /* remove a timer from the queue timer list and free it */
1059 static void free_timer( struct msg_queue *queue, struct timer *timer )
1060 {
1061 list_remove( &timer->entry );
1062 free( timer );
1063 set_next_timer( queue );
1064 }
1065
1066 /* restart an expired timer */
1067 static void restart_timer( struct msg_queue *queue, struct timer *timer )
1068 {
1069 list_remove( &timer->entry );
1070 while (timer->when <= current_time) timer->when += (timeout_t)timer->rate * 10000;
1071 link_timer( queue, timer );
1072 set_next_timer( queue );
1073 }
1074
1075 /* find an expired timer matching the filtering parameters */
1076 static struct timer *find_expired_timer( struct msg_queue *queue, user_handle_t win,
1077 unsigned int get_first, unsigned int get_last,
1078 int remove )
1079 {
1080 struct list *ptr;
1081
1082 LIST_FOR_EACH( ptr, &queue->expired_timers )
1083 {
1084 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
1085 if (win && timer->win != win) continue;
1086 if (check_msg_filter( timer->msg, get_first, get_last ))
1087 {
1088 if (remove) restart_timer( queue, timer );
1089 return timer;
1090 }
1091 }
1092 return NULL;
1093 }
1094
1095 /* add a timer */
1096 static struct timer *set_timer( struct msg_queue *queue, unsigned int rate )
1097 {
1098 struct timer *timer = mem_alloc( sizeof(*timer) );
1099 if (timer)
1100 {
1101 timer->rate = max( rate, 1 );
1102 timer->when = current_time + (timeout_t)timer->rate * 10000;
1103 link_timer( queue, timer );
1104 /* check if we replaced the next timer */
1105 if (list_head( &queue->pending_timers ) == &timer->entry) set_next_timer( queue );
1106 }
1107 return timer;
1108 }
1109
1110 /* change the input key state for a given key */
1111 static void set_input_key_state( struct thread_input *input, unsigned char key, int down )
1112 {
1113 if (down)
1114 {
1115 if (!(input->keystate[key] & 0x80)) input->keystate[key] ^= 0x01;
1116 input->keystate[key] |= 0x80;
1117 }
1118 else input->keystate[key] &= ~0x80;
1119 }
1120
1121 /* update the input key state for a keyboard message */
1122 static void update_input_key_state( struct thread_input *input, const struct message *msg )
1123 {
1124 unsigned char key;
1125 int down = 0;
1126
1127 switch (msg->msg)
1128 {
1129 case WM_LBUTTONDOWN:
1130 down = 1;
1131 /* fall through */
1132 case WM_LBUTTONUP:
1133 set_input_key_state( input, VK_LBUTTON, down );
1134 break;
1135 case WM_MBUTTONDOWN:
1136 down = 1;
1137 /* fall through */
1138 case WM_MBUTTONUP:
1139 set_input_key_state( input, VK_MBUTTON, down );
1140 break;
1141 case WM_RBUTTONDOWN:
1142 down = 1;
1143 /* fall through */
1144 case WM_RBUTTONUP:
1145 set_input_key_state( input, VK_RBUTTON, down );
1146 break;
1147 case WM_XBUTTONDOWN:
1148 down = 1;
1149 /* fall through */
1150 case WM_XBUTTONUP:
1151 if (msg->wparam == XBUTTON1) set_input_key_state( input, VK_XBUTTON1, down );
1152 else if (msg->wparam == XBUTTON2) set_input_key_state( input, VK_XBUTTON2, down );
1153 break;
1154 case WM_KEYDOWN:
1155 case WM_SYSKEYDOWN:
1156 down = 1;
1157 /* fall through */
1158 case WM_KEYUP:
1159 case WM_SYSKEYUP:
1160 key = (unsigned char)msg->wparam;
1161 set_input_key_state( input, key, down );
1162 switch(key)
1163 {
1164 case VK_LCONTROL:
1165 case VK_RCONTROL:
1166 down = (input->keystate[VK_LCONTROL] | input->keystate[VK_RCONTROL]) & 0x80;
1167 set_input_key_state( input, VK_CONTROL, down );
1168 break;
1169 case VK_LMENU:
1170 case VK_RMENU:
1171 down = (input->keystate[VK_LMENU] | input->keystate[VK_RMENU]) & 0x80;
1172 set_input_key_state( input, VK_MENU, down );
1173 break;
1174 case VK_LSHIFT:
1175 case VK_RSHIFT:
1176 down = (input->keystate[VK_LSHIFT] | input->keystate[VK_RSHIFT]) & 0x80;
1177 set_input_key_state( input, VK_SHIFT, down );
1178 break;
1179 }
1180 break;
1181 }
1182 }
1183
1184 /* release the hardware message currently being processed by the given thread */
1185 static void release_hardware_message( struct msg_queue *queue, unsigned int hw_id,
1186 int remove, user_handle_t new_win )
1187 {
1188 struct thread_input *input = queue->input;
1189 struct message *msg;
1190
1191 LIST_FOR_EACH_ENTRY( msg, &input->msg_list, struct message, entry )
1192 {
1193 if (msg->unique_id == hw_id) break;
1194 }
1195 if (&msg->entry == &input->msg_list) return; /* not found */
1196
1197 /* clear the queue bit for that message */
1198 if (remove || new_win)
1199 {
1200 struct message *other;
1201 int clr_bit;
1202
1203 clr_bit = get_hardware_msg_bit( msg );
1204 LIST_FOR_EACH_ENTRY( other, &input->msg_list, struct message, entry )
1205 {
1206 if (other != msg && get_hardware_msg_bit( other ) == clr_bit)
1207 {
1208 clr_bit = 0;
1209 break;
1210 }
1211 }
1212 if (clr_bit) clear_queue_bits( queue, clr_bit );
1213 }
1214
1215 if (new_win) /* set the new window */
1216 {
1217 struct thread *owner = get_window_thread( new_win );
1218 if (owner)
1219 {
1220 msg->win = new_win;
1221 if (owner->queue->input != input)
1222 {
1223 list_remove( &msg->entry );
1224 if (msg->msg == WM_MOUSEMOVE && merge_message( owner->queue->input, msg ))
1225 {
1226 free_message( msg );
1227 release_object( owner );
1228 return;
1229 }
1230 list_add_tail( &owner->queue->input->msg_list, &msg->entry );
1231 }
1232 set_queue_bits( owner->queue, get_hardware_msg_bit( msg ));
1233 remove = 0;
1234 release_object( owner );
1235 }
1236 }
1237 if (remove)
1238 {
1239 update_input_key_state( input, msg );
1240 list_remove( &msg->entry );
1241 free_message( msg );
1242 }
1243 }
1244
1245 /* find the window that should receive a given hardware message */
1246 static user_handle_t find_hardware_message_window( struct thread_input *input, struct message *msg,
1247 unsigned int *msg_code )
1248 {
1249 user_handle_t win = 0;
1250
1251 *msg_code = msg->msg;
1252 if (is_keyboard_msg( msg ))
1253 {
1254 if (input && !(win = input->focus))
1255 {
1256 win = input->active;
1257 if (*msg_code < WM_SYSKEYDOWN) *msg_code += WM_SYSKEYDOWN - WM_KEYDOWN;
1258 }
1259 }
1260 else /* mouse message */
1261 {
1262 if (!input || !(win = input->capture))
1263 {
1264 if (!(win = msg->win) || !is_window_visible( win ))
1265 {
1266 if (input) win = window_from_point( input->desktop, msg->x, msg->y );
1267 }
1268 }
1269 }
1270 return win;
1271 }
1272
1273 /* queue a hardware message into a given thread input */
1274 static void queue_hardware_message( struct msg_queue *queue, struct message *msg )
1275 {
1276 user_handle_t win;
1277 struct thread *thread;
1278 struct thread_input *input = queue ? queue->input : foreground_input;
1279 unsigned int msg_code;
1280
1281 last_input_time = get_tick_count();
1282 win = find_hardware_message_window( input, msg, &msg_code );
1283 if (!win || !(thread = get_window_thread(win)))
1284 {
1285 if (input) update_input_key_state( input, msg );
1286 free( msg );
1287 return;
1288 }
1289 input = thread->queue->input;
1290
1291 if (msg->msg == WM_MOUSEMOVE && merge_message( input, msg )) free( msg );
1292 else
1293 {
1294 msg->unique_id = 0; /* will be set once we return it to the app */
1295 list_add_tail( &input->msg_list, &msg->entry );
1296 set_queue_bits( thread->queue, get_hardware_msg_bit(msg) );
1297 }
1298 release_object( thread );
1299 }
1300
1301 /* check message filter for a hardware message */
1302 static int check_hw_message_filter( user_handle_t win, unsigned int msg_code,
1303 user_handle_t filter_win, unsigned int first, unsigned int last )
1304 {
1305 if (msg_code >= WM_KEYFIRST && msg_code <= WM_KEYLAST)
1306 {
1307 /* we can only test the window for a keyboard message since the
1308 * dest window for a mouse message depends on hittest */
1309 if (filter_win && win != filter_win && !is_child_window( filter_win, win ))
1310 return 0;
1311 /* the message code is final for a keyboard message, we can simply check it */
1312 return check_msg_filter( msg_code, first, last );
1313 }
1314 else /* mouse message */
1315 {
1316 /* we need to check all possible values that the message can have in the end */
1317
1318 if (check_msg_filter( msg_code, first, last )) return 1;
1319 if (msg_code == WM_MOUSEWHEEL) return 0; /* no other possible value for this one */
1320
1321 /* all other messages can become non-client messages */
1322 if (check_msg_filter( msg_code + (WM_NCMOUSEFIRST - WM_MOUSEFIRST), first, last )) return 1;
1323
1324 /* clicks can become double-clicks or non-client double-clicks */
1325 if (msg_code == WM_LBUTTONDOWN || msg_code == WM_MBUTTONDOWN ||
1326 msg_code == WM_RBUTTONDOWN || msg_code == WM_XBUTTONDOWN)
1327 {
1328 if (check_msg_filter( msg_code + (WM_LBUTTONDBLCLK - WM_LBUTTONDOWN), first, last )) return 1;
1329 if (check_msg_filter( msg_code + (WM_NCLBUTTONDBLCLK - WM_LBUTTONDOWN), first, last )) return 1;
1330 }
1331 return 0;
1332 }
1333 }
1334
1335
1336 /* find a hardware message for the given queue */
1337 static int get_hardware_message( struct thread *thread, unsigned int hw_id, user_handle_t filter_win,
1338 unsigned int first, unsigned int last, struct get_message_reply *reply )
1339 {
1340 struct thread_input *input = thread->queue->input;
1341 struct thread *win_thread;
1342 struct list *ptr;
1343 user_handle_t win;
1344 int clear_bits, got_one = 0;
1345 unsigned int msg_code;
1346
1347 ptr = list_head( &input->msg_list );
1348 if (hw_id)
1349 {
1350 while (ptr)
1351 {
1352 struct message *msg = LIST_ENTRY( ptr, struct message, entry );
1353 if (msg->unique_id == hw_id) break;
1354 ptr = list_next( &input->msg_list, ptr );
1355 }
1356 if (!ptr) ptr = list_head( &input->msg_list );
1357 else ptr = list_next( &input->msg_list, ptr ); /* start from the next one */
1358 }
1359
1360 if (ptr == list_head( &input->msg_list ))
1361 clear_bits = QS_KEY | QS_MOUSEMOVE | QS_MOUSEBUTTON;
1362 else
1363 clear_bits = 0; /* don't clear bits if we don't go through the whole list */
1364
1365 while (ptr)
1366 {
1367 struct message *msg = LIST_ENTRY( ptr, struct message, entry );
1368 ptr = list_next( &input->msg_list, ptr );
1369 win = find_hardware_message_window( input, msg, &msg_code );
1370 if (!win || !(win_thread = get_window_thread( win )))
1371 {
1372 /* no window at all, remove it */
1373 update_input_key_state( input, msg );
1374 list_remove( &msg->entry );
1375 free_message( msg );
1376 continue;
1377 }
1378 if (win_thread != thread)
1379 {
1380 if (win_thread->queue->input == input)
1381 {
1382 /* wake the other thread */
1383 set_queue_bits( win_thread->queue, get_hardware_msg_bit(msg) );
1384 got_one = 1;
1385 }
1386 else
1387 {
1388 /* for another thread input, drop it */
1389 update_input_key_state( input, msg );
1390 list_remove( &msg->entry );
1391 free_message( msg );
1392 }
1393 release_object( win_thread );
1394 continue;
1395 }
1396 release_object( win_thread );
1397
1398 /* if we already got a message for another thread, or if it doesn't
1399 * match the filter we skip it */
1400 if (got_one || !check_hw_message_filter( win, msg_code, filter_win, first, last ))
1401 {
1402 clear_bits &= ~get_hardware_msg_bit( msg );
1403 continue;
1404 }
1405 /* now we can return it */
1406 if (!msg->unique_id) msg->unique_id = get_unique_id();
1407 reply->type = MSG_HARDWARE;
1408 reply->win = win;
1409 reply->msg = msg_code;
1410 reply->wparam = msg->wparam;
1411 reply->lparam = msg->lparam;
1412 reply->x = msg->x;
1413 reply->y = msg->y;
1414 reply->time = msg->time;
1415 reply->info = msg->info;
1416 reply->hw_id = msg->unique_id;
1417 return 1;
1418 }
1419 /* nothing found, clear the hardware queue bits */
1420 clear_queue_bits( thread->queue, clear_bits );
1421 return 0;
1422 }
1423
1424 /* increment (or decrement if 'incr' is negative) the queue paint count */
1425 void inc_queue_paint_count( struct thread *thread, int incr )
1426 {
1427 struct msg_queue *queue = thread->queue;
1428
1429 assert( queue );
1430
1431 if ((queue->paint_count += incr) < 0) queue->paint_count = 0;
1432
1433 if (queue->paint_count)
1434 set_queue_bits( queue, QS_PAINT );
1435 else
1436 clear_queue_bits( queue, QS_PAINT );
1437 }
1438
1439
1440 /* remove all messages and timers belonging to a certain window */
1441 void queue_cleanup_window( struct thread *thread, user_handle_t win )
1442 {
1443 struct msg_queue *queue = thread->queue;
1444 struct list *ptr;
1445 int i;
1446
1447 if (!queue) return;
1448
1449 /* remove timers */
1450
1451 ptr = list_head( &queue->pending_timers );
1452 while (ptr)
1453 {
1454 struct list *next = list_next( &queue->pending_timers, ptr );
1455 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
1456 if (timer->win == win) free_timer( queue, timer );
1457 ptr = next;
1458 }
1459 ptr = list_head( &queue->expired_timers );
1460 while (ptr)
1461 {
1462 struct list *next = list_next( &queue->expired_timers, ptr );
1463 struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
1464 if (timer->win == win) free_timer( queue, timer );
1465 ptr = next;
1466 }
1467
1468 /* remove messages */
1469 for (i = 0; i < NB_MSG_KINDS; i++)
1470 {
1471 struct list *ptr, *next;
1472
1473 LIST_FOR_EACH_SAFE( ptr, next, &queue->msg_list[i] )
1474 {
1475 struct message *msg = LIST_ENTRY( ptr, struct message, entry );
1476 if (msg->win == win) remove_queue_message( queue, msg, i );
1477 }
1478 }
1479
1480 thread_input_cleanup_window( queue, win );
1481 }
1482
1483 /* post a message to a window; used by socket handling */
1484 void post_message( user_handle_t win, unsigned int message,
1485 unsigned long wparam, unsigned long lparam )
1486 {
1487 struct message *msg;
1488 struct thread *thread = get_window_thread( win );
1489
1490 if (!thread) return;
1491
1492 if (thread->queue && (msg = mem_alloc( sizeof(*msg) )))
1493 {
1494 msg->type = MSG_POSTED;
1495 msg->win = get_user_full_handle( win );
1496 msg->msg = message;
1497 msg->wparam = wparam;
1498 msg->lparam = lparam;
1499 msg->time = get_tick_count();
1500 msg->x = 0;
1501 msg->y = 0;
1502 msg->info = 0;
1503 msg->result = NULL;
1504 msg->data = NULL;
1505 msg->data_size = 0;
1506
1507 list_add_tail( &thread->queue->msg_list[POST_MESSAGE], &msg->entry );
1508 set_queue_bits( thread->queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
1509 }
1510 release_object( thread );
1511 }
1512
1513 /* post a win event */
1514 void post_win_event( struct thread *thread, unsigned int event,
1515 user_handle_t win, unsigned int object_id,
1516 unsigned int child_id, void *hook_proc,
1517 const WCHAR *module, data_size_t module_size,
1518 user_handle_t hook)
1519 {
1520 struct message *msg;
1521
1522 if (thread->queue && (msg = mem_alloc( sizeof(*msg) )))
1523 {
1524 struct winevent_msg_data *data;
1525
1526 msg->type = MSG_WINEVENT;
1527 msg->win = get_user_full_handle( win );
1528 msg->msg = event;
1529 msg->wparam = object_id;
1530 msg->lparam = child_id;
1531 msg->time = get_tick_count();
1532 msg->x = 0;
1533 msg->y = 0;
1534 msg->info = 0;
1535 msg->result = NULL;
1536
1537 if ((data = malloc( sizeof(*data) + module_size )))
1538 {
1539 data->hook = hook;
1540 data->tid = get_thread_id( current );
1541 data->hook_proc = hook_proc;
1542 memcpy( data + 1, module, module_size );
1543
1544 msg->data = data;
1545 msg->data_size = sizeof(*data) + module_size;
1546
1547 if (debug_level > 1)
1548 fprintf( stderr, "post_win_event: tid %04x event %04x win %p object_id %d child_id %d\n",
1549 get_thread_id(thread), event, win, object_id, child_id );
1550 list_add_tail( &thread->queue->msg_list[SEND_MESSAGE], &msg->entry );
1551 set_queue_bits( thread->queue, QS_SENDMESSAGE );
1552 }
1553 else
1554 free( msg );
1555 }
1556 }
1557
1558
1559 /* check if the thread owning the window is hung */
1560 DECL_HANDLER(is_window_hung)
1561 {
1562 struct thread *thread;
1563
1564 thread = get_window_thread( req->win );
1565 if (thread)
1566 {
1567 reply->is_hung = is_queue_hung( thread->queue );
1568 release_object( thread );
1569 }
1570 else reply->is_hung = 0;
1571 }
1572
1573
1574 /* get the message queue of the current thread */
1575 DECL_HANDLER(get_msg_queue)
1576 {
1577 struct msg_queue *queue = get_current_queue();
1578
1579 reply->handle = 0;
1580 if (queue) reply->handle = alloc_handle( current->process, queue, SYNCHRONIZE, 0 );
1581 }
1582
1583
1584 /* set the file descriptor associated to the current thread queue */
1585 DECL_HANDLER(set_queue_fd)
1586 {
1587 struct msg_queue *queue = get_current_queue();
1588 struct file *file;
1589 int unix_fd;
1590
1591 if (queue->fd) /* fd can only be set once */
1592 {
1593 set_error( STATUS_ACCESS_DENIED );
1594 return;
1595 }
1596 if (!(file = get_file_obj( current->process, req->handle, SYNCHRONIZE ))) return;
1597
1598 if ((unix_fd = get_file_unix_fd( file )) != -1)
1599 {
1600 if ((unix_fd = dup( unix_fd )) != -1)
1601 queue->fd = create_anonymous_fd( &msg_queue_fd_ops, unix_fd, &queue->obj, 0 );
1602 else
1603 file_set_error();
1604 }
1605 release_object( file );
1606 }
1607
1608
1609 /* set the current message queue wakeup mask */
1610 DECL_HANDLER(set_queue_mask)
1611 {
1612 struct msg_queue *queue = get_current_queue();
1613
1614 if (queue)
1615 {
1616 queue->wake_mask = req->wake_mask;
1617 queue->changed_mask = req->changed_mask;
1618 reply->wake_bits = queue->wake_bits;
1619 reply->changed_bits = queue->changed_bits;
1620 if (is_signaled( queue ))
1621 {
1622 /* if skip wait is set, do what would have been done in the subsequent wait */
1623 if (req->skip_wait) msg_queue_satisfied( &queue->obj, current );
1624 else wake_up( &queue->obj, 0 );
1625 }
1626 }
1627 }
1628
1629
1630 /* get the current message queue status */
1631 DECL_HANDLER(get_queue_status)
1632 {
1633 struct msg_queue *queue = current->queue;
1634 if (queue)
1635 {
1636 reply->wake_bits = queue->wake_bits;
1637 reply->changed_bits = queue->changed_bits;
1638 if (req->clear) queue->changed_bits = 0;
1639 }
1640 else reply->wake_bits = reply->changed_bits = 0;
1641 }
1642
1643
1644 /* send a message to a thread queue */
1645 DECL_HANDLER(send_message)
1646 {
1647 struct message *msg;
1648 struct msg_queue *send_queue = get_current_queue();
1649 struct msg_queue *recv_queue = NULL;
1650 struct thread *thread = NULL;
1651
1652 if (!(thread = get_thread_from_id( req->id ))) return;
1653
1654 if (!(recv_queue = thread->queue))
1655 {
1656 set_error( STATUS_INVALID_PARAMETER );
1657 release_object( thread );
1658 return;
1659 }
1660 if ((req->flags & SEND_MSG_ABORT_IF_HUNG) && is_queue_hung(recv_queue))
1661 {
1662 set_error( STATUS_TIMEOUT );
1663 release_object( thread );
1664 return;
1665 }
1666
1667 if ((msg = mem_alloc( sizeof(*msg) )))
1668 {
1669 msg->type = req->type;
1670 msg->win = get_user_full_handle( req->win );
1671 msg->msg = req->msg;
1672 msg->wparam = req->wparam;
1673 msg->lparam = req->lparam;
1674 msg->time = get_tick_count();
1675 msg->x = 0;
1676 msg->y = 0;
1677 msg->info = 0;
1678 msg->result = NULL;
1679 msg->data = NULL;
1680 msg->data_size = get_req_data_size();
1681
1682 if (msg->data_size && !(msg->data = memdup( get_req_data(), msg->data_size )))
1683 {
1684 free( msg );
1685 release_object( thread );
1686 return;
1687 }
1688
1689 switch(msg->type)
1690 {
1691 case MSG_OTHER_PROCESS:
1692 case MSG_ASCII:
1693 case MSG_UNICODE:
1694 case MSG_CALLBACK:
1695 if (!(msg->result = alloc_message_result( send_queue, recv_queue, msg, req->timeout )))
1696 {
1697 free_message( msg );
1698 break;
1699 }
1700 /* fall through */
1701 case MSG_NOTIFY:
1702 list_add_tail( &recv_queue->msg_list[SEND_MESSAGE], &msg->entry );
1703 set_queue_bits( recv_queue, QS_SENDMESSAGE );
1704 break;
1705 case MSG_POSTED:
1706 list_add_tail( &recv_queue->msg_list[POST_MESSAGE], &msg->entry );
1707 set_queue_bits( recv_queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
1708 break;
1709 case MSG_HARDWARE: /* should use send_hardware_message instead */
1710 case MSG_CALLBACK_RESULT: /* cannot send this one */
1711 default:
1712 set_error( STATUS_INVALID_PARAMETER );
1713 free( msg );
1714 break;
1715 }
1716 }
1717 release_object( thread );
1718 }
1719
1720 /* send a hardware message to a thread queue */
1721 DECL_HANDLER(send_hardware_message)
1722 {
1723 struct message *msg;
1724 struct msg_queue *recv_queue = NULL;
1725 struct thread *thread = NULL;
1726
1727 if (req->id)
1728 {
1729 if (!(thread = get_thread_from_id( req->id ))) return;
1730 }
1731
1732 if (thread && !(recv_queue = thread->queue))
1733 {
1734 set_error( STATUS_INVALID_PARAMETER );
1735 release_object( thread );
1736 return;
1737 }
1738
1739 if ((msg = mem_alloc( sizeof(*msg) )))
1740 {
1741 msg->type = MSG_HARDWARE;
1742 msg->win = get_user_full_handle( req->win );
1743 msg->msg = req->msg;
1744 msg->wparam = req->wparam;
1745 msg->lparam = req->lparam;
1746 msg->time = req->time;
1747 msg->x = req->x;
1748 msg->y = req->y;
1749 msg->info = req->info;
1750 msg->result = NULL;
1751 msg->data = NULL;
1752 msg->data_size = 0;
1753 queue_hardware_message( recv_queue, msg );
1754 }
1755 if (thread) release_object( thread );
1756 }
1757
1758 /* post a quit message to the current queue */
1759 DECL_HANDLER(post_quit_message)
1760 {
1761 struct msg_queue *queue = get_current_queue();
1762
1763 if (!queue)
1764 return;
1765
1766 queue->quit_message = 1;
1767 queue->exit_code = req->exit_code;
1768 set_queue_bits( queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
1769 }
1770
1771 /* get a message from the current queue */
1772 DECL_HANDLER(get_message)
1773 {
1774 struct timer *timer;
1775 struct list *ptr;
1776 struct msg_queue *queue = get_current_queue();
1777 user_handle_t get_win = get_user_full_handle( req->get_win );
1778 unsigned int filter = req->flags >> 16;
1779
1780 reply->active_hooks = get_active_hooks();
1781
1782 if (!queue) return;
1783 queue->last_get_msg = current_time;
1784 if (!filter) filter = QS_ALLINPUT;
1785
1786 /* first check for sent messages */
1787 if ((ptr = list_head( &queue->msg_list[SEND_MESSAGE] )))
1788 {
1789 struct message *msg = LIST_ENTRY( ptr, struct message, entry );
1790 receive_message( queue, msg, reply );
1791 return;
1792 }
1793
1794 /* clear changed bits so we can wait on them if we don't find a message */
1795 if (filter & QS_POSTMESSAGE)
1796 {
1797 queue->changed_bits &= ~(QS_POSTMESSAGE | QS_HOTKEY | QS_TIMER);
1798 if (req->get_first == 0 && req->get_last == ~0U) queue->changed_bits &= ~QS_ALLPOSTMESSAGE;
1799 }
1800 if (filter & QS_INPUT) queue->changed_bits &= ~QS_INPUT;
1801 if (filter & QS_PAINT) queue->changed_bits &= ~QS_PAINT;
1802
1803 /* then check for posted messages */
1804 if ((filter & QS_POSTMESSAGE) &&
1805 get_posted_message( queue, get_win, req->get_first, req->get_last, req->flags, reply ))
1806 return;
1807
1808 /* only check for quit messages if not posted messages pending.
1809 * note: the quit message isn't filtered */
1810 if (get_quit_message( queue, req->flags, reply ))
1811 return;
1812
1813 /* then check for any raw hardware message */
1814 if ((filter & QS_INPUT) &&
1815 filter_contains_hw_range( req->get_first, req->get_last ) &&
1816 get_hardware_message( current, req->hw_id, get_win, req->get_first, req->get_last, reply ))
1817 return;
1818
1819 /* now check for WM_PAINT */
1820 if ((filter & QS_PAINT) &&
1821 queue->paint_count &&
1822 check_msg_filter( WM_PAINT, req->get_first, req->get_last ) &&
1823 (reply->win = find_window_to_repaint( get_win, current )))
1824 {
1825 reply->type = MSG_POSTED;
1826 reply->msg = WM_PAINT;
1827 reply->wparam = 0;
1828 reply->lparam = 0;
1829 reply->x = 0;
1830 reply->y = 0;
1831 reply->time = get_tick_count();
1832 reply->info = 0;
1833 return;
1834 }
1835
1836 /* now check for timer */
1837 if ((filter & QS_TIMER) &&
1838 (timer = find_expired_timer( queue, get_win, req->get_first,
1839 req->get_last, (req->flags & PM_REMOVE) )))
1840 {
1841 reply->type = MSG_POSTED;
1842 reply->win = timer->win;
1843 reply->msg = timer->msg;
1844 reply->wparam = timer->id;
1845 reply->lparam = timer->lparam;
1846 reply->x = 0;
1847 reply->y = 0;
1848 reply->time = get_tick_count();
1849 reply->info = 0;
1850 return;
1851 }
1852
1853 queue->wake_mask = req->wake_mask;
1854 queue->changed_mask = req->changed_mask;
1855 set_error( STATUS_PENDING ); /* FIXME */
1856 }
1857
1858
1859 /* reply to a sent message */
1860 DECL_HANDLER(reply_message)
1861 {
1862 if (!current->queue) set_error( STATUS_ACCESS_DENIED );
1863 else if (current->queue->recv_result)
1864 reply_message( current->queue, req->result, 0, req->remove,
1865 get_req_data(), get_req_data_size() );
1866 }
1867
1868
1869 /* accept the current hardware message */
1870 DECL_HANDLER(accept_hardware_message)
1871 {
1872 if (current->queue)
1873 release_hardware_message( current->queue, req->hw_id, req->remove, req->new_win );
1874 else
1875 set_error( STATUS_ACCESS_DENIED );
1876 }
1877
1878
1879 /* retrieve the reply for the last message sent */
1880 DECL_HANDLER(get_message_reply)
1881 {
1882 struct message_result *result;
1883 struct list *entry;
1884 struct msg_queue *queue = current->queue;
1885
1886 if (queue)
1887 {
1888 set_error( STATUS_PENDING );
1889 reply->result = 0;
1890
1891 if (!(entry = list_head( &queue->send_result ))) return; /* no reply ready */
1892
1893 result = LIST_ENTRY( entry, struct message_result, sender_entry );
1894 if (result->replied || req->cancel)
1895 {
1896 if (result->replied)
1897 {
1898 reply->result = result->result;
1899 set_error( result->error );
1900 if (result->data)
1901 {
1902 data_size_t data_len = min( result->data_size, get_reply_max_size() );
1903 set_reply_data_ptr( result->data, data_len );
1904 result->data = NULL;
1905 result->data_size = 0;
1906 }
1907 }
1908 remove_result_from_sender( result );
1909
1910 entry = list_head( &queue->send_result );
1911 if (!entry) clear_queue_bits( queue, QS_SMRESULT );
1912 else
1913 {
1914 result = LIST_ENTRY( entry, struct message_result, sender_entry );
1915 if (!result->replied) clear_queue_bits( queue, QS_SMRESULT );
1916 }
1917 }
1918 }
1919 else set_error( STATUS_ACCESS_DENIED );
1920 }
1921
1922
1923 /* set a window timer */
1924 DECL_HANDLER(set_win_timer)
1925 {
1926 struct timer *timer;
1927 struct msg_queue *queue;
1928 struct thread *thread = NULL;
1929 user_handle_t win = 0;
1930 unsigned long id = req->id;
1931
1932 if (req->win)
1933 {
1934 if (!(win = get_user_full_handle( req->win )) || !(thread = get_window_thread( win )))
1935 {
1936 set_error( STATUS_INVALID_HANDLE );
1937 return;
1938 }
1939 if (thread->process != current->process)
1940 {
1941 release_object( thread );
1942 set_error( STATUS_ACCESS_DENIED );
1943 return;
1944 }
1945 queue = thread->queue;
1946 /* remove it if it existed already */
1947 if ((timer = find_timer( queue, win, req->msg, id ))) free_timer( queue, timer );
1948 }
1949 else
1950 {
1951 queue = get_current_queue();
1952 /* look for a timer with this id */
1953 if (id && (timer = find_timer( queue, NULL, req->msg, id )))
1954 {
1955 /* free and reuse id */
1956 free_timer( queue, timer );
1957 }
1958 else
1959 {
1960 /* find a free id for it */
1961 do
1962 {
1963 id = queue->next_timer_id;
1964 if (--queue->next_timer_id <= 0x100) queue->next_timer_id = 0x7fff;
1965 }
1966 while (find_timer( queue, 0, req->msg, id ));
1967 }
1968 }
1969
1970 if ((timer = set_timer( queue, req->rate )))
1971 {
1972 timer->win = win;
1973 timer->msg = req->msg;
1974 timer->id = id;
1975 timer->lparam = req->lparam;
1976 reply->id = id;
1977 }
1978 if (thread) release_object( thread );
1979 }
1980
1981 /* kill a window timer */
1982 DECL_HANDLER(kill_win_timer)
1983 {
1984 struct timer *timer;
1985 struct thread *thread;
1986 user_handle_t win = 0;
1987
1988 if (req->win)
1989 {
1990 if (!(win = get_user_full_handle( req->win )) || !(thread = get_window_thread( win )))
1991 {
1992 set_error( STATUS_INVALID_HANDLE );
1993 return;
1994 }
1995 if (thread->process != current->process)
1996 {
1997 release_object( thread );
1998 set_error( STATUS_ACCESS_DENIED );
1999 return;
2000 }
2001 }
2002 else thread = (struct thread *)grab_object( current );
2003
2004 if (thread->queue && (timer = find_timer( thread->queue, win, req->msg, req->id )))
2005 free_timer( thread->queue, timer );
2006 else
2007 set_error( STATUS_INVALID_PARAMETER );
2008
2009 release_object( thread );
2010 }
2011
2012
2013 /* attach (or detach) thread inputs */
2014 DECL_HANDLER(attach_thread_input)
2015 {
2016 struct thread *thread_from = get_thread_from_id( req->tid_from );
2017 struct thread *thread_to = get_thread_from_id( req->tid_to );
2018
2019 if (!thread_from || !thread_to)
2020 {
2021 if (thread_from) release_object( thread_from );
2022 if (thread_to) release_object( thread_to );
2023 return;
2024 }
2025 if (thread_from != thread_to)
2026 {
2027 if (req->attach) attach_thread_input( thread_from, thread_to );
2028 else
2029 {
2030 if (thread_from->queue && thread_to->queue &&
2031 thread_from->queue->input == thread_to->queue->input)
2032 detach_thread_input( thread_from );
2033 else
2034 set_error( STATUS_ACCESS_DENIED );
2035 }
2036 }
2037 else set_error( STATUS_ACCESS_DENIED );
2038 release_object( thread_from );
2039 release_object( thread_to );
2040 }
2041
2042
2043 /* get thread input data */
2044 DECL_HANDLER(get_thread_input)
2045 {
2046 struct thread *thread = NULL;
2047 struct thread_input *input;
2048
2049 if (req->tid)
2050 {
2051 if (!(thread = get_thread_from_id( req->tid ))) return;
2052 input = thread->queue ? thread->queue->input : NULL;
2053 }
2054 else input = foreground_input; /* get the foreground thread info */
2055
2056 if (input)
2057 {
2058 reply->focus = input->focus;
2059 reply->capture = input->capture;
2060 reply->active = input->active;
2061 reply->menu_owner = input->menu_owner;
2062 reply->move_size = input->move_size;
2063 reply->caret = input->caret;
2064 reply->rect = input->caret_rect;
2065 }
2066 else
2067 {
2068 reply->focus = 0;
2069 reply->capture = 0;
2070 reply->active = 0;
2071 reply->menu_owner = 0;
2072 reply->move_size = 0;
2073 reply->caret = 0;
2074 reply->rect.left = reply->rect.top = reply->rect.right = reply->rect.bottom = 0;
2075 }
2076 /* foreground window is active window of foreground thread */
2077 reply->foreground = foreground_input ? foreground_input->active : 0;
2078 if (thread) release_object( thread );
2079 }
2080
2081
2082 /* retrieve queue keyboard state for a given thread */
2083 DECL_HANDLER(get_key_state)
2084 {
2085 struct thread *thread;
2086 struct thread_input *input;
2087
2088 if (!(thread = get_thread_from_id( req->tid ))) return;
2089 input = thread->queue ? thread->queue->input : NULL;
2090 if (input)
2091 {
2092 if (req->key >= 0) reply->state = input->keystate[req->key & 0xff];
2093 set_reply_data( input->keystate, min( get_reply_max_size(), sizeof(input->keystate) ));
2094 }
2095 release_object( thread );
2096 }
2097
2098
2099 /* set queue keyboard state for a given thread */
2100 DECL_HANDLER(set_key_state)
2101 {
2102 struct thread *thread = NULL;
2103 struct thread_input *input;
2104
2105 if (!(thread = get_thread_from_id( req->tid ))) return;
2106 input = thread->queue ? thread->queue->input : NULL;
2107 if (input)
2108 {
2109 data_size_t size = min( sizeof(input->keystate), get_req_data_size() );
2110 if (size) memcpy( input->keystate, get_req_data(), size );
2111 }
2112 release_object( thread );
2113 }
2114
2115
2116 /* set the system foreground window */
2117 DECL_HANDLER(set_foreground_window)
2118 {
2119 struct thread *thread;
2120 struct msg_queue *queue = get_current_queue();
2121
2122 reply->previous = foreground_input ? foreground_input->active : 0;
2123 reply->send_msg_old = (reply->previous && foreground_input != queue->input);
2124 reply->send_msg_new = FALSE;
2125
2126 if (is_top_level_window( req->handle ) &&
2127 ((thread = get_window_thread( req->handle ))))
2128 {
2129 foreground_input = thread->queue->input;
2130 reply->send_msg_new = (foreground_input != queue->input);
2131 release_object( thread );
2132 }
2133 else set_win32_error( ERROR_INVALID_WINDOW_HANDLE );
2134 }
2135
2136
2137 /* set the current thread focus window */
2138 DECL_HANDLER(set_focus_window)
2139 {
2140 struct msg_queue *queue = get_current_queue();
2141
2142 reply->previous = 0;
2143 if (queue && check_queue_input_window( queue, req->handle ))
2144 {
2145 reply->previous = queue->input->focus;
2146 queue->input->focus = get_user_full_handle( req->handle );
2147 }
2148 }
2149
2150
2151 /* set the current thread active window */
2152 DECL_HANDLER(set_active_window)
2153 {
2154 struct msg_queue *queue = get_current_queue();
2155
2156 reply->previous = 0;
2157 if (queue && check_queue_input_window( queue, req->handle ))
2158 {
2159 if (!req->handle || make_window_active( req->handle ))
2160 {
2161 reply->previous = queue->input->active;
2162 queue->input->active = get_user_full_handle( req->handle );
2163 }
2164 else set_error( STATUS_INVALID_HANDLE );
2165 }
2166 }
2167
2168
2169 /* set the current thread capture window */
2170 DECL_HANDLER(set_capture_window)
2171 {
2172 struct msg_queue *queue = get_current_queue();
2173
2174 reply->previous = reply->full_handle = 0;
2175 if (queue && check_queue_input_window( queue, req->handle ))
2176 {
2177 struct thread_input *input = queue->input;
2178
2179 reply->previous = input->capture;
2180 input->capture = get_user_full_handle( req->handle );
2181 input->menu_owner = (req->flags & CAPTURE_MENU) ? input->capture : 0;
2182 input->move_size = (req->flags & CAPTURE_MOVESIZE) ? input->capture : 0;
2183 reply->full_handle = input->capture;
2184 }
2185 }
2186
2187
2188 /* Set the current thread caret window */
2189 DECL_HANDLER(set_caret_window)
2190 {
2191 struct msg_queue *queue = get_current_queue();
2192
2193 reply->previous = 0;
2194 if (queue && check_queue_input_window( queue, req->handle ))
2195 {
2196 struct thread_input *input = queue->input;
2197
2198 reply->previous = input->caret;
2199 reply->old_rect = input->caret_rect;
2200 reply->old_hide = input->caret_hide;
2201 reply->old_state = input->caret_state;
2202
2203 set_caret_window( input, get_user_full_handle(req->handle) );
2204 input->caret_rect.right = input->caret_rect.left + req->width;
2205 input->caret_rect.bottom = input->caret_rect.top + req->height;
2206 }
2207 }
2208
2209
2210 /* Set the current thread caret information */
2211 DECL_HANDLER(set_caret_info)
2212 {
2213 struct msg_queue *queue = get_current_queue();
2214 struct thread_input *input;
2215
2216 if (!queue) return;
2217 input = queue->input;
2218 reply->full_handle = input->caret;
2219 reply->old_rect = input->caret_rect;
2220 reply->old_hide = input->caret_hide;
2221 reply->old_state = input->caret_state;
2222
2223 if (req->handle && get_user_full_handle(req->handle) != input->caret)
2224 {
2225 set_error( STATUS_ACCESS_DENIED );
2226 return;
2227 }
2228 if (req->flags & SET_CARET_POS)
2229 {
2230 input->caret_rect.right += req->x - input->caret_rect.left;
2231 input->caret_rect.bottom += req->y - input->caret_rect.top;
2232 input->caret_rect.left = req->x;
2233 input->caret_rect.top = req->y;
2234 }
2235 if (req->flags & SET_CARET_HIDE)
2236 {
2237 input->caret_hide += req->hide;
2238 if (input->caret_hide < 0) input->caret_hide = 0;
2239 }
2240 if (req->flags & SET_CARET_STATE)
2241 {
2242 if (req->state == -1) input->caret_state = !input->caret_state;
2243 else input->caret_state = !!req->state;
2244 }
2245 }
2246
2247
2248 /* get the time of the last input event */
2249 DECL_HANDLER(get_last_input_time)
2250 {
2251 reply->time = last_input_time;
2252 }
2253
This page was automatically generated by the
LXR engine.
Visit the LXR main site for more
information.