iridium/neko
2
2
Fork 0
mirror of https://github.com/m1k1o/neko.git synced 2024-07-24 14:40:50 +12:00
Code Issues Packages Projects Releases Wiki Activity

lint fix.

Browse Source
This commit is contained in:
m1k1o 2021-04-11 12:25:02 +02:00
parent c54e8327ac
commit b2effce0e7
2 changed files with 22 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

41
server/internal/xorg/xorg.c
View File

@ -6,26 +6,23 @@ static char *NAME = ":0.0";
static int REGISTERED = 0; static int REGISTERED = 0;
static int DIRTY = 0; static int DIRTY = 0;
struct linked_list typedef struct linked_list {
{
unsigned long number; unsigned long number;
KeyCode keycode; KeyCode keycode;
struct linked_list *next; struct linked_list *next;
}; } node;
typedef struct linked_list node;
node *head = NULL, *last = NULL; node *head = NULL, *last = NULL;
void insertAtLast(unsigned long value, KeyCode keycode) { void insertAtLast(unsigned long value, KeyCode keycode) {
node *temp_node; node *temp_node = (node *) malloc(sizeof(node));
temp_node = (node *) malloc(sizeof(node));
temp_node->number = value; temp_node->number = value;
temp_node->keycode = keycode; temp_node->keycode = keycode;
temp_node->next = NULL; temp_node->next = NULL;
//For the 1st element // For the 1st element
if(!head) { if (!head) {
head = temp_node; head = temp_node;
last = temp_node; last = temp_node;
} else { } else {
@ -37,9 +34,9 @@ void insertAtLast(unsigned long value, KeyCode keycode) {
void deleteItem(unsigned long value) { void deleteItem(unsigned long value) {
node *myNode = head, *previous = NULL; node *myNode = head, *previous = NULL;
while(myNode) { while (myNode) {
if(myNode->number == value) { if (myNode->number == value) {
if(!previous) if (!previous)
head = myNode->next; head = myNode->next;
else else
previous->next = myNode->next; previous->next = myNode->next;
@ -55,19 +52,14 @@ void deleteItem(unsigned long value) {
node *searchItemNode(unsigned long value) { node *searchItemNode(unsigned long value) {
node *searchNode = head; node *searchNode = head;
bool foundNode = false;
while(searchNode) { while (searchNode) {
if(searchNode->number == value) { if (searchNode->number == value) {
foundNode = true; return searchNode;
break; }
} else {
searchNode = searchNode->next; searchNode = searchNode->next;
} }
}
if (foundNode)
return searchNode;
return NULL; return NULL;
} }
@ -220,15 +212,16 @@ void XKey(unsigned long key, int down) {
code = (max-min+1)*numcodes; code = (max-min+1)*numcodes;
KeySym keysym_list[numcodes]; KeySym keysym_list[numcodes];
for(int i=0;i<numcodes;i++) keysym_list[i] = key; for (int i=0;i<numcodes;i++) keysym_list[i] = key;
XChangeKeyboardMapping(display, code, numcodes, keysym_list, 1); XChangeKeyboardMapping(display, code, numcodes, keysym_list, 1);
} }
if (!code) if (!code)
return; return;
if (down) { if (down)
insertAtLast(key, code); insertAtLast(key, code);
}
XTestFakeKeyEvent(display, code, down, CurrentTime); XTestFakeKeyEvent(display, code, down, CurrentTime);
XSync(display, 0); XSync(display, 0);
} }

1
server/internal/xorg/xorg.go
View File

@ -105,7 +105,6 @@ func KeyUp(code uint64) error {
delete(debounce_key, code) delete(debounce_key, code)
C.XKey(C.ulong(code), C.int(0)) C.XKey(C.ulong(code), C.int(0))
return nil return nil
} }