/* * * Copyright (c) 2011-2016 The University of Waikato, Hamilton, New Zealand. * All rights reserved. * * This file is part of libprotoident. * * This code has been developed by the University of Waikato WAND * research group. For further information please see http://www.wand.net.nz/ * * libprotoident 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 3 of the License, or * (at your option) any later version. * * libprotoident 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 program. If not, see . * * */ #include #include "libprotoident.h" #include "proto_manager.h" #include "proto_common.h" static inline bool match_jx3_2c(uint32_t payload, uint32_t len) { if (len == 44 && MATCH(payload, 0x2c, 0x00, 0x20, 0x00)) return true; return false; } static inline bool match_jx3_varying(uint32_t payload, uint32_t len) { /* There appear to be lots of valid patterns here, but I'm * just going to focus on the major ones for now */ if (len == 28 && MATCH(payload, 0x1c, 0x00, ANY, ANY)) return true; return false; } static inline bool match_jx3online(lpi_data_t *data, lpi_module_t *mod UNUSED) { if (match_jx3_2c(data->payload[0], data->payload_len[0])) { if (match_jx3_varying(data->payload[1], data->payload_len[1])) return true; } if (match_jx3_2c(data->payload[1], data->payload_len[1])) { if (match_jx3_varying(data->payload[0], data->payload_len[0])) return true; } return false; } static lpi_module_t lpi_jx3online = { LPI_PROTO_JX3ONLINE, LPI_CATEGORY_GAMING, "JX3Online", 201, match_jx3online }; void register_jx3online(LPIModuleMap *mod_map) { register_protocol(&lpi_jx3online, mod_map); }