Initial implementation of XAP protocol.
This commit is contained in:
parent
f4c447f2df
commit
eba91c6e28
34 changed files with 1934 additions and 4 deletions
|
|
@ -184,6 +184,10 @@ extern layer_state_t layer_state;
|
|||
# include "dynamic_keymap.h"
|
||||
#endif
|
||||
|
||||
#ifdef XAP_ENABLE
|
||||
# include "xap.h"
|
||||
#endif
|
||||
|
||||
#ifdef VIA_ENABLE
|
||||
# include "via.h"
|
||||
#endif
|
||||
|
|
|
|||
116
quantum/xap/xap.c
Normal file
116
quantum/xap/xap.c
Normal file
|
|
@ -0,0 +1,116 @@
|
|||
/* Copyright 2021 Nick Brassel (@tzarc)
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program 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 General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <quantum.h>
|
||||
#include <xap.h>
|
||||
#include <usb_descriptor.h>
|
||||
|
||||
#define QSTR2(z) #z
|
||||
#define QSTR(z) QSTR2(z)
|
||||
|
||||
typedef enum xap_route_type_t {
|
||||
XAP_UNUSED = 0, // "Unused" needs to be zero -- undefined routes (through preprocessor) will be skipped
|
||||
XAP_ROUTE,
|
||||
XAP_EXECUTE,
|
||||
XAP_VALUE,
|
||||
XAP_GETTER,
|
||||
XAP_CONST_MEM,
|
||||
TOTAL_XAP_ROUTE_TYPES
|
||||
} xap_route_type_t;
|
||||
|
||||
#define XAP_ROUTE_TYPE_BIT_COUNT 3
|
||||
|
||||
typedef struct __attribute__((packed)) xap_route_flags_t {
|
||||
xap_route_type_t type : XAP_ROUTE_TYPE_BIT_COUNT;
|
||||
uint8_t is_secure : 1;
|
||||
} xap_route_flags_t;
|
||||
|
||||
_Static_assert(TOTAL_XAP_ROUTE_TYPES <= (1 << (XAP_ROUTE_TYPE_BIT_COUNT)), "Number of XAP route types is too large for XAP_ROUTE_TYPE_BITS.");
|
||||
_Static_assert(sizeof(xap_route_flags_t) == 1, "xap_route_flags_t is not length of 1");
|
||||
|
||||
typedef struct xap_route_t xap_route_t;
|
||||
struct __attribute__((packed)) xap_route_t {
|
||||
const xap_route_flags_t flags;
|
||||
union {
|
||||
// XAP_ROUTE
|
||||
struct {
|
||||
const xap_route_t *child_routes;
|
||||
const uint8_t child_routes_len;
|
||||
};
|
||||
|
||||
// XAP_EXECUTE
|
||||
bool (*handler)(xap_token_t token, const uint8_t *data, size_t data_len);
|
||||
|
||||
// XAP_VALUE
|
||||
uint32_t u32value;
|
||||
|
||||
// XAP_GETTER
|
||||
uint32_t (*u32getter)(void);
|
||||
|
||||
// XAP_CONST_MEM
|
||||
struct {
|
||||
const void * const_data;
|
||||
const uint8_t const_data_len;
|
||||
};
|
||||
};
|
||||
};
|
||||
|
||||
#include <xap_generated.inl>
|
||||
|
||||
void xap_execute_route(xap_token_t token, const xap_route_t *routes, size_t max_routes, const uint8_t *data, size_t data_len) {
|
||||
if (data_len == 0) return;
|
||||
xap_identifier_t id = data[0];
|
||||
|
||||
if (id < max_routes) {
|
||||
xap_route_t route;
|
||||
memcpy_P(&route, &routes[id], sizeof(xap_route_t));
|
||||
switch (route.flags.type) {
|
||||
case XAP_ROUTE:
|
||||
if (route.child_routes != NULL && route.child_routes_len > 0 && data_len > 0) {
|
||||
xap_execute_route(token, route.child_routes, route.child_routes_len, &data[1], data_len - 1);
|
||||
return;
|
||||
}
|
||||
break;
|
||||
|
||||
case XAP_EXECUTE:
|
||||
if (route.handler != NULL) {
|
||||
bool ok = (route.handler)(token, data_len == 1 ? NULL : &data[1], data_len - 1);
|
||||
if (ok) return;
|
||||
}
|
||||
break;
|
||||
|
||||
case XAP_VALUE:
|
||||
xap_respond_u32(token, route.u32value);
|
||||
return;
|
||||
|
||||
case XAP_GETTER:
|
||||
xap_respond_u32(token, (route.u32getter)());
|
||||
return;
|
||||
|
||||
case XAP_CONST_MEM:
|
||||
xap_respond_data_P(token, route.const_data, route.const_data_len);
|
||||
return;
|
||||
|
||||
default:
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
// Nothing got handled, so we respond with failure.
|
||||
xap_respond_failure(token, XAP_RESPONSE_FLAG_FAILED);
|
||||
}
|
||||
|
||||
void xap_receive(xap_token_t token, const uint8_t *data, size_t length) { xap_execute_route(token, xap_route_table, sizeof(xap_route_table) / sizeof(xap_route_t), data, length); }
|
||||
44
quantum/xap/xap.h
Normal file
44
quantum/xap/xap.h
Normal file
|
|
@ -0,0 +1,44 @@
|
|||
/* Copyright 2021 Nick Brassel (@tzarc)
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program 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 General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#pragma once
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
|
||||
typedef uint8_t xap_identifier_t;
|
||||
typedef uint8_t xap_response_flags_t;
|
||||
typedef uint16_t xap_token_t;
|
||||
|
||||
#ifndef XAP_SUBSYSTEM_VERSION_KB
|
||||
# define XAP_SUBSYSTEM_VERSION_KB 0
|
||||
#endif
|
||||
|
||||
#ifndef XAP_SUBSYSTEM_VERSION_USER
|
||||
# define XAP_SUBSYSTEM_VERSION_USER 0
|
||||
#endif
|
||||
|
||||
#define XAP_RESPONSE_FLAG_FAILED 0
|
||||
#define XAP_RESPONSE_FLAG_SUCCESS (1 << 0)
|
||||
|
||||
void xap_respond_failure(xap_token_t token, xap_response_flags_t response_flags);
|
||||
bool xap_respond_u32(xap_token_t token, uint32_t value);
|
||||
bool xap_respond_data(xap_token_t token, const void *data, size_t length);
|
||||
bool xap_respond_data_P(xap_token_t token, const void *data, size_t length);
|
||||
|
||||
void xap_send(xap_token_t token, xap_response_flags_t response_flags, const void *data, size_t length);
|
||||
|
||||
#include <xap_generated.h>
|
||||
39
quantum/xap/xap_handlers.c
Normal file
39
quantum/xap/xap_handlers.c
Normal file
|
|
@ -0,0 +1,39 @@
|
|||
/* Copyright 2021 Nick Brassel (@tzarc)
|
||||
*
|
||||
* This program is free software: you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation, either version 2 of the License, or
|
||||
* (at your option) any later version.
|
||||
*
|
||||
* This program 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 General Public License for more details.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <quantum.h>
|
||||
#include <xap.h>
|
||||
#include <info_json_gz.h>
|
||||
|
||||
void xap_respond_failure(xap_token_t token, xap_response_flags_t response_flags) { xap_send(token, response_flags, NULL, 0); }
|
||||
|
||||
bool xap_respond_data(xap_token_t token, const void *data, size_t length) {
|
||||
xap_send(token, XAP_RESPONSE_FLAG_SUCCESS, data, length);
|
||||
return true;
|
||||
}
|
||||
|
||||
bool xap_respond_data_P(xap_token_t token, const void *data, size_t length) {
|
||||
uint8_t blob[length];
|
||||
memcpy_P(blob, data, length);
|
||||
return xap_respond_data(token, blob, length);
|
||||
}
|
||||
|
||||
bool xap_respond_u32(xap_token_t token, uint32_t value) {
|
||||
xap_send(token, XAP_RESPONSE_FLAG_SUCCESS, &value, sizeof(value));
|
||||
return true;
|
||||
}
|
||||
|
||||
uint32_t xap_route_qmk_ffffffffffffffff_getter(void) { return 0x12345678; }
|
||||
Loading…
Add table
Add a link
Reference in a new issue