280 lines
7.9 KiB
C++
280 lines
7.9 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"
|
|
|
|
/* Separate modules for dictionary-style DHT (which has a much stronger rule)
|
|
* and Vuze DHTs (which are not so strong)
|
|
*
|
|
* This source file also covers the uTP protocol, which typically shares the
|
|
* same flow as the dictionary DHTs
|
|
*/
|
|
|
|
static inline bool match_utp_query(uint32_t payload, uint32_t len) {
|
|
|
|
if (MATCH(payload, 0x01, 0x00, ANY, ANY))
|
|
return true;
|
|
if (MATCH(payload, 0x11, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x21, 0x02, ANY, ANY) && len == 30)
|
|
return true;
|
|
if (MATCH(payload, 0x21, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x31, 0x02, ANY, ANY) && len == 30)
|
|
return true;
|
|
if (MATCH(payload, 0x31, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x41, 0x02, ANY, ANY) && len == 30)
|
|
return true;
|
|
if (MATCH(payload, 0x41, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool match_utp_reply(uint32_t payload, uint32_t len) {
|
|
|
|
if (len == 0)
|
|
return true;
|
|
if (MATCH(payload, 0x11, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x21, 0x02, ANY, ANY) && (len == 30 || len == 33))
|
|
return true;
|
|
if (MATCH(payload, 0x21, 0x01, ANY, ANY) && (len == 26 || len == 23))
|
|
return true;
|
|
if (MATCH(payload, 0x21, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x31, 0x02, ANY, ANY) && len == 30)
|
|
return true;
|
|
if (MATCH(payload, 0x31, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x41, 0x00, ANY, ANY) && len == 20)
|
|
return true;
|
|
if (MATCH(payload, 0x41, 0x02, ANY, ANY) && (len == 33 || len == 30))
|
|
return true;
|
|
|
|
return false;
|
|
}
|
|
|
|
static inline bool match_opentracker_98(uint32_t payload, uint32_t len) {
|
|
if (len == 98 || len == 109)
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
static inline bool match_opentracker_X6(uint32_t payload, uint32_t len) {
|
|
if (len >= 36 && (len % 10) == 6)
|
|
return true;
|
|
return false;
|
|
}
|
|
|
|
static inline bool match_opentracker_01(uint32_t payload, uint32_t len) {
|
|
|
|
if (MATCH(payload, 0x00, 0x00, 0x00, 0x01))
|
|
return true;
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool match_opentracker_02(uint32_t payload, uint32_t len) {
|
|
|
|
if (MATCH(payload, 0x00, 0x00, 0x00, 0x02))
|
|
return true;
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool match_dict_query(uint32_t payload, uint32_t len) {
|
|
|
|
if (MATCH(payload, 'd', '1', ':', 'a'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ':', 'r'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ':', 'e'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ':', 'q'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ':', 't'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ANY, ':'))
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool match_dict_reply(uint32_t payload, uint32_t len) {
|
|
|
|
if (len == 0)
|
|
return true;
|
|
|
|
if (MATCH(payload, 'd', '1', ':', 'a'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ':', 'r'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ':', 'e'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '1', ANY, ':'))
|
|
return true;
|
|
if (MATCH(payload, 'd', '2', ':', 'i'))
|
|
return true;
|
|
|
|
/* These are a bit iffy, but this seems to be what happens in
|
|
* response to a lot of dict queries :/ */
|
|
if (len == 23)
|
|
return true;
|
|
if (len == 33)
|
|
return true;
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool num_seq_match(uint32_t query, uint32_t resp) {
|
|
|
|
uint32_t query_seq = (ntohl(query)) & 0x0000ffff;
|
|
uint32_t resp_seq = (ntohl(resp)) & 0x0000ffff;
|
|
|
|
if (query_seq == resp_seq)
|
|
return true;
|
|
|
|
/* Allowed to be seq +/- 1 as well, apparently */
|
|
if (query_seq == resp_seq + 1)
|
|
return true;
|
|
if (query_seq == resp_seq - 1)
|
|
return true;
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool match_bt_search(uint32_t payload, uint32_t len) {
|
|
|
|
/* Matches the BT-SEARCH command, which we've seen while messing with
|
|
* World of Warcraft */
|
|
if (MATCHSTR(payload, "BT-S"))
|
|
return true;
|
|
return false;
|
|
|
|
}
|
|
|
|
static inline bool match_dht_dict(lpi_data_t *data, lpi_module_t *mod UNUSED) {
|
|
|
|
if (match_dict_query(data->payload[0], data->payload_len[0])) {
|
|
if (match_dict_reply(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
if (match_utp_reply(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
if (match_utp_query(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
}
|
|
|
|
if (match_dict_query(data->payload[1], data->payload_len[1])) {
|
|
if (match_dict_reply(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
if (match_utp_reply(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
if (match_utp_query(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
}
|
|
|
|
if (match_utp_query(data->payload[0], data->payload_len[0])) {
|
|
|
|
if (MATCH(data->payload[0], 0x01, 0x00, ANY, ANY)) {
|
|
if (!num_seq_match(data->payload[0], data->payload[1]))
|
|
return false;
|
|
|
|
}
|
|
|
|
if (match_utp_reply(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
if (match_dict_reply(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
}
|
|
|
|
if (match_utp_query(data->payload[1], data->payload_len[1])) {
|
|
if (MATCH(data->payload[1], 0x01, 0x00, ANY, ANY)) {
|
|
if (!num_seq_match(data->payload[1], data->payload[0]))
|
|
return false;
|
|
}
|
|
if (match_utp_reply(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
if (match_dict_reply(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
}
|
|
|
|
if (match_bt_search(data->payload[0], data->payload_len[0])) {
|
|
if (data->payload_len[1] == 0)
|
|
return true;
|
|
}
|
|
if (match_bt_search(data->payload[1], data->payload_len[1])) {
|
|
if (data->payload_len[0] == 0)
|
|
return true;
|
|
}
|
|
|
|
|
|
if (match_opentracker_X6(data->payload[0], data->payload_len[0])) {
|
|
if (match_opentracker_02(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
}
|
|
|
|
if (match_opentracker_X6(data->payload[1], data->payload_len[1])) {
|
|
if (match_opentracker_02(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
}
|
|
|
|
if (match_opentracker_98(data->payload[0], data->payload_len[0])) {
|
|
if (match_opentracker_01(data->payload[1], data->payload_len[1]))
|
|
return true;
|
|
}
|
|
|
|
if (match_opentracker_98(data->payload[1], data->payload_len[1])) {
|
|
if (match_opentracker_01(data->payload[0], data->payload_len[0]))
|
|
return true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
|
|
static lpi_module_t lpi_dht_dict = {
|
|
LPI_PROTO_UDP_BTDHT,
|
|
LPI_CATEGORY_P2P,
|
|
"BitTorrent_UDP",
|
|
6,
|
|
match_dht_dict
|
|
};
|
|
|
|
void register_dht_dict(LPIModuleMap *mod_map) {
|
|
register_protocol(&lpi_dht_dict, mod_map);
|
|
}
|
|
|