Linux下使用游戏手柄

大多数情况下，Linux系统都带有手柄驱动模块joydev，当我们插上设备的时候可以通过以下指令查看是否检测到该设备

ls /dev/    或者    ls /dev/input/

如果有出现 js0 的设备，则证明设备能正常使用

如果没有 js0 设备，可以通过以下指令安装驱动

sudo modprobe joydev

如果提示没有找到该模块则是内核中没有添加该驱动，需手动加载驱动进内核。

正常使用手柄后我们可以使用 joystick 软件来进行测试，使用以下指令进行安装

sudo apt-get install joystick

安装完后，启动软件进行测试

jstest /dev/js0    或者    jstest /dev/input/js0

以上是使用软件进行游戏手柄的测试，在更多时候我们是需要其输出相关信息，下面介绍使用程序将游戏手柄的数据输出：

因为Linux中的list.h不能直接用，所以我们把它单独提出来，建立一个listop.c文件和listop.h文件

/*listop.c*/
#include "listop.h"   
  
  
static  void __check_head(struct list_head* head)  
{  
    if ((head->next == 0) && (head->prev == 0)) {  
        INIT_LIST_HEAD(head);  
    }  
}  
  
/* 
 * Insert a new entry between two known consecutive entries. 
 * 
 * This is only for internal list manipulation where we know 
 * the prev/next entries already! 
 */  
static  void __list_add(struct list_head* new,  
                        struct list_head* prev,  
                        struct list_head* next)  
{  
  
    next->prev = new;  
    new->next = next;  
    new->prev = prev;  
    prev->next = new;  
  
}  
  
  
/* 
 * Delete a list entry by making the prev/next entries 
 * point to each other. 
 * 
 * This is only for internal list manipulation where we know 
 * the prev/next entries already! 
 */  
static  void __list_del(struct list_head* prev,  
                        struct list_head* next)  
{  
  
    next->prev = prev;  
    prev->next = next;  
}  
  
  
  
/** 
 * list_add - add a new entry 
 * @new: new entry to be added 
 * @head: list head to add it after 
 * 
 * Insert a new entry after the specified head. 
 * This is good for implementing stacks. 
 */  
void list_add(struct list_head* new, struct list_head* head)  
{  
    __check_head(head);  
    __list_add(new, head, head->next);  
}  
  
/** 
 * list_add_tail - add a new entry 
 * @new: new entry to be added 
 * @head: list head to add it before 
 * 
 * Insert a new entry before the specified head. 
 * This is useful for implementing queues. 
 */  
void list_add_tail(struct list_head* new, struct list_head* head)  
{  
    __check_head(head);  
    __list_add(new, head->prev, head);  
}  
  
  
/** 
 * list_del - deletes entry from list. 
 * @entry: the element to delete from the list. 
 * Note: list_empty on entry does not return true after this, the entry is in an undefined state. 
 */  
void list_del(struct list_head* entry)  
{  
    __list_del(entry->prev, entry->next);  
}  
  
/** 
 * list_del_init - deletes entry from list and reinitialize it. 
 * @entry: the element to delete from the list. 
 */  
void list_del_init(struct list_head* entry)  
{  
    __list_del(entry->prev, entry->next);  
    INIT_LIST_HEAD(entry);  
}  
  
/** 
 * list_move - delete from one list and add as another's head 
 * @list: the entry to move 
 * @head: the head that will precede our entry 
 */  
void list_move(struct list_head* list, struct list_head* head)  
{  
    __check_head(head);  
    __list_del(list->prev, list->next);  
    list_add(list, head);  
}  
  
/** 
 * list_move_tail - delete from one list and add as another's tail 
 * @list: the entry to move 
 * @head: the head that will follow our entry 
 */  
void list_move_tail(struct list_head* list,  
                    struct list_head* head)  
{  
    __check_head(head);  
    __lis