osmocom
/
wireshark
11
0
Fork 1
Code Issues Pull Requests Projects Releases Wiki Activity

transum: plugin code 

A plugin to calculate response, service and spread time values based on
the RTE model.

Bug: 12892
Change-Id: I47d7e5354fc269916851a318fef10b826897eaf8
Reviewed-on: https://code.wireshark.org/review/17750
Petri-Dish: Anders Broman <a.broman58@gmail.com>
Petri-Dish: Alexis La Goutte <alexis.lagoutte@gmail.com>
Petri-Dish: Michael Mann <mmann78@netscape.net>
Tested-by: Petri Dish Buildbot <buildbot-no-reply@wireshark.org>
Reviewed-by: Michael Mann <mmann78@netscape.net>
Reviewed-by: Anders Broman <a.broman58@gmail.com>
This commit is contained in:
Paul Offord 2016-10-03 09:09:18 +01:00 committed by Anders Broman
parent 58f601879a
commit fb0c288f99
12 changed files with 2524 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
plugins/transum/AUTHORS Normal file
View File

@ -0,0 +1,2 @@
Author :
Paul Offord <paul.offord@advance7.com>

340
plugins/transum/COPYING Normal file
View File

@ -0,0 +1,340 @@
GNU GENERAL PUBLIC LICENSE
Version 2, June 1991
Copyright (C) 1989, 1991 Free Software Foundation, Inc.
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The licenses for most software are designed to take away your
freedom to share and change it. By contrast, the GNU General Public
License is intended to guarantee your freedom to share and change free
software--to make sure the software is free for all its users. This
General Public License applies to most of the Free Software
Foundation's software and to any other program whose authors commit to
using it. (Some other Free Software Foundation software is covered by
the GNU Library General Public License instead.) You can apply it to
your programs, too.
When we speak of free software, we are referring to freedom, not
price. Our General Public Licenses are designed to make sure that you
have the freedom to distribute copies of free software (and charge for
this service if you wish), that you receive source code or can get it
if you want it, that you can change the software or use pieces of it
in new free programs; and that you know you can do these things.
To protect your rights, we need to make restrictions that forbid
anyone to deny you these rights or to ask you to surrender the rights.
These restrictions translate to certain responsibilities for you if you
distribute copies of the software, or if you modify it.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must give the recipients all the rights that
you have. You must make sure that they, too, receive or can get the
source code. And you must show them these terms so they know their
rights.
We protect your rights with two steps: (1) copyright the software, and
(2) offer you this license which gives you legal permission to copy,
distribute and/or modify the software.
Also, for each author's protection and ours, we want to make certain
that everyone understands that there is no warranty for this free
software. If the software is modified by someone else and passed on, we
want its recipients to know that what they have is not the original, so
that any problems introduced by others will not reflect on the original
authors' reputations.
Finally, any free program is threatened constantly by software
patents. We wish to avoid the danger that redistributors of a free
program will individually obtain patent licenses, in effect making the
program proprietary. To prevent this, we have made it clear that any
patent must be licensed for everyone's free use or not licensed at all.
The precise terms and conditions for copying, distribution and
modification follow.
GNU GENERAL PUBLIC LICENSE
TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
0. This License applies to any program or other work which contains
a notice placed by the copyright holder saying it may be distributed
under the terms of this General Public License. The "Program", below,
refers to any such program or work, and a "work based on the Program"
means either the Program or any derivative work under copyright law:
that is to say, a work containing the Program or a portion of it,
either verbatim or with modifications and/or translated into another
language. (Hereinafter, translation is included without limitation in
the term "modification".) Each licensee is addressed as "you".
Activities other than copying, distribution and modification are not
covered by this License; they are outside its scope. The act of
running the Program is not restricted, and the output from the Program
is covered only if its contents constitute a work based on the
Program (independent of having been made by running the Program).
Whether that is true depends on what the Program does.
1. You may copy and distribute verbatim copies of the Program's
source code as you receive it, in any medium, provided that you
conspicuously and appropriately publish on each copy an appropriate
copyright notice and disclaimer of warranty; keep intact all the
notices that refer to this License and to the absence of any warranty;
and give any other recipients of the Program a copy of this License
along with the Program.
You may charge a fee for the physical act of transferring a copy, and
you may at your option offer warranty protection in exchange for a fee.
2. You may modify your copy or copies of the Program or any portion
of it, thus forming a work based on the Program, and copy and
distribute such modifications or work under the terms of Section 1
above, provided that you also meet all of these conditions:
a) You must cause the modified files to carry prominent notices
stating that you changed the files and the date of any change.
b) You must cause any work that you distribute or publish, that in
whole or in part contains or is derived from the Program or any
part thereof, to be licensed as a whole at no charge to all third
parties under the terms of this License.
c) If the modified program normally reads commands interactively
when run, you must cause it, when started running for such
interactive use in the most ordinary way, to print or display an
announcement including an appropriate copyright notice and a
notice that there is no warranty (or else, saying that you provide
a warranty) and that users may redistribute the program under
these conditions, and telling the user how to view a copy of this
License. (Exception: if the Program itself is interactive but
does not normally print such an announcement, your work based on
the Program is not required to print an announcement.)
These requirements apply to the modified work as a whole. If
identifiable sections of that work are not derived from the Program,
and can be reasonably considered independent and separate works in
themselves, then this License, and its terms, do not apply to those
sections when you distribute them as separate works. But when you
distribute the same sections as part of a whole which is a work based
on the Program, the distribution of the whole must be on the terms of
this License, whose permissions for other licensees extend to the
entire whole, and thus to each and every part regardless of who wrote it.
Thus, it is not the intent of this section to claim rights or contest
your rights to work written entirely by you; rather, the intent is to
exercise the right to control the distribution of derivative or
collective works based on the Program.
In addition, mere aggregation of another work not based on the Program
with the Program (or with a work based on the Program) on a volume of
a storage or distribution medium does not bring the other work under
the scope of this License.
3. You may copy and distribute the Program (or a work based on it,
under Section 2) in object code or executable form under the terms of
Sections 1 and 2 above provided that you also do one of the following:
a) Accompany it with the complete corresponding machine-readable
source code, which must be distributed under the terms of Sections
1 and 2 above on a medium customarily used for software interchange; or,
b) Accompany it with a written offer, valid for at least three
years, to give any third party, for a charge no more than your
cost of physically performing source distribution, a complete
machine-readable copy of the corresponding source code, to be
distributed under the terms of Sections 1 and 2 above on a medium
customarily used for software interchange; or,
c) Accompany it with the information you received as to the offer
to distribute corresponding source code. (This alternative is
allowed only for noncommercial distribution and only if you
received the program in object code or executable form with such
an offer, in accord with Subsection b above.)
The source code for a work means the preferred form of the work for
making modifications to it. For an executable work, complete source
code means all the source code for all modules it contains, plus any
associated interface definition files, plus the scripts used to
control compilation and installation of the executable. However, as a
special exception, the source code distributed need not include
anything that is normally distributed (in either source or binary
form) with the major components (compiler, kernel, and so on) of the
operating system on which the executable runs, unless that component
itself accompanies the executable.
If distribution of executable or object code is made by offering
access to copy from a designated place, then offering equivalent
access to copy the source code from the same place counts as
distribution of the source code, even though third parties are not
compelled to copy the source along with the object code.
4. You may not copy, modify, sublicense, or distribute the Program
except as expressly provided under this License. Any attempt
otherwise to copy, modify, sublicense or distribute the Program is
void, and will automatically terminate your rights under this License.
However, parties who have received copies, or rights, from you under
this License will not have their licenses terminated so long as such
parties remain in full compliance.
5. You are not required to accept this License, since you have not
signed it. However, nothing else grants you permission to modify or
distribute the Program or its derivative works. These actions are
prohibited by law if you do not accept this License. Therefore, by
modifying or distributing the Program (or any work based on the
Program), you indicate your acceptance of this License to do so, and
all its terms and conditions for copying, distributing or modifying
the Program or works based on it.
6. Each time you redistribute the Program (or any work based on the
Program), the recipient automatically receives a license from the
original licensor to copy, distribute or modify the Program subject to
these terms and conditions. You may not impose any further
restrictions on the recipients' exercise of the rights granted herein.
You are not responsible for enforcing compliance by third parties to
this License.
7. If, as a consequence of a court judgment or allegation of patent
infringement or for any other reason (not limited to patent issues),
conditions are imposed on you (whether by court order, agreement or
otherwise) that contradict the conditions of this License, they do not
excuse you from the conditions of this License. If you cannot
distribute so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you
may not distribute the Program at all. For example, if a patent
license would not permit royalty-free redistribution of the Program by
all those who receive copies directly or indirectly through you, then
the only way you could satisfy both it and this License would be to
refrain entirely from distribution of the Program.
If any portion of this section is held invalid or unenforceable under
any particular circumstance, the balance of the section is intended to
apply and the section as a whole is intended to apply in other
circumstances.
It is not the purpose of this section to induce you to infringe any
patents or other property right claims or to contest validity of any
such claims; this section has the sole purpose of protecting the
integrity of the free software distribution system, which is
implemented by public license practices. Many people have made
generous contributions to the wide range of software distributed
through that system in reliance on consistent application of that
system; it is up to the author/donor to decide if he or she is willing
to distribute software through any other system and a licensee cannot
impose that choice.
This section is intended to make thoroughly clear what is believed to
be a consequence of the rest of this License.
8. If the distribution and/or use of the Program is restricted in
certain countries either by patents or by copyrighted interfaces, the
original copyright holder who places the Program under this License
may add an explicit geographical distribution limitation excluding
those countries, so that distribution is permitted only in or among
countries not thus excluded. In such case, this License incorporates
the limitation as if written in the body of this License.
9. The Free Software Foundation may publish revised and/or new versions
of the General Public License from time to time. Such new versions will
be similar in spirit to the present version, but may differ in detail to
address new problems or concerns.
Each version is given a distinguishing version number. If the Program
specifies a version number of this License which applies to it and "any
later version", you have the option of following the terms and conditions
either of that version or of any later version published by the Free
Software Foundation. If the Program does not specify a version number of
this License, you may choose any version ever published by the Free Software
Foundation.
10. If you wish to incorporate parts of the Program into other free
programs whose distribution conditions are different, write to the author
to ask for permission. For software which is copyrighted by the Free
Software Foundation, write to the Free Software Foundation; we sometimes
make exceptions for this. Our decision will be guided by the two goals
of preserving the free status of all derivatives of our free software and
of promoting the sharing and reuse of software generally.
NO WARRANTY
11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN
OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS
TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE
PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
REPAIR OR CORRECTION.
12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
POSSIBILITY OF SUCH DAMAGES.
END OF TERMS AND CONDITIONS
How to Apply These Terms to Your New Programs
If you develop a new program, and you want it to be of the greatest
possible use to the public, the best way to achieve this is to make it
free software which everyone can redistribute and change under these terms.
To do so, attach the following notices to the program. It is safest
to attach them to the start of each source file to most effectively
convey the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
<one line to give the program's name and a brief idea of what it does.>
Copyright (C) <year> <name of author>
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Also add information on how to contact you by electronic and paper mail.
If the program is interactive, make it output a short notice like this
when it starts in an interactive mode:
Gnomovision version 69, Copyright (C) year name of author
Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
This is free software, and you are welcome to redistribute it
under certain conditions; type `show c' for details.
The hypothetical commands `show w' and `show c' should show the appropriate
parts of the General Public License. Of course, the commands you use may
be called something other than `show w' and `show c'; they could even be
mouse-clicks or menu items--whatever suits your program.
You should also get your employer (if you work as a programmer) or your
school, if any, to sign a "copyright disclaimer" for the program, if
necessary. Here is a sample; alter the names:
Yoyodyne, Inc., hereby disclaims all copyright interest in the program
`Gnomovision' (which makes passes at compilers) written by James Hacker.
<signature of Ty Coon>, 1 April 1989
Ty Coon, President of Vice
This General Public License does not permit incorporating your program into
proprietary programs. If your program is a subroutine library, you may
consider it more useful to permit linking proprietary applications with the
library. If this is what you want to do, use the GNU Library General
Public License instead of this License.

2
plugins/transum/NEWS Normal file
View File

@ -0,0 +1,2 @@
August 5, 2016 2.0.1 - Initial version
September 30,2016 2.0.2 - Bug fix revision

6
plugins/transum/README Normal file
View File

@ -0,0 +1,6 @@
Advance7 has released under GPL this plugin
for Wireshark. It produces detailed response
time information based on the RTE model.
Advance7 can be found at http://www.advance7.com/
The author is Paul Offord <paul.offord@advance7.com>

303
plugins/transum/decoders.c Normal file
View File

@ -0,0 +1,303 @@
/* decoders.c
* Routines for the TRANSUM response time analyzer post-dissector
* By Paul Offord <paul.offord@advance7.com>
* Copyright 2016 Advance Seven Limited
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
#include <stdio.h>
#include <epan/packet.h>
#include <epan/prefs.h>
#include <epan/dissectors/packet-tcp.h>
#include "packet-transum.h"
#include "preferences.h"
#include "extractors.h"
extern void add_detected_tcp_svc(guint16 port);
extern TSUM_PREFERENCES preferences;
extern PKT_INFO *sub_packet;
extern gboolean *dcerpc_req_pkt_type;
extern gboolean *dcerpc_context_zero;
extern HF_OF_INTEREST hf_of_interest;
/* Returns the number of sub-packets of interest */
int decode_syn(packet_info *pinfo, proto_tree *tree)
{
if (sub_packet[0].tcp_flags_ack)
sub_packet[0].rrpd.c2s = FALSE;
else
{
sub_packet[0].rrpd.c2s = TRUE;
sub_packet[0].rrpd.state = RRPD_STATE_4;
add_detected_tcp_svc(sub_packet[0].dstport);
}
sub_packet[0].rrpd.session_id = 1;
sub_packet[0].rrpd.msg_id = 1;
sub_packet[0].rrpd.suffix = 1;
sub_packet[0].rrpd.decode_based = TRUE;
sub_packet[0].rrpd.calculation = RTE_CALC_SYN;
sub_packet[0].pkt_of_interest = TRUE;
return 1;
}
/*
This function sets basic information in the sub_packet entry.
Because we don't expect multiple DCE-RPC messages in a single packet
we only use sub_packet[0].
Returns the number of sub-packets of interest, which in this case is always 1.
*/
int decode_dcerpc(packet_info *pinfo, proto_tree *tree)
{
guint32 field_uint[MAX_RETURNED_ELEMENTS]; /* An extracted field array for unsigned integers */
size_t field_value_count; /* How many entries are there in the extracted field array */
guint32 dcerpc_cn_ctx_id;
if (!extract_uint(tree, hf_of_interest.dcerpc_ver, field_uint, &field_value_count))
{
if (field_value_count)
sub_packet[0].dcerpc_ver = field_uint[0];
}
if (!extract_uint(tree, hf_of_interest.dcerpc_pkt_type, field_uint, &field_value_count))
{
if (field_value_count)
sub_packet[0].dcerpc_pkt_type = field_uint[0];
}
if (field_value_count)
{
if (!extract_uint(tree, hf_of_interest.dcerpc_cn_ctx_id, field_uint, &field_value_count))
{
if (field_value_count)
dcerpc_cn_ctx_id = field_uint[0];
}
if (dcerpc_context_zero[sub_packet[0].dcerpc_pkt_type])
{ /* This is needed to overcome an apparent Wireshark bug
found in the LUA code - is this still true in C? */
sub_packet[0].rrpd.session_id = 1;
}
else
{
if (dcerpc_cn_ctx_id)
sub_packet[0].rrpd.session_id = dcerpc_cn_ctx_id;
else
sub_packet[0].rrpd.session_id = 1;
}
if (!extract_uint(tree, hf_of_interest.dcerpc_cn_call_id, field_uint, &field_value_count))
{
if (field_value_count)
sub_packet[0].rrpd.msg_id = field_uint[0];
}
}
else
{
/*
we don't have header information and so by setting the session_id and msg_id to zero
the rrpd functions will either create a new rrpd_list (or temp_rsp_rrpd_list) entry
or update the last entry for this ip_proto:stream_no.
*/
sub_packet[0].rrpd.session_id = 0;
sub_packet[0].rrpd.msg_id = 0;
}
if (dcerpc_req_pkt_type[sub_packet[0].dcerpc_pkt_type])
{
sub_packet[0].rrpd.c2s = TRUE;
preferences.tcp_svc_port[sub_packet[0].dstport] = RTE_CALC_DCERPC; /* make sure we have this DCE-RPC service port set */
}
else
{
sub_packet[0].rrpd.c2s = FALSE;
preferences.tcp_svc_port[sub_packet[0].srcport] = RTE_CALC_DCERPC; /* make sure we have this DCE-RPC service port set */
}
sub_packet[0].rrpd.suffix = 1;
sub_packet[0].rrpd.decode_based = TRUE;
sub_packet[0].rrpd.calculation = RTE_CALC_DCERPC;
sub_packet[0].pkt_of_interest = TRUE;
return 1;
}
/* Returns the number of sub-packets of interest */
int decode_smb(packet_info *pinfo, proto_tree *tree)
{
guint32 field_uint[MAX_RETURNED_ELEMENTS]; /* An extracted field array for unsigned integers */
size_t field_value_count; /* How many entries are there in the extracted field array */
guint64 ses_id[MAX_RETURNED_ELEMENTS];
size_t ses_id_count;
guint64 msg_id[MAX_RETURNED_ELEMENTS];
size_t msg_id_count;
/* set the direction information */
if (sub_packet[0].dstport == 445)
sub_packet[0].rrpd.c2s = TRUE;
else
sub_packet[0].rrpd.c2s = FALSE;
extract_uint(tree, hf_of_interest.smb_mid, field_uint, &field_value_count);
if (field_value_count)
{
sub_packet[0].rrpd.calculation = RTE_CALC_SMB1;
sub_packet[0].pkt_of_interest = FALSE; /* can't process SMB1 at the moment */
return 0;
}
else
{
/* Default in case we don't have header information */
sub_packet[0].rrpd.session_id = 0;
sub_packet[0].rrpd.msg_id = 0;
sub_packet[0].rrpd.suffix = 1;
sub_packet[0].rrpd.decode_based = TRUE;
sub_packet[0].rrpd.calculation = RTE_CALC_SMB2;
sub_packet[0].pkt_of_interest = TRUE;
extract_si64(tree, hf_of_interest.smb2_msg_id, msg_id, &msg_id_count);
if (msg_id_count) /* test for header information */
{
extract_ui64(tree, hf_of_interest.smb2_ses_id, ses_id, &ses_id_count);
for (int i = 0; i < msg_id_count; i++)
{
sub_packet[i].rrpd.c2s = sub_packet[0].rrpd.c2s;
sub_packet[i].rrpd.ip_proto = sub_packet[0].rrpd.ip_proto;
sub_packet[i].rrpd.stream_no = sub_packet[0].rrpd.stream_no;
sub_packet[i].rrpd.session_id = ses_id[i];
sub_packet[i].rrpd.msg_id = msg_id[i];
sub_packet[i].rrpd.suffix = 1;
sub_packet[i].rrpd.decode_based = TRUE;
sub_packet[i].rrpd.calculation = RTE_CALC_SMB2;
sub_packet[i].pkt_of_interest = TRUE;
}
return (int)msg_id_count;
}
}
return 1;
}
/* Returns the number of sub-packets of interest */
int decode_gtcp(packet_info *pinfo, proto_tree *tree)
{
guint32 field_uint[MAX_RETURNED_ELEMENTS]; /* An extracted field array for unsigned integers */
gboolean field_bool[MAX_RETURNED_ELEMENTS]; /* An extracted field array for unsigned integers */
size_t field_value_count; /* How many entries are there in the extracted field array */
if (!extract_uint(tree, hf_of_interest.tcp_stream, field_uint, &field_value_count))
sub_packet[0].rrpd.stream_no = field_uint[0];
sub_packet[0].srcport = pinfo->srcport;
sub_packet[0].dstport = pinfo->destport;
if (!extract_uint(tree, hf_of_interest.tcp_len, field_uint, &field_value_count))
sub_packet[0].len = field_uint[0];
if (!extract_bool(tree, hf_of_interest.tcp_flags_syn, field_bool, &field_value_count))
sub_packet[0].tcp_flags_syn = field_bool[0];
if (!extract_bool(tree, hf_of_interest.tcp_flags_ack, field_bool, &field_value_count))
sub_packet[0].tcp_flags_ack = field_bool[0];
if (!extract_bool(tree, hf_of_interest.tcp_flags_reset, field_bool, &field_value_count))
sub_packet[0].tcp_flags_reset = field_bool[0];
if (!extract_bool(tree, hf_of_interest.tcp_retran, field_bool, &field_value_count))
sub_packet[0].tcp_retran = field_bool[0];
if (!extract_bool(tree, hf_of_interest.tcp_keep_alive, field_bool, &field_value_count))
sub_packet[0].tcp_keep_alive = field_bool[0];
if ((preferences.tcp_svc_port[sub_packet[0].dstport] || preferences.tcp_svc_port[sub_packet[0].srcport]) && (sub_packet[0].len > 0))
{
if (preferences.tcp_svc_port[sub_packet[0].dstport])
sub_packet[0].rrpd.c2s = TRUE;
sub_packet[0].rrpd.session_id = 1;
sub_packet[0].rrpd.msg_id = 1;
sub_packet[0].rrpd.calculation = RTE_CALC_GTCP;
sub_packet[0].rrpd.decode_based = FALSE;
sub_packet[0].pkt_of_interest = TRUE;
return 1;
}
return 0;
}
/* Returns the number of sub-packets of interest */
int decode_dns(packet_info *pinfo, proto_tree *tree)
{
guint32 field_uint[MAX_RETURNED_ELEMENTS]; /* An extracted field array for unsigned integers */
size_t field_value_count; /* How many entries are there in the extracted field array */
if (!extract_uint(tree, hf_of_interest.dns_id, field_uint, &field_value_count))
sub_packet[0].rrpd.msg_id = field_uint[0];
sub_packet[0].rrpd.session_id = 1;
sub_packet[0].rrpd.suffix = 1; /* need to do something tricky here as dns.id gets reused */
sub_packet[0].rrpd.decode_based = TRUE;
sub_packet[0].rrpd.calculation = RTE_CALC_DNS;
sub_packet[0].pkt_of_interest = TRUE;
return 1;
}
/* Returns the number of sub-packets of interest */
int decode_gudp(packet_info *pinfo, proto_tree *tree)
{
guint32 field_uint[MAX_RETURNED_ELEMENTS]; /* An extracted field array for unsigned integers */
size_t field_value_count; /* How many entries are there in the extracted field array */
sub_packet[0].srcport = pinfo->srcport;
sub_packet[0].dstport = pinfo->destport;
if (!extract_uint(tree, hf_of_interest.udp_stream, field_uint, &field_value_count))
sub_packet[0].rrpd.stream_no = field_uint[0];
if (!extract_uint(tree, hf_of_interest.udp_length, field_uint, &field_value_count))
sub_packet[0].len = field_uint[0];
if (preferences.udp_svc_port[sub_packet[0].dstport] || preferences.udp_svc_port[sub_packet[0].srcport])
{
if (preferences.udp_svc_port[sub_packet[0].dstport])
sub_packet[0].rrpd.c2s = TRUE;
sub_packet[0].rrpd.session_id = 1;
sub_packet[0].rrpd.msg_id = 1;
sub_packet[0].rrpd.suffix = 1;
sub_packet[0].rrpd.decode_based = FALSE;
sub_packet[0].rrpd.calculation = RTE_CALC_GUDP;
sub_packet[0].pkt_of_interest = TRUE;
}
return 1;
}

31
plugins/transum/decoders.h Normal file
View File

@ -0,0 +1,31 @@
/* decoders.h
* Header file for the TRANSUM response time analyzer post-dissector
* By Paul Offord <paul.offord@advance7.com>
* Copyright 2016 Advance Seven Limited
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
gboolean decode_syn(packet_info *pinfo, proto_tree *tree);
gboolean decode_dcerpc(packet_info *pinfo, proto_tree *tree);
gboolean decode_smb(packet_info *pinfo, proto_tree *tree);
gboolean decode_gtcp(packet_info *pinfo, proto_tree *tree);
gboolean decode_dns(packet_info *pinfo, proto_tree *tree);
gboolean decode_gudp(packet_info *pinfo, proto_tree *tree);

120
plugins/transum/extractors.c Normal file
View File

@ -0,0 +1,120 @@
/* extractors.c
* Routines for the TRANSUM response time analyzer post-dissector
* By Paul Offord <paul.offord@advance7.com>
* Copyright 2016 Advance Seven Limited
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
#include <epan/prefs.h>
#include <epan/packet.h>
#include "extractors.h"
/*
This function extracts a field value (e.g. tcp.len) from a tree. Because a packet may contain
multiple values for the the field the extracted values are returned in a result_array. The
number of array entries is returned in element_count.
Return is 0 if all went well. If this function return -1 it is probably because the tree did not
include the field defined by the field_id.
*/
int extract_uint(proto_tree *tree, int field_id, guint32 *result_array, size_t *element_count)
{
GPtrArray *finfo_array = proto_find_finfo(tree, field_id);
if (finfo_array == NULL) {
return -1;
}
*element_count = g_ptr_array_len(finfo_array);
for (int i = 0; i < *element_count && i < MAX_RETURNED_ELEMENTS; i++)
{
result_array[i] = fvalue_get_uinteger(&((field_info*)finfo_array->pdata[i])->value);
}
g_ptr_array_free(finfo_array, TRUE);
return 0;
}
int extract_ui64(proto_tree *tree, int field_id, guint64 *result_array, size_t *element_count)
{
GPtrArray *finfo_array = proto_find_finfo(tree, field_id);
if (finfo_array == NULL) {
return -1;
}
*element_count = g_ptr_array_len(finfo_array);
for (int i = 0; i < *element_count && i < MAX_RETURNED_ELEMENTS; i++)
{
result_array[i] = fvalue_get_uinteger64(&((field_info*)finfo_array->pdata[i])->value);
}
g_ptr_array_free(finfo_array, TRUE);
return 0;
}
int extract_si64(proto_tree *tree, int field_id, guint64 *result_array, size_t *element_count)
{
GPtrArray *finfo_array = proto_find_finfo(tree, field_id);
if (finfo_array == NULL) {
return -1;
}
*element_count = g_ptr_array_len(finfo_array);
for (int i = 0; i < *element_count && i < MAX_RETURNED_ELEMENTS; i++)
{
result_array[i] = fvalue_get_sinteger64(&((field_info*)finfo_array->pdata[i])->value);
}
g_ptr_array_free(finfo_array, TRUE);
return 0;
}
int extract_bool(proto_tree *tree, int field_id, gboolean *result_array, size_t *element_count)
{
GPtrArray *finfo_array = proto_find_finfo(tree, field_id);
if (finfo_array == NULL) {
return -1;
}
*element_count = g_ptr_array_len(finfo_array);
for (int i = 0; i < *element_count && i < MAX_RETURNED_ELEMENTS; i++)
{
fvalue_t *fv = &(((field_info*)finfo_array->pdata[i])->value);
if (fv->value.uinteger)
result_array[i] = TRUE;
else
result_array[i] = FALSE;
}
g_ptr_array_free(finfo_array, TRUE);
return 0;
}

33
plugins/transum/extractors.h Normal file
View File

@ -0,0 +1,33 @@
/* extractors.h
* Header file for the TRANSUM response time analyzer post-dissector
* By Paul Offord <paul.offord@advance7.com>
* Copyright 2016 Advance Seven Limited
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
#include <epan/prefs.h>
#include <epan/packet.h>
#define MAX_RETURNED_ELEMENTS 16
int extract_uint(proto_tree *tree, int field_id, guint32 *result_array, size_t *element_count);
int extract_ui64(proto_tree *tree, int field_id, guint64 *result_array, size_t *element_count);
int extract_si64(proto_tree *tree, int field_id, guint64 *result_array, size_t *element_count);
int extract_bool(proto_tree *tree, int field_id, gboolean *result_array, size_t *element_count);

39
plugins/transum/moduleinfo.h Normal file
View File

@ -0,0 +1,39 @@
/* moduleinfo.h
*
* Module info header for wireshark plugins.
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/* Included *after* config.h, in order to re-define these macros */
#ifdef PACKAGE
#undef PACKAGE
#endif
/* Name of package */
#define PACKAGE "transum"
#ifdef VERSION
#undef VERSION
#endif
/* Version number of package */
#define VERSION "2.0.2"

1408
plugins/transum/packet-transum.c Normal file
View File

File diff suppressed because it is too large Load Diff

185
plugins/transum/packet-transum.h Normal file
View File

@ -0,0 +1,185 @@
/* packet-transum.h
* Header file for the TRANSUM response time analyzer post-dissector
* By Paul Offord <paul.offord@advance7.com>
* Copyright 2016 Advance Seven Limited
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#define ETH_TYPE_IPV4 0x0800
#define ETH_TYPE_IPV6 0x86dd
#define IP_PROTO_TCP 6
#define IP_PROTO_UDP 17
#define RRPD_STATE_DONT_CARE 0
#define RRPD_STATE_INIT 0
#define RRPD_STATE_1 1
#define RRPD_STATE_2 2
#define RRPD_STATE_3 3
#define RRPD_STATE_4 4
#define RRPD_STATE_5 5
#define RRPD_STATE_6 6
#define RRPD_STATE_7 7
#define RRPD_STATE_8 8
#define RTE_CALC_SYN 1
#define RTE_CALC_GTCP 2
#define RTE_CALC_GUDP 3
#define RTE_CALC_SMB1 4
#define RTE_CALC_SMB2 5
#define RTE_CALC_DCERPC 6
#define RTE_CALC_DNS 7
#define RRPD_SIZE 64
#define MAX_STREAMS_PER_PROTOCOL 256*1024
#define MAX_PACKETS 8000000 /* We support 8 million packets */
#define MAX_SUBPKTS_PER_PACKET 16
#define MAX_RRPDS 1000000 /* We support 4 million RRPDs */
#define SIZE_OF_TEMP_RSP_RRPD_LIST 1024
/*
An RR pair is identified by a Fully Qualified Message ID (RRPD)
*/
typedef struct _RRPD
{
/*
When a c2s is set TRUE it means that the associated packet is going from
client-to-service. If this value is false the associated packet is going
from service-to-client.
This value is only valid for RRPDs imbedded in subpacket structures.
*/
gboolean c2s;
guint8 ip_proto;
guint32 stream_no;
guint64 session_id;
guint64 msg_id;
guint32 suffix;
/*
Some request-response pairs are demarked simple by a change in direction on a
TCP or UDP stream from s2c to c2s. This is true for the GTCP and GUDP
calculations. Other calculations (such as DCERPC) use application protocol
values to detect the start and end of APDUs. In this latter case decode_based
is set to true.
*/
gboolean decode_based;
int state;
guint32 req_first_frame;
nstime_t req_first_rtime;
guint32 req_last_frame;
nstime_t req_last_rtime;
guint32 rsp_first_frame;
nstime_t rsp_first_rtime;
guint32 rsp_last_frame;
nstime_t rsp_last_rtime;
guint calculation;
} RRPD;
typedef struct _PKT_INFO
{
int frame_number;
nstime_t relative_time;
gboolean tcp_retran; /* tcp.analysis.retransmission */
gboolean tcp_keep_alive; /* tcp.analysis.keep_alive */
gboolean tcp_flags_syn; /* tcp.flags.syn */
gboolean tcp_flags_ack; /* tcp.flags.ack */
gboolean tcp_flags_reset; /* tcp.flags.reset */
guint32 tcp_flags_urg; /* tcp.urgent_pointer */
guint32 tcp_seq; /* tcp.seq */
/* Generic transport values */
guint16 srcport; /* tcp.srcport or udp.srcport*/
guint16 dstport; /* tcp.dstport or udp.dstport*/
guint16 len; /* tcp.len or udp.len */
guint8 tds_type; /*tds.type */
guint16 tds_length; /* tds.length */
guint16 smb_mid; /* smb.mid */
guint64 smb2_sesid; /* smb2.sesid */
guint64 smb2_msg_id; /* smb2.msg_id */
guint16 smb2_cmd; /* smb2.cmd */
guint8 dcerpc_ver; /* dcerpc.ver */
guint8 dcerpc_pkt_type; /* dcerpc.pkt_type */
guint32 dcerpc_cn_call_id; /* dcerpc.cn_call_id */
guint16 dcerpc_cn_ctx_id; /* dcerpc.cn_ctx_id */
guint16 dns_id; /* dns.id */
/* The following values are calculated */
gboolean pkt_of_interest;
/* RRPD data for this packet */
/* Complete this based on the detected protocol */
RRPD rrpd;
} PKT_INFO;
typedef struct _HF_OF_INTEREST
{
int ip_proto;
int ipv6_nxt;
int tcp_retran;
int tcp_keep_alive;
int tcp_flags_syn;
int tcp_flags_ack;
int tcp_flags_reset;
int tcp_flags_urg;
int tcp_seq;
int tcp_srcport;
int tcp_dstport;
int tcp_stream;
int tcp_len;
int udp_srcport;
int udp_dstport;
int udp_stream;
int udp_length;
int tds_type;
int tds_length;
int smb_mid;
int smb2_ses_id;
int smb2_msg_id;
int smb2_cmd;
int dcerpc_ver;
int dcerpc_pkt_type;
int dcerpc_cn_call_id;
int dcerpc_cn_ctx_id;
int dns_id;
int data_data;
} HF_OF_INTEREST;

55
plugins/transum/preferences.h Normal file
View File

@ -0,0 +1,55 @@
/* preferences.h
* Header file for the TRANSUM response time analyzer post-dissector
* By Paul Offord <paul.offord@advance7.com>
* Copyright 2016 Advance Seven Limited
*
* Wireshark - Network traffic analyzer
* By Gerald Combs <gerald@wireshark.org>
* Copyright 1998 Gerald Combs
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#include "config.h"
#include <epan/packet.h>
#include <epan/prefs.h>
#define RTE_TIME_SEC 1
#define RTE_TIME_MSEC 1000
#define RTE_TIME_USEC 1000000
#define TRACE_CAP_CLIENT 1
#define TRACE_CAP_INTERMEDIATE 2
#define TRACE_CAP_SERVICE 3
/* Add entries to the service port table for packets to be treated as services
* This is populated with preferences "service ports" data */
typedef struct _TSUM_PREFERENCES
{
gboolean tsumenabled;
int capture_position;
gboolean reassembly;
guint8 tcp_svc_port[64 * 1024];
guint8 udp_svc_port[64 * 1024];
gboolean dcerpc_svc_port[64 * 1024];
gboolean orphan_ka_discard;
int time_multiplier;
gboolean rte_on_first_req;
gboolean rte_on_last_req;
gboolean rte_on_first_rsp;
gboolean rte_on_last_rsp;
gboolean summarisers_enabled;
gboolean summarise_tds;
gboolean summarisers_escape_quotes;
} TSUM_PREFERENCES;