84 lines
2.6 KiB
C++
84 lines
2.6 KiB
C++
|
/*
|
||
|
|
*
|
||
|
|
* 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 <http://www.gnu.org/licenses/>.
|
||
|
|
*
|
||
|
|
*
|
||
|
|
*/
|
||
|
|
|
||
|
|
#include <string.h>
|
||
|
|
|
||
|
|
#include "libprotoident.h"
|
||
|
|
#include "proto_manager.h"
|
||
|
|
#include "proto_common.h"
|
||
|
|
|
||
|
|
/* Doyo -- Chinese service for downloading free games (especially
|
||
|
|
* ones that you would otherwise have to buy!)
|
||
|
|
*/
|
||
|
|
|
||
|
|
static inline bool match_doyo_p2p(uint32_t payload, uint32_t len) {
|
||
|
|
/* Not the strongest of rules, but not much we can do */
|
||
|
|
if (len == 56 && MATCH(payload, 0x00, 0x00, 0x00, 0x00))
|
||
|
|
return true;
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
static inline bool match_doyo_nonzero(uint32_t payload, uint32_t len) {
|
||
|
|
if (len == 20 && MATCH(payload, ANY, 0x00, 0x00, 0x00) && payload != 0)
|
||
|
|
return true;
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
static inline bool match_doyo(lpi_data_t *data, lpi_module_t *mod UNUSED) {
|
||
|
|
|
||
|
|
if (match_doyo_p2p(data->payload[0], data->payload_len[0])) {
|
||
|
|
if (match_doyo_p2p(data->payload[1], data->payload_len[1]))
|
||
|
|
return true;
|
||
|
|
if (match_doyo_nonzero(data->payload[1], data->payload_len[1]))
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
if (match_doyo_p2p(data->payload[1], data->payload_len[1])) {
|
||
|
|
if (match_doyo_nonzero(data->payload[0], data->payload_len[0]))
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
if (match_doyo_nonzero(data->payload[0], data->payload_len[0])) {
|
||
|
|
if (match_doyo_nonzero(data->payload[1], data->payload_len[1]))
|
||
|
|
return true;
|
||
|
|
}
|
||
|
|
|
||
|
|
return false;
|
||
|
|
}
|
||
|
|
|
||
|
|
static lpi_module_t lpi_doyo = {
|
||
|
|
LPI_PROTO_UDP_DOYO,
|
||
|
|
LPI_CATEGORY_P2P,
|
||
|
|
"DoyoP2P",
|
||
|
|
200,
|
||
|
|
match_doyo
|
||
|
|
};
|
||
|
|
|
||
|
|
void register_doyo(LPIModuleMap *mod_map) {
|
||
|
|
register_protocol(&lpi_doyo, mod_map);
|
||
|
|
}
|
||
|
|
|