pax_global_header 0000666 0000000 0000000 00000000064 12242060236 0014507 g ustar 00root root 0000000 0000000 52 comment=4d10c53f8ab718646be885b2a164668c43433de1
netmate-0.2.0/ 0000775 0000000 0000000 00000000000 12242060236 0013143 5 ustar 00root root 0000000 0000000 netmate-0.2.0/COPYING 0000664 0000000 0000000 00000104374 12242060236 0014207 0 ustar 00root root 0000000 0000000
GNU GENERAL PUBLIC LICENSE
Version 3, 29 June 2007
Copyright (C) 2007 Free Software Foundation, Inc.
Everyone is permitted to copy and distribute verbatim copies
of this license document, but changing it is not allowed.
Preamble
The GNU General Public License is a free, copyleft license for
software and other kinds of works.
The licenses for most software and other practical works are designed
to take away your freedom to share and change the works. By contrast,
the GNU General Public License is intended to guarantee your freedom to
share and change all versions of a program--to make sure it remains free
software for all its users. We, the Free Software Foundation, use the
GNU General Public License for most of our software; it applies also to
any other work released this way by its authors. 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
them 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 prevent others from denying you
these rights or asking you to surrender the rights. Therefore, you have
certain responsibilities if you distribute copies of the software, or if
you modify it: responsibilities to respect the freedom of others.
For example, if you distribute copies of such a program, whether
gratis or for a fee, you must pass on to the recipients the same
freedoms that you received. 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.
Developers that use the GNU GPL protect your rights with two steps:
(1) assert copyright on the software, and (2) offer you this License
giving you legal permission to copy, distribute and/or modify it.
For the developers' and authors' protection, the GPL clearly explains
that there is no warranty for this free software. For both users' and
authors' sake, the GPL requires that modified versions be marked as
changed, so that their problems will not be attributed erroneously to
authors of previous versions.
Some devices are designed to deny users access to install or run
modified versions of the software inside them, although the manufacturer
can do so. This is fundamentally incompatible with the aim of
protecting users' freedom to change the software. The systematic
pattern of such abuse occurs in the area of products for individuals to
use, which is precisely where it is most unacceptable. Therefore, we
have designed this version of the GPL to prohibit the practice for those
products. If such problems arise substantially in other domains, we
stand ready to extend this provision to those domains in future versions
of the GPL, as needed to protect the freedom of users.
Finally, every program is threatened constantly by software patents.
States should not allow patents to restrict development and use of
software on general-purpose computers, but in those that do, we wish to
avoid the special danger that patents applied to a free program could
make it effectively proprietary. To prevent this, the GPL assures that
patents cannot be used to render the program non-free.
The precise terms and conditions for copying, distribution and
modification follow.
TERMS AND CONDITIONS
0. Definitions.
"This License" refers to version 3 of the GNU General Public License.
"Copyright" also means copyright-like laws that apply to other kinds of
works, such as semiconductor masks.
"The Program" refers to any copyrightable work licensed under this
License. Each licensee is addressed as "you". "Licensees" and
"recipients" may be individuals or organizations.
To "modify" a work means to copy from or adapt all or part of the work
in a fashion requiring copyright permission, other than the making of an
exact copy. The resulting work is called a "modified version" of the
earlier work or a work "based on" the earlier work.
A "covered work" means either the unmodified Program or a work based
on the Program.
To "propagate" a work means to do anything with it that, without
permission, would make you directly or secondarily liable for
infringement under applicable copyright law, except executing it on a
computer or modifying a private copy. Propagation includes copying,
distribution (with or without modification), making available to the
public, and in some countries other activities as well.
To "convey" a work means any kind of propagation that enables other
parties to make or receive copies. Mere interaction with a user through
a computer network, with no transfer of a copy, is not conveying.
An interactive user interface displays "Appropriate Legal Notices"
to the extent that it includes a convenient and prominently visible
feature that (1) displays an appropriate copyright notice, and (2)
tells the user that there is no warranty for the work (except to the
extent that warranties are provided), that licensees may convey the
work under this License, and how to view a copy of this License. If
the interface presents a list of user commands or options, such as a
menu, a prominent item in the list meets this criterion.
1. Source Code.
The "source code" for a work means the preferred form of the work
for making modifications to it. "Object code" means any non-source
form of a work.
A "Standard Interface" means an interface that either is an official
standard defined by a recognized standards body, or, in the case of
interfaces specified for a particular programming language, one that
is widely used among developers working in that language.
The "System Libraries" of an executable work include anything, other
than the work as a whole, that (a) is included in the normal form of
packaging a Major Component, but which is not part of that Major
Component, and (b) serves only to enable use of the work with that
Major Component, or to implement a Standard Interface for which an
implementation is available to the public in source code form. A
"Major Component", in this context, means a major essential component
(kernel, window system, and so on) of the specific operating system
(if any) on which the executable work runs, or a compiler used to
produce the work, or an object code interpreter used to run it.
The "Corresponding Source" for a work in object code form means all
the source code needed to generate, install, and (for an executable
work) run the object code and to modify the work, including scripts to
control those activities. However, it does not include the work's
System Libraries, or general-purpose tools or generally available free
programs which are used unmodified in performing those activities but
which are not part of the work. For example, Corresponding Source
includes interface definition files associated with source files for
the work, and the source code for shared libraries and dynamically
linked subprograms that the work is specifically designed to require,
such as by intimate data communication or control flow between those
subprograms and other parts of the work.
The Corresponding Source need not include anything that users
can regenerate automatically from other parts of the Corresponding
Source.
The Corresponding Source for a work in source code form is that
same work.
2. Basic Permissions.
All rights granted under this License are granted for the term of
copyright on the Program, and are irrevocable provided the stated
conditions are met. This License explicitly affirms your unlimited
permission to run the unmodified Program. The output from running a
covered work is covered by this License only if the output, given its
content, constitutes a covered work. This License acknowledges your
rights of fair use or other equivalent, as provided by copyright law.
You may make, run and propagate covered works that you do not
convey, without conditions so long as your license otherwise remains
in force. You may convey covered works to others for the sole purpose
of having them make modifications exclusively for you, or provide you
with facilities for running those works, provided that you comply with
the terms of this License in conveying all material for which you do
not control copyright. Those thus making or running the covered works
for you must do so exclusively on your behalf, under your direction
and control, on terms that prohibit them from making any copies of
your copyrighted material outside their relationship with you.
Conveying under any other circumstances is permitted solely under
the conditions stated below. Sublicensing is not allowed; section 10
makes it unnecessary.
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
No covered work shall be deemed part of an effective technological
measure under any applicable law fulfilling obligations under article
11 of the WIPO copyright treaty adopted on 20 December 1996, or
similar laws prohibiting or restricting circumvention of such
measures.
When you convey a covered work, you waive any legal power to forbid
circumvention of technological measures to the extent such circumvention
is effected by exercising rights under this License with respect to
the covered work, and you disclaim any intention to limit operation or
modification of the work as a means of enforcing, against the work's
users, your or third parties' legal rights to forbid circumvention of
technological measures.
4. Conveying Verbatim Copies.
You may convey 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;
keep intact all notices stating that this License and any
non-permissive terms added in accord with section 7 apply to the code;
keep intact all notices of the absence of any warranty; and give all
recipients a copy of this License along with the Program.
You may charge any price or no price for each copy that you convey,
and you may offer support or warranty protection for a fee.
5. Conveying Modified Source Versions.
You may convey a work based on the Program, or the modifications to
produce it from the Program, in the form of source code under the
terms of section 4, provided that you also meet all of these conditions:
a) The work must carry prominent notices stating that you modified
it, and giving a relevant date.
b) The work must carry prominent notices stating that it is
released under this License and any conditions added under section
7. This requirement modifies the requirement in section 4 to
"keep intact all notices".
c) You must license the entire work, as a whole, under this
License to anyone who comes into possession of a copy. This
License will therefore apply, along with any applicable section 7
additional terms, to the whole of the work, and all its parts,
regardless of how they are packaged. This License gives no
permission to license the work in any other way, but it does not
invalidate such permission if you have separately received it.
d) If the work has interactive user interfaces, each must display
Appropriate Legal Notices; however, if the Program has interactive
interfaces that do not display Appropriate Legal Notices, your
work need not make them do so.
A compilation of a covered work with other separate and independent
works, which are not by their nature extensions of the covered work,
and which are not combined with it such as to form a larger program,
in or on a volume of a storage or distribution medium, is called an
"aggregate" if the compilation and its resulting copyright are not
used to limit the access or legal rights of the compilation's users
beyond what the individual works permit. Inclusion of a covered work
in an aggregate does not cause this License to apply to the other
parts of the aggregate.
6. Conveying Non-Source Forms.
You may convey a covered work in object code form under the terms
of sections 4 and 5, provided that you also convey the
machine-readable Corresponding Source under the terms of this License,
in one of these ways:
a) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by the
Corresponding Source fixed on a durable physical medium
customarily used for software interchange.
b) Convey the object code in, or embodied in, a physical product
(including a physical distribution medium), accompanied by a
written offer, valid for at least three years and valid for as
long as you offer spare parts or customer support for that product
model, to give anyone who possesses the object code either (1) a
copy of the Corresponding Source for all the software in the
product that is covered by this License, on a durable physical
medium customarily used for software interchange, for a price no
more than your reasonable cost of physically performing this
conveying of source, or (2) access to copy the
Corresponding Source from a network server at no charge.
c) Convey individual copies of the object code with a copy of the
written offer to provide the Corresponding Source. This
alternative is allowed only occasionally and noncommercially, and
only if you received the object code with such an offer, in accord
with subsection 6b.
d) Convey the object code by offering access from a designated
place (gratis or for a charge), and offer equivalent access to the
Corresponding Source in the same way through the same place at no
further charge. You need not require recipients to copy the
Corresponding Source along with the object code. If the place to
copy the object code is a network server, the Corresponding Source
may be on a different server (operated by you or a third party)
that supports equivalent copying facilities, provided you maintain
clear directions next to the object code saying where to find the
Corresponding Source. Regardless of what server hosts the
Corresponding Source, you remain obligated to ensure that it is
available for as long as needed to satisfy these requirements.
e) Convey the object code using peer-to-peer transmission, provided
you inform other peers where the object code and Corresponding
Source of the work are being offered to the general public at no
charge under subsection 6d.
A separable portion of the object code, whose source code is excluded
from the Corresponding Source as a System Library, need not be
included in conveying the object code work.
A "User Product" is either (1) a "consumer product", which means any
tangible personal property which is normally used for personal, family,
or household purposes, or (2) anything designed or sold for incorporation
into a dwelling. In determining whether a product is a consumer product,
doubtful cases shall be resolved in favor of coverage. For a particular
product received by a particular user, "normally used" refers to a
typical or common use of that class of product, regardless of the status
of the particular user or of the way in which the particular user
actually uses, or expects or is expected to use, the product. A product
is a consumer product regardless of whether the product has substantial
commercial, industrial or non-consumer uses, unless such uses represent
the only significant mode of use of the product.
"Installation Information" for a User Product means any methods,
procedures, authorization keys, or other information required to install
and execute modified versions of a covered work in that User Product from
a modified version of its Corresponding Source. The information must
suffice to ensure that the continued functioning of the modified object
code is in no case prevented or interfered with solely because
modification has been made.
If you convey an object code work under this section in, or with, or
specifically for use in, a User Product, and the conveying occurs as
part of a transaction in which the right of possession and use of the
User Product is transferred to the recipient in perpetuity or for a
fixed term (regardless of how the transaction is characterized), the
Corresponding Source conveyed under this section must be accompanied
by the Installation Information. But this requirement does not apply
if neither you nor any third party retains the ability to install
modified object code on the User Product (for example, the work has
been installed in ROM).
The requirement to provide Installation Information does not include a
requirement to continue to provide support service, warranty, or updates
for a work that has been modified or installed by the recipient, or for
the User Product in which it has been modified or installed. Access to a
network may be denied when the modification itself materially and
adversely affects the operation of the network or violates the rules and
protocols for communication across the network.
Corresponding Source conveyed, and Installation Information provided,
in accord with this section must be in a format that is publicly
documented (and with an implementation available to the public in
source code form), and must require no special password or key for
unpacking, reading or copying.
7. Additional Terms.
"Additional permissions" are terms that supplement the terms of this
License by making exceptions from one or more of its conditions.
Additional permissions that are applicable to the entire Program shall
be treated as though they were included in this License, to the extent
that they are valid under applicable law. If additional permissions
apply only to part of the Program, that part may be used separately
under those permissions, but the entire Program remains governed by
this License without regard to the additional permissions.
When you convey a copy of a covered work, you may at your option
remove any additional permissions from that copy, or from any part of
it. (Additional permissions may be written to require their own
removal in certain cases when you modify the work.) You may place
additional permissions on material, added by you to a covered work,
for which you have or can give appropriate copyright permission.
Notwithstanding any other provision of this License, for material you
add to a covered work, you may (if authorized by the copyright holders of
that material) supplement the terms of this License with terms:
a) Disclaiming warranty or limiting liability differently from the
terms of sections 15 and 16 of this License; or
b) Requiring preservation of specified reasonable legal notices or
author attributions in that material or in the Appropriate Legal
Notices displayed by works containing it; or
c) Prohibiting misrepresentation of the origin of that material, or
requiring that modified versions of such material be marked in
reasonable ways as different from the original version; or
d) Limiting the use for publicity purposes of names of licensors or
authors of the material; or
e) Declining to grant rights under trademark law for use of some
trade names, trademarks, or service marks; or
f) Requiring indemnification of licensors and authors of that
material by anyone who conveys the material (or modified versions of
it) with contractual assumptions of liability to the recipient, for
any liability that these contractual assumptions directly impose on
those licensors and authors.
All other non-permissive additional terms are considered "further
restrictions" within the meaning of section 10. If the Program as you
received it, or any part of it, contains a notice stating that it is
governed by this License along with a term that is a further
restriction, you may remove that term. If a license document contains
a further restriction but permits relicensing or conveying under this
License, you may add to a covered work material governed by the terms
of that license document, provided that the further restriction does
not survive such relicensing or conveying.
If you add terms to a covered work in accord with this section, you
must place, in the relevant source files, a statement of the
additional terms that apply to those files, or a notice indicating
where to find the applicable terms.
Additional terms, permissive or non-permissive, may be stated in the
form of a separately written license, or stated as exceptions;
the above requirements apply either way.
8. Termination.
You may not propagate or modify a covered work except as expressly
provided under this License. Any attempt otherwise to propagate or
modify it is void, and will automatically terminate your rights under
this License (including any patent licenses granted under the third
paragraph of section 11).
However, if you cease all violation of this License, then your
license from a particular copyright holder is reinstated (a)
provisionally, unless and until the copyright holder explicitly and
finally terminates your license, and (b) permanently, if the copyright
holder fails to notify you of the violation by some reasonable means
prior to 60 days after the cessation.
Moreover, your license from a particular copyright holder is
reinstated permanently if the copyright holder notifies you of the
violation by some reasonable means, this is the first time you have
received notice of violation of this License (for any work) from that
copyright holder, and you cure the violation prior to 30 days after
your receipt of the notice.
Termination of your rights under this section does not terminate the
licenses of parties who have received copies or rights from you under
this License. If your rights have been terminated and not permanently
reinstated, you do not qualify to receive new licenses for the same
material under section 10.
9. Acceptance Not Required for Having Copies.
You are not required to accept this License in order to receive or
run a copy of the Program. Ancillary propagation of a covered work
occurring solely as a consequence of using peer-to-peer transmission
to receive a copy likewise does not require acceptance. However,
nothing other than this License grants you permission to propagate or
modify any covered work. These actions infringe copyright if you do
not accept this License. Therefore, by modifying or propagating a
covered work, you indicate your acceptance of this License to do so.
10. Automatic Licensing of Downstream Recipients.
Each time you convey a covered work, the recipient automatically
receives a license from the original licensors, to run, modify and
propagate that work, subject to this License. You are not responsible
for enforcing compliance by third parties with this License.
An "entity transaction" is a transaction transferring control of an
organization, or substantially all assets of one, or subdividing an
organization, or merging organizations. If propagation of a covered
work results from an entity transaction, each party to that
transaction who receives a copy of the work also receives whatever
licenses to the work the party's predecessor in interest had or could
give under the previous paragraph, plus a right to possession of the
Corresponding Source of the work from the predecessor in interest, if
the predecessor has it or can get it with reasonable efforts.
You may not impose any further restrictions on the exercise of the
rights granted or affirmed under this License. For example, you may
not impose a license fee, royalty, or other charge for exercise of
rights granted under this License, and you may not initiate litigation
(including a cross-claim or counterclaim in a lawsuit) alleging that
any patent claim is infringed by making, using, selling, offering for
sale, or importing the Program or any portion of it.
11. Patents.
A "contributor" is a copyright holder who authorizes use under this
License of the Program or a work on which the Program is based. The
work thus licensed is called the contributor's "contributor version".
A contributor's "essential patent claims" are all patent claims
owned or controlled by the contributor, whether already acquired or
hereafter acquired, that would be infringed by some manner, permitted
by this License, of making, using, or selling its contributor version,
but do not include claims that would be infringed only as a
consequence of further modification of the contributor version. For
purposes of this definition, "control" includes the right to grant
patent sublicenses in a manner consistent with the requirements of
this License.
Each contributor grants you a non-exclusive, worldwide, royalty-free
patent license under the contributor's essential patent claims, to
make, use, sell, offer for sale, import and otherwise run, modify and
propagate the contents of its contributor version.
In the following three paragraphs, a "patent license" is any express
agreement or commitment, however denominated, not to enforce a patent
(such as an express permission to practice a patent or covenant not to
sue for patent infringement). To "grant" such a patent license to a
party means to make such an agreement or commitment not to enforce a
patent against the party.
If you convey a covered work, knowingly relying on a patent license,
and the Corresponding Source of the work is not available for anyone
to copy, free of charge and under the terms of this License, through a
publicly available network server or other readily accessible means,
then you must either (1) cause the Corresponding Source to be so
available, or (2) arrange to deprive yourself of the benefit of the
patent license for this particular work, or (3) arrange, in a manner
consistent with the requirements of this License, to extend the patent
license to downstream recipients. "Knowingly relying" means you have
actual knowledge that, but for the patent license, your conveying the
covered work in a country, or your recipient's use of the covered work
in a country, would infringe one or more identifiable patents in that
country that you have reason to believe are valid.
If, pursuant to or in connection with a single transaction or
arrangement, you convey, or propagate by procuring conveyance of, a
covered work, and grant a patent license to some of the parties
receiving the covered work authorizing them to use, propagate, modify
or convey a specific copy of the covered work, then the patent license
you grant is automatically extended to all recipients of the covered
work and works based on it.
A patent license is "discriminatory" if it does not include within
the scope of its coverage, prohibits the exercise of, or is
conditioned on the non-exercise of one or more of the rights that are
specifically granted under this License. You may not convey a covered
work if you are a party to an arrangement with a third party that is
in the business of distributing software, under which you make payment
to the third party based on the extent of your activity of conveying
the work, and under which the third party grants, to any of the
parties who would receive the covered work from you, a discriminatory
patent license (a) in connection with copies of the covered work
conveyed by you (or copies made from those copies), or (b) primarily
for and in connection with specific products or compilations that
contain the covered work, unless you entered into that arrangement,
or that patent license was granted, prior to 28 March 2007.
Nothing in this License shall be construed as excluding or limiting
any implied license or other defenses to infringement that may
otherwise be available to you under applicable patent law.
12. No Surrender of Others' Freedom.
If 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 convey a
covered work so as to satisfy simultaneously your obligations under this
License and any other pertinent obligations, then as a consequence you may
not convey it at all. For example, if you agree to terms that obligate you
to collect a royalty for further conveying from those to whom you convey
the Program, the only way you could satisfy both those terms and this
License would be to refrain entirely from conveying the Program.
13. Use with the GNU Affero General Public License.
Notwithstanding any other provision of this License, you have
permission to link or combine any covered work with a work licensed
under version 3 of the GNU Affero General Public License into a single
combined work, and to convey the resulting work. The terms of this
License will continue to apply to the part which is the covered work,
but the special requirements of the GNU Affero General Public License,
section 13, concerning interaction through a network will apply to the
combination as such.
14. Revised Versions of this License.
The Free Software Foundation may publish revised and/or new versions of
the GNU 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 that a certain numbered version of the GNU General
Public License "or any later version" applies to it, you have the
option of following the terms and conditions either of that numbered
version or of any later version published by the Free Software
Foundation. If the Program does not specify a version number of the
GNU General Public License, you may choose any version ever published
by the Free Software Foundation.
If the Program specifies that a proxy can decide which future
versions of the GNU General Public License can be used, that proxy's
public statement of acceptance of a version permanently authorizes you
to choose that version for the Program.
Later license versions may give you additional or different
permissions. However, no additional obligations are imposed on any
author or copyright holder as a result of your choosing to follow a
later version.
15. Disclaimer of Warranty.
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.
16. Limitation of Liability.
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
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.
17. Interpretation of Sections 15 and 16.
If the disclaimer of warranty and limitation of liability provided
above cannot be given local legal effect according to their terms,
reviewing courts shall apply local law that most closely approximates
an absolute waiver of all civil liability in connection with the
Program, unless a warranty or assumption of liability accompanies a
copy of the Program in return for a fee.
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
state the exclusion of warranty; and each file should have at least
the "copyright" line and a pointer to where the full notice is found.
Copyright (C)
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 3 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, see .
Also add information on how to contact you by electronic and paper mail.
If the program does terminal interaction, make it output a short
notice like this when it starts in an interactive mode:
Copyright (C)
This program 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, your program's commands
might be different; for a GUI interface, you would use an "about box".
You should also get your employer (if you work as a programmer) or school,
if any, to sign a "copyright disclaimer" for the program, if necessary.
For more information on this, and how to apply and follow the GNU GPL, see
.
The GNU 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 Lesser General
Public License instead of this License. But first, please read
.
netmate-0.2.0/Changelog 0000664 0000000 0000000 00000001436 12242060236 0014761 0 ustar 00root root 0000000 0000000 2013-11-17 Robert Krause
* added full support for neighbor discovery protocol (NDP)
* fixed GPLv3 license statement and added to all files
* minor bug fixes
2013-11-10 Robert Krause
* added resolution of header fields for all supported protocols
* minor bug fixes
2013-10-28 Robert Krause
* added tooltips for all supported protocols
* improved Makefile
* minor bug fixes
2013-10-19 Robert Krause
* improved Makefile
* added shortcut and icon
* added README and man-page
* compiles under windows
* minor bug fixes
2013-10-05 Robert Krause
* initial changelog
* added columns source port, destination port, flags
* columns are resizeable now
* removed external GUI (netmate.ui)
* minor fixes
netmate-0.2.0/Makefile 0000664 0000000 0000000 00000002213 12242060236 0014601 0 ustar 00root root 0000000 0000000 PREFIX = /usr
BINDIR = $(PREFIX)/bin
DOCDIR = $(PREFIX)/share/doc
MANDIR = $(PREFIX)/share/man
APPDIR = $(PREFIX)/share/applications
ICODIR = $(PREFIX)/share/pixmaps
OPTFLAGS = $(shell getconf LFS_CFLAGS) -D_FORTIFY_SOURCE=2 -O2 -fstack-protector --param=ssp-buffer-size=4
WARNFLAGS = -Wall -Wextra -Wformat -Werror=format-security
DEBUGFLAGS = -g
CFLAGS += $(OPTFLAGS) $(WARNFLAGS) $(DEBUGFLAGS)
LDFLAGS += -Wl,-z,relro
GTK_CFLAGS = $(shell pkg-config --cflags gtk+-3.0)
GTK_LIBS = $(shell pkg-config --libs gtk+-3.0)
all: netmate.c layer2.h layer3.h layer4.h
gcc $(CPPFLAGS) $(GTK_CFLAGS) $(CFLAGS) -c netmate.c -o netmate.o
gcc $(GTK_LIBS) -lpcap $(LDFLAGS) netmate.o -o netmate
install:
install -D -m 755 netmate $(DESTDIR)/$(BINDIR)/netmate
install -D -m 644 netmate.1 $(DESTDIR)/$(MANDIR)/man1/netmate.1
install -D -m 644 res/netmate.desktop $(DESTDIR)/$(APPDIR)/netmate.desktop
install -D -m 644 res/netmate.xpm $(DESTDIR)/$(ICODIR)/netmate.xpm
uninstall:
rm -f $(DESTDIR)/$(BINDIR)/netmate
rm -f $(DESTDIR)/$(MANDIR)/man1/netmate.1
rm -f $(DESTDIR)/$(APPDIR)/netmate.desktop
rm -f $(DESTDIR)/$(ICODIR)/netmate.xpm
clean:
rm -f *.o netmate
netmate-0.2.0/README 0000664 0000000 0000000 00000003263 12242060236 0014027 0 ustar 00root root 0000000 0000000 netmate v0.2.0 README
*********************
Netmate is a GTK+ program that shows network protocols headers in 32-bit
aligned fields, identical as they are represented in Request for Comments
(RFCs). It can be used to learn and teach about network protocols and to
understand their functionality and collaboration.
This tool supports input files in pcap(ng) format as they are created by
tcpdump, wireshark or other code based on libpcap.
Netmate is written in C and released under the GNU General Public License.
It was inspired by netdude, that is not further developed any more.
Currently the following network protocols are supported:
- Layer 2: Ethernet, SLL (Linux Cooked)
- Layer 3: ARP, ICMP, ICMPv6, IPv4, IPv6
- Layer 4: TCP, UDP
This tool is still under development! Please send any further wishes, feature
requests or problems in compiling and execution to ruport@f00l.de. Also send
me any more network protocols you want to be supported in future releases.
For further information visit the netmate homepage at http://f00l.de/netmate/.
USAGE
=====
./netmate filename
COPYRIGHT
=========
Copyright 2013 Robert Krause
Netmate 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 3 of the License, or any later version.
Netmate 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
Netmate. If not, see http://www.gnu.org/licenses/.
netmate-0.2.0/layer2.h 0000664 0000000 0000000 00000026050 12242060236 0014515 0 ustar 00root root 0000000 0000000 /*******************************************************************************
*
* Copyright (c) 2013 Robert Krause (ruport@f00l.de)
*
* This file is part of Netmate.
*
* Netmate 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 3 of the License, or any later version.
*
* Netmate 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
* Netmate. If not, see http://www.gnu.org/licenses/.
*
******************************************************************************/
/******************************************************************************/
/* netmate layer2 protocols */
/******************************************************************************/
char *hardwaretype(unsigned short id);
char *ethertype(unsigned short id);
GtkGrid *ethernet_grid(struct ether_header *eth); /* ethernet */
GtkGrid *sll_grid(struct sll_header *sll); /* ssl (linux cooked) */
/******************************************************************************/
/* taken from http://www.tcpdump.org/linktypes.html */
char *hardwaretype(unsigned short id) {
switch (id) {
case 0:
return("NULL");
case 1:
return("ETHERNET");
case 3:
return("AX25");
case 6:
return("IEEE802_5");
case 7:
return("ARCNET_BSD");
case 8:
return("SLIP");
case 9:
return("PPP");
case 10:
return("FDDI");
case 50:
return("PPP_HDLC");
case 51:
return("PPP_ETHER");
case 100:
return("ATM_RFC1483");
case 101:
return("RAW");
case 104:
return("C_HDLC");
case 105:
return("IEEE802_11");
case 107:
return("FRELAY");
case 108:
return("LOOP");
case 113:
return("LINUX_SLL");
case 114:
return("LTALK");
case 117:
return("PFLOG");
case 119:
return("IEEE802_11_PRISM");
case 122:
return("IP_OVER_FC");
case 123:
return("SUNATM");
case 127:
return("IEEE802_11_RADIOTAP");
case 129:
return("ARCNET_LINUX");
case 138:
return("APPLE_IP_OVER_IEEE1394");
case 139:
return("MTP2_WITH_PHDR");
case 140:
return("MTP2");
case 141:
return("MTP3");
case 142:
return("SCCP");
case 143:
return("DOCSIS");
case 144:
return("LINUX_IRDA");
case 163:
return("IEEE802_11_AVS");
case 165:
return("BACNET_MS_TP");
case 166:
return("PPP_PPPD");
case 169:
return("GPRS_LLC");
case 177:
return("LINUX_LAPD");
case 187:
return("BLUETOOTH_HCI_H4");
case 189:
return("USB_LINUX");
case 192:
return("PPI");
case 195:
return("IEEE802_15_4");
case 196:
return("SITA");
case 197:
return("ERF");
case 201:
return("BLUETOOTH_HCI_H4_WITH_PHDR");
case 202:
return("AX25_KISS");
case 203:
return("LAPD");
case 204:
return("PPP_WITH_DIR");
case 205:
return("C_HDLC_WITH_DIR");
case 206:
return("FRELAY_WITH_DIR");
case 209:
return("IPMB_LINUX");
case 215:
return("IEEE802_15_4_NONASK_PHY");
case 220:
return("USB_LINUX_MMAPPED");
case 224:
return("FC_2");
case 225:
return("FC_2_WITH_FRAME_DELIMS");
case 226:
return("IPNET");
case 227:
return("CAN_SOCKETCAN");
case 228:
return("IPV4");
case 229:
return("IPV6");
case 230:
return("IEEE802_15_4_NOFCS");
case 231:
return("DBUS");
case 235:
return("DVB_CI");
case 236:
return("MUX27010");
case 237:
return("STANAG_5066_D_PDU");
case 239:
return("NFLOG");
case 240:
return("NETANALYZER");
case 241:
return("NETANALYZER_TRANSPARENT");
case 242:
return("IPOIB");
case 243:
return("MPEG_2_TS");
case 244:
return("NG40");
case 245:
return("NFC_LLCP");
case 247:
return("INFINIBAND");
case 248:
return("SCTP");
case 249:
return("USBPCAP");
case 250:
return("RTAC_SERIAL");
case 251:
return("BLUETOOTH_LE_LL");
}
return("UNKNOWN");
}
/* taken from http://en.wikipedia.org/wiki/EtherType */
char *ethertype(unsigned short id) {
switch (id) {
case 0x0800:
return("IPv4");
case 0x0806:
return("ARP");
case 0x0842:
return("Wake-on-LAN");
case 0x22F3:
return("IETF TRILL Protocol");
case 0x6003:
return("DECnet Phase IV");
case 0x8035:
return("RARP");
case 0x809B:
return("AppleTalk (Ethertalk)");
case 0x80F3:
return("AARP");
case 0x8100:
return("VLAN-tagged frame (IEEE 802.1Q)");
case 0x8137:
return("IPX");
case 0x8138:
return("IPX");
case 0x8204:
return("QNX Qnet");
case 0x86DD:
return("IPv6");
case 0x8808:
return("Ethernet flow control");
case 0x8809:
return("Slow Protocols (IEEE 802.3)");
case 0x8819:
return("CobraNet");
case 0x8847:
return("MPLS unicast");
case 0x8848:
return("MPLS multicast");
case 0x8863:
return("PPPoE Discovery Stage");
case 0x8864:
return("PPPoE Session Stage");
case 0x8870:
return("Jumbo Frames");
case 0x887B:
return("HomePlug 1.0 MME");
case 0x888E:
return("EAP over LAN (IEEE 802.1X)");
case 0x8892:
return("PROFINET Protocol");
case 0x889A:
return("HyperSCSI");
case 0x88A2:
return("ATA over Ethernet");
case 0x88A4:
return("EtherCAT Protocol");
case 0x88A8:
return("Provider Bridging (IEEE 802.1ad)");
case 0x88AB:
return("Ethernet Powerlink");
case 0x88CC:
return("LLDP");
case 0x88CD:
return("SERCOS III");
case 0x88E1:
return("HomePlug AV MME");
case 0x88E3:
return("Media Redundancy Protocol (IEC62439-2)");
case 0x88E5:
return("MAC security (IEEE 802.1AE)");
case 0x88F7:
return("Precision Time Protocol (IEEE 1588)");
case 0x8902:
return("IEEE 802.1ag Connectivity Fault Management (CFM) Protocol");
case 0x8906:
return("Fibre Channel over Ethernet (FCoE)");
case 0x8914:
return("FCoE Initialization Protocol");
case 0x8915:
return("RDMA over Converged Ethernet (RoCE)");
case 0x892F:
return("High-availability Seamless Redundancy (HSR)");
case 0x9000:
return("Ethernet Configuration Testing Protocol");
case 0x9100:
return("Q-in-Q");
case 0xCAFE:
return("Veritas Low Latency Transport (LLT)");
}
return("UNKNOWN");
}
GtkGrid *sll_grid(struct sll_header *sll) {
GtkGrid *grid; /* the grid itself */
int x, y; /* position of next empty grid cell */
char *label; /* label of buttons to set */
/* init a new empty grid */
grid = GTK_GRID(gtk_grid_new());
/* set columns to be uniform sized (for better bit size representation) */
gtk_grid_set_column_homogeneous(grid, TRUE);
/* allocate memory for button label */
label = malloc(100);
/* build bit indication topic line (0 1 2 .. 31) */
for (x=0; x<32; x++) {
sprintf(label, "%u", x);
gtk_grid_attach(grid, gtk_label_new(label), x, 0, 1, 1);
}
/* set cell pointer to next empty grid cell */
x=0;
y=1;
/* Packet Type */
switch (htons(sll->sll_pkttype)) {
case 0:
sprintf(label, "Packet Type: %u (%s)", htons(sll->sll_pkttype), "Sent to us (unicast)");
break;
case 1:
sprintf(label, "Packet Type: %u (%s)", htons(sll->sll_pkttype), "Sent to us (broadcast)");
break;
case 2:
sprintf(label, "Packet Type: %u (%s)", htons(sll->sll_pkttype), "Sent to us (multicast)");
break;
case 3:
sprintf(label, "Packet Type: %u (%s)", htons(sll->sll_pkttype), "Sent to someone else (unicast)");
break;
case 4:
sprintf(label, "Packet Type: %u (%s)", htons(sll->sll_pkttype), "Sent by us");
break;
default:
sprintf(label, "Packet Type: %u (%s)", htons(sll->sll_pkttype), "UNKNOWN");
}
append_field(grid, &x, &y, sizeof(sll->sll_pkttype)*8, label, SLL_PACKET_TYPE);
/* ARP Header Type */
sprintf(label, "ARPHRD_ Type: %u (%s)", htons(sll->sll_hatype), hardwaretype(htons(sll->sll_hatype)));
append_field(grid, &x, &y, sizeof(sll->sll_hatype)*8, label, SLL_ARPHRD_TYPE);
/* Link-layer Address Length */
sprintf(label, "Link-layer Address Length: %u", htons(sll->sll_halen));
append_field(grid, &x, &y, sizeof(sll->sll_halen)*8, label, SLL_LLA_LENGTH);
/* Link-layer Address */
sprintf(label, "Link-layer Address: %02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x", sll->sll_addr[0], sll->sll_addr[1], sll->sll_addr[2], sll->sll_addr[3], sll->sll_addr[4], sll->sll_addr[5], sll->sll_addr[6], sll->sll_addr[7]);
append_field(grid, &x, &y, sizeof(sll->sll_addr)*8, label, SLL_LLA);
/* Upper Layer Protocol */
sprintf(label, "Protocol Type: 0x%04x (%s)", htons(sll->sll_protocol), ethertype(htons(sll->sll_protocol)));
append_field(grid, &x, &y, sizeof(sll->sll_protocol)*8, label, SLL_PROTOCOL);
/* free memory of label */
free(label);
/* show ethernet grid (tab) */
gtk_widget_show_all(GTK_WIDGET(grid));
/* return grid to tab builder */
return(grid);
}
GtkGrid *ethernet_grid(struct ether_header *eth) {
GtkGrid *grid; /* the grid itself */
int x, y; /* position pointer to next empty grid cell */
char *label; /* label of buttons to set */
/* init new empty grid */
grid = GTK_GRID(gtk_grid_new());
/* set columns to be uniform sized (for better bit size representation) */
gtk_grid_set_column_homogeneous(grid, TRUE);
/* allocate memory for button label */
label = malloc(100);
/* build bit indication topic line (0 1 2 .. 31) */
for (x=0; x<32; x++) {
sprintf(label, "%u", x);
gtk_grid_attach(grid, gtk_label_new(label), x, 0, 1, 1);
}
/* set cell pointer to next empty grid cell */
x=0;
y=1;
/* destination mac */
sprintf(label, "Destination: %02x:%02x:%02x:%02x:%02x:%02x", eth->ether_dhost[0], eth->ether_dhost[1], eth->ether_dhost[2], eth->ether_dhost[3], eth->ether_dhost[4], eth->ether_dhost[5]);
append_field(grid, &x, &y, sizeof(eth->ether_dhost)*8, label, ETHERNET_DESTINATION);
/* source mac */
sprintf(label, "Source: %02x:%02x:%02x:%02x:%02x:%02x", eth->ether_shost[0], eth->ether_shost[1], eth->ether_shost[2], eth->ether_shost[3], eth->ether_shost[4], eth->ether_shost[5]);
append_field(grid, &x, &y, sizeof(eth->ether_shost)*8, label, ETHERNET_DESTINATION);
/* upper layer protocol */
sprintf(label, "Type: 0x%04x (%s)", htons(eth->ether_type), ethertype(htons(eth->ether_type)));
append_field(grid, &x, &y, sizeof(eth->ether_type)*8, label, ETHERNET_TYPE);
/* free memory of label */
free(label);
/* show ethernet grid (tab) */
gtk_widget_show_all(GTK_WIDGET(grid));
/* return grid to tab builder */
return(grid);
}
netmate-0.2.0/layer3.h 0000664 0000000 0000000 00000135116 12242060236 0014522 0 ustar 00root root 0000000 0000000 /*******************************************************************************
*
* Copyright (c) 2013 Robert Krause (ruport@f00l.de)
*
* This file is part of Netmate.
*
* Netmate 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 3 of the License, or any later version.
*
* Netmate 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
* Netmate. If not, see http://www.gnu.org/licenses/.
*
******************************************************************************/
/******************************************************************************/
/* netmate layer3 protocols */
/******************************************************************************/
char *ipprotocol(unsigned char id);
char *ipv4_optclass(unsigned char id);
char *ipv4_optnumber(unsigned char id);
char *ipv4_optdata(unsigned char number, char *optdata);
char *ipv6_hopopt_type(unsigned char id);
char *arp_operation(unsigned char id);
char *icmp_type(unsigned char id);
char *icmp_code(unsigned char type, unsigned char code);
char *icmpv6_type(unsigned char id);
char *icmpv6_code(unsigned char type, unsigned char code);
char *icmpv6_opttype(unsigned char id);
GtkGrid *ipv4_grid(struct iphdr *ipv4, u_char *options); /* ipv4 (type 0x0800) */
GtkGrid *ipv6_grid(struct ip6_hdr *ipv6, u_char *options); /* ipv6 (type 0x08dd) */
GtkGrid *arp_grid(struct arphdr *arp, u_char *options); /* arp (type 0x0806) */
GtkGrid *icmp_grid(struct icmphdr *icmp, u_char *options, int left); /* icmp */
GtkGrid *icmpv6_grid(struct icmp6_hdr *icmpv6, u_char *options, int left); /* icmp */
/******************************************************************************/
/* taken from http://en.wikipedia.org/wiki/List_of_IP_protocol_numbers */
char *ipprotocol(unsigned char id) {
switch (id) {
case 0:
return("HOPOPT");
case 1:
return("ICMP");
case 2:
return("IGMP");
case 3:
return("GGP");
case 4:
return("IPv4");
case 5:
return("ST");
case 6:
return("TCP");
case 7:
return("CBT");
case 8:
return("EGP");
case 9:
return("IGP");
case 10:
return("BBN-RCC-MON");
case 11:
return("NVP-II");
case 12:
return("PUP");
case 13:
return("ARGUS");
case 14:
return("EMCON");
case 15:
return("XNET");
case 16:
return("CHAOS");
case 17:
return("UDP");
case 18:
return("MUX");
case 19:
return("DCN-MEAS");
case 20:
return("HMP");
case 21:
return("PRM");
case 22:
return("XNS-IDP");
case 23:
return("TRUNK-1");
case 24:
return("TRUNK-2");
case 25:
return("LEAF-1");
case 26:
return("LEAF-2");
case 27:
return("RDP");
case 28:
return("IRTP");
case 29:
return("ISO-TP4");
case 30:
return("NETBLT");
case 31:
return("MFE-NSP");
case 32:
return("MERIT-INP");
case 33:
return("DCCP");
case 34:
return("3PC");
case 35:
return("IDPR");
case 36:
return("XTP");
case 37:
return("DDP");
case 38:
return("IDPR-CMTP");
case 39:
return("TP++");
case 40:
return("IL");
case 41:
return("IPv6");
case 42:
return("SDRP");
case 43:
return("IPv6-Route");
case 44:
return("IPv6-Frag");
case 45:
return("IDRP");
case 46:
return("RSVP");
case 47:
return("GRE");
case 48:
return("MHRP");
case 49:
return("BNA");
case 50:
return("ESP");
case 51:
return("AH");
case 52:
return("I-NLSP");
case 53:
return("SWIPE");
case 54:
return("NARP");
case 55:
return("MOBILE");
case 56:
return("TLSP");
case 57:
return("SKIP");
case 58:
return("IPv6-ICMP");
case 59:
return("IPv6-NoNxt");
case 60:
return("IPv6-Opts");
case 61:
return("Any host internal protocol");
case 62:
return("CFTP");
case 63:
return("Any local network");
case 64:
return("SAT-EXPAK");
case 65:
return("KRYPTOLAN");
case 66:
return("RVD");
case 67:
return("IPPC");
case 68:
return("Any distributed file system");
case 69:
return("SAT-MON");
case 70:
return("VISA");
case 71:
return("IPCV");
case 72:
return("CPNX");
case 73:
return("CPHB");
case 74:
return("WSN");
case 75:
return("PVP");
case 76:
return("BR-SAT-MON");
case 77:
return("SUN-ND");
case 78:
return("WB-MON");
case 79:
return("WB-EXPAK");
case 80:
return("ISO-IP");
case 81:
return("VMTP");
case 82:
return("SECURE-VMTP");
case 83:
return("VINES");
case 84:
return("TTP");
case 85:
return("NSFNET-IGP");
case 86:
return("DGP");
case 87:
return("TCF");
case 88:
return("EIGRP");
case 89:
return("OSPF");
case 90:
return("Sprite-RPC");
case 91:
return("LARP");
case 92:
return("MTP");
case 93:
return("AX.25");
case 94:
return("IPIP");
case 95:
return("MICP");
case 96:
return("SCC-SP");
case 97:
return("ETHERIP");
case 98:
return("ENCAP");
case 99:
return("Any private encryption scheme");
case 100:
return("GMTP");
case 101:
return("IFMP");
case 102:
return("PNNI");
case 103:
return("PIM");
case 104:
return("ARIS");
case 105:
return("SCPS");
case 106:
return("QNX");
case 107:
return("A/N");
case 108:
return("IPComp");
case 109:
return("SNP");
case 110:
return("Compaq-Peer");
case 111:
return("IPX-in-IP");
case 112:
return("VRRP");
case 113:
return("PGM");
case 114:
return("Any 0-hop protocol");
case 115:
return("L2TP");
case 116:
return("DDX");
case 117:
return("IATP");
case 118:
return("STP");
case 119:
return("SRP");
case 120:
return("UTI");
case 121:
return("SMP");
case 122:
return("SM");
case 123:
return("PTP");
case 124:
return("IS-IS over IPv4");
case 125:
return("FIRE");
case 126:
return("CRTP");
case 127:
return("CRUDP");
case 128:
return("SSCOPMCE");
case 129:
return("IPLT");
case 130:
return("SPS");
case 131:
return("PIPE");
case 132:
return("SCTP");
case 133:
return("FC");
case 134:
return("RSVP-E2E-IGNORE");
case 135:
return("Mobility Header");
case 136:
return("UDPLite");
case 137:
return("MPLS-in-IP");
case 138:
return("manet");
case 139:
return("HIP");
case 140:
return("Shim6");
case 141:
return("WESP");
case 142:
return("ROHC");
case 253:
return("experimentation and testing");
case 254:
return("experimentation and testing");
case 255:
return("Reserved");
}
return("UNKNOWN");
}
char *ipv4_optclass(unsigned char id) {
switch (id) {
case 0:
return("ctrl");
case 1:
return("res");
case 2:
return("debug");
case 3:
return("res");
}
return("UNKNOWN");
}
char *ipv4_optnumber(unsigned char id) {
switch (id) {
case 0:
return("EOOL");
case 1:
return("NOP");
case 2:
return("SEC");
case 3:
return("LSR");
case 4:
return("TS");
case 5:
return("E-SEC");
case 6:
return("CIPSO");
case 7:
return("RR");
case 8:
return("SID");
case 9:
return("SSR");
case 10:
return("ZSU");
case 11:
return("MTUP");
case 12:
return("MTUR");
case 13:
return("FINN");
case 14:
return("VISA");
case 15:
return("ENCODE");
case 16:
return("IMITD");
case 17:
return("EIP");
case 18:
return("TR");
case 19:
return("ADDEXT");
case 20:
return("RTRALT");
case 21:
return("SDB");
case 23:
return("DPS");
case 24:
return("UMP");
case 25:
return("QS");
case 30:
return("EXP");
}
return("UNKNOWN");
}
char *ipv6_hopopt_type(unsigned char id) {
switch (id) {
case 0x00:
return("Pad1");
case 0x01:
return("PadN");
case 0xc2:
return("Jumbo Payload");
case 0x63:
return("RPL Option");
case 0x04:
return("Tunnel Encapsulation Limit");
case 0x05:
return("Router Alert");
case 0x26:
return("Quick-Start");
case 0x07:
return("CALIPSO");
case 0x08:
return("SMF_DPD");
case 0xc9:
return("Home Address");
case 0x8a:
return("Endpoint Identification");
case 0x8b:
return("ILNP Nonce");
case 0x8c:
return("Line-Identification Option");
case 0x4d:
return("Deprecated");
case 0x6d:
return("MPL Option");
case 0xee:
return("IP_DFF");
case 0x1e:
case 0x3e:
case 0x5e:
case 0x7e:
case 0x9e:
case 0xbe:
case 0xde:
case 0xfe:
return("RFC3692-style Experiment");
}
return("UNKNOWN");
}
char *ipv4_optdata(unsigned char number, char *optdata) {
switch (number) {
/* 0 and 1 do not have option data */
case 20:
if (strcmp(optdata, "0000") == 0) return("Router shall examine packet");
return("Reserved");
}
return("UNKNOWN");
}
char *arp_operation(unsigned char id) {
switch (id) {
case 1:
return("request");
case 2:
return("reply");
}
return("UNKNOWN");
}
char *icmp_type(unsigned char id) {
switch (id) {
case 0:
return("Echo Reply");
case 3:
return("Destination Unreachable");
case 4:
return("Source Quench");
case 5:
return("Redirect");
case 6:
return("Alternate Host Address)");
case 8:
return("Echo");
case 9:
return("Router Advertisement");
case 10:
return("Router Selection");
case 11:
return("Time Exceeded");
case 12:
return("Parameter Problem");
case 13:
return("Timestamp");
case 14:
return("Timestamp Reply");
case 15:
return("Information Request");
case 16:
return("Information Reply");
case 17:
return("Address Mask Request");
case 18:
return("Address Mask Reply");
case 30:
return("Traceroute");
case 31:
return("Datagram Conversion Error");
case 32:
return("Mobile Host Redirect");
case 33:
return("IPv6 Where-Are-You");
case 34:
return("IPv6 I-Am-Here");
case 35:
return("Mobile Registration Request");
case 36:
return("Mobile Registration Reply");
case 37:
return("Domain Name Request");
case 38:
return("Domain Name Reply");
case 39:
return("SKIP");
case 40:
return("Photuris");
}
return("UNKNOWN");
}
char *icmp_code(unsigned char type, unsigned char code) {
switch (type) {
case 0:
case 4:
case 8:
case 10:
case 13:
case 14:
case 15:
case 16:
case 17:
case 18:
if (code == 0) return("No code");
break;
case 3:
switch (code) {
case 0:
return("Net Unreachable");
case 1:
return("Host Unreachable");
case 2:
return("Protocol Unreachable");
case 3:
return("Port Unreachable");
case 4:
return("Fragmentation Needed and Don't Fragment was Set");
case 5:
return("Source Route Failed");
case 6:
return("Destination Network Unknown");
case 7:
return("Destination Host Unknown");
case 8:
return("Source Host Isolated");
case 9:
return("Communication with Destination Network is Administratively Prohibited");
case 10:
return("Communication with Destination Host is Administratively Prohibited");
case 11:
return("Destination Network Unreachable for Type of Service");
case 12:
return("Destination Host Unreachable for Type of Service");
case 13:
return("Communication Administratively Prohibited");
case 14:
return("Host Precedence Violation");
case 15:
return("Precedence cutoff in effect");
}
break;
case 5:
switch (code) {
case 0:
return("Redirect Datagram for the Network (or subnet)");
case 1:
return("Redirect Datagram for the Host");
case 2:
return("Redirect Datagram for the Type of Service and Network");
case 3:
return("Redirect Datagram for the Type of Service and Host");
}
break;
case 6:
if (code == 0) return("Alternate Address for Host");
break;
case 9:
if (code == 0) return("Normal router advertisement");
if (code == 16) return("Does not route common traffic");
break;
case 11:
if (code == 0) return("Time to Live exceeded in Transit");
if (code == 1) return("Fragment Reassembly Time Exceeded");
break;
case 12:
if (code == 0) return("Pointer indicates the error");
if (code == 1) return("Missing a Required Option");
if (code == 2) return("Bad Length");
break;
case 40:
switch (code) {
case 0:
return("Bad SPI");
case 1:
return("Authentication Failed");
case 2:
return("Decompression Failed");
case 3:
return("Decryption Failed");
case 4:
return("Need Authentication");
case 5:
return("Need Authorization");
}
break;
}
return("UNKNOWN");
}
char *icmpv6_type(unsigned char id) {
switch (id) {
case 0:
return("Reserved");
case 1:
return("Destination Unreachable");
case 2:
return("Packet Too Big");
case 3:
return("Time Exceeded");
case 4:
return("Parameter Problem");
case 100:
case 101:
case 200:
case 201:
return("Private experimentation");
case 127:
return("Reserved for expansion of ICMPv6 error messages");
case 128:
return("Echo Request");
case 129:
return("Echo Reply");
case 130:
return("Multicast Listener Query");
case 131:
return("Multicast Listener Report");
case 132:
return("Multicast Listener Done");
case 133:
return("Router Solicitation");
case 134:
return("Router Advertisement");
case 135:
return("Neighbor Solicitation");
case 136:
return("Neighbor Advertisement");
case 137:
return("Redirect Message");
case 138:
return("Router Renumbering");
case 139:
return("ICMP Node Information Query");
case 140:
return("ICMP Node Information Response");
case 141:
return("Inverse Neighbor Discovery Solicitation Message");
case 142:
return("Inverse Neighbor Discovery Advertisement Message");
case 143:
return("Version 2 Multicast Listener Report");
case 144:
return("Home Agent Address Discovery Request Message");
case 145:
return("Home Agent Address Discovery Reply Message");
case 146:
return("Mobile Prefix Solicitation");
case 147:
return("Mobile Prefix Advertisement");
case 148:
return("Certification Path Solicitation Message");
case 149:
return("Certification Path Advertisement Message");
case 150:
return("ICMP messages utilized by experimental mobility protocols");
case 151:
return("Multicast Router Advertisement");
case 152:
return("Multicast Router Solicitation");
case 153:
return("Multicast Router Termination");
case 154:
return("FMIPv6 Messages");
case 155:
return("RPL Control Message");
case 156:
return("ILNPv6 Locator Update Message");
case 157:
return("Duplicate Address Request");
case 158:
return("Duplicate Address Confirmation");
case 255:
return("Reserved for expansion of ICMPv6 informational messages");
}
return("UNKNOWN");
}
char *icmpv6_code(unsigned char type, unsigned char code) {
switch (type) {
case 0:
case 2:
case 128:
case 129:
case 130:
case 131:
case 132:
case 133:
case 134:
case 135:
case 136:
case 137:
case 141:
case 142:
case 143:
case 144:
case 145:
case 146:
case 147:
if (code == 0) return("No code");
break;
case 1:
switch (code) {
case 0:
return("no route to destination");
case 1:
return("communication with destination administratively prohibited");
case 2:
return("beyond scope of source address");
case 3:
return("address unreachable");
case 4:
return("port unreachable");
case 5:
return("source address failed ingress/egress policy");
case 6:
return("reject route to destination");
case 7:
return("error in source routing header");
}
break;
case 3:
if (code == 0) return("hop limit exceeded in transit");
if (code == 1) return("fragment reassembly time exceeded");
break;
case 4:
if (code == 0) return("erroneous header field encountered");
if (code == 1) return("unrecognized Next Header type encountered");
if (code == 2) return("unrecognized IPv6 option encountered");
break;
case 138:
if (code == 0) return("Router Renumbering Command");
if (code == 1) return("Router Renumbering Result");
if (code == 255) return("Sequence Number Reset");
break;
case 139:
if (code == 0) return("The Data field contains an IPv6 address which is the Subject of this Query.");
if (code == 1) return("The Data field contains a name which is the Subject of this Query, or is empty, as in the case of a NOOP.");
if (code == 2) return("The Data field contains an IPv4 address which is the Subject of this Query.");
break;
case 140:
if (code == 0) return("A successful reply. The Reply Data field may or may not be empty.");
if (code == 1) return("The Responder refuses to supply the answer. The Reply Data field will be empty.");
if (code == 2) return("The Qtype of the Query is unknown to the Responder. The Reply Data field will be empty.");
break;
case 154:
switch (code) {
case 0:
case 1:
return("Reserved");
case 2:
return("RtSolPr");
case 3:
return("PrRtAdv");
case 4:
return("HI - Deprecated");
case 5:
return("HAck - Deprecated");
}
break;
}
return("UNKNOWN");
}
char *icmpv6_opttype(unsigned char id) {
switch (id) {
case 1:
return("Source Link-Layer Address");
case 2:
return("Target Link-Layer Address");
case 3:
return("Prefix Information");
case 4:
return("Redirected Header");
case 5:
return("MTU");
}
return("UNKNOWN");
}
GtkGrid *ipv4_grid(struct iphdr *ipv4, u_char *options) {
GtkGrid *grid; /* the grid itself */
char *label; /* label of buttons to set */
char ipv4_dscp; /* ip dscp field */
char ipv4_ecn; /* ip ecn field */
char *optdata; /* option data */
short ipv4_offset; /* ip fragment offset */
int x,y; /* position pointer to next empty grid cell */
int left; /* bytes left for ipv4 options */
int optlen; /* length of options field */
int opttype; /* option type */
int i; /* loop counter for raw data representation */
/* init new empty grid */
grid = GTK_GRID(gtk_grid_new());
/* set columns to be uniform sized (for better bit size representation) */
gtk_grid_set_column_homogeneous(grid, TRUE);
/* allocate memory for button label */
label = malloc(100);
/* build bit indication topic line (0 1 2 .. 31) */
for (x=0; x<32; x++) {
sprintf(label, "%u", x);
gtk_grid_attach(grid, gtk_label_new(label), x, 0, 1, 1);
}
/* set cell pointer to next empty grid cell */
x=0;
y=1;
/* read and set ip version field */
sprintf(label, "Version: %u", ipv4->version);
append_field(grid, &x, &y, 4, label, IPV4_VERSION);
/* read and set ip header length (<< 2 to calculate real size) */
sprintf(label, "IHL: %u (%u bytes)", ipv4->ihl, ipv4->ihl*4);
append_field(grid, &x, &y, 4, label, IPV4_IHL);
/* read and set ip dscp field */
ipv4_dscp = ipv4->tos >> 2;
sprintf(label, "DSCP: 0x%02x", ipv4_dscp);
append_field(grid, &x, &y, 6, label, IPV4_DCSP);
/* read and set ip ecn field */
ipv4_ecn = ipv4->tos & 0x03;
sprintf(label, "ECN:\n0x%02x", ipv4_ecn);
append_field(grid, &x, &y, 2, label, IPV4_ECN);
/* read and set total length of ip header */
sprintf(label, "Total Length: %u", htons(ipv4->tot_len));
append_field(grid, &x, &y, sizeof(ipv4->tot_len)*8, label, IPV4_TOTLEN);
/* read and set identification field of ip packet */
sprintf(label, "Identification: 0x%04x", htons(ipv4->id));
append_field(grid, &x, &y, sizeof(ipv4->id)*8, label, IPV4_IDENTIFICATION);
/* reserved flag */
if (ipv4->frag_off & htons(IP_RF)) {
append_field(grid, &x, &y, 1, "RF", IPV4_FLAG_RESERVED);
} else {
append_field(grid, &x, &y, 1, "rf", IPV4_FLAG_RESERVED);
}
/* dont fragment flag */
if (ipv4->frag_off & htons(IP_DF)) {
append_field(grid, &x, &y, 1, "DF", IPV4_FLAG_DF);
} else {
append_field(grid, &x, &y, 1, "df", IPV4_FLAG_DF);
}
/* more fragments flag */
if (ipv4->frag_off & htons(IP_MF)) {
append_field(grid, &x, &y, 1, "MF", IPV4_FLAG_MF);
} else {
append_field(grid, &x, &y, 1, "mf", IPV4_FLAG_MF);
}
/* read and set ip fragmentation offset (<< 3 to calculate real size); */
ipv4_offset = (htons(ipv4->frag_off) & IP_OFFMASK);
sprintf(label, "Fragment Offset: %u (%u bytes)", ipv4_offset, ipv4_offset << 3);
append_field(grid, &x, &y, 13, label, IPV4_FRAGOFF);
/* read and set time to live of ip packet */
sprintf(label, "Time To Live: %u", ipv4->ttl);
append_field(grid, &x, &y, sizeof(ipv4->ttl)*8, label, IPV4_TTL);
/* read an d set upper layer protocol */
sprintf(label, "Protocol: %u (%s)", ipv4->protocol, ipprotocol(ipv4->protocol));
append_field(grid, &x, &y, sizeof(ipv4->protocol)*8, label, IPV4_PROTOCOL);
/* read and set ip header checksum */
sprintf(label, "Header checksum: 0x%04x", htons(ipv4->check));
append_field(grid, &x, &y, sizeof(ipv4->check)*8, label, IPV4_CHECKSUM);
/* read and set ip source address */
sprintf(label, "Source IP Address: %u.%u.%u.%u", ipv4->saddr & 0xff, (ipv4->saddr >> 8) & 0xff, (ipv4->saddr >> 16) & 0xff, (ipv4->saddr >> 24) & 0xff);
append_field(grid, &x, &y, sizeof(ipv4->saddr)*8, label, IPV4_SOURCE);
/* read and set ip destination address */
sprintf(label, "Destination IP Address: %u.%u.%u.%u", ipv4->daddr & 0xff, (ipv4->daddr >> 8) & 0xff, (ipv4->daddr >> 16) & 0xff, (ipv4->daddr >> 24) & 0xff);
append_field(grid, &x, &y, sizeof(ipv4->daddr)*8, label, IPV4_DESTINATION);
/* count bytes of option fields */
left = (ipv4->ihl-0x05)*4;
/* progress bytes until no option bytes left */
while (left > 0) {
/* get option type (first byte) */
opttype = options[0];
/* copy bit (bit 1) */
if (opttype & IPOPT_COPY) {
append_field(grid, &x, &y, 1, "C", IPV4_OPTION_FLAG_COPIED);
} else {
append_field(grid, &x, &y, 1, "c", IPV4_OPTION_FLAG_COPIED);
}
/* option class (bit 2 & 3) */
sprintf(label, "Class: %u (%s)", opttype & IPOPT_CLASS_MASK, ipv4_optclass(opttype & IPOPT_CLASS_MASK));
append_field(grid, &x, &y, 2, label, IPV4_OPTION_CLASS);
/* option number (bit 4-8) */
sprintf(label, "Number: %u (%s)", opttype & IPOPT_NUMBER_MASK, ipv4_optnumber(opttype & IPOPT_NUMBER_MASK));
append_field(grid, &x, &y, 5, label, IPV4_OPTION_NUMBER);
/* end of options AND no operation do not have further fields */
if (((opttype & IPOPT_NUMBER_MASK) == 0) || ((opttype & IPOPT_NUMBER_MASK) == 1)) continue;
/* options length (INCLUDING type & length fields) */
optlen = options[1];
sprintf(label, "Length: %u", optlen);
append_field(grid, &x, &y, 8, label, IPV4_OPTION_LENGTH);
/* allocate memory for option data (*2 because of hex representation) */
optdata = malloc(optlen*2);
/* print bytes in hex format into array */
for (i=0; iip6_ctlun.ip6_un1.ip6_un1_flow) >> 28;
sprintf(label, "Version: %u", ipv6_version);
append_field(grid, &x, &y, 4, label, IPV6_VERSION);
/* traffic class */
ipv6_tc = htonl(ipv6->ip6_ctlun.ip6_un1.ip6_un1_flow) >> 20 & 0x00ff;
sprintf(label, "Traffic Class: 0x%02x", ipv6_tc);
append_field(grid, &x, &y, 8, label, IPV6_TC);
/* flow label */
ipv6_fl = htonl(ipv6->ip6_ctlun.ip6_un1.ip6_un1_flow) & 0x000fffff;
sprintf(label, "Flow Label: 0x%06x", ipv6_fl);
append_field(grid, &x, &y, 20, label, IPV6_FLOW);
/* payload length */
sprintf(label, "Payload Length: %u", htons(ipv6->ip6_ctlun.ip6_un1.ip6_un1_plen));
append_field(grid, &x, &y, sizeof(ipv6->ip6_ctlun.ip6_un1.ip6_un1_plen)*8, label, IPV6_PAYLEN);
/* next header */
ipv6_nh = ipv6->ip6_ctlun.ip6_un1.ip6_un1_nxt;
sprintf(label, "Next Header: %u (%s)", ipv6_nh, ipprotocol(ipv6_nh));
append_field(grid, &x, &y, sizeof(ipv6->ip6_ctlun.ip6_un1.ip6_un1_nxt)*8, label, IPV6_NEXT_HEADER);
/* hop limit */
sprintf(label, "Hop Limit: %u", ipv6->ip6_ctlun.ip6_un1.ip6_un1_hlim);
append_field(grid, &x, &y, sizeof(ipv6->ip6_ctlun.ip6_un1.ip6_un1_hlim)*8, label, IPV6_HOP_LIMIT);
/* source address */
sprintf(label, "Source Address: %04x:%04x:%04x:%04x:%04x:%04x:%04x:%04x", htons(ipv6->ip6_src.__in6_u.__u6_addr16[0]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[1]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[2]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[3]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[4]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[5]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[6]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[7]));
append_field(grid, &x, &y, 128, label, IPV6_SOURCE);
/* destination address */
sprintf(label, "Destination Address: %04x:%04x:%04x:%04x:%04x:%04x:%04x:%04x", htons(ipv6->ip6_dst.__in6_u.__u6_addr16[0]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[1]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[2]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[3]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[4]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[5]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[6]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[7]));
append_field(grid, &x, &y, 128, label, IPV6_DESTINATION);
while (ipv6_nh == IPPROTO_HOPOPTS) {
/* next header */
ipv6_nh = options[0];
sprintf(label, "Next Header: %u (%s)", ipv6_nh, ipprotocol(ipv6_nh));
append_field(grid, &x, &y, sizeof(ipv6->ip6_ctlun.ip6_un1.ip6_un1_nxt)*8, label, IPV6_NEXT_HEADER);
/* options length */
hoplen = options[1];
sprintf(label, "Length: %u (%u bytes)", hoplen, hoplen*8);
append_field(grid, &x, &y, 8, label, IPV6_HDR_EXT_LEN);
options += 2;
left = hoplen*8 + 6;
while (left > 0) {
opttype = options[0];
sprintf(label, "Type: %u (%s)", opttype, ipv6_hopopt_type(opttype));
append_field(grid, &x, &y, 8, label, IPV6_OPTION_TYPE);
optlen = options[1];
sprintf(label, "Length: %u", optlen);
append_field(grid, &x, &y, 8, label, IPV6_OPTION_LENGTH);
if (optlen > 0) {
optdata = malloc(optlen*2+1);
for (i=0; iar_hrd), hardwaretype(htons(arp->ar_hrd)));
append_field(grid, &x, &y, sizeof(arp->ar_hrd)*8, label, ARP_HTYPE);
/* protocol type */
sprintf(label, "Protocol Type: 0x%04x (%s)", htons(arp->ar_pro), ethertype(htons(arp->ar_pro)));
append_field(grid, &x, &y, sizeof(arp->ar_pro)*8, label, ARP_PTYPE);
/* hardware length */
sprintf(label, "Hardware Length: %u", arp->ar_hln);
append_field(grid, &x, &y, sizeof(arp->ar_hln)*8, label, ARP_HLEN);
/* protocol length */
sprintf(label, "Protocol Length: %u", arp->ar_pln);
append_field(grid, &x, &y, sizeof(arp->ar_pln)*8, label, ARP_PLEN);
/* operation */
sprintf(label, "Operation: %u (%s)", htons(arp->ar_op), arp_operation(htons(arp->ar_op)));
append_field(grid, &x, &y, sizeof(arp->ar_op)*8, label, ARP_OPERATION);
/* sender hardware address (SHA) */
sprintf(label, "Sender Hardware Address: %02x:%02x:%02x:%02x:%02x:%02x", options[0], options[1], options[2], options[3], options[4], options[5]);
append_field(grid, &x, &y, 48, label, ARP_HW_SENDER);
options += 6;
/* sender protocol address (SPA) */
sprintf(label, "Sender Protocol Address: %u.%u.%u.%u", options[0], options[1], options[2], options[3]);
append_field(grid, &x, &y, 32, label, ARP_PROTO_SENDER);
options += 4;
/* sender hardware address (THA) */
sprintf(label, "Target Hardware Address: %02x:%02x:%02x:%02x:%02x:%02x", options[0], options[1], options[2], options[3], options[4], options[5]);
append_field(grid, &x, &y, 48, label, ARP_HW_TARGET);
options += 6;
/* sender protocol address (TPA) */
sprintf(label, "Target Protocol Address: %u.%u.%u.%u", options[0], options[1], options[2], options[3]);
append_field(grid, &x, &y, 32, label, ARP_PROTO_TARGET);
options += 4;
/* free memory of label */
free(label);
/* show ethernet grid (tab) */
gtk_widget_show_all(GTK_WIDGET(grid));
/* pass grid back to tab builder function */
return(grid);
}
GtkGrid *icmp_grid(struct icmphdr *icmp, u_char *options, int left) {
GtkGrid *grid; /* the grid itself */
char *label; /* label of buttons to set */
int x,y; /* position pointer to next empty grid cell */
int i;
int optlen;
char *optdata;
/* init new empty grid */
grid = GTK_GRID(gtk_grid_new());
/* set columns to be uniform sized (for better bit size representation) */
gtk_grid_set_column_homogeneous(grid, TRUE);
/* allocate memory for button label */
label = malloc(100);
/* build bit indication topic line (0 1 2 .. 31) */
for (x=0; x<32; x++) {
sprintf(label, "%u", x);
gtk_grid_attach(grid, gtk_label_new(label), x, 0, 1, 1);
}
/* set cell pointer to next empty grid cell */
x=0;
y=1;
/* type */
sprintf(label, "Type: %u (%s)", icmp->type, icmp_type(icmp->type));
append_field(grid, &x, &y, sizeof(icmp->type)*8, label, ICMP_TYPE);
/* code */
sprintf(label, "Code: %u (%s)", icmp->code, icmp_code(icmp->type, icmp->code));
append_field(grid, &x, &y, sizeof(icmp->code)*8, label, ICMP_CODE);
/* checksum */
sprintf(label, "Checksum: 0x%04x", htons(icmp->checksum));
append_field(grid, &x, &y, sizeof(icmp->checksum)*8, label, ICMP_CHECKSUM);
left -= 4;
switch (icmp->type) {
case 0: /* Echo */
case 8: /* Echo Reply */
sprintf(label, "Identifier: 0x%04x", htons(icmp->un.echo.id));
append_field(grid, &x, &y, 8, label, ICMP_ECHO_ID);
sprintf(label, "Sequence Number: 0x%04x", htons(icmp->un.echo.sequence));
append_field(grid, &x, &y, 24, label, ICMP_ECHO_SEQUENCE);
left -= 4;
break;
case 3: /* Destination Unreachable */
case 4: /* Source Quench */
case 11: /* Time Exceeded */
/* unused */
sprintf(label, "Unused: 0x%08x", htonl(icmp->un.gateway));
append_field(grid, &x, &y, sizeof(icmp->un)*8, label, ICMP_UNUSED);
left -= 4;
/* Internet Header + 64 bits of Original Data Datagram */
break;
case 5: /* Redirect */
sprintf(label, "Gateway Internet Address: %u.%u.%u.%u", icmp->un.gateway & 0xff, (icmp->un.gateway >> 8) & 0xff, (icmp->un.gateway >> 16) & 0xff, (icmp->un.gateway >> 24) & 0xff);
append_field(grid, &x, &y, sizeof(icmp->un)*8, label, ICMP_REDIRECT_GATEWAY);
left -= 4;
break;
case 12: /* Time exceeded */
sprintf(label, "Pointer: 0x%02x", htonl(icmp->un.gateway & 0x000000ff));
append_field(grid, &x, &y, 8, label, ICMP_TIME_POINTER);
sprintf(label, "Unused: 0x%06x", htonl(icmp->un.gateway & 0xffffff00));
append_field(grid, &x, &y, 24, label, ICMP_UNUSED);
left -= 4;
/* Internet Header + 64 bits of Original Data Datagram */
break;
case 13: /* Timestamp */
case 14: /* Timestamp Reply */
sprintf(label, "Identifier: 0x%04x", htons(icmp->un.echo.id));
append_field(grid, &x, &y, 8, label, ICMP_ECHO_ID);
sprintf(label, "Sequence Number: 0x%04x", htons(icmp->un.echo.sequence));
append_field(grid, &x, &y, 24, label, ICMP_ECHO_SEQUENCE);
left -= 4;
/* Originate Timestamp */
/* Receive Timestamp */
/* Transmit Timestamp */
break;
case 15: /* information request message */
case 16: /* information reply message */
sprintf(label, "Identifier: 0x%04x", htons(icmp->un.echo.id));
append_field(grid, &x, &y, 8, label, ICMP_ECHO_ID);
sprintf(label, "Sequence Number: 0x%04x", htons(icmp->un.echo.sequence));
append_field(grid, &x, &y, 24, label, ICMP_ECHO_SEQUENCE);
left -= 4;
/* no more data */
break;
default:
/* unused */
sprintf(label, "Unused: 0x%08x", htonl(icmp->un.gateway));
append_field(grid, &x, &y, sizeof(icmp->un)*8, label, ICMP_UNUSED);
left -= 4;
break;
}
/* allocate memory for option data */
optdata = malloc(10);
/* progress bytes until no option bytes left */
while (left > 0) {
if (left >= 4) optlen = 4; else optlen = left;
/* print bytes in hex format into array */
for (i=0; iicmp6_type, icmpv6_type(icmpv6->icmp6_type));
append_field(grid, &x, &y, sizeof(icmpv6->icmp6_type)*8, label, ICMPV6_TYPE);
/* code */
sprintf(label, "Code: %u (%s)", icmpv6->icmp6_code, icmpv6_code(icmpv6->icmp6_type, icmpv6->icmp6_code));
append_field(grid, &x, &y, sizeof(icmpv6->icmp6_code)*8, label, ICMPV6_CODE);
/* checksum */
sprintf(label, "Checksum: 0x%04x", htons(icmpv6->icmp6_cksum));
append_field(grid, &x, &y, sizeof(icmpv6->icmp6_cksum)*8, label, ICMPV6_CHECKSUM);
left -= 4;
switch (icmpv6->icmp6_type) {
case 133:
memcpy(&ifield, options, 4);
sprintf(label, "Reserved: 0x%08x", htonl(ifield));
append_field(grid, &x, &y, 32, label, NDP_RS_RESERVED);
options += 4;
left -= 4;
break;
case 134:
sprintf(label, "Cur Hop Limit: %u", options[0]);
append_field(grid, &x, &y, 8, label, NDP_RA_CHLIMIT);
options++;
left--;
/* Managed address configuration */
if (options[0] & 0x80) {
append_field(grid, &x, &y, 1, "M", NDP_RA_MACONFIG);
} else {
append_field(grid, &x, &y, 1, "m", NDP_RA_MACONFIG);
}
/* other address configuration */
if (options[0] & 0x40) {
append_field(grid, &x, &y, 1, "O", NDP_RA_OCONFIG);
} else {
append_field(grid, &x, &y, 1, "o", NDP_RA_OCONFIG);
}
sprintf(label, "Reserved: 0x%02x", options[0] & 0x3F);
append_field(grid, &x, &y, 6, label, NDP_RA_RESERVED);
options++;
left--;
memcpy(&sfield, options, 2);
sprintf(label, "Router Lifetime: %u", htons(sfield));
append_field(grid, &x, &y, 16, label, NDP_RA_ROUTERLIFETIME);
options += 2;
left -= 2;
memcpy(&ifield, options, 4);
sprintf(label, "Reachable Time: %u", htonl(ifield));
append_field(grid, &x, &y, 32, label, NDP_RA_REACHTIME);
options += 4;
left -= 4;
memcpy(&ifield, options, 4);
sprintf(label, "Retrans Timer: %u", htonl(ifield));
append_field(grid, &x, &y, 32, label, NDP_RA_RETRANSTIMER);
options += 4;
left -= 4;
break;
case 135:
memcpy(&ifield, options, 4);
sprintf(label, "Reserved: 0x%08x", htonl(ifield));
append_field(grid, &x, &y, 32, label, NDP_NS_RESERVED);
options += 4;
left -= 4;
sprintf(label, "Target Address: %02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x", options[0], options[1], options[2], options[3], options[4], options[5], options[6], options[7], options[8], options[9], options[10], options[11], options[12], options[13], options[14], options[15]);
append_field(grid, &x, &y, 128, label, NDP_NS_TARGET);
options += 16;
left -= 16;
break;
case 136:
memcpy(&ifield, options, 4);
ifield = htonl(ifield);
/* router flag */
if (ifield & 0x80000000) {
append_field(grid, &x, &y, 1, "R", NDP_NA_ROUTER);
} else {
append_field(grid, &x, &y, 1, "r", NDP_NA_ROUTER);
}
/* solicited flag */
if (ifield & 0x40000000) {
append_field(grid, &x, &y, 1, "S", NDP_NA_SOLICITED);
} else {
append_field(grid, &x, &y, 1, "s", NDP_NA_SOLICITED);
}
/* override flag */
if (ifield & 0x20000000) {
append_field(grid, &x, &y, 1, "O", NDP_NA_OVERRIDE);
} else {
append_field(grid, &x, &y, 1, "o", NDP_NA_OVERRIDE);
}
sprintf(label, "Reserved: 0x%08x", ifield & 0x1FFFFFFF);
append_field(grid, &x, &y, 29, label, NDP_NA_RESERVED);
options += 4;
left -= 4;
sprintf(label, "Target Address: %02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x", options[0], options[1], options[2], options[3], options[4], options[5], options[6], options[7], options[8], options[9], options[10], options[11], options[12], options[13], options[14], options[15]);
append_field(grid, &x, &y, 8*8, label, NDP_NA_TARGET);
options += 16;
left -= 16;
break;
case 137:
memcpy(&ifield, options, 4);
sprintf(label, "Reserved: 0x%08x", htonl(ifield));
append_field(grid, &x, &y, 32, label, NDP_R_RESERVED);
options += 4;
left -= 4;
sprintf(label, "Target Address: %02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x", options[0], options[1], options[2], options[3], options[4], options[5], options[6], options[7], options[8], options[9], options[10], options[11], options[12], options[13], options[14], options[15]);
append_field(grid, &x, &y, 128, label, NDP_R_TARGET);
options += 16;
left -= 16;
sprintf(label, "Destination Address: %02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x:%02x%02x", options[0], options[1], options[2], options[3], options[4], options[5], options[6], options[7], options[8], options[9], options[10], options[11], options[12], options[13], options[14], options[15]);
append_field(grid, &x, &y, 128, label, NDP_R_DEST);
options += 16;
left -= 16;
break;
}
/* NDP options */
if ((icmpv6->icmp6_type >= 133) && (icmpv6->icmp6_type <= 137)) {
while (left > 0) {
opttype = options[0];
sprintf(label, "Type: %u (%s)", opttype, icmpv6_opttype(opttype));
append_field(grid, &x, &y, 8, label, NDP_OPTION_TYPE);
optlen = options[1] * 8;
sprintf(label, "Length: %u (%u bytes)", options[1], optlen);
append_field(grid, &x, &y, 8, label, NDP_OPTION_LENGTH);
optdata = malloc(optlen*3);
switch (opttype) {
case 1:
for (i=0; isource));
append_field(grid, &x, &y, sizeof(tcp->source)*8, label, TCP_SPORT);
/* destination port */
sprintf(label, "Destination Port: %u", htons(tcp->dest));
append_field(grid, &x, &y, sizeof(tcp->dest)*8, label, TCP_DPORT);
/* sequence number */
sprintf(label, "Sequence Number: %u", htonl(tcp->seq));
append_field(grid, &x, &y, sizeof(tcp->seq)*8, label, TCP_SEQ_NUM);
/* acknowledgement number */
sprintf(label, "Acknowledgement Number: %u", htonl(tcp->ack_seq));
append_field(grid, &x, &y, sizeof(tcp->ack_seq)*8, label, TCP_ACK_NUM);
/* data offset */
sprintf(label, "Data Offset: %u (%u bytes)", tcp->doff, tcp->doff*4);
append_field(grid, &x, &y, 4, label, TCP_DOFF);
/* reserved (000) */
if (tcp->res1 & 0x08) {
append_field(grid, &x, &y, 1, "R", TCP_FLAG_RES);
} else {
append_field(grid, &x, &y, 1, "r", TCP_FLAG_RES);
}
if (tcp->res1 & 0x04) {
append_field(grid, &x, &y, 1, "R", TCP_FLAG_RES);
} else {
append_field(grid, &x, &y, 1, "r", TCP_FLAG_RES);
}
if (tcp->res1 & 0x02) {
append_field(grid, &x, &y, 1, "R", TCP_FLAG_RES);
} else {
append_field(grid, &x, &y, 1, "r", TCP_FLAG_RES);
}
/* NS */
if (tcp->res1 & 0x01) {
append_field(grid, &x, &y, 1, "NS", TCP_FLAG_NS);
} else {
append_field(grid, &x, &y, 1, "ns", TCP_FLAG_NS);
}
/* CWR */
if (tcp->res2 & 0x02) {
append_field(grid, &x, &y, 1, "CWR", TCP_FLAG_CWR);
} else {
append_field(grid, &x, &y, 1, "cwr", TCP_FLAG_CWR);
}
/* ECE */
if (tcp->res2 & 0x01) {
append_field(grid, &x, &y, 1, "ECE", TCP_FLAG_ECE);
} else {
append_field(grid, &x, &y, 1, "ece", TCP_FLAG_ECE);
}
/* URG */
if (tcp->urg) {
append_field(grid, &x, &y, 1, "URG", TCP_FLAG_URG);
} else {
append_field(grid, &x, &y, 1, "urg", TCP_FLAG_URG);
}
/* ACK */
if (tcp->ack) {
append_field(grid, &x, &y, 1, "ACK", TCP_FLAG_ACK);
} else {
append_field(grid, &x, &y, 1, "ack", TCP_FLAG_ACK);
}
/* PSH */
if (tcp->psh) {
append_field(grid, &x, &y, 1, "PSH", TCP_FLAG_PSH);
} else {
append_field(grid, &x, &y, 1, "psh", TCP_FLAG_PSH);
}
/* RST */
if (tcp->rst) {
append_field(grid, &x, &y, 1, "RST", TCP_FLAG_RST);
} else {
append_field(grid, &x, &y, 1, "rst", TCP_FLAG_RST);
}
/* SYN */
if (tcp->syn) {
append_field(grid, &x, &y, 1, "SYN", TCP_FLAG_SYN);
} else {
append_field(grid, &x, &y, 1, "syn", TCP_FLAG_SYN);
}
/* FIN */
if (tcp->fin) {
append_field(grid, &x, &y, 1, "FIN", TCP_FLAG_FIN);
} else {
append_field(grid, &x, &y, 1, "fin", TCP_FLAG_FIN);
}
/* window size */
sprintf(label, "Window Size: %u", htons(tcp->window));
append_field(grid, &x, &y, sizeof(tcp->window)*8, label, TCP_WINDOW_SIZE);
/* checksum */
sprintf(label, "Checksum: 0x%04x", htons(tcp->check));
append_field(grid, &x, &y, sizeof(tcp->check)*8, label, TCP_CHECKSUM);
/* urgent pointer */
sprintf(label, "Urgent Pointer: %u", htons(tcp->urg_ptr));
append_field(grid, &x, &y, sizeof(tcp->urg_ptr)*8, label, TCP_URGENT_POINTER);
/* count bytes of option fields */
left = (tcp->doff-0x05)*4;
/* progress bytes until no option bytes left */
while (left > 0) {
/* get option type (first byte) */
optkind = options[0];
/* option kind */
sprintf(label, "Option Kind: %u (%s)", optkind, tcp_optkind(optkind));
append_field(grid, &x, &y, 8, label, TCP_OPTION_KIND);
/* option dependent output (some options dont have a length field) */
if ((optkind == 0x00) || (optkind == 0x01)) { /* EOO or NOP */
/* option length is only 1 byte */
optlen = 1;
} else {
/* options with variable length */
/* option length (INCLUDING kind and length field) */
optlen = options[1];
sprintf(label, "Option Length: %u", optlen);
append_field(grid, &x, &y, 8, label, TCP_OPTION_LENGTH);
/* option has additional option data? */
if (optlen > 2) {
/* allocate memory for option data (*2 because of hex representation) */
optdata = malloc(optlen*2);
/* print bytes in hex format into array */
for (i=0; isource));
append_field(grid, &x, &y, sizeof(udp->source)*8, label, UDP_SPORT);
/* destination port */
sprintf(label, "Destination Port: %u", htons(udp->dest));
append_field(grid, &x, &y, sizeof(udp->dest)*8, label, UDP_DPORT);
/* length */
sprintf(label, "Length: %u", htons(udp->len));
append_field(grid, &x, &y, sizeof(udp->len)*8, label, UDP_LENGTH);
/* checksum */
sprintf(label, "Checksum: 0x%02x", htons(udp->check));
append_field(grid, &x, &y, sizeof(udp->check)*8, label, UDP_CHECKSUM);
/* free memory of label */
free(label);
/* show ethernet grid (tab) */
gtk_widget_show_all(GTK_WIDGET(grid));
/* pass grid back to tab builder function */
return(grid);
}
netmate-0.2.0/netmate.1 0000664 0000000 0000000 00000004727 12242060236 0014674 0 ustar 00root root 0000000 0000000 .TH NETMATE 1 "17 NOV 2013"
.SH "NAME"
netmate \- displays network protocol headers in uniform RFC like format
.SH "SYNOPSIS"
\fBnetmate\fP filename
.SH "DESCRIPTION"
Netmate is a GTK+ program that shows network protocols headers in 32-bit aligned fields, identical as they are represented in Request for Comments (RFCs).
It can be used to learn and teach about network protocols and to understand their functionality and collaboration.
This tool supports input files in pcap(ng) format as they are created by tcpdump, wireshark or other code based on libpcap.
Netmate is written in C and released under the GNU General Public License.
It was inspired by netdude, that is not further developed any more.
Currently the following network protocols are supported:
.br
\- Layer 2: Ethernet, SLL (Linux Cooked)
.br
\- Layer 3: ARP, ICMP, ICMPv6, IPv4, IPv6
.br
\- Layer 4: TCP, UDP
.SH "DEVELOPMENT"
This tool is still under development! Please send any further wishes, feature requests or problems in compiling and execution to ruport@f00l.de.
Also send me any more network protocols you want to be supported in future releases.
For further information visit the netmate homepage at http://f00l.de/netmate/.
.SH "HISTORY"
.TP 5
0.2.0 - 17.11.2013
* added full support for neighbor discovery protocol (NDP)
.br
* fixed GPLv3 license statement and added to all files
.br
* minor bug fixes
.TP
0.1.9 - 10.11.2013
* added resolution of header fields for all supported protocols
.br
* minor bug fixes
.TP
0.1.8 - 28.10.2013
* added tooltips for all supported protocols
.br
* improved Makefile
.br
* minor bug fixes
.TP
0.1.7 - 19.10.2013
* improved Makefile
.br
* added shortcut and icon
.br
* added README and man-page
.br
* compiles under windows
.br
* minor bug fixes
.TP
0.1.6 - 05.10.2013
.br
* initial changelog
.br
* added columns source port, destination port, flags
.br
* columns are resizable now
.br
* removed external GUI (netmate.ui)
.br
* minor fixes
.SH "COPYRIGHT"
Copyright (c) 2013 Robert Krause
Netmate 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 3 of the License, or any later version.
Netmate 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.
.SH "AUTHOR"
Written by Robert Krause .
netmate-0.2.0/netmate.c 0000664 0000000 0000000 00000071723 12242060236 0014756 0 ustar 00root root 0000000 0000000 /*******************************************************************************
*
* Copyright (c) 2013 Robert Krause (ruport@f00l.de)
*
* This file is part of Netmate.
*
* Netmate 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 3 of the License, or any later version.
*
* Netmate 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
* Netmate. If not, see http://www.gnu.org/licenses/.
*
******************************************************************************/
#include
#include
#include
#include
#include
#include
#include
#ifndef WIN32
#include
#include
#include
#include
#include
#include
#include
#include
#include
#else
#include "win32.h"
#endif
/* THE VERSION OF NETMATE */
#define VERSION "0.2.0"
/* ADDITIONAL LINK TYPES */
#define LINKTYPE_LINUX_SLL 113
/******************************************************************************/
void loadpcapfile(GtkWidget *widget, GtkListStore *packetliststore);
void append_field(GtkGrid *grid, int *x, int *y, int size, char *label, char *tooltip);
void display_packet(GtkWidget *widget);
void openpcapfile(GtkWidget *widget, gpointer data);
void getinfo(pcap_t *handler, const u_char *packet, char **protocol, char **flags, char **source, char **sport, char **destination, char **dport);
#include "tooltips.h"
#include "layer2.h"
#include "layer3.h"
#include "layer4.h"
/******************************************************************************/
char *filename = NULL;
/* global grids (protocol container) */
GtkNotebook *protocolheadernotebook;
/******************************************************************************/
/* GTK INFORMATION WINDOWS */
/******************************************************************************/
/* shows an error popup with given (char*) as message */
void show_error(GtkWidget *widget, gpointer message) {
GtkWidget *toplevel; /* the toplevel window */
GtkWidget *dialog; /* the dialog object */
/* get toplevel from widget */
toplevel = gtk_widget_get_toplevel(widget);
/* show window only if toplevel */
if (gtk_widget_is_toplevel(toplevel)) {
/* create new dialog */
dialog = gtk_message_dialog_new(GTK_WINDOW(toplevel), GTK_DIALOG_DESTROY_WITH_PARENT, GTK_MESSAGE_ERROR, GTK_BUTTONS_OK, "%s", (char*)message);
/* set title */
gtk_window_set_title(GTK_WINDOW(dialog), "Error");
/* run dialog */
gtk_dialog_run(GTK_DIALOG(dialog));
/* destroy dialog */
gtk_widget_destroy(dialog);
}
}
/* shows a warning popup with given (char*) as message */
void show_warning(GtkWidget *widget, gpointer message) {
GtkWidget *toplevel; /* the toplevel window */
GtkWidget *dialog; /* the dialog object */
/* get toplevel from widget */
toplevel = gtk_widget_get_toplevel(widget);
/* show window only if toplevel */
if (gtk_widget_is_toplevel(toplevel)) {
/* create new dialog */
dialog = gtk_message_dialog_new(GTK_WINDOW(toplevel), GTK_DIALOG_DESTROY_WITH_PARENT, GTK_MESSAGE_WARNING, GTK_BUTTONS_OK, "%s", (char*)message);
/* set title */
gtk_window_set_title(GTK_WINDOW(dialog), "Warning");
/* run dialog */
gtk_dialog_run(GTK_DIALOG(dialog));
/* destroy dialog */
gtk_widget_destroy(dialog);
}
}
/* shows an information popup with given (char*) as message */
void show_information(GtkWidget *widget, gpointer message) {
GtkWidget *toplevel; /* the toplevel window */
GtkWidget *dialog; /* the dialog object */
/* get toplevel from widget */
toplevel = gtk_widget_get_toplevel(widget);
/* show window only if toplevel */
if (gtk_widget_is_toplevel(toplevel)) {
/* create new dialog */
dialog = gtk_message_dialog_new(GTK_WINDOW(toplevel), GTK_DIALOG_DESTROY_WITH_PARENT, GTK_MESSAGE_INFO, GTK_BUTTONS_OK, "%s", (char*)message);
/* set title */
gtk_window_set_title(GTK_WINDOW(dialog), "Information");
/* run dialog */
gtk_dialog_run(GTK_DIALOG(dialog));
/* destroy dialog */
gtk_widget_destroy(dialog);
}
}
/* shows a questiong popup with given (char*) as message */
gint show_question(GtkWidget *widget, gpointer message) {
GtkWidget *toplevel; /* the toplevel window */
GtkWidget *dialog; /* the dialog object */
int ret = -1; /* return value (clicked button) GTK_RESPONSE_NO or GTK_RESPONSE_YES */
/* get toplevel from widget */
toplevel = gtk_widget_get_toplevel(widget);
/* show window only if toplevel */
if (gtk_widget_is_toplevel(toplevel)) {
/* create new dialog */
dialog = gtk_message_dialog_new(GTK_WINDOW(toplevel), GTK_DIALOG_DESTROY_WITH_PARENT, GTK_MESSAGE_QUESTION, GTK_BUTTONS_YES_NO, "%s", (char*)message);
/* set title */
gtk_window_set_title(GTK_WINDOW(dialog), "Question");
/* run dialog and get click as int */
ret = gtk_dialog_run(GTK_DIALOG(dialog));
/* destroy dialog */
gtk_widget_destroy(dialog);
}
/* return clicked button */
return(ret);
}
/******************************************************************************/
void append_field(GtkGrid *grid, int *x, int *y, int size, char *label, char *tooltip) {
GtkButton *button;
while (*x + size > 32) {
button = GTK_BUTTON(gtk_button_new_with_label(label));
if (tooltip != NULL) gtk_widget_set_tooltip_text(GTK_WIDGET(button), tooltip);
gtk_grid_attach(grid, GTK_WIDGET(button), *x, *y, 32-*x, 1);
size -= 32-*x;
*x = 0;
*y = *y + 1;
}
button = GTK_BUTTON(gtk_button_new_with_label(label));
if (tooltip != NULL) gtk_widget_set_tooltip_text(GTK_WIDGET(button), tooltip);
gtk_grid_attach(grid, GTK_WIDGET(button), *x, *y, size, 1);
*x = *x + size;
if (*x == 32) { *x = 0; *y = *y + 1; }
}
GtkGrid *not_supported_grid(char *protocol) {
GtkGrid *grid; /* the grid itself */
char *label; /* label of buttons to set */
/* init a new empty grid */
grid = GTK_GRID(gtk_grid_new());
/* set columns to be uniform sized (for better bit size representation) */
gtk_grid_set_column_homogeneous(grid, TRUE);
/* allocate memory for button label */
label = malloc(255);
/* Upper Layer Protocol */
sprintf(label, "\n%s is not supported yet.\n\nPlease send an email to Ruport@web.de if you want it to be supported in future releases.", protocol);
gtk_grid_attach(grid, gtk_label_new(label), 0, 0, 32, 5);
/* free memory of label */
free(label);
/* show ethernet grid (tab) */
gtk_widget_show_all(GTK_WIDGET(grid));
/* return grid to tab builder */
return(grid);
}
void display_packet(GtkWidget *widget) {
GtkTreeSelection *selection; /* tree selection */
GtkTreeModel *model; /* tree model */
GtkTreeIter iter; /* tree iterator */
pcap_t *handler; /* pcap file handler */
char errbuf[PCAP_ERRBUF_SIZE]; /* pcap error buffer */
struct pcap_pkthdr *header; /* the header from libpcap */
const u_char *packet; /* current packet pointer */
unsigned int packetnumber; /* currently secected packet number */
struct ether_header *eth = NULL;
struct sll_header *sll = NULL; /* sll header (linux cooked) */
struct arphdr *arp = NULL;
struct iphdr *ipv4 = NULL; /* ipv4_header pointer */
struct ip6_hdr *ipv6 = NULL;
struct icmphdr *icmp = NULL;
struct icmp6_hdr *icmpv6 = NULL;
struct tcphdr *tcp = NULL;
struct udphdr *udp = NULL;
unsigned int i = 1; /* loop counter to track packet */
unsigned short nextproto = 0;
char *nextptr = NULL;
int pos;
if (filename == NULL) return;
/* open pcap to find packet */
handler = pcap_open_offline(filename, errbuf);
if (handler == NULL) return;
/* get currently selected packet */
selection = gtk_tree_view_get_selection(GTK_TREE_VIEW(widget));
if (gtk_tree_selection_get_selected(selection, &model, &iter)) {
gtk_tree_model_get(model, &iter, 0, &packetnumber, -1);
}
/* iterate through packets until selected packet is found
this might also be done by preloading of this technique is too slow */
while (i++ <= packetnumber) pcap_next_ex(handler, &header, &packet);
/* remember tab position and hide all tabs */
pos = gtk_notebook_get_current_page(protocolheadernotebook);
/* clear grids */
while (gtk_notebook_get_n_pages(protocolheadernotebook) > 0) {
gtk_notebook_remove_page(protocolheadernotebook, 0);
}
switch (pcap_datalink(handler)) {
case DLT_EN10MB:
/* set pointer to ethernet header */
eth = (struct ether_header*)(packet);
/* display ethernet tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(ethernet_grid(eth)), gtk_label_new(hardwaretype(pcap_datalink(handler))));
nextproto = htons(eth->ether_type);
nextptr = (void*)(packet + sizeof(struct ether_header));
break;
case LINKTYPE_LINUX_SLL:
/* LINUX COOKED */
sll = (struct sll_header*)(packet);
/* display sll tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(sll_grid(sll)), gtk_label_new(hardwaretype(pcap_datalink(handler))));
nextproto = htons(sll->sll_protocol);
nextptr = (void*)(packet + sizeof(struct sll_header));
break;
default:
/* display not supported tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(not_supported_grid(hardwaretype(pcap_datalink(handler)))), gtk_label_new(hardwaretype(pcap_datalink(handler))));
return;
}
switch (nextproto) {
case ETHERTYPE_ARP:
/* ARP */
arp = (struct arphdr*)nextptr;
nextptr += sizeof(struct arphdr);
/* display arp tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(arp_grid(arp, ((u_char*)nextptr))), gtk_label_new(ethertype(nextproto)));
nextproto = 0xffff;
break;
case ETHERTYPE_IP:
/* IPV4 */
ipv4 = (struct iphdr*)nextptr;
nextptr += sizeof(struct iphdr);
/* display ipv4 tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(ipv4_grid(ipv4, ((u_char*)nextptr))), gtk_label_new(ethertype(nextproto)));
nextproto = ipv4->protocol;
break;
case ETHERTYPE_IPV6:
/* IPV6 */
ipv6 = (struct ip6_hdr*)nextptr;
nextptr += sizeof(struct ip6_hdr);
/* display ipv4 tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(ipv6_grid(ipv6, ((u_char*)nextptr))), gtk_label_new(ethertype(nextproto)));
nextproto = ipv6->ip6_ctlun.ip6_un1.ip6_un1_nxt;
while (nextproto == IPPROTO_HOPOPTS) {
/* next header */
nextproto = ((u_char*)nextptr)[0];
nextptr += (((u_char*)nextptr)[1]+1) * 8;
}
break;
default:
/* display not supported tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(not_supported_grid(ethertype(nextproto))), gtk_label_new(ethertype(nextproto)));
nextproto = 0xffff;
break;
}
if (nextproto != 0xffff) {
switch (nextproto) {
case IPPROTO_ICMP:
icmp = (struct icmphdr*)nextptr;
nextptr += sizeof(struct icmphdr);
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(icmp_grid(icmp, ((u_char*)nextptr), htons(ipv4->tot_len)-(ipv4->ihl*4))), gtk_label_new(ipprotocol(nextproto)));
break;
case IPPROTO_ICMPV6:
icmpv6 = (struct icmp6_hdr*)nextptr;
/* skip 4 bytes of unused / reserved fields of header struct and pass to next protocol pointer */
nextptr += sizeof(struct icmp6_hdr)-4;
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(icmpv6_grid(icmpv6, ((u_char*)nextptr), htons(ipv6->ip6_ctlun.ip6_un1.ip6_un1_plen))), gtk_label_new(ipprotocol(nextproto)));
break;
case IPPROTO_TCP:
tcp = (struct tcphdr*)nextptr;
nextptr += sizeof(struct tcphdr);
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(tcp_grid(tcp, ((u_char*)nextptr))), gtk_label_new(ipprotocol(nextproto)));
break;
case IPPROTO_UDP:
udp = (struct udphdr*)nextptr;
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(udp_grid(udp)), gtk_label_new(ipprotocol(nextproto)));
break;
default:
/* display not supported tab */
gtk_notebook_append_page(protocolheadernotebook, GTK_WIDGET(not_supported_grid(ipprotocol(nextproto))), gtk_label_new(ipprotocol(nextproto)));
nextproto = 0xffff;
break;
}
}
/* switch to tab that was former selected */
if ((pos >= 0) && (pos < gtk_notebook_get_n_pages(protocolheadernotebook))) {
gtk_notebook_set_current_page(protocolheadernotebook, pos);
}
/* close pcap handler */
pcap_close(handler);
}
void openpcapfile(GtkWidget *widget, gpointer data) {
GtkDialog *fileopendialog;
fileopendialog = GTK_DIALOG(gtk_file_chooser_dialog_new ("Open File",
GTK_WINDOW(gtk_widget_get_toplevel(widget)),
GTK_FILE_CHOOSER_ACTION_OPEN,
GTK_STOCK_CANCEL, GTK_RESPONSE_CANCEL,
GTK_STOCK_OPEN, GTK_RESPONSE_ACCEPT,
NULL));
gtk_window_resize(GTK_WINDOW(fileopendialog), 1000, 500);
if (gtk_dialog_run (GTK_DIALOG (fileopendialog)) == GTK_RESPONSE_ACCEPT) {
filename = gtk_file_chooser_get_filename (GTK_FILE_CHOOSER (fileopendialog));
loadpcapfile(widget, GTK_LIST_STORE(data));
}
gtk_widget_destroy(GTK_WIDGET(fileopendialog));
}
void getinfo(pcap_t *handler, const u_char *packet, char **protocol, char **flags, char **source, char **sport, char **destination, char **dport) {
struct ether_header *eth;
struct iphdr *ipv4; /* ipv4_header pointer */
struct tcphdr *tcp;
struct udphdr *udp;
struct ip6_hdr *ipv6;
struct sll_header *sll; /* sll header (linux cooked) */
unsigned short nextproto;
char *nextptr = NULL;
*protocol = malloc(100);
*source = malloc(100);
*sport = malloc(100);
*destination = malloc(100);
*dport = malloc(100);
*flags = malloc(100);
memset(*protocol, 0, 100);
memset(*source, 0, 100);
memset(*sport, 0, 100);
memset(*destination, 0, 100);
memset(*dport, 0, 100);
memset(*flags, 0, 100);
sprintf(*protocol, "%s", hardwaretype(pcap_datalink(handler)));
switch (pcap_datalink(handler)) {
case DLT_EN10MB:
/* set pointer to ethernet header */
eth = (struct ether_header*)(packet);
sprintf(*source, "%02x:%02x:%02x:%02x:%02x:%02x", eth->ether_shost[0], eth->ether_shost[1], eth->ether_shost[2], eth->ether_shost[3], eth->ether_shost[4], eth->ether_shost[5]);
sprintf(*destination, "%02x:%02x:%02x:%02x:%02x:%02x", eth->ether_dhost[0], eth->ether_dhost[1], eth->ether_dhost[2], eth->ether_dhost[3], eth->ether_dhost[4], eth->ether_dhost[5]);
nextproto = htons(eth->ether_type);
nextptr = (void*)(packet + sizeof(struct ether_header));
break;
case LINKTYPE_LINUX_SLL:
/* LINUX COOKED */
sll = (struct sll_header*)(packet);
/* TODO: need to check sll->halen to get REAL size (6 chosen here) */
sprintf(*source, "%02x:%02x:%02x:%02x:%02x:%02x", sll->sll_addr[0], sll->sll_addr[1], sll->sll_addr[2], sll->sll_addr[3], sll->sll_addr[4], sll->sll_addr[5]);
/* destination is unknown in SLL */
nextproto = htons(sll->sll_protocol);
nextptr = (void*)(packet + sizeof(struct sll_header));
break;
default:
nextproto = 0xffff;
break;
}
if (nextproto != 0xffff) {
sprintf(*protocol, "%s", ethertype(nextproto));
switch (nextproto) {
case ETHERTYPE_ARP:
/* ARP */
/* arp = (struct arphdr*)nextptr;*/
nextproto = 0xffff;
break;
case ETHERTYPE_IP:
/* IPV4 */
ipv4 = (struct iphdr*)nextptr;
nextptr += sizeof(struct iphdr);
nextproto = ipv4->protocol;
sprintf(*source, "%u.%u.%u.%u", ipv4->saddr & 0xff, (ipv4->saddr >> 8) & 0xff, (ipv4->saddr >> 16) & 0xff, (ipv4->saddr >> 24) & 0xff);
sprintf(*destination, "%u.%u.%u.%u", ipv4->daddr & 0xff, (ipv4->daddr >> 8) & 0xff, (ipv4->daddr >> 16) & 0xff, (ipv4->daddr >> 24) & 0xff);
/* reserved flag */
if (ipv4->frag_off & htons(IP_RF)) strcat(*flags, "RF ");
/* dont fragment flag */
if (ipv4->frag_off & htons(IP_DF)) strcat(*flags, "DF ");
/* more fragments flag */
if (ipv4->frag_off & htons(IP_MF)) strcat(*flags, "MF ");
break;
case ETHERTYPE_IPV6:
ipv6 = (struct ip6_hdr*)nextptr;
nextptr += sizeof(struct ip6_hdr);
sprintf(*source, "%04x:%04x:%04x:%04x:%04x:%04x:%04x:%04x", htons(ipv6->ip6_src.__in6_u.__u6_addr16[0]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[1]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[2]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[3]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[4]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[5]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[6]), htons(ipv6->ip6_src.__in6_u.__u6_addr16[7]));
sprintf(*destination, "%04x:%04x:%04x:%04x:%04x:%04x:%04x:%04x", htons(ipv6->ip6_dst.__in6_u.__u6_addr16[0]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[1]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[2]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[3]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[4]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[5]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[6]), htons(ipv6->ip6_dst.__in6_u.__u6_addr16[7]));
nextproto = ipv6->ip6_ctlun.ip6_un1.ip6_un1_nxt;
while (nextproto == IPPROTO_HOPOPTS) {
/* next header */
nextproto = ((u_char*)nextptr)[0];
nextptr += (((u_char*)nextptr)[1]+1) * 8;
}
break;
default:
nextproto = 0xffff;
break;
}
}
if (nextproto != 0xffff) {
sprintf(*protocol, "%s", ipprotocol(nextproto));
switch (nextproto) {
case IPPROTO_ICMP:
/* icmp = (struct icmphdr*)nextptr;*/
break;
case IPPROTO_ICMPV6:
/* icmpv6 = (struct icmp6_hdr*)nextptr;*/
break;
case IPPROTO_TCP:
tcp = (struct tcphdr*)nextptr;
sprintf(*sport, "%u", htons(tcp->source));
sprintf(*dport, "%u", htons(tcp->dest));
/* NS */
if (tcp->res1 & 0x01) strcat(*flags, "NS ");
/* CWR */
if (tcp->res2 & 0x02) strcat(*flags, "CWR ");
/* ECE */
if (tcp->res2 & 0x01) strcat(*flags, "ECE ");
/* URG */
if (tcp->urg) strcat(*flags, "URG ");
/* ACK */
if (tcp->ack) strcat(*flags, "ACK ");
/* PSH */
if (tcp->psh) strcat(*flags, "PSH ");
/* RST */
if (tcp->rst) strcat(*flags, "RST ");
/* SYN */
if (tcp->syn) strcat(*flags, "SYN ");
/* FIN */
if (tcp->fin) strcat(*flags, "FIN ");
break;
case IPPROTO_UDP:
udp = (struct udphdr*)nextptr;
sprintf(*sport, "%u", htons(udp->source));
sprintf(*dport, "%u", htons(udp->dest));
break;
default:
nextproto = 0xffff;
break;
}
}
}
void loadpcapfile(GtkWidget *widget, GtkListStore *packetliststore) {
GtkTreeIter iter; /* iterator for filling tree view */
char errbuf[PCAP_ERRBUF_SIZE]; /* pcap error buffer */
unsigned int i; /* loop variable */
struct pcap_pkthdr *header; /* pointer to pcap header */
const u_char *packet; /* pcap packet pointer */
pcap_t *handler; /* pcap file handler */
long begintime = -1;
long beginutime;
long realtime;
long realutime;
char *pcaptime = malloc(20);
char *protocol;
char *source;
char *sport;
char *destination;
char *dport;
char *flags;
/* clear all items */
gtk_list_store_clear(packetliststore);
/* clear grids */
while (gtk_notebook_get_n_pages(protocolheadernotebook) > 0) {
gtk_notebook_remove_page(protocolheadernotebook, 0);
}
/* check for empty file pointer */
if (filename == NULL) return;
/* check if file exists */
if (access(filename, F_OK ) == -1 ) {
show_error(widget, "File not found.");
filename = NULL;
return;
}
/* open file and create pcap handler */
handler = pcap_open_offline(filename, errbuf);
/* check for proper pcap file */
if (handler == NULL ) {
show_error(widget, "Invalid pcap format, try pcapfix :)");
filename = NULL;
return;
}
/* read packets from file and fill tree view */
i = 1;
while (pcap_next_ex(handler, &header, &packet) >= 0) {
if (begintime == -1) {
begintime = (header->ts).tv_sec;
beginutime = (header->ts).tv_usec;
}
realtime = (header->ts).tv_sec-begintime;
realutime = (header->ts).tv_usec-beginutime;
if (realutime < 0) {
realtime--;
realutime += 1000000;
}
sprintf(pcaptime, "%ld.%06ld", realtime, realutime);
getinfo(handler, packet, &protocol, &flags, &source, &sport, &destination, &dport);
/* insert new row into tree view */
gtk_list_store_insert_with_values(packetliststore, &iter, -1, 0, i++, 1, pcaptime, 2, protocol, 3, flags, 4, source, 5, sport, 6, destination, 7, dport, -1);
}
free(pcaptime);
free(source);
free(destination);
/* close pcap handler */
pcap_close(handler);
}
/* MAIN FUNCTION */
int main (int argc, char *argv[]) {
GtkWindow *mainwindow; /* main window object */
GtkBox *mainbox;
GtkMenuBar *topmenubar;
GtkScrolledWindow *packetscrolledwindow;
GtkMenuItem *filemenuitem, *helpmenuitem, *aboutmenuitem;
GtkMenu *filemenu, *helpmenu;
GtkTreeViewColumn *packetnumbertreeviewcolumn, *timetreeviewcolumn, *protocoltreeviewcolumn, *sourcetreeviewcolumn, *destinationtreeviewcolumn, *sporttreeviewcolumn, *dporttreeviewcolumn, *flagstreeviewcolumn;
GtkCellRendererText *packetnumbercellrenderertext, *timecellrenderertext, *protocolcellrenderertext, *sourcecellrenderertext, *destinationcellrenderertext, *sportcellrenderertext, *dportcellrenderertext, *flagscellrenderertext;
GtkListStore *packetliststore; /* list store for packets */
GtkTreeView *packettreeview; /* tree view for packets */
GtkImageMenuItem *openimagemenuitem; /* file open menu */
GtkImageMenuItem *quitimagemenuitem; /* quit menu */
char *title; /* title of the program (main window) */
/* init GTK with console parameters (change to getopts later) */
gtk_init(NULL, NULL);
/* init packet list store (database) */
packetliststore = GTK_LIST_STORE(gtk_list_store_new (8, G_TYPE_INT, G_TYPE_STRING, G_TYPE_STRING, G_TYPE_STRING, G_TYPE_STRING, G_TYPE_STRING, G_TYPE_STRING, G_TYPE_STRING));
/* init main window */
mainwindow = GTK_WINDOW(gtk_window_new(GTK_WINDOW_TOPLEVEL));
gtk_window_set_position(mainwindow, GTK_WIN_POS_CENTER_ALWAYS);
g_signal_connect(mainwindow, "destroy", G_CALLBACK(gtk_main_quit), NULL);
mainbox = GTK_BOX(gtk_box_new(GTK_ORIENTATION_VERTICAL, 0));
gtk_container_add(GTK_CONTAINER(mainwindow), GTK_WIDGET(mainbox));
topmenubar = GTK_MENU_BAR(gtk_menu_bar_new());
filemenuitem = GTK_MENU_ITEM(gtk_menu_item_new_with_label("File"));
filemenu = GTK_MENU(gtk_menu_new());
/* init open file menu */
openimagemenuitem = GTK_IMAGE_MENU_ITEM(gtk_image_menu_item_new_from_stock("gtk-open", NULL));
g_signal_connect(openimagemenuitem, "activate", G_CALLBACK(openpcapfile), packetliststore);
gtk_container_add(GTK_CONTAINER(filemenu), GTK_WIDGET(openimagemenuitem));
gtk_container_add(GTK_CONTAINER(filemenu), gtk_separator_menu_item_new());
/* init quit menu */
quitimagemenuitem = GTK_IMAGE_MENU_ITEM(gtk_image_menu_item_new_from_stock("gtk-quit", NULL));
g_signal_connect(quitimagemenuitem, "activate", G_CALLBACK(gtk_main_quit), NULL);
gtk_container_add(GTK_CONTAINER(filemenu), GTK_WIDGET(quitimagemenuitem));
gtk_menu_item_set_submenu(filemenuitem, GTK_WIDGET(filemenu));
gtk_container_add(GTK_CONTAINER(topmenubar), GTK_WIDGET(filemenuitem));
helpmenuitem = GTK_MENU_ITEM(gtk_menu_item_new_with_label("Help"));
helpmenu = GTK_MENU(gtk_menu_new());
gtk_menu_item_set_submenu(helpmenuitem, GTK_WIDGET(helpmenu));
aboutmenuitem = GTK_MENU_ITEM(gtk_menu_item_new_with_label("About"));
g_signal_connect(aboutmenuitem, "activate", G_CALLBACK(show_information), "Copyright (c) 2013 Robert Krause (ruport@f00l.de)\n\nNetmate 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 3 of the License, or any later version.\n\nNetmate 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.\n\nPlease report any bugs and feature requests to ruport@f00l.de\n\nFor more information visit http://f00l.de/netmate/");
gtk_container_add(GTK_CONTAINER(helpmenu), GTK_WIDGET(aboutmenuitem));
gtk_container_add(GTK_CONTAINER(topmenubar), GTK_WIDGET(helpmenuitem));
gtk_box_pack_start(mainbox, GTK_WIDGET(topmenubar), FALSE, TRUE, 0);
packetscrolledwindow = GTK_SCROLLED_WINDOW(gtk_scrolled_window_new(NULL, NULL));
gtk_widget_set_size_request(GTK_WIDGET(packetscrolledwindow), 800, 400);
packettreeview = GTK_TREE_VIEW(gtk_tree_view_new_with_model(GTK_TREE_MODEL(packetliststore)));
g_signal_connect (packettreeview, "cursor-changed", G_CALLBACK(display_packet), NULL);
packetnumbercellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
packetnumbertreeviewcolumn = gtk_tree_view_column_new_with_attributes("No.", GTK_CELL_RENDERER(packetnumbercellrenderertext), "text", 0, NULL);
gtk_tree_view_column_set_resizable(packetnumbertreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, packetnumbertreeviewcolumn);
timecellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
timetreeviewcolumn = gtk_tree_view_column_new_with_attributes("Time", GTK_CELL_RENDERER(timecellrenderertext), "text", 1, NULL);
gtk_tree_view_column_set_resizable(timetreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, timetreeviewcolumn);
protocolcellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
protocoltreeviewcolumn = gtk_tree_view_column_new_with_attributes("Protocol", GTK_CELL_RENDERER(protocolcellrenderertext), "text", 2, NULL);
gtk_tree_view_column_set_resizable(protocoltreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, protocoltreeviewcolumn);
flagscellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
flagstreeviewcolumn = gtk_tree_view_column_new_with_attributes("Flags", GTK_CELL_RENDERER(flagscellrenderertext), "text", 3, NULL);
gtk_tree_view_column_set_resizable(flagstreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, flagstreeviewcolumn);
sourcecellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
sourcetreeviewcolumn = gtk_tree_view_column_new_with_attributes("Source", GTK_CELL_RENDERER(sourcecellrenderertext), "text", 4, NULL);
gtk_tree_view_column_set_resizable(sourcetreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, sourcetreeviewcolumn);
sportcellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
sporttreeviewcolumn = gtk_tree_view_column_new_with_attributes("S.port", GTK_CELL_RENDERER(sportcellrenderertext), "text", 5, NULL);
gtk_tree_view_column_set_resizable(sporttreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, sporttreeviewcolumn);
destinationcellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
destinationtreeviewcolumn = gtk_tree_view_column_new_with_attributes("Destination", GTK_CELL_RENDERER(destinationcellrenderertext), "text", 6, NULL);
gtk_tree_view_column_set_resizable(destinationtreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, destinationtreeviewcolumn);
dportcellrenderertext = GTK_CELL_RENDERER_TEXT(gtk_cell_renderer_text_new());
dporttreeviewcolumn = gtk_tree_view_column_new_with_attributes("D.port", GTK_CELL_RENDERER(dportcellrenderertext), "text", 7, NULL);
gtk_tree_view_column_set_resizable(dporttreeviewcolumn, TRUE);
gtk_tree_view_append_column(packettreeview, dporttreeviewcolumn);
gtk_container_add(GTK_CONTAINER(packetscrolledwindow), GTK_WIDGET(packettreeview));
gtk_box_pack_start(mainbox, GTK_WIDGET(packetscrolledwindow), FALSE, TRUE, 0);
/* init protocol header field */
protocolheadernotebook = GTK_NOTEBOOK(gtk_notebook_new());
gtk_box_pack_start(mainbox, GTK_WIDGET(protocolheadernotebook), FALSE, TRUE, 0);
gtk_widget_set_visible(GTK_WIDGET(mainwindow), TRUE);
gtk_widget_show_all(GTK_WIDGET(mainwindow));
/* set title of main window */
title = malloc(100);
sprintf(title, "NetMate v%s", VERSION);
gtk_window_set_title(mainwindow, title);
free(title);
while (gtk_events_pending ()) gtk_main_iteration ();
/* try loading filename from parameters */
if (argc >= 1) {
filename = argv[1];
loadpcapfile(GTK_WIDGET(mainwindow), packetliststore);
}
/* ENTER MAIN LOOP */
gtk_main();
/* exit */
return(0);
}
netmate-0.2.0/res/ 0000775 0000000 0000000 00000000000 12242060236 0013734 5 ustar 00root root 0000000 0000000 netmate-0.2.0/res/netmate.desktop 0000664 0000000 0000000 00000000446 12242060236 0016770 0 ustar 00root root 0000000 0000000 [Desktop Entry]
Version=1.0
Type=Application
Name=Netmate
GenericName=Netmate
Comment=shows pcap dump lines in network header style
Icon=netmate.xpm
Exec=netmate
Terminal=false
StartupNotify=false
Categories=Science;DataVisualization
Keywords=net;network;learning;TCP/IP;IPv4;IPv6;TCP;UDP;ICMP
netmate-0.2.0/res/netmate.xpm 0000664 0000000 0000000 00000022455 12242060236 0016127 0 ustar 00root root 0000000 0000000 /* XPM */
static char * netmate_32x32_xpm[] = {
"32 32 455 2",
" c None",
". c #030303",
"+ c #181818",
"@ c #1B1B1B",
"# c #1C1C1C",
"$ c #161616",
"% c #141414",
"& c #151515",
"* c #1D1D1D",
"= c #131313",
"- c #1A1A1A",
"; c #191919",
"> c #171717",
", c #020202",
"' c #FFFFFF",
") c #F1F1F1",
"! c #E9E9E9",
"~ c #F3F3F3",
"{ c #EEEEEE",
"] c #FCFCFC",
"^ c #FBFBFB",
"/ c #F2F2F2",
"( c #E3E3E3",
"_ c #F9F9F9",
": c #E8E8E8",
"< c #E5E5E5",
"[ c #EFEFEF",
"} c #FEFEFE",
"| c #EBEBEB",
"1 c #E4E4E4",
"2 c #FDFDFD",
"3 c #E0E0E0",
"4 c #EDEDED",
"5 c #FAFAFA",
"6 c #E2E2E2",
"7 c #EAEAEA",
"8 c #DCDCDC",
"9 c #D2D2D2",
"0 c #DEDEDE",
"a c #D6D6D6",
"b c #C8C8C8",
"c c #E7E7E7",
"d c #CECECE",
"e c #F3F0F0",
"f c #F0EEEE",
"g c #D4D4D4",
"h c #D5D5D5",
"i c #E1E1E1",
"j c #F0F0F0",
"k c #ECECEC",
"l c #F4F7F7",
"m c #1F0000",
"n c #603C3C",
"o c #F5F5F5",
"p c #F8F8F8",
"q c #F6F6F6",
"r c #FCFFFF",
"s c #2E0000",
"t c #725151",
"u c #BFAFAF",
"v c #1C0000",
"w c #B7A7A7",
"x c #4A2020",
"y c #340606",
"z c #633F3F",
"A c #EEEBEB",
"B c #D6CDCD",
"C c #562D2D",
"D c #360707",
"E c #4E2525",
"F c #C2B5B5",
"G c #633D3D",
"H c #310000",
"I c #230000",
"J c #E5E4E4",
"K c #C1B2B2",
"L c #240000",
"M c #704F4F",
"N c #CEC8C8",
"O c #330202",
"P c #6E4D4D",
"Q c #E3DDDD",
"R c #2F0000",
"S c #927D7D",
"T c #F9FEFE",
"U c #B1A3A3",
"V c #270000",
"W c #BBADAD",
"X c #6F4F4F",
"Y c #F5FBFB",
"Z c #D7D7D7",
"` c #A39393",
" . c #1D0000",
".. c #E1DEDE",
"+. c #ECEDED",
"@. c #3D0F0F",
"#. c #583030",
"$. c #A69191",
"%. c #5F3939",
"&. c #633E3E",
"*. c #654040",
"=. c #6D4E4E",
"-. c #F2F7F7",
";. c #6D4B4B",
">. c #EBEDED",
",. c #E6E6E6",
"'. c #F4F4F4",
"). c #BFB0B0",
"!. c #1A0000",
"~. c #FBFAFA",
"{. c #A08A8A",
"]. c #250000",
"^. c #F4F1F1",
"/. c #FDFCFC",
"(. c #FAF9F9",
"_. c #E8E7E7",
":. c #EDF1F1",
"<. c #694747",
"[. c #E3E5E5",
"}. c #DBDBDB",
"|. c #C0B1B1",
"1. c #572E2F",
"2. c #CCC0C0",
"3. c #AA9696",
"4. c #F4F5F5",
"5. c #E6E1E1",
"6. c #DCD6D6",
"7. c #6B4949",
"8. c #FDFFFF",
"9. c #F7F7F7",
"0. c #FEFEFD",
"a. c #DEDEDD",
"b. c #EDEEED",
"c. c #B4A3A3",
"d. c #0D0000",
"e. c #F4F3F3",
"f. c #4A1E1F",
"g. c #A48E8E",
"h. c #4C2222",
"i. c #6D4B4A",
"j. c #614040",
"k. c #745656",
"l. c #B0A1A1",
"m. c #E7E9E9",
"n. c #7C5F5E",
"o. c #350606",
"p. c #512C2D",
"q. c #DFDFDE",
"r. c #DBDCDC",
"s. c #DBDADA",
"t. c #EBEBEA",
"u. c #191818",
"v. c #191918",
"w. c #EDEBE8",
"x. c #DAD8D6",
"y. c #E2E0DD",
"z. c #DFDDDA",
"A. c #E1DFDC",
"B. c #E3E1DD",
"C. c #D8D6D3",
"D. c #D2CCCA",
"E. c #E0DEDA",
"F. c #DFDEDB",
"G. c #DCDAD8",
"H. c #D4CFCC",
"I. c #D8D4D0",
"J. c #E6E4E0",
"K. c #DEDAD6",
"L. c #E7E2DE",
"M. c #DFDBD7",
"N. c #E4E2DE",
"O. c #E1DEDA",
"P. c #D9D5D1",
"Q. c #DAD5D1",
"R. c #E5E3DF",
"S. c #E5E3E0",
"T. c #E6E3E0",
"U. c #F5F3EF",
"V. c #C5C3BE",
"W. c #B4B3AF",
"X. c #B7B5B1",
"Y. c #BBB9B4",
"Z. c #BEBCB8",
"`. c #D6D4CF",
" + c #B1AFAB",
".+ c #B2B1AD",
"++ c #D2D0CB",
"@+ c #CAC8C3",
"#+ c #B5B3AF",
"$+ c #CECBC6",
"%+ c #D7D5CF",
"&+ c #DCDAD4",
"*+ c #DBD9D4",
"=+ c #D9D7D2",
"-+ c #D9D8D3",
";+ c #E9E7E2",
">+ c #181817",
",+ c #E7E5E0",
"'+ c #D6D5D0",
")+ c #D7D6D1",
"!+ c #D8D7D2",
"~+ c #D8D6D1",
"{+ c #D5D4CF",
"]+ c #D7D5D0",
"^+ c #DAD8D4",
"/+ c #DAD8D3",
"(+ c #DCDAD5",
"_+ c #DDDBD6",
":+ c #DDDCD7",
"<+ c #DFDDD8",
"[+ c #DBDAD5",
"}+ c #DDDBD7",
"|+ c #DCDBD6",
"1+ c #DDDCD6",
"2+ c #EAE9E4",
"3+ c #ECEAE4",
"4+ c #BEBCB7",
"5+ c #DFDDD7",
"6+ c #E1DFDA",
"7+ c #C1C0BB",
"8+ c #DEDCD7",
"9+ c #BFBEB9",
"0+ c #DEDCD6",
"a+ c #C7C6C1",
"b+ c #DDDCD8",
"c+ c #DDDAD5",
"d+ c #C6C4C0",
"e+ c #CCCAC6",
"f+ c #E1DED9",
"g+ c #B0AFAB",
"h+ c #D7D5D1",
"i+ c #CECCC7",
"j+ c #E4E2DC",
"k+ c #D3D1CD",
"l+ c #D4D2CD",
"m+ c #D4D2CE",
"n+ c #D2D0CC",
"o+ c #D5D3CF",
"p+ c #CBC9C5",
"q+ c #D1CFC9",
"r+ c #DCDBD7",
"s+ c #DFDED9",
"t+ c #E0DFDA",
"u+ c #E1E0DB",
"v+ c #DEDDD7",
"w+ c #EEEDE8",
"x+ c #E5E3DE",
"y+ c #E0DED9",
"z+ c #E3E1DC",
"A+ c #BDB2AE",
"B+ c #866C69",
"C+ c #D5D3CE",
"D+ c #EAE8E3",
"E+ c #E6E4DF",
"F+ c #CDCBC6",
"G+ c #A2A09D",
"H+ c #AAA8A4",
"I+ c #A9A8A3",
"J+ c #A9A7A3",
"K+ c #CDCBC7",
"L+ c #C0BEB8",
"M+ c #DEDDD8",
"N+ c #ADACA8",
"O+ c #816D6B",
"P+ c #200000",
"Q+ c #BABAB6",
"R+ c #B2B0AC",
"S+ c #B4B2AE",
"T+ c #A6A4A0",
"U+ c #A6A5A1",
"V+ c #A8A6A2",
"W+ c #C7C5C1",
"X+ c #D2CDC9",
"Y+ c #D0CCC7",
"Z+ c #D4D0CC",
"`+ c #D2CDC8",
" @ c #D8D4CF",
".@ c #D8D3CF",
"+@ c #D6D1CC",
"@@ c #D6D2CD",
"#@ c #D5D1CD",
"$@ c #B5B0AA",
"%@ c #D3CFCB",
"&@ c #D5D1CC",
"*@ c #DCD9D5",
"=@ c #E2E0DB",
"-@ c #96807D",
";@ c #D9D5D0",
">@ c #E3E1DB",
",@ c #DBD6D1",
"'@ c #D7D2CE",
")@ c #DAD7D3",
"!@ c #EBE8E3",
"~@ c #171716",
"{@ c #E6E6E1",
"]@ c #421615",
"^@ c #2A0000",
"/@ c #775B59",
"(@ c #552F2D",
"_@ c #370909",
":@ c #735653",
"<@ c #6A4A48",
"[@ c #4E2625",
"}@ c #4D2525",
"|@ c #B8B0AB",
"1@ c #C2BBB7",
"2@ c #613E3D",
"3@ c #5F3B3A",
"4@ c #5F3C3A",
"5@ c #512928",
"6@ c #A2928F",
"7@ c #CECAC5",
"8@ c #471C1B",
"9@ c #2C0000",
"0@ c #623F3E",
"a@ c #856C6A",
"b@ c #7F6562",
"c@ c #4D2624",
"d@ c #62403F",
"e@ c #4F2827",
"f@ c #846B69",
"g@ c #DDD9D4",
"h@ c #181717",
"i@ c #F6F8F2",
"j@ c #4E2524",
"k@ c #380909",
"l@ c #C6BEBA",
"m@ c #522A29",
"n@ c #D3CECA",
"o@ c #D1CCC7",
"p@ c #220000",
"q@ c #9E8B88",
"r@ c #D5D2CD",
"s@ c #E9EBE6",
"t@ c #E9EBE5",
"u@ c #856B68",
"v@ c #401414",
"w@ c #E2E1DC",
"x@ c #9D8A87",
"y@ c #E3E2DD",
"z@ c #E3E3DD",
"A@ c #947F7C",
"B@ c #2D0000",
"C@ c #A39B98",
"D@ c #CED1CD",
"E@ c #A69F9D",
"F@ c #2B0000",
"G@ c #9E8C89",
"H@ c #F0F1EB",
"I@ c #4D2423",
"J@ c #3B0C0C",
"K@ c #E0E1DA",
"L@ c #E2E3DD",
"M@ c #63403E",
"N@ c #DBDBD4",
"O@ c #D8D7D1",
"P@ c #97837F",
"Q@ c #D7D6CF",
"R@ c #B6ABA7",
"S@ c #330505",
"T@ c #DDDDD7",
"U@ c #DCDCD6",
"V@ c #674745",
"W@ c #320101",
"X@ c #310100",
"Y@ c #8F7875",
"Z@ c #171817",
"`@ c #3B0D0C",
" # c #E2E3DE",
".# c #644240",
"+# c #DCDCD7",
"@# c #94807E",
"## c #3A0B0B",
"$# c #603E3C",
"%# c #CFCCC7",
"&# c #E3E5E0",
"*# c #876F6D",
"=# c #D5D5D0",
"-# c #94807D",
";# c #6E4F4D",
"># c #E6E8E2",
",# c #E4E6E0",
"'# c #E7E9E3",
")# c #EFEFE9",
"!# c #F9FBF5",
"~# c #3B0D0D",
"{# c #EBECE7",
"]# c #664442",
"^# c #E5E5E0",
"/# c #95827F",
"(# c #BDBEBA",
"_# c #340605",
":# c #60403E",
"<# c #CBCAC5",
"[# c #AAA09D",
"}# c #411515",
"|# c #BBBBB7",
"1# c #8B7976",
"2# c #D7D3CE",
"3# c #EAECE6",
"4# c #B6A9A6",
"5# c #7D605E",
"6# c #A69592",
"7# c #BCADA9",
"8# c #1A1A19",
"9# c #E1E1DB",
"0# c #491F1E",
"a# c #380908",
"b# c #D3D3CD",
"c# c #D3D4CD",
"d# c #5E3B39",
"e# c #CECDC7",
"f# c #CAC8C2",
"g# c #8D7874",
"h# c #C8C5BF",
"i# c #A79A95",
"j# c #461D1C",
"k# c #340303",
"l# c #56302E",
"m# c #664644",
"n# c #CCCBC5",
"o# c #B4ABA6",
"p# c #603D3B",
"q# c #D0CFC9",
"r# c #A89B97",
"s# c #502928",
"t# c #330403",
"u# c #3D1110",
"v# c #715351",
"w# c #C7BFB9",
"x# c #171616",
"y# c #F1F0EB",
"z# c #EBEDE8",
"A# c #ECEEE9",
"B# c #E8EAE4",
"C# c #EDF0EA",
"D# c #E3E3DE",
"E# c #EAECE7",
"F# c #ECEEE8",
"G# c #E8E9E4",
"H# c #EDEFEA",
"I# c #E2E2DD",
"J# c #EAEBE6",
"K# c #E7E8E3",
"L# c #EBE9E4",
"M# c #DBD8D3",
"N# c #E9E6E1",
"O# c #DFDCD6",
"P# c #CECCC6",
"Q# c #DCD9D3",
"R# c #E0DEDB",
"S# c #EFEDE9",
"T# c #EFEDE7",
"U# c #EBE9E2",
"V# c #151514",
". + @ # $ % $ & & + + $ @ # # * = + % $ - # # - % @ $ & & ; > , ",
"@ ' ' ' ) ! ~ { { ] ^ / ' ' ' ' ( _ : / ' ' ' ' < ' ) [ { ' ' - ",
"- _ ^ } { : | { 1 ' < < 2 ' ' ' 3 [ 4 < 5 ' ' 5 } ' 5 6 7 [ ' - ",
"; 7 _ } 8 9 0 a b } c 3 ^ ' ' ' d 1 9 3 / ' e f g h ] i g ( / + ",
"@ } ] } j k { _ ' ' 5 ^ ' ' ' ' 1 / { k k l m n ' ' o { k p ' - ",
"- } } ' q ~ o ' ' ' ' ' ' ' ' ' r ' ' { q ' s t ' } j c 1 ~ p ; ",
"# ' ] ' ' ' ' u v w x y z A ' B C D E F ' G H H I J 5 ( k [ ' - ",
"; ' ' ' ' ' ' K L M ! N O P Q R S T U V W ' s X Y 8 j Z 8 : o ; ",
"* ' ' ' ~ < i ` ...+.' @.#.$.s %.&.*.m =.-.s ;.>.,.p 8 1 { ' - ",
"; [ 5 } '.' } ).!.~.' ' @.#.{.].^./.^ (._.:.s <.[.h { h }.< j + ",
"# ' ] ' o ~ ' |.!.~.2 ' @.1.2.R 3.' 4.5.6.' R 7.8.' [ 9./ 2 ' @ ",
"; k 5 0.c a.b.c.d.e.p ' H f.' g.h.i.j.k.l.m.n.o.p.j q.r.s.t.j u.",
"v.w.x.y.z.A.B.C.D.E.F.G.H.I.J.B.K.L.M.M.N.J.O.P.Q.R.S.T.J.J.U.; ",
"& V.W.X.Y.Z.`. +.+++@+#+$+%+&+*+*+=+N.-+*+*+*+*+*+*+*+*+*+*+;+>+",
">+,+'+)+!+-+~+{+]+~+^+-+*+/+(+_+:+<+[+_+}+[+|+:+:+(+1+:+:+-+2+u.",
"+ 3+4+]+5+6+7+^+8+_+9+_+0+~+a+_+(+b+c+(+(+d+e+8+f+g+h+(+(+i+j+u.",
">+R.k+k+l+m+n+m+k+l+k+m+o+`.p+q+:+r+s+t+u+u+s+t+t+v+t+t+t+s+w+v.",
"> x+_+_+_+*+(+5+<+<+0+y+j+z+<+4+-+(+(+)+A+B+`.m+C+8+(+8+]+c+D++ ",
"> E+(+(+<+F+G+H+I+J+@+K+(+(+y+L+M+(+(+N+O+P+Q+R+S+T+U+V+W+<+D++ ",
"> B.X+Y+Z+`+ @c+.@+@@@*+=+=+#@$@%@&@*@=@-@P+ @;@>@]+,@.@'@)@!@+ ",
"~@{@]@^@/@(@_@:@<@[@}@|@$+1@2@3@4@5@6@7@8@9@0@a@`.b@c@d@e@f@g@h@",
"v.i@j@k@l@_+s m@n@o@p@q@(+)@r@s@t@u@v@w@x@m y@z@A@B@C@D@E@F@G@$ ",
"+ H@I@J@K@L@R M@N@O@P+P@Q@R@5@S@H H V T@P@P+O@U@V@H W@W@W@X@Y@Z@",
">+H@I@`@ # #R .#+#!+P+@#'+##$#%#&#*#I =#-#P+-+|+;#R +#>#,#'#)#>+",
"v.!#[@~#{#{#s ]#^#u+P+/#(#_#:#<#[#}#V |#1#p@2#3#4#9@5#w@/+6#7#8#",
"~@9#0#a#b#c#9@d#e#f#m g#h#i#j#k#l#m#I n#o#}@H p#q#r#s#t#u#v#w#x#",
"; y#3#z#t+t+A#B#t+u+C#^#u+D#E#F#t@G#H#6+I#J#A#B#t+D#s@A#z#K#y#v.",
"v.L#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#M#N#>+",
"> O#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#P#Q#~@",
"; y#E.R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#R#S#v.",
"v.T#&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+&+U#+ ",
", ~@V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#V#~@, "};
netmate-0.2.0/tooltips.h 0000664 0000000 0000000 00000075614 12242060236 0015206 0 ustar 00root root 0000000 0000000 /*******************************************************************************
*
* Copyright (c) 2013 Robert Krause (ruport@f00l.de)
*
* This file is part of Netmate.
*
* Netmate 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 3 of the License, or any later version.
*
* Netmate 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
* Netmate. If not, see http://www.gnu.org/licenses/.
*
******************************************************************************/
/* LAYER 2 */
/* ETHERNET */
#define ETHERNET_DESTINATION "Destination MAC Address\n\nEthernet and IEEE 802.3 addresses are 6 bytes long. Addresses are contained in hardware on the Ethernet and IEEE 802.3 interface cards. The first 3 bytes of the addresses are specified by the IEEE on a vendor-dependent basis, while the last 3 bytes are specified by the Ethernet or IEEE 802.3 vendor. The source address is always a unicast (single node) address, while the destination address may be unicast, multicast (group), or broadcast (all nodes).\n\n[IEEE802.3]"
#define ETHERNET_SOURCE "Source MAC Address\n\nEthernet and IEEE 802.3 addresses are 6 bytes long. Addresses are contained in hardware on the Ethernet and IEEE 802.3 interface cards. The first 3 bytes of the addresses are specified by the IEEE on a vendor-dependent basis, while the last 3 bytes are specified by the Ethernet or IEEE 802.3 vendor. The source address is always a unicast (single node) address, while the destination address may be unicast, multicast (group), or broadcast (all nodes).\n\n[IEEE802.3]"
#define ETHERNET_TYPE "Protocol Type\n\nThis field specifies the upper-layer protocol to receive the data after Ethernet processing is complete.\n\n[IEEE802.3]"
/* SLL (Linux Cooked) */
#define SLL_PACKET_TYPE "Packet Type\n\nThe packet type field is in network byte order (big-endian); it contains a value that is one of:\n\t0, if the packet was specifically sent to us by somebody else;\n\t1, if the packet was broadcast by somebody else;\n\t2, if the packet was multicast, but not broadcast, by somebody else;\n\t3, if the packet was sent to somebody else by somebody else;\n\t4, if the packet was sent by us.\n\n[www.tcpdump.org]"
#define SLL_ARPHRD_TYPE "ARPHRD_ Type\n\nThe ARPHRD_ type field is in network byte order; it contains a Linux ARPHRD_ value for the link-layer device type.\n\n[www.tcpdump.org]"
#define SLL_LLA_LENGTH "Link-layer Address Length\n\nThe link-layer address length field is in network byte order; it contains the length of the link-layer address of the sender of the packet. That length could be zero.\n\n[www.tcpdump.org]"
#define SLL_LLA "Link-layer Address\n\nThe link-layer address field contains the link-layer address of the sender of the packet; the number of bytes of that field that are meaningful is specified by the link-layer address length field. If there are more than 8 bytes, only the first 8 bytes are present, and if there are fewer than 8 bytes, there are padding bytes after the address to pad the field to 8 bytes.\n\n[www.tcpdump.org]"
#define SLL_PROTOCOL "Protocol Type\n\nThe protocol type field is in network byte order; it contains an Ethernet protocol type, or one of:\n\t1, if the frame is a Novell 802.3 frame without an 802.2 LLC header;\n\t4, if the frame begins with an 802.2 LLC header.\n\n[www.tcpdump.org]"
/* NDP */
#define NDP_RS_RESERVED "Reserved\n\nThis field is unused. It MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_RA_CHLIMIT "Cur Hop Limit\n\n8-bit unsigned integer. The default value that should be placed in the Hop Count field of the IP header for outgoing IP packets. A value of zero means unspecified (by this router).\n\n[RFC4861]"
#define NDP_RA_MACONFIG "Managed address configuration\n\nWhen set, it indicates that addresses are available via Dynamic Host Configuration Protocol (DHCPv6).\n\nIf the M flag is set, the O flag is redundant and can be ignored because DHCPv6 will return all available configuration information.\n\n[RFC4861]"
#define NDP_RA_OCONFIG "Other configuration\n\nWhen set, it indicates that other configuration information is available via DHCPv6. Examples of such information are DNS-related information or information on other servers within the network.\n\n[RFC4861]"
#define NDP_RA_RESERVED "Reserved\n\nA 6-bit unused field. It MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_RA_ROUTERLIFETIME "Router Lifetime\n\n16-bit unsigned integer. The lifetime associated with the default router in units of seconds. The field can contain values up to 65535 and receivers should handle any value, while the sending rules limit the lifetime to 9000 seconds. A Lifetime of 0 indicates that the router is not a default router and SHOULD NOT appear on the default router list. The Router Lifetime applies only to the router's usefulness as a default router; it does not apply to information contained in other message fields or options. Options that need time limits for their information include their own lifetime fields.\n\n[RFC4861]"
#define NDP_RA_REACHTIME "Reachable Time\n\n32-bit unsigned integer. The time, in milliseconds, that a node assumes a neighbor is reachable after having received a reachability confirmation. Used by the Neighbor Unreachability Detection algorithm. A value of zero means unspecified (by this router).\n\n[RFC4861]"
#define NDP_RA_RETRANSTIMER "Retrans Timer\n\n32-bit unsigned integer. The time, in milliseconds, between retransmitted Neighbor Solicitation messages. Used by address resolution and the Neighbor Unreachability Detection algorithm. A value of zero means unspecified (by this router).\n\n[RFC4861]"
#define NDP_NS_RESERVED "Reserved\n\nThis field is unused. It MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_NS_TARGET "Target Address\n\nThe IP address of the target of the solicitation. It MUST NOT be a multicast address.\n\n[RFC4861]"
#define NDP_NA_RESERVED "Reserved\n\n29-bit unused field. It MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_NA_ROUTER "Router Flag\n\nWhen set, the R-bit indicates that the sender is a router. The R-bit is used by Neighbor Unreachability Detection to detect a router that changes to a host.\n\n[RFC4861]"
#define NDP_NA_SOLICITED "Solicited Flag\n\nWhen set, the S-bit indicates that the advertisement was sent in response to a Neighbor Solicitation from the Destination address. The S-bit is used as a reachability confirmation for Neighbor Unreachability Detection. It MUST NOT be set in multicast advertisements or in unsolicited unicast advertisements.\n\n[RFC4861]"
#define NDP_NA_OVERRIDE "Override Flag\n\nWhen set, the O-bit indicates that the advertisement should override an existing cache entry and update the cached link-layer address. When it is not set the advertisement will not update a cached link-layer address though it will update an existing Neighbor Cache entry for which no link-layer address is known. It SHOULD NOT be set in solicited advertisements for anycast addresses and in solicited proxy advertisements. It SHOULD be set in other solicited advertisements and in unsolicited advertisements.\n\n[RFC4861]"
#define NDP_NA_TARGET "Target Address\n\nFor solicited advertisements, the Target Address field in the Neighbor Solicitation message that prompted this advertisement. For an unsolicited advertisement, the address whose link-layer address has changed. The Target Address MUST NOT be a multicast address.\n\n[RFC4861]"
#define NDP_R_RESERVED "Reserved\n\nThis field is unused. It MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_R_TARGET "Target Address\n\nAn IP address that is a better first hop to use for the ICMP Destination Address. When the target is the actual endpoint of communication, i.e., the destination is a neighbor, the Target Address field MUST contain the same value as the ICMP Destination Address field. Otherwise, the target is a better first-hop router and the Target Address MUST be the router's link-local address so that hosts can uniquely identify routers.\n\n[RFC4861]"
#define NDP_R_DEST "Destination Address\n\nThe IP address of the destination that is redirected to the target.\n\n[RFC4861]"
#define NDP_OPTION_TYPE "Type\n\n8-bit identifier of the type of option. The options defined in this document are:\n\t1 = Source Link-Layer Address\n\t2 = Target Link-Layer Address\n\t3 = Prefix Information\n\t4 = Redirected Header\n\t5 = MTU\n\n[RFC4861]"
#define NDP_OPTION_LENGTH "Length\n\n8-bit unsigned integer. The length of the option (including the type and length fields) in units of 8 octets. The value 0 is invalid. Nodes MUST silently discard an ND packet that contains an option with length zero.\n\n[RFC4861]"
#define NDP_OPTION_SOURCELLA "Source Link-layer Address\n\nThe Source Link-Layer Address option contains the link-layer address of the sender of the packet. It is used in the Neighbor Solicitation, Router Solicitation, and Router Advertisement packets.\n\n[RFC4861]"
#define NDP_OPTION_TARGETLLA "Target Link-layer Address\n\nThe Target Link-Layer Address option contains the link-layer address of the target. It is used in Neighbor Advertisement and Redirect packets.\n\n[RFC4861]"
#define NDP_OPTION_PREFLEN "Prefix Length\n\nThe number of leading bits in the Prefix that are valid. The value ranges from 0 to 128. The prefix length field provides necessary information for on-link determination (when combined with the L flag in the prefix information option). It also assists with address autoconfiguration, for which there may be more restrictions on the prefix length.\n\n[RFC4861]"
#define NDP_OPTION_PREFLINK "On-Link Flag\n\nWhen set, indicates that this prefix can be used for on-link determination. When not set the advertisement makes no statement about on-link or off-link properties of the prefix. In other words, if the L flag is not set a host MUST NOT conclude that an address derived from the prefix is off-link. That is, it MUST NOT update a previous indication that the address is on-link.\n\n[RFC4861]"
#define NDP_OPTION_PREFAUTO "Autonomous Address-Configuration Flag\n\nWhen set indicates that this prefix can be used for stateless address configuration.\n\n[RFC4861]"
#define NDP_OPTION_PREFRES "Reserved\n\nThis field is unused. It MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_OPTION_PREFVLT "Valid Lifetime\n\nThe length of time in seconds (relative to the time the packet is sent) that the prefix is valid for the purpose of on-link determination. A value of all one bits (0xffffffff) represents infinity.\n\n[RFC4861]"
#define NDP_OPTION_PREFPLT "Preferred Lifetime\n\nThe length of time in seconds (relative to the time the packet is sent) that addresses generated from the prefix via stateless address autoconfiguration remain preferred. A value of all one bits (0xffffffff) represents infinity.\n\n[RFC4861]"
#define NDP_OPTION_PREFIX "Prefix\n\nAn IP address or a prefix of an IP address. The Prefix Length field contains the number of valid leading bits in the prefix. The bits in the prefix after the prefix length are reserved and MUST be initialized to zero by the sender and ignored by the receiver. A router SHOULD NOT send a prefix option for the link-local prefix and a host SHOULD ignore such a prefix option.\n\n[RFC4861]"
#define NDP_OPTION_RHRES "Reserved\n\nThese fields are unused. They MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_OPTION_RHDATA "IP Header + Data\n\nThe original packet truncated to ensure that the size of the redirect message does not exceed the minimum MTU required to support IPv6.\n\n[RFC4861]"
#define NDP_OPTION_MTURES "Reserved\n\nThese fields are unused. They MUST be initialized to zero by the sender and MUST be ignored by the receiver.\n\n[RFC4861]"
#define NDP_OPTION_MTU "MTU\n\nThe recommended MTU for the link.\n\n[RFC4861]"
/* LAYER 3 */
/* IPv4 */
#define IPV4_VERSION "Version\n\nThe Version field indicates the format of the internet header.\n\n[RFC791]"
#define IPV4_IHL "Internet Header Length (IHL)\n\nInternet Header Length is the length of the internet header in 32 bit words, and thus points to the beginning of the data. Note that the minimum value for a correct header is 5.\n\n[RFC791]"
#define IPV4_DCSP "Differentiated Services Field Definition (DCSP)\n\nA replacement header field, called the DS field, is defined, which is intended to supersede the existing definitions of the IPv4 TOS octet [RFC791] and the IPv6 Traffic Class octet [IPv6].\n\nSix bits of the DS field are used as a codepoint (DSCP) to select the PHB a packet experiences at each node. A two-bit currently unused (CU) field is reserved and its definition and interpretation are outside the scope of this document. The value of the CU bits are ignored by differentiated services-compliant nodes when determining the per-hop behavior to apply to a received packet.\n\n[RFC2474]"
#define IPV4_ECN "Explicit Congestion Notification (ECN)\n\nThe ECN field in the IP header is used with two bits, making four ECN codepoints, '00' to '11'. The ECN-Capable Transport (ECT) codepoints '10' and '01' are set by the data sender to indicate that the end-points of the transport protocol are ECN-capable; we call them ECT(0) and ECT(1) respectively. The phrase 'the ECT codepoint' in this documents refers to either of the two ECT codepoints. Routers treat the ECT(0) and ECT(1) codepoints as equivalent. Senders are free to use either the ECT(0) or the ECT(1) codepoint to indicate ECT, on a packet-by-packet basis.\n\n[RFC3168]"
#define IPV4_TOTLEN "Total Length\n\nTotal Length is the length of the datagram, measured in octets, including internet header and data. This field allows the length of a datagram to be up to 65,535 octets. Such long datagrams are impractical for most hosts and networks. All hosts must be prepared to accept datagrams of up to 576 octets (whether they arrive whole or in fragments). It is recommended that hosts only send datagrams larger than 576 octets if they have assurance that the destination is prepared to accept the larger datagrams.\n\n[RFC791]"
#define IPV4_IDENTIFICATION "Identification\n\nAn identifying value assigned by the sender to aid in assembling the fragments of a datagram.\n\n[RFC791]"
#define IPV4_FLAG_RESERVED "Flag: Reserved\n\nBit 0: reserved, must be zero\n\n[RFC791]"
#define IPV4_FLAG_DF "Flag: Don't Fragment\n\nBit 1: (DF)\n\t0 = May Fragment,\n\t1 = Don't Fragment.\n\n[RFC791]"
#define IPV4_FLAG_MF "Flag: More Fragments\n\nBit 2: (MF)\n\t0 = Last Fragment,\n\t1 = More Fragments.\n\n[RFC791]"
#define IPV4_FRAGOFF "Fragment Offset\n\nThis field indicates where in the datagram this fragment belongs. The fragment offset is measured in units of 8 octets (64 bits). The first fragment has offset zero.\n\n[RFC791]"
#define IPV4_TTL "Time to Live (TTL)\n\nThis field indicates the maximum time the datagram is allowed to remain in the internet system. If this field contains the value zero, then the datagram must be destroyed. This field is modified in internet header processing. The time is measured in units of seconds, but since every module that processes a datagram must decrease the TTL by at least one even if it process the datagram in less than a second, the TTL must be thought of only as an upper bound on the time a datagram may exist. The intention is to cause undeliverable datagrams to be discarded, and to bound the maximum datagram lifetime.\n\n[RFC791]"
#define IPV4_PROTOCOL "Protocol\n\nThis field indicates the next level protocol used in the data portion of the internet datagram. The values for various protocols are specified in 'Assigned Numbers'.\n\n[RFC791]"
#define IPV4_CHECKSUM "Header Checksum\n\nA checksum on the header only. Since some header fields change (e.g., time to live), this is recomputed and verified at each point that the internet header is processed.\n\nThe checksum algorithm is:\n\nThe checksum field is the 16 bit one's complement of the one's complement sum of all 16 bit words in the header. For purposes of computing the checksum, the value of the checksum field is zero.\n\nThis is a simple to compute checksum and experimental evidence indicates it is adequate, but it is provisional and may be replaced by a CRC procedure, depending on further experience.\n\n[RFC791]"
#define IPV4_SOURCE "Source Address\n\nThe source address.\n\n[RFC791]"
#define IPV4_DESTINATION "Destination Address\n\nThe destination address.\n\n[RFC791]"
#define IPV4_OPTION_FLAG_COPIED "Copied Flag\n\nThe copied flag indicates that this option is copied into all fragments on fragmentation.\n\t0 = not copied\n\t1 = copied\n\n[RFC791]"
#define IPV4_OPTION_CLASS "Option Class\n\nThe option classes are:\n\t0 = control\n\t1 = reserved for future use\n\t2 = debugging and measurement\n\t3 = reserved for future use\n\n[RFC791]"
#define IPV4_OPTION_NUMBER "Option Number\n\nThe following internet options are defined:\n\t0 - End of Option list. This option occupies only 1 octet; it has no length octet.\n\t1 - No Operation. This option occupies only 1 octet; it has no length octet.\n\t2 - Security. Used to carry Security, Compartmentation, User Group (TCC), and Handling Restriction Codes compatible with DOD requirements. [RFC1108]\n\t3 - Loose Source Routing. Used to route the internet datagram based on information supplied by the source.\n\t4 - Internet Timestamp.\n\t5 - Extended Security. [RFC1108]\n\t6 - Commercial Security.\n\t7 - Record Route. Used to trace the route an internet datagram takes.\n\t8 - Stream ID. Used to carry the stream identifier.\n\t9 - Strict Source Routing. Used to route the internet datagram based on information supplied by the source.\n\t10 - Experimental Measurement.\n\t11 - MTU Probe. [RFC1063] [RFC1191]\n\t12 - MTU Reply. [RFC1063] [RFC1191]\n\t13 - Experimental Flow Control.\n\t14 - Experimental Access Control. [RFC6814]\n\t15 - Encoding. [RFC6814]\n\t16 - IMI Traffic Descriptor.\n\t17 - Extended Internet Protocol. [RFC1385] [RFC6814]\n\t18 - Traceroute. [RFC1393] [RFC6814]\n\t19 - Address Extension. [RFC6814]\n\t20 - Router Alert. [RFC2113]\n\t21 - Selective Directed Broadcast. [RFC6814]\n\t23 - Dynamic Packet State. [RFC6814]\n\t24 - Upstream Multicast Pkt. [RFC6814]\n\t25 - Quick-Start. [RFC4782]\n\t30 - RFC3692-style Experiment [RFC4727]\n\n[RFC791]"
#define IPV4_OPTION_LENGTH "Option Length\n\nThe length of the option (including header and data).\n\n[RFC791]"
#define IPV4_OPTION_DATA "Option Data\n\nThe data carried by the option.\n\n[RFC791]"
/* IPV6 */
#define IPV6_VERSION "Version\n\n4-bit Internet Protocol version number = 6.\n\n[RFC2460]"
#define IPV6_TC "Traffic Class\n\nThe 8-bit Traffic Class field in the IPv6 header is available for use by originating nodes and/or forwarding routers to identify and distinguish between different classes or priorities of IPv6 packets. At the point in time at which this specification is being written, there are a number of experiments underway in the use of the IPv4 Type of Service and/or Precedence bits to provide various forms of 'differentiated service' for IP packets, other than through the use of explicit flow set-up. The Traffic Class field in the IPv6 header is intended to allow similar functionality to be supported in IPv6.\n\n[RFC2460]"
#define IPV6_FLOW "Flow Label\n\nThe 20-bit Flow Label field in the IPv6 header may be used by a source to label sequences of packets for which it requests special handling by the IPv6 routers, such as non-default quality of service or 'real-time' service. This aspect of IPv6 is, at the time of writing, still experimental and subject to change as the requirements for flow support in the Internet become clearer. Hosts or routers that do not support the functions of the Flow Label field are required to set the field to zero when originating a packet, pass the field on unchanged when forwarding a packet, and ignore the field when receiving a packet.\n\n[RFC2460]"
#define IPV6_PAYLEN "Payload Length\n\n16-bit unsigned integer. Length of the IPv6 payload, i.e., the rest of the packet following this IPv6 header, in octets. (Note that any extension headers present are considered part of the payload, i.e., included in the length count.)\n\n[RFC2460]"
#define IPV6_NEXT_HEADER "Next Header\n\n8-bit selector. Identifies the type of header immediately following the IPv6 header. Uses the same values as the IPv4 Protocol field [RFC-1700 et seq.].\n\n[RFC2460]"
#define IPV6_HOP_LIMIT "Hop Limit\n\n8-bit unsigned integer. Decremented by 1 by each node that forwards the packet. The packet is discarded if Hop Limit is decremented to zero.\n\n[RFC2460]"
#define IPV6_SOURCE "Source Address\n\n128-bit address of the originator of the packet.\n\n[RFC2460]"
#define IPV6_DESTINATION "Destination Address\n\n128-bit address of the intended recipient of the packet (possibly not the ultimate recipient, if a Routing header is present).\n\n[RFC2460]"
#define IPV6_HDR_EXT_LEN "Header Externsion Length\n\n8-bit unsigned integer. Length of the Hop-by-Hop Options header in 8-octet units, not including the first 8 octets.\n\n[RFC2460]"
#define IPV6_OPTION_TYPE "Option Type\n\n8-bit identifier of the type of option.\n\n[RFC2460]"
#define IPV6_OPTION_LENGTH "Option Length\n\n8-bit unsigned integer. Length of the Option Data field of this option, in octets.\n\n[RFC2460]"
#define IPV6_OPTION_DATA "Option Data\n\nVariable-length field. Option-Type-specific data.\n\n[RFC2460]"
/* ARP */
#define ARP_HTYPE "Hardware Type\n\nThis field specifies the hardware type.\n\n[RFC826]"
#define ARP_PTYPE "Protocol Type\n\nThis field specifies the protocol type.\n\n[RFC826]"
#define ARP_HLEN "Hardware Length\n\nThis field specifies the length of each hardware address in bytes.\n\n[RFC826]"
#define ARP_PLEN "Protocol Length\n\nThis field specifies the length of each protocol address in bytes.\n\n[RFC826]"
#define ARP_OPERATION "Operation\n\nThis field specifies the operation code. The following codes are possible:\n\t1 = ARP Request\n\t2 = ARP Reply\n\n[RFC826]"
#define ARP_HW_SENDER "Sender Hardware Address\n\nHardware address of sender of this packet. Length is specified in Hardware Length Field\n\n[RFC826]"
#define ARP_PROTO_SENDER "Sender Protocol Address\n\nProtocol address of sender of this packet. Length is specified in Protocol Length Field\n\n[RFC826]"
#define ARP_HW_TARGET "Target Hardware Address\n\nHardware address of target of this packet. Length is specified in Hardware Length Field\n\n[RFC826]"
#define ARP_PROTO_TARGET "Target Protocol Address\n\nProtocol address of target of this packet. Length is specified in Protocol Length Field\n\n[RFC826]"
/* ICMP */
#define ICMP_TYPE "Type\n\nThe first octet of the data portion of the datagram is a ICMP type field; the value of this field determines the format of the remaining data.\n\nThe following types are possible:\n\t0 = Echo Reply\n\t3 = Destination Unreachable\n\t4 = Source Quench\n\t5 = Redirect\n\t8 = Echo\n\t11 = Time Exceeded\n\t12 = Parameter Problem\n\t13 = Timestamp\n\t14 = Timestamp Reply\n\t15 = Information Request\n\t16 = Information Reply\n\n[RFC792]"
#define ICMP_CODE "Code\n\nThe sub code of the ICMP message. It depends on the ICMP type.\n\n[RFC792]"
#define ICMP_CHECKSUM "Checksum\n\nThe checksum is the 16-bit ones's complement of the one's complement sum of the ICMP message starting with the ICMP Type. For computing the checksum, the checksum field should be zero.\n\n[RFC792]"
#define ICMP_UNUSED "Unused\n\nAny field labeled 'unused' is reserved for later extensions and must be zero when sent, but receivers should not use these fields (except to include them in the checksum).\n\n[RFC792]"
#define ICMP_TIME_POINTER "Pointer\n\nIf code = 0, identifies the octet where an error was detected.\n\n[RFC792]"
#define ICMP_REDIRECT_GATEWAY "Gateway Internet Address\n\nAddress of the gateway to which traffic for the network specified in the internet destination network field of the original datagram's data should be sent.\n\n[RFC792]"
#define ICMP_ECHO_ID "Identifier\n\nIf code = 0, an identifier to aid in matching echos and replies, may be zero.\n\n[RFC792]"
#define ICMP_ECHO_SEQUENCE "Sequence Number\n\nIf code = 0, a sequence number to aid in matching echos and replies, may be zero.\n\n[RFC792]"
#define ICMP_DATA "Data\n\nFurther ICMP data. These fields depend on the ICMP type and sub code.\n\n[RFC792]"
/* ICMPV6 */
#define ICMPV6_TYPE "Type\n\nThe type field indicates the type of the message. Its value determines the format of the remaining data.\n\n[RFC4443]"
#define ICMPV6_CODE "Code\n\nThe code field depends on the message type. It is used to create an additional level of message granularity.\n\n[RFC4443]"
#define ICMPV6_CHECKSUM "Checksum\n\nThe checksum field is used to detect data corruption in the ICMPv6 message and parts of the IPv6 header.\n\n[RFC4443]"
#define ICMPV6_DATA "Data\n\nFurther ICMPv6 data. These fields depend on the ICMPv6 type and sub code.\n\n[RFC4443]"
/* LAYER 4 */
/* TCP */
#define TCP_SPORT "Source Port\n\nThe source port number.\n\n[RFC793]"
#define TCP_DPORT "Destination Port\n\nThe destination port number.\n\n[RFC793]"
#define TCP_SEQ_NUM "Sequence Number\n\nThe sequence number of the first data octet in this segment (except when SYN is present). If SYN is present the sequence number is the initial sequence number (ISN) and the first data octet is ISN+1.\n\n[RFC793]"
#define TCP_ACK_NUM "Acknowledgement Number\n\nIf the ACK control bit is set this field contains the value of the next sequence number the sender of the segment is expecting to receive. Once a connection is established this is always sent.\n\n[RFC793]"
#define TCP_DOFF "Data Offset\n\nThe number of 32 bit words in the TCP Header. This indicates where the data begins. The TCP header (even one including options) is an integral number of 32 bits long.\n\n[RFC793]"
#define TCP_FLAG_RES "Reserved\n\nReserved for future use. Must be zero.\n\n[RFC793]"
#define TCP_FLAG_NS "Nonce Sum (NS)\n\nThe ECN-nonce adds to this protocol, and enables the receiver to demonstrate to the sender that segments being acknowledged were received unmarked. A random one-bit value (a nonce) is encoded in the two ECT codepoints. The one-bit sum of these nonces is returned in a TCP header flag, the nonce sum (NS) bit. Packet marking erases the nonce value in the ECT codepoints because CE overwrites both ECN IP header bits. Since each nonce is required to calculate the sum, the correct nonce sum implies receipt of only unmarked packets. Not only are receivers prevented from concealing marked packets, middle-boxes along the network path cannot unmark a packet without successfully guessing the value of the original nonce.\n\n[RFC3540]"
#define TCP_FLAG_CWR "Congestion Window Reduce (CWR)\n\nFor TCP, ECN requires three new pieces of functionality:\n\t* negotiation between the endpoints during connection setup to determine if they are both ECN-capable;\n\t* an ECN-Echo (ECE) flag in the TCP header so that the data receiver can inform the data sender when a CE packet has been received;\n\t* and a Congestion Window Reduced (CWR) flag in the TCP header so that the data sender can inform the data receiver that the congestion window has been reduced.\n\n[RFC3168]"
#define TCP_FLAG_ECE "ECN-Echo (ECE)\n\nFor TCP, ECN requires three new pieces of functionality:\n\t* negotiation between the endpoints during connection setup to determine if they are both ECN-capable;\n\t* an ECN-Echo (ECE) flag in the TCP header so that the data receiver can inform the data sender when a CE packet has been received;\n\t* and a Congestion Window Reduced (CWR) flag in the TCP header so that the data sender can inform the data receiver that the congestion window has been reduced.\n\n[RFC3168]"
#define TCP_FLAG_URG "Urgent (URG)\n\nIndicates that the Urgent pointer field is significant[RFC793]"
#define TCP_FLAG_ACK "Acknowledgement (ACK)\n\nIndicates that the Acknowledgment field is significant. All packets after the initial SYN packet sent by the client should have this flag set.\n\n[RFC793]"
#define TCP_FLAG_PSH "Push (PSH)\n\nPush function. Asks to push the buffered data to the receiving application.\n\n[RFC793]"
#define TCP_FLAG_RST "Reset (RST)\n\nReset the connection.\n\n[RFC793]"
#define TCP_FLAG_SYN "Synchronize (SYN)\n\nSynchronize sequence numbers. Only the first packet sent from each end should have this flag set. Some other flags change meaning based on this flag, and some are only valid for when it is set, and others when it is clear.\n\n[RFC793]"
#define TCP_FLAG_FIN "Finish (FIN)\n\nNo more data from sender.\n\n[RFC793]"
#define TCP_WINDOW_SIZE "Window Size\n\nThe number of data octets beginning with the one indicated in the acknowledgment field which the sender of this segment is willing to accept.\n\n[RFC793]"
#define TCP_CHECKSUM "Checksum\n\nThe checksum field is the 16 bit one's complement of the one's complement sum of all 16 bit words in the header and text. If a segment contains an odd number of header and text octets to be checksummed, the last octet is padded on the right with zeros to form a 16 bit word for checksum purposes. The pad is not transmitted as part of the segment. While computing the checksum, the checksum field itself is replaced with zeros.\n\n[RFC793]"
#define TCP_URGENT_POINTER "Urgent Pointer\n\nThis field communicates the current value of the urgent pointer as a positive offset from the sequence number in this segment. The urgent pointer points to the sequence number of the octet following the urgent data. This field is only be interpreted in segments with the URG control bit set.\n\n[RFC793]"
#define TCP_OPTION_KIND "Option Kind\n\nThe kind of option.\n\n[RFC793]"
#define TCP_OPTION_LENGTH "Option Length\n\nThe option-length counts the two octets of option-kind and option-length as well as the option-data octets.\n\n[RFC793]"
#define TCP_OPTION_DATA "Option Data\n\nThe data of the option. It depends of the option kind.\n\n[RFC793]"
/* UDP */
#define UDP_SPORT "Source Port\n\nSource Port is an optional field, when meaningful, it indicates the port of the sending process, and may be assumed to be the port to which a reply should be addressed in the absence of any other information. If not used, a value of zero is inserted.\n\n[RFC768]"
#define UDP_DPORT "Destination Port\n\nDestination Port has a meaning within the context of a particular internet destination address.\n\n[RFC768]"
#define UDP_LENGTH "Length is the length in octets of this user datagram including this header and the data. (This means the minimum value of the length is eight.)\n\n[RFC768]"
#define UDP_CHECKSUM "Checksum\n\nChecksum is the 16-bit one's complement of the one's complement sum of a pseudo header of information from the IP header, the UDP header, and the data, padded with zero octets at the end (if necessary) to make a multiple of two octets.\n\n[RFC768]"
netmate-0.2.0/win32.h 0000664 0000000 0000000 00000012054 12242060236 0014260 0 ustar 00root root 0000000 0000000 /*******************************************************************************
*
* Copyright (c) 2013 Robert Krause (ruport@f00l.de)
*
* This file is part of Netmate.
*
* Netmate 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 3 of the License, or any later version.
*
* Netmate 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
* Netmate. If not, see http://www.gnu.org/licenses/.
*
******************************************************************************/
#define ETH_ALEN 6 /* Octets in one ethernet addr */
#define ETHERTYPE_IP 0x0800 /* IP */
#define ETHERTYPE_ARP 0x0806 /* Address resolution */
#define ETHERTYPE_IPV6 0x86dd /* IP protocol version 6 */
struct arphdr
{
unsigned short int ar_hrd; /* Format of hardware address. */
unsigned short int ar_pro; /* Format of protocol address. */
unsigned char ar_hln; /* Length of hardware address. */
unsigned char ar_pln; /* Length of protocol address. */
unsigned short int ar_op; /* ARP opcode (command). */
#if 0
/* Ethernet looks like this : This bit is variable sized
however... */
unsigned char __ar_sha[ETH_ALEN]; /* Sender hardware address. */
unsigned char __ar_sip[4]; /* Sender IP address. */
unsigned char __ar_tha[ETH_ALEN]; /* Target hardware address. */
unsigned char __ar_tip[4]; /* Target IP address. */
#endif
};
struct ether_header
{
u_int8_t ether_dhost[ETH_ALEN]; /* destination eth addr */
u_int8_t ether_shost[ETH_ALEN]; /* source ether addr */
u_int16_t ether_type; /* packet type ID field */
} __attribute__ ((__packed__));
#define IP_RF 0x8000 /* reserved fragment flag */
#define IP_DF 0x4000 /* dont fragment flag */
#define IP_MF 0x2000 /* more fragments flag */
#define IP_OFFMASK 0x1fff /* mask for fragmenting bits */
#define IPOPT_COPY 0x80
#define IPOPT_CLASS_MASK 0x60
#define IPOPT_NUMBER_MASK 0x1f
struct iphdr
{
#if __BYTE_ORDER == __LITTLE_ENDIAN
u_int8_t ihl:4;
u_int8_t version:4;
#elif __BYTE_ORDER == __BIG_ENDIAN
u_int8_t ihl:4;
u_int8_t version:4;
#else
# error "Please fix "
#endif
u_int8_t tos;
u_int16_t tot_len;
u_int16_t id;
u_int16_t frag_off;
u_int8_t ttl;
u_int8_t protocol;
u_int16_t check;
u_int32_t saddr;
u_int32_t daddr;
/*The options start here. */
};
/* IPv6 address */
struct in6_addr
{
union
{
uint8_t __u6_addr8[16];
uint16_t __u6_addr16[8];
uint32_t __u6_addr32[4];
} __in6_u;
};
struct ip6_hdr
{
union
{
struct ip6_hdrctl
{
uint32_t ip6_un1_flow; /* 4 bits version, 8 bits TC,
20 bits flow-ID */
uint16_t ip6_un1_plen; /* payload length */
uint8_t ip6_un1_nxt; /* next header */
uint8_t ip6_un1_hlim; /* hop limit */
} ip6_un1;
uint8_t ip6_un2_vfc; /* 4 bits version, top 4 bits tclass */
} ip6_ctlun;
struct in6_addr ip6_src; /* source address */
struct in6_addr ip6_dst; /* destination address */
};
struct icmphdr
{
u_int8_t type; /* message type */
u_int8_t code; /* type sub-code */
u_int16_t checksum;
union
{
struct
{
u_int16_t id;
u_int16_t sequence;
} echo; /* echo datagram */
u_int32_t gateway; /* gateway address */
struct
{
u_int16_t __unused;
u_int16_t mtu;
} frag; /* path mtu discovery */
} un;
};
struct icmp6_hdr
{
uint8_t icmp6_type; /* type field */
uint8_t icmp6_code; /* code field */
uint16_t icmp6_cksum; /* checksum field */
union
{
uint32_t icmp6_un_data32[1]; /* type-specific field */
uint16_t icmp6_un_data16[2]; /* type-specific field */
uint8_t icmp6_un_data8[4]; /* type-specific field */
} icmp6_dataun;
};
struct tcphdr
{
u_int16_t source;
u_int16_t dest;
u_int32_t seq;
u_int32_t ack_seq;
# if __BYTE_ORDER == __LITTLE_ENDIAN
u_int16_t res1:4;
u_int16_t doff:4;
u_int16_t fin:1;
u_int16_t syn:1;
u_int16_t rst:1;
u_int16_t psh:1;
u_int16_t ack:1;
u_int16_t urg:1;
u_int16_t res2:2;
# elif __BYTE_ORDER == __BIG_ENDIAN
u_int16_t doff:4;
u_int16_t res1:4;
u_int16_t res2:2;
u_int16_t urg:1;
u_int16_t ack:1;
u_int16_t psh:1;
u_int16_t rst:1;
u_int16_t syn:1;
u_int16_t fin:1;
# else
# error "Adjust your defines"
# endif
u_int16_t window;
u_int16_t check;
u_int16_t urg_ptr;
};
struct udphdr
{
u_int16_t source;
u_int16_t dest;
u_int16_t len;
u_int16_t check;
};