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