Joshua Bonsink avatar Joshua Bonsink committed 8dc3dcc

Added tool to fix pcap files. Needs to be installed by user during the installation proces of imalse.

Comments (0)

Files changed (9)

tools/pcapfix-0.7.3/Changelog

+pcapfix Changelog
+*****************
+
+0.7.3 - 16.06.2013
+------------------
+* added snoop file detection
+* added large file support on 32bit architectures
+* improved missing header detection
+* fixed compiling errors on hurd and kfreebsd architectures
+* fixed minor bugs
+
+0.7.2 - 30.03.2013
+------------------
+* compiles on Apple systems properly now
+* fixed problems installing man-pages (on some systems)
+
+0.7.1 - 03.01.2013
+------------------
+* REALLY fixed file pointer exception on windows64 systems
+* updated man-page
+
+0.7 - 18.10.2012
+----------------
+* added support for swapped (big endian) pcap files
+* compiles on OpenBSD properly now
+* fixed file pointer exception on windows64 systems
+* fixed detection bug when corrupted packet is larger than 65536 bytes
+* fixed minimal packet limit to cope with wlan traffic
+
+0.6 - 20.05.2012
+----------------
+* added deep scan option (-d) to force packet detection inside the whole file
+* detects ascii-corruption in pcap header (unix->win)
+* improved global header and packet checks (0 <= usec <= 1000000)
+* repair files that first packet is entirely corrupted
+* repair oversized packets
+* improved last packet mismatch correction
+* fixed reading packets over EOF
+
+0.5 - 05.05.2012
+----------------
+* repair files that packets were not saved chronologically
+* detect and repair overlapping packets
+* detect and repair cut-off pcap files
+* detect and repair ascii-mode transfered pcap files (pcap headers only!)
+* added progress bar
+* added man-page
+
+0.4 - 27.04.2012
+----------------
+* completely redesigned packet detection algorithm (replaced bottom-up-recovery with brute-force-packet-guessing)
+* improved detection rate by additional plausability checks
+* increased speed when repairing large pcap files
+
+0.3 - 31.03.2012
+----------------
+* when recovering packets size will be checked to be smaller than 65536
+* added recognition when a file does not seem to be a pcap file at all
+* compiles on windows systems properly now (tested with dev-cpp)
+* added option to manually select data link type
+
+0.2 - 11.03.2012
+----------------
+* pcapfix compiles on 64bit systems correctly now
+* fixed segfault when no filename was given
+* fixed (input) file not found bug on directory differ
+* added recognition of other data link types beside ethernet in global header
+* added source code documentation
+
+0.1 - 01.03.2012
+----------------
+* this is the first version, everything has changed thou :-)

tools/pcapfix-0.7.3/INSTALL

+Installation Instructions
+*************************
+
+You do not need any futher packages.
+
+Basic Installation
+==================
+
+1. Compile pcapfix with the following command:
+
+	make
+
+2. Install the binary file
+
+	make install
+
+
+Uninstall
+=========
+
+To uninstall pcapfix just enter:
+
+	make uninstall
+
+
+Troubleshooting
+===============
+
+If there are any problems compiling the program, please write an email
+to ruport@f00l.de and include your compiling error message.

tools/pcapfix-0.7.3/LICENSE

+
+		    GNU GENERAL PUBLIC LICENSE
+		       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ 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.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 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 <http://www.gnu.org/licenses/>.
+
+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:
+
+    <program>  Copyright (C) <year>  <name of author>
+    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
+<http://www.gnu.org/licenses/>.
+
+  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
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
+

tools/pcapfix-0.7.3/Makefile

+PREFIX = /usr
+BINDIR = $(PREFIX)/bin
+DOCDIR = $(PREFIX)/share/doc
+MANDIR = $(PREFIX)/share/man
+
+OPTFLAGS = $(shell getconf LFS_CFLAGS)
+#WARNFLAGS = -Wno-unused-result
+WARNFLAGS = -Wall
+DEBUGFLAGS = -g
+CFLAGS += $(OPTFLAGS) $(WARNFLAGS) $(DEBUGFLAGS)
+
+all:
+	gcc $(CPPFLAGS) $(CFLAGS) $(LDFLAGS) pcapfix.c -o pcapfix
+
+install:
+	install -D -m 755 pcapfix $(DESTDIR)/$(BINDIR)/pcapfix
+	install -D -m 644 pcapfix.1 $(DESTDIR)/$(MANDIR)/man1/pcapfix.1
+
+uninstall:
+	rm -f $(DESTDIR)/$(BINDIR)/pcapfix
+	rm -f $(DESTDIR)/$(MANDIR)/man1/pcapfix.1
+
+clean:
+	rm -f pcapfix

tools/pcapfix-0.7.3/README

