/* * The input core * * Copyright (c) 1999-2002 Vojtech Pavlik */ /* * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 as published by * the Free Software Foundation. */ #include <linux/init.h>#include <linux/sched.h>#include <linux/smp_lock.h>#include <linux/input.h>#include <linux/module.h>#include <linux/random.h>#include <linux/major.h>#include <linux/proc_fs.h>#include <linux/interrupt.h>#include <linux/poll.h>#include <linux/device.h> MODULE_AUTHOR("Vojtech Pavlik <vojtech@suse.cz>");MODULE_DESCRIPTION("Input core");MODULE_LICENSE("GPL"); EXPORT_SYMBOL(input_allocate_device);EXPORT_SYMBOL(input_register_device);EXPORT_SYMBOL(input_unregister_device);EXPORT_SYMBOL(input_register_handler);EXPORT_SYMBOL(input_unregister_handler);EXPORT_SYMBOL(input_grab_device);EXPORT_SYMBOL(input_release_device);EXPORT_SYMBOL(input_open_device);EXPORT_SYMBOL(input_close_device);EXPORT_SYMBOL(input_accept_process);EXPORT_SYMBOL(input_flush_device);EXPORT_SYMBOL(input_event);EXPORT_SYMBOL_GPL(input_class); #define INPUT_DEVICES	256 static LIST_HEAD(input_dev_list);static LIST_HEAD(input_handler_list); static struct input_handler *input_table[8]; void input_event(struct input_dev *dev, unsigned int type, unsigned int code, int value){	struct input_handle *handle; 	if (type > EV_MAX || !test_bit(type, dev->evbit))		return; 	add_input_randomness(type, code, value); 	switch (type) { 		case EV_SYN:			switch (code) {				case SYN_CONFIG:					if (dev->event) dev->event(dev, type, code, value);					break; 				case SYN_REPORT:					if (dev->sync) return;					dev->sync = 1;					break;			}			break; 		case EV_KEY: 			if (code > KEY_MAX || !test_bit(code, dev->keybit) || !!test_bit(code, dev->key) == value)				return; 			if (value == 2)				break; 			change_bit(code, dev->key); 			if (test_bit(EV_REP, dev->evbit) && dev->rep[REP_PERIOD] && dev->rep[REP_DELAY] && dev->timer.data && value) {				dev->repeat_key = code;				mod_timer(&dev->timer, jiffies + msecs_to_jiffies(dev->rep[REP_DELAY]));			} 			break; 		case EV_SW: 			if (code > SW_MAX || !test_bit(code, dev->swbit) || !!test_bit(code, dev->sw) == value)				return; 			change_bit(code, dev->sw); 			break; 		case EV_ABS: 			if (code > ABS_MAX || !test_bit(code, dev->absbit))				return; 			if (dev->absfuzz[code]) {				if ((value > dev->abs[code] - (dev->absfuzz[code] >> 1)) &&				    (value < dev->abs[code] + (dev->absfuzz[code] >> 1)))					return; 				if ((value > dev->abs[code] - dev->absfuzz[code]) &&				    (value < dev->abs[code] + dev->absfuzz[code]))					value = (dev->abs[code] * 3 + value) >> 2; 				if ((value > dev->abs[code] - (dev->absfuzz[code] << 1)) &&				    (value < dev->abs[code] + (dev->absfuzz[code] << 1)))					value = (dev->abs[code] + value) >> 1;			} 			if (dev->abs[code] == value)				return; 			dev->abs[code] = value;			break; 		case EV_REL: 			if (code > REL_MAX || !test_bit(code, dev->relbit) || (value == 0))				return; 			break; 		case EV_MSC: 			if (code > MSC_MAX || !test_bit(code, dev->mscbit))				return; 			if (dev->event) dev->event(dev, type, code, value); 			break; 		case EV_LED: 			if (code > LED_MAX || !test_bit(code, dev->ledbit) || !!test_bit(code, dev->led) == value)				return; 			change_bit(code, dev->led);			if (dev->event) dev->event(dev, type, code, value); 			break; 		case EV_SND: 			if (code > SND_MAX || !test_bit(code, dev->sndbit))				return; 			if (dev->event) dev->event(dev, type, code, value); 			break; 		case EV_REP: 			if (code > REP_MAX || value < 0 || dev->rep[code] == value) return; 			dev->rep[code] = value;			if (dev->event) dev->event(dev, type, code, value); 			break; 		case EV_FF:			if (dev->event) dev->event(dev, type, code, value);			break;	} 	if (type != EV_SYN)		dev->sync = 0; 	if (dev->grab)		dev->grab->handler->event(dev->grab, type, code, value);	else		list_for_each_entry(handle, &dev->h_list, d_node)			if (handle->open)				handle->handler->event(handle, type, code, value);} static void input_repeat_key(unsigned long data){	struct input_dev *dev = (void *) data; 	if (!test_bit(dev->repeat_key, dev->key))		return; 	input_event(dev, EV_KEY, dev->repeat_key, 2);	input_sync(dev); 	if (dev->rep[REP_PERIOD])		mod_timer(&dev->timer, jiffies + msecs_to_jiffies(dev->rep[REP_PERIOD]));} int input_accept_process(struct input_handle *handle, struct file *file){	if (handle->dev->accept)		return handle->dev->accept(handle->dev, file); 	return 0;} int input_grab_device(struct input_handle *handle){	if (handle->dev->grab)		return -EBUSY; 	handle->dev->grab = handle;	return 0;} void input_release_device(struct input_handle *handle){	if (handle->dev->grab == handle)		handle->dev->grab = NULL;} int input_open_device(struct input_handle *handle){	struct input_dev *dev = handle->dev;	int err; 	err = down_interruptible(&dev->sem);	if (err)		return err; 	handle->open++; 	if (!dev->users++ && dev->open)		err = dev->open(dev); 	if (err)		handle->open--; 	up(&dev->sem); 	return err;} int input_flush_device(struct input_handle* handle, struct file* file){	if (handle->dev->flush)		return handle->dev->flush(handle->dev, file); 	return 0;} void input_close_device(struct input_handle *handle){	struct input_dev *dev = handle->dev; 	input_release_device(handle); 	down(&dev->sem); 	if (!--dev->users && dev->close)		dev->close(dev);	handle->open--; 	up(&dev->sem);} static void input_link_handle(struct input_handle *handle){	list_add_tail(&handle->d_node, &handle->dev->h_list);	list_add_tail(&handle->h_node, &handle->handler->h_list);} #define MATCH_BIT(bit, max) \		for (i = 0; i < NBITS(max); i++) \			if ((id->bit[i] & dev->bit[i]) != id->bit[i]) \				break; \		if (i != NBITS(max)) \			continue; static struct input_device_id *input_match_device(struct input_device_id *id, struct input_dev *dev){	int i; 	for (; id->flags || id->driver_info; id++) { 		if (id->flags & INPUT_DEVICE_ID_MATCH_BUS)			if (id->id.bustype != dev->id.bustype)				continue; 		if (id->flags & INPUT_DEVICE_ID_MATCH_VENDOR)			if (id->id.vendor != dev->id.vendor)				continue; 		if (id->flags & INPUT_DEVICE_ID_MATCH_PRODUCT)			if (id->id.product != dev->id.product)				continue; 		if (id->flags & INPUT_DEVICE_ID_MATCH_VERSION)			if (id->id.version != dev->id.version)				continue; 		MATCH_BIT(evbit,  EV_MAX);		MATCH_BIT(keybit, KEY_MAX);		MATCH_BIT(relbit, REL_MAX);		MATCH_BIT(absbit, ABS_MAX);		MATCH_BIT(mscbit, MSC_MAX);		MATCH_BIT(ledbit, LED_MAX);		MATCH_BIT(sndbit, SND_MAX);		MATCH_BIT(ffbit,  FF_MAX);		MATCH_BIT(swbit,  SW_MAX); 		return id;	} 	return NULL;} static int input_print_bitmap(char *buf, int buf_size, unsigned long *bitmap, int max){	int i;	int len = 0; 	for (i = NBITS(max) - 1; i > 0; i--)		if (bitmap[i])			break; 	for (; i >= 0; i--)		len += snprintf(buf + len, max(buf_size - len, 0),				"%lx%s", bitmap[i], i > 0 ? " " : "");	return len;} #ifdef CONFIG_PROC_FS static struct proc_dir_entry *proc_bus_input_dir;static DECLARE_WAIT_QUEUE_HEAD(input_devices_poll_wait);static int input_devices_state; static inline void input_wakeup_procfs_readers(void){	input_devices_state++;	wake_up(&input_devices_poll_wait);} static unsigned int input_devices_poll(struct file *file, poll_table *wait){	int state = input_devices_state;	poll_wait(file, &input_devices_poll_wait, wait);	if (state != input_devices_state)		return POLLIN | POLLRDNORM;	return 0;} #define SPRINTF_BIT(ev, bm)						\	do {								\		len += sprintf(buf + len, "B: %s=", #ev);		\		len += input_print_bitmap(buf + len, INT_MAX,		\					dev->bm##bit, ev##_MAX);	\		len += sprintf(buf + len, "\n");			\	} while (0) #define TEST_AND_SPRINTF_BIT(ev, bm)					\	do {								\		if (test_bit(EV_##ev, dev->evbit))			\			SPRINTF_BIT(ev, bm);				\	} while (0) static int input_devices_read(char *buf, char **start, off_t pos, int count, int *eof, void *data){	struct input_dev *dev;	struct input_handle *handle;	const char *path; 	off_t at = 0;	int len, cnt = 0; 	list_for_each_entry(dev, &input_dev_list, node) { 		path = kobject_get_path(&dev->cdev.kobj, GFP_KERNEL); 		len = sprintf(buf, "I: Bus=%04x Vendor=%04x Product=%04x Version=%04x\n",			dev->id.bustype, dev->id.vendor, dev->id.product, dev->id.version); 		len += sprintf(buf + len, "N: Name=\"%s\"\n", dev->name ? dev->name : "");		len += sprintf(buf + len, "P: Phys=%s\n", dev->phys ? dev->phys : "");		len += sprintf(buf + len, "S: Sysfs=%s\n", path ? path : "");		len += sprintf(buf + len, "H: Handlers="); 		list_for_each_entry(handle, &dev->h_list, d_node)			len += sprintf(buf + len, "%s ", handle->name); 		len += sprintf(buf + len, "\n"); 		SPRINTF_BIT(EV, ev);		TEST_AND_SPRINTF_BIT(KEY, key);		TEST_AND_SPRINTF_BIT(REL, rel);		TEST_AND_SPRINTF_BIT(ABS, abs);		TEST_AND_SPRINTF_BIT(MSC, msc);		TEST_AND_SPRINTF_BIT(LED, led);		TEST_AND_SPRINTF_BIT(SND, snd);		TEST_AND_SPRINTF_BIT(FF, ff);		TEST_AND_SPRINTF_BIT(SW, sw); 		len += sprintf(buf + len, "\n"); 		at += len; 		if (at >= pos) {			if (!*start) {				*start = buf + (pos - (at - len));				cnt = at - pos;			} else  cnt += len;			buf += len;			if (cnt >= count)				break;		} 		kfree(path);	} 	if (&dev->node == &input_dev_list)		*eof = 1; 	return (count > cnt) ? cnt : count;} static int input_handlers_read(char *buf, char **start, off_t pos, int count, int *eof, void *data){	struct input_handler *handler; 	off_t at = 0;	int len = 0, cnt = 0;	int i = 0; 	list_for_each_entry(handler, &input_handler_list, node) { 		if (handler->fops)			len = sprintf(buf, "N: Number=%d Name=%s Minor=%d\n",				i++, handler->name, handler->minor);		else			len = sprintf(buf, "N: Number=%d Name=%s\n",				i++, handler->name); 		at += len; 		if (at >= pos) {			if (!*start) {				*start = buf + (pos - (at - len));				cnt = at - pos;			} else  cnt += len;			buf += len;			if (cnt >= count)				break;		}	}	if (&handler->node == &input_handler_list)		*eof = 1; 	return (count > cnt) ? cnt : count;} static struct file_operations input_fileops; static int __init input_proc_init(void){	struct proc_dir_entry *entry; 	proc_bus_input_dir = proc_mkdir("input", proc_bus);	if (!proc_bus_input_dir)		return -ENOMEM; 	proc_bus_input_dir->owner = THIS_MODULE; 	entry = create_proc_read_entry("devices", 0, proc_bus_input_dir, input_devices_read, NULL);	if (!entry)		goto fail1; 	entry->owner = THIS_MODULE;	input_fileops = *entry->proc_fops;	input_fileops.poll = input_devices_poll;	entry->proc_fops = &input_fileops; 	entry = create_proc_read_entry("handlers", 0, proc_bus_input_dir, input_handlers_read, NULL);	if (!entry)		goto fail2; 	entry->owner = THIS_MODULE; 	return 0;  fail2:	remove_proc_entry("devices", proc_bus_input_dir); fail1: remove_proc_entry("input", proc_bus);	return -ENOMEM;} static void input_proc_exit(void){	remove_proc_entry("devices", proc_bus_input_dir);	remove_proc_entry("handlers", proc_bus_input_dir);	remove_proc_entry("input", proc_bus);

Lines 1–500 of 994. Load more