2000-05-30 19:48:18 +00:00
|
|
|
/*
|
|
|
|
* Server-side message queues
|
|
|
|
*
|
|
|
|
* Copyright (C) 2000 Alexandre Julliard
|
2002-03-09 23:29:33 +00:00
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library; if not, write to the Free Software
|
2006-05-18 12:49:52 +00:00
|
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
2000-05-30 19:48:18 +00:00
|
|
|
*/
|
|
|
|
|
2002-04-26 19:05:15 +00:00
|
|
|
#include "config.h"
|
|
|
|
#include "wine/port.h"
|
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
#include <assert.h>
|
2003-09-05 23:08:26 +00:00
|
|
|
#include <stdarg.h>
|
2000-05-30 19:48:18 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
2005-11-28 16:32:54 +00:00
|
|
|
#include "ntstatus.h"
|
|
|
|
#define WIN32_NO_STATUS
|
2003-09-05 23:08:26 +00:00
|
|
|
#include "windef.h"
|
2001-05-18 22:51:56 +00:00
|
|
|
#include "winbase.h"
|
|
|
|
#include "wingdi.h"
|
|
|
|
#include "winuser.h"
|
2005-11-28 16:32:54 +00:00
|
|
|
#include "winternl.h"
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
#include "handle.h"
|
2003-02-19 00:33:32 +00:00
|
|
|
#include "file.h"
|
2000-05-30 19:48:18 +00:00
|
|
|
#include "thread.h"
|
|
|
|
#include "process.h"
|
|
|
|
#include "request.h"
|
2001-08-28 18:44:52 +00:00
|
|
|
#include "user.h"
|
2000-05-30 19:48:18 +00:00
|
|
|
|
2005-03-14 17:17:09 +00:00
|
|
|
#define WM_NCMOUSEFIRST WM_NCMOUSEMOVE
|
2005-03-24 19:16:54 +00:00
|
|
|
#define WM_NCMOUSELAST (WM_NCMOUSEFIRST+(WM_MOUSELAST-WM_MOUSEFIRST))
|
2005-03-14 17:17:09 +00:00
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
enum message_kind { SEND_MESSAGE, POST_MESSAGE };
|
|
|
|
#define NB_MSG_KINDS (POST_MESSAGE+1)
|
2001-08-07 19:19:08 +00:00
|
|
|
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
struct message_result
|
|
|
|
{
|
2003-07-26 20:36:43 +00:00
|
|
|
struct list sender_entry; /* entry in sender list */
|
2005-09-13 14:46:46 +00:00
|
|
|
struct message *msg; /* message the result is for */
|
2003-07-26 20:36:43 +00:00
|
|
|
struct message_result *recv_next; /* next in receiver list */
|
|
|
|
struct msg_queue *sender; /* sender queue */
|
|
|
|
struct msg_queue *receiver; /* receiver queue */
|
|
|
|
int replied; /* has it been replied to? */
|
|
|
|
unsigned int error; /* error code to pass back to sender */
|
2007-08-29 16:01:10 +00:00
|
|
|
unsigned long result; /* reply result */
|
2003-07-26 20:36:43 +00:00
|
|
|
struct message *callback_msg; /* message to queue for callback */
|
|
|
|
void *data; /* message reply data */
|
|
|
|
unsigned int data_size; /* size of message reply data */
|
|
|
|
struct timeout_user *timeout; /* result timeout */
|
2001-05-18 22:51:56 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
struct message
|
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list entry; /* entry in message list */
|
2001-08-07 19:19:08 +00:00
|
|
|
enum message_type type; /* message type */
|
2001-08-28 18:44:52 +00:00
|
|
|
user_handle_t win; /* window handle */
|
2001-05-18 22:51:56 +00:00
|
|
|
unsigned int msg; /* message code */
|
2006-06-08 08:01:54 +00:00
|
|
|
unsigned long wparam; /* parameters */
|
|
|
|
unsigned long lparam; /* parameters */
|
2006-08-09 15:10:14 +00:00
|
|
|
unsigned long info; /* extra info */
|
2001-08-07 19:19:08 +00:00
|
|
|
int x; /* x position */
|
|
|
|
int y; /* y position */
|
2001-06-19 19:16:41 +00:00
|
|
|
unsigned int time; /* message time */
|
2001-08-07 19:19:08 +00:00
|
|
|
void *data; /* message data for sent messages */
|
|
|
|
unsigned int data_size; /* size of message data */
|
2005-04-20 13:03:59 +00:00
|
|
|
unsigned int unique_id; /* unique id for nested hw message waits */
|
2001-05-18 22:51:56 +00:00
|
|
|
struct message_result *result; /* result in sender queue */
|
|
|
|
};
|
|
|
|
|
|
|
|
struct timer
|
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list entry; /* entry in timer list */
|
2007-04-17 18:08:59 +00:00
|
|
|
timeout_t when; /* next expiration */
|
2001-05-18 22:51:56 +00:00
|
|
|
unsigned int rate; /* timer rate in ms */
|
2001-08-28 18:44:52 +00:00
|
|
|
user_handle_t win; /* window handle */
|
2001-05-18 22:51:56 +00:00
|
|
|
unsigned int msg; /* message to post */
|
2006-10-16 15:03:44 +00:00
|
|
|
unsigned long id; /* timer id */
|
2006-07-10 06:58:35 +00:00
|
|
|
unsigned long lparam; /* lparam for message */
|
2001-05-18 22:51:56 +00:00
|
|
|
};
|
|
|
|
|
2002-10-11 18:50:15 +00:00
|
|
|
struct thread_input
|
|
|
|
{
|
|
|
|
struct object obj; /* object header */
|
2005-07-11 13:30:23 +00:00
|
|
|
struct desktop *desktop; /* desktop that this thread input belongs to */
|
2002-10-11 18:50:15 +00:00
|
|
|
user_handle_t focus; /* focus window */
|
|
|
|
user_handle_t capture; /* capture window */
|
|
|
|
user_handle_t active; /* active window */
|
|
|
|
user_handle_t menu_owner; /* current menu owner window */
|
|
|
|
user_handle_t move_size; /* current moving/resizing window */
|
|
|
|
user_handle_t caret; /* caret window */
|
2002-10-17 01:24:33 +00:00
|
|
|
rectangle_t caret_rect; /* caret rectangle */
|
|
|
|
int caret_hide; /* caret hide count */
|
|
|
|
int caret_state; /* caret on/off state */
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list msg_list; /* list of hardware messages */
|
2002-10-11 18:50:15 +00:00
|
|
|
unsigned char keystate[256]; /* state of each key */
|
|
|
|
};
|
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
struct msg_queue
|
|
|
|
{
|
2003-07-26 20:36:43 +00:00
|
|
|
struct object obj; /* object header */
|
2007-04-04 16:02:01 +00:00
|
|
|
struct fd *fd; /* optional file descriptor to poll */
|
2003-07-26 20:36:43 +00:00
|
|
|
unsigned int wake_bits; /* wakeup bits */
|
|
|
|
unsigned int wake_mask; /* wakeup mask */
|
|
|
|
unsigned int changed_bits; /* changed wakeup bits */
|
|
|
|
unsigned int changed_mask; /* changed wakeup mask */
|
|
|
|
int paint_count; /* pending paint messages count */
|
2006-01-17 12:14:31 +00:00
|
|
|
int quit_message; /* is there a pending quit message? */
|
|
|
|
int exit_code; /* exit code of pending quit message */
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list msg_list[NB_MSG_KINDS]; /* lists of messages */
|
2003-07-26 20:36:43 +00:00
|
|
|
struct list send_result; /* stack of sent messages waiting for result */
|
|
|
|
struct list callback_result; /* list of callback messages waiting for result */
|
|
|
|
struct message_result *recv_result; /* stack of received messages waiting for result */
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list pending_timers; /* list of pending timers */
|
|
|
|
struct list expired_timers; /* list of expired timers */
|
2006-10-16 15:03:44 +00:00
|
|
|
unsigned long next_timer_id; /* id for the next timer with a 0 window */
|
2003-07-26 20:36:43 +00:00
|
|
|
struct timeout_user *timeout; /* timeout for next timer to expire */
|
|
|
|
struct thread_input *input; /* thread input descriptor */
|
|
|
|
struct hook_table *hooks; /* hook table */
|
2007-04-17 18:08:59 +00:00
|
|
|
timeout_t last_get_msg; /* time of last get message call */
|
2000-05-30 19:48:18 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
static void msg_queue_dump( struct object *obj, int verbose );
|
|
|
|
static int msg_queue_add_queue( struct object *obj, struct wait_queue_entry *entry );
|
|
|
|
static void msg_queue_remove_queue( struct object *obj, struct wait_queue_entry *entry );
|
|
|
|
static int msg_queue_signaled( struct object *obj, struct thread *thread );
|
|
|
|
static int msg_queue_satisfied( struct object *obj, struct thread *thread );
|
2001-05-18 22:51:56 +00:00
|
|
|
static void msg_queue_destroy( struct object *obj );
|
2007-04-04 16:02:01 +00:00
|
|
|
static void msg_queue_poll_event( struct fd *fd, int event );
|
2002-10-11 18:50:15 +00:00
|
|
|
static void thread_input_dump( struct object *obj, int verbose );
|
|
|
|
static void thread_input_destroy( struct object *obj );
|
2001-05-18 22:51:56 +00:00
|
|
|
static void timer_callback( void *private );
|
2000-05-30 19:48:18 +00:00
|
|
|
|
|
|
|
static const struct object_ops msg_queue_ops =
|
|
|
|
{
|
|
|
|
sizeof(struct msg_queue), /* size */
|
|
|
|
msg_queue_dump, /* dump */
|
|
|
|
msg_queue_add_queue, /* add_queue */
|
|
|
|
msg_queue_remove_queue, /* remove_queue */
|
|
|
|
msg_queue_signaled, /* signaled */
|
|
|
|
msg_queue_satisfied, /* satisfied */
|
2005-04-24 17:35:52 +00:00
|
|
|
no_signal, /* signal */
|
2000-12-19 02:12:45 +00:00
|
|
|
no_get_fd, /* get_fd */
|
2005-12-12 13:57:40 +00:00
|
|
|
no_map_access, /* map_access */
|
2005-11-22 14:55:42 +00:00
|
|
|
no_lookup_name, /* lookup_name */
|
2007-03-22 10:44:29 +00:00
|
|
|
no_open_file, /* open_file */
|
2005-06-09 15:39:52 +00:00
|
|
|
no_close_handle, /* close_handle */
|
2001-05-18 22:51:56 +00:00
|
|
|
msg_queue_destroy /* destroy */
|
2000-05-30 19:48:18 +00:00
|
|
|
};
|
|
|
|
|
2007-04-04 16:02:01 +00:00
|
|
|
static const struct fd_ops msg_queue_fd_ops =
|
|
|
|
{
|
|
|
|
NULL, /* get_poll_events */
|
|
|
|
msg_queue_poll_event, /* poll_event */
|
2007-04-12 18:21:53 +00:00
|
|
|
NULL, /* flush */
|
|
|
|
NULL, /* get_fd_type */
|
2007-04-16 12:45:03 +00:00
|
|
|
NULL, /* ioctl */
|
2007-04-12 18:21:53 +00:00
|
|
|
NULL, /* queue_async */
|
2007-04-10 15:07:27 +00:00
|
|
|
NULL, /* reselect_async */
|
2007-04-12 18:21:53 +00:00
|
|
|
NULL /* cancel async */
|
2007-04-04 16:02:01 +00:00
|
|
|
};
|
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
|
2002-10-11 18:50:15 +00:00
|
|
|
static const struct object_ops thread_input_ops =
|
|
|
|
{
|
|
|
|
sizeof(struct thread_input), /* size */
|
|
|
|
thread_input_dump, /* dump */
|
|
|
|
no_add_queue, /* add_queue */
|
|
|
|
NULL, /* remove_queue */
|
|
|
|
NULL, /* signaled */
|
|
|
|
NULL, /* satisfied */
|
2005-04-24 17:35:52 +00:00
|
|
|
no_signal, /* signal */
|
2002-10-11 18:50:15 +00:00
|
|
|
no_get_fd, /* get_fd */
|
2005-12-12 13:57:40 +00:00
|
|
|
no_map_access, /* map_access */
|
2005-11-22 14:55:42 +00:00
|
|
|
no_lookup_name, /* lookup_name */
|
2007-03-22 10:44:29 +00:00
|
|
|
no_open_file, /* open_file */
|
2005-06-09 15:39:52 +00:00
|
|
|
no_close_handle, /* close_handle */
|
2002-10-11 18:50:15 +00:00
|
|
|
thread_input_destroy /* destroy */
|
|
|
|
};
|
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
/* pointer to input structure of foreground thread */
|
|
|
|
static struct thread_input *foreground_input;
|
2005-04-28 12:04:14 +00:00
|
|
|
static unsigned int last_input_time;
|
2003-01-08 00:27:58 +00:00
|
|
|
|
2006-10-04 18:25:42 +00:00
|
|
|
static void free_message( struct message *msg );
|
2002-10-17 01:24:33 +00:00
|
|
|
|
|
|
|
/* set the caret window in a given thread input */
|
|
|
|
static void set_caret_window( struct thread_input *input, user_handle_t win )
|
|
|
|
{
|
2005-02-18 20:02:55 +00:00
|
|
|
if (!win || win != input->caret)
|
|
|
|
{
|
|
|
|
input->caret_rect.left = 0;
|
|
|
|
input->caret_rect.top = 0;
|
|
|
|
input->caret_rect.right = 0;
|
|
|
|
input->caret_rect.bottom = 0;
|
|
|
|
}
|
2002-10-17 01:24:33 +00:00
|
|
|
input->caret = win;
|
|
|
|
input->caret_hide = 1;
|
|
|
|
input->caret_state = 0;
|
|
|
|
}
|
|
|
|
|
2002-10-11 18:50:15 +00:00
|
|
|
/* create a thread input object */
|
2005-07-11 13:30:23 +00:00
|
|
|
static struct thread_input *create_thread_input( struct thread *thread )
|
2002-10-11 18:50:15 +00:00
|
|
|
{
|
|
|
|
struct thread_input *input;
|
|
|
|
|
2003-02-19 00:33:32 +00:00
|
|
|
if ((input = alloc_object( &thread_input_ops )))
|
2002-10-11 18:50:15 +00:00
|
|
|
{
|
|
|
|
input->focus = 0;
|
|
|
|
input->capture = 0;
|
|
|
|
input->active = 0;
|
|
|
|
input->menu_owner = 0;
|
|
|
|
input->move_size = 0;
|
2005-02-25 21:05:11 +00:00
|
|
|
list_init( &input->msg_list );
|
2002-10-17 01:24:33 +00:00
|
|
|
set_caret_window( input, 0 );
|
2002-10-11 18:50:15 +00:00
|
|
|
memset( input->keystate, 0, sizeof(input->keystate) );
|
2006-04-07 10:15:19 +00:00
|
|
|
|
|
|
|
if (!(input->desktop = get_thread_desktop( thread, 0 /* FIXME: access rights */ )))
|
|
|
|
{
|
|
|
|
release_object( input );
|
|
|
|
return NULL;
|
|
|
|
}
|
2002-10-11 18:50:15 +00:00
|
|
|
}
|
|
|
|
return input;
|
|
|
|
}
|
|
|
|
|
2004-06-17 20:00:25 +00:00
|
|
|
/* release the thread input data of a given thread */
|
2005-04-20 13:03:59 +00:00
|
|
|
static inline void release_thread_input( struct thread *thread )
|
2004-06-17 20:00:25 +00:00
|
|
|
{
|
|
|
|
struct thread_input *input = thread->queue->input;
|
|
|
|
|
|
|
|
if (!input) return;
|
|
|
|
release_object( input );
|
|
|
|
thread->queue->input = NULL;
|
|
|
|
}
|
|
|
|
|
2002-10-11 18:50:15 +00:00
|
|
|
/* create a message queue object */
|
|
|
|
static struct msg_queue *create_msg_queue( struct thread *thread, struct thread_input *input )
|
2000-05-30 19:48:18 +00:00
|
|
|
{
|
|
|
|
struct msg_queue *queue;
|
2001-06-19 19:16:41 +00:00
|
|
|
int i;
|
2000-05-30 19:48:18 +00:00
|
|
|
|
2005-07-11 13:30:23 +00:00
|
|
|
if (!input && !(input = create_thread_input( thread ))) return NULL;
|
2003-02-19 00:33:32 +00:00
|
|
|
if ((queue = alloc_object( &msg_queue_ops )))
|
2000-05-30 19:48:18 +00:00
|
|
|
{
|
2007-04-04 16:02:01 +00:00
|
|
|
queue->fd = NULL;
|
2001-05-18 22:51:56 +00:00
|
|
|
queue->wake_bits = 0;
|
|
|
|
queue->wake_mask = 0;
|
|
|
|
queue->changed_bits = 0;
|
|
|
|
queue->changed_mask = 0;
|
2001-06-20 22:55:31 +00:00
|
|
|
queue->paint_count = 0;
|
2006-01-17 12:14:31 +00:00
|
|
|
queue->quit_message = 0;
|
2001-05-18 22:51:56 +00:00
|
|
|
queue->recv_result = NULL;
|
2004-11-29 18:08:18 +00:00
|
|
|
queue->next_timer_id = 1;
|
2001-05-18 22:51:56 +00:00
|
|
|
queue->timeout = NULL;
|
2002-10-11 18:50:15 +00:00
|
|
|
queue->input = (struct thread_input *)grab_object( input );
|
2003-07-03 18:16:48 +00:00
|
|
|
queue->hooks = NULL;
|
2006-08-10 14:42:09 +00:00
|
|
|
queue->last_get_msg = current_time;
|
2003-07-26 20:36:43 +00:00
|
|
|
list_init( &queue->send_result );
|
|
|
|
list_init( &queue->callback_result );
|
2004-11-29 18:08:18 +00:00
|
|
|
list_init( &queue->pending_timers );
|
|
|
|
list_init( &queue->expired_timers );
|
2005-02-25 21:05:11 +00:00
|
|
|
for (i = 0; i < NB_MSG_KINDS; i++) list_init( &queue->msg_list[i] );
|
2001-06-19 19:16:41 +00:00
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
thread->queue = queue;
|
|
|
|
if (!thread->process->queue)
|
|
|
|
thread->process->queue = (struct msg_queue *)grab_object( queue );
|
|
|
|
}
|
2002-10-11 18:50:15 +00:00
|
|
|
release_object( input );
|
2000-05-30 19:48:18 +00:00
|
|
|
return queue;
|
|
|
|
}
|
|
|
|
|
2002-08-16 23:30:41 +00:00
|
|
|
/* free the message queue of a thread at thread exit */
|
|
|
|
void free_msg_queue( struct thread *thread )
|
|
|
|
{
|
|
|
|
struct process *process = thread->process;
|
|
|
|
|
2003-07-11 21:55:58 +00:00
|
|
|
remove_thread_hooks( thread );
|
2002-08-16 23:30:41 +00:00
|
|
|
if (!thread->queue) return;
|
|
|
|
if (process->queue == thread->queue) /* is it the process main queue? */
|
|
|
|
{
|
|
|
|
release_object( process->queue );
|
|
|
|
process->queue = NULL;
|
|
|
|
if (process->idle_event)
|
|
|
|
{
|
|
|
|
set_event( process->idle_event );
|
|
|
|
release_object( process->idle_event );
|
|
|
|
process->idle_event = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
release_object( thread->queue );
|
|
|
|
thread->queue = NULL;
|
|
|
|
}
|
|
|
|
|
2003-07-03 18:16:48 +00:00
|
|
|
/* get the hook table for a given thread */
|
|
|
|
struct hook_table *get_queue_hooks( struct thread *thread )
|
|
|
|
{
|
|
|
|
if (!thread->queue) return NULL;
|
|
|
|
return thread->queue->hooks;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* set the hook table for a given thread, allocating the queue if needed */
|
|
|
|
void set_queue_hooks( struct thread *thread, struct hook_table *hooks )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = thread->queue;
|
2005-04-26 14:31:33 +00:00
|
|
|
if (!queue && !(queue = create_msg_queue( thread, NULL ))) return;
|
2003-07-03 18:16:48 +00:00
|
|
|
if (queue->hooks) release_object( queue->hooks );
|
|
|
|
queue->hooks = hooks;
|
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* check the queue status */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline int is_signaled( struct msg_queue *queue )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
return ((queue->wake_bits & queue->wake_mask) || (queue->changed_bits & queue->changed_mask));
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
/* set some queue bits */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline void set_queue_bits( struct msg_queue *queue, unsigned int bits )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2001-08-07 19:19:08 +00:00
|
|
|
queue->wake_bits |= bits;
|
|
|
|
queue->changed_bits |= bits;
|
2001-05-18 22:51:56 +00:00
|
|
|
if (is_signaled( queue )) wake_up( &queue->obj, 0 );
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
/* clear some queue bits */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline void clear_queue_bits( struct msg_queue *queue, unsigned int bits )
|
2001-08-07 19:19:08 +00:00
|
|
|
{
|
|
|
|
queue->wake_bits &= ~bits;
|
|
|
|
queue->changed_bits &= ~bits;
|
|
|
|
}
|
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
/* check whether msg is a keyboard message */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline int is_keyboard_msg( struct message *msg )
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
return (msg->msg >= WM_KEYFIRST && msg->msg <= WM_KEYLAST);
|
|
|
|
}
|
|
|
|
|
2005-04-20 13:03:59 +00:00
|
|
|
/* check if message is matched by the filter */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline int check_msg_filter( unsigned int msg, unsigned int first, unsigned int last )
|
2005-04-20 13:03:59 +00:00
|
|
|
{
|
|
|
|
return (msg >= first && msg <= last);
|
|
|
|
}
|
|
|
|
|
2005-03-14 17:17:09 +00:00
|
|
|
/* check whether a message filter contains at least one potential hardware message */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline int filter_contains_hw_range( unsigned int first, unsigned int last )
|
2005-03-14 17:17:09 +00:00
|
|
|
{
|
|
|
|
/* hardware message ranges are (in numerical order):
|
|
|
|
* WM_NCMOUSEFIRST .. WM_NCMOUSELAST
|
|
|
|
* WM_KEYFIRST .. WM_KEYLAST
|
|
|
|
* WM_MOUSEFIRST .. WM_MOUSELAST
|
|
|
|
*/
|
|
|
|
if (last < WM_NCMOUSEFIRST) return 0;
|
|
|
|
if (first > WM_NCMOUSELAST && last < WM_KEYFIRST) return 0;
|
|
|
|
if (first > WM_KEYLAST && last < WM_MOUSEFIRST) return 0;
|
|
|
|
if (first > WM_MOUSELAST) return 0;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2001-06-19 19:16:41 +00:00
|
|
|
/* get the QS_* bit corresponding to a given hardware message */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline int get_hardware_msg_bit( struct message *msg )
|
2001-06-19 19:16:41 +00:00
|
|
|
{
|
|
|
|
if (msg->msg == WM_MOUSEMOVE || msg->msg == WM_NCMOUSEMOVE) return QS_MOUSEMOVE;
|
2003-01-08 00:27:58 +00:00
|
|
|
if (is_keyboard_msg( msg )) return QS_KEY;
|
2001-06-19 19:16:41 +00:00
|
|
|
return QS_MOUSEBUTTON;
|
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* get the current thread queue, creating it if needed */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline struct msg_queue *get_current_queue(void)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
struct msg_queue *queue = current->queue;
|
2002-10-11 18:50:15 +00:00
|
|
|
if (!queue) queue = create_msg_queue( current, NULL );
|
2001-05-18 22:51:56 +00:00
|
|
|
return queue;
|
|
|
|
}
|
|
|
|
|
2005-04-20 13:03:59 +00:00
|
|
|
/* get a (pseudo-)unique id to tag hardware messages */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline unsigned int get_unique_id(void)
|
2005-04-20 13:03:59 +00:00
|
|
|
{
|
|
|
|
static unsigned int id;
|
|
|
|
if (!++id) id = 1; /* avoid an id of 0 */
|
|
|
|
return id;
|
|
|
|
}
|
|
|
|
|
2001-07-11 17:29:01 +00:00
|
|
|
/* try to merge a message with the last in the list; return 1 if successful */
|
2003-01-08 00:27:58 +00:00
|
|
|
static int merge_message( struct thread_input *input, const struct message *msg )
|
2001-07-11 17:29:01 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct message *prev;
|
|
|
|
struct list *ptr = list_tail( &input->msg_list );
|
2001-07-11 17:29:01 +00:00
|
|
|
|
2005-02-25 21:05:11 +00:00
|
|
|
if (!ptr) return 0;
|
|
|
|
prev = LIST_ENTRY( ptr, struct message, entry );
|
2005-04-20 13:03:59 +00:00
|
|
|
if (prev->unique_id) return 0;
|
2001-07-11 17:29:01 +00:00
|
|
|
if (prev->result) return 0;
|
|
|
|
if (prev->win != msg->win) return 0;
|
|
|
|
if (prev->msg != msg->msg) return 0;
|
|
|
|
if (prev->type != msg->type) return 0;
|
|
|
|
/* now we can merge it */
|
|
|
|
prev->wparam = msg->wparam;
|
|
|
|
prev->lparam = msg->lparam;
|
|
|
|
prev->x = msg->x;
|
|
|
|
prev->y = msg->y;
|
|
|
|
prev->time = msg->time;
|
|
|
|
prev->info = msg->info;
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
/* free a result structure */
|
|
|
|
static void free_result( struct message_result *result )
|
|
|
|
{
|
|
|
|
if (result->timeout) remove_timeout_user( result->timeout );
|
2006-10-09 21:34:36 +00:00
|
|
|
free( result->data );
|
2006-10-04 18:25:42 +00:00
|
|
|
if (result->callback_msg) free_message( result->callback_msg );
|
2001-08-07 19:19:08 +00:00
|
|
|
free( result );
|
|
|
|
}
|
|
|
|
|
2003-07-26 20:36:43 +00:00
|
|
|
/* remove the result from the sender list it is on */
|
|
|
|
static inline void remove_result_from_sender( struct message_result *result )
|
|
|
|
{
|
|
|
|
assert( result->sender );
|
|
|
|
|
|
|
|
list_remove( &result->sender_entry );
|
|
|
|
result->sender = NULL;
|
|
|
|
if (!result->receiver) free_result( result );
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
/* store the message result in the appropriate structure */
|
2007-08-29 16:01:10 +00:00
|
|
|
static void store_message_result( struct message_result *res, unsigned long result,
|
2001-08-07 19:19:08 +00:00
|
|
|
unsigned int error )
|
|
|
|
{
|
|
|
|
res->result = result;
|
|
|
|
res->error = error;
|
|
|
|
res->replied = 1;
|
|
|
|
if (res->timeout)
|
|
|
|
{
|
|
|
|
remove_timeout_user( res->timeout );
|
|
|
|
res->timeout = NULL;
|
|
|
|
}
|
2003-07-26 20:36:43 +00:00
|
|
|
if (res->sender)
|
|
|
|
{
|
|
|
|
if (res->callback_msg)
|
|
|
|
{
|
|
|
|
/* queue the callback message in the sender queue */
|
2006-10-04 14:29:45 +00:00
|
|
|
struct callback_msg_data *data = res->callback_msg->data;
|
|
|
|
data->result = result;
|
2005-02-25 21:05:11 +00:00
|
|
|
list_add_tail( &res->sender->msg_list[SEND_MESSAGE], &res->callback_msg->entry );
|
2003-07-26 20:36:43 +00:00
|
|
|
set_queue_bits( res->sender, QS_SENDMESSAGE );
|
|
|
|
res->callback_msg = NULL;
|
|
|
|
remove_result_from_sender( res );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* wake sender queue if waiting on this result */
|
|
|
|
if (list_head(&res->sender->send_result) == &res->sender_entry)
|
|
|
|
set_queue_bits( res->sender, QS_SMRESULT );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* free a message when deleting a queue or window */
|
|
|
|
static void free_message( struct message *msg )
|
|
|
|
{
|
|
|
|
struct message_result *result = msg->result;
|
|
|
|
if (result)
|
|
|
|
{
|
2005-09-13 14:46:46 +00:00
|
|
|
result->msg = NULL;
|
2001-05-18 22:51:56 +00:00
|
|
|
if (result->sender)
|
|
|
|
{
|
|
|
|
result->receiver = NULL;
|
2001-08-07 19:19:08 +00:00
|
|
|
store_message_result( result, 0, STATUS_ACCESS_DENIED /*FIXME*/ );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
2001-08-07 19:19:08 +00:00
|
|
|
else free_result( result );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
2006-10-09 21:34:36 +00:00
|
|
|
free( msg->data );
|
2001-05-18 22:51:56 +00:00
|
|
|
free( msg );
|
|
|
|
}
|
|
|
|
|
2001-06-19 19:16:41 +00:00
|
|
|
/* remove (and free) a message from a message list */
|
|
|
|
static void remove_queue_message( struct msg_queue *queue, struct message *msg,
|
|
|
|
enum message_kind kind )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
list_remove( &msg->entry );
|
2001-06-19 19:16:41 +00:00
|
|
|
switch(kind)
|
|
|
|
{
|
|
|
|
case SEND_MESSAGE:
|
2005-02-25 21:05:11 +00:00
|
|
|
if (list_empty( &queue->msg_list[kind] )) clear_queue_bits( queue, QS_SENDMESSAGE );
|
2001-06-19 19:16:41 +00:00
|
|
|
break;
|
|
|
|
case POST_MESSAGE:
|
2006-05-22 21:16:53 +00:00
|
|
|
if (list_empty( &queue->msg_list[kind] ) && !queue->quit_message)
|
|
|
|
clear_queue_bits( queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
|
2001-06-19 19:16:41 +00:00
|
|
|
break;
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
free_message( msg );
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
/* message timed out without getting a reply */
|
|
|
|
static void result_timeout( void *private )
|
|
|
|
{
|
|
|
|
struct message_result *result = private;
|
|
|
|
|
|
|
|
assert( !result->replied );
|
|
|
|
|
|
|
|
result->timeout = NULL;
|
2005-09-13 14:46:46 +00:00
|
|
|
|
|
|
|
if (result->msg) /* not received yet */
|
|
|
|
{
|
|
|
|
struct message *msg = result->msg;
|
|
|
|
|
|
|
|
result->msg = NULL;
|
|
|
|
msg->result = NULL;
|
|
|
|
remove_queue_message( result->receiver, msg, SEND_MESSAGE );
|
|
|
|
result->receiver = NULL;
|
|
|
|
if (!result->sender)
|
|
|
|
{
|
|
|
|
free_result( result );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
store_message_result( result, 0, STATUS_TIMEOUT );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* allocate and fill a message result structure */
|
|
|
|
static struct message_result *alloc_message_result( struct msg_queue *send_queue,
|
|
|
|
struct msg_queue *recv_queue,
|
2007-04-17 18:08:59 +00:00
|
|
|
struct message *msg, timeout_t timeout )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
struct message_result *result = mem_alloc( sizeof(*result) );
|
2001-08-07 19:19:08 +00:00
|
|
|
if (result)
|
|
|
|
{
|
2005-09-13 14:46:46 +00:00
|
|
|
result->msg = msg;
|
2001-08-07 19:19:08 +00:00
|
|
|
result->sender = send_queue;
|
|
|
|
result->receiver = recv_queue;
|
|
|
|
result->replied = 0;
|
|
|
|
result->data = NULL;
|
|
|
|
result->data_size = 0;
|
|
|
|
result->timeout = NULL;
|
2003-07-26 20:36:43 +00:00
|
|
|
|
|
|
|
if (msg->type == MSG_CALLBACK)
|
|
|
|
{
|
|
|
|
struct message *callback_msg = mem_alloc( sizeof(*callback_msg) );
|
2006-10-04 14:29:45 +00:00
|
|
|
|
2003-07-26 20:36:43 +00:00
|
|
|
if (!callback_msg)
|
|
|
|
{
|
|
|
|
free( result );
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
callback_msg->type = MSG_CALLBACK_RESULT;
|
|
|
|
callback_msg->win = msg->win;
|
|
|
|
callback_msg->msg = msg->msg;
|
2006-10-04 14:29:45 +00:00
|
|
|
callback_msg->wparam = 0;
|
2003-07-26 20:36:43 +00:00
|
|
|
callback_msg->lparam = 0;
|
|
|
|
callback_msg->time = get_tick_count();
|
|
|
|
callback_msg->x = 0;
|
|
|
|
callback_msg->y = 0;
|
2006-10-04 14:29:45 +00:00
|
|
|
callback_msg->info = 0;
|
2003-07-26 20:36:43 +00:00
|
|
|
callback_msg->result = NULL;
|
2006-10-04 18:25:42 +00:00
|
|
|
/* steal the data from the original message */
|
|
|
|
callback_msg->data = msg->data;
|
|
|
|
callback_msg->data_size = msg->data_size;
|
|
|
|
msg->data = NULL;
|
|
|
|
msg->data_size = 0;
|
2003-07-26 20:36:43 +00:00
|
|
|
|
|
|
|
result->callback_msg = callback_msg;
|
|
|
|
list_add_head( &send_queue->callback_result, &result->sender_entry );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
result->callback_msg = NULL;
|
|
|
|
list_add_head( &send_queue->send_result, &result->sender_entry );
|
|
|
|
}
|
|
|
|
|
2007-04-17 18:08:59 +00:00
|
|
|
if (timeout != TIMEOUT_INFINITE)
|
|
|
|
result->timeout = add_timeout_user( timeout, result_timeout, result );
|
2001-08-07 19:19:08 +00:00
|
|
|
}
|
|
|
|
return result;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* receive a message, removing it from the sent queue */
|
2001-11-30 18:46:42 +00:00
|
|
|
static void receive_message( struct msg_queue *queue, struct message *msg,
|
|
|
|
struct get_message_reply *reply )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
struct message_result *result = msg->result;
|
|
|
|
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->total = msg->data_size;
|
|
|
|
if (msg->data_size > get_reply_max_size())
|
|
|
|
{
|
|
|
|
set_error( STATUS_BUFFER_OVERFLOW );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
reply->type = msg->type;
|
|
|
|
reply->win = msg->win;
|
|
|
|
reply->msg = msg->msg;
|
|
|
|
reply->wparam = msg->wparam;
|
|
|
|
reply->lparam = msg->lparam;
|
|
|
|
reply->x = msg->x;
|
|
|
|
reply->y = msg->y;
|
|
|
|
reply->time = msg->time;
|
|
|
|
reply->info = msg->info;
|
|
|
|
|
|
|
|
if (msg->data) set_reply_data_ptr( msg->data, msg->data_size );
|
|
|
|
|
2005-02-25 21:05:11 +00:00
|
|
|
list_remove( &msg->entry );
|
2001-05-18 22:51:56 +00:00
|
|
|
/* put the result on the receiver result stack */
|
2001-08-07 19:19:08 +00:00
|
|
|
if (result)
|
|
|
|
{
|
2005-09-13 14:46:46 +00:00
|
|
|
result->msg = NULL;
|
2001-08-07 19:19:08 +00:00
|
|
|
result->recv_next = queue->recv_result;
|
|
|
|
queue->recv_result = result;
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
free( msg );
|
2005-02-25 21:05:11 +00:00
|
|
|
if (list_empty( &queue->msg_list[SEND_MESSAGE] )) clear_queue_bits( queue, QS_SENDMESSAGE );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* set the result of the current received message */
|
2007-08-29 16:01:10 +00:00
|
|
|
static void reply_message( struct msg_queue *queue, unsigned long result,
|
2006-07-26 08:43:25 +00:00
|
|
|
unsigned int error, int remove, const void *data, data_size_t len )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
struct message_result *res = queue->recv_result;
|
|
|
|
|
|
|
|
if (remove)
|
|
|
|
{
|
|
|
|
queue->recv_result = res->recv_next;
|
|
|
|
res->receiver = NULL;
|
|
|
|
if (!res->sender) /* no one waiting for it */
|
|
|
|
{
|
2001-08-07 19:19:08 +00:00
|
|
|
free_result( res );
|
2001-05-18 22:51:56 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (!res->replied)
|
|
|
|
{
|
2001-08-07 19:19:08 +00:00
|
|
|
if (len && (res->data = memdup( data, len ))) res->data_size = len;
|
|
|
|
store_message_result( res, result, error );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
/* retrieve a posted message */
|
|
|
|
static int get_posted_message( struct msg_queue *queue, user_handle_t win,
|
|
|
|
unsigned int first, unsigned int last, unsigned int flags,
|
|
|
|
struct get_message_reply *reply )
|
|
|
|
{
|
|
|
|
struct message *msg;
|
|
|
|
|
|
|
|
/* check against the filters */
|
2005-02-25 21:05:11 +00:00
|
|
|
LIST_FOR_EACH_ENTRY( msg, &queue->msg_list[POST_MESSAGE], struct message, entry )
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
if (win && msg->win && msg->win != win && !is_child_window( win, msg->win )) continue;
|
2005-04-20 13:03:59 +00:00
|
|
|
if (!check_msg_filter( msg->msg, first, last )) continue;
|
2005-02-25 21:05:11 +00:00
|
|
|
goto found; /* found one */
|
2003-01-08 00:27:58 +00:00
|
|
|
}
|
2005-02-25 21:05:11 +00:00
|
|
|
return 0;
|
2003-01-08 00:27:58 +00:00
|
|
|
|
|
|
|
/* return it to the app */
|
2005-02-25 21:05:11 +00:00
|
|
|
found:
|
2003-01-08 00:27:58 +00:00
|
|
|
reply->total = msg->data_size;
|
|
|
|
if (msg->data_size > get_reply_max_size())
|
|
|
|
{
|
|
|
|
set_error( STATUS_BUFFER_OVERFLOW );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
reply->type = msg->type;
|
|
|
|
reply->win = msg->win;
|
|
|
|
reply->msg = msg->msg;
|
|
|
|
reply->wparam = msg->wparam;
|
|
|
|
reply->lparam = msg->lparam;
|
|
|
|
reply->x = msg->x;
|
|
|
|
reply->y = msg->y;
|
|
|
|
reply->time = msg->time;
|
|
|
|
reply->info = msg->info;
|
|
|
|
|
2007-02-21 14:21:05 +00:00
|
|
|
if (flags & PM_REMOVE)
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
if (msg->data)
|
|
|
|
{
|
|
|
|
set_reply_data_ptr( msg->data, msg->data_size );
|
|
|
|
msg->data = NULL;
|
|
|
|
msg->data_size = 0;
|
|
|
|
}
|
|
|
|
remove_queue_message( queue, msg, POST_MESSAGE );
|
|
|
|
}
|
|
|
|
else if (msg->data) set_reply_data( msg->data, msg->data_size );
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2006-01-17 12:14:31 +00:00
|
|
|
static int get_quit_message( struct msg_queue *queue, unsigned int flags,
|
|
|
|
struct get_message_reply *reply )
|
|
|
|
{
|
|
|
|
if (queue->quit_message)
|
|
|
|
{
|
|
|
|
reply->total = 0;
|
|
|
|
reply->type = MSG_POSTED;
|
|
|
|
reply->win = NULL;
|
|
|
|
reply->msg = WM_QUIT;
|
|
|
|
reply->wparam = queue->exit_code;
|
|
|
|
reply->lparam = 0;
|
|
|
|
reply->x = 0;
|
|
|
|
reply->y = 0;
|
|
|
|
reply->time = get_tick_count();
|
|
|
|
reply->info = 0;
|
|
|
|
|
2007-02-21 14:21:05 +00:00
|
|
|
if (flags & PM_REMOVE)
|
2006-05-22 21:16:53 +00:00
|
|
|
{
|
2006-01-17 12:14:31 +00:00
|
|
|
queue->quit_message = 0;
|
2006-05-22 21:16:53 +00:00
|
|
|
if (list_empty( &queue->msg_list[POST_MESSAGE] ))
|
|
|
|
clear_queue_bits( queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
|
|
|
|
}
|
2006-01-17 12:14:31 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* empty a message list and free all the messages */
|
2005-02-25 21:05:11 +00:00
|
|
|
static void empty_msg_list( struct list *list )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list *ptr;
|
|
|
|
|
|
|
|
while ((ptr = list_head( list )) != NULL)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct message *msg = LIST_ENTRY( ptr, struct message, entry );
|
|
|
|
list_remove( &msg->entry );
|
2001-05-18 22:51:56 +00:00
|
|
|
free_message( msg );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* cleanup all pending results when deleting a queue */
|
|
|
|
static void cleanup_results( struct msg_queue *queue )
|
|
|
|
{
|
2003-07-26 20:36:43 +00:00
|
|
|
struct list *entry;
|
|
|
|
|
|
|
|
while ((entry = list_head( &queue->send_result )) != NULL)
|
|
|
|
{
|
|
|
|
remove_result_from_sender( LIST_ENTRY( entry, struct message_result, sender_entry ) );
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2003-07-26 20:36:43 +00:00
|
|
|
while ((entry = list_head( &queue->callback_result )) != NULL)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2003-07-26 20:36:43 +00:00
|
|
|
remove_result_from_sender( LIST_ENTRY( entry, struct message_result, sender_entry ) );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
while (queue->recv_result)
|
|
|
|
reply_message( queue, 0, STATUS_ACCESS_DENIED /*FIXME*/, 1, NULL, 0 );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2003-07-11 04:09:42 +00:00
|
|
|
/* check if the thread owning the queue is hung (not checking for messages) */
|
|
|
|
static int is_queue_hung( struct msg_queue *queue )
|
|
|
|
{
|
|
|
|
struct wait_queue_entry *entry;
|
|
|
|
|
2007-04-17 18:08:59 +00:00
|
|
|
if (current_time - queue->last_get_msg <= 5 * TICKS_PER_SEC)
|
2003-07-11 04:09:42 +00:00
|
|
|
return 0; /* less than 5 seconds since last get message -> not hung */
|
|
|
|
|
2005-03-01 11:49:58 +00:00
|
|
|
LIST_FOR_EACH_ENTRY( entry, &queue->obj.wait_queue, struct wait_queue_entry, entry )
|
2003-07-11 04:09:42 +00:00
|
|
|
{
|
|
|
|
if (entry->thread->queue == queue)
|
|
|
|
return 0; /* thread is waiting on queue -> not hung */
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
static int msg_queue_add_queue( struct object *obj, struct wait_queue_entry *entry )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = (struct msg_queue *)obj;
|
|
|
|
struct process *process = entry->thread->process;
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* a thread can only wait on its own queue */
|
|
|
|
if (entry->thread->queue != queue)
|
|
|
|
{
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
return 0;
|
|
|
|
}
|
2000-05-30 19:48:18 +00:00
|
|
|
/* if waiting on the main process queue, set the idle event */
|
2001-05-18 22:51:56 +00:00
|
|
|
if (process->queue == queue)
|
2000-05-30 19:48:18 +00:00
|
|
|
{
|
|
|
|
if (process->idle_event) set_event( process->idle_event );
|
|
|
|
}
|
2007-04-04 16:02:01 +00:00
|
|
|
if (queue->fd && list_empty( &obj->wait_queue )) /* first on the queue */
|
|
|
|
set_fd_events( queue->fd, POLLIN );
|
2000-05-30 19:48:18 +00:00
|
|
|
add_queue( obj, entry );
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void msg_queue_remove_queue(struct object *obj, struct wait_queue_entry *entry )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = (struct msg_queue *)obj;
|
|
|
|
struct process *process = entry->thread->process;
|
|
|
|
|
|
|
|
remove_queue( obj, entry );
|
2007-04-04 16:02:01 +00:00
|
|
|
if (queue->fd && list_empty( &obj->wait_queue )) /* last on the queue is gone */
|
|
|
|
set_fd_events( queue->fd, 0 );
|
2000-05-30 19:48:18 +00:00
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
assert( entry->thread->queue == queue );
|
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
/* if waiting on the main process queue, reset the idle event */
|
2001-05-18 22:51:56 +00:00
|
|
|
if (process->queue == queue)
|
2000-05-30 19:48:18 +00:00
|
|
|
{
|
|
|
|
if (process->idle_event) reset_event( process->idle_event );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void msg_queue_dump( struct object *obj, int verbose )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = (struct msg_queue *)obj;
|
2001-05-18 22:51:56 +00:00
|
|
|
fprintf( stderr, "Msg queue bits=%x mask=%x\n",
|
|
|
|
queue->wake_bits, queue->wake_mask );
|
2000-05-30 19:48:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int msg_queue_signaled( struct object *obj, struct thread *thread )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = (struct msg_queue *)obj;
|
2007-04-04 16:02:01 +00:00
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (queue->fd)
|
|
|
|
{
|
|
|
|
if ((ret = check_fd_events( queue->fd, POLLIN )))
|
|
|
|
/* stop waiting on select() if we are signaled */
|
|
|
|
set_fd_events( queue->fd, 0 );
|
|
|
|
else if (!list_empty( &obj->wait_queue ))
|
|
|
|
/* restart waiting on poll() if we are no longer signaled */
|
|
|
|
set_fd_events( queue->fd, POLLIN );
|
|
|
|
}
|
|
|
|
return ret || is_signaled( queue );
|
2000-05-30 19:48:18 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static int msg_queue_satisfied( struct object *obj, struct thread *thread )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = (struct msg_queue *)obj;
|
2001-05-18 22:51:56 +00:00
|
|
|
queue->wake_mask = 0;
|
|
|
|
queue->changed_mask = 0;
|
2000-05-30 19:48:18 +00:00
|
|
|
return 0; /* Not abandoned */
|
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
static void msg_queue_destroy( struct object *obj )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = (struct msg_queue *)obj;
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *ptr;
|
2001-06-19 19:16:41 +00:00
|
|
|
int i;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
|
|
|
cleanup_results( queue );
|
2001-06-19 19:16:41 +00:00
|
|
|
for (i = 0; i < NB_MSG_KINDS; i++) empty_msg_list( &queue->msg_list[i] );
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2004-11-29 18:08:18 +00:00
|
|
|
while ((ptr = list_head( &queue->pending_timers )))
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
|
|
|
list_remove( &timer->entry );
|
|
|
|
free( timer );
|
|
|
|
}
|
|
|
|
while ((ptr = list_head( &queue->expired_timers )))
|
|
|
|
{
|
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
|
|
|
list_remove( &timer->entry );
|
2001-05-18 22:51:56 +00:00
|
|
|
free( timer );
|
|
|
|
}
|
|
|
|
if (queue->timeout) remove_timeout_user( queue->timeout );
|
2002-10-11 18:50:15 +00:00
|
|
|
if (queue->input) release_object( queue->input );
|
2003-07-03 18:16:48 +00:00
|
|
|
if (queue->hooks) release_object( queue->hooks );
|
2007-04-04 16:02:01 +00:00
|
|
|
if (queue->fd) release_object( queue->fd );
|
|
|
|
}
|
|
|
|
|
|
|
|
static void msg_queue_poll_event( struct fd *fd, int event )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_fd_user( fd );
|
|
|
|
assert( queue->obj.ops == &msg_queue_ops );
|
|
|
|
|
|
|
|
if (event & (POLLERR | POLLHUP)) set_fd_events( fd, -1 );
|
|
|
|
wake_up( &queue->obj, 0 );
|
2002-10-11 18:50:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void thread_input_dump( struct object *obj, int verbose )
|
|
|
|
{
|
|
|
|
struct thread_input *input = (struct thread_input *)obj;
|
2002-10-19 01:00:59 +00:00
|
|
|
fprintf( stderr, "Thread input focus=%p capture=%p active=%p\n",
|
2002-10-11 18:50:15 +00:00
|
|
|
input->focus, input->capture, input->active );
|
|
|
|
}
|
|
|
|
|
|
|
|
static void thread_input_destroy( struct object *obj )
|
|
|
|
{
|
|
|
|
struct thread_input *input = (struct thread_input *)obj;
|
|
|
|
|
|
|
|
if (foreground_input == input) foreground_input = NULL;
|
2003-01-08 00:27:58 +00:00
|
|
|
empty_msg_list( &input->msg_list );
|
2006-04-07 10:15:19 +00:00
|
|
|
if (input->desktop) release_object( input->desktop );
|
2002-10-11 18:50:15 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* fix the thread input data when a window is destroyed */
|
2007-03-17 10:52:14 +00:00
|
|
|
static inline void thread_input_cleanup_window( struct msg_queue *queue, user_handle_t window )
|
2002-10-11 18:50:15 +00:00
|
|
|
{
|
|
|
|
struct thread_input *input = queue->input;
|
|
|
|
|
|
|
|
if (window == input->focus) input->focus = 0;
|
|
|
|
if (window == input->capture) input->capture = 0;
|
|
|
|
if (window == input->active) input->active = 0;
|
|
|
|
if (window == input->menu_owner) input->menu_owner = 0;
|
|
|
|
if (window == input->move_size) input->move_size = 0;
|
2002-10-17 01:24:33 +00:00
|
|
|
if (window == input->caret) set_caret_window( input, 0 );
|
2002-10-11 18:50:15 +00:00
|
|
|
}
|
|
|
|
|
2002-10-11 23:41:06 +00:00
|
|
|
/* check if the specified window can be set in the input data of a given queue */
|
|
|
|
static int check_queue_input_window( struct msg_queue *queue, user_handle_t window )
|
|
|
|
{
|
|
|
|
struct thread *thread;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
if (!window) return 1; /* we can always clear the data */
|
|
|
|
|
|
|
|
if ((thread = get_window_thread( window )))
|
|
|
|
{
|
|
|
|
ret = (queue->input == thread->queue->input);
|
|
|
|
if (!ret) set_error( STATUS_ACCESS_DENIED );
|
|
|
|
release_object( thread );
|
|
|
|
}
|
|
|
|
else set_error( STATUS_INVALID_HANDLE );
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2005-04-26 14:31:33 +00:00
|
|
|
/* make sure the specified thread has a queue */
|
|
|
|
int init_thread_queue( struct thread *thread )
|
|
|
|
{
|
|
|
|
if (thread->queue) return 1;
|
|
|
|
return (create_msg_queue( thread, NULL ) != NULL);
|
|
|
|
}
|
|
|
|
|
2002-10-11 18:50:15 +00:00
|
|
|
/* attach two thread input data structures */
|
|
|
|
int attach_thread_input( struct thread *thread_from, struct thread *thread_to )
|
|
|
|
{
|
2005-07-11 13:30:23 +00:00
|
|
|
struct desktop *desktop;
|
2002-10-11 18:50:15 +00:00
|
|
|
struct thread_input *input;
|
|
|
|
|
|
|
|
if (!thread_to->queue && !(thread_to->queue = create_msg_queue( thread_to, NULL ))) return 0;
|
2005-07-11 13:30:23 +00:00
|
|
|
if (!(desktop = get_thread_desktop( thread_from, 0 ))) return 0;
|
2002-10-11 18:50:15 +00:00
|
|
|
input = (struct thread_input *)grab_object( thread_to->queue->input );
|
2005-07-11 13:30:23 +00:00
|
|
|
if (input->desktop != desktop)
|
|
|
|
{
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
release_object( input );
|
|
|
|
release_object( desktop );
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
release_object( desktop );
|
2002-10-11 18:50:15 +00:00
|
|
|
|
|
|
|
if (thread_from->queue)
|
|
|
|
{
|
2004-06-17 20:00:25 +00:00
|
|
|
release_thread_input( thread_from );
|
2002-10-11 18:50:15 +00:00
|
|
|
thread_from->queue->input = input;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if (!(thread_from->queue = create_msg_queue( thread_from, input ))) return 0;
|
|
|
|
}
|
|
|
|
memset( input->keystate, 0, sizeof(input->keystate) );
|
|
|
|
return 1;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2002-10-11 18:50:15 +00:00
|
|
|
/* detach two thread input data structures */
|
2005-07-11 13:30:23 +00:00
|
|
|
void detach_thread_input( struct thread *thread_from )
|
2002-10-11 18:50:15 +00:00
|
|
|
{
|
|
|
|
struct thread_input *input;
|
|
|
|
|
2005-07-11 13:30:23 +00:00
|
|
|
if ((input = create_thread_input( thread_from )))
|
2002-10-11 18:50:15 +00:00
|
|
|
{
|
2004-06-17 20:00:25 +00:00
|
|
|
release_thread_input( thread_from );
|
2002-10-11 18:50:15 +00:00
|
|
|
thread_from->queue->input = input;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* set the next timer to expire */
|
2004-11-29 18:08:18 +00:00
|
|
|
static void set_next_timer( struct msg_queue *queue )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *ptr;
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
if (queue->timeout)
|
|
|
|
{
|
|
|
|
remove_timeout_user( queue->timeout );
|
|
|
|
queue->timeout = NULL;
|
|
|
|
}
|
2004-11-29 18:08:18 +00:00
|
|
|
if ((ptr = list_head( &queue->pending_timers )))
|
|
|
|
{
|
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
2007-04-17 18:08:59 +00:00
|
|
|
queue->timeout = add_timeout_user( timer->when, timer_callback, queue );
|
2004-11-29 18:08:18 +00:00
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
/* set/clear QS_TIMER bit */
|
2004-11-29 18:08:18 +00:00
|
|
|
if (list_empty( &queue->expired_timers ))
|
2001-08-07 19:19:08 +00:00
|
|
|
clear_queue_bits( queue, QS_TIMER );
|
2001-05-18 22:51:56 +00:00
|
|
|
else
|
2001-08-07 19:19:08 +00:00
|
|
|
set_queue_bits( queue, QS_TIMER );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2004-11-29 18:08:18 +00:00
|
|
|
/* find a timer from its window and id */
|
|
|
|
static struct timer *find_timer( struct msg_queue *queue, user_handle_t win,
|
2006-10-16 15:03:44 +00:00
|
|
|
unsigned int msg, unsigned long id )
|
2004-11-29 18:08:18 +00:00
|
|
|
{
|
|
|
|
struct list *ptr;
|
|
|
|
|
|
|
|
/* we need to search both lists */
|
|
|
|
|
|
|
|
LIST_FOR_EACH( ptr, &queue->pending_timers )
|
|
|
|
{
|
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
|
|
|
if (timer->win == win && timer->msg == msg && timer->id == id) return timer;
|
|
|
|
}
|
|
|
|
LIST_FOR_EACH( ptr, &queue->expired_timers )
|
|
|
|
{
|
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
|
|
|
if (timer->win == win && timer->msg == msg && timer->id == id) return timer;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* callback for the next timer expiration */
|
|
|
|
static void timer_callback( void *private )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = private;
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *ptr;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
|
|
|
queue->timeout = NULL;
|
|
|
|
/* move on to the next timer */
|
2004-11-29 18:08:18 +00:00
|
|
|
ptr = list_head( &queue->pending_timers );
|
|
|
|
list_remove( ptr );
|
|
|
|
list_add_tail( &queue->expired_timers, ptr );
|
|
|
|
set_next_timer( queue );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* link a timer at its rightful place in the queue list */
|
|
|
|
static void link_timer( struct msg_queue *queue, struct timer *timer )
|
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *ptr;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2004-11-29 18:08:18 +00:00
|
|
|
for (ptr = queue->pending_timers.next; ptr != &queue->pending_timers; ptr = ptr->next)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct timer *t = LIST_ENTRY( ptr, struct timer, entry );
|
2007-04-17 18:08:59 +00:00
|
|
|
if (t->when >= timer->when) break;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
2004-11-29 18:08:18 +00:00
|
|
|
list_add_before( ptr, &timer->entry );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2004-11-29 18:08:18 +00:00
|
|
|
/* remove a timer from the queue timer list and free it */
|
|
|
|
static void free_timer( struct msg_queue *queue, struct timer *timer )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
list_remove( &timer->entry );
|
|
|
|
free( timer );
|
|
|
|
set_next_timer( queue );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* restart an expired timer */
|
|
|
|
static void restart_timer( struct msg_queue *queue, struct timer *timer )
|
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
list_remove( &timer->entry );
|
2007-04-17 18:08:59 +00:00
|
|
|
while (timer->when <= current_time) timer->when += (timeout_t)timer->rate * 10000;
|
2001-05-18 22:51:56 +00:00
|
|
|
link_timer( queue, timer );
|
2004-11-29 18:08:18 +00:00
|
|
|
set_next_timer( queue );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* find an expired timer matching the filtering parameters */
|
2001-08-28 18:44:52 +00:00
|
|
|
static struct timer *find_expired_timer( struct msg_queue *queue, user_handle_t win,
|
2001-05-18 22:51:56 +00:00
|
|
|
unsigned int get_first, unsigned int get_last,
|
|
|
|
int remove )
|
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *ptr;
|
|
|
|
|
|
|
|
LIST_FOR_EACH( ptr, &queue->expired_timers )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
2001-05-18 22:51:56 +00:00
|
|
|
if (win && timer->win != win) continue;
|
2005-04-20 13:03:59 +00:00
|
|
|
if (check_msg_filter( timer->msg, get_first, get_last ))
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
if (remove) restart_timer( queue, timer );
|
|
|
|
return timer;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* add a timer */
|
|
|
|
static struct timer *set_timer( struct msg_queue *queue, unsigned int rate )
|
|
|
|
{
|
|
|
|
struct timer *timer = mem_alloc( sizeof(*timer) );
|
|
|
|
if (timer)
|
|
|
|
{
|
2006-08-10 14:42:09 +00:00
|
|
|
timer->rate = max( rate, 1 );
|
2007-04-17 18:08:59 +00:00
|
|
|
timer->when = current_time + (timeout_t)timer->rate * 10000;
|
2001-05-18 22:51:56 +00:00
|
|
|
link_timer( queue, timer );
|
2004-11-29 18:08:18 +00:00
|
|
|
/* check if we replaced the next timer */
|
|
|
|
if (list_head( &queue->pending_timers ) == &timer->entry) set_next_timer( queue );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
return timer;
|
|
|
|
}
|
|
|
|
|
2003-01-08 19:56:31 +00:00
|
|
|
/* change the input key state for a given key */
|
|
|
|
static void set_input_key_state( struct thread_input *input, unsigned char key, int down )
|
|
|
|
{
|
|
|
|
if (down)
|
|
|
|
{
|
|
|
|
if (!(input->keystate[key] & 0x80)) input->keystate[key] ^= 0x01;
|
|
|
|
input->keystate[key] |= 0x80;
|
|
|
|
}
|
|
|
|
else input->keystate[key] &= ~0x80;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* update the input key state for a keyboard message */
|
|
|
|
static void update_input_key_state( struct thread_input *input, const struct message *msg )
|
|
|
|
{
|
|
|
|
unsigned char key;
|
|
|
|
int down = 0, extended;
|
|
|
|
|
|
|
|
switch (msg->msg)
|
|
|
|
{
|
|
|
|
case WM_LBUTTONDOWN:
|
|
|
|
down = 1;
|
|
|
|
/* fall through */
|
|
|
|
case WM_LBUTTONUP:
|
|
|
|
set_input_key_state( input, VK_LBUTTON, down );
|
|
|
|
break;
|
|
|
|
case WM_MBUTTONDOWN:
|
|
|
|
down = 1;
|
|
|
|
/* fall through */
|
|
|
|
case WM_MBUTTONUP:
|
|
|
|
set_input_key_state( input, VK_MBUTTON, down );
|
|
|
|
break;
|
|
|
|
case WM_RBUTTONDOWN:
|
|
|
|
down = 1;
|
|
|
|
/* fall through */
|
|
|
|
case WM_RBUTTONUP:
|
|
|
|
set_input_key_state( input, VK_RBUTTON, down );
|
|
|
|
break;
|
2005-03-24 19:16:54 +00:00
|
|
|
case WM_XBUTTONDOWN:
|
|
|
|
down = 1;
|
|
|
|
/* fall through */
|
|
|
|
case WM_XBUTTONUP:
|
|
|
|
if (msg->wparam == XBUTTON1) set_input_key_state( input, VK_XBUTTON1, down );
|
|
|
|
else if (msg->wparam == XBUTTON2) set_input_key_state( input, VK_XBUTTON2, down );
|
|
|
|
break;
|
2003-01-08 19:56:31 +00:00
|
|
|
case WM_KEYDOWN:
|
|
|
|
case WM_SYSKEYDOWN:
|
|
|
|
down = 1;
|
|
|
|
/* fall through */
|
|
|
|
case WM_KEYUP:
|
|
|
|
case WM_SYSKEYUP:
|
|
|
|
key = (unsigned char)msg->wparam;
|
|
|
|
extended = ((msg->lparam >> 16) & KF_EXTENDED) != 0;
|
|
|
|
set_input_key_state( input, key, down );
|
|
|
|
switch(key)
|
|
|
|
{
|
|
|
|
case VK_SHIFT:
|
|
|
|
set_input_key_state( input, extended ? VK_RSHIFT : VK_LSHIFT, down );
|
|
|
|
break;
|
|
|
|
case VK_CONTROL:
|
|
|
|
set_input_key_state( input, extended ? VK_RCONTROL : VK_LCONTROL, down );
|
|
|
|
break;
|
|
|
|
case VK_MENU:
|
|
|
|
set_input_key_state( input, extended ? VK_RMENU : VK_LMENU, down );
|
|
|
|
break;
|
2006-04-12 18:13:46 +00:00
|
|
|
case VK_LCONTROL:
|
|
|
|
case VK_RCONTROL:
|
|
|
|
set_input_key_state( input, VK_CONTROL, down );
|
|
|
|
break;
|
|
|
|
case VK_LMENU:
|
|
|
|
case VK_RMENU:
|
|
|
|
set_input_key_state( input, VK_MENU, down );
|
|
|
|
break;
|
|
|
|
case VK_LSHIFT:
|
|
|
|
case VK_RSHIFT:
|
|
|
|
set_input_key_state( input, VK_SHIFT, down );
|
|
|
|
break;
|
2003-01-08 19:56:31 +00:00
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
/* release the hardware message currently being processed by the given thread */
|
2005-04-20 13:03:59 +00:00
|
|
|
static void release_hardware_message( struct msg_queue *queue, unsigned int hw_id,
|
|
|
|
int remove, user_handle_t new_win )
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
2005-04-20 13:03:59 +00:00
|
|
|
struct thread_input *input = queue->input;
|
|
|
|
struct message *msg;
|
2003-01-08 00:27:58 +00:00
|
|
|
|
2005-04-20 13:03:59 +00:00
|
|
|
LIST_FOR_EACH_ENTRY( msg, &input->msg_list, struct message, entry )
|
|
|
|
{
|
|
|
|
if (msg->unique_id == hw_id) break;
|
|
|
|
}
|
|
|
|
if (&msg->entry == &input->msg_list) return; /* not found */
|
2005-03-23 10:33:17 +00:00
|
|
|
|
|
|
|
/* clear the queue bit for that message */
|
|
|
|
if (remove || new_win)
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
struct message *other;
|
|
|
|
int clr_bit;
|
|
|
|
|
2005-04-20 13:03:59 +00:00
|
|
|
clr_bit = get_hardware_msg_bit( msg );
|
2005-02-25 21:05:11 +00:00
|
|
|
LIST_FOR_EACH_ENTRY( other, &input->msg_list, struct message, entry )
|
|
|
|
{
|
2005-04-20 13:03:59 +00:00
|
|
|
if (other != msg && get_hardware_msg_bit( other ) == clr_bit)
|
2005-02-25 21:05:11 +00:00
|
|
|
{
|
|
|
|
clr_bit = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2005-04-20 13:03:59 +00:00
|
|
|
if (clr_bit) clear_queue_bits( queue, clr_bit );
|
2005-03-23 10:33:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (new_win) /* set the new window */
|
|
|
|
{
|
|
|
|
struct thread *owner = get_window_thread( new_win );
|
|
|
|
if (owner)
|
|
|
|
{
|
2005-05-13 14:00:19 +00:00
|
|
|
if (owner->queue->input == input)
|
|
|
|
{
|
|
|
|
msg->win = new_win;
|
|
|
|
set_queue_bits( owner->queue, get_hardware_msg_bit( msg ));
|
|
|
|
remove = 0;
|
|
|
|
}
|
2005-03-23 10:33:17 +00:00
|
|
|
release_object( owner );
|
|
|
|
}
|
|
|
|
}
|
2005-05-13 14:00:19 +00:00
|
|
|
if (remove)
|
2005-03-23 10:33:17 +00:00
|
|
|
{
|
2005-04-20 13:03:59 +00:00
|
|
|
update_input_key_state( input, msg );
|
|
|
|
list_remove( &msg->entry );
|
|
|
|
free_message( msg );
|
2003-01-08 00:27:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* find the window that should receive a given hardware message */
|
2003-01-08 19:56:31 +00:00
|
|
|
static user_handle_t find_hardware_message_window( struct thread_input *input, struct message *msg,
|
|
|
|
unsigned int *msg_code )
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
user_handle_t win = 0;
|
|
|
|
|
2003-01-08 19:56:31 +00:00
|
|
|
*msg_code = msg->msg;
|
2003-01-08 00:27:58 +00:00
|
|
|
if (is_keyboard_msg( msg ))
|
|
|
|
{
|
2003-01-08 19:56:31 +00:00
|
|
|
if (input && !(win = input->focus))
|
|
|
|
{
|
|
|
|
win = input->active;
|
|
|
|
if (*msg_code < WM_SYSKEYDOWN) *msg_code += WM_SYSKEYDOWN - WM_KEYDOWN;
|
|
|
|
}
|
2003-01-08 00:27:58 +00:00
|
|
|
}
|
|
|
|
else /* mouse message */
|
|
|
|
{
|
|
|
|
if (!input || !(win = input->capture))
|
|
|
|
{
|
2004-10-27 21:55:00 +00:00
|
|
|
if (!(win = msg->win) || !is_window_visible( win ))
|
2005-08-16 19:58:12 +00:00
|
|
|
{
|
|
|
|
if (input) win = window_from_point( input->desktop, msg->x, msg->y );
|
|
|
|
}
|
2003-01-08 00:27:58 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return win;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* queue a hardware message into a given thread input */
|
|
|
|
static void queue_hardware_message( struct msg_queue *queue, struct message *msg )
|
|
|
|
{
|
|
|
|
user_handle_t win;
|
2005-03-17 20:51:53 +00:00
|
|
|
struct thread *thread;
|
2006-02-14 09:43:15 +00:00
|
|
|
struct thread_input *input = queue ? queue->input : foreground_input;
|
2003-01-08 19:56:31 +00:00
|
|
|
unsigned int msg_code;
|
2003-01-08 00:27:58 +00:00
|
|
|
|
2005-04-28 12:04:14 +00:00
|
|
|
last_input_time = get_tick_count();
|
2006-02-14 09:43:15 +00:00
|
|
|
win = find_hardware_message_window( input, msg, &msg_code );
|
2005-03-17 20:51:53 +00:00
|
|
|
if (!win || !(thread = get_window_thread(win)))
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
2006-02-14 09:43:15 +00:00
|
|
|
if (input) update_input_key_state( input, msg );
|
2003-01-08 00:27:58 +00:00
|
|
|
free( msg );
|
|
|
|
return;
|
|
|
|
}
|
2005-03-17 20:51:53 +00:00
|
|
|
input = thread->queue->input;
|
2003-01-08 00:27:58 +00:00
|
|
|
|
|
|
|
if (msg->msg == WM_MOUSEMOVE && merge_message( input, msg )) free( msg );
|
|
|
|
else
|
|
|
|
{
|
2005-04-20 13:03:59 +00:00
|
|
|
msg->unique_id = 0; /* will be set once we return it to the app */
|
2005-02-25 21:05:11 +00:00
|
|
|
list_add_tail( &input->msg_list, &msg->entry );
|
2003-01-08 00:27:58 +00:00
|
|
|
set_queue_bits( thread->queue, get_hardware_msg_bit(msg) );
|
|
|
|
}
|
2005-03-17 20:51:53 +00:00
|
|
|
release_object( thread );
|
2003-01-08 00:27:58 +00:00
|
|
|
}
|
|
|
|
|
2005-04-20 13:03:59 +00:00
|
|
|
/* check message filter for a hardware message */
|
|
|
|
static int check_hw_message_filter( user_handle_t win, unsigned int msg_code,
|
|
|
|
user_handle_t filter_win, unsigned int first, unsigned int last )
|
|
|
|
{
|
|
|
|
if (msg_code >= WM_KEYFIRST && msg_code <= WM_KEYLAST)
|
|
|
|
{
|
|
|
|
/* we can only test the window for a keyboard message since the
|
|
|
|
* dest window for a mouse message depends on hittest */
|
|
|
|
if (filter_win && win != filter_win && !is_child_window( filter_win, win ))
|
|
|
|
return 0;
|
|
|
|
/* the message code is final for a keyboard message, we can simply check it */
|
|
|
|
return check_msg_filter( msg_code, first, last );
|
|
|
|
}
|
|
|
|
else /* mouse message */
|
|
|
|
{
|
|
|
|
/* we need to check all possible values that the message can have in the end */
|
|
|
|
|
|
|
|
if (check_msg_filter( msg_code, first, last )) return 1;
|
|
|
|
if (msg_code == WM_MOUSEWHEEL) return 0; /* no other possible value for this one */
|
|
|
|
|
|
|
|
/* all other messages can become non-client messages */
|
|
|
|
if (check_msg_filter( msg_code + (WM_NCMOUSEFIRST - WM_MOUSEFIRST), first, last )) return 1;
|
|
|
|
|
|
|
|
/* clicks can become double-clicks or non-client double-clicks */
|
|
|
|
if (msg_code == WM_LBUTTONDOWN || msg_code == WM_MBUTTONDOWN ||
|
|
|
|
msg_code == WM_RBUTTONDOWN || msg_code == WM_XBUTTONDOWN)
|
|
|
|
{
|
|
|
|
if (check_msg_filter( msg_code + (WM_LBUTTONDBLCLK - WM_LBUTTONDOWN), first, last )) return 1;
|
|
|
|
if (check_msg_filter( msg_code + (WM_NCLBUTTONDBLCLK - WM_LBUTTONDOWN), first, last )) return 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
/* find a hardware message for the given queue */
|
2006-07-25 08:30:04 +00:00
|
|
|
static int get_hardware_message( struct thread *thread, unsigned int hw_id, user_handle_t filter_win,
|
2005-04-20 13:03:59 +00:00
|
|
|
unsigned int first, unsigned int last, struct get_message_reply *reply )
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
struct thread_input *input = thread->queue->input;
|
|
|
|
struct thread *win_thread;
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list *ptr;
|
2003-01-08 00:27:58 +00:00
|
|
|
user_handle_t win;
|
|
|
|
int clear_bits, got_one = 0;
|
2003-01-08 19:56:31 +00:00
|
|
|
unsigned int msg_code;
|
2003-01-08 00:27:58 +00:00
|
|
|
|
2005-04-20 13:03:59 +00:00
|
|
|
ptr = list_head( &input->msg_list );
|
|
|
|
if (hw_id)
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
2005-04-20 13:03:59 +00:00
|
|
|
while (ptr)
|
|
|
|
{
|
|
|
|
struct message *msg = LIST_ENTRY( ptr, struct message, entry );
|
|
|
|
if (msg->unique_id == hw_id) break;
|
|
|
|
ptr = list_next( &input->msg_list, ptr );
|
|
|
|
}
|
|
|
|
if (!ptr) ptr = list_head( &input->msg_list );
|
|
|
|
else ptr = list_next( &input->msg_list, ptr ); /* start from the next one */
|
2003-01-08 00:27:58 +00:00
|
|
|
}
|
2005-04-20 13:03:59 +00:00
|
|
|
|
|
|
|
if (ptr == list_head( &input->msg_list ))
|
|
|
|
clear_bits = QS_KEY | QS_MOUSEMOVE | QS_MOUSEBUTTON;
|
2003-01-08 00:27:58 +00:00
|
|
|
else
|
|
|
|
clear_bits = 0; /* don't clear bits if we don't go through the whole list */
|
|
|
|
|
2005-02-25 21:05:11 +00:00
|
|
|
while (ptr)
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct message *msg = LIST_ENTRY( ptr, struct message, entry );
|
2005-05-14 11:08:05 +00:00
|
|
|
ptr = list_next( &input->msg_list, ptr );
|
2003-01-08 19:56:31 +00:00
|
|
|
win = find_hardware_message_window( input, msg, &msg_code );
|
2003-01-08 00:27:58 +00:00
|
|
|
if (!win || !(win_thread = get_window_thread( win )))
|
|
|
|
{
|
|
|
|
/* no window at all, remove it */
|
2003-01-08 19:56:31 +00:00
|
|
|
update_input_key_state( input, msg );
|
2005-02-25 21:05:11 +00:00
|
|
|
list_remove( &msg->entry );
|
2003-01-08 00:27:58 +00:00
|
|
|
free_message( msg );
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (win_thread != thread)
|
|
|
|
{
|
2005-05-14 11:08:05 +00:00
|
|
|
if (win_thread->queue->input == input)
|
|
|
|
{
|
|
|
|
/* wake the other thread */
|
|
|
|
set_queue_bits( win_thread->queue, get_hardware_msg_bit(msg) );
|
|
|
|
got_one = 1;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* for another thread input, drop it */
|
|
|
|
update_input_key_state( input, msg );
|
|
|
|
list_remove( &msg->entry );
|
|
|
|
free_message( msg );
|
|
|
|
}
|
2003-01-08 00:27:58 +00:00
|
|
|
release_object( win_thread );
|
|
|
|
continue;
|
|
|
|
}
|
2005-04-20 13:03:59 +00:00
|
|
|
release_object( win_thread );
|
|
|
|
|
2003-01-08 00:27:58 +00:00
|
|
|
/* if we already got a message for another thread, or if it doesn't
|
2005-04-20 13:03:59 +00:00
|
|
|
* match the filter we skip it */
|
|
|
|
if (got_one || !check_hw_message_filter( win, msg_code, filter_win, first, last ))
|
2003-01-08 00:27:58 +00:00
|
|
|
{
|
|
|
|
clear_bits &= ~get_hardware_msg_bit( msg );
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
/* now we can return it */
|
2005-04-20 13:03:59 +00:00
|
|
|
if (!msg->unique_id) msg->unique_id = get_unique_id();
|
2003-01-08 00:27:58 +00:00
|
|
|
reply->type = MSG_HARDWARE;
|
|
|
|
reply->win = win;
|
2003-01-08 19:56:31 +00:00
|
|
|
reply->msg = msg_code;
|
2003-01-08 00:27:58 +00:00
|
|
|
reply->wparam = msg->wparam;
|
|
|
|
reply->lparam = msg->lparam;
|
|
|
|
reply->x = msg->x;
|
|
|
|
reply->y = msg->y;
|
|
|
|
reply->time = msg->time;
|
|
|
|
reply->info = msg->info;
|
2005-04-20 13:03:59 +00:00
|
|
|
reply->hw_id = msg->unique_id;
|
2003-01-08 00:27:58 +00:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
/* nothing found, clear the hardware queue bits */
|
|
|
|
clear_queue_bits( thread->queue, clear_bits );
|
|
|
|
return 0;
|
|
|
|
}
|
2001-11-13 22:23:48 +00:00
|
|
|
|
|
|
|
/* increment (or decrement if 'incr' is negative) the queue paint count */
|
|
|
|
void inc_queue_paint_count( struct thread *thread, int incr )
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = thread->queue;
|
|
|
|
|
|
|
|
assert( queue );
|
|
|
|
|
|
|
|
if ((queue->paint_count += incr) < 0) queue->paint_count = 0;
|
|
|
|
|
|
|
|
if (queue->paint_count)
|
|
|
|
set_queue_bits( queue, QS_PAINT );
|
|
|
|
else
|
|
|
|
clear_queue_bits( queue, QS_PAINT );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* remove all messages and timers belonging to a certain window */
|
2001-08-28 18:44:52 +00:00
|
|
|
void queue_cleanup_window( struct thread *thread, user_handle_t win )
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2001-08-28 18:44:52 +00:00
|
|
|
struct msg_queue *queue = thread->queue;
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *ptr;
|
2001-06-19 19:16:41 +00:00
|
|
|
int i;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2001-08-28 18:44:52 +00:00
|
|
|
if (!queue) return;
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* remove timers */
|
2004-11-29 18:08:18 +00:00
|
|
|
|
|
|
|
ptr = list_head( &queue->pending_timers );
|
|
|
|
while (ptr)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct list *next = list_next( &queue->pending_timers, ptr );
|
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
|
|
|
if (timer->win == win) free_timer( queue, timer );
|
|
|
|
ptr = next;
|
|
|
|
}
|
|
|
|
ptr = list_head( &queue->expired_timers );
|
|
|
|
while (ptr)
|
|
|
|
{
|
|
|
|
struct list *next = list_next( &queue->expired_timers, ptr );
|
|
|
|
struct timer *timer = LIST_ENTRY( ptr, struct timer, entry );
|
|
|
|
if (timer->win == win) free_timer( queue, timer );
|
|
|
|
ptr = next;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2001-06-19 19:16:41 +00:00
|
|
|
/* remove messages */
|
|
|
|
for (i = 0; i < NB_MSG_KINDS; i++)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list *ptr, *next;
|
|
|
|
|
|
|
|
LIST_FOR_EACH_SAFE( ptr, next, &queue->msg_list[i] )
|
2001-06-19 19:16:41 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct message *msg = LIST_ENTRY( ptr, struct message, entry );
|
2001-06-19 19:16:41 +00:00
|
|
|
if (msg->win == win) remove_queue_message( queue, msg, i );
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
2002-10-11 18:50:15 +00:00
|
|
|
|
|
|
|
thread_input_cleanup_window( queue, win );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
2002-03-23 20:43:52 +00:00
|
|
|
/* post a message to a window; used by socket handling */
|
|
|
|
void post_message( user_handle_t win, unsigned int message,
|
2006-06-08 08:01:54 +00:00
|
|
|
unsigned long wparam, unsigned long lparam )
|
2002-03-23 20:43:52 +00:00
|
|
|
{
|
|
|
|
struct message *msg;
|
|
|
|
struct thread *thread = get_window_thread( win );
|
|
|
|
|
|
|
|
if (!thread) return;
|
|
|
|
|
|
|
|
if (thread->queue && (msg = mem_alloc( sizeof(*msg) )))
|
|
|
|
{
|
|
|
|
msg->type = MSG_POSTED;
|
|
|
|
msg->win = get_user_full_handle( win );
|
|
|
|
msg->msg = message;
|
|
|
|
msg->wparam = wparam;
|
|
|
|
msg->lparam = lparam;
|
|
|
|
msg->time = get_tick_count();
|
|
|
|
msg->x = 0;
|
|
|
|
msg->y = 0;
|
|
|
|
msg->info = 0;
|
|
|
|
msg->result = NULL;
|
|
|
|
msg->data = NULL;
|
|
|
|
msg->data_size = 0;
|
|
|
|
|
2005-02-25 21:05:11 +00:00
|
|
|
list_add_tail( &thread->queue->msg_list[POST_MESSAGE], &msg->entry );
|
2005-11-14 15:17:09 +00:00
|
|
|
set_queue_bits( thread->queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
|
2002-03-23 20:43:52 +00:00
|
|
|
}
|
|
|
|
release_object( thread );
|
|
|
|
}
|
|
|
|
|
2005-02-03 16:40:20 +00:00
|
|
|
/* post a win event */
|
|
|
|
void post_win_event( struct thread *thread, unsigned int event,
|
|
|
|
user_handle_t win, unsigned int object_id,
|
|
|
|
unsigned int child_id, void *hook_proc,
|
2006-07-26 08:43:25 +00:00
|
|
|
const WCHAR *module, data_size_t module_size,
|
2005-02-03 16:40:20 +00:00
|
|
|
user_handle_t hook)
|
|
|
|
{
|
|
|
|
struct message *msg;
|
|
|
|
|
|
|
|
if (thread->queue && (msg = mem_alloc( sizeof(*msg) )))
|
|
|
|
{
|
2006-10-04 14:04:53 +00:00
|
|
|
struct winevent_msg_data *data;
|
|
|
|
|
2005-02-03 16:40:20 +00:00
|
|
|
msg->type = MSG_WINEVENT;
|
|
|
|
msg->win = get_user_full_handle( win );
|
|
|
|
msg->msg = event;
|
|
|
|
msg->wparam = object_id;
|
|
|
|
msg->lparam = child_id;
|
|
|
|
msg->time = get_tick_count();
|
|
|
|
msg->x = 0;
|
|
|
|
msg->y = 0;
|
2006-10-04 14:04:53 +00:00
|
|
|
msg->info = 0;
|
2005-02-03 16:40:20 +00:00
|
|
|
msg->result = NULL;
|
|
|
|
|
2006-10-04 14:04:53 +00:00
|
|
|
if ((data = malloc( sizeof(*data) + module_size )))
|
2005-02-03 16:40:20 +00:00
|
|
|
{
|
2006-10-04 14:04:53 +00:00
|
|
|
data->hook = hook;
|
|
|
|
data->tid = get_thread_id( current );
|
|
|
|
data->hook_proc = hook_proc;
|
|
|
|
memcpy( data + 1, module, module_size );
|
|
|
|
|
|
|
|
msg->data = data;
|
|
|
|
msg->data_size = sizeof(*data) + module_size;
|
2005-02-03 16:40:20 +00:00
|
|
|
|
|
|
|
if (debug_level > 1)
|
|
|
|
fprintf( stderr, "post_win_event: tid %04x event %04x win %p object_id %d child_id %d\n",
|
|
|
|
get_thread_id(thread), event, win, object_id, child_id );
|
2005-02-25 21:05:11 +00:00
|
|
|
list_add_tail( &thread->queue->msg_list[SEND_MESSAGE], &msg->entry );
|
2005-02-03 16:40:20 +00:00
|
|
|
set_queue_bits( thread->queue, QS_SENDMESSAGE );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
free( msg );
|
|
|
|
}
|
|
|
|
}
|
2002-03-23 20:43:52 +00:00
|
|
|
|
2000-05-30 19:48:18 +00:00
|
|
|
/* get the message queue of the current thread */
|
|
|
|
DECL_HANDLER(get_msg_queue)
|
|
|
|
{
|
2001-05-18 22:51:56 +00:00
|
|
|
struct msg_queue *queue = get_current_queue();
|
2000-05-30 19:48:18 +00:00
|
|
|
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->handle = 0;
|
|
|
|
if (queue) reply->handle = alloc_handle( current->process, queue, SYNCHRONIZE, 0 );
|
2000-05-30 19:48:18 +00:00
|
|
|
}
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2007-04-04 16:02:01 +00:00
|
|
|
/* set the file descriptor associated to the current thread queue */
|
|
|
|
DECL_HANDLER(set_queue_fd)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
struct file *file;
|
|
|
|
int unix_fd;
|
|
|
|
|
|
|
|
if (queue->fd) /* fd can only be set once */
|
|
|
|
{
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (!(file = get_file_obj( current->process, req->handle, SYNCHRONIZE ))) return;
|
|
|
|
|
|
|
|
if ((unix_fd = get_file_unix_fd( file )) != -1)
|
|
|
|
{
|
|
|
|
if ((unix_fd = dup( unix_fd )) != -1)
|
2007-04-10 20:25:07 +00:00
|
|
|
queue->fd = create_anonymous_fd( &msg_queue_fd_ops, unix_fd, &queue->obj, 0 );
|
2007-04-04 16:02:01 +00:00
|
|
|
else
|
|
|
|
file_set_error();
|
|
|
|
}
|
|
|
|
release_object( file );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* set the current message queue wakeup mask */
|
|
|
|
DECL_HANDLER(set_queue_mask)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
if (queue)
|
|
|
|
{
|
|
|
|
queue->wake_mask = req->wake_mask;
|
|
|
|
queue->changed_mask = req->changed_mask;
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->wake_bits = queue->wake_bits;
|
|
|
|
reply->changed_bits = queue->changed_bits;
|
2001-05-18 22:51:56 +00:00
|
|
|
if (is_signaled( queue ))
|
|
|
|
{
|
|
|
|
/* if skip wait is set, do what would have been done in the subsequent wait */
|
|
|
|
if (req->skip_wait) msg_queue_satisfied( &queue->obj, current );
|
|
|
|
else wake_up( &queue->obj, 0 );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* get the current message queue status */
|
|
|
|
DECL_HANDLER(get_queue_status)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = current->queue;
|
|
|
|
if (queue)
|
|
|
|
{
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->wake_bits = queue->wake_bits;
|
|
|
|
reply->changed_bits = queue->changed_bits;
|
2001-05-18 22:51:56 +00:00
|
|
|
if (req->clear) queue->changed_bits = 0;
|
|
|
|
}
|
2001-11-30 18:46:42 +00:00
|
|
|
else reply->wake_bits = reply->changed_bits = 0;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* send a message to a thread queue */
|
|
|
|
DECL_HANDLER(send_message)
|
|
|
|
{
|
|
|
|
struct message *msg;
|
|
|
|
struct msg_queue *send_queue = get_current_queue();
|
2003-01-08 00:27:58 +00:00
|
|
|
struct msg_queue *recv_queue = NULL;
|
|
|
|
struct thread *thread = NULL;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2006-08-09 14:45:26 +00:00
|
|
|
if (!(thread = get_thread_from_id( req->id ))) return;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2006-08-09 14:45:26 +00:00
|
|
|
if (!(recv_queue = thread->queue))
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
|
|
|
set_error( STATUS_INVALID_PARAMETER );
|
|
|
|
release_object( thread );
|
|
|
|
return;
|
|
|
|
}
|
2006-08-09 14:45:26 +00:00
|
|
|
if ((req->flags & SEND_MSG_ABORT_IF_HUNG) && is_queue_hung(recv_queue))
|
2003-07-11 04:09:42 +00:00
|
|
|
{
|
|
|
|
set_error( STATUS_TIMEOUT );
|
|
|
|
release_object( thread );
|
|
|
|
return;
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
|
|
|
|
if ((msg = mem_alloc( sizeof(*msg) )))
|
|
|
|
{
|
2001-08-07 19:19:08 +00:00
|
|
|
msg->type = req->type;
|
2001-09-12 17:09:24 +00:00
|
|
|
msg->win = get_user_full_handle( req->win );
|
2001-08-07 19:19:08 +00:00
|
|
|
msg->msg = req->msg;
|
|
|
|
msg->wparam = req->wparam;
|
|
|
|
msg->lparam = req->lparam;
|
2006-08-09 14:45:26 +00:00
|
|
|
msg->time = get_tick_count();
|
|
|
|
msg->x = 0;
|
|
|
|
msg->y = 0;
|
2006-10-04 18:25:42 +00:00
|
|
|
msg->info = 0;
|
2001-08-07 19:19:08 +00:00
|
|
|
msg->result = NULL;
|
|
|
|
msg->data = NULL;
|
2006-10-04 18:25:42 +00:00
|
|
|
msg->data_size = get_req_data_size();
|
|
|
|
|
|
|
|
if (msg->data_size && !(msg->data = memdup( get_req_data(), msg->data_size )))
|
|
|
|
{
|
|
|
|
free( msg );
|
|
|
|
release_object( thread );
|
|
|
|
return;
|
|
|
|
}
|
2001-08-07 19:19:08 +00:00
|
|
|
|
|
|
|
switch(msg->type)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2002-01-18 19:22:55 +00:00
|
|
|
case MSG_OTHER_PROCESS:
|
2001-08-07 19:19:08 +00:00
|
|
|
case MSG_ASCII:
|
|
|
|
case MSG_UNICODE:
|
|
|
|
case MSG_CALLBACK:
|
2006-10-04 18:25:42 +00:00
|
|
|
if (!(msg->result = alloc_message_result( send_queue, recv_queue, msg, req->timeout )))
|
2001-07-11 17:29:01 +00:00
|
|
|
{
|
2003-07-26 20:36:43 +00:00
|
|
|
free_message( msg );
|
2001-08-07 19:19:08 +00:00
|
|
|
break;
|
2001-07-11 17:29:01 +00:00
|
|
|
}
|
2001-08-07 19:19:08 +00:00
|
|
|
/* fall through */
|
|
|
|
case MSG_NOTIFY:
|
2005-02-25 21:05:11 +00:00
|
|
|
list_add_tail( &recv_queue->msg_list[SEND_MESSAGE], &msg->entry );
|
2001-08-07 19:19:08 +00:00
|
|
|
set_queue_bits( recv_queue, QS_SENDMESSAGE );
|
|
|
|
break;
|
|
|
|
case MSG_POSTED:
|
2005-02-25 21:05:11 +00:00
|
|
|
list_add_tail( &recv_queue->msg_list[POST_MESSAGE], &msg->entry );
|
2005-11-14 15:17:09 +00:00
|
|
|
set_queue_bits( recv_queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
|
2001-06-19 19:16:41 +00:00
|
|
|
break;
|
2006-08-09 14:45:26 +00:00
|
|
|
case MSG_HARDWARE: /* should use send_hardware_message instead */
|
2003-07-26 20:36:43 +00:00
|
|
|
case MSG_CALLBACK_RESULT: /* cannot send this one */
|
2001-06-19 19:16:41 +00:00
|
|
|
default:
|
|
|
|
set_error( STATUS_INVALID_PARAMETER );
|
2001-08-07 19:19:08 +00:00
|
|
|
free( msg );
|
2001-06-19 19:16:41 +00:00
|
|
|
break;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
}
|
2006-08-09 14:45:26 +00:00
|
|
|
release_object( thread );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* send a hardware message to a thread queue */
|
|
|
|
DECL_HANDLER(send_hardware_message)
|
|
|
|
{
|
|
|
|
struct message *msg;
|
|
|
|
struct msg_queue *recv_queue = NULL;
|
|
|
|
struct thread *thread = NULL;
|
|
|
|
|
|
|
|
if (req->id)
|
|
|
|
{
|
|
|
|
if (!(thread = get_thread_from_id( req->id ))) return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (thread && !(recv_queue = thread->queue))
|
|
|
|
{
|
|
|
|
set_error( STATUS_INVALID_PARAMETER );
|
|
|
|
release_object( thread );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((msg = mem_alloc( sizeof(*msg) )))
|
|
|
|
{
|
|
|
|
msg->type = MSG_HARDWARE;
|
|
|
|
msg->win = get_user_full_handle( req->win );
|
|
|
|
msg->msg = req->msg;
|
|
|
|
msg->wparam = req->wparam;
|
|
|
|
msg->lparam = req->lparam;
|
|
|
|
msg->time = req->time;
|
|
|
|
msg->x = req->x;
|
|
|
|
msg->y = req->y;
|
|
|
|
msg->info = req->info;
|
|
|
|
msg->result = NULL;
|
|
|
|
msg->data = NULL;
|
|
|
|
msg->data_size = 0;
|
|
|
|
queue_hardware_message( recv_queue, msg );
|
|
|
|
}
|
2003-01-08 00:27:58 +00:00
|
|
|
if (thread) release_object( thread );
|
2001-06-19 19:16:41 +00:00
|
|
|
}
|
|
|
|
|
2006-01-17 12:14:31 +00:00
|
|
|
/* post a quit message to the current queue */
|
|
|
|
DECL_HANDLER(post_quit_message)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
if (!queue)
|
|
|
|
return;
|
|
|
|
|
|
|
|
queue->quit_message = 1;
|
|
|
|
queue->exit_code = req->exit_code;
|
|
|
|
set_queue_bits( queue, QS_POSTMESSAGE|QS_ALLPOSTMESSAGE );
|
|
|
|
}
|
2001-06-19 19:16:41 +00:00
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* get a message from the current queue */
|
|
|
|
DECL_HANDLER(get_message)
|
|
|
|
{
|
|
|
|
struct timer *timer;
|
2005-02-25 21:05:11 +00:00
|
|
|
struct list *ptr;
|
2001-05-18 22:51:56 +00:00
|
|
|
struct msg_queue *queue = get_current_queue();
|
2001-09-12 17:09:24 +00:00
|
|
|
user_handle_t get_win = get_user_full_handle( req->get_win );
|
2007-02-21 14:21:05 +00:00
|
|
|
unsigned int filter = req->flags >> 16;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2005-05-11 13:03:15 +00:00
|
|
|
reply->active_hooks = get_active_hooks();
|
|
|
|
|
2001-11-30 18:46:42 +00:00
|
|
|
if (!queue) return;
|
2006-08-10 14:42:09 +00:00
|
|
|
queue->last_get_msg = current_time;
|
2007-02-21 14:21:05 +00:00
|
|
|
if (!filter) filter = QS_ALLINPUT;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
|
|
|
/* first check for sent messages */
|
2005-02-25 21:05:11 +00:00
|
|
|
if ((ptr = list_head( &queue->msg_list[SEND_MESSAGE] )))
|
2001-06-19 19:16:41 +00:00
|
|
|
{
|
2005-02-25 21:05:11 +00:00
|
|
|
struct message *msg = LIST_ENTRY( ptr, struct message, entry );
|
2001-11-30 18:46:42 +00:00
|
|
|
receive_message( queue, msg, reply );
|
2001-05-18 22:51:56 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-06-28 04:37:22 +00:00
|
|
|
/* clear changed bits so we can wait on them if we don't find a message */
|
2007-02-21 14:21:05 +00:00
|
|
|
if (filter & QS_POSTMESSAGE)
|
|
|
|
{
|
|
|
|
queue->changed_bits &= ~(QS_POSTMESSAGE | QS_HOTKEY | QS_TIMER);
|
|
|
|
if (req->get_first == 0 && req->get_last == ~0U) queue->changed_bits &= ~QS_ALLPOSTMESSAGE;
|
|
|
|
}
|
|
|
|
if (filter & QS_INPUT) queue->changed_bits &= ~QS_INPUT;
|
|
|
|
if (filter & QS_PAINT) queue->changed_bits &= ~QS_PAINT;
|
2001-06-28 04:37:22 +00:00
|
|
|
|
2001-06-19 19:16:41 +00:00
|
|
|
/* then check for posted messages */
|
2007-02-21 14:21:05 +00:00
|
|
|
if ((filter & QS_POSTMESSAGE) &&
|
|
|
|
get_posted_message( queue, get_win, req->get_first, req->get_last, req->flags, reply ))
|
2001-06-19 19:16:41 +00:00
|
|
|
return;
|
|
|
|
|
2006-01-17 12:14:31 +00:00
|
|
|
/* only check for quit messages if not posted messages pending.
|
|
|
|
* note: the quit message isn't filtered */
|
|
|
|
if (get_quit_message( queue, req->flags, reply ))
|
|
|
|
return;
|
|
|
|
|
2001-06-19 19:16:41 +00:00
|
|
|
/* then check for any raw hardware message */
|
2007-02-21 14:21:05 +00:00
|
|
|
if ((filter & QS_INPUT) &&
|
|
|
|
filter_contains_hw_range( req->get_first, req->get_last ) &&
|
2005-04-20 13:03:59 +00:00
|
|
|
get_hardware_message( current, req->hw_id, get_win, req->get_first, req->get_last, reply ))
|
2001-06-19 19:16:41 +00:00
|
|
|
return;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
|
|
|
/* now check for WM_PAINT */
|
2007-02-21 14:21:05 +00:00
|
|
|
if ((filter & QS_PAINT) &&
|
|
|
|
queue->paint_count &&
|
2005-04-20 13:03:59 +00:00
|
|
|
check_msg_filter( WM_PAINT, req->get_first, req->get_last ) &&
|
2001-11-30 18:46:42 +00:00
|
|
|
(reply->win = find_window_to_repaint( get_win, current )))
|
|
|
|
{
|
|
|
|
reply->type = MSG_POSTED;
|
|
|
|
reply->msg = WM_PAINT;
|
|
|
|
reply->wparam = 0;
|
|
|
|
reply->lparam = 0;
|
|
|
|
reply->x = 0;
|
|
|
|
reply->y = 0;
|
|
|
|
reply->time = get_tick_count();
|
|
|
|
reply->info = 0;
|
2001-05-18 22:51:56 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* now check for timer */
|
2007-02-21 14:21:05 +00:00
|
|
|
if ((filter & QS_TIMER) &&
|
|
|
|
(timer = find_expired_timer( queue, get_win, req->get_first,
|
|
|
|
req->get_last, (req->flags & PM_REMOVE) )))
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->type = MSG_POSTED;
|
|
|
|
reply->win = timer->win;
|
|
|
|
reply->msg = timer->msg;
|
|
|
|
reply->wparam = timer->id;
|
|
|
|
reply->lparam = timer->lparam;
|
|
|
|
reply->x = 0;
|
|
|
|
reply->y = 0;
|
|
|
|
reply->time = get_tick_count();
|
|
|
|
reply->info = 0;
|
2001-05-18 22:51:56 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2007-08-29 16:13:13 +00:00
|
|
|
queue->wake_mask = req->wake_mask;
|
|
|
|
queue->changed_mask = req->changed_mask;
|
2001-05-18 22:51:56 +00:00
|
|
|
set_error( STATUS_PENDING ); /* FIXME */
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* reply to a sent message */
|
|
|
|
DECL_HANDLER(reply_message)
|
|
|
|
{
|
2005-03-23 10:33:17 +00:00
|
|
|
if (!current->queue) set_error( STATUS_ACCESS_DENIED );
|
2003-03-19 00:12:17 +00:00
|
|
|
else if (current->queue->recv_result)
|
|
|
|
reply_message( current->queue, req->result, 0, req->remove,
|
|
|
|
get_req_data(), get_req_data_size() );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2005-03-23 10:33:17 +00:00
|
|
|
/* accept the current hardware message */
|
|
|
|
DECL_HANDLER(accept_hardware_message)
|
|
|
|
{
|
|
|
|
if (current->queue)
|
2005-04-20 13:03:59 +00:00
|
|
|
release_hardware_message( current->queue, req->hw_id, req->remove, req->new_win );
|
|
|
|
else
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
2005-03-23 10:33:17 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2001-05-18 22:51:56 +00:00
|
|
|
/* retrieve the reply for the last message sent */
|
|
|
|
DECL_HANDLER(get_message_reply)
|
|
|
|
{
|
2003-07-26 20:36:43 +00:00
|
|
|
struct message_result *result;
|
|
|
|
struct list *entry;
|
2001-08-07 19:19:08 +00:00
|
|
|
struct msg_queue *queue = current->queue;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2001-08-07 19:19:08 +00:00
|
|
|
if (queue)
|
|
|
|
{
|
|
|
|
set_error( STATUS_PENDING );
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->result = 0;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2003-07-26 20:36:43 +00:00
|
|
|
if (!(entry = list_head( &queue->send_result ))) return; /* no reply ready */
|
|
|
|
|
|
|
|
result = LIST_ENTRY( entry, struct message_result, sender_entry );
|
|
|
|
if (result->replied || req->cancel)
|
2001-05-18 22:51:56 +00:00
|
|
|
{
|
2001-08-07 19:19:08 +00:00
|
|
|
if (result->replied)
|
|
|
|
{
|
2001-11-30 18:46:42 +00:00
|
|
|
reply->result = result->result;
|
2001-08-07 19:19:08 +00:00
|
|
|
set_error( result->error );
|
|
|
|
if (result->data)
|
|
|
|
{
|
2006-07-26 08:43:25 +00:00
|
|
|
data_size_t data_len = min( result->data_size, get_reply_max_size() );
|
2001-11-30 18:46:42 +00:00
|
|
|
set_reply_data_ptr( result->data, data_len );
|
2001-08-07 19:19:08 +00:00
|
|
|
result->data = NULL;
|
|
|
|
result->data_size = 0;
|
|
|
|
}
|
|
|
|
}
|
2003-07-26 20:36:43 +00:00
|
|
|
remove_result_from_sender( result );
|
|
|
|
|
|
|
|
entry = list_head( &queue->send_result );
|
|
|
|
if (!entry) clear_queue_bits( queue, QS_SMRESULT );
|
|
|
|
else
|
|
|
|
{
|
|
|
|
result = LIST_ENTRY( entry, struct message_result, sender_entry );
|
|
|
|
if (!result->replied) clear_queue_bits( queue, QS_SMRESULT );
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
}
|
2001-08-07 19:19:08 +00:00
|
|
|
else set_error( STATUS_ACCESS_DENIED );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* set a window timer */
|
|
|
|
DECL_HANDLER(set_win_timer)
|
|
|
|
{
|
|
|
|
struct timer *timer;
|
2004-11-29 18:08:18 +00:00
|
|
|
struct msg_queue *queue;
|
|
|
|
struct thread *thread = NULL;
|
|
|
|
user_handle_t win = 0;
|
2006-10-16 15:03:44 +00:00
|
|
|
unsigned long id = req->id;
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2004-11-29 18:08:18 +00:00
|
|
|
if (req->win)
|
|
|
|
{
|
|
|
|
if (!(win = get_user_full_handle( req->win )) || !(thread = get_window_thread( win )))
|
|
|
|
{
|
|
|
|
set_error( STATUS_INVALID_HANDLE );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (thread->process != current->process)
|
|
|
|
{
|
|
|
|
release_object( thread );
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
queue = thread->queue;
|
|
|
|
/* remove it if it existed already */
|
|
|
|
if ((timer = find_timer( queue, win, req->msg, id ))) free_timer( queue, timer );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
queue = get_current_queue();
|
2007-08-30 09:05:50 +00:00
|
|
|
/* look for a timer with this id */
|
|
|
|
if (id && (timer = find_timer( queue, NULL, req->msg, id )))
|
2004-11-29 18:08:18 +00:00
|
|
|
{
|
2007-08-30 09:05:50 +00:00
|
|
|
/* free and reuse id */
|
|
|
|
free_timer( queue, timer );
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
/* find a free id for it */
|
|
|
|
do
|
|
|
|
{
|
|
|
|
id = queue->next_timer_id;
|
|
|
|
if (++queue->next_timer_id >= 0x10000) queue->next_timer_id = 1;
|
|
|
|
}
|
|
|
|
while (find_timer( queue, 0, req->msg, id ));
|
2004-11-29 18:08:18 +00:00
|
|
|
}
|
|
|
|
}
|
2001-05-18 22:51:56 +00:00
|
|
|
|
|
|
|
if ((timer = set_timer( queue, req->rate )))
|
|
|
|
{
|
2001-09-12 17:09:24 +00:00
|
|
|
timer->win = win;
|
2001-05-18 22:51:56 +00:00
|
|
|
timer->msg = req->msg;
|
2004-11-29 18:08:18 +00:00
|
|
|
timer->id = id;
|
2001-05-18 22:51:56 +00:00
|
|
|
timer->lparam = req->lparam;
|
2004-11-29 18:08:18 +00:00
|
|
|
reply->id = id;
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
2004-11-29 18:08:18 +00:00
|
|
|
if (thread) release_object( thread );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* kill a window timer */
|
|
|
|
DECL_HANDLER(kill_win_timer)
|
|
|
|
{
|
2004-11-29 18:08:18 +00:00
|
|
|
struct timer *timer;
|
|
|
|
struct thread *thread;
|
|
|
|
user_handle_t win = 0;
|
|
|
|
|
|
|
|
if (req->win)
|
|
|
|
{
|
|
|
|
if (!(win = get_user_full_handle( req->win )) || !(thread = get_window_thread( win )))
|
|
|
|
{
|
|
|
|
set_error( STATUS_INVALID_HANDLE );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (thread->process != current->process)
|
|
|
|
{
|
|
|
|
release_object( thread );
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else thread = (struct thread *)grab_object( current );
|
2001-05-18 22:51:56 +00:00
|
|
|
|
2004-11-29 18:08:18 +00:00
|
|
|
if (thread->queue && (timer = find_timer( thread->queue, win, req->msg, req->id )))
|
|
|
|
free_timer( thread->queue, timer );
|
|
|
|
else
|
2001-05-18 22:51:56 +00:00
|
|
|
set_error( STATUS_INVALID_PARAMETER );
|
2004-11-29 18:08:18 +00:00
|
|
|
|
|
|
|
release_object( thread );
|
2001-05-18 22:51:56 +00:00
|
|
|
}
|
2002-10-11 18:50:15 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* attach (or detach) thread inputs */
|
|
|
|
DECL_HANDLER(attach_thread_input)
|
|
|
|
{
|
|
|
|
struct thread *thread_from = get_thread_from_id( req->tid_from );
|
|
|
|
struct thread *thread_to = get_thread_from_id( req->tid_to );
|
|
|
|
|
|
|
|
if (!thread_from || !thread_to)
|
|
|
|
{
|
|
|
|
if (thread_from) release_object( thread_from );
|
|
|
|
if (thread_to) release_object( thread_to );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (thread_from != thread_to)
|
|
|
|
{
|
|
|
|
if (req->attach) attach_thread_input( thread_from, thread_to );
|
2005-07-11 13:30:23 +00:00
|
|
|
else
|
|
|
|
{
|
|
|
|
if (thread_from->queue && thread_to->queue &&
|
|
|
|
thread_from->queue->input == thread_to->queue->input)
|
|
|
|
detach_thread_input( thread_from );
|
|
|
|
else
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
}
|
2002-10-11 18:50:15 +00:00
|
|
|
}
|
|
|
|
else set_error( STATUS_ACCESS_DENIED );
|
|
|
|
release_object( thread_from );
|
|
|
|
release_object( thread_to );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* get thread input data */
|
|
|
|
DECL_HANDLER(get_thread_input)
|
|
|
|
{
|
|
|
|
struct thread *thread = NULL;
|
|
|
|
struct thread_input *input;
|
|
|
|
|
|
|
|
if (req->tid)
|
|
|
|
{
|
|
|
|
if (!(thread = get_thread_from_id( req->tid ))) return;
|
|
|
|
input = thread->queue ? thread->queue->input : NULL;
|
|
|
|
}
|
|
|
|
else input = foreground_input; /* get the foreground thread info */
|
|
|
|
|
|
|
|
if (input)
|
|
|
|
{
|
|
|
|
reply->focus = input->focus;
|
|
|
|
reply->capture = input->capture;
|
|
|
|
reply->active = input->active;
|
|
|
|
reply->menu_owner = input->menu_owner;
|
|
|
|
reply->move_size = input->move_size;
|
|
|
|
reply->caret = input->caret;
|
2002-10-17 01:24:33 +00:00
|
|
|
reply->rect = input->caret_rect;
|
2002-10-11 18:50:15 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
reply->focus = 0;
|
|
|
|
reply->capture = 0;
|
|
|
|
reply->active = 0;
|
|
|
|
reply->menu_owner = 0;
|
|
|
|
reply->move_size = 0;
|
|
|
|
reply->caret = 0;
|
|
|
|
reply->rect.left = reply->rect.top = reply->rect.right = reply->rect.bottom = 0;
|
|
|
|
}
|
|
|
|
/* foreground window is active window of foreground thread */
|
|
|
|
reply->foreground = foreground_input ? foreground_input->active : 0;
|
|
|
|
if (thread) release_object( thread );
|
|
|
|
}
|
2002-10-11 23:41:06 +00:00
|
|
|
|
|
|
|
|
2003-01-08 19:56:31 +00:00
|
|
|
/* retrieve queue keyboard state for a given thread */
|
|
|
|
DECL_HANDLER(get_key_state)
|
|
|
|
{
|
|
|
|
struct thread *thread;
|
|
|
|
struct thread_input *input;
|
|
|
|
|
|
|
|
if (!(thread = get_thread_from_id( req->tid ))) return;
|
|
|
|
input = thread->queue ? thread->queue->input : NULL;
|
|
|
|
if (input)
|
|
|
|
{
|
|
|
|
if (req->key >= 0) reply->state = input->keystate[req->key & 0xff];
|
|
|
|
set_reply_data( input->keystate, min( get_reply_max_size(), sizeof(input->keystate) ));
|
|
|
|
}
|
|
|
|
release_object( thread );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* set queue keyboard state for a given thread */
|
|
|
|
DECL_HANDLER(set_key_state)
|
|
|
|
{
|
|
|
|
struct thread *thread = NULL;
|
|
|
|
struct thread_input *input;
|
|
|
|
|
|
|
|
if (!(thread = get_thread_from_id( req->tid ))) return;
|
|
|
|
input = thread->queue ? thread->queue->input : NULL;
|
|
|
|
if (input)
|
|
|
|
{
|
2006-07-26 08:43:25 +00:00
|
|
|
data_size_t size = min( sizeof(input->keystate), get_req_data_size() );
|
2003-01-08 19:56:31 +00:00
|
|
|
if (size) memcpy( input->keystate, get_req_data(), size );
|
|
|
|
}
|
|
|
|
release_object( thread );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2002-10-11 23:41:06 +00:00
|
|
|
/* set the system foreground window */
|
|
|
|
DECL_HANDLER(set_foreground_window)
|
|
|
|
{
|
2006-07-07 14:01:51 +00:00
|
|
|
struct thread *thread;
|
2002-10-11 23:41:06 +00:00
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
reply->previous = foreground_input ? foreground_input->active : 0;
|
|
|
|
reply->send_msg_old = (reply->previous && foreground_input != queue->input);
|
|
|
|
reply->send_msg_new = FALSE;
|
|
|
|
|
2006-07-07 14:01:51 +00:00
|
|
|
if (is_top_level_window( req->handle ) &&
|
|
|
|
((thread = get_window_thread( req->handle ))))
|
2002-10-11 23:41:06 +00:00
|
|
|
{
|
2006-07-07 14:01:51 +00:00
|
|
|
foreground_input = thread->queue->input;
|
|
|
|
reply->send_msg_new = (foreground_input != queue->input);
|
|
|
|
release_object( thread );
|
2002-10-11 23:41:06 +00:00
|
|
|
}
|
2006-07-07 14:01:51 +00:00
|
|
|
else set_win32_error( ERROR_INVALID_WINDOW_HANDLE );
|
2002-10-11 23:41:06 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* set the current thread focus window */
|
|
|
|
DECL_HANDLER(set_focus_window)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
reply->previous = 0;
|
|
|
|
if (queue && check_queue_input_window( queue, req->handle ))
|
|
|
|
{
|
|
|
|
reply->previous = queue->input->focus;
|
|
|
|
queue->input->focus = get_user_full_handle( req->handle );
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* set the current thread active window */
|
|
|
|
DECL_HANDLER(set_active_window)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
reply->previous = 0;
|
|
|
|
if (queue && check_queue_input_window( queue, req->handle ))
|
|
|
|
{
|
|
|
|
if (!req->handle || make_window_active( req->handle ))
|
|
|
|
{
|
|
|
|
reply->previous = queue->input->active;
|
|
|
|
queue->input->active = get_user_full_handle( req->handle );
|
|
|
|
}
|
|
|
|
else set_error( STATUS_INVALID_HANDLE );
|
|
|
|
}
|
|
|
|
}
|
2002-10-12 01:24:37 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* set the current thread capture window */
|
|
|
|
DECL_HANDLER(set_capture_window)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
reply->previous = reply->full_handle = 0;
|
|
|
|
if (queue && check_queue_input_window( queue, req->handle ))
|
|
|
|
{
|
|
|
|
struct thread_input *input = queue->input;
|
|
|
|
|
|
|
|
reply->previous = input->capture;
|
|
|
|
input->capture = get_user_full_handle( req->handle );
|
|
|
|
input->menu_owner = (req->flags & CAPTURE_MENU) ? input->capture : 0;
|
|
|
|
input->move_size = (req->flags & CAPTURE_MOVESIZE) ? input->capture : 0;
|
|
|
|
reply->full_handle = input->capture;
|
|
|
|
}
|
|
|
|
}
|
2002-10-17 01:24:33 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* Set the current thread caret window */
|
|
|
|
DECL_HANDLER(set_caret_window)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
|
|
|
|
reply->previous = 0;
|
|
|
|
if (queue && check_queue_input_window( queue, req->handle ))
|
|
|
|
{
|
|
|
|
struct thread_input *input = queue->input;
|
|
|
|
|
|
|
|
reply->previous = input->caret;
|
|
|
|
reply->old_rect = input->caret_rect;
|
|
|
|
reply->old_hide = input->caret_hide;
|
|
|
|
reply->old_state = input->caret_state;
|
|
|
|
|
|
|
|
set_caret_window( input, get_user_full_handle(req->handle) );
|
2005-02-18 20:02:55 +00:00
|
|
|
input->caret_rect.right = input->caret_rect.left + req->width;
|
|
|
|
input->caret_rect.bottom = input->caret_rect.top + req->height;
|
2002-10-17 01:24:33 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
/* Set the current thread caret information */
|
|
|
|
DECL_HANDLER(set_caret_info)
|
|
|
|
{
|
|
|
|
struct msg_queue *queue = get_current_queue();
|
|
|
|
struct thread_input *input;
|
|
|
|
|
|
|
|
if (!queue) return;
|
|
|
|
input = queue->input;
|
|
|
|
reply->full_handle = input->caret;
|
|
|
|
reply->old_rect = input->caret_rect;
|
|
|
|
reply->old_hide = input->caret_hide;
|
|
|
|
reply->old_state = input->caret_state;
|
|
|
|
|
|
|
|
if (req->handle && get_user_full_handle(req->handle) != input->caret)
|
|
|
|
{
|
|
|
|
set_error( STATUS_ACCESS_DENIED );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (req->flags & SET_CARET_POS)
|
|
|
|
{
|
|
|
|
input->caret_rect.right += req->x - input->caret_rect.left;
|
|
|
|
input->caret_rect.bottom += req->y - input->caret_rect.top;
|
|
|
|
input->caret_rect.left = req->x;
|
|
|
|
input->caret_rect.top = req->y;
|
|
|
|
}
|
|
|
|
if (req->flags & SET_CARET_HIDE)
|
|
|
|
{
|
|
|
|
input->caret_hide += req->hide;
|
|
|
|
if (input->caret_hide < 0) input->caret_hide = 0;
|
|
|
|
}
|
|
|
|
if (req->flags & SET_CARET_STATE)
|
|
|
|
{
|
|
|
|
if (req->state == -1) input->caret_state = !input->caret_state;
|
|
|
|
else input->caret_state = !!req->state;
|
|
|
|
}
|
|
|
|
}
|
2005-04-28 12:04:14 +00:00
|
|
|
|
|
|
|
|
|
|
|
/* get the time of the last input event */
|
|
|
|
DECL_HANDLER(get_last_input_time)
|
|
|
|
{
|
|
|
|
reply->time = last_input_time;
|
|
|
|
}
|