+pcapfix v0.7.3 README
+*********************
+
+Pcapfix is a tool to repair your damaged or corrupted pcap files. It is
+written in C and released under the GNU General Public License.
+
+To fix your files the tool first checks for an intact pcap global header
+and repairs it if there are some corrupted bytes. It there seems to be
+no global header at all, pcapfix adds a self-created one at the beginning
+of the file. In a second step the tool tries to find pcap packet headers
+inside the file, below the global header. It checks if the values are
+correct (or seem to be correct) and tries to repair a packet if there is
+something wrong. 
+
+This tool is still in development! Please send any further wishes, feature
+requests or problems in compiling and execution to ruport@f00l.de. You may
+send me pcap files that could ne be repaired too in order to improve pcapfix!
+
+For further information visit the pcapfix homepage at http://f00l.de/pcapfix/.
+
+USAGE
+=====
+
+./pcapfix [OPTIONS] filename
+OPTIONS:        -t <nr>	, --data-link-type <nr>		Data Link Type (default = 1)
+		-d	, --deep-scan 	  		Deep Scan (default = 0)
+		-v	, --verbose 	  		Verbose output (default = 0)
+
+
+Verbosity
+.........
+
+You can use multiple -v options to increase verbosity.
+An verbosity of 2 will result in very much output data during package search.
+
+
+Deep Scan Option
+................
+
+Pcapfix will only scan the first 65535 bytes (maximum packet length) for a proper
+first packet. If you want to force packet detection even above this limit (e.g.
+because your file has been heavily destroyed) you can use the deep scan option (-d).
+
+
+ASCII-mode transfered Files (FTP)
+.................................
+
+Pcapfix is able to repair pcap files that have been  transfered in ascii-mode via
+FTP. In those files a proper pcap structure will be created only to make them
+readable by wireshark etc. The data inside the packets (and some pcap headers)
+might still be corrupted. To repair those packets a deeper look inside the
+packet structure (e.g. checksum) will be necessary.
+
+
+Data Link Types
+...............
+
+You can make pcapfix change / select your data link type by supplying -t option.
+Although you may select a data link type number between 0 and 255, only the following types are assigned:
+If the data link type field is corrupt, pcapfix will selct LINKTYPE_ETHERNET by default.
+
+See http://www.tcpdump.org/linktypes.html for futher information.
+
+NUMBER	LINK_TYPE
+
+0	LINKTYPE_NULL
+1	LINKTYPE_ETHERNET
+6	LINKTYPE_TOKEN_RING
+7	LINKTYPE_ARCNET_BSD
+8	LINKTYPE_SLIP
+9	LINKTYPE_PPP
+10	LINKTYPE_FDDI
+50	LINKTYPE_PPP_HDLC
+51	LINKTYPE_PPP_ETHER
+100	LINKTYPE_ATM_RFC1483
+101	LINKTYPE_RAW
+104	LINKTYPE_C_HDLC
+105	LINKTYPE_IEEE802_11
+107	LINKTYPE_FRELAY
+108	LINKTYPE_LOOP
+113	LINKTYPE_LINUX_SLL
+114	LINKTYPE_LTALK
+117	LINKTYPE_PFLOG
+119	LINKTYPE_PRISM_HEADER
+122	LINKTYPE_IP_OVER_FC
+123	LINKTYPE_SUNATM
+127	LINKTYPE_IEEE802_11_RADIO
+129	LINKTYPE_ARCNET_LINUX
+138	LINKTYPE_APPLE_IP_OVER_IEEE1394
+139	LINKTYPE_MTP2_WITH_PHDR
+140	LINKTYPE_MTP2
+141	LINKTYPE_MTP3
+142	LINKTYPE_SCCP
+143	LINKTYPE_DOCSIS
+144	LINKTYPE_LINUX_IRDA
+147-162	LINKTYPE_USER0-LINKTYPE-USER15
+163	LINKTYPE_IEEE802_11_RADIO_AVS
+166	LINKTYPE_PPP_PPPD
+169	LINKTYPE_GPRS_LLC
+177	LINKTYPE_LINUX_LAPD
+187	LINKTYPE_BLUETOOTH_HCI_H4
+189	LINKTYPE_USB_LINUX
+192	LINKTYPE_PPI
+195	LINKTYPE_IEEE802_15_4
+196	LINKTYPE_SITA
+197	LINKTYPE_ERF
+201	LINKTYPE_BLUETOOTH_HCI_H4_WITH_PHDR
+202	LINKTYPE_AX25_KISS
+203	LINKTYPE_LAPD
+204	LINKTYPE_PPP_WITH_DIR
+205	LINKTYPE_C_HDLC_WITH_DIR
+206	LINKTYPE_FRELAY_WITH_DIR
+209	LINKTYPE_IPMB_LINUX
+215	LINKTYPE_IEEE802_15_4_NONASK_PHY
+220	LINKTYPE_USB_LINUX_MMAPPED
+224	LINKTYPE_FC_2
+225	LINKTYPE_FC_2_WITH_FRAME_DELIMS
+226	LINKTYPE_IPNET
+227	LINKTYPE_CAN_SOCKETCAN
+228	LINKTYPE_IPV4
+229	LINKTYPE_IPV6
+230	LINKTYPE_IEEE802_15_4_NOFCS
+231	LINKTYPE_DBUS
+235	LINKTYPE_DVB_CI
+236	LINKTYPE_MUX27010
+237	LINKTYPE_STANAG_5066_D_PDU
+239	LINKTYPE_NFLOG
+240	LINKTYPE_NETANALYZER
+241	LINKTYPE_NETANALYZER_TRANSPARENT
+242	LINKTYPE_IPOIB
+243	LINKTYPE_MPEG_2_TS
+244	LINKTYPE_NG40
+245	LINKTYPE_NFC_LLCP

tools/pcapfix-0.7.3/TODO

+* more than 0xffff snaplen (huge packets) (need oversized pcap files for testing) (do those packets even exist???)
+* ethernet frame check?
+* repair pcap based on ip chksum
+* repair ascii-mode transfered pcap files (whole packets!)
+
Add a comment to this file

tools/pcapfix-0.7.3/pcapfix

Binary file added.

tools/pcapfix-0.7.3/pcapfix.1

