/*
*
* 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_wiz_23(uint32_t payload, uint32_t len) {
/* Bytes 3 and 4 are a length field */
if (len == 23 && MATCH(payload, 0x0d, 0xf0, 0x13, 0x00))
return true;
return false;
}
static inline bool match_wiz_13(uint32_t payload, uint32_t len) {
/* Bytes 3 and 4 are a length field */
if (len == 13 && MATCH(payload, 0x0d, 0xf0, 0x09, 0x00))
return true;
return false;
}
static inline bool match_wizard101(lpi_data_t *data, lpi_module_t *mod UNUSED) {
if (match_wiz_23(data->payload[0], data->payload_len[0])) {
if (match_wiz_13(data->payload[1], data->payload_len[1]))
return true;
}
if (match_wiz_23(data->payload[1], data->payload_len[1])) {
if (match_wiz_13(data->payload[0], data->payload_len[0]))
return true;
}
return false;
}
static lpi_module_t lpi_wizard101 = {
LPI_PROTO_WIZARD101,
LPI_CATEGORY_GAMING,
"Wizard101",
19,
match_wizard101
};
void register_wizard101(LPIModuleMap *mod_map) {
register_protocol(&lpi_wizard101, mod_map);
}