diff --git a/libdap-stream-ch-chain b/libdap-stream-ch-chain
deleted file mode 160000
index 1ffe062f0ae6ba10fe330b025a0a2b899cd03017..0000000000000000000000000000000000000000
--- a/libdap-stream-ch-chain
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 1ffe062f0ae6ba10fe330b025a0a2b899cd03017
diff --git a/libdap-stream-ch-chain/.gitignore b/libdap-stream-ch-chain/.gitignore
new file mode 100755
index 0000000000000000000000000000000000000000..c6127b38c1aa25968a88db3940604d41529e4cf5
--- /dev/null
+++ b/libdap-stream-ch-chain/.gitignore
@@ -0,0 +1,52 @@
+# Prerequisites
+*.d
+
+# Object files
+*.o
+*.ko
+*.obj
+*.elf
+
+# Linker output
+*.ilk
+*.map
+*.exp
+
+# Precompiled Headers
+*.gch
+*.pch
+
+# Libraries
+*.lib
+*.a
+*.la
+*.lo
+
+# Shared objects (inc. Windows DLLs)
+*.dll
+*.so
+*.so.*
+*.dylib
+
+# Executables
+*.exe
+*.out
+*.app
+*.i*86
+*.x86_64
+*.hex
+
+# Debug files
+*.dSYM/
+*.su
+*.idb
+*.pdb
+
+# Kernel Module Compile Results
+*.mod*
+*.cmd
+.tmp_versions/
+modules.order
+Module.symvers
+Mkfile.old
+dkms.conf
diff --git a/libdap-stream-ch-chain/CMakeLists.txt b/libdap-stream-ch-chain/CMakeLists.txt
new file mode 100755
index 0000000000000000000000000000000000000000..ff5c4b191a2e6dcdc58c89a0a3c720a3aa2b9a79
--- /dev/null
+++ b/libdap-stream-ch-chain/CMakeLists.txt
@@ -0,0 +1,16 @@
+cmake_minimum_required(VERSION 3.0)
+project (dap_stream_ch_chain)
+
+set(DAP_STREAM_CH_CHAIN_SRCS dap_stream_ch_chain.c dap_stream_ch_chain_pkt.c)
+
+if(WIN32)
+ include_directories(../3rdparty/wepoll/)
+ include_directories(../3rdparty/uthash/src/)
+endif()
+
+add_library(${PROJECT_NAME} STATIC ${DAP_STREAM_CH_CHAIN_SRCS})
+
+target_link_libraries(dap_stream_ch_chain dap_core dap_crypto dap_chain dap_stream dap_stream_ch)
+
+target_include_directories(dap_stream_ch_chain INTERFACE .)
+
diff --git a/libdap-stream-ch-chain/LICENSE b/libdap-stream-ch-chain/LICENSE
new file mode 100755
index 0000000000000000000000000000000000000000..94a9ed024d3859793618152ea559a168bbcbb5e2
--- /dev/null
+++ b/libdap-stream-ch-chain/LICENSE
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) <year> <name of author>
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ <program> Copyright (C) <year> <name of author>
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/libdap-stream-ch-chain/README.md b/libdap-stream-ch-chain/README.md
new file mode 100755
index 0000000000000000000000000000000000000000..b2a775c28a4b4caa68b4b99bb12e7cd958323007
--- /dev/null
+++ b/libdap-stream-ch-chain/README.md
@@ -0,0 +1,2 @@
+# libdap-stream-ch-chain
+Chains datums and blocks exchamge, service propagation and etc
diff --git a/libdap-stream-ch-chain/dap_stream_ch_chain.c b/libdap-stream-ch-chain/dap_stream_ch_chain.c
new file mode 100644
index 0000000000000000000000000000000000000000..3e789732cd26aab1bb4d610c91c2898e825fd4e1
--- /dev/null
+++ b/libdap-stream-ch-chain/dap_stream_ch_chain.c
@@ -0,0 +1,767 @@
+/*
+ * Authors:
+ * Dmitriy A. Gearasimov <gerasimov.dmitriy@demlabs.net>
+ * Alexander Lysikov <alexander.lysikov@demlabs.net>
+ * DeM Labs Inc. https://demlabs.net
+ * Kelvin Project https://github.com/kelvinblockchain
+ * Copyright (c) 2017-2018
+ * All rights reserved.
+
+ This file is part of DAP (Deus Applications Prototypes) the open source project
+
+ DAP (Deus Applicaions Prototypes) 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.
+
+ DAP 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 any DAP based project. If not, see <http://www.gnu.org/licenses/>.
+ */
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+#include <stdlib.h>
+#include <stddef.h>
+#include <stdint.h>
+
+#ifdef WIN32
+#include <winsock2.h>
+#include <windows.h>
+#include <mswsock.h>
+#include <ws2tcpip.h>
+#include <io.h>
+#include <pthread.h>
+#endif
+
+#include "dap_common.h"
+#include "dap_strfuncs.h"
+#include "dap_list.h"
+#include "dap_config.h"
+#include "dap_hash.h"
+#include "utlist.h"
+
+#include "dap_chain.h"
+#include "dap_chain_datum.h"
+#include "dap_chain_cs.h"
+#include "dap_chain_cell.h"
+
+#include "dap_chain_global_db.h"
+#include "dap_chain_global_db_remote.h"
+
+#include "dap_stream.h"
+#include "dap_stream_ch_pkt.h"
+#include "dap_stream_ch.h"
+#include "dap_stream_ch_proc.h"
+#include "dap_stream_ch_chain.h"
+#include "dap_stream_ch_chain_pkt.h"
+#include "dap_chain_net.h"
+#define LOG_TAG "dap_stream_ch_chain"
+
+static void s_stream_ch_new(dap_stream_ch_t* a_ch, void* a_arg);
+static void s_stream_ch_delete(dap_stream_ch_t* a_ch, void* a_arg);
+static void s_stream_ch_packet_in(dap_stream_ch_t* a_ch, void* a_arg);
+static void s_stream_ch_packet_out(dap_stream_ch_t* a_ch, void* a_arg);
+
+/**
+ * @brief dap_stream_ch_chain_init
+ * @return
+ */
+int dap_stream_ch_chain_init()
+{
+ log_it(L_NOTICE, "Chains and global db exchange channel initialized");
+ dap_stream_ch_proc_add(dap_stream_ch_chain_get_id(), s_stream_ch_new, s_stream_ch_delete, s_stream_ch_packet_in,
+ s_stream_ch_packet_out);
+
+ return 0;
+}
+
+/**
+ * @brief dap_stream_ch_chain_deinit
+ */
+void dap_stream_ch_chain_deinit()
+{
+
+}
+
+/**
+ * @brief s_stream_ch_new
+ * @param a_ch
+ * @param arg
+ */
+void s_stream_ch_new(dap_stream_ch_t* a_ch, void* a_arg)
+{
+ a_ch->internal = DAP_NEW_Z(dap_stream_ch_chain_t);
+ dap_stream_ch_chain_t * l_ch_chain = DAP_STREAM_CH_CHAIN(a_ch);
+ pthread_mutex_init(&l_ch_chain->mutex, NULL);
+ l_ch_chain->ch = a_ch;
+}
+
+/**
+ * @brief s_stream_ch_delete
+ * @param ch
+ * @param arg
+ */
+void s_stream_ch_delete(dap_stream_ch_t* a_ch, void* a_arg)
+{
+ (void) a_arg;
+
+ if(DAP_STREAM_CH_CHAIN(a_ch)->request_global_db_trs) {
+ dap_db_log_list_delete(DAP_STREAM_CH_CHAIN(a_ch)->request_global_db_trs); //dap_list_free_full(DAP_STREAM_CH_CHAIN(a_ch)->request_global_db_trs, (dap_callback_destroyed_t) free);
+ DAP_STREAM_CH_CHAIN(a_ch)->request_global_db_trs = NULL;
+ }
+ pthread_mutex_destroy(&DAP_STREAM_CH_CHAIN(a_ch)->mutex);
+}
+
+/**
+ * @brief s_stream_ch_packet_in
+ * @param a_ch
+ * @param a_arg
+ */
+void s_stream_ch_packet_in(dap_stream_ch_t* a_ch, void* a_arg)
+{
+ //static char *s_net_name = NULL;
+ dap_stream_ch_chain_t * l_ch_chain = DAP_STREAM_CH_CHAIN(a_ch);
+ if(l_ch_chain) {
+ dap_stream_ch_pkt_t * l_ch_pkt = (dap_stream_ch_pkt_t *) a_arg;
+ dap_stream_ch_chain_pkt_t * l_chain_pkt = (dap_stream_ch_chain_pkt_t *) l_ch_pkt->data;
+ size_t l_chain_pkt_data_size = l_ch_pkt->hdr.size - sizeof(l_chain_pkt->hdr);
+ if(l_chain_pkt) {
+ switch (l_ch_pkt->hdr.type) {
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_ALL: {
+ log_it(L_INFO, "In: SYNCED_ALL pkt");
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB: {
+ log_it(L_INFO, "In: SYNCED_GLOBAL_DB pkt");
+ /*if(s_net_name) {
+ DAP_DELETE(s_net_name);
+ s_net_name = NULL; //"kelvin-testnet"
+ }*/
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB_GROUP: {
+ log_it(L_INFO, "In: SYNCED_GLOBAL_DB_GROUP pkt");
+ /*if(s_net_name) {
+ DAP_DELETE(s_net_name);
+ s_net_name = NULL; //"kelvin-testnet"
+ }*/
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_GLOBAL_DB_GROUP: {
+ log_it(L_INFO, "In: SYNCED_GLOBAL_DB_GROUP pkt");
+ }
+ break;
+
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS: {
+ log_it(L_INFO, "In: SYNCED_CHAINS pkt");
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_CHAINS: {
+ //log_it(L_INFO, "In: SYNC_CHAINS pkt");
+ dap_chain_t * l_chain = dap_chain_find_by_id(l_chain_pkt->hdr.net_id, l_chain_pkt->hdr.chain_id);
+ if(l_chain) {
+ if(l_ch_chain->state != CHAIN_STATE_IDLE) {
+ log_it(L_INFO, "Can't process SYNC_CHAINS request because not in idle state");
+ dap_stream_ch_chain_pkt_write_error(a_ch, l_chain_pkt->hdr.net_id,
+ l_chain_pkt->hdr.chain_id, l_chain_pkt->hdr.cell_id,
+ "ERROR_STATE_NOT_IN_IDLE");
+ } else {
+ // fill ids
+ if(l_chain_pkt_data_size == sizeof(dap_stream_ch_chain_sync_request_t)) {
+ dap_stream_ch_chain_sync_request_t * l_request =
+ (dap_stream_ch_chain_sync_request_t *) l_chain_pkt->data;
+ memcpy(&l_ch_chain->request, l_request, l_chain_pkt_data_size);
+ memcpy(&l_ch_chain->request_cell_id, &l_chain_pkt->hdr.cell_id,
+ sizeof(dap_chain_cell_id_t));
+ memcpy(&l_ch_chain->request_net_id, &l_chain_pkt->hdr.net_id, sizeof(dap_chain_net_id_t));
+ memcpy(&l_ch_chain->request_chain_id, &l_chain_pkt->hdr.chain_id, sizeof(dap_chain_id_t));
+ }
+
+ dap_chain_atom_ptr_t * l_lasts = NULL;
+ size_t l_lasts_size = 0;
+ dap_chain_atom_iter_t* l_iter = l_chain->callback_atom_iter_create(l_chain);
+ l_ch_chain->request_atom_iter = l_iter;
+ l_lasts = l_chain->callback_atom_iter_get_lasts(l_iter, &l_lasts_size);
+ if(l_lasts) {
+ for(size_t i = 0; i < l_lasts_size; i++) {
+ dap_chain_atom_item_t * l_item = NULL;
+ dap_chain_hash_fast_t l_atom_hash;
+ dap_hash_fast(l_lasts[i], l_chain->callback_atom_get_size(l_lasts[i]),
+ &l_atom_hash);
+ HASH_FIND(hh, l_ch_chain->request_atoms_lasts, &l_atom_hash, sizeof(l_atom_hash),
+ l_item);
+ if(l_item == NULL) { // Not found, add new lasts
+ l_item = DAP_NEW_Z(dap_chain_atom_item_t);
+ l_item->atom = l_lasts[i];
+ memcpy(&l_item->atom_hash, &l_atom_hash, sizeof(l_atom_hash));
+ HASH_ADD(hh, l_ch_chain->request_atoms_lasts, atom_hash, sizeof(l_atom_hash),
+ l_item);
+ }
+ //else
+ // DAP_DELETE(l_lasts[i]);
+ }
+ // first packet
+ l_ch_chain->state = CHAIN_STATE_SYNC_CHAINS;
+ dap_chain_node_addr_t l_node_addr = { 0 };
+ dap_chain_net_t *l_net = dap_chain_net_by_id(l_ch_chain->request_net_id);
+ l_node_addr.uint64 = l_net ? dap_db_get_cur_node_addr(l_net->pub.name) : 0;
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_CHAIN,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_node_addr, sizeof(dap_chain_node_addr_t));
+ }
+ else {
+ // last packet
+ dap_stream_ch_chain_sync_request_t l_request = { { 0 } };
+ l_request.id_start = 0;//dap_db_log_get_last_id_remote(l_ch_chain->request.node_addr.uint64);
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_request, sizeof(l_request));
+ l_ch_chain->state = CHAIN_STATE_IDLE;
+ }
+
+ DAP_DELETE(l_lasts);
+ DAP_DELETE(l_iter);
+ }
+ dap_stream_ch_set_ready_to_write(a_ch, true);
+ }
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_GLOBAL_DB: {
+ log_it(L_INFO, "In: SYNC_GLOBAL_DB pkt");
+ if(l_ch_chain->state != CHAIN_STATE_IDLE) {
+ log_it(L_INFO, "Can't process SYNC_GLOBAL_DB request because not in idle state");
+ dap_stream_ch_chain_pkt_write_error(a_ch, l_chain_pkt->hdr.net_id,
+ l_chain_pkt->hdr.chain_id, l_chain_pkt->hdr.cell_id,
+ "ERROR_STATE_NOT_IN_IDLE");
+ dap_stream_ch_set_ready_to_write(a_ch, true);
+ break;
+ }
+ // receive the latest global_db revision of the remote node -> go to send mode
+ if(l_chain_pkt_data_size == sizeof(dap_stream_ch_chain_sync_request_t)) {
+ dap_stream_ch_chain_sync_request_t * l_request =
+ (dap_stream_ch_chain_sync_request_t *) l_chain_pkt->data;
+ memcpy(&l_ch_chain->request, l_request, l_chain_pkt_data_size);
+ memcpy(&l_ch_chain->request_cell_id, &l_chain_pkt->hdr.cell_id, sizeof(dap_chain_cell_id_t));
+ memcpy(&l_ch_chain->request_net_id, &l_chain_pkt->hdr.net_id, sizeof(dap_chain_net_id_t));
+ memcpy(&l_ch_chain->request_chain_id, &l_chain_pkt->hdr.chain_id, sizeof(dap_chain_id_t));
+
+ // Get log diff
+ l_ch_chain->request_last_ts = dap_db_log_get_last_id();
+ //log_it(L_DEBUG, "Requested transactions %llu:%llu", l_request->id_start,
+ // (uint64_t ) l_ch_chain->request_last_ts);
+ //dap_list_t *l_list = dap_db_log_get_list(l_request->id_start + 1);
+ uint64_t l_start_item = l_request->id_start;
+ // If the current global_db has been truncated, but the remote node has not known this
+ if(l_request->id_start > l_ch_chain->request_last_ts) {
+ l_start_item = 0;
+ }
+ dap_chain_net_t *l_net = dap_chain_net_by_id(l_chain_pkt->hdr.net_id);
+ dap_list_t *l_add_groups = dap_chain_net_get_add_gdb_group(l_net, l_request->node_addr);
+ dap_db_log_list_t *l_db_log = dap_db_log_list_start(l_start_item + 1, l_add_groups);
+ if(l_db_log) {
+ //log_it(L_DEBUG, "Start getting items %u:%u", l_request->id_start + 1,l_db_log->items_number);//dap_list_length(l_list));
+ // Add it to outgoing list
+ l_ch_chain->request_global_db_trs = l_db_log;//l_list;
+ //dap_list_t *l_last = dap_list_last(l_list);
+ //if(l_last)
+ // l_last->next = l_ch_chain->request_global_db_trs;
+ //l_ch_chain->request_global_db_trs = l_list;
+ l_ch_chain->state = CHAIN_STATE_SYNC_GLOBAL_DB;
+
+ dap_chain_node_addr_t l_node_addr = { 0 };
+ dap_chain_net_t *l_net = dap_chain_net_by_id(l_ch_chain->request_net_id);
+ l_node_addr.uint64 = l_net ? dap_db_get_cur_node_addr(l_net->pub.name) : 0;
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_GLOBAL_DB,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_node_addr, sizeof(dap_chain_node_addr_t));
+
+ } else {
+ dap_chain_node_addr_t l_node_addr = { 0 };
+ dap_chain_net_t *l_net = dap_chain_net_by_id(l_ch_chain->request_net_id);
+ l_node_addr.uint64 = l_net ? dap_db_get_cur_node_addr(l_net->pub.name) : 0;
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_GLOBAL_DB,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_node_addr, sizeof(dap_chain_node_addr_t));
+
+ dap_stream_ch_chain_sync_request_t l_request = { { 0 } };
+ //log_it(L_DEBUG, "No items to sync from %u", l_request->id_start + 1);
+ l_request.node_addr.uint64 = l_net ? dap_db_get_cur_node_addr(l_net->pub.name) : 0;
+ l_request.id_start = dap_db_log_get_last_id_remote(l_ch_chain->request.node_addr.uint64);
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_request, sizeof(l_request));
+// dap_stream_ch_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB ,&l_request,
+// sizeof (l_request));
+ l_ch_chain->state = CHAIN_STATE_IDLE;
+ if(l_ch_chain->callback_notify_packet_out)
+ l_ch_chain->callback_notify_packet_out(l_ch_chain,
+ DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB,
+ NULL, 0, l_ch_chain->callback_notify_arg);
+ }
+ //log_it(L_INFO, "Prepared %u items for sync", l_db_log->items_number - l_request->id_start);//dap_list_length(l_ch_chain->request_global_db_trs));
+ // go to send data from list [in s_stream_ch_packet_out()]
+ // no data to send -> send one empty message DAP_STREAM_CH_CHAIN_PKT_TYPE_GLOBAL_DB_SYNCED
+ dap_stream_ch_set_ready_to_write(a_ch, true);
+ }
+ else {
+ log_it(L_ERROR, "Get DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_GLOBAL_DB session_id=%u bad request",
+ a_ch->stream->session->id);
+ dap_stream_ch_chain_pkt_write_error(a_ch, l_chain_pkt->hdr.net_id,
+ l_chain_pkt->hdr.chain_id, l_chain_pkt->hdr.cell_id,
+ "ERROR_SYNC_GLOBAL_DB_REQUEST_BAD");
+ dap_stream_ch_set_ready_to_write(a_ch, true);
+ }
+ }
+ break;
+ // first packet of data with source node address
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_CHAIN: {
+ log_it(L_INFO, "In: FIRST_CHAIN data_size=%d", l_chain_pkt_data_size);
+ if(l_chain_pkt_data_size == sizeof(dap_chain_node_addr_t))
+ memcpy(&l_ch_chain->request.node_addr, l_chain_pkt->data, l_chain_pkt_data_size);
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_CHAIN: {
+ //log_it(L_INFO, "In: CHAIN pkt");
+ dap_chain_t * l_chain = dap_chain_find_by_id(l_chain_pkt->hdr.net_id, l_chain_pkt->hdr.chain_id);
+ if(l_chain) {
+ // Expect atom element in
+ if(l_chain_pkt_data_size > 0) {
+ if(l_chain->callback_atom_add(l_chain, l_chain_pkt->data) == 0 &&
+ dap_chain_has_file_store(l_chain)) {
+ // append to file
+ dap_chain_cell_id_t l_cell_id;
+ l_cell_id.uint64 = l_chain_pkt->hdr.cell_id.uint64;
+ dap_chain_cell_t *l_cell = dap_chain_cell_create_fill(l_chain, l_cell_id);
+ // add one atom only
+ int l_res = dap_chain_cell_file_append(l_cell, l_chain_pkt->data, l_chain_pkt_data_size);
+ // rewrite all file
+ //l_res = dap_chain_cell_file_update(l_cell);
+ if(!l_cell || l_res < 0) {
+ log_it(L_ERROR, "Can't save event 0x%x to the file '%s'", l_chain_pkt->data,
+ l_cell ? l_cell->file_storage_path : "[null]");
+ }
+ // delete cell and close file
+ dap_chain_cell_delete(l_cell);
+ }
+ } else {
+ log_it(L_WARNING, "Empty chain packet");
+ dap_stream_ch_chain_pkt_write_error(a_ch, l_chain_pkt->hdr.net_id,
+ l_chain_pkt->hdr.chain_id, l_chain_pkt->hdr.cell_id,
+ "ERROR_CHAIN_PACKET_EMPTY");
+ dap_stream_ch_set_ready_to_write(a_ch, true);
+ }
+ }
+ }
+ break;
+ // first packet of data with source node address
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_GLOBAL_DB: {
+ log_it(L_INFO, "In: FIRST_GLOBAL_DB data_size=%d", l_chain_pkt_data_size);
+ if(l_chain_pkt_data_size == sizeof(dap_chain_node_addr_t))
+ memcpy(&l_ch_chain->request.node_addr, l_chain_pkt->data, l_chain_pkt_data_size);
+ //memcpy(&l_ch_chain->request_cell_id, &l_chain_pkt->hdr.cell_id, sizeof(dap_chain_cell_id_t));
+ //memcpy(&l_ch_chain->request_net_id, &l_chain_pkt->hdr.net_id, sizeof(dap_chain_net_id_t));
+ //memcpy(&l_ch_chain->request_chain_id, &l_chain_pkt->hdr.chain_id, sizeof(dap_chain_id_t));
+ }
+ break;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_GLOBAL_DB: {
+ //log_it(L_INFO, "In: GLOBAL_DB data_size=%d", l_chain_pkt_data_size);
+ // get transaction and save it to global_db
+ if(l_chain_pkt_data_size > 0) {
+
+ //session_data_t *l_data = session_data_find(a_ch->stream->session->id);
+ size_t l_data_obj_count = 0;
+
+ // deserialize data
+ dap_store_obj_t *l_store_obj = dap_db_log_unpack((uint8_t*) l_chain_pkt->data,
+ l_chain_pkt_data_size, &l_data_obj_count); // Parse data from dap_db_log_pack()
+ //dap_store_obj_t * l_store_obj_reversed = NULL;
+ //if ( dap_log_level_get()== L_DEBUG )
+ //if ( l_data_obj_count && l_store_obj )
+ // l_store_obj_reversed = DAP_NEW_Z_SIZE(dap_store_obj_t,l_data_obj_count+1);
+
+
+// log_it(L_INFO, "In: l_data_obj_count = %d", l_data_obj_count );
+
+ for(size_t i = 0; i < l_data_obj_count; i++) {
+ // timestamp for exist obj
+ time_t l_timestamp_cur = 0;
+ // obj to add
+ dap_store_obj_t* l_obj = l_store_obj + i;
+ // read item from base;
+ size_t l_count_read = 0;
+ dap_store_obj_t *l_read_obj = dap_chain_global_db_driver_read(l_obj->group,
+ l_obj->key, &l_count_read);
+ // get timestamp for the exist entry
+ if(l_read_obj)
+ l_timestamp_cur = l_read_obj->timestamp;
+ // get timestamp for the deleted entry
+ else
+ {
+ l_timestamp_cur = global_db_gr_del_get_timestamp(l_obj->group, l_obj->key);
+ }
+
+ //check whether to apply the received data into the database
+ bool l_apply = true;
+ if(l_obj->timestamp < l_timestamp_cur)
+ l_apply = false;
+ else if(l_obj->type == 'd') {
+ // already deleted
+ if(!l_read_obj)
+ l_apply = false;
+ }
+ else if(l_obj->type == 'a') {
+ bool l_is_the_same_present = false;
+ if(l_read_obj &&
+ l_read_obj->value_len == l_obj->value_len &&
+ !memcmp(l_read_obj->value, l_obj->value, l_obj->value_len))
+ l_is_the_same_present = true;
+ // this data already present in global_db and not obsolete (out of date)
+ if(l_read_obj && (l_is_the_same_present || l_read_obj->timestamp >= l_store_obj->timestamp))
+ l_apply = false;
+ }
+ if(l_read_obj)
+ dap_store_obj_free(l_read_obj, l_count_read);
+
+ if(!l_apply) {
+ // If request was from defined node_addr we update its state
+ if(l_ch_chain->request.node_addr.uint64) {
+ dap_db_log_set_last_id_remote(l_ch_chain->request.node_addr.uint64, l_obj->id);
+ }
+ continue;
+ }
+
+ char l_ts_str[50];
+ dap_time_to_str_rfc822(l_ts_str, sizeof(l_ts_str), l_store_obj[i].timestamp);
+ /*log_it(L_DEBUG, "Unpacked log history: type='%c' (0x%02hhX) group=\"%s\" key=\"%s\""
+ " timestamp=\"%s\" value_len=%u ",
+ (char ) l_store_obj[i].type, l_store_obj[i].type, l_store_obj[i].group,
+ l_store_obj[i].key,
+ l_ts_str,
+ l_store_obj[i].value_len);*/
+
+ // apply received transaction
+ dap_chain_t *l_chain = dap_chain_find_by_id(l_chain_pkt->hdr.net_id, l_chain_pkt->hdr.chain_id);
+ if(l_chain) {
+ if(l_chain->callback_datums_pool_proc_with_group)
+ l_chain->callback_datums_pool_proc_with_group(l_chain,
+ (dap_chain_datum_t**) &(l_store_obj->value), 1,
+ l_store_obj[i].group);
+ }
+ /*else {
+ // read net_name
+ if(!s_net_name)
+ {
+ static dap_config_t *l_cfg = NULL;
+ if((l_cfg = dap_config_open("network/default")) == NULL) {
+ log_it(L_ERROR, "Can't open default network config");
+ } else {
+ s_net_name = dap_strdup(dap_config_get_item_str(l_cfg, "general", "name"));
+ dap_config_close(l_cfg);
+ }
+ }
+ // add datum in ledger if necessary
+ {
+ dap_chain_net_t *l_net = dap_chain_net_by_name(s_net_name);
+ dap_chain_t * l_chain;
+ if(l_net) {
+ DL_FOREACH(l_net->pub.chains, l_chain)
+ {
+ const char *l_chain_name = l_chain->name; //l_chain_name = dap_strdup("gdb");
+ dap_chain_t *l_chain = dap_chain_net_get_chain_by_name(l_net, l_chain_name);
+ //const char *l_group_name = "chain-gdb.kelvin-testnet.chain-F00000000000000F";//dap_chain_gdb_get_group(l_chain);
+ if(l_chain->callback_datums_pool_proc_with_group)
+ l_chain->callback_datums_pool_proc_with_group(l_chain,
+ (dap_chain_datum_t**) &(l_store_obj->value), 1,
+ l_store_obj[i].group);
+ }
+ }
+ }
+ }*/
+ // save data to global_db
+ if(!dap_chain_global_db_obj_save(l_obj, 1)) {
+ dap_stream_ch_chain_pkt_write_error(a_ch, l_chain_pkt->hdr.net_id,
+ l_chain_pkt->hdr.chain_id, l_chain_pkt->hdr.cell_id,
+ "ERROR_GLOBAL_DB_INTERNAL_NOT_SAVED");
+ dap_stream_ch_set_ready_to_write(a_ch, true);
+ } else {
+ // If request was from defined node_addr we update its state
+ if(l_ch_chain->request.node_addr.uint64) {
+ dap_db_log_set_last_id_remote(l_ch_chain->request.node_addr.uint64,
+ l_obj->id);
+ }
+ //log_it(L_DEBUG, "Added new GLOBAL_DB history pack");
+ }
+ }
+ if(l_store_obj)
+ dap_store_obj_free(l_store_obj, l_data_obj_count);
+
+ } else {
+ log_it(L_WARNING, "Packet with GLOBAL_DB atom has zero body size");
+ }
+ }
+ break;
+ default:{
+ //log_it(L_INFO, "Get %s packet", c_dap_stream_ch_chain_pkt_type_str[l_ch_pkt->hdr.type]);
+ }
+ }
+ if(l_ch_chain->callback_notify_packet_in)
+ l_ch_chain->callback_notify_packet_in(l_ch_chain, l_ch_pkt->hdr.type, l_chain_pkt,
+ l_chain_pkt_data_size, //l_ch_pkt->hdr.size,
+ l_ch_chain->callback_notify_arg);
+ }
+ }
+}
+
+/**
+ * @brief dap_stream_ch_chain_go_idle
+ * @param a_ch_chain
+ */
+void dap_stream_ch_chain_go_idle ( dap_stream_ch_chain_t * a_ch_chain)
+{
+ a_ch_chain->state = CHAIN_STATE_IDLE;
+ //log_it(L_DEBUG, "CHAIN_STATE_IDLE");
+
+ // Cleanup after request
+ memset(&a_ch_chain->request, 0, sizeof(a_ch_chain->request));
+ memset(&a_ch_chain->request_net_id, 0, sizeof(a_ch_chain->request_net_id));
+ memset(&a_ch_chain->request_cell_id, 0, sizeof(a_ch_chain->request_cell_id));
+ memset(&a_ch_chain->request_chain_id, 0, sizeof(a_ch_chain->request_chain_id));
+ memset(&a_ch_chain->request_last_ts, 0, sizeof(a_ch_chain->request_last_ts));
+
+ dap_chain_atom_item_t *l_atom_item = NULL, *l_atom_item_tmp = NULL;
+
+ HASH_ITER( hh,a_ch_chain->request_atoms_lasts, l_atom_item, l_atom_item_tmp)
+ HASH_DEL(a_ch_chain->request_atoms_lasts, l_atom_item);
+
+ HASH_ITER( hh, a_ch_chain->request_atoms_processed, l_atom_item, l_atom_item_tmp )
+ HASH_DEL(a_ch_chain->request_atoms_processed, l_atom_item);
+ dap_stream_ch_set_ready_to_write(a_ch_chain->ch, false);
+
+}
+
+/**
+ * @brief s_stream_ch_packet_out
+ * @param ch
+ * @param arg
+ */
+void s_stream_ch_packet_out(dap_stream_ch_t* a_ch, void* a_arg)
+{
+ (void) a_arg;
+
+ dap_stream_ch_chain_t *l_ch_chain = DAP_STREAM_CH_CHAIN(a_ch);
+
+ //log_it( L_DEBUG,"s_stream_ch_packet_out state=%d", l_ch_chain ? l_ch_chain->state : -1);
+ // log_it( L_DEBUG,"l_ch_chain %X", l_ch_chain );
+
+ switch (l_ch_chain->state) {
+ case CHAIN_STATE_IDLE: {
+ dap_stream_ch_chain_go_idle(l_ch_chain);
+ } break;
+
+ case CHAIN_STATE_SYNC_ALL:
+
+ case CHAIN_STATE_SYNC_GLOBAL_DB: {
+
+ // Get log diff
+ //size_t l_data_size_out = 0;
+
+ dap_db_log_list_t *l_db_list = l_ch_chain->request_global_db_trs; //dap_list_last( l_ch_chain->request_global_db_trs );
+ dap_global_db_obj_t *l_obj = dap_db_log_list_get(l_db_list);
+
+ if (1) {
+ //dap_list_t *l_list = l_ch_chain->request_global_db_trs; //dap_list_last( l_ch_chain->request_global_db_trs );
+ bool l_is_stop = true; //l_list ? false : true;
+ while(l_obj) {
+
+ size_t l_items_total = dap_db_log_list_get_count(l_db_list);
+ size_t l_items_rest = dap_db_log_list_get_count_rest(l_db_list);
+
+ size_t l_item_size_out = 0;
+ uint8_t *l_item = dap_db_log_pack(l_obj, &l_item_size_out);
+ // Item not found, maybe it has deleted? Then go to the next item
+ if(!l_item || !l_item_size_out) {
+ //log_it(L_WARNING, "Log pack returned NULL??? data=0x%x (nothing to send) (rest=%d records)", l_obj,
+ // l_items_rest);
+ l_item_size_out = 0;
+ //dap_stream_ch_set_ready_to_write(a_ch, false);
+
+ // go to next item
+ l_obj = dap_db_log_list_get(l_db_list);
+ //if(l_obj)
+ // continue;
+ // stop global_db sync
+ //else
+ // break;
+ }
+ else {
+ //log_it(L_INFO, "Send one global_db record data=0x%x len=%d (rest=%d/%d items)", l_item, l_item_size_out,
+ // l_items_rest, l_items_total);
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_GLOBAL_DB,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, l_item, l_item_size_out);
+ l_ch_chain->stats_request_gdb_processed++;
+ //dap_stream_ch_set_ready_to_write(a_ch, true);
+ //sleep(1);
+
+ DAP_DELETE(l_item);
+ // sent the record, another will be sent
+ l_is_stop = false;
+ break;
+ }
+ // remove current item from list and go to next item
+ /*dap_chain_global_db_obj_delete((dap_global_db_obj_t *) l_list->data);
+ l_ch_chain->request_global_db_trs = dap_list_delete_link(l_ch_chain->request_global_db_trs, l_list);
+ // nothing was sent
+ if(!l_item_size_out) {
+ l_list = l_ch_chain->request_global_db_trs;
+ // go to next item
+ if(l_list)
+ continue;
+ // stop global_db sync
+ else
+ break;
+ }*/
+ }
+
+ if(l_is_stop){
+ //log_it(L_DEBUG, "l_obj == 0, STOP");
+ // If we don't need to send chains after
+// if(l_ch_chain->state != CHAIN_STATE_SYNC_ALL){
+// dap_stream_ch_chain_go_idle(l_ch_chain);
+// }else if(l_ch_chain->state == CHAIN_STATE_SYNC_GLOBAL_DB)
+ {
+ // free log list
+ l_ch_chain->request_global_db_trs = NULL;
+ dap_db_log_list_delete(l_db_list);
+
+ // last message
+
+ dap_stream_ch_chain_sync_request_t l_request = { { 0 } };
+ dap_chain_net_t *l_net = dap_chain_net_by_id(l_ch_chain->request_net_id);
+ l_request.node_addr.uint64 = l_net ? dap_db_get_cur_node_addr(l_net->pub.name) : 0;
+ l_request.id_start = dap_db_log_get_last_id_remote(l_ch_chain->request.node_addr.uint64);
+ l_request.id_end = 0;
+
+ log_it( L_DEBUG,"Syncronized database: last id %llu, items syncronyzed %llu ", l_request.id_start,
+ l_ch_chain->stats_request_gdb_processed );
+
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_request, sizeof(l_request));
+
+ if(l_ch_chain->callback_notify_packet_out)
+ l_ch_chain->callback_notify_packet_out(l_ch_chain, DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB,
+ NULL, 0, l_ch_chain->callback_notify_arg);
+
+ if(l_ch_chain->state != CHAIN_STATE_SYNC_ALL)
+ dap_stream_ch_chain_go_idle(l_ch_chain);
+ }
+ }
+ }
+
+ }
+ if(l_ch_chain->state != CHAIN_STATE_SYNC_ALL)
+ break;
+
+ // Synchronize chains
+ case CHAIN_STATE_SYNC_CHAINS: {
+ //log_it(L_DEBUG, "CHAIN_STATE_SYNC_CHAINS");
+ dap_chain_t * l_chain = dap_chain_find_by_id(l_ch_chain->request_net_id, l_ch_chain->request_chain_id);
+ /*
+ // alternative way to get l_chain
+ if(!l_ch_chain->request_atom_iter) {
+ log_it(L_ERROR, "CHAIN_STATE_SYNC_CHAINS not ready to send chains");
+ l_ch_chain->state = CHAIN_STATE_IDLE;
+ break;
+ }
+ //dap_chain_atom_iter_t* l_iter = l_chain->callback_atom_iter_create(l_chain);
+ dap_chain_t * l_chain = l_ch_chain->request_atom_iter->chain;
+ */
+
+ dap_chain_atom_item_t * l_atom_item = NULL, *l_atom_item_tmp = NULL;//, *l_chains_lasts_new = NULL;
+ if(l_ch_chain->request_atoms_lasts == NULL) { // All chains synced
+ dap_stream_ch_chain_sync_request_t l_request = { { 0 } };
+ uint8_t l_send_pkt_type = l_ch_chain->state == CHAIN_STATE_SYNC_CHAINS ?
+ DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS :
+ DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_ALL;
+ // last message
+ dap_stream_ch_chain_pkt_write(a_ch,
+ l_send_pkt_type,
+ l_ch_chain->request_net_id, l_ch_chain->request_chain_id,
+ l_ch_chain->request_cell_id, &l_request, sizeof(l_request));
+ log_it( L_DEBUG,"Synced: %llu atoms processed",
+ l_ch_chain->stats_request_atoms_processed);
+ dap_stream_ch_chain_go_idle(l_ch_chain);
+
+ if(l_ch_chain->callback_notify_packet_out)
+ l_ch_chain->callback_notify_packet_out(l_ch_chain, l_send_pkt_type, NULL, 0, l_ch_chain->callback_notify_arg);
+ }else{ // Process one chain from l_ch_chain->request_atoms_lasts
+ HASH_ITER(hh,l_ch_chain->request_atoms_lasts, l_atom_item, l_atom_item_tmp) {
+ dap_chain_atom_item_t * l_atom_item_proc = NULL;
+ // Check if its processed already
+ HASH_FIND(hh, l_ch_chain->request_atoms_processed, &l_atom_item->atom_hash,
+ sizeof(l_atom_item->atom_hash), l_atom_item_proc);
+
+ if(l_atom_item_proc == NULL) { // If not processed we first store it in special table
+ l_atom_item_proc = DAP_NEW_Z(dap_chain_atom_item_t);
+ l_atom_item_proc->atom = l_atom_item->atom;
+ memcpy(&l_atom_item_proc->atom_hash, &l_atom_item->atom_hash, sizeof(l_atom_item->atom_hash));
+ HASH_ADD(hh, l_ch_chain->request_atoms_processed, atom_hash, sizeof(l_atom_item->atom_hash),
+ l_atom_item_proc);
+
+ // Then flush it out to the remote
+ size_t l_atom_size = l_chain->callback_atom_get_size(l_atom_item->atom);
+ dap_stream_ch_chain_pkt_write(a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_CHAIN, l_ch_chain->request_net_id,
+ l_ch_chain->request_chain_id, l_ch_chain->request_cell_id,
+ l_atom_item->atom, l_atom_size);
+ l_ch_chain->stats_request_atoms_processed++;
+ // Then parse links and populate new lasts
+ size_t l_lasts_size = 0;
+ dap_chain_atom_ptr_t * l_links = NULL;
+
+ dap_chain_atom_iter_t* l_iter = l_chain->callback_atom_iter_create_from(l_chain, l_atom_item->atom);
+ l_links = l_chain->callback_atom_iter_get_links(l_iter, &l_lasts_size);
+ //DAP_DELETE(l_atom_item->atom);
+ DAP_DELETE(l_iter);
+ //l_links = l_chain->callback_atom_iter_get_links(l_atom_item->atom, &l_lasts_size);
+
+ for(size_t i = 0; i < l_lasts_size; i++) { // Find links
+ dap_chain_atom_item_t * l_link_item = NULL;
+ dap_chain_hash_fast_t l_link_hash;
+ dap_hash_fast(l_links[i], l_chain->callback_atom_get_size(l_links[i]),
+ &l_link_hash);
+ // Check link in processed atims
+ HASH_FIND(hh, l_ch_chain->request_atoms_processed, &l_link_hash, sizeof(l_link_hash), l_link_item);
+ if(l_link_item == NULL) { // Not found, add new lasts
+ l_link_item = DAP_NEW_Z(dap_chain_atom_item_t);
+ l_link_item->atom = l_links[i];// do not use memory cause it will be deleted
+ memcpy(&l_link_item->atom_hash, &l_link_hash, sizeof(l_link_hash));
+ //HASH_ADD(hh, l_chains_lasts_new, atom_hash, sizeof(l_link_hash), l_link_item);
+ HASH_ADD(hh, l_ch_chain->request_atoms_lasts, atom_hash, sizeof(l_link_hash), l_link_item);
+ }
+ //else
+ // DAP_DELETE(l_links[i]);
+ }
+ DAP_DELETE(l_links);
+ HASH_DEL(l_ch_chain->request_atoms_lasts, l_atom_item);
+ break;
+ }
+ else{
+ HASH_DEL(l_ch_chain->request_atoms_lasts, l_atom_item);
+ }
+ }
+ }
+ //assert(l_ch_chain->request_atoms_lasts == NULL);
+ //l_ch_chain->request_atoms_lasts = l_chains_lasts_new;
+ }
+ break;
+
+ }
+
+}
diff --git a/libdap-stream-ch-chain/dap_stream_ch_chain.h b/libdap-stream-ch-chain/dap_stream_ch_chain.h
new file mode 100755
index 0000000000000000000000000000000000000000..0e5e6793752fb76e882827b48c986ca4c75ed039
--- /dev/null
+++ b/libdap-stream-ch-chain/dap_stream_ch_chain.h
@@ -0,0 +1,77 @@
+/*
+ * Authors:
+ * Dmitriy A. Gearasimov <gerasimov.dmitriy@demlabs.net>
+ * DeM Labs Inc. https://demlabs.net
+ * Kelvin Project https://github.com/kelvinblockchain
+ * Copyright (c) 2017-2018
+ * All rights reserved.
+
+ This file is part of DAP (Deus Applications Prototypes) the open source project
+
+ DAP (Deus Applicaions Prototypes) 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.
+
+ DAP 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 any DAP based project. If not, see <http://www.gnu.org/licenses/>.
+**/
+
+#pragma once
+
+#include <pthread.h>
+
+#include "dap_chain_common.h"
+#include "dap_chain.h"
+#include "dap_chain_global_db_hist.h"
+#include "dap_list.h"
+#include "dap_stream_ch_chain_pkt.h"
+#include "uthash.h"
+
+
+typedef struct dap_stream_ch_chain dap_stream_ch_chain_t;
+typedef void (*dap_stream_ch_chain_callback_packet_t)(dap_stream_ch_chain_t*, uint8_t a_pkt_type,
+ dap_stream_ch_chain_pkt_t *a_pkt, size_t a_pkt_data_size,
+ void * a_arg);
+typedef struct dap_chain_atom_item{
+ dap_chain_hash_fast_t atom_hash;
+ dap_chain_atom_ptr_t atom;
+ UT_hash_handle hh;
+} dap_chain_atom_item_t;
+
+typedef struct dap_stream_ch_chain {
+ pthread_mutex_t mutex;
+ dap_stream_ch_t * ch;
+
+ dap_db_log_list_t *request_global_db_trs; // list of transactions
+ dap_stream_ch_chain_state_t state;
+
+ dap_chain_atom_iter_t * request_atom_iter;
+ dap_chain_atom_item_t * request_atoms_lasts;
+ dap_chain_atom_item_t * request_atoms_processed;
+ uint64_t stats_request_atoms_processed;
+ uint64_t stats_request_gdb_processed;
+ dap_stream_ch_chain_sync_request_t request;
+ dap_chain_net_id_t request_net_id;
+ dap_chain_id_t request_chain_id;
+ dap_chain_cell_id_t request_cell_id;
+ time_t request_last_ts;
+
+ dap_stream_ch_chain_callback_packet_t callback_notify_packet_out;
+ dap_stream_ch_chain_callback_packet_t callback_notify_packet_in;
+ void *callback_notify_arg;
+} dap_stream_ch_chain_t;
+
+#define DAP_STREAM_CH_CHAIN(a) ((dap_stream_ch_chain_t *) ((a)->internal) )
+
+
+int dap_stream_ch_chain_init(void);
+void dap_stream_ch_chain_deinit(void);
+
+inline static uint8_t dap_stream_ch_chain_get_id(void) { return (uint8_t) 'C'; }
+void dap_stream_ch_chain_go_idle ( dap_stream_ch_chain_t * a_ch_chain);
diff --git a/libdap-stream-ch-chain/dap_stream_ch_chain_pkt.c b/libdap-stream-ch-chain/dap_stream_ch_chain_pkt.c
new file mode 100755
index 0000000000000000000000000000000000000000..bbb00965cc5b7b69af2f318d515b47b117d37fc5
--- /dev/null
+++ b/libdap-stream-ch-chain/dap_stream_ch_chain_pkt.c
@@ -0,0 +1,69 @@
+#include <stdlib.h>
+#include <stdio.h>
+#include <time.h>
+#include <stdlib.h>
+#include <stddef.h>
+#include <stdint.h>
+#include <string.h>
+
+#ifdef WIN32
+#include <winsock2.h>
+#include <windows.h>
+#include <mswsock.h>
+#include <ws2tcpip.h>
+#include <io.h>
+#include <pthread.h>
+#endif
+
+#include "dap_stream_ch.h"
+#include "dap_stream_ch_pkt.h"
+#include "dap_stream_ch_chain_pkt.h"
+#include "dap_chain.h"
+
+#define LOG_TAG "dap_stream_ch_chain_pkt"
+
+
+/**
+ * @brief dap_stream_ch_chain_pkt_to_dap_stream_ch_chain_state
+ * @param a_state
+ * @return
+ */
+dap_stream_ch_chain_state_t dap_stream_ch_chain_pkt_type_to_dap_stream_ch_chain_state(char a_state)
+{
+ switch (a_state) {
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_ALL:
+ return CHAIN_STATE_SYNC_ALL;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB:
+ return CHAIN_STATE_SYNC_GLOBAL_DB;
+ case DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS:
+ return CHAIN_STATE_SYNC_CHAINS;
+ }
+ return CHAIN_STATE_IDLE;
+}
+
+/**
+ * @brief dap_stream_ch_net_pkt_write
+ * @param sid
+ * @param data
+ * @param data_size
+ * @return
+ */
+size_t dap_stream_ch_chain_pkt_write(dap_stream_ch_t *a_ch, uint8_t a_type,dap_chain_net_id_t a_net_id,
+ dap_chain_id_t a_chain_id, dap_chain_cell_id_t a_cell_id,
+ const void * a_data, size_t a_data_size)
+{
+ dap_stream_ch_chain_pkt_t * l_chain_pkt;
+ size_t l_chain_pkt_size = sizeof (l_chain_pkt->hdr) + a_data_size;
+ l_chain_pkt = DAP_NEW_Z_SIZE(dap_stream_ch_chain_pkt_t, l_chain_pkt_size );
+ l_chain_pkt->hdr.version = 1;
+ l_chain_pkt->hdr.net_id.uint64 = a_net_id.uint64;
+ l_chain_pkt->hdr.cell_id.uint64 = a_cell_id.uint64;
+ l_chain_pkt->hdr.chain_id.uint64 = a_chain_id.uint64;
+
+ if (a_data_size && a_data)
+ memcpy( l_chain_pkt->data, a_data, a_data_size);
+
+ size_t l_ret = dap_stream_ch_pkt_write(a_ch, a_type , l_chain_pkt, l_chain_pkt_size);
+ DAP_DELETE(l_chain_pkt);
+ return l_ret;
+}
diff --git a/libdap-stream-ch-chain/dap_stream_ch_chain_pkt.h b/libdap-stream-ch-chain/dap_stream_ch_chain_pkt.h
new file mode 100755
index 0000000000000000000000000000000000000000..c0746bfd0230d87bbc68af82bbd776d735322bdc
--- /dev/null
+++ b/libdap-stream-ch-chain/dap_stream_ch_chain_pkt.h
@@ -0,0 +1,106 @@
+/*
+ * Authors:
+ * Dmitriy A. Gearasimov <gerasimov.dmitriy@demlabs.net>
+ * DeM Labs Inc. https://demlabs.net
+ * Kelvin Project https://github.com/kelvinblockchain
+ * Copyright (c) 2017-2018
+ * All rights reserved.
+
+ This file is part of DAP (Deus Applications Prototypes) the open source project
+
+ DAP (Deus Applicaions Prototypes) 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.
+
+ DAP 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 any DAP based project. If not, see <http://www.gnu.org/licenses/>.
+**/
+#pragma once
+
+#include <stdint.h>
+#include <stddef.h>
+#include <string.h>
+
+#include "dap_common.h"
+#include "dap_chain_common.h"
+#include "dap_chain_datum.h"
+#include "dap_chain_cs.h"
+
+#include "dap_stream_ch.h"
+
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_CHAIN 0x01
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_GLOBAL_DB 0x11
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_CHAIN 0x20
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_GLOBAL_DB 0x21
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_FIRST_GLOBAL_DB_GROUP 0x31
+
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_CHAINS 0x02
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_GLOBAL_DB 0x12
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_ALL 0x22
+
+
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS 0x03
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB 0x13
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB_GROUP 0x33
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_ALL 0x23
+#define DAP_STREAM_CH_CHAIN_PKT_TYPE_ERROR 0xff
+
+typedef enum dap_stream_ch_chain_state{
+ CHAIN_STATE_IDLE=0,
+ CHAIN_STATE_SYNC_CHAINS,
+ CHAIN_STATE_SYNC_GLOBAL_DB,
+ CHAIN_STATE_SYNC_ALL,
+} dap_stream_ch_chain_state_t;
+
+typedef struct dap_stream_ch_chain_sync_request{
+ dap_chain_node_addr_t node_addr; // Requesting node's address
+ dap_chain_hash_fast_t hash_from;
+ dap_chain_hash_fast_t hash_to;
+ uint64_t id_start;
+ uint64_t id_end;
+} DAP_ALIGN_PACKED dap_stream_ch_chain_sync_request_t;
+
+
+typedef struct dap_stream_ch_chain_pkt_hdr{
+ uint8_t version;
+ uint8_t padding[7];
+ dap_chain_net_id_t net_id;
+ dap_chain_id_t chain_id;
+ dap_chain_cell_id_t cell_id;
+} DAP_ALIGN_PACKED dap_stream_ch_chain_pkt_hdr_t;
+
+typedef struct dap_stream_ch_chain_pkt{
+ dap_stream_ch_chain_pkt_hdr_t hdr;
+ uint8_t data[];
+} DAP_ALIGN_PACKED dap_stream_ch_chain_pkt_t;
+
+static const char* c_dap_stream_ch_chain_pkt_type_str[]={
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_CHAIN] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_CHAIN",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_GLOBAL_DB] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_GLOBAL_DB",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_CHAINS] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_CHAINS",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_GLOBAL_DB] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_GLOBAL_DB",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_ALL] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNC_ALL",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_CHAINS",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_GLOBAL_DB",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_ALL] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_SYNCED_ALL",
+ [DAP_STREAM_CH_CHAIN_PKT_TYPE_ERROR] = "DAP_STREAM_CH_CHAIN_PKT_TYPE_ERROR"
+
+};
+
+dap_stream_ch_chain_state_t dap_stream_ch_chain_pkt_type_to_dap_stream_ch_chain_state(char a_state);
+
+size_t dap_stream_ch_chain_pkt_write(dap_stream_ch_t *a_ch, uint8_t a_type,dap_chain_net_id_t a_net_id,
+ dap_chain_id_t a_chain_id, dap_chain_cell_id_t a_cell_id,
+ const void * a_data, size_t a_data_size);
+
+inline static size_t dap_stream_ch_chain_pkt_write_error(dap_stream_ch_t *a_ch, dap_chain_net_id_t a_net_id,
+ dap_chain_id_t a_chain_id, dap_chain_cell_id_t a_cell_id, const char * a_err_string )
+{
+ return dap_stream_ch_chain_pkt_write( a_ch, DAP_STREAM_CH_CHAIN_PKT_TYPE_ERROR, a_net_id, a_chain_id, a_cell_id, a_err_string,strlen (a_err_string)+1 );
+}