+.TH PCAPFIX 1 "16 JUN 2013"
+
+.SH "NAME"
+pcapfix \- repair pcap files
+
+.SH "SYNOPSIS"
+\fBpcapfix\fP [\-v] [\-d] [\-t DATA_LINK_TYPE] filename
+
+.SH "DESCRIPTION"
+Pcapfix is a tool to repair your damaged or corrupted pcap files.
+
+To fix your files the tool first checks for an intact pcap global header and repairs it if there are some corrupted bytes. It there seems to be no global header at all, pcapfix adds a self-created one at the beginning of the file. In a second step the tool tries to find pcap packet headers inside the file, below the global header. It checks if the values are correct (or seem to be correct) and tries to repair a packet if there is something wrong. 
+
+.SH "OPTIONS"
+.TP 5
+\-v, \-\-verbose
+Enable verbose output (default = 0)
+.br
+You can use multiple \-v options to increase verbosity.
+.br
+An verbosity of 2 will result in very much output data during package search.
+.TP
+\-d, \-\-deep\-scan
+Force deep scan (default = 0)
+.br
+This option will force pcapfix to scan for any packet inside the whole file (instead of the first 65535 bytes only).
+.TP
+\-t, \-\-data\-link\-type <nr>
+Data Link Type (default = 1)
+.br
+(See NOTES section below.)
+
+.SH "EXAMPLES"
+.TP 5
+Repair the file damaged_file.pcap using verbose output.
+pcapfix \-v damaged_file.pcap
+.TP
+Repair the file wlan_traffic.pcap and force the data link type to be 119 (PRISM HEADER).
+pcapfix \-t 119 wlan_traffic.pcap
+
+.SH "NOTES"
+.TP 5
+\fIVerbosity\fP
+
+You can use multiple \-v options to increase verbosity. An verbosity of 2 will result in very much output data during package search.
+
+.TP
+\fIDeep scan\fP
+
+Pcapfix will only scan the first 65535 bytes (maximum packet length) for a proper first packet. If you want to force packet detection even above this limit (e.g. because your file has been heavily destroyed) you can use the deep scan option (\-d).
+
+.TP
+\fIASCII-mode transferred Files (FTP)\fP
+
+Pcapfix is able to repair pcap files that have been transferred in ascii-mode via FTP. In those files a proper pcap structure will be created only to make them readable by wireshark etc. The data inside the packets (and some pcap headers) might still be corrupted. To repair those packets a deeper look inside the packet structure (e.g. checksum) will be necessary.
+
+.TP
+\fIData Link Types\fP
+
+You can make pcapfix change / select your data link type by supplying \-t option. Although you may select a data link type number between 0 and 255, only the following types are assigned: If the data link type field is corrupt, pcapfix will selct LINKTYPE_ETHERNET by default.
+
+See http://www.tcpdump.org/linktypes.html for futher information.
+
+NUMBER	LINK_TYPE
+
+0	LINKTYPE_NULL
+.br
+1	LINKTYPE_ETHERNET
+.br
+6	LINKTYPE_TOKEN_RING
+.br
+7	LINKTYPE_ARCNET_BSD
+.br
+8	LINKTYPE_SLIP
+.br
+9	LINKTYPE_PPP
+.br
+10	LINKTYPE_FDDI
+.br
+50	LINKTYPE_PPP_HDLC
+.br
+51	LINKTYPE_PPP_ETHER
+.br
+100	LINKTYPE_ATM_RFC1483
+.br
+101	LINKTYPE_RAW
+.br
+104	LINKTYPE_C_HDLC
+.br
+105	LINKTYPE_IEEE802_11
+.br
+107	LINKTYPE_FRELAY
+.br
+108	LINKTYPE_LOOP
+.br
+113	LINKTYPE_LINUX_SLL
+.br
+114	LINKTYPE_LTALK
+.br
+117	LINKTYPE_PFLOG
+.br
+119	LINKTYPE_PRISM_HEADER
+.br
+122	LINKTYPE_IP_OVER_FC
+.br
+123	LINKTYPE_SUNATM
+.br
+127	LINKTYPE_IEEE802_11_RADIO
+.br
+129	LINKTYPE_ARCNET_LINUX
+.br
+138	LINKTYPE_APPLE_IP_OVER_IEEE1394
+.br
+139	LINKTYPE_MTP2_WITH_PHDR
+.br
+140	LINKTYPE_MTP2
+.br
+141	LINKTYPE_MTP3
+.br
+142	LINKTYPE_SCCP
+.br
+143	LINKTYPE_DOCSIS
+.br
+144	LINKTYPE_LINUX_IRDA
+.br
+147-162	LINKTYPE_USER0-LINKTYPE-USER15
+.br
+163	LINKTYPE_IEEE802_11_RADIO_AVS
+.br
+166	LINKTYPE_PPP_PPPD
+.br
+169	LINKTYPE_GPRS_LLC
+.br
+177	LINKTYPE_LINUX_LAPD
+.br
+187	LINKTYPE_BLUETOOTH_HCI_H4
+.br
+189	LINKTYPE_USB_LINUX
+.br
+192	LINKTYPE_PPI
+.br
+195	LINKTYPE_IEEE802_15_4
+.br
+196	LINKTYPE_SITA
+.br
+197	LINKTYPE_ERF
+.br
+201	LINKTYPE_BLUETOOTH_HCI_H4_WITH_PHDR
+.br
+202	LINKTYPE_AX25_KISS
+.br
+203	LINKTYPE_LAPD
+.br
+204	LINKTYPE_PPP_WITH_DIR
+.br
+205	LINKTYPE_C_HDLC_WITH_DIR
+.br
+206	LINKTYPE_FRELAY_WITH_DIR
+.br
+209	LINKTYPE_IPMB_LINUX
+.br
+215	LINKTYPE_IEEE802_15_4_NONASK_PHY
+.br
+220	LINKTYPE_USB_LINUX_MMAPPED
+.br
+224	LINKTYPE_FC_2
+.br
+225	LINKTYPE_FC_2_WITH_FRAME_DELIMS
+.br
+226	LINKTYPE_IPNET
+.br
+227	LINKTYPE_CAN_SOCKETCAN
+.br
+228	LINKTYPE_IPV4
+.br
+229	LINKTYPE_IPV6
+.br
+230	LINKTYPE_IEEE802_15_4_NOFCS
+.br
+231	LINKTYPE_DBUS
+.br
+235	LINKTYPE_DVB_CI
+.br
+236	LINKTYPE_MUX27010
+.br
+237	LINKTYPE_STANAG_5066_D_PDU
+.br
+239	LINKTYPE_NFLOG
+.br
+240	LINKTYPE_NETANALYZER
+.br
+241	LINKTYPE_NETANALYZER_TRANSPARENT
+.br
+242	LINKTYPE_IPOIB
+.br
+243	LINKTYPE_MPEG_2_TS
+.br
+244	LINKTYPE_NG40
+.br
+245	LINKTYPE_NFC_LLCP
+
+.SH "DEVELOPMENT"
+This tool is still in development! Please send any further wishes, feature requests or problems in compiling and execution to ruport@f00l.de. You may send me pcap files that could ne be repaired too in order to improve pcapfix!
+
+For further information visit the pcapfix homepage at http://f00l.de/pcapfix/.
+
+.SH "MESSAGES AND EXIT CODES"
+pcapfix will always exit with return code 0
+
+.SH "HISTORY"
+.TP 5
+0.7.3 - 16.06.2013
+* added snoop file detection
+.br
+* added large file support on 32bit architectures
+.br
+* improved missing header detection
+.br
+* fixed compiling errors on hurd and kfreebsd architectures
+.br
+* fixed minor bugs
+.TP
+0.7.2 - 30.03.2013
+* compiles on Apple systems properly now
+.br
+* fixed problems installing man-pages (on some systems)
+.TP
+0.7.1 - 03.01.2013
+* REALLY fixed file pointer exception on windows64 systems
+.br
+* updated man-page
+.TP
+0.7 - 18.10.2012
+* added support for swapped (big endian) pcap files
+.br
+* compiles on OpenBSD properly now
+.br
+* fixed file pointer exception on windows64 systems
+.br
+* fixed detection bug when corrupted packet is larger than 65536 bytes
+.br
+* fixed minimal packet limit to cope with wlan traffic
+.TP
+0.6 - 20.05.2012
+* added deep scan option (\-d) to force packet detection inside the whole file
+.br
+* detects ascii-corruption in pcap header (unix->win)
+.br
+* improved global header and packet checks (0 <= usec <= 1000000)
+.br
+* repair files that first packet is entirely corrupted
+.br
+* repair oversized packets
+.br
+* improved last packet mismatch correction
+.br
+* fixed reading packets over EOF
+.TP
+0.5 - 05.05.2012
+* repair files that packets were not saved chronologically
+.br
+* detect and repair overlapping packets
+.br
+* detect and repair cut-off pcap files
+.br
+* detect and repair ascii-mode transferred pcap files (pcap headers only!)
+.br
+* added progress bar
+.br
+* added man-page
+.TP
+0.4 - 27.04.2012
+* completely redesigned packet detection algorithm (replaced bottom-up-recovery with brute-force-packet-guessing)
+.br
+* improved detection rate by additional plausability checks
+.br
+* increased speed when repairing large pcap files
+.TP
+0.3 - 31.03.2012
+* when recovering packets size will be checked to be smaller than 65536
+.br
+* added recognition when a file does not seem to be a pcap file at all
+.br
+* compiles on windows systems properly now (tested with dev-cpp)
+.br
+* added option to manually select data link type
+.TP
+0.2 - 11.03.2012
+* pcapfix compiles on 64bit systems correctly now
+.br
+* fixed segfault when no filename was given
+.br
+* fixed (input) file not found bug on directory differ
+.br
+* added recognition of other data link types beside ethernet in global header
+.br
+* added source code documentation
+.TP
+0.1 - 01.03.2012
+* this is the first version, everything has changed thou :-)
+
+.SH "COPYRIGHT"
+Pcapfix is released under the GNU General Public License.
+
+.SH "AUTHOR"
+Written by Robert Krause <ruport@f00l.de>.

tools/pcapfix-0.7.3/pcapfix.c

