/* * * 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_conquer(lpi_data_t *data, lpi_module_t *mod UNUSED) { if (data->payload_len[0] == 5 && data->payload_len[1] == 4 && MATCH(data->payload[0], 'R', 'E', 'A', 'D')) return true; if (data->payload_len[1] == 5 && data->payload_len[0] == 4 && MATCH(data->payload[1], 'R', 'E', 'A', 'D')) return true; if (data->payload_len[0] == 4 && (MATCH(data->payload[0], '5', '0', ANY, ANY) || MATCH(data->payload[0], '5', '1', ANY, ANY)) && MATCH(data->payload[1], 'U', 'P', 'D', 'A')) return true; if (data->payload_len[1] == 4 && (MATCH(data->payload[1], '5', '0', ANY, ANY) || MATCH(data->payload[1], '5', '1', ANY, ANY)) && MATCH(data->payload[0], 'U', 'P', 'D', 'A')) return true; return false; } static lpi_module_t lpi_conquer = { LPI_PROTO_CONQUER, LPI_CATEGORY_GAMING, "ConquerOnline", 3, match_conquer }; void register_conquer(LPIModuleMap *mod_map) { register_protocol(&lpi_conquer, mod_map); }