Initial commit
This commit is contained in:
WatermelonModders
@@ -0,0 +1,622 @@
|
||||
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
|
||||
@@ -0,0 +1,15 @@
|
||||
INCS=-Isrc/include -I../hm_base/src/include -I/usr/include/json-c/
|
||||
LIB_PATH=-L../hm_base/lib
|
||||
LIB=-lhmbase -lm -lev -ljson-c -lcouchbase
|
||||
|
||||
all: base mods
|
||||
$(CC) -g -DMOD_$(mod) $(INCS) $(LIB_PATH) src/*.c $(LIB) -o hm_lobbyserver
|
||||
|
||||
base:
|
||||
$(MAKE) -C ../hm_base target=lobby
|
||||
|
||||
mods:
|
||||
cd script/ && python main.py
|
||||
|
||||
clean:
|
||||
rm hm_lobbyserver
|
||||
@@ -0,0 +1,7 @@
|
||||
# hm_lobbyserver
|
||||
|
||||
hearthmod lobby server
|
||||
|
||||
# This is not a standalone project!
|
||||
|
||||
[hm_lobbyserver](https://github.com/farb3yonddriv3n/hm_lobbyserver) is part of [hearthmod software stack](https://github.com/hearthmod/hearthmod)
|
||||
@@ -0,0 +1,37 @@
|
||||
try:
|
||||
import couchbase
|
||||
from couchbase.bucket import Bucket
|
||||
from couchbase.views.iterator import View
|
||||
except:
|
||||
import couchbase_ffi
|
||||
from couchbase_ffi.bucket import Bucket
|
||||
from couchbase_ffi.views.iterator import View
|
||||
|
||||
cb = Bucket('couchbase://localhost/hbs', password='aci')
|
||||
|
||||
def prepare_mods():
|
||||
l = []
|
||||
for result in View(cb, "dev_mods", "mods"):
|
||||
l.append({ "url": result.value["url"], "name": result.value["name"] })
|
||||
|
||||
out = '#ifndef MODS_H_\n'
|
||||
out += '#define MODS_H_\n\n'
|
||||
|
||||
for i in l:
|
||||
out += '#ifdef MOD_%s\n' % i['url'].upper()
|
||||
out += '#define MOD_NAME "%s"\n' % i['name']
|
||||
out += '#define MOD_URL "%s"\n' % i['url']
|
||||
out += '#endif // MOD_%s\n\n' % i['url']
|
||||
|
||||
out += '#endif'
|
||||
|
||||
f = open("../src/include/mods.h", "w")
|
||||
f.write(out)
|
||||
f.close()
|
||||
|
||||
f = open("../../hm_gameserver/src/include/mods.h", "w")
|
||||
f.write(out)
|
||||
f.close()
|
||||
|
||||
if __name__ == '__main__':
|
||||
prepare_mods()
|
||||
@@ -0,0 +1,171 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <malloc.h>
|
||||
#include <json.h>
|
||||
#include <string.h>
|
||||
|
||||
#include <libcouchbase/couchbase.h>
|
||||
|
||||
#define HM_LOBBYSERVER
|
||||
|
||||
#include <hmbase.h>
|
||||
#include <mods.h>
|
||||
|
||||
#include <client.h>
|
||||
|
||||
char *read_str(char **buf, char *end, int *len);
|
||||
|
||||
void login_reply(struct conn_client_s *cs, int error)
|
||||
{
|
||||
struct json_object *obj;
|
||||
|
||||
obj = json_object_new_object();
|
||||
json_object_object_add(obj, "type", json_object_new_int(CLIENT_LOGIN));
|
||||
json_object_object_add(obj, "error", json_object_new_int(error));
|
||||
json_object_object_add(obj, "secret", json_object_new_string(cs->login.secret));
|
||||
json_object_object_add(obj, "mod_name", json_object_new_string(MOD_NAME));
|
||||
json_object_object_add(obj, "mod_url", json_object_new_string(MOD_URL));
|
||||
const char *str = json_object_get_string(obj);
|
||||
|
||||
hm_send(cs, str, strlen(str));
|
||||
}
|
||||
|
||||
void client_login_3(struct cbop_s *cbop)
|
||||
{
|
||||
struct conn_client_s *cs = cbop->data;
|
||||
|
||||
if(cbop->lcb_error == LCB_SUCCESS) {
|
||||
hm_log(LOG_DEBUG, cs->log, "{Client}: Deck [%.*s] retrieval succeeded", (int)CBGR(nkey), (char *)CBGR(key));
|
||||
login_reply(cs, 0);
|
||||
} else {
|
||||
hm_log(LOG_DEBUG, cs->log, "{Client}: Deck [%.*s] retrieval failed with error %d", (int)CBGR(nkey), (char *)CBGR(key), cbop->lcb_error);
|
||||
login_reply(cs, 3);
|
||||
}
|
||||
|
||||
free(cbop);
|
||||
}
|
||||
|
||||
void client_login_2(struct cbop_s *cbop)
|
||||
{
|
||||
struct conn_client_s *cs = cbop->data;
|
||||
|
||||
if(cbop->lcb_error == LCB_SUCCESS) {
|
||||
struct json_object *obj;
|
||||
|
||||
struct json_tokener *tok = json_tokener_new();
|
||||
obj = json_tokener_parse_ex(tok, CBGR(bytes), CBGR(nbytes));
|
||||
|
||||
if(obj == NULL) {
|
||||
hm_log(LOG_DEBUG, cs->log, "Parsing [%.*s] failed", (int)CBGR(nkey), (char *)CBGR(key));
|
||||
free(cbop);
|
||||
return;
|
||||
}
|
||||
|
||||
hm_log(LOG_DEBUG, cs->log, "{Client}: requesting key [%s] succeeded", cs->login.user);
|
||||
|
||||
json_object_object_foreach(obj, key0, val0) {
|
||||
int type = json_object_get_type(val0);
|
||||
if(type == json_type_string) {
|
||||
const char *v = json_object_get_string(val0);
|
||||
if(strcmp(key0, "secret") == 0) {
|
||||
snprintf(cs->login.secret, sizeof(cs->login.secret), "%s", v);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
json_object_object_foreach(obj, key, val) {
|
||||
int type = json_object_get_type(val);
|
||||
if(type == json_type_string) {
|
||||
const char *v = json_object_get_string(val);
|
||||
if(strcmp(key, "password") == 0) {
|
||||
if(strcmp(v, cs->login.pass) == 0) {
|
||||
memset(cbop, 0, sizeof(*cbop));
|
||||
cbop->data = cs;
|
||||
|
||||
char k1[128];
|
||||
snprintf(k1, sizeof(k1), "u:deck_%s_%s", MOD_URL, cs->login.secret);
|
||||
CBGQ_V0(0, k1, strlen(k1), client_login_3, 0, 0);
|
||||
return;
|
||||
} else {
|
||||
hm_log(LOG_DEBUG, cs->log, "{Client}: passwords do not match %s %s", cs->login.pass, v);
|
||||
free(cbop);
|
||||
login_reply(cs, 2);
|
||||
return;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
hm_log(LOG_DEBUG, cs->log, "{Client}: password doesn't match");
|
||||
free(cbop);
|
||||
login_reply(cs, 2);
|
||||
|
||||
} else {
|
||||
hm_log(LOG_DEBUG, cs->log, "{Client}: requesting key [%s] failed with error %d", cs->login.user, cbop->lcb_error);
|
||||
free(cbop);
|
||||
login_reply(cs, 1);
|
||||
}
|
||||
}
|
||||
|
||||
void client_login(struct conn_client_s *cs, const char *buf, int len)
|
||||
{
|
||||
const char *username, *password;
|
||||
struct cbop_s *cbop;
|
||||
|
||||
json_tokener *tok;
|
||||
struct json_object *obj;
|
||||
|
||||
tok = json_tokener_new();
|
||||
obj = json_tokener_parse_ex(tok, buf, len);
|
||||
|
||||
if(obj == NULL) {
|
||||
return;
|
||||
}
|
||||
|
||||
json_object_object_foreach(obj, key, val) {
|
||||
if(strcmp(key, "user") == 0) {
|
||||
int type = json_object_get_type(val);
|
||||
if(type == json_type_string) {
|
||||
username = json_object_get_string(val);
|
||||
}
|
||||
} else if(strcmp(key, "pass") == 0) {
|
||||
int type = json_object_get_type(val);
|
||||
if(type == json_type_string) {
|
||||
password = json_object_get_string(val);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if(!(strlen(username) > 0 && strlen(username) < 32 && strlen(password) > 0 && strlen(password) < 32)) {
|
||||
return;
|
||||
}
|
||||
|
||||
char k[128];
|
||||
snprintf(k, sizeof(k), "u:%s", username);
|
||||
snprintf(cs->login.user, sizeof(cs->login.user), "%s", username);
|
||||
snprintf(cs->login.pass, sizeof(cs->login.pass), "%s", password);
|
||||
|
||||
cbop = malloc(sizeof(*cbop));
|
||||
memset(cbop, 0, sizeof(*cbop));
|
||||
cbop->data = cs;
|
||||
CBGQ_V0(0, k, strlen(k), client_login_2, 0, 0);
|
||||
|
||||
json_object_put(obj);
|
||||
json_tokener_free(tok);
|
||||
}
|
||||
@@ -0,0 +1,80 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <ev.h>
|
||||
|
||||
#include <hmbase.h>
|
||||
|
||||
#include <client.h>
|
||||
|
||||
struct playerlist_s {
|
||||
struct conn_client_s *player;
|
||||
struct playerlist_s *next;
|
||||
};
|
||||
|
||||
static struct playerlist_s *queue = NULL;
|
||||
static int gamehandle = 0;
|
||||
|
||||
void mm_push(struct conn_client_s *c)
|
||||
{
|
||||
struct playerlist_s *p;
|
||||
|
||||
p = malloc(sizeof(*p));
|
||||
|
||||
p->player = c;
|
||||
p->next = queue;
|
||||
|
||||
queue = p;
|
||||
}
|
||||
|
||||
struct conn_client_s *mm_pop()
|
||||
{
|
||||
struct conn_client_s *c;
|
||||
struct playerlist_s *p;
|
||||
|
||||
p = queue;
|
||||
c = queue->player;
|
||||
|
||||
queue = queue->next;
|
||||
free(p);
|
||||
|
||||
return c;
|
||||
}
|
||||
|
||||
int matchmaking(struct conn_client_s *player1)
|
||||
{
|
||||
struct conn_client_s *player2;
|
||||
|
||||
// first player
|
||||
if(queue == NULL) {
|
||||
mm_push(player1);
|
||||
return 0;
|
||||
}
|
||||
|
||||
player2 = mm_pop();
|
||||
|
||||
if(player1 && player2) {
|
||||
start_game(player1, player2, gamehandle++);
|
||||
return 0;
|
||||
}
|
||||
|
||||
return -1;
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#ifndef CLIENT_H_
|
||||
#define CLIENT_H_
|
||||
|
||||
enum packet_e {
|
||||
CLIENT_CREATEACCOUNT = 1,
|
||||
CLIENT_LOGIN = 2,
|
||||
CLIENT_DECK = 3,
|
||||
};
|
||||
|
||||
int proto_add(char **dst, const char *maxdst, const void *src, const int nsrc);
|
||||
int proto_packet(char *dst, enum packet_e packet, char *src, const int nsrc);
|
||||
char *read_str(char **buf, char *end, int *len);
|
||||
|
||||
void start_game(struct conn_client_s *p1, struct conn_client_s *p2, const int gamehandle);
|
||||
|
||||
void client_login(struct conn_client_s *cs, const char *buf, int len);
|
||||
|
||||
int matchmaking(struct conn_client_s *player1);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,128 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#ifndef STEP_H_
|
||||
#define STEP_H_
|
||||
|
||||
int step11_0(char *dst, int ndst);
|
||||
int step11_1(char *dst, int ndst);
|
||||
int step11_2(char *dst, int ndst);
|
||||
int step11_3(char *dst, int ndst);
|
||||
int step11_4(char *dst, int ndst);
|
||||
int step11_5(char *dst, int ndst);
|
||||
int step11_6(char *dst, int ndst);
|
||||
int step11_7(char *dst, int ndst);
|
||||
int step11_8(char *dst, int ndst);
|
||||
int step11_9(char *dst, int ndst);
|
||||
int step11_10(char *dst, int ndst);
|
||||
int step11_11(char *dst, int ndst);
|
||||
int step11_12(char *dst, int ndst);
|
||||
int step11_13(char *dst, int ndst);
|
||||
int step11_14(char *dst, int ndst);
|
||||
int step11_15(char *dst, int ndst);
|
||||
int step11_16(char *dst, int ndst);
|
||||
int step11_17(char *dst, int ndst);
|
||||
int step11_18(char *dst, int ndst);
|
||||
int step11_19(char *dst, int ndst);
|
||||
int step11_20(char *dst, int ndst);
|
||||
int step11_21(char *dst, int ndst);
|
||||
int step11_22(char *dst, int ndst);
|
||||
int step11_23(char *dst, int ndst);
|
||||
int step11_24(char *dst, int ndst);
|
||||
int step11_25(char *dst, int ndst);
|
||||
int step11_26(char *dst, int ndst);
|
||||
int step11_27(char *dst, int ndst);
|
||||
int step11_28(char *dst, int ndst);
|
||||
int step11_29(char *dst, int ndst);
|
||||
int step11_30(char *dst, int ndst);
|
||||
int step11_31(char *dst, int ndst);
|
||||
int step11_32(char *dst, int ndst);
|
||||
int step11_33(char *dst, int ndst);
|
||||
int step11_34(char *dst, int ndst);
|
||||
int step11_35(char *dst, int ndst);
|
||||
int step11_36(char *dst, int ndst);
|
||||
int step11_37(char *dst, int ndst);
|
||||
int step11_38(char *dst, int ndst);
|
||||
int step11_39(char *dst, int ndst);
|
||||
int step11_40(char *dst, int ndst);
|
||||
|
||||
int step12_0(char *dst, int ndst);
|
||||
int step12_1(char *dst, int ndst);
|
||||
|
||||
int step13_0(char *dst, int ndst);
|
||||
int step13_1(char *dst, int ndst);
|
||||
int step13_2(char *dst, int ndst);
|
||||
|
||||
int step14_0(char *dst, int ndst);
|
||||
int step14_1(char *dst, int ndst);
|
||||
int step14_2(char *dst, int ndst);
|
||||
|
||||
int step15_0(char *dst, int ndst);
|
||||
int step15_1(char *dst, int ndst);
|
||||
|
||||
int step16_0(char *dst, int ndst);
|
||||
int step16_1(char *dst, int ndst);
|
||||
int step16_2(char *dst, int ndst);
|
||||
|
||||
int step17_0(char *dst, int ndst);
|
||||
int step17_1(char *dst, int ndst);
|
||||
int step17_2(char *dst, int ndst);
|
||||
int step17_3(char *dst, int ndst);
|
||||
|
||||
int step18_0(char *dst, int ndst);
|
||||
int step18_1(char *dst, int ndst);
|
||||
int step18_2(char *dst, int ndst);
|
||||
int step18_3(char *dst, int ndst);
|
||||
|
||||
int step19_0(char *dst, int ndst);
|
||||
int step19_1(char *dst, int ndst);
|
||||
int step19_2(char *dst, int ndst);
|
||||
int step19_3(char *dst, int ndst);
|
||||
int step19_4(char *dst, int ndst);
|
||||
|
||||
int step20_0(char *dst, int ndst);
|
||||
|
||||
int step21_0(char *dst, int ndst);
|
||||
int step21_1(char *dst, int ndst);
|
||||
|
||||
int step25_0(char *dst, int ndst);
|
||||
int step25_1(char *dst, int ndst);
|
||||
int step25_2(char *dst, int ndst);
|
||||
|
||||
int step24_0(char *dst, int ndst);
|
||||
int step24_1(char *dst, int ndst);
|
||||
int step24_2(char *dst, int ndst);
|
||||
|
||||
int step23_0(char *dst, int ndst);
|
||||
int step23_1(char *dst, int ndst);
|
||||
int step23_2(char *dst, int ndst);
|
||||
|
||||
int step22_0(char *dst, int ndst);
|
||||
int step22_1(char *dst, int ndst);
|
||||
int step22_2(char *dst, int ndst);
|
||||
int step22_3(char *dst, int ndst);
|
||||
int step22_4(char *dst, int ndst);
|
||||
int step22_5(char *dst, int ndst);
|
||||
int step22_6(char *dst, int ndst);
|
||||
int step22_7(char *dst, int ndst);
|
||||
int step22_8(char *dst, int ndst);
|
||||
|
||||
int step22_9_1(char *dst, int ndst, int iplen);
|
||||
int step22_9_2(char *dst, int ndst, int port);
|
||||
int step22_9_ip(char *dst, int ndst, const char *ip, const int iplen);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,840 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <ev.h>
|
||||
#include <unistd.h>
|
||||
#include <errno.h>
|
||||
|
||||
#define HM_LOBBYSERVER
|
||||
#include <hmbase.h>
|
||||
|
||||
#include <client.h>
|
||||
#include <step.h>
|
||||
|
||||
#define HS_MAX 26
|
||||
|
||||
struct hsmap_s {
|
||||
int service;
|
||||
int method;
|
||||
int token;
|
||||
void (*reply)(struct conn_client_s *c, const char *buf, const int lenlen);
|
||||
};
|
||||
|
||||
static struct hm_log_s l;
|
||||
static struct hm_pool_s *pool;
|
||||
static struct ev_loop *loop;
|
||||
|
||||
char ip[32];
|
||||
int iplen = 0;
|
||||
int gameserver_port = 0;
|
||||
|
||||
void dump_binary(char *buf, int len)
|
||||
{
|
||||
int i;
|
||||
|
||||
printf("dumping binary:\n");
|
||||
for(i = 0; i < len; i++) {
|
||||
printf("%x|", buf[i]);
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
static int step0_build(char *dst, int ndst) {const char src[163] = { 0x00, 0x0C, 0x08, 0xFE, 0x01, 0x18, 0x00, 0x20, 0x00, 0x28, 0x95, 0x01, 0x30, 0x00, 0x0A, 0x0C, 0x08, 0xF4, 0xC9, 0xCC, 0xF3, 0x0D, 0x10, 0xC6, 0x87, 0xBC, 0xB8, 0x05, 0x12, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x18, 0x00, 0x22, 0x0E, 0x0A, 0x0C, 0x01, 0x09, 0x08, 0x0A, 0x04, 0x03, 0x05, 0x07, 0x06, 0x02, 0x11, 0x10, 0x2A, 0x2E, 0x0A, 0x2C, 0x0D, 0x55, 0x45, 0x00, 0x00, 0x15, 0x7A, 0x72, 0x74, 0x6D, 0x1A, 0x20, 0x6F, 0xF4, 0xFD, 0xD5, 0xFA, 0x5F, 0x6D, 0x62, 0xA2, 0x78, 0xA0, 0x44, 0x03, 0xE0, 0x75, 0xD6, 0x9D, 0x73, 0x4C, 0xD4, 0x88, 0x07, 0x32, 0xDC, 0xE8, 0xED, 0xC6, 0xA3, 0xF5, 0x28, 0x08, 0x92, 0x30, 0xA0, 0x8A, 0x95, 0xF4, 0xCE, 0xBD, 0xCC, 0x02, 0x42, 0x2E, 0x0A, 0x2C, 0x0D, 0x55, 0x45, 0x00, 0x00, 0x15, 0x7A, 0x72, 0x74, 0x6D, 0x1A, 0x20, 0xB4, 0xBD, 0x0F, 0x00, 0x96, 0xA7, 0x64, 0x8D, 0xE1, 0xD1, 0x90, 0x42, 0xFB, 0x7A, 0x79, 0xB9, 0x6C, 0x0D, 0xF4, 0x8E, 0xEA, 0x34, 0x88, 0xF4, 0x98, 0xB0, 0x8A, 0xD3, 0xD3, 0x8F, 0xB2, 0xCC, };
|
||||
if(ndst >= 163) { memcpy(dst, src, 163); }
|
||||
return 163;}
|
||||
|
||||
static int step1_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x01, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step1_1(char *dst, int ndst) {const char src[27] = { 0x00, 0x0C, 0x08, 0x01, 0x10, 0x0C, 0x18, 0x00, 0x20, 0x00, 0x28, 0x0D, 0x30, 0x00, 0x08, 0x01, 0x10, 0xC3, 0x83, 0xA8, 0xF4, 0xCE, 0xBD, 0xCC, 0x02, 0x18, 0x00, };
|
||||
if(ndst >= 27) { memcpy(dst, src, 27); }
|
||||
return 27;}
|
||||
|
||||
static int step1_2(char *dst, int ndst) {const char src[14] = { 0x00, 0x0C, 0x08, 0x01, 0x10, 0x0D, 0x18, 0x01, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 14) { memcpy(dst, src, 14); }
|
||||
return 14;}
|
||||
|
||||
static int step1_3(char *dst, int ndst) {const char src[52] = { 0x00, 0x0C, 0x08, 0x08, 0x10, 0x03, 0x18, 0x02, 0x20, 0x00, 0x28, 0x26, 0x30, 0x00, 0x12, 0x0C, 0x77, 0x65, 0x62, 0x5F, 0x61, 0x75, 0x74, 0x68, 0x5F, 0x75, 0x72, 0x6C, 0x1A, 0x16, 0x68, 0x74, 0x74, 0x70, 0x3A, 0x2F, 0x2F, 0x68, 0x73, 0x2F, 0x6c, 0x6f, 0x67, 0x69, 0x6e, 0x2F, 0x7a, 0x2e, 0x68, 0x74, 0x6d, 0x6c };
|
||||
if(ndst >= 52) { memcpy(dst, src, 52); }
|
||||
return 52;}
|
||||
|
||||
static int step2_0(char *dst, int ndst) {const char src[23] = { 0x00, 0x0C, 0x08, 0x00, 0x10, 0x03, 0x18, 0x03, 0x20, 0x00, 0x28, 0x09, 0x30, 0x00, 0x09, 0x85, 0x2B, 0x96, 0xEE, 0xEC, 0x31, 0x05, 0x00, };
|
||||
if(ndst >= 23) { memcpy(dst, src, 23); }
|
||||
return 23;}
|
||||
|
||||
static int step3_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x02, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step3_1(char *dst, int ndst) {const char src[16] = { 0x00, 0x0C, 0x08, 0x01, 0x10, 0x0A, 0x18, 0x04, 0x20, 0x00, 0x28, 0x02, 0x30, 0x00, 0x08, 0x00, };
|
||||
if(ndst >= 16) { memcpy(dst, src, 16); }
|
||||
return 16;}
|
||||
|
||||
static int step3_2(char *dst, int ndst) {const char src[16] = { 0x00, 0x0C, 0x08, 0x01, 0x10, 0x0A, 0x18, 0x05, 0x20, 0x00, 0x28, 0x02, 0x30, 0x00, 0x08, 0x00, };
|
||||
if(ndst >= 16) { memcpy(dst, src, 16); }
|
||||
return 16;}
|
||||
|
||||
static int step3_3(char *dst, int ndst) {const char src[160] = { 0x00, 0x0D, 0x08, 0x01, 0x10, 0x05, 0x18, 0x06, 0x20, 0x00, 0x28, 0x91, 0x01, 0x30, 0x00, 0x08, 0x00, 0x12, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x22, 0x00, 0x28, 0x01, 0x28, 0x02, 0x28, 0x03, 0x28, 0x06, 0x28, 0x62, 0x30, 0x02, 0x3A, 0x0F, 0x51, 0x75, 0x69, 0x72, 0x6B, 0x79, 0x4F, 0x72, 0x63, 0x23, 0x32, 0x39, 0x36, 0x38, 0x38, 0x42, 0x02, 0x53, 0x4B, 0x4A, 0x40, 0xAA, 0x15, 0x06, 0x17, 0x71, 0x93, 0x8C, 0x77, 0x90, 0xCD, 0xA5, 0x9B, 0xD5, 0x00, 0xBF, 0x2A, 0xA3, 0x20, 0x59, 0x12, 0x14, 0x80, 0x98, 0xF8, 0xB6, 0x8A, 0xDA, 0x80, 0x2F, 0x11, 0x22, 0xB2, 0x79, 0x2D, 0x90, 0xFA, 0x29, 0x52, 0xA3, 0x38, 0x03, 0x2A, 0x03, 0x89, 0x53, 0x22, 0xDD, 0x02, 0xC4, 0xE2, 0xF3, 0xCF, 0xE6, 0xCD, 0x72, 0x41, 0x54, 0x66, 0xB3, 0x79, 0x8C, 0x9A, 0xDB, 0x01, 0x50, 0x00, };
|
||||
if(ndst >= 160) { memcpy(dst, src, 160); }
|
||||
return 160;}
|
||||
|
||||
static int step4_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x03, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step4_1(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x04, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step4_2(char *dst, int ndst) {const char src[129] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x01, 0x18, 0x07, 0x20, 0x01, 0x28, 0x73, 0x30, 0x00, 0x1A, 0x71, 0xAA, 0x06, 0x6E, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x12, 0x19, 0x0A, 0x17, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x01, 0x18, 0x06, 0x20, 0x00, 0x12, 0x09, 0x18, 0x9A, 0xB1, 0xD8, 0xB4, 0x99, 0xBC, 0xCC, 0x02, 0x12, 0x1A, 0x0A, 0x18, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x01, 0x18, 0x01, 0x20, 0x00, 0x12, 0x0A, 0x2A, 0x08, 0x6A, 0x6F, 0x68, 0x6E, 0x20, 0x62, 0x6F, 0x6E, 0x12, 0x21, 0x0A, 0x1F, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x01, 0x18, 0x04, 0x20, 0x00, 0x12, 0x11, 0x2A, 0x0F, 0x51, 0x75, 0x69, 0x72, 0x6B, 0x79, 0x4F, 0x72, 0x63, 0x23, 0x32, 0x39, 0x36, 0x38, 0x38, };
|
||||
if(ndst >= 129) { memcpy(dst, src, 129); }
|
||||
return 129;}
|
||||
|
||||
static int step4_3(char *dst, int ndst) {const char src[237] = { 0x00, 0x0D, 0x08, 0x05, 0x10, 0x01, 0x18, 0x08, 0x20, 0x02, 0x28, 0xDE, 0x01, 0x30, 0x00, 0x1A, 0xDB, 0x01, 0xAA, 0x06, 0xD7, 0x01, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x21, 0x0A, 0x1F, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x05, 0x20, 0x00, 0x12, 0x11, 0x2A, 0x0F, 0x51, 0x75, 0x69, 0x72, 0x6B, 0x79, 0x4F, 0x72, 0x63, 0x23, 0x32, 0x39, 0x36, 0x38, 0x38, 0x12, 0x24, 0x0A, 0x22, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x07, 0x20, 0x00, 0x12, 0x14, 0x52, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x12, 0x19, 0x0A, 0x17, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x04, 0x20, 0x00, 0x12, 0x09, 0x18, 0x9A, 0xB1, 0xD8, 0xB4, 0x99, 0xBC, 0xCC, 0x02, 0x12, 0x12, 0x0A, 0x10, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x0C, 0x20, 0x00, 0x12, 0x02, 0x10, 0x00, 0x12, 0x12, 0x0A, 0x10, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x01, 0x20, 0x00, 0x12, 0x02, 0x10, 0x00, 0x12, 0x16, 0x0A, 0x14, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x03, 0x20, 0x00, 0x12, 0x06, 0x42, 0x04, 0x57, 0x54, 0x43, 0x47, 0x12, 0x1D, 0x0A, 0x1B, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x06, 0x20, 0x00, 0x12, 0x0D, 0x2A, 0x0B, 0x34, 0x33, 0x37, 0x31, 0x35, 0x34, 0x31, 0x39, 0x35, 0x23, 0x31, };
|
||||
if(ndst >= 237) { memcpy(dst, src, 237); }
|
||||
return 237;}
|
||||
|
||||
static int step4_4(char *dst, int ndst) {const char src[106] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x09, 0x20, 0x01, 0x28, 0x5C, 0x30, 0x00, 0x12, 0x5A, 0xAA, 0x06, 0x57, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x08, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x01, 0x18, 0x06, 0x12, 0x09, 0x18, 0xF1, 0x82, 0xEA, 0xF5, 0xCE, 0xBD, 0xCC, 0x02, 0x12, 0x28, 0x0A, 0x26, 0x0A, 0x0E, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x01, 0x18, 0x03, 0x20, 0x95, 0x94, 0xE0, 0x81, 0x09, 0x12, 0x14, 0x52, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, };
|
||||
if(ndst >= 106) { memcpy(dst, src, 106); }
|
||||
return 106;}
|
||||
|
||||
static int step4_5(char *dst, int ndst) {const char src[82] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x0A, 0x20, 0x02, 0x28, 0x44, 0x30, 0x00, 0x12, 0x42, 0xAA, 0x06, 0x3F, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x08, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x04, 0x12, 0x09, 0x18, 0xF1, 0x82, 0xEA, 0xF5, 0xCE, 0xBD, 0xCC, 0x02, 0x12, 0x10, 0x0A, 0x0E, 0x0A, 0x08, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x01, 0x12, 0x02, 0x10, 0x01, };
|
||||
if(ndst >= 82) { memcpy(dst, src, 82); }
|
||||
return 82;}
|
||||
|
||||
static int step4_6(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x05, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step5_0(char *dst, int ndst) {const char src[65] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x06, 0x20, 0x00, 0x28, 0x34, 0x30, 0x00, 0x08, 0xC8, 0x01, 0x10, 0xC8, 0x01, 0x18, 0xC8, 0x01, 0x22, 0x15, 0x08, 0x01, 0x12, 0x11, 0x62, 0x61, 0x74, 0x74, 0x6C, 0x65, 0x5F, 0x74, 0x61, 0x67, 0x5F, 0x66, 0x72, 0x69, 0x65, 0x6E, 0x64, 0x22, 0x12, 0x08, 0x02, 0x12, 0x0E, 0x72, 0x65, 0x61, 0x6C, 0x5F, 0x69, 0x64, 0x5F, 0x66, 0x72, 0x69, 0x65, 0x6E, 0x64, };
|
||||
if(ndst >= 65) { memcpy(dst, src, 65); }
|
||||
return 65;}
|
||||
|
||||
static int step5_1(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x07, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step5_2(char *dst, int ndst) {const char src[57] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x09, 0x20, 0x00, 0x28, 0x2C, 0x30, 0x00, 0x0D, 0x55, 0x45, 0x00, 0x00, 0x15, 0x79, 0x74, 0x66, 0x70, 0x1A, 0x20, 0x5B, 0x2F, 0x9B, 0x39, 0x43, 0x4A, 0x1C, 0x4E, 0x3F, 0x97, 0x0A, 0x76, 0xC1, 0xE9, 0x7A, 0x85, 0x48, 0xC9, 0x5D, 0xA2, 0xAD, 0x52, 0xA6, 0xD3, 0x7C, 0xF9, 0xD7, 0x93, 0xDE, 0xDD, 0x88, 0x7D, };
|
||||
if(ndst >= 57) { memcpy(dst, src, 57); }
|
||||
return 57;}
|
||||
|
||||
static int step5_3(char *dst, int ndst) {const char src[82] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x08, 0x20, 0x00, 0x28, 0x45, 0x30, 0x00, 0x0A, 0x3C, 0x0A, 0x3A, 0x25, 0x52, 0x55, 0x45, 0x00, 0x2A, 0x03, 0x53, 0x56, 0x4B, 0x30, 0x02, 0x3A, 0x08, 0x6A, 0x6F, 0x68, 0x6E, 0x20, 0x62, 0x6F, 0x6E, 0x42, 0x0F, 0x51, 0x75, 0x69, 0x72, 0x6B, 0x79, 0x4F, 0x72, 0x63, 0x23, 0x32, 0x39, 0x36, 0x38, 0x38, 0x6A, 0x11, 0x53, 0x4F, 0x4E, 0x49, 0x43, 0x51, 0x41, 0x40, 0x47, 0x4D, 0x41, 0x49, 0x4C, 0x2E, 0x43, 0x4F, 0x4D, 0x12, 0x05, 0x15, 0x73, 0x70, 0x8F, 0xDD, };
|
||||
if(ndst >= 82) { memcpy(dst, src, 82); }
|
||||
return 82;}
|
||||
|
||||
static int step6_0(char *dst, int ndst) {const char src[50] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x0A, 0x20, 0x00, 0x28, 0x25, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xBB, 0x02, 0x0A, 0x18, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x0F, 0x32, 0x0D, 0x08, 0x49, 0x18, 0xAC, 0x02, 0x20, 0x00, 0x28, 0x00, 0x30, 0x0F, 0x40, 0x78, };
|
||||
if(ndst >= 50) { memcpy(dst, src, 50); }
|
||||
return 50;}
|
||||
|
||||
static int step7_0(char *dst, int ndst) {const char src[230] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x0B, 0x20, 0x00, 0x28, 0xD7, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0x88, 0x02, 0x22, 0x19, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x09, 0x32, 0x07, 0x80, 0x01, 0x01, 0xA8, 0x01, 0xAC, 0x02, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x07, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 230) { memcpy(dst, src, 230); }
|
||||
return 230;}
|
||||
|
||||
static int step7_1(char *dst, int ndst) {const char src[42] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x0B, 0x20, 0x00, 0x28, 0x1D, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x10, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0xAF, 0x02, };
|
||||
if(ndst >= 42) { memcpy(dst, src, 42); }
|
||||
return 42;}
|
||||
|
||||
static int step7_2(char *dst, int ndst) {const char src[230] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x0C, 0x20, 0x00, 0x28, 0xD7, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0x88, 0x02, 0x22, 0x19, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x09, 0x32, 0x07, 0x80, 0x01, 0x01, 0xA8, 0x01, 0xAC, 0x02, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x07, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 230) { memcpy(dst, src, 230); }
|
||||
return 230;}
|
||||
|
||||
static int step7_3(char *dst, int ndst) {const char src[226] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x0D, 0x20, 0x00, 0x28, 0xD3, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xB0, 0x02, 0x22, 0x15, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x05, 0x32, 0x03, 0x08, 0xA6, 0x56, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x03, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 226) { memcpy(dst, src, 226); }
|
||||
return 226;}
|
||||
|
||||
static int step8_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x0C, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step9_0(char *dst, int ndst) {const char src[67] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x0E, 0x20, 0x02, 0x28, 0x35, 0x30, 0x00, 0x12, 0x33, 0xAA, 0x06, 0x30, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x1A, 0x0A, 0x18, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x13, 0x12, 0x0A, 0x2A, 0x08, 0x38, 0x33, 0x38, 0x38, 0x36, 0x30, 0x38, 0x30, };
|
||||
if(ndst >= 67) { memcpy(dst, src, 67); }
|
||||
return 67;}
|
||||
|
||||
static int step9_1(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x0D, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step9_2(char *dst, int ndst) {const char src[79] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x0F, 0x20, 0x02, 0x28, 0x41, 0x30, 0x00, 0x12, 0x3F, 0xAA, 0x06, 0x3C, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x26, 0x0A, 0x24, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x14, 0x12, 0x16, 0x2A, 0x14, 0x65, 0x75, 0x2E, 0x61, 0x63, 0x74, 0x75, 0x61, 0x6C, 0x2E, 0x62, 0x61, 0x74, 0x74, 0x6C, 0x65, 0x2E, 0x6E, 0x65, 0x74, };
|
||||
if(ndst >= 79) { memcpy(dst, src, 79); }
|
||||
return 79;}
|
||||
|
||||
static int step9_3(char *dst, int ndst) {const char src[66] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x0E, 0x20, 0x00, 0x28, 0x35, 0x30, 0x00, 0x12, 0x33, 0x18, 0x80, 0xB5, 0xB9, 0xF5, 0x0E, 0x22, 0x1F, 0x0A, 0x0D, 0x36, 0x32, 0x2E, 0x31, 0x39, 0x37, 0x2E, 0x32, 0x34, 0x33, 0x2E, 0x38, 0x38, 0x10, 0xCB, 0xA6, 0x01, 0x1A, 0x0A, 0x42, 0x72, 0x61, 0x74, 0x69, 0x73, 0x6C, 0x61, 0x76, 0x61, 0x28, 0x00, 0x30, 0x00, 0x38, 0x00, 0x40, 0x9A, 0xE5, 0xA1, 0xB9, 0x05, };
|
||||
if(ndst >= 66) { memcpy(dst, src, 66); }
|
||||
return 66;}
|
||||
|
||||
static int step9_4(char *dst, int ndst) {const char src[42] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x0F, 0x20, 0x00, 0x28, 0x1D, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x10, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0x8B, 0x02, };
|
||||
if(ndst >= 42) { memcpy(dst, src, 42); }
|
||||
return 42;}
|
||||
|
||||
static int step9_5(char *dst, int ndst) {const char src[228] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x10, 0x20, 0x00, 0x28, 0xD5, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x22, 0x17, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0x8B, 0x02, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x05, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 228) { memcpy(dst, src, 228); }
|
||||
return 228;}
|
||||
|
||||
static int step9_6(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x12, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); }
|
||||
return 13;}
|
||||
|
||||
static int step9_7(char *dst, int ndst) {const char src[59] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x11, 0x20, 0x02, 0x28, 0x2D, 0x30, 0x00, 0x12, 0x2B, 0xAA, 0x06, 0x28, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x0A, 0x10, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x01, 0x12, 0x02, 0x10, 0x00, };
|
||||
if(ndst >= 59) { memcpy(dst, src, 59); }
|
||||
return 59;}
|
||||
|
||||
static int step9_8(char *dst, int ndst) {const char src[50] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x11, 0x20, 0x00, 0x28, 0x25, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xBB, 0x02, 0x0A, 0x18, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x0F, 0x32, 0x0D, 0x08, 0x1E, 0x18, 0xAC, 0x02, 0x20, 0x00, 0x28, 0x00, 0x30, 0x0F, 0x40, 0x78, };
|
||||
if(ndst >= 50) { memcpy(dst, src, 50); }
|
||||
return 50;}
|
||||
|
||||
static int step10_0(char *dst, int ndst) {const char src[225] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x12, 0x20, 0x00, 0x28, 0xD2, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xCA, 0x02, 0x22, 0x14, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x04, 0x32, 0x02, 0x08, 0x01, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x02, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 225) { memcpy(dst, src, 225); }
|
||||
return 225;}
|
||||
|
||||
static int step10_1(char *dst, int ndst) {const char src[42] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x10, 0x20, 0x00, 0x28, 0x1D, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x10, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0xCD, 0x01, };
|
||||
if(ndst >= 42) { memcpy(dst, src, 42); }
|
||||
return 42;}
|
||||
|
||||
static int step10_2(char *dst, int ndst) {const char src[228] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x13, 0x20, 0x00, 0x28, 0xD5, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x22, 0x17, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0xCD, 0x01, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x05, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 228) { memcpy(dst, src, 228); }
|
||||
return 228;}
|
||||
|
||||
static int step10_3(char *dst, int ndst) {const char src[42] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x13, 0x20, 0x00, 0x28, 0x1D, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x10, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0x94, 0x02, };
|
||||
if(ndst >= 42) { memcpy(dst, src, 42); }
|
||||
return 42;}
|
||||
|
||||
static int step10_4(char *dst, int ndst) {const char src[228] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x14, 0x20, 0x00, 0x28, 0xD5, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x22, 0x17, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0x94, 0x02, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x05, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 228) { memcpy(dst, src, 228); }
|
||||
return 228;}
|
||||
|
||||
static int step10_5(char *dst, int ndst) {const char src[203] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x15, 0x20, 0x00, 0x28, 0xBC, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xB3, 0x02, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x00, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 203) { memcpy(dst, src, 203); }
|
||||
return 203;}
|
||||
|
||||
static int step10_6(char *dst, int ndst) {const char src[225] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x16, 0x20, 0x00, 0x28, 0xD2, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xCB, 0x02, 0x22, 0x14, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x04, 0x32, 0x02, 0x08, 0x01, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x02, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 225) { memcpy(dst, src, 225); }
|
||||
return 225;}
|
||||
|
||||
void step0(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int n;
|
||||
|
||||
n = step0_build(out, sizeof(out));
|
||||
|
||||
hm_send(c, out, n);
|
||||
}
|
||||
|
||||
void step1(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int n, a, b, x;
|
||||
|
||||
n = step1_0(out, sizeof(out));
|
||||
a = step1_1(out + n, sizeof(out));
|
||||
b = step1_2(out + n + a, sizeof(out));
|
||||
x = step1_3(out + n + a + b, sizeof(out));
|
||||
hm_send(c, out, n + a + b + x);
|
||||
}
|
||||
|
||||
void step2(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int n;
|
||||
|
||||
// 12 is offet, length of token is 16
|
||||
if(len < (12 + 6)) {
|
||||
return;
|
||||
}
|
||||
|
||||
snprintf(c->token, sizeof(c->token), "%.*s", len - 12, buf + 12);
|
||||
c->ntoken = len - 12;
|
||||
|
||||
n = step2_0(out, sizeof(out));
|
||||
|
||||
hm_send(c, out, n);
|
||||
}
|
||||
|
||||
void step3(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int n, a, b, x;
|
||||
|
||||
n = step3_0(out, sizeof(out));
|
||||
a = step3_1(out + n, sizeof(out));
|
||||
b = step3_2(out + n + a, sizeof(out));
|
||||
x = step3_3(out + n + a + b, sizeof(out));
|
||||
hm_send(c, out, n + a + b + x);
|
||||
}
|
||||
|
||||
void step4(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t;
|
||||
|
||||
t = step4_0(out, sizeof(out));
|
||||
t += step4_1(out + t, sizeof(out));
|
||||
t += step4_2(out + t, sizeof(out));
|
||||
t += step4_3(out + t, sizeof(out));
|
||||
t += step4_5(out + t, sizeof(out));
|
||||
t += step4_6(out + t, sizeof(out));
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step5(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int t;
|
||||
|
||||
t = step5_0(out, sizeof(out));
|
||||
t += step5_1(out + t, sizeof(out));
|
||||
t += step5_2(out + t, sizeof(out));
|
||||
t += step5_3(out + t, sizeof(out));
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step6(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int n;
|
||||
|
||||
n = step6_0(out, sizeof(out));
|
||||
|
||||
hm_send(c, out, n);
|
||||
}
|
||||
|
||||
void step7(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t;
|
||||
|
||||
t = step7_0(out, sizeof(out));
|
||||
t += step7_1(out + t, sizeof(out));
|
||||
t += step7_2(out + t, sizeof(out));
|
||||
t += step7_3(out + t, sizeof(out));
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step8(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[1024];
|
||||
int n;
|
||||
|
||||
n = step0_build(out, sizeof(out));
|
||||
|
||||
hm_send(c, out, n);
|
||||
}
|
||||
|
||||
void step9(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t;
|
||||
|
||||
t = step9_0(out, sizeof(out));
|
||||
t += step9_1(out + t, sizeof(out));
|
||||
t += step9_2(out + t, sizeof(out));
|
||||
t += step9_3(out + t, sizeof(out));
|
||||
t += step9_4(out + t, sizeof(out));
|
||||
t += step9_5(out + t, sizeof(out));
|
||||
t += step9_6(out + t, sizeof(out));
|
||||
t += step9_7(out + t, sizeof(out));
|
||||
t += step9_8(out + t, sizeof(out));
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step10(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t;
|
||||
|
||||
t = step10_0(out, sizeof(out));
|
||||
t += step10_1(out + t, sizeof(out));
|
||||
t += step10_2(out + t, sizeof(out));
|
||||
t += step10_3(out + t, sizeof(out));
|
||||
t += step10_4(out + t, sizeof(out));
|
||||
t += step10_5(out + t, sizeof(out));
|
||||
t += step10_6(out + t, sizeof(out));
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
|
||||
void step11(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[65536];
|
||||
int t = 0;
|
||||
t += step11_0(out + t, sizeof(out) - t);
|
||||
t += step11_0(out + t, sizeof(out) - t);
|
||||
t += step11_1(out + t, sizeof(out) - t);
|
||||
t += step11_2(out + t, sizeof(out) - t);
|
||||
t += step11_3(out + t, sizeof(out) - t);
|
||||
t += step11_4(out + t, sizeof(out) - t);
|
||||
t += step11_5(out + t, sizeof(out) - t);
|
||||
t += step11_6(out + t, sizeof(out) - t);
|
||||
t += step11_7(out + t, sizeof(out) - t);
|
||||
t += step11_8(out + t, sizeof(out) - t);
|
||||
t += step11_9(out + t, sizeof(out) - t);
|
||||
t += step11_10(out + t, sizeof(out) - t);
|
||||
t += step11_11(out + t, sizeof(out) - t);
|
||||
t += step11_12(out + t, sizeof(out) - t);
|
||||
t += step11_13(out + t, sizeof(out) - t);
|
||||
t += step11_14(out + t, sizeof(out) - t);
|
||||
t += step11_15(out + t, sizeof(out) - t);
|
||||
t += step11_16(out + t, sizeof(out) - t);
|
||||
t += step11_17(out + t, sizeof(out) - t);
|
||||
t += step11_18(out + t, sizeof(out) - t);
|
||||
t += step11_19(out + t, sizeof(out) - t);
|
||||
t += step11_20(out + t, sizeof(out) - t);
|
||||
t += step11_21(out + t, sizeof(out) - t);
|
||||
t += step11_22(out + t, sizeof(out) - t);
|
||||
t += step11_23(out + t, sizeof(out) - t);
|
||||
t += step11_24(out + t, sizeof(out) - t);
|
||||
t += step11_25(out + t, sizeof(out) - t);
|
||||
t += step11_26(out + t, sizeof(out) - t);
|
||||
t += step11_27(out + t, sizeof(out) - t);
|
||||
t += step11_28(out + t, sizeof(out) - t);
|
||||
t += step11_29(out + t, sizeof(out) - t);
|
||||
t += step11_30(out + t, sizeof(out) - t);
|
||||
t += step11_31(out + t, sizeof(out) - t);
|
||||
t += step11_32(out + t, sizeof(out) - t);
|
||||
t += step11_33(out + t, sizeof(out) - t);
|
||||
t += step11_34(out + t, sizeof(out) - t);
|
||||
t += step11_35(out + t, sizeof(out) - t);
|
||||
t += step11_36(out + t, sizeof(out) - t);
|
||||
t += step11_37(out + t, sizeof(out) - t);
|
||||
t += step11_38(out + t, sizeof(out) - t);
|
||||
t += step11_39(out + t, sizeof(out) - t);
|
||||
t += step11_40(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step12(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step12_0(out + t, sizeof(out) - t);
|
||||
t += step12_1(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step13(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[16384];
|
||||
int t = 0;
|
||||
t += step13_0(out + t, sizeof(out) - t);
|
||||
t += step13_1(out + t, sizeof(out) - t);
|
||||
t += step13_2(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step14(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step14_0(out + t, sizeof(out) - t);
|
||||
t += step14_1(out + t, sizeof(out) - t);
|
||||
t += step14_2(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step15(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step15_0(out + t, sizeof(out) - t);
|
||||
t += step15_1(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step16(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step16_0(out + t, sizeof(out) - t);
|
||||
t += step16_1(out + t, sizeof(out) - t);
|
||||
t += step16_2(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step17(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step17_0(out + t, sizeof(out) - t);
|
||||
t += step17_1(out + t, sizeof(out) - t);
|
||||
t += step17_2(out + t, sizeof(out) - t);
|
||||
t += step17_3(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step18(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step18_0(out + t, sizeof(out) - t);
|
||||
t += step18_1(out + t, sizeof(out) - t);
|
||||
t += step18_2(out + t, sizeof(out) - t);
|
||||
t += step18_3(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step19(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step19_0(out + t, sizeof(out) - t);
|
||||
t += step19_1(out + t, sizeof(out) - t);
|
||||
t += step19_2(out + t, sizeof(out) - t);
|
||||
t += step19_3(out + t, sizeof(out) - t);
|
||||
t += step19_4(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step20(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step20_0(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step21(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step21_0(out + t, sizeof(out) - t);
|
||||
t += step21_1(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void start_game(struct conn_client_s *p1, struct conn_client_s *p2, const int gamehandle)
|
||||
{
|
||||
char buf1[2048], buf2[2048];
|
||||
char *out;
|
||||
int t;
|
||||
|
||||
t = 0;
|
||||
out = buf1;
|
||||
t += step22_0(out + t, sizeof(buf2) - t);
|
||||
t += step22_1(out + t, sizeof(buf2) - t);
|
||||
t += step22_2(out + t, sizeof(buf2) - t);
|
||||
t += step22_3(out + t, sizeof(buf2) - t);
|
||||
t += step22_4(out + t, sizeof(buf2) - t);
|
||||
t += step22_5(out + t, sizeof(buf2) - t);
|
||||
t += step22_6(out + t, sizeof(buf2) - t);
|
||||
t += step22_7(out + t, sizeof(buf2) - t);
|
||||
t += step22_8(out + t, sizeof(buf2) - t);
|
||||
t += step22_9_1(out + t, sizeof(buf2) - t, iplen);
|
||||
t += step22_9_ip(out + t, sizeof(buf2) - t, ip, iplen);
|
||||
t += step22_9_2(out + t, sizeof(buf2) - t, gameserver_port);
|
||||
|
||||
t = 0;
|
||||
out = buf2;
|
||||
t += step22_0(out + t, sizeof(buf2) - t);
|
||||
t += step22_1(out + t, sizeof(buf2) - t);
|
||||
t += step22_2(out + t, sizeof(buf2) - t);
|
||||
t += step22_3(out + t, sizeof(buf2) - t);
|
||||
t += step22_4(out + t, sizeof(buf2) - t);
|
||||
t += step22_5(out + t, sizeof(buf2) - t);
|
||||
t += step22_6(out + t, sizeof(buf2) - t);
|
||||
t += step22_7(out + t, sizeof(buf2) - t);
|
||||
t += step22_8(out + t, sizeof(buf2) - t);
|
||||
t += step22_9_1(out + t, sizeof(buf2) - t, iplen);
|
||||
t += step22_9_ip(out + t, sizeof(buf2) - t, ip, iplen);
|
||||
t += step22_9_2(out + t, sizeof(buf2) - t, gameserver_port);
|
||||
|
||||
memcpy(buf1 + 1343 + (iplen - 14), p1->token, p1->ntoken);
|
||||
memcpy(buf2 + 1343 + (iplen - 14), p2->token, p2->ntoken);
|
||||
|
||||
hm_send(p1, buf1, t);
|
||||
hm_send(p2, buf2, t);
|
||||
}
|
||||
|
||||
void step22(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
c->skip = 1;
|
||||
matchmaking(c);
|
||||
}
|
||||
|
||||
void step23(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step23_0(out + t, sizeof(out) - t);
|
||||
t += step23_1(out + t, sizeof(out) - t);
|
||||
t += step23_2(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step24(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step24_0(out + t, sizeof(out) - t);
|
||||
t += step24_1(out + t, sizeof(out) - t);
|
||||
t += step24_2(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
void step25(struct conn_client_s *c, const char *buf, const int len)
|
||||
{
|
||||
char out[2048];
|
||||
int t = 0;
|
||||
t += step25_0(out + t, sizeof(out) - t);
|
||||
t += step25_1(out + t, sizeof(out) - t);
|
||||
t += step25_2(out + t, sizeof(out) - t);
|
||||
|
||||
hm_send(c, out, t);
|
||||
}
|
||||
|
||||
static struct hsmap_s hsmap[HS_MAX] = {
|
||||
{0, 1, 0, step0},
|
||||
{1, 1, 1, step1},
|
||||
{1, 7, 2, step2},
|
||||
{-2, 0, 3, step3},
|
||||
{4, 1, 4, step4},
|
||||
{0x10, 1, 9, step5},
|
||||
{9, 1, 0xa, step6},
|
||||
{9, 1, 0xb, step7},
|
||||
{9, 1, 0x11, step8},
|
||||
{4, 3, 0x12, step9},
|
||||
{9, 1, 0x13, step10},
|
||||
{9, 1, 0x19, step11},
|
||||
{9, 1, 0x1b, step12},
|
||||
{9, 1, 0x1c, step13},
|
||||
{9, 1, 0x1d, step14},
|
||||
{4, 3, 0x1f, step15},
|
||||
{0x10, 1, 0x20, step16},
|
||||
{9, 1, 0x22, step17},
|
||||
{4, 3, 0x24, step18},
|
||||
|
||||
// handshake end
|
||||
|
||||
{9, 1, 0x25, step19},
|
||||
{9, 1, 0x26, step20},
|
||||
{4, 3, 0x27, step21}, // swapped with 0x25
|
||||
|
||||
{8, 3, 0x29, step22}, //{4, 3, 0x2a, step22},
|
||||
|
||||
//0|8|8|0|10|5|18|26|28|0|
|
||||
|
||||
/*
|
||||
{9, 1, 0x2c, step23},
|
||||
{4, 1, 0x2d, step24},
|
||||
{4, 3, 0x2e, step25},
|
||||
*/
|
||||
};
|
||||
|
||||
|
||||
void hm_recv(struct conn_client_s *cs, const char *buf, const int len)
|
||||
{
|
||||
int i, service, method, token, token1;
|
||||
|
||||
if(cs->skip == 1) {
|
||||
hm_log(LOG_DEBUG, &l, "Skipping for %d bytes", len);
|
||||
return;
|
||||
}
|
||||
|
||||
if(len < 10) {
|
||||
hm_log(LOG_DEBUG, &l, "Ignoring as received only %d bytes", len);
|
||||
return;
|
||||
}
|
||||
|
||||
service = buf[3];
|
||||
method = buf[5];
|
||||
token = buf[7];
|
||||
token1 = buf[8];
|
||||
|
||||
for(i = 0; i < HS_MAX; i++) {
|
||||
if(len > 12 && *(int *)buf == -1 && *(int *)(buf + 4) == CLIENT_LOGIN ) {
|
||||
client_login(cs, buf + 12, len - 12);
|
||||
return;
|
||||
} else if(service == hsmap[i].service && method == hsmap[i].method && token == hsmap[i].token) {
|
||||
hm_log(LOG_DEBUG, &l, "Hsmap iter: %d", i);
|
||||
hsmap[i].reply(cs, buf, len);
|
||||
return;
|
||||
} else if(service == hsmap[i].service && token1 == hsmap[i].token) {
|
||||
hm_log(LOG_DEBUG, &l, "Hsmap iter: %d", i);
|
||||
hsmap[i].reply(cs, buf, len);
|
||||
return;
|
||||
} else {
|
||||
//hm_log(LOG_DEBUG, &l, "Ignoring: %d %d %d %d %d %d", service, hsmap[i].service, method, hsmap[i].method, token, hsmap[i].token);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int start_server()
|
||||
{
|
||||
struct conn_server_s *cs;
|
||||
|
||||
cs = malloc(sizeof(*cs));
|
||||
memset(cs, 0, sizeof(*cs));
|
||||
|
||||
cs->loop = loop;
|
||||
cs->host = "0.0.0.0";
|
||||
cs->port = "45678";
|
||||
cs->log = &l;
|
||||
cs->pool = pool;
|
||||
cs->recv = hm_recv;
|
||||
connector_server(cs);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void callback(struct instance_s *data)
|
||||
{
|
||||
struct instance_s *i;
|
||||
|
||||
if(data == NULL) {
|
||||
couchbase_deinit();
|
||||
hm_log(LOG_DEBUG, &l, "{Connector}: all destinations are offline");
|
||||
return;
|
||||
}
|
||||
|
||||
for(i = data; i != NULL; i = i->next) {
|
||||
hm_log(LOG_DEBUG, &l, "{Connector}: connstr: [%s] online: %d group: %d bucket index: %d", i->connstr, i->status, i->group, i->index);
|
||||
}
|
||||
|
||||
start_server();
|
||||
}
|
||||
|
||||
void daemonize ()
|
||||
{
|
||||
if (chdir("/") != 0) {
|
||||
hm_log(LOG_EMERG, &l, "Unable change directory to /: %s", strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
|
||||
pid_t pid = fork();
|
||||
if (pid < 0) {
|
||||
hm_log(LOG_EMERG, &l, "Unable to daemonize: fork failed: %s", strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if (pid != 0) {
|
||||
hm_log(LOG_DEBUG, &l, "{core} Daemonized as pid %d.", pid);
|
||||
exit(0);
|
||||
}
|
||||
|
||||
fclose(stdin);
|
||||
fclose(stdout);
|
||||
fclose(stderr);
|
||||
|
||||
#define NULL_DEV "/dev/null"
|
||||
|
||||
stdin = fopen(NULL_DEV, "r");
|
||||
if (stdin == NULL) {
|
||||
hm_log(LOG_EMERG, &l, "Unable to reopen stdin to %s: %s", NULL_DEV, strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
stdout = fopen(NULL_DEV, "w");
|
||||
if (stdout == NULL) {
|
||||
hm_log(LOG_EMERG, &l, "Unable to reopen stdout to %s: %s", NULL_DEV, strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
stderr = fopen(NULL_DEV, "w");
|
||||
if (stderr == NULL) {
|
||||
hm_log(LOG_EMERG, &l, "Unable to reopen stderr to %s: %s", NULL_DEV, strerror(errno));
|
||||
exit(1);
|
||||
}
|
||||
|
||||
pid_t s = setsid();
|
||||
if (s < 0) {
|
||||
hm_log(LOG_EMERG, &l, "Unable to create new session, setsid(2) failed: %s :: %d", strerror(errno), s);
|
||||
exit(1);
|
||||
}
|
||||
|
||||
hm_log(LOG_DEBUG, &l, "Successfully daemonized as pid %d", getpid());
|
||||
}
|
||||
|
||||
int main(int argc, char **argv)
|
||||
{
|
||||
struct couchbase_data_s cd;
|
||||
const char *hosts[1] = { "localhost" };
|
||||
const int groups[1] = { 0 }; // Must start with 0
|
||||
const char *buckets[1] = { "hbs" };
|
||||
const char *passwd[1] = { "aci" };
|
||||
int i;
|
||||
int daemon = 0;
|
||||
|
||||
for(i = 1; i < argc; i++) {
|
||||
if(strlen(argv[i]) > 6 && memcmp(argv[i], "--log=", 6) == 0) {
|
||||
daemon = 1;
|
||||
hm_log_open(&l, argv[i] + 6, LOG_DEBUG);
|
||||
}
|
||||
|
||||
if(strlen(argv[i]) > 13 && memcmp(argv[i], "--gameserver=", 13) == 0) {
|
||||
snprintf(ip, sizeof(ip), "%s", argv[i] + 13);
|
||||
iplen = strlen(ip);
|
||||
}
|
||||
|
||||
if(strlen(argv[i]) > 18 && memcmp(argv[i], "--gameserver_port=", 18) == 0) {
|
||||
char gp[32];
|
||||
snprintf(gp, sizeof(gp), "%s", argv[i] + 18);
|
||||
gameserver_port = atoi(gp);
|
||||
}
|
||||
}
|
||||
|
||||
assert(iplen != 0);
|
||||
// gameserver port number must occupy exactly 2 protobuf bytes
|
||||
assert(gameserver_port > (1 << 10) && gameserver_port < (1 << 14));
|
||||
|
||||
if(daemon == 0) {
|
||||
hm_log_open(&l, NULL, LOG_DEBUG);
|
||||
} else {
|
||||
daemonize();
|
||||
}
|
||||
|
||||
hm_log(LOG_DEBUG, &l, "Associated with gameserver [%s:%d]", ip, gameserver_port);
|
||||
|
||||
loop = ev_default_loop(0);
|
||||
pool = hm_create_pool(&l);
|
||||
|
||||
cd.loop = loop;
|
||||
cd.log = &l;
|
||||
cd.pool = pool;
|
||||
cd.callback = callback;
|
||||
|
||||
cd.hosts = hosts;
|
||||
cd.hgroups = groups;
|
||||
cd.nhosts = 1;
|
||||
cd.buckets = buckets;
|
||||
cd.bpasswd = passwd;
|
||||
cd.nbuckets = 1;
|
||||
|
||||
couchbase_init(&cd);
|
||||
|
||||
ev_run(loop, 0);
|
||||
|
||||
hm_destroy_pool(pool);
|
||||
hm_log_close(&l);
|
||||
ev_default_destroy();
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,87 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <memory.h>
|
||||
|
||||
#include <hmbase.h>
|
||||
|
||||
#include <client.h>
|
||||
|
||||
int proto_add(char **dst, const char *maxdst, const void *src, const int nsrc)
|
||||
{
|
||||
char *start;
|
||||
|
||||
if(maxdst < *dst + nsrc + sizeof(nsrc)) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
start = *dst;
|
||||
|
||||
memcpy(*dst, &nsrc, sizeof(nsrc));
|
||||
*dst += sizeof(nsrc);
|
||||
|
||||
memcpy(*dst, src, nsrc);
|
||||
*dst += nsrc;
|
||||
|
||||
return (*dst - start);
|
||||
}
|
||||
|
||||
int proto_packet(char *dst, enum packet_e packet, char *src, const int nsrc)
|
||||
{
|
||||
int len;
|
||||
int magic = 0xffffffff;
|
||||
|
||||
len = 3 * sizeof(packet) + nsrc;
|
||||
|
||||
memcpy(dst, &magic, sizeof(magic));
|
||||
dst += sizeof(magic);
|
||||
|
||||
memcpy(dst, &packet, sizeof(packet));
|
||||
dst += sizeof(packet);
|
||||
|
||||
memcpy(dst, &len, sizeof(len));
|
||||
dst += sizeof(len);
|
||||
|
||||
memcpy(dst, src, nsrc);
|
||||
dst += nsrc;
|
||||
|
||||
return len;
|
||||
|
||||
}
|
||||
|
||||
char *read_str(char **buf, char *end, int *len)
|
||||
{
|
||||
char *r;
|
||||
|
||||
if(end < (*buf + 4)) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
*len = *(int *)(*buf);
|
||||
*buf += sizeof(int);
|
||||
|
||||
if(*len + *buf > end) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
r = *buf;
|
||||
|
||||
*buf += *len;
|
||||
|
||||
return r;
|
||||
}
|
||||
File diff suppressed because one or more lines are too long
@@ -0,0 +1,30 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step12_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x1A, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00 };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
|
||||
int step12_1(char *dst, int ndst) {const char src[65] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x3A, 0x20, 0x02, 0x28, 0x33, 0x30, 0x00, 0x12, 0x31, 0xAA, 0x06, 0x2E, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x18, 0x0A, 0x16, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x12, 0x12, 0x08, 0x32, 0x06, 0x19, 0x00, 0x00, 0x19, 0x00, 0x00, };
|
||||
if(ndst >= 65) { memcpy(dst, src, 65); } else { abort(); }
|
||||
return 65;}
|
||||
File diff suppressed because one or more lines are too long
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step14_0(char *dst, int ndst) {const char src[42] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x1D, 0x20, 0x00, 0x28, 0x1D, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x10, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0xC7, 0x02, };
|
||||
if(ndst >= 42) { memcpy(dst, src, 42); } else { abort(); }
|
||||
return 42;}
|
||||
int step14_1(char *dst, int ndst) {const char src[230] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x3C, 0x20, 0x00, 0x28, 0xD7, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x22, 0x19, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x09, 0x32, 0x07, 0x08, 0x01, 0x10, 0xC9, 0x01, 0x18, 0x0C, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x07, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 230) { memcpy(dst, src, 230); } else { abort(); }
|
||||
return 230;}
|
||||
int step14_2(char *dst, int ndst) {const char src[203] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x3D, 0x20, 0x00, 0x28, 0xBC, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xD4, 0x01, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x00, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 203) { memcpy(dst, src, 203); } else { abort(); }
|
||||
return 203;}
|
||||
@@ -0,0 +1,29 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step15_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x1E, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step15_1(char *dst, int ndst) {const char src[98] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x3E, 0x20, 0x02, 0x28, 0x54, 0x30, 0x00, 0x12, 0x52, 0xAA, 0x06, 0x4F, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x19, 0x0A, 0x17, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x09, 0x20, 0x00, 0x12, 0x09, 0x18, 0x84, 0xB6, 0xDA, 0xFC, 0xCE, 0xBD, 0xCC, 0x02, 0x12, 0x1E, 0x0A, 0x1C, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x08, 0x20, 0x00, 0x12, 0x0E, 0x3A, 0x0C, 0x0D, 0x47, 0x43, 0x54, 0x57, 0x15, 0x74, 0x61, 0x74, 0x73, 0x18, 0x04, };
|
||||
if(ndst >= 98) { memcpy(dst, src, 98); } else { abort(); }
|
||||
return 98;}
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step16_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x1F, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step16_1(char *dst, int ndst) {const char src[64] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x3F, 0x20, 0x02, 0x28, 0x32, 0x30, 0x00, 0x12, 0x30, 0xAA, 0x06, 0x2D, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x11, 0x12, 0x07, 0x32, 0x05, 0x01, 0x03, 0x00, 0x00, 0x00, };
|
||||
if(ndst >= 64) { memcpy(dst, src, 64); } else { abort(); }
|
||||
return 64;}
|
||||
int step16_2(char *dst, int ndst) {const char src[57] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x20, 0x20, 0x00, 0x28, 0x2C, 0x30, 0x00, 0x0D, 0x55, 0x45, 0x00, 0x00, 0x15, 0x73, 0x73, 0x68, 0x00, 0x1A, 0x20, 0xBE, 0xC5, 0x29, 0x22, 0x31, 0xD7, 0x68, 0x6A, 0xF0, 0x0C, 0xE6, 0x4E, 0x0C, 0x58, 0xCC, 0x6E, 0x36, 0x0E, 0xA9, 0x50, 0xAA, 0xFF, 0xAC, 0x6A, 0x11, 0x4F, 0x03, 0xA9, 0x58, 0xE2, 0x75, 0xF3, };
|
||||
if(ndst >= 57) { memcpy(dst, src, 57); } else { abort(); }
|
||||
return 57;}
|
||||
@@ -0,0 +1,35 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step17_0(char *dst, int ndst) {const char src[44] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x23, 0x20, 0x00, 0x28, 0x1F, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x12, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x09, 0x32, 0x07, 0x08, 0x01, 0x10, 0xC9, 0x01, 0x18, 0x06, };
|
||||
if(ndst >= 44) { memcpy(dst, src, 44); } else { abort(); }
|
||||
return 44;}
|
||||
int step17_1(char *dst, int ndst) {const char src[203] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x40, 0x20, 0x00, 0x28, 0xBC, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xE0, 0x01, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x00, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 203) { memcpy(dst, src, 203); } else { abort(); }
|
||||
return 203;}
|
||||
int step17_2(char *dst, int ndst) {const char src[44] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x24, 0x20, 0x00, 0x28, 0x1F, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x12, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x09, 0x32, 0x07, 0x08, 0x01, 0x10, 0xC9, 0x01, 0x18, 0x12, };
|
||||
if(ndst >= 44) { memcpy(dst, src, 44); } else { abort(); }
|
||||
return 44;}
|
||||
int step17_3(char *dst, int ndst) {const char src[230] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x41, 0x20, 0x00, 0x28, 0xD7, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0x88, 0x02, 0x22, 0x19, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x09, 0x32, 0x07, 0x80, 0x01, 0x01, 0xA8, 0x01, 0xAC, 0x02, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x07, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x89, 0xFF, 0x5C, 0x10, 0x92, 0xE5, 0xA1, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 230) { memcpy(dst, src, 230); } else { abort(); }
|
||||
return 230;}
|
||||
@@ -0,0 +1,35 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step18_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x25, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00 };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step18_1(char *dst, int ndst) {const char src[59] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x42, 0x20, 0x02, 0x28, 0x2D, 0x30, 0x00, 0x12, 0x2B, 0xAA, 0x06, 0x28, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x0A, 0x10, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x01, 0x12, 0x02, 0x10, 0x01, };
|
||||
if(ndst >= 59) { memcpy(dst, src, 59); } else { abort(); }
|
||||
return 59;}
|
||||
int step18_2(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x26, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step18_3(char *dst, int ndst) {const char src[64] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x43, 0x20, 0x02, 0x28, 0x32, 0x30, 0x00, 0x12, 0x30, 0xAA, 0x06, 0x2D, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x11, 0x12, 0x07, 0x32, 0x05, 0x01, 0x04, 0x00, 0x00, 0x00, };
|
||||
if(ndst >= 64) { memcpy(dst, src, 64); } else { abort(); }
|
||||
return 64;}
|
||||
@@ -0,0 +1,38 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step19_0(char *dst, int ndst) {const char src[42] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x25, 0x20, 0x00, 0x28, 0x1D, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x0A, 0x10, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x07, 0x32, 0x05, 0x08, 0x01, 0x10, 0xC7, 0x02, };
|
||||
if(ndst >= 42) { memcpy(dst, src, 42); } else { abort(); }
|
||||
return 42;}
|
||||
int step19_1(char *dst, int ndst) {const char src[230] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x44, 0x20, 0x00, 0x28, 0xD7, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x22, 0x19, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x09, 0x32, 0x07, 0x08, 0x01, 0x10, 0xC9, 0x01, 0x18, 0x04, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x07, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 230) { memcpy(dst, src, 230); } else { abort(); }
|
||||
return 230;}
|
||||
int step19_2(char *dst, int ndst) {const char src[230] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x45, 0x20, 0x00, 0x28, 0xD7, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xC6, 0x02, 0x22, 0x19, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x09, 0x32, 0x07, 0x08, 0x01, 0x10, 0xC9, 0x01, 0x18, 0x16, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x07, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 230) { memcpy(dst, src, 230); } else { abort(); }
|
||||
return 230;}
|
||||
int step19_3(char *dst, int ndst) {const char src[263] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x46, 0x20, 0x00, 0x28, 0xF8, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0xE8, 0x01, 0x22, 0x3A, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x2A, 0x32, 0x28, 0x0A, 0x12, 0x18, 0x00, 0x30, 0x00, 0x38, 0x00, 0x40, 0x01, 0x48, 0x01, 0x50, 0x03, 0x58, 0x00, 0x70, 0x01, 0x78, 0x00, 0x12, 0x12, 0x18, 0x00, 0x30, 0x00, 0x38, 0x00, 0x40, 0x01, 0x48, 0x01, 0x50, 0x03, 0x58, 0x00, 0x70, 0x01, 0x78, 0x00, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x28, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 263) { memcpy(dst, src, 263); } else { abort(); }
|
||||
return 263;}
|
||||
int step19_4(char *dst, int ndst) {const char src[227] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x47, 0x20, 0x00, 0x28, 0xD4, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x1C, 0x57, 0x54, 0x43, 0x47, 0x2E, 0x55, 0x74, 0x69, 0x6C, 0x4E, 0x6F, 0x74, 0x69, 0x66, 0x69, 0x63, 0x61, 0x74, 0x69, 0x6F, 0x6E, 0x4D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x22, 0x13, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x74, 0x79, 0x70, 0x65, 0x12, 0x03, 0x18, 0x9E, 0x02, 0x22, 0x16, 0x0A, 0x0C, 0x66, 0x72, 0x61, 0x67, 0x6D, 0x65, 0x6E, 0x74, 0x5F, 0x30, 0x30, 0x30, 0x12, 0x06, 0x32, 0x04, 0x0A, 0x02, 0x08, 0x09, 0x22, 0x12, 0x0A, 0x0C, 0x6D, 0x65, 0x73, 0x73, 0x61, 0x67, 0x65, 0x5F, 0x73, 0x69, 0x7A, 0x65, 0x12, 0x02, 0x18, 0x04, 0x2A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x32, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x3A, 0x00, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 227) { memcpy(dst, src, 227); } else { abort(); }
|
||||
return 227;}
|
||||
@@ -0,0 +1,26 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step20_0(char *dst, int ndst) {const char src[741] = { 0x00, 0x0C, 0x08, 0xFE, 0x01, 0x18, 0x26, 0x20, 0x00, 0x28, 0xD7, 0x05, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xD7, 0x01, 0x0A, 0xC9, 0x05, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0xBF, 0x05, 0x32, 0xBC, 0x05, 0x08, 0xCF, 0xED, 0x81, 0xFB, 0x02, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0x9E, 0x05, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xAB, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0C, 0x0A, 0x04, 0x08, 0x4D, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xFB, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xA1, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xBB, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0x9C, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xBF, 0x01, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xDA, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xBF, 0x03, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0x96, 0x0D, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xF9, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xD8, 0x01, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xD9, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x12, 0x0D, 0x0A, 0x05, 0x08, 0xB4, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0xE8, 0x01, 0x08, 0x01, 0x10, 0xCF, 0xED, 0x81, 0xFB, 0x02, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x9E, 0x05, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xAB, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0C, 0x0A, 0x04, 0x08, 0x4D, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xFB, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xA1, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xBB, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x9C, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xBF, 0x01, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xDA, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xBF, 0x03, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x96, 0x0D, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xF9, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xD8, 0x01, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xD9, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xB4, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0xE8, 0x01, 0x08, 0x01, 0x10, 0x96, 0x97, 0x87, 0xFB, 0x02, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xEB, 0x07, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xDE, 0x04, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x97, 0x08, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0C, 0x0A, 0x04, 0x08, 0x43, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x97, 0x0D, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xD3, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x88, 0x05, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x9D, 0x03, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0x81, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xDA, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xF9, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xA4, 0x02, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xD8, 0x01, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xED, 0x06, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, 0x1A, 0x0D, 0x0A, 0x05, 0x08, 0xD9, 0x0A, 0x10, 0x00, 0x10, 0x00, 0x18, 0x02, 0x28, 0x00, };
|
||||
if(ndst >= 741) { memcpy(dst, src, 741); } else { abort(); }
|
||||
return 741;}
|
||||
@@ -0,0 +1,29 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step21_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x27, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00,};
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step21_1(char *dst, int ndst) {const char src[64] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x48, 0x20, 0x02, 0x28, 0x32, 0x30, 0x00, 0x12, 0x30, 0xAA, 0x06, 0x2D, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x11, 0x12, 0x07, 0x32, 0x05, 0x01, 0x0B, 0x00, 0x00, 0x00, };
|
||||
if(ndst >= 64) { memcpy(dst, src, 64); } else { abort(); }
|
||||
return 64;}
|
||||
@@ -0,0 +1,160 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step22_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x28, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step22_1(char *dst, int ndst) {const char src[59] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x49, 0x20, 0x02, 0x28, 0x2D, 0x30, 0x00, 0x12, 0x2B, 0xAA, 0x06, 0x28, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x0A, 0x10, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x01, 0x12, 0x02, 0x10, 0x00, };
|
||||
if(ndst >= 59) { memcpy(dst, src, 59); } else { abort(); }
|
||||
return 59;}
|
||||
int step22_2(char *dst, int ndst) {const char src[33] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x29, 0x20, 0x00, 0x28, 0x14, 0x30, 0x00, 0x09, 0x36, 0xE9, 0xE8, 0x48, 0xE2, 0x8B, 0xC2, 0xB9, 0x11, 0xF6, 0x42, 0x63, 0xF5, 0xD3, 0x34, 0x56, 0xC7, 0x18, 0x01, };
|
||||
if(ndst >= 33) { memcpy(dst, src, 33); } else { abort(); }
|
||||
return 33;}
|
||||
int step22_3(char *dst, int ndst) {const char src[272] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x4A, 0x20, 0x00, 0x28, 0x81, 0x02, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x08, 0x47, 0x51, 0x5F, 0x45, 0x4E, 0x54, 0x52, 0x59, 0x22, 0x1E, 0x0A, 0x0F, 0x67, 0x61, 0x6D, 0x65, 0x5F, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x5F, 0x69, 0x64, 0x12, 0x0B, 0x48, 0xB6, 0xD2, 0xA3, 0xC7, 0xA4, 0xFC, 0xA2, 0xE1, 0xB9, 0x01, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x69, 0x6E, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x61, 0x78, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x0E, 0x0A, 0x08, 0x61, 0x76, 0x67, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x19, 0x0A, 0x0C, 0x73, 0x74, 0x64, 0x5F, 0x64, 0x65, 0x76, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x09, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x22, 0x24, 0x0A, 0x0C, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x6F, 0x72, 0x5F, 0x69, 0x64, 0x12, 0x14, 0x52, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x22, 0x19, 0x0A, 0x0A, 0x66, 0x61, 0x63, 0x74, 0x6F, 0x72, 0x79, 0x5F, 0x69, 0x64, 0x12, 0x0B, 0x48, 0xF6, 0x85, 0x8D, 0xAB, 0xBF, 0x9A, 0x8D, 0xAB, 0xC7, 0x01, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 272) { memcpy(dst, src, 272); } else { abort(); }
|
||||
return 272;}
|
||||
int step22_4(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x2A, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step22_5(char *dst, int ndst) {const char src[64] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x4B, 0x20, 0x02, 0x28, 0x32, 0x30, 0x00, 0x12, 0x30, 0xAA, 0x06, 0x2D, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x11, 0x12, 0x07, 0x32, 0x05, 0x01, 0x0C, 0x00, 0x00, 0x00, };
|
||||
if(ndst >= 64) { memcpy(dst, src, 64); } else { abort(); }
|
||||
return 64;}
|
||||
int step22_6(char *dst, int ndst) {const char src[208] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x4C, 0x20, 0x00, 0x28, 0xC1, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x09, 0x47, 0x51, 0x5F, 0x55, 0x50, 0x44, 0x41, 0x54, 0x45, 0x22, 0x1E, 0x0A, 0x0F, 0x67, 0x61, 0x6D, 0x65, 0x5F, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x5F, 0x69, 0x64, 0x12, 0x0B, 0x48, 0xB6, 0xD2, 0xA3, 0xC7, 0xA4, 0xFC, 0xA2, 0xE1, 0xB9, 0x01, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x69, 0x6E, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4A, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x61, 0x78, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4A, 0x22, 0x0E, 0x0A, 0x08, 0x61, 0x76, 0x67, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x19, 0x0A, 0x0C, 0x73, 0x74, 0x64, 0x5F, 0x64, 0x65, 0x76, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x09, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 208) { memcpy(dst, src, 208); } else { abort(); }
|
||||
return 208;}
|
||||
int step22_7(char *dst, int ndst) {const char src[227] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x4D, 0x20, 0x00, 0x28, 0xD4, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x09, 0x47, 0x51, 0x5F, 0x55, 0x50, 0x44, 0x41, 0x54, 0x45, 0x22, 0x1E, 0x0A, 0x0F, 0x67, 0x61, 0x6D, 0x65, 0x5F, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x5F, 0x69, 0x64, 0x12, 0x0B, 0x48, 0xB6, 0xD2, 0xA3, 0xC7, 0xA4, 0xFC, 0xA2, 0xE1, 0xB9, 0x01, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x69, 0x6E, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x61, 0x78, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x0E, 0x0A, 0x08, 0x61, 0x76, 0x67, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x19, 0x0A, 0x0C, 0x73, 0x74, 0x64, 0x5F, 0x64, 0x65, 0x76, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x09, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x22, 0x11, 0x0A, 0x0B, 0x6D, 0x61, 0x74, 0x63, 0x68, 0x6D, 0x61, 0x6B, 0x69, 0x6E, 0x67, 0x12, 0x02, 0x10, 0x01, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 227) { memcpy(dst, src, 227); } else { abort(); }
|
||||
return 227;}
|
||||
int step22_8(char *dst, int ndst) {const char src[208] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x4E, 0x20, 0x00, 0x28, 0xC1, 0x01, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x09, 0x47, 0x51, 0x5F, 0x55, 0x50, 0x44, 0x41, 0x54, 0x45, 0x22, 0x1E, 0x0A, 0x0F, 0x67, 0x61, 0x6D, 0x65, 0x5F, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x5F, 0x69, 0x64, 0x12, 0x0B, 0x48, 0xB6, 0xD2, 0xA3, 0xC7, 0xA4, 0xFC, 0xA2, 0xE1, 0xB9, 0x01, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x69, 0x6E, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x45, 0x22, 0x0E, 0x0A, 0x08, 0x6D, 0x61, 0x78, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x45, 0x22, 0x0E, 0x0A, 0x08, 0x61, 0x76, 0x67, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x02, 0x48, 0x4E, 0x22, 0x19, 0x0A, 0x0C, 0x73, 0x74, 0x64, 0x5F, 0x64, 0x65, 0x76, 0x5F, 0x77, 0x61, 0x69, 0x74, 0x12, 0x09, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 208) { memcpy(dst, src, 208); } else { abort(); }
|
||||
return 208;}
|
||||
|
||||
static int write_byte(char **dst, const char *end, char src)
|
||||
{
|
||||
if(*dst + sizeof(src) > end) {
|
||||
abort();
|
||||
}
|
||||
|
||||
memcpy(*dst, &src, sizeof(src));
|
||||
(*dst)++;
|
||||
return 0;
|
||||
}
|
||||
|
||||
static void write_uint(char **dst, const char *end, int src)
|
||||
{
|
||||
char b;
|
||||
|
||||
while(1 == 1) {
|
||||
b = (char)(src & 127);
|
||||
src >>= 7;
|
||||
|
||||
if(src == 0) {
|
||||
break;
|
||||
}
|
||||
|
||||
b |= 128;
|
||||
|
||||
write_byte(dst, end, b);
|
||||
}
|
||||
|
||||
write_byte(dst, end, b);
|
||||
}
|
||||
|
||||
static char read_byte(char **dst, const char *end)
|
||||
{
|
||||
char out;
|
||||
|
||||
if(*dst + sizeof(char) > end) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
out = *((char *)(*dst));
|
||||
|
||||
(*dst)++;
|
||||
return out;
|
||||
}
|
||||
|
||||
static int read_uint(char **dst, const char *end)
|
||||
{
|
||||
int num = 0, num2;
|
||||
int i;
|
||||
|
||||
for(i = 0; (i < 5 && *dst < end); i++) {
|
||||
num2 = read_byte(dst, end);
|
||||
|
||||
if(i == 4 && (num2 & 240) != 0) {
|
||||
abort();
|
||||
}
|
||||
|
||||
if((num2 & 128) == 0) {
|
||||
return num | (unsigned int)((unsigned int)num2 << 7 * i);
|
||||
}
|
||||
|
||||
num |= (unsigned int)((unsigned int)(num2 & 127) << 7 * i);
|
||||
}
|
||||
|
||||
return num;
|
||||
}
|
||||
|
||||
int step22_9_1(char *dst, int ndst, int iplen) {
|
||||
const char src[205] = { 0x00, 0x0D, 0x08, 0x04, 0x10, 0x01, 0x18, 0x4F, 0x20, 0x00, 0x28, 0xEB, 0x02, 0x30, 0x00, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x1A, 0x08, 0x47, 0x5F, 0x52, 0x45, 0x53, 0x55, 0x4C, 0x54, 0x22, 0x1E, 0x0A, 0x0F, 0x67, 0x61, 0x6D, 0x65, 0x5F, 0x72, 0x65, 0x71, 0x75, 0x65, 0x73, 0x74, 0x5F, 0x69, 0x64, 0x12, 0x0B, 0x48, 0xB6, 0xD2, 0xA3, 0xC7, 0xA4, 0xFC, 0xA2, 0xE1, 0xB9, 0x01, 0x22, 0x0B, 0x0A, 0x05, 0x65, 0x72, 0x72, 0x6F, 0x72, 0x12, 0x02, 0x48, 0x00, 0x22, 0x2E, 0x0A, 0x0B, 0x67, 0x61, 0x6D, 0x65, 0x5F, 0x68, 0x61, 0x6E, 0x64, 0x6C, 0x65, 0x12, 0x1F, 0x3A, 0x1D, 0x09, 0xF6, 0x42, 0x63, 0xF5, 0xD3, 0x34, 0x56, 0xC7, 0x12, 0x12, 0x09, 0xEE, 0xA6, 0x0D, 0x57, 0x03, 0x00, 0x00, 0x06, 0x11, 0x8C, 0x27, 0x0B, 0x00, 0x0A, 0x62, 0xA3, 0xAB, 0x22, 0xB6, 0x01, 0x0A, 0x0F, 0x63, 0x6F, 0x6E, 0x6E, 0x65, 0x63, 0x74, 0x69, 0x6F, 0x6E, 0x5F, 0x69, 0x6E, 0x66, 0x6F, 0x12, 0xA2, 0x01, 0x3A, 0x9F, 0x01, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12 };
|
||||
|
||||
int pos[4] = {11, 159, 179, 182};
|
||||
char *ptr;
|
||||
int i;
|
||||
|
||||
for(i = 0; i < (sizeof(pos)/sizeof(int)); i++) {
|
||||
ptr = &src[pos[i]];
|
||||
int l = read_uint(&ptr, ptr + 4);
|
||||
l += (iplen - 14);
|
||||
ptr = &src[pos[i]];
|
||||
write_uint(&ptr, ptr + 4, l);
|
||||
}
|
||||
|
||||
if(ndst >= 205) { memcpy(dst, src, 205); } else { abort(); }
|
||||
return 205;
|
||||
}
|
||||
|
||||
int step22_9_2(char *dst, int ndst, int port) {
|
||||
const char src[185] = { 0x18, 0x8C, 0x1D, 0x22, 0x06, 0x45, 0x6A, 0x63, 0x44, 0x65, 0x49, 0x2A, 0x13, 0x0A, 0x07, 0x76, 0x65, 0x72, 0x73, 0x69, 0x6F, 0x6E, 0x12, 0x08, 0x2A, 0x06, 0x32, 0x30, 0x38, 0x38, 0x39, 0x31, 0x2A, 0x0D, 0x0A, 0x04, 0x67, 0x61, 0x6D, 0x65, 0x12, 0x05, 0x18, 0xAA, 0x80, 0xC4, 0x06, 0x2A, 0x0C, 0x0A, 0x06, 0x70, 0x6C, 0x61, 0x79, 0x65, 0x72, 0x12, 0x02, 0x18, 0x01, 0x2A, 0x0B, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x05, 0x18, 0xB2, 0xB0, 0xAA, 0x1C, 0x2A, 0x0F, 0x0A, 0x09, 0x72, 0x65, 0x73, 0x75, 0x6D, 0x61, 0x62, 0x6C, 0x65, 0x12, 0x02, 0x10, 0x01, 0x2A, 0x1E, 0x0A, 0x12, 0x73, 0x70, 0x65, 0x63, 0x74, 0x61, 0x74, 0x6F, 0x72, 0x5F, 0x70, 0x61, 0x73, 0x73, 0x77, 0x6F, 0x72, 0x64, 0x12, 0x08, 0x2A, 0x06, 0x6F, 0x44, 0x69, 0x70, 0x49, 0x66, 0x4A, 0x0A, 0x08, 0x95, 0xA5, 0x67, 0x10, 0xE9, 0xE6, 0xAC, 0xB9, 0x05, 0x52, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
char *ptr = (char *)&src[1];
|
||||
write_uint(&ptr, ptr + 2, port);
|
||||
|
||||
if(ndst >= 158) {
|
||||
memcpy(dst, src, 158);
|
||||
} else {
|
||||
abort();
|
||||
}
|
||||
|
||||
return 158;
|
||||
}
|
||||
|
||||
int step22_9_ip(char *dst, int ndst, const char *ip, const int iplen)
|
||||
{
|
||||
int i;
|
||||
dst[0] = iplen;
|
||||
for(i = 0; i < iplen; i++) {
|
||||
dst[i + 1] = ip[i];
|
||||
}
|
||||
return iplen + 1;
|
||||
}
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step23_0(char *dst, int ndst) {const char src[18] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x2B, 0x20, 0x00, 0x28, 0x05, 0x30, 0x00, 0x08, 0xCB, 0xA6, 0xBE, 0x0D, };
|
||||
if(ndst >= 18) { memcpy(dst, src, 18); } else { abort(); }
|
||||
return 18;}
|
||||
int step23_1(char *dst, int ndst) {const char src[311] = { 0x00, 0x0D, 0x08, 0x05, 0x10, 0x01, 0x18, 0x50, 0x20, 0x03, 0x28, 0xA8, 0x02, 0x30, 0x00, 0x0A, 0x68, 0x0A, 0x14, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x50, 0x12, 0x02, 0x65, 0x01, 0x18, 0xAA, 0x97, 0x60, 0x22, 0x46, 0x08, 0x00, 0x15, 0x4B, 0x53, 0x00, 0x00, 0x1A, 0x0F, 0x51, 0x75, 0x69, 0x72, 0x6B, 0x79, 0x4F, 0x72, 0x63, 0x23, 0x32, 0x39, 0x36, 0x38, 0x38, 0x20, 0x00, 0x2A, 0x28, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x30, 0x00, 0x12, 0x68, 0x0A, 0x14, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x50, 0x12, 0x02, 0x65, 0x01, 0x18, 0xAA, 0x97, 0x60, 0x22, 0x46, 0x08, 0x00, 0x15, 0x4B, 0x53, 0x00, 0x00, 0x1A, 0x0F, 0x51, 0x75, 0x69, 0x72, 0x6B, 0x79, 0x4F, 0x72, 0x63, 0x23, 0x32, 0x39, 0x36, 0x38, 0x38, 0x20, 0x00, 0x2A, 0x28, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0x93, 0x71, 0x0E, 0x1A, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x30, 0x00, 0x1A, 0x24, 0x08, 0x02, 0x10, 0x00, 0x38, 0x04, 0x52, 0x07, 0x64, 0x65, 0x66, 0x61, 0x75, 0x6C, 0x74, 0x5D, 0x47, 0x43, 0x54, 0x57, 0x68, 0x01, 0x70, 0x00, 0xC2, 0x06, 0x09, 0x11, 0xF6, 0x42, 0x63, 0xF5, 0xD3, 0x34, 0x56, 0xC7, 0x22, 0x15, 0x08, 0x03, 0x12, 0x0C, 0x08, 0x8A, 0xC4, 0x8D, 0xDD, 0x0A, 0x10, 0xEE, 0xCD, 0xB6, 0xB8, 0x05, 0x1D, 0x8C, 0x27, 0x0B, 0x00, 0x2A, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 311) { memcpy(dst, src, 311); } else { abort(); }
|
||||
return 311;}
|
||||
int step23_2(char *dst, int ndst) {const char src[165] = { 0x00, 0x0D, 0x08, 0x05, 0x10, 0x02, 0x18, 0x51, 0x20, 0x03, 0x28, 0x96, 0x01, 0x30, 0x00, 0x0A, 0x66, 0x0A, 0x14, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0xA5, 0x14, 0xB6, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x4E, 0x12, 0x02, 0x64, 0x02, 0x18, 0x80, 0x97, 0x80, 0x03, 0x22, 0x43, 0x08, 0x00, 0x15, 0x5A, 0x43, 0x00, 0x00, 0x1A, 0x0C, 0x49, 0x6C, 0x66, 0x69, 0x72, 0x69, 0x6E, 0x23, 0x32, 0x38, 0x31, 0x32, 0x20, 0x00, 0x2A, 0x28, 0x0A, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0xB1, 0x27, 0xB0, 0x19, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0xA5, 0x14, 0xB6, 0x04, 0x00, 0x00, 0x00, 0x00, 0x30, 0x00, 0x12, 0x15, 0x08, 0x03, 0x12, 0x0C, 0x08, 0x8A, 0xC4, 0x8D, 0xDD, 0x0A, 0x10, 0xEE, 0xCD, 0xB6, 0xB8, 0x05, 0x1D, 0x8C, 0x27, 0x0B, 0x00, 0x1A, 0x15, 0x0A, 0x05, 0x0D, 0x93, 0x71, 0x0E, 0x1A, 0x12, 0x0C, 0x0D, 0x67, 0x39, 0xAB, 0x04, 0x15, 0x47, 0x43, 0x54, 0x57, 0x18, 0x02, };
|
||||
if(ndst >= 165) { memcpy(dst, src, 165); } else { abort(); }
|
||||
return 165;}
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step24_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x2D, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step24_1(char *dst, int ndst) {const char src[332] = { 0x00, 0x0D, 0x08, 0x05, 0x10, 0x01, 0x18, 0x52, 0x20, 0x04, 0x28, 0xBD, 0x02, 0x30, 0x00, 0x1A, 0xBA, 0x02, 0xAA, 0x06, 0xB6, 0x02, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0xA5, 0x14, 0xB6, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x24, 0x0A, 0x22, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x07, 0x20, 0x00, 0x12, 0x14, 0x52, 0x12, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x11, 0xB1, 0x27, 0xB0, 0x19, 0x00, 0x00, 0x00, 0x00, 0x12, 0x12, 0x0A, 0x10, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x01, 0x20, 0x00, 0x12, 0x02, 0x10, 0x01, 0x12, 0x16, 0x0A, 0x14, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x03, 0x20, 0x00, 0x12, 0x06, 0x42, 0x04, 0x57, 0x54, 0x43, 0x47, 0x12, 0x1A, 0x0A, 0x18, 0x0A, 0x0C, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x12, 0x20, 0x00, 0x12, 0x08, 0x32, 0x06, 0x19, 0x00, 0x00, 0x19, 0x00, 0x00, 0x12, 0x19, 0x0A, 0x17, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x04, 0x20, 0x00, 0x12, 0x09, 0x18, 0xC2, 0x8D, 0xD9, 0xAD, 0xED, 0xC2, 0xCC, 0x02, 0x12, 0x1E, 0x0A, 0x1C, 0x0A, 0x0A, 0x08, 0xCE, 0x84, 0x01, 0x10, 0x02, 0x18, 0x05, 0x20, 0x00, 0x12, 0x0E, 0x2A, 0x0C, 0x49, 0x6C, 0x66, 0x69, 0x72, 0x69, 0x6E, 0x23, 0x32, 0x38, 0x31, 0x32, 0x12, 0x19, 0x0A, 0x17, 0x0A, 0x0C, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x11, 0x20, 0x00, 0x12, 0x07, 0x32, 0x05, 0x01, 0x0C, 0x00, 0x00, 0x00, 0x12, 0x28, 0x0A, 0x26, 0x0A, 0x0C, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x14, 0x20, 0x00, 0x12, 0x16, 0x2A, 0x14, 0x65, 0x75, 0x2E, 0x61, 0x63, 0x74, 0x75, 0x61, 0x6C, 0x2E, 0x62, 0x61, 0x74, 0x74, 0x6C, 0x65, 0x2E, 0x6E, 0x65, 0x74, 0x12, 0x14, 0x0A, 0x12, 0x0A, 0x0C, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x01, 0x20, 0x00, 0x12, 0x02, 0x10, 0x00, 0x12, 0x1C, 0x0A, 0x1A, 0x0A, 0x0C, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x13, 0x20, 0x00, 0x12, 0x0A, 0x2A, 0x08, 0x38, 0x33, 0x38, 0x38, 0x36, 0x30, 0x38, 0x30, };
|
||||
if(ndst >= 332) { memcpy(dst, src, 332); } else { abort(); }
|
||||
return 332;}
|
||||
int step24_2(char *dst, int ndst) {const char src[37] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x2C, 0x20, 0x00, 0x28, 0x18, 0x30, 0x00, 0x0A, 0x09, 0x0A, 0x02, 0x69, 0x64, 0x12, 0x03, 0x18, 0xFE, 0x01, 0x0A, 0x0B, 0x0A, 0x05, 0x70, 0x72, 0x6F, 0x74, 0x6F, 0x12, 0x02, 0x32, 0x00, };
|
||||
if(ndst >= 37) { memcpy(dst, src, 37); } else { abort(); }
|
||||
return 37;}
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
hm_lobbyserver - HearthStone HearthMod lobbyserver
|
||||
Copyright (C) 2016 Filip Pancik
|
||||
|
||||
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/>.
|
||||
*/
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <memory.h>
|
||||
#include <malloc.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
int step25_0(char *dst, int ndst) {const char src[13] = { 0x00, 0x0B, 0x08, 0xFE, 0x01, 0x18, 0x2E, 0x20, 0x00, 0x28, 0x00, 0x30, 0x00, };
|
||||
if(ndst >= 13) { memcpy(dst, src, 13); } else { abort(); }
|
||||
return 13;}
|
||||
int step25_1(char *dst, int ndst) {const char src[101] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x53, 0x20, 0x02, 0x28, 0x57, 0x30, 0x00, 0x12, 0x55, 0xAA, 0x06, 0x52, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0x67, 0x39, 0xAB, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x3C, 0x0A, 0x3A, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x15, 0x12, 0x2C, 0x32, 0x2A, 0x0A, 0x0E, 0x31, 0x39, 0x32, 0x2E, 0x31, 0x36, 0x38, 0x2E, 0x31, 0x31, 0x2E, 0x31, 0x32, 0x34, 0x10, 0x8C, 0x1D, 0x18, 0xAA, 0x80, 0xC4, 0x06, 0x22, 0x06, 0x6F, 0x44, 0x69, 0x70, 0x49, 0x66, 0x28, 0x01, 0x30, 0x00, 0x38, 0x0A, 0x40, 0x08, 0x48, 0x02, };
|
||||
if(ndst >= 101) { memcpy(dst, src, 101); } else { abort(); }
|
||||
return 101;}
|
||||
int step25_2(char *dst, int ndst) {const char src[64] = { 0x00, 0x0C, 0x08, 0x05, 0x10, 0x06, 0x18, 0x54, 0x20, 0x04, 0x28, 0x32, 0x30, 0x00, 0x12, 0x30, 0xAA, 0x06, 0x2D, 0x0A, 0x12, 0x09, 0x47, 0x43, 0x54, 0x57, 0x02, 0x00, 0x00, 0x02, 0x11, 0xA5, 0x14, 0xB6, 0x04, 0x00, 0x00, 0x00, 0x00, 0x12, 0x17, 0x0A, 0x15, 0x0A, 0x0A, 0x08, 0xC7, 0x86, 0xD1, 0xBA, 0x05, 0x10, 0x02, 0x18, 0x11, 0x12, 0x07, 0x32, 0x05, 0x01, 0x0D, 0x00, 0x00, 0x00, };
|
||||
if(ndst >= 64) { memcpy(dst, src, 64); } else { abort(); }
|
||||
return 64;}
|
||||
Reference in New Issue
Block a user