/* * * 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_amqp_header(uint32_t payload, uint32_t len) { if (len == 8 && MATCH(payload, 'A', 'M', 'Q', 'P')) { return true; } return false; } static inline bool match_amqp_start(uint32_t payload) { /* only seen length 498 so far, but surely this could vary more */ if (MATCH(payload, 0x01, 0x00, 0x00, 0x00)) { return true; } return false; } static inline bool match_rabbitmq(lpi_data_t *data, lpi_module_t *mod UNUSED) { if (data->server_port != 5672 && data->client_port != 5672) { return false; } if (match_amqp_header(data->payload[0], data->payload_len[0])) { if (match_amqp_start(data->payload[1])) { return true; } } if (match_amqp_header(data->payload[1], data->payload_len[1])) { if (match_amqp_start(data->payload[0])) { return true; } } return false; } static lpi_module_t lpi_rabbitmq = { LPI_PROTO_RABBITMQ, LPI_CATEGORY_MESSAGE_QUEUE, "RabbitMQ", 75, match_rabbitmq }; void register_rabbitmq(LPIModuleMap *mod_map) { register_protocol(&lpi_rabbitmq, mod_map); }