+/*******************************************************************************
+ *
+ * pcapfix.c - pcap file repair tool
+ * Copyright (c) 2012-2013 Robert Krause (ruport@f00l.de)
+ * License: GPLv3
+ *
+ * Last Modified: 16.06.2013
+ *
+ * Command line: pcapfix [-v] [-d] [-t link_type] <pcap_file>
+ *
+ * Description:
+ *
+ * pcapfix is a repair tool for corrupted pcap files. It checks for an intact
+ * pcap global header and repairs it if there are any corrupted bytes. If one
+ * is not present, one is created and added to the beginning of the file. It
+ * then tries to find pcap packet headers, and checks and repairs them.
+ *
+ * Algorithm:
+ *
+ * pcapfix will first step through the packets top down until it recognizes a
+ * corrupted one by using plausibility checks. After that the tool will brute
+ * force further pcap packet headers by reading the file byte by byte. If another
+ * proper packet is found, pcapfix restores the data in between by adding a
+ * well-formed pcap packet header.
+ *
+ ******************************************************************************/
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <unistd.h>
+#include <getopt.h>
+
+#ifdef __WIN32__
+  #include <Winsock.h>   		// needed for htons,htonl on windows systems
+#else
+  #include <libgen.h>    		// needed for basename
+  #include <arpa/inet.h>		// htons, htonl
+#endif
+
+#define VERSION "0.7.3"			// pcapfix version
+
+#define PCAP_MAGIC 0xa1b2c3d4		// the magic of the pcap global header (non swapped)
+#define SNOOP_MAGIC 0x000000706f6f6e73	// snoop packet magic
+
+int swapped = 0;			// pcap file is swapped (big endian)
+
+// header placeholder
+unsigned long header_magic;
+
+// Global header (http://v2.nat32.com/pcap.htm)
+struct global_hdr_s {
+        unsigned int magic_number;   	/* magic number */
+        unsigned short version_major;  	/* major version number */
+        unsigned short version_minor;  	/* minor version number */
+        signed int thiszone;       	/* GMT to local correction */
+        unsigned int sigfigs;        	/* accuracy of timestamps */
+        unsigned int snaplen;        	/* max length of captured packets, in octets */
+        unsigned int network;        	/* data link type */
+};
+
+// Packet header (http://v2.nat32.com/pcap.htm)
+struct packet_hdr_s {
+        unsigned int ts_sec;         /* timestamp seconds */
+        unsigned int ts_usec;        /* timestamp microseconds */
+        unsigned int incl_len;       /* number of octets of packet saved in file */
+        unsigned int orig_len;       /* actual length of packet */
+};
+
+// usage()
+// print out the usage information
+// IN: progname - the program name
+void usage(char *progname) {
+  printf("Usage: %s [OPTIONS] filename\n", progname);
+  printf("OPTIONS:");
+  printf(  "\t-t <nr>, --data-link-type <nr>\tData link type\n");
+  printf("\t\t-d     , --deep-scan          \tDeep scan\n");
+  printf("\t\t-v     , --verbose            \tVerbose output\n");
+  printf("\n");
+}
+
+/* conshort()
+   converts a short variable to network byte order in case of swapped pcap file
+   IN: var - variable to convert
+   OUT: var in correct notation (swapped / non-swapped)
+*/
+unsigned short conshort(unsigned short var) {
+  if (swapped == 0) return(var);
+  return(htons(var));
+}
+
+/* conint()
+   converts an integer variable to network byte order in case of swapped pcap file
+   IN: var - variable to convert
+   OUT: var in correct notation (swapped / non-swapped)
+*/
+unsigned int conint(unsigned int var) {
+  if (swapped == 0) return(var);
+  return(htonl(var));
+}
+
+/* is_plausible()
+   check if the pcap packet header could be a plausible one by satisfying those conditions:
+   ==> packet size >= 16 bytes AND <= 65535 bytes (included length AND original length) (conditions 1,2,3,4)
+   ==> included length <= original lenth (condition 5)
+   ==> packet timestamp is NOT older OR younger than the prior packets timestamp -+ one day (conditions 6,7)
+   ==> usec (microseconds) field >= 0 AND <= 1000000 (conditions 8,9)
+   IN: hdr - packet to check
+   IN: priot_ts - the prior packets timestamp
+   OUT: 0 - if packet is correct
+   OUT: >0 - the condition that failed
+*/
+int is_plausible(struct packet_hdr_s hdr, unsigned int prior_ts) {
+  // check for minimum packet size
+  // minimum packet size should be 16, but in some cases, e.g. local wlan capture, packet might
+  // even be smaller --> decreased minimum size to 10
+  if (conint(hdr.incl_len) < 10) return(1);
+  if (conint(hdr.orig_len) < 10) return(2);
+
+  // check max maximum packet size
+  if (conint(hdr.incl_len) > 65535) return(3);
+  if (conint(hdr.orig_len) > 65535) return(4);
+
+  // the included length CAN NOT be larger than the original length
+  if (conint(hdr.incl_len) > conint(hdr.orig_len)) return(5);
+
+  // packet is not older than one day (related to prior packet)
+  if ((prior_ts != 0) && (conint(hdr.ts_sec) > (prior_ts+86400))) return(6);
+
+  // packet is not younger than one day (related to prior packet)
+  if ((prior_ts >= 86400) && (conint(hdr.ts_sec) < (prior_ts-86400))) return(7);
+
+  // usec (microseconds) must be > 0 AND <= 1000000
+  if (conint(hdr.ts_usec) < 0) return(8);
+  if (conint(hdr.ts_usec) > 1000000) return(9);
+
+  // all conditions fullfilled ==> everything fine!
+  return(0);
+}
+
+/* check_header()
+   this function takes a buffer and brute forces some possible ascii-corrupted bytes versus plausibility checks
+   IN: *buffer - the buffer that might contain the possible pcap packet header
+   IN: size - the size of the buffer (i choose double pcap packet header size)
+   IN: priot_ts - the prior packets timestamp (to check for plausibility)
+   IN: *hdr - the pointer to the packet header buffer (we use this to return the repaired header)
+   OUT: -1 - if there is NO pcap packet header inside the buffer (after ascii-corrution brute force)
+   OUT: >=0 - the number of ascii-corrupted bytes inside the *hdr (we need this data to align the beginning of the packet body later)
+*/
+int check_header(char *buffer, unsigned int size, unsigned int prior_ts, struct packet_hdr_s *hdr) {
+  int i, res;
+  char tmp[size];	// the temporary buffer that will be used for recursion
+
+  // does the buffer already contain a valid packet header (without any correction) ??
+  memcpy(hdr, buffer, sizeof(struct packet_hdr_s));
+  if (is_plausible(*hdr, prior_ts) == 0) return(0);
+
+  // we need to abort the recursion of there are too many possible ascii corrupted bytes at ones
+  // 32-25 = 7 bytes maximum in 32bytes of data!
+  if (size <= 25) return(-1);
+
+  // this loop will the the buffer for occurence of 0x0D + 0x0A (UNIX to WINDOWS ascii corruption)
+  for(i=0; i<sizeof(struct packet_hdr_s); i++) {
+    // is there a 0x0D 0X0A combination at this position?
+    if (buffer[i] == 0x0D && buffer[i+1] == 0x0A) {
+
+      // we cut out 0x0D because this byte could have been added due to ftp ascii transfer eg
+      memcpy(tmp, buffer, i);
+      memcpy(tmp+i, buffer+i+1, size-i-1);
+
+      // and invoke the header again without this 0x0D byte
+      res = check_header(tmp, size-1, prior_ts, hdr);
+
+      // if the check was successfull (maybe with multiple recursions) return the value added by one (body shift offset)
+      if (res != -1) return(res+1);
+    }
+  }
+
+  // the buffer (even after ascii corruption brute force) does not contain any valid pcap packet header
+  return(-1);
+}
+
+// print_progress()
+// prints the progess bar
+// IN: pos - the current filepointer position
+// IN: filesize - the size of the file
+void print_progress(unsigned long pos, unsigned long filesize) {
+  int i;		// loop counter
+  float percentage;	// pencentage variable
+
+  // calculate the current percentage of file analyzing progress
+  percentage = (float)pos/(float)filesize;
+
+  // print the first part of the line including percentage output
+  printf("[*] Progress: %5.2f %% [", percentage*100);
+
+  // output progress bar (width = 50 chars)
+  for (i=1; i<=percentage*50 ;i++) printf("=");	// calculate and output "="-signs
+  printf(">");					// output arrow peak
+  for (i=percentage*50; i<50; i++) printf(" ");	// calculate and output spaces
+
+  // clear the line and carriage return
+  printf("]\n\033[F\033[J");
+}
+
+// main()
+// IN: argc - number of cmd line args
+// IN: argv - array of cmd line args
+// OUT: always zero
+int main(int argc, char *argv[]) {
+  FILE *pcap, *pcap_fix;			// input and output file
+  struct global_hdr_s global_hdr;		// global header data
+  struct packet_hdr_s packet_hdr;		// packet header data
+  struct packet_hdr_s next_packet_hdr;		// next packet header data to look forward
+
+  char hdrbuffer[sizeof(packet_hdr)*2];		// the buffer that will be used to find a proper packet
+  char buffer[65535];				// the packet body
+
+  unsigned long pos = 0;			// position of current packet header
+  unsigned long nextpos = 0;			// possible position of next packets header
+  unsigned long filesize;			// file size
+  unsigned int count;				// packet counter
+  unsigned int last_correct_ts_sec = 0;		// timestamp of the last proper packet found (seconds)
+  unsigned int last_correct_ts_usec = 0;	// timestamp of the last proper packet found (microseconds)
+  unsigned short hdr_integ;			// integrity counter of global header
+  unsigned long bytes;				// read/written bytes counter (unused yet)
+  int c;					// loop counter
+  int option_index = 0;				// getopt_long option index
+  int ascii = 0;				// ascii counter for possible ascii-corrupted packets
+  int corrupted = 0;				// corrupted packet counter for final output
+  int res;					// the result of the header check == the offset of body shifting
+
+  // configuration variables
+  int data_link_type = 1;			// data link type (default: LINKTYPE_ETHERNET)
+  int verbose = 0;				// verbose output option (default: dont be verbose)
+  int deep_scan = 0;				// deep scan option (default: no depp scan)
+
+  // init getopt_long options struct
+  struct option long_options[] = {
+    {"data-link-type", required_argument, 0, 't'},		// --data-link-type == -t
+    {"deep-scan", no_argument, 0, 'd'},				// --deep-scan == -d
+    {"verbose", no_argument, 0, 'v'},				// --verbose == -v
+    {0, 0, 0, 0}
+  };
+
+  // print out pcapfix header information
+  printf("pcapfix %s (c) 2012-2013 Robert Krause\n\n", VERSION);
+
+  // scan for options and arguments
+  while ((c = getopt_long(argc, argv, ":t:v::d::", long_options, &option_index)) != -1) {
+    switch (c) {
+      case 0:	// getopt_long options evaluation
+        break;
+      case 'd':	// deep scan
+        deep_scan++;
+        break;
+      case 'v':	// verbose
+        verbose++;
+        break;
+      case 't':	// data link type
+        data_link_type = atoi(optarg);
+        break;
+      case '?': // unknown option
+        usage(argv[0]);
+        return 1;
+      default:
+        abort();
+    }
+  }
+
+  // filename is first argument
+  char *filename = argv[optind++];
+
+  // if filename is not set, output usage information
+  if (filename == NULL) {
+    usage(argv[0]);
+    return(1);
+  }
+
+  // open input file
+  printf("[*] Reading from file: %s\n", filename);
+  pcap = fopen(filename, "rb");
+  if (!pcap) {
+    perror("[-] Cannot open input file");
+    return(1);
+  }
+
+  // open output file
+  // we need to extract the basename first (windows and linux use different functions)
+  char filebname[strlen(filename)];
+  #ifdef __WIN32__
+    _splitpath(filename, NULL, NULL, filebname, NULL);	// windown method (_splitpath)
+  # else
+    strcpy(filebname, basename(filename));		// unix method (basename)
+  #endif
+  char filename_fix[strlen(filebname)+6];	// size of outputfile depends on inputfile's length
+  strcpy(filename_fix, filename);		// outputfile = fixed_ + inputfile
+  strcat(filename_fix, "_fixed");
+  printf("[*] Writing to file: %s\n", filename_fix);
+  pcap_fix = fopen(filename_fix, "wb");
+  if (!pcap_fix) {
+    perror("[-] Cannot open output file");
+    return(1);
+  }
+
+  // BEGIN OF GLOBAL HEADER CHECK
+
+  // get file size
+  fseek(pcap, 0, SEEK_END);
+  filesize = ftell(pcap);
+
+  // check for empty file
+  if (filesize == 0) {
+    printf("[-] The source file is empty.\n\n");
+    fclose(pcap);
+    fclose(pcap_fix);
+    remove(filename_fix);
+    return(1);
+  }
+
+  fseek(pcap, 0, SEEK_SET);
+
+  // read header to header magic for further inspection
+  bytes = fread(&header_magic, sizeof(header_magic), 1, pcap);
+  if (bytes == 0) {
+    printf("[-] Cannot read file header (file too small?).\n\n");
+    fclose(pcap);
+    fclose(pcap_fix);
+    remove(filename_fix);
+    return(1);
+  }
+  fseek(pcap, 0, SEEK_SET);
+
+  printf("[*] Analyzing global header...\n");
+  bytes = fread(&global_hdr, sizeof(global_hdr), 1, pcap);	// read first bytes of input file into struct
+
+  hdr_integ = 0;
+
+  // check for known but not supported file types
+  if (header_magic == SNOOP_MAGIC) {
+    printf("[-] This is a SNOOP file, which is not supported yet.\n\n");
+    fclose(pcap);
+    fclose(pcap_fix);
+    remove(filename_fix);
+    return(-1);
+
+  }
+
+  // check for pcap's magic bytes ()
+  if (global_hdr.magic_number == PCAP_MAGIC) {
+    if (verbose) printf("[+] Magic number: 0x%x\n", global_hdr.magic_number);
+  } else if (global_hdr.magic_number == htonl(PCAP_MAGIC)) {
+    if (verbose) printf("[+] Magic number: 0x%x (SWAPPED)\n", global_hdr.magic_number);
+    swapped = 1;
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] Magic number: 0x%x\n", global_hdr.magic_number);
+    global_hdr.magic_number = PCAP_MAGIC;
+  }
+
+  // check for major version number (2)
+  if (conshort(global_hdr.version_major) == 2) {	// current major version is 2
+    if (verbose) printf("[+] Major version number: %hu\n", conshort(global_hdr.version_major));
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] Major version number: %hu\n", conshort(global_hdr.version_major));
+    global_hdr.version_major = conshort(2);
+  }
+
+  // check for minor version number
+  if (conshort(global_hdr.version_minor) == 4) {	// current minor version is 4
+    if (verbose) printf("[+] Minor version number: %hu\n", conshort(global_hdr.version_minor));
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] Minor version number: %hu\n", conshort(global_hdr.version_minor));
+    global_hdr.version_minor = conshort(4);
+  }
+
+  // check for GTM to local correction
+  if (conshort(global_hdr.thiszone) == 0) {	// in practise time stamps are always in GTM, so the correction is always zero
+    if (verbose) printf("[+] GTM to local correction: %d\n", conint(global_hdr.thiszone));
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] GTM to local correction: %d\n", conint(global_hdr.thiszone));
+    global_hdr.thiszone = conint(0);
+  }
+
+  // check for accuracy of timestamps
+  if (conint(global_hdr.sigfigs) == 0) {	// all capture tools set this to zero
+    if (verbose) printf("[+] Accuracy of timestamps: %u\n", conint(global_hdr.sigfigs));
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] Accuracy of timestamps: %u\n", conint(global_hdr.sigfigs));
+    global_hdr.sigfigs = conint(0);
+  }
+
+  // check for max packet length
+  if ((conint(global_hdr.snaplen) >= 0) && (conint(global_hdr.snaplen) <= 65535)) {	// typically 65535 (no support for huge packets yet)
+    if (verbose) printf("[+] Max packet length: %u\n", conint(global_hdr.snaplen));
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] Max packet length: %u\n", conint(global_hdr.snaplen));
+    global_hdr.snaplen = conint(65535);
+  }
+
+  // check for data link type (http://www.tcpdump.org/linktypes.html)
+  if ((conint(global_hdr.network) >= 0) && (conint(global_hdr.network) <= 245)) {	// data link types are >= 0 and <= 245
+    if (verbose) printf("[+] Data link type: %u\n", conint(global_hdr.network));
+  } else {
+    hdr_integ++;
+    if (verbose) printf("[-] Data link type: %u\n", conint(global_hdr.network));
+    // if data link type is corrupt, we set it to ethernet (user supplied param will be processed later)
+    global_hdr.network = conint(1);
+  }
+
+  // does the user provides a self-supplied data link type? if yes... change global header
+  if (data_link_type != 1) {
+    printf("[+] Changing data link type to %d.\n", data_link_type);
+    global_hdr.network = conint(data_link_type);
+  }
+
+  // evaluate the integrity of the global header
+  if (hdr_integ == 0) { // no field has been corrupted? --> header is intact
+    printf("[+] The global pcap header seems to be fine!\n");
+  } else if (hdr_integ >= 5) { // there have been five or more (of seven) corrupted fields? --> header is missing
+    printf("[-] The global pcap header seems to be missing ==> CORRECTED!\n");
+    /* we need to set the file pointer to the beginning of the file, because
+       further packet search depends on this position and without a global
+       header the first packet might begin there */
+    fseek(pcap, 0, SEEK_SET);
+  } else { // there have been corrupted fields (less than six) --> header is corrupted
+    printf("[-] The global pcap header seems to corrupt! ==> CORRECTED\n");
+  }
+
+  // write the (maybe fixed) global header to output file
+  bytes = fwrite(&global_hdr, sizeof(global_hdr), 1, pcap_fix);
+
+  // END OF GLOBAL HEADER CHECK
+
+  // BEGIN PACKET CHECK
+
+  printf("[*] Analyzing packets...\n");
+
+  /* this loop iterates the packets from top till down by checking the
+     pcap packet headers on plausibility. if any packet header has got
+     implausible information the packet will be handled as corrupted
+     and pcapfix will brute force the next packet. if the packet header
+     look plausible, pcapfix will check if the next packet is aligned and
+     if not check for overlapping packets.
+  */
+
+  pos = ftell(pcap);	// get current file pointer position
+
+  // loop the pcap files packets until pos has reacher end of file
+  for (count=1; pos < filesize; count++) {
+
+    // we only want the progress bar to be printed in non-verbose mode
+    if (verbose == 0) print_progress(pos, filesize);
+
+    // read the next packet header
+    bytes = fread(hdrbuffer, sizeof(hdrbuffer), 1, pcap);
+
+    // check if the packet header looks proper
+    res = check_header(hdrbuffer, sizeof(hdrbuffer), last_correct_ts_sec, &packet_hdr);
+    if (res != -1) {
+
+      // realign packet body (based on possible-ascii corrupted pcap header)
+      pos += res;
+      fseek(pcap, pos+16, SEEK_SET);
+
+      // try to read the packet body AND check if there are still at least 16 bytes left for the next pcap packet header
+      if ((fread(&buffer, conint(packet_hdr.incl_len), 1, pcap) == 0) || ((filesize-(pos+16+res+conint(packet_hdr.incl_len)) > 0) && (filesize-(pos+16+res+conint(packet_hdr.incl_len)) < 16))) {
+	// fread returned an error (EOL while read the body) or the file is not large enough for the next pcap packet header (16bytes)
+	// thou the last packet has been cut of
+
+        if (verbose >= 1) printf("[-] LAST PACKET MISMATCH (%u | %u | %u | %u)\n", conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+
+	// correct the packets included length field to match the end of file
+        packet_hdr.incl_len = conint(filesize-pos-16);
+
+        // the original length must not be smaller than the included length
+        if (conint(packet_hdr.incl_len) > conint(packet_hdr.orig_len)) packet_hdr.orig_len = packet_hdr.incl_len;
+
+	// print out information
+        printf("[+] CORRECTED Packet #%u at position %ld (%u | %u | %u | %u).\n", count, pos, conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+	corrupted++;
+      }
+
+      // OVERLAPPING DETECTION
+      // we do ONLY scan for overlapping if next packet is NOT aligned
+
+      // read next packet header
+      bytes = fread(hdrbuffer, sizeof(hdrbuffer), 1, pcap);
+
+      // check if next packets header looks proper
+      if (check_header(hdrbuffer, sizeof(hdrbuffer), conint(packet_hdr.ts_sec), &next_packet_hdr) == -1) {
+
+        // the next packets header is corrupted thou we are going to scan through the prior packets body to look for an overlapped packet header
+	// also look inside the next packets header + 16bytes of packet body, because we need to know HERE
+	// do not leave the loop if the first packet has not been found yet AND deep scan mode is activated
+        for (nextpos=pos+16+1; (nextpos < pos+16+conint(packet_hdr.incl_len)+32) || (count == 1 && deep_scan == 1); nextpos++) {
+
+          // read the possible next packets header
+          fseek(pcap, nextpos, SEEK_SET);
+          bytes = fread(hdrbuffer, sizeof(hdrbuffer), 1, pcap);
+
+          // heavy verbose output :-)
+          if (verbose >= 2) printf("[*] Trying Packet #%u at position %ld (%u | %u | %u | %u).\n", (count+1), nextpos, conint(next_packet_hdr.ts_sec), conint(next_packet_hdr.ts_usec), conint(next_packet_hdr.incl_len), conint(next_packet_hdr.orig_len));
+
+          // check the header for plausibility
+	  res = check_header(hdrbuffer, sizeof(hdrbuffer), last_correct_ts_sec, &next_packet_hdr);
+          if (res != -1) {
+
+            // we found a proper header inside the packets body!
+            if (verbose >= 1) printf("[-] FOUND OVERLAPPING data of Packet #%u at position %ld (%u | %u | %u | %u).\n", (count+1), nextpos, conint(next_packet_hdr.ts_sec), conint(next_packet_hdr.ts_usec), conint(next_packet_hdr.incl_len), conint(next_packet_hdr.orig_len));
+
+            // correct the prior packets length information fields to align the overlapped packet
+            packet_hdr.incl_len = conint(nextpos-(pos+16)+res);	// also include ascii corruption offset (res)
+            packet_hdr.orig_len = packet_hdr.incl_len;
+
+	    // time correction for the FIRST packet only
+	    if (count == 1) {
+	      if (conint(next_packet_hdr.ts_usec) > 0) {
+		// next packets usec is > 0 ===> first packet will get same timestamp and usec - 1
+		packet_hdr.ts_sec = next_packet_hdr.ts_sec;
+		packet_hdr.ts_usec = conint(conint(next_packet_hdr.ts_usec)-1);
+	      } else if(conint(next_packet_hdr.ts_sec) > 0) {
+		// else: next packets timestamp i > 0 ===> firt packet will get timestamp -1 and maximum usec
+		packet_hdr.ts_sec = conint(conint(next_packet_hdr.ts_sec)-1);
+		packet_hdr.ts_usec = conint(999999);
+  	      } else {
+		// else: (next packets sec and usec are zero), this packet will get zero times as well
+		packet_hdr.ts_sec = conint(0);
+		packet_hdr.ts_usec = conint(0);
+	      }
+	    }
+
+            // print out information
+            printf("[+] CORRECTED Packet #%u at position %ld (%u | %u | %u | %u).\n", count, pos, conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+            corrupted++;
+
+            // overlapping seems to be a result of ascii-transferred pcap files via FTP
+            ascii++;
+
+            break;
+          }
+        }
+      }
+
+      // reset file fointer to next packet
+      fseek(pcap, pos+16+conint(packet_hdr.incl_len), SEEK_SET);
+
+      // we found a correct packet (and aligned it maybe)
+      if (verbose >= 1) printf("[+] Packet #%u at position %ld (%u | %u | %u | %u).\n", count, pos, conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+
+      // write last packet
+      bytes = fwrite(&packet_hdr, sizeof(packet_hdr), 1, pcap_fix);	// write packet header to output file
+      bytes = fwrite(&buffer, conint(packet_hdr.incl_len), 1, pcap_fix);	// write packet body to output file
+
+      // remember that this packets timestamp to evaluate futher timestamps
+      last_correct_ts_sec = conint(packet_hdr.ts_sec);
+      last_correct_ts_usec = conint(packet_hdr.ts_usec);
+
+    } else {
+
+      // PACKET IS CORRUPT
+
+      if (verbose >= 1) printf("[-] CORRUPTED Packet #%u at position %ld (%u | %u | %u | %u).\n", count, pos, conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+
+      // scan from the current position to the maximum packet size and look for a next proper packet header to align the corrupted packet
+      // also do not leave the loop if the first packet has not been found yet AND deep scan mode is activated
+      for (nextpos=pos+16+1; (nextpos <= pos+16+65535) || (count == 1 && deep_scan == 1); nextpos++) {
+
+        // read the possible next packets header
+	fseek(pcap, nextpos, SEEK_SET);
+        if (fread(hdrbuffer, sizeof(hdrbuffer), 1, pcap) == 0) {
+
+	  // did we read over EOF AND havent found the first packet yet? then we need to abort!
+          if ((count == 1) && (deep_scan == 1)) {
+
+	    // abort scan
+            pos = 0;
+            corrupted = -1;
+            break;
+          }
+
+          printf("[*] End of file reached. Aligning last packet.\n");
+
+	  // align the last packet to match EOF
+	  packet_hdr.incl_len = conint(filesize-(pos+16));
+	  packet_hdr.orig_len = packet_hdr.incl_len;
+
+	  // if the is the first packet, we need to set timestamps to zero
+	  if (count == 1) {
+	    packet_hdr.ts_sec = conint(0);
+	    packet_hdr.ts_usec = conint(0);
+	  } else {	// else take the last correct timestamp and usec plus one
+	    packet_hdr.ts_sec = conint(last_correct_ts_sec);
+	    packet_hdr.ts_usec = conint(last_correct_ts_usec+1);
+	  }
+
+          // read the packets body (size based on the just found next packets position)
+          fseek(pcap, pos+16, SEEK_SET);
+          bytes = fread(&buffer, conint(packet_hdr.incl_len), 1, pcap);
+
+          // write repaired packet header and packet body
+          bytes = fwrite(&packet_hdr, sizeof(packet_hdr), 1, pcap_fix);	// write packet header to output file
+          bytes = fwrite(&buffer, conint(packet_hdr.incl_len), 1, pcap_fix);	// write packet body to output file
+
+          // remember that this packets timestamp to evaluate futher timestamps
+          last_correct_ts_sec = packet_hdr.ts_sec;
+          last_correct_ts_usec = packet_hdr.ts_usec;
+
+          // print out information
+          printf("[+] CORRECTED LAST Packet #%u at position %ld (%u | %u | %u | %u).\n", count, pos, conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+	  corrupted++;
+
+	  break;
+	}
+
+	// shall we abord the whole scan??
+	if (corrupted == -1) break;
+
+        // heavy verbose output :-)
+        if (verbose >= 2) printf("[*] Trying Packet #%u at position %ld (%u | %u | %u | %u).\n", (count+1), nextpos, conint(next_packet_hdr.ts_sec), conint(next_packet_hdr.ts_usec), conint(next_packet_hdr.incl_len), conint(next_packet_hdr.orig_len));
+
+        // check if next packets header looks proper
+        res = check_header(hdrbuffer, sizeof(hdrbuffer), last_correct_ts_sec, &next_packet_hdr);
+        if (res != -1) {
+
+	  // if we found a packet that is below the top 65535 bytes (deep scan) we cut it off and take the second packet as first one
+	  if ((nextpos-(pos+16) > 65535) && (count == 1) && (deep_scan == 1)) {
+
+            if (verbose >= 1) printf("[+] (DEEP SCAN) FOUND FIRST Packet #%u at position %ld (%u | %u | %u | %u).\n", count, nextpos, conint(next_packet_hdr.ts_sec), conint(next_packet_hdr.ts_usec), conint(next_packet_hdr.incl_len), conint(next_packet_hdr.orig_len));
+
+	    // set the filepoint to the top of the first packet to be read in next loop iteration
+	    fseek(pcap, nextpos, SEEK_SET);
+
+	    // correct counter due to deep scan
+	    count--;
+
+	  } else { // found next packet (NO deep scan mode)
+            // we found the NEXT packets header, now we are able to align the corrupted packet
+            if (verbose >= 1) printf("[+] FOUND NEXT Packet #%u at position %ld (%u | %u | %u | %u).\n", (count+1), nextpos, conint(next_packet_hdr.ts_sec), conint(next_packet_hdr.ts_usec), conint(next_packet_hdr.incl_len), conint(next_packet_hdr.orig_len));
+
+            // correct the corrupted pcap packet header to match the just found next packet header
+	    packet_hdr.incl_len = conint(nextpos-(pos+16));
+	    packet_hdr.orig_len = packet_hdr.incl_len;
+
+	    if (count == 1) { // time correction for the FIRST packet
+	      if (conint(next_packet_hdr.ts_usec) > 0) {
+		// next packets usec is > 0 ===> first packet will get same timestamp and usec - 1
+		packet_hdr.ts_sec = next_packet_hdr.ts_sec;
+		packet_hdr.ts_usec = conint(conint(next_packet_hdr.ts_usec)-1);
+	      } else if(conint(next_packet_hdr.ts_sec) > 0) {
+		// else: next packets timestamp i > 0 ===> firt packet will get timestamp -1 and maximum usec
+		packet_hdr.ts_sec = conint(conint(next_packet_hdr.ts_sec)-1);
+		packet_hdr.ts_usec = conint(999999);
+  	      } else {
+		// else: (next packets sec and usec are zero), this packet will get zero times as well
+		packet_hdr.ts_sec = conint(0);
+		packet_hdr.ts_usec = conint(0);
+	      }
+	    } else { // ALL packets except the first one will use the last correct packets timestamps
+	      packet_hdr.ts_sec = last_correct_ts_sec;
+	      packet_hdr.ts_usec = conint(last_correct_ts_usec+1);
+	    }
+
+            // read the packets body (size based on the just found next packets position)
+            fseek(pcap, pos+16, SEEK_SET);
+            bytes = fread(&buffer, packet_hdr.incl_len, 1, pcap);
+
+            // write repaired packet header and packet body
+            bytes = fwrite(&packet_hdr, sizeof(packet_hdr), 1, pcap_fix);	// write packet header to output file
+            bytes = fwrite(&buffer, conint(packet_hdr.incl_len), 1, pcap_fix);	// write packet body to output file
+
+            // remember that this packets timestamp to evaluate futher timestamps
+            last_correct_ts_sec = packet_hdr.ts_sec;
+            last_correct_ts_usec = packet_hdr.ts_usec;
+
+            // print out information
+            printf("[+] CORRECTED Packet #%u at position %ld (%u | %u | %u | %u).\n", count, pos, conint(packet_hdr.ts_sec), conint(packet_hdr.ts_usec), conint(packet_hdr.incl_len), conint(packet_hdr.orig_len));
+
+	  }
+
+	  // increase corruption counter
+	  corrupted++;
+
+	  // leave the next packet search loop
+          break;
+        }
+
+      }
+
+      // shall we abort the whole scan (due to deep scan did not succeed at all)
+      if (corrupted == -1) break;
+
+      // did the counter exceed the maximum packet size?
+      if ((count == 1 && deep_scan == 0) && (nextpos > pos+16+65535)) {
+
+        // PACKET COULD NOT BE REPAIRED!
+
+        if (verbose >= 1) printf("[-] Cannot align corrupted packet! \n");
+        break;
+      }
+
+    }
+
+    // get current file pointer position to start next loop iteration
+    pos = ftell(pcap);
+
+  }
+
+  // did we reach the end of pcap file?
+  if (pos == filesize) { // yes ==> all data processed == SUCCESS
+    printf("[+] Success!\n\n");
+  } else { // no ==> data missing == FAILED
+    printf("[-] Failed!\n\n");
+    corrupted = -1;	// the file could not be repaired
+  }
+
+  // END PACKET CHECK
+
+  // close files
+  fclose(pcap);
+  fclose(pcap_fix);
+
+  // EVALUATE RESULT
+
+  // no errors (header + packets correct)
+  if ((hdr_integ == 0) && (corrupted == 0)) {	// check allover failure / integrity count and corrupted counter
+
+    if (data_link_type == 1) { 	// data link type has not been changed
+      printf("Your pcap file looks proper. Nothing to fix!\n\n");
+      //remove(filename_fix);	// delete output file due to nothing changed
+    } else { // the user forces a new data link type, then we dont remove the file even if no corruption was detected
+      printf("Your pcap file looks proper. Only data link type has been changed.\n\n");
+    }
+    remove(filename);
+
+  // anything was corrupted
+
+  // file could NOT be repaired
+  } else if (corrupted == -1) {	// check vor very high packet failure value ==> no recovery possible
+
+    // if count == 1 then even the first packet was corrupted and no other packet could be found
+    if (count == 1) {
+      printf("This file does not seem to be a pcap file!\n\n");
+
+      // deep scan dependent output
+      if (deep_scan == 0) printf("If you are SURE that there are pcap packets inside, try with deep scan option (-d) to find them!\n\n");
+      else printf("There is REALLY no pcap packet inside this file!!!\n\n");
+
+    // the first packet was intact, but recovery is not possible nevertheless
+    } else {
+      printf("Unable to recover pcap file.\n\n");
+      if (!verbose) printf("Try executing pcapfix with -v option to trace the corruption!\n");
+      printf("You may help improving pcapfix by sending your pcap file to ruport@f00l.de\n\n");
+    }
+
+    // delete output file due to repair impossible
+    remove(filename_fix);
+
+  // file has been successfully repaired (corruption fixed)
+  } else {
+    printf("Your pcap file has been successfully repaired (%d corrupted packet(s)).\n", corrupted);
+    printf("Wrote %u packets to file %s.\n\n", count-1, filename_fix);
+
+    // are there any packets that might have been transferred in ascii mode?
+    if (ascii) {
+      printf("This corruption seems to be a result of an ascii-mode transferred pcap file via FTP.\n");
+      printf("The pcap structure of those files can be repaired, but the data inside might still be corrupted!!!\n\n");
+    }
+    
+    remove(filename);
+
+  }
+
+  // always return zero (might be changed later)
+  return(0);
+}
Tip: Filter by directory path e.g. /media app.js to search for public/media/app.js.
Tip: Use camelCasing e.g. ProjME to search for ProjectModifiedEvent.java.
Tip: Filter by extension type e.g. /repo .js to search for all .js files in the /repo directory.
Tip: Separate your search with spaces e.g. /ssh pom.xml to search for src/ssh/pom.xml.
Tip: Use ↑ and ↓ arrow keys to navigate and return to view the file.
Tip: You can also navigate files with Ctrl+j (next) and Ctrl+k (previous) and view the file with Ctrl+o.
Tip: You can also navigate files with Alt+j (next) and Alt+k (previous) and view the file with Alt+o.