Browse files

first commit

  • Loading branch information...
0 parents commit c2d5a8e4cb0b7cdfb56a7e74e18c3a13d047eb25 @Diablo-D3 committed Nov 6, 2010
Showing with 1,670 additions and 0 deletions.
  1. +3 −0 DiabloMiner.sh
  2. +674 −0 LICENSE
  3. +16 −0 README
  4. +33 −0 contrib/build-lwjgl-mvn-repo.sh
  5. +22 −0 contrib/lwjgl.pom
  6. +123 −0 pom.xml
  7. +587 −0 src/main/java/com/diablominer/DiabloMiner/DiabloMiner.java
  8. +212 −0 src/main/resources/DiabloMiner.cl
3 DiabloMiner.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+java -cp target/libs/*:target/DiabloMiner-0.0.1-SNAPSHOT.jar -Djava.library.path=target/libs/natives/linux com.diablominer.DiabloMiner.DiabloMiner $@
+
674 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>.
16 README
@@ -0,0 +1,16 @@
+ DiabloMiner - OpenCL miner for BitCoin
+ Copyright (C) 2010 Patrick McFarland <diablod3@gmail.com>
+
+ 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/>.
+
33 contrib/build-lwjgl-mvn-repo.sh
@@ -0,0 +1,33 @@
+#!/bin/sh
+
+if test -z "$1"; then
+ echo "No version number provided"
+ exit
+fi
+
+sed -e "s/VERSION/$1/g" lwjgl.pom > lwjgl-$1.pom
+
+mvn deploy:deploy-file -DartifactId=lwjgl -Dfile=lwjgl-docs-$1.zip -Dclassifier=javadoc -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+mvn deploy:deploy-file -DartifactId=lwjgl -Dfile=lwjgl-source-$1.zip -Dclassifier=source -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+unzip lwjgl-$1.zip
+
+mvn deploy:deploy-file -DartifactId=lwjgl -Dfile=lwjgl-$1/jar/lwjgl_test.jar -Dpackaging=test-jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+mvn deploy:deploy-file -DartifactId=lwjgl -Dfile=lwjgl-$1/jar/lwjgl.jar -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl -DgeneratePom=false -DpomFile=lwjgl-$1.pom
+
+mvn deploy:deploy-file -DartifactId=lwjgl-debug -Dfile=lwjgl-$1/jar/lwjgl-debug.jar -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+mvn deploy:deploy-file -DartifactId=lwjgl-jinput -Dfile=lwjgl-$1/jar/jinput.jar -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+mvn deploy:deploy-file -DartifactId=lwjgl-util -Dfile=lwjgl-$1/jar/lwjgl_util.jar -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+cd ./lwjgl-$1/native
+zip -r -9 ../native.zip ./
+cd ../..
+
+mvn deploy:deploy-file -DartifactId=lwjgl-native -Dfile=lwjgl-$1/native.zip -Dpackaging=jar -DgroupId=org.lwjgl -Dversion=$1 -DrepositoryID=lwjgl -Durl=file:./lwjgl
+
+rm -rf lwjgl-$1/
+
22 contrib/lwjgl.pom
@@ -0,0 +1,22 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd" xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
+ <modelVersion>4.0.0</modelVersion>
+
+ <groupId>org.lwjgl</groupId>
+ <artifactId>lwjgl</artifactId>
+ <version>VERSION</version>
+
+ <dependencies>
+ <dependency>
+ <groupId>org.lwjgl</groupId>
+ <artifactId>lwjgl-jinput</artifactId>
+ <version>VERSION</version>
+ </dependency>
+ <dependency>
+ <groupId>org.lwjgl</groupId>
+ <artifactId>lwjgl-native</artifactId>
+ <version>VERSION</version>
+ </dependency>
+ </dependencies>
+</project>
+
123 pom.xml
@@ -0,0 +1,123 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+ xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+ <modelVersion>4.0.0</modelVersion>
+ <groupId>com.diablominer</groupId>
+ <artifactId>DiabloMiner</artifactId>
+ <version>0.0.1-SNAPSHOT</version>
+
+ <properties>
+ <project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
+ <lwjgl.version>2.6</lwjgl.version>
+ </properties>
+
+ <repositories>
+ <repository>
+ <id>lwjgl-local</id>
+ <name>lwjgl local</name>
+ <url>file:{$basedir}/contrib/lwjgl</url>
+ </repository>
+ <repository>
+ <id>tuscany.repo</id>
+ <name>Tuscany Maven 2.x Repository</name>
+ <url>http://svn.apache.org/repos/asf/tuscany/maven</url>
+ <releases>
+ <enabled>true</enabled>
+ </releases>
+ <snapshots>
+ <enabled>false</enabled>
+ </snapshots>
+ </repository>
+ </repositories>
+ <dependencies>
+ <dependency>
+ <groupId>org.lwjgl</groupId>
+ <artifactId>lwjgl</artifactId>
+ <version>${lwjgl.version}</version>
+ </dependency>
+ <dependency>
+ <groupId>org.lwjgl</groupId>
+ <artifactId>lwjgl-util</artifactId>
+ <version>${lwjgl.version}</version>
+ </dependency>
+ <dependency>
+ <groupId>org.codehaus.jackson</groupId>
+ <artifactId>jackson-mapper-asl</artifactId>
+ <version>1.6.1</version>
+ <type>jar</type>
+ <scope>compile</scope>
+ </dependency>
+ <dependency>
+ <groupId>commons-codec</groupId>
+ <artifactId>commons-codec</artifactId>
+ <version>1.4</version>
+ <type>jar</type>
+ <scope>compile</scope>
+ </dependency>
+ <dependency>
+ <groupId>commons-cli</groupId>
+ <artifactId>commons-cli</artifactId>
+ <version>1.2</version>
+ <type>jar</type>
+ <scope>compile</scope>
+ </dependency>
+ </dependencies>
+
+ <build>
+ <plugins>
+ <plugin>
+ <groupId>org.apache.maven.plugins</groupId>
+ <artifactId>maven-compiler-plugin</artifactId>
+ <configuration>
+ <source>1.6</source>
+ <target>1.6</target>
+ </configuration>
+ </plugin>
+
+ <plugin>
+ <groupId>org.apache.maven.plugins</groupId>
+ <artifactId>maven-dependency-plugin</artifactId>
+ <executions>
+ <execution>
+ <id>copy-dependencies</id>
+ <phase>package</phase>
+ <goals>
+ <goal>copy-dependencies</goal>
+ </goals>
+ <configuration>
+ <outputDirectory>${project.build.directory}/libs</outputDirectory>
+ <overWriteReleases>false</overWriteReleases>
+ <overWriteSnapshots>false</overWriteSnapshots>
+ <overWriteIfNewer>true</overWriteIfNewer>
+ </configuration>
+ </execution>
+ </executions>
+ </plugin>
+ <plugin>
+ <groupId>org.apache.maven.plugins</groupId>
+ <artifactId>maven-dependency-plugin</artifactId>
+ <configuration>
+ <artifactItems>
+ <artifactItem>
+ <groupId>org.lwjgl</groupId>
+ <artifactId>lwjgl-native</artifactId>
+ <version>${lwjgl.version}</version>
+ <type>jar</type>
+ <outputDirectory>${project.build.directory}/libs/natives</outputDirectory>
+ <overWrite>true</overWrite>
+ </artifactItem>
+ </artifactItems>
+ </configuration>
+ <executions>
+ <execution>
+ <id>unpack</id>
+ <phase>generate-resources</phase>
+ <goals>
+ <goal>unpack</goal>
+ </goals>
+ </execution>
+ </executions>
+ </plugin>
+ </plugins>
+ </build>
+</project>
587 src/main/java/com/diablominer/DiabloMiner/DiabloMiner.java
@@ -0,0 +1,587 @@
+/*
+ * DiabloMiner - OpenCL miner for BitCoin
+ * Copyright (C) 2010 Patrick McFarland <diablod3@gmail.com>
+ *
+ * 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/>.
+*/
+
+package com.diablominer.DiabloMiner;
+
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+import java.io.OutputStreamWriter;
+import java.io.Writer;
+import java.net.HttpURLConnection;
+import java.net.URL;
+import java.nio.ByteBuffer;
+import java.nio.IntBuffer;
+import java.security.MessageDigest;
+import java.text.DateFormat;
+import java.util.ArrayList;
+import java.util.Date;
+import java.util.List;
+
+import org.apache.commons.cli.CommandLine;
+import org.apache.commons.cli.HelpFormatter;
+import org.apache.commons.cli.Options;
+import org.apache.commons.cli.PosixParser;
+import org.apache.commons.codec.binary.Base64;
+import org.codehaus.jackson.map.ObjectMapper;
+import org.codehaus.jackson.node.ArrayNode;
+import org.codehaus.jackson.node.ObjectNode;
+import org.lwjgl.BufferUtils;
+import org.lwjgl.PointerBuffer;
+import org.lwjgl.opencl.CL;
+import org.lwjgl.opencl.CL10;
+import org.lwjgl.opencl.CL11;
+import org.lwjgl.opencl.CLCommandQueue;
+import org.lwjgl.opencl.CLContext;
+import org.lwjgl.opencl.CLContextCallback;
+import org.lwjgl.opencl.CLDevice;
+import org.lwjgl.opencl.CLEvent;
+import org.lwjgl.opencl.CLEventCallback;
+import org.lwjgl.opencl.CLKernel;
+import org.lwjgl.opencl.CLMem;
+import org.lwjgl.opencl.CLPlatform;
+import org.lwjgl.opencl.CLProgram;
+
+class DiabloMiner {
+ URL bitcoind;
+ String userPass;
+ int targetFPS = 60;
+ int forceWorkSize = 0;
+ int forceVectorWidth = 0;
+
+ String source;
+
+ long hashCount = 0;
+
+ double startTime;
+ double now;
+ int currentBlocks = 1;
+
+ final static int EXECUTION_TOTAL = 3;
+
+ final static String VECTOR[] = new String[] { "0", "1", "2", "3", "4", "5", "6", "7",
+ "8", "9", "a", "b", "c", "d", "e", "f"};
+
+ public static void main(String [] args) throws Exception {
+ DiabloMiner diabloMiner = new DiabloMiner();
+
+ diabloMiner.execute(args);
+ }
+
+ void execute(String[] args) throws Exception {
+ String user = "diablo";
+ String pass = "miner";
+ String ip = "127.0.0.1";
+
+ Options options = new Options();
+ options.addOption("u", "user", true, "username for host");
+ options.addOption("p", "pass", true, "password for host");
+ options.addOption("f", "fps", true, "target execution timing");
+ options.addOption("w", "worksize", true, "override worksize");
+ options.addOption("v", "vectorwidth", true, "override vector width");
+ options.addOption("h", "help", false, "this help");
+
+ PosixParser parser = new PosixParser();
+ CommandLine line = parser.parse(options, args);
+
+ if(line.hasOption("user"))
+ user = line.getOptionValue("user");
+
+ if(line.hasOption("pass"))
+ pass = line.getOptionValue("pass");
+
+ if(line.hasOption("fps"))
+ targetFPS = Integer.parseInt(line.getOptionValue("fps"));
+
+ if(line.hasOption("worksize"))
+ forceWorkSize = Integer.parseInt(line.getOptionValue("worksize"));
+
+ if(line.hasOption("vectorwidth"))
+ forceVectorWidth = Integer.parseInt(line.getOptionValue("vectorwidth"));
+
+ if(line.hasOption("help")) {
+ HelpFormatter formatter = new HelpFormatter();
+ formatter.printHelp("DiabloMiner", options);
+ System.exit(0);
+ }
+
+ bitcoind = new URL("http://"+ ip + ":8332/");
+ userPass = "Basic " + Base64.encodeBase64String((user + ":" + pass).getBytes()).trim();
+
+ InputStream stream = DiabloMiner.class.getResourceAsStream("/DiabloMiner.cl");
+ byte[] data = new byte[64 * 1024];
+ stream.read(data);
+ source = new String(data).trim();
+ stream.close();
+
+ CL.create();
+
+ List<CLPlatform> platforms = CLPlatform.getPlatforms();
+ List<DeviceState> deviceStates = new ArrayList<DeviceState>();
+
+ if(platforms == null)
+ throw new Exception("No OpenCL platforms found.");
+
+ for(CLPlatform platform : platforms) {
+ List<CLDevice> devices = platform.getDevices(CL10.CL_DEVICE_TYPE_GPU | CL10.CL_DEVICE_TYPE_ACCELERATOR);
+
+ for (CLDevice device : devices)
+ deviceStates.add(this.new DeviceState(platform, device));
+ }
+
+ boolean running = true;
+
+ double then = now = startTime = System.nanoTime() / 1000000.0;
+
+ for(int i = 0; i < deviceStates.size(); i++)
+ deviceStates.get(i).checkDevice();
+
+ System.out.println("Started at " + DateFormat.getDateTimeInstance(DateFormat.MEDIUM, DateFormat.MEDIUM).format(new Date()));
+
+ while(running) {
+ now = System.nanoTime() / 1000000.0;
+
+ for(int i = 0; i < deviceStates.size(); i++)
+ deviceStates.get(i).checkDevice();
+
+ if(now > then + 1000) {
+ double adjustedCount = hashCount / ((now - startTime) / 1000.0) / 1000.0;
+
+ System.out.print("\r" + (int)adjustedCount + " khash/sec");
+
+ then = now;
+ }
+
+ Thread.sleep(1000/targetFPS);
+ }
+ }
+
+ static int rot(int x, int y) {
+ return (x >>> y) | (x << (32 - y));
+ }
+
+ static void sharound(int out[], int na, int nb, int nc, int nd, int ne, int nf, int ng, int nh, int x, int K) {
+ int a = out[na];
+ int b = out[nb];
+ int c = out[nc];
+ int d = out[nd];
+ int e = out[ne];
+ int f = out[nf];
+ int g = out[ng];
+ int h = out[nh];
+
+ int t1 = h + (rot(e, 6) ^ rot(e, 11) ^ rot(e, 25)) + ((e & f) ^ ((~e) & g)) + K + x;
+ int t2 = (rot(a, 2) ^ rot(a, 13) ^ rot(a, 22)) + ((a & b) ^ (a & c) ^ (b & c));
+
+ out[nd] = d + t1;
+ out[nh] = t1 + t2;
+ }
+
+ class DeviceState {
+ final String deviceName;
+
+ final CLContext context;
+ final CLCommandQueue queue;
+
+ final CLProgram program;
+ final CLKernel kernel;
+
+ long workSizeBase;
+ final PointerBuffer workSize;
+ final PointerBuffer localWorkSize;
+
+ final int vectorWidth;
+
+ final ExecutionState executions[];
+
+ int base;
+
+ long runs;
+ long runsThen;
+
+ DeviceState(CLPlatform platform, CLDevice device) throws Exception {
+ PointerBuffer properties = BufferUtils.createPointerBuffer(3);
+ properties.put(CL10.CL_CONTEXT_PLATFORM).put(platform.getPointer()).put(0).flip();
+ int err = 0;
+
+ deviceName = device.getInfoString(CL10.CL_DEVICE_NAME);
+ int deviceCU = device.getInfoInt(CL10.CL_DEVICE_MAX_COMPUTE_UNITS);
+ long deviceWorkSize = device.getInfoSize(CL10.CL_DEVICE_MAX_WORK_GROUP_SIZE);
+
+ if(forceVectorWidth == 0)
+ //vectorWidth = device.getInfoInt(CL10.CL_DEVICE_PREFERRED_VECTOR_WIDTH_);
+ vectorWidth = 1;
+ else
+ vectorWidth = forceVectorWidth;
+
+ System.out.print("Added " + deviceName + " (" + deviceCU + " CU, " + vectorWidth +
+ "x vector, local work size of ");
+
+ context = CL10.clCreateContext(properties, device, new CLContextCallback() {
+ protected void handleMessage(String errinfo, ByteBuffer private_info) {
+ System.out.println("ERROR: " + errinfo);
+ }
+ }, null);
+
+ queue = CL10.clCreateCommandQueue(context, device, CL10.CL_QUEUE_OUT_OF_ORDER_EXEC_MODE_ENABLE, null);
+
+ String deviceSource;
+ String ns;
+ String checkOutput = "";
+
+ ns = "(uintv)(";
+
+ for(int i = 0; i < vectorWidth; i++) {
+ ns += "nonce + " + (((long)Math.pow(2, 32) / vectorWidth) * i);
+
+ String s;
+
+ if(vectorWidth > 1)
+ s = ".s" + VECTOR[i];
+ else
+ s = "";
+
+ checkOutput += "if(H" + s + " == 0) { \n"
+ + "output[" + i + " * 2] = 0;\n"
+ + "output[" + i + " * 2 + 1] = ns" + s + ";\n"
+ + "}\n";
+
+ if(i != vectorWidth - 1) {
+ ns += ", ";
+ }
+ }
+
+ ns += ")";
+
+ deviceSource = source.replace("$ns", ns);
+ deviceSource = deviceSource.replace("$checkOutput", checkOutput);
+
+ if(forceWorkSize > 0)
+ deviceSource = deviceSource.replace("$forcelocalsize",
+ "__attribute__((reqd_work_group_size(" + forceWorkSize + ", 1, 1)))");
+ else
+ deviceSource = deviceSource.replace("$forcelocalsize", "");
+
+ if(vectorWidth > 1)
+ deviceSource = deviceSource.replace("uintv", "uint" + vectorWidth);
+ else
+ deviceSource = deviceSource.replace("uintv", "uint");
+
+ program = CL10.clCreateProgramWithSource(context, deviceSource, null);
+ err = CL10.clBuildProgram(program, device, "", null);
+ if(err != CL10.CL_SUCCESS) {
+ System.out.println();
+
+ ByteBuffer logBuffer = BufferUtils.createByteBuffer(1024);
+ byte[] log = new byte[1024];
+
+ CL10.clGetProgramBuildInfo(program, device, CL10.CL_PROGRAM_BUILD_LOG, logBuffer, null);
+
+ logBuffer.get(log);
+
+ System.out.println(new String(log));
+
+ throw new Exception("Failed to build program on " + deviceName);
+ }
+
+ kernel = CL10.clCreateKernel(program, "search", null);
+ if(kernel == null) {
+ System.out.println();
+ throw new Exception("Failed to create kernel " + deviceName);
+ }
+
+ if(forceWorkSize == 0) {
+ ByteBuffer rkwgs = BufferUtils.createByteBuffer(8);
+ err = CL10.clGetKernelWorkGroupInfo(kernel, device, CL10.CL_KERNEL_WORK_GROUP_SIZE, rkwgs, null);
+ workSizeBase = rkwgs.getLong(0);
+
+ if(!(err == CL10.CL_SUCCESS) || workSizeBase == 0)
+ workSizeBase = deviceWorkSize;
+ } else {
+ workSizeBase = forceWorkSize;
+ }
+
+ System.out.println(workSizeBase + ")");
+
+ localWorkSize = BufferUtils.createPointerBuffer(1);
+ localWorkSize.put(0, workSizeBase);
+
+ workSizeBase *= workSizeBase;
+
+ workSize = BufferUtils.createPointerBuffer(1);
+ workSize.put(0, workSizeBase);
+
+ executions = new ExecutionState[EXECUTION_TOTAL];
+
+ for(int i = 0; i < EXECUTION_TOTAL; i++) {
+ executions[i] = this.new ExecutionState();
+ executions[i].checkExecution();
+ CL10.clFlush(queue);
+ }
+ }
+
+ void checkDevice() throws IOException {
+ if(runs > runsThen) {
+ if((now - startTime) / runs < 1000.0 / (targetFPS * 2))
+ workSize.put(0, workSize.get(0) + workSizeBase * 2);
+
+ if((now - startTime) / runs > 1000.0 / targetFPS)
+ if(workSize.get(0) > workSizeBase * 2)
+ workSize.put(0, workSize.get(0) - workSizeBase);
+
+ runsThen = runs;
+ }
+ }
+
+ class ExecutionState extends CLEventCallback {
+ final ByteBuffer buffer;
+ final IntBuffer bufferInt;
+ final CLMem output;
+
+ CLEvent event;
+
+ final PointerBuffer eventPointer1 = BufferUtils.createPointerBuffer(1);
+ final PointerBuffer eventPointer2 = BufferUtils.createPointerBuffer(1);
+ final PointerBuffer eventPointer3 = BufferUtils.createPointerBuffer(1);
+ final ByteBuffer scratchBuffer = BufferUtils.createByteBuffer(8);
+
+ final int[] state2 = new int[16];
+
+ final MessageDigest digest = MessageDigest.getInstance("SHA-256");
+ final ByteBuffer digestFirst = BufferUtils.createByteBuffer(128);
+ final IntBuffer digestFirstInt = digestFirst.asIntBuffer();
+ byte[] digestSecond;
+
+ final GetWorkParser currentWork;
+
+ ExecutionState() throws Exception {
+ buffer = BufferUtils.createByteBuffer(vectorWidth*2*4);
+ bufferInt = buffer.asIntBuffer();
+
+ for(int i = 0; i < vectorWidth; i++)
+ bufferInt.put((i * 2), 1);
+
+ output = CL10.clCreateBuffer(context, CL10.CL_MEM_WRITE_ONLY, vectorWidth*2*4, null);
+
+ CL10.clEnqueueWriteBuffer(queue, output, CL10.CL_FALSE, 0, buffer, null, eventPointer1);
+ event = queue.getCLEvent(eventPointer1.get(0));
+
+ currentWork = new GetWorkParser();
+ }
+
+ void checkExecution() throws IOException {
+ runs++;
+
+ CL10.clReleaseEvent(event);
+
+ boolean reset = false;
+
+ for(int i = 0; i < vectorWidth; i++) {
+ if(bufferInt.get(i * 2) == 0) {
+ digestFirstInt.put(currentWork.block);
+ digestFirstInt.put(19, bufferInt.get((i * 2) + 1));
+ digestFirstInt.flip();
+ digest.update(digestFirst);
+ digestFirst.flip();
+ digestSecond = digest.digest();
+ digest.update(digestSecond);
+ digestFirst.put(digest.digest());
+ digestFirst.flip();
+
+ long G = ((long)((0x000000FF & ((int)digestFirst.get(24))) << 24 |
+ (0x000000FF & ((int)digestFirst.get(25))) << 16 |
+ (0x000000FF & ((int)digestFirst.get(26))) << 8 |
+ (0x000000FF & ((int)digestFirst.get(27))))) & 0xFFFFFFFFL;
+
+ if(G <= currentWork.target[6]) {
+ System.out.println("\rBlock " + currentBlocks + " found on " + deviceName + " at " +
+ DateFormat.getTimeInstance(DateFormat.MEDIUM).format(new Date()));
+
+ currentWork.sendWork(bufferInt.get((i * 2) + 1));
+ currentWork.lastPull = now;
+
+ currentBlocks++;
+ }
+
+ bufferInt.put(i * 2, 1);
+ reset = true;
+ }
+ }
+
+ if(currentWork.lastPull + 5000 < now) {
+ currentWork.getWork();
+ currentWork.lastPull = now;
+ }
+
+ System.arraycopy(currentWork.state, 0, state2, 0, 8);
+
+ sharound(state2, 0, 1, 2, 3, 4, 5, 6, 7, currentWork.block[16], 0x428A2F98);
+ sharound(state2, 7, 0, 1, 2, 3, 4, 5, 6, currentWork.block[17], 0x71374491);
+ sharound(state2, 6, 7, 0, 1, 2, 3, 4, 5, currentWork.block[18], 0xB5C0FBCF);
+
+ kernel.setArg(0, currentWork.block[16])
+ .setArg(1, currentWork.block[17])
+ .setArg(2, currentWork.block[18])
+ .setArg(3, currentWork.state[0])
+ .setArg(4, currentWork.state[1])
+ .setArg(5, currentWork.state[2])
+ .setArg(6, currentWork.state[3])
+ .setArg(7, currentWork.state[4])
+ .setArg(8, currentWork.state[5])
+ .setArg(9, currentWork.state[6])
+ .setArg(10, currentWork.state[7])
+ .setArg(11, state2[1])
+ .setArg(12, state2[2])
+ .setArg(13, state2[3])
+ .setArg(14, state2[5])
+ .setArg(15, state2[6])
+ .setArg(16, state2[7])
+ .setArg(17, base)
+ .setArg(18, output);
+
+ if(reset) {
+ CL10.clEnqueueWriteBuffer(queue, output, CL10.CL_FALSE, 0, buffer, null, eventPointer1);
+ CL10.clEnqueueNDRangeKernel(queue, kernel, 1, null, workSize, localWorkSize, eventPointer1, eventPointer2);
+ CL10.clReleaseEvent(queue.getCLEvent(eventPointer1.get(0)));
+ } else {
+ CL10.clEnqueueNDRangeKernel(queue, kernel, 1, null, workSize, localWorkSize, null, eventPointer2);
+ }
+
+ CL10.clEnqueueReadBuffer(queue, output, CL10.CL_FALSE, 0, buffer, eventPointer2, eventPointer3);
+ event = queue.getCLEvent(eventPointer3.get(0));
+
+ hashCount += workSize.get(0) * vectorWidth;
+ base += workSize.get(0);
+
+ CL10.clReleaseEvent(queue.getCLEvent(eventPointer2.get(0)));
+
+ CL11.clSetEventCallback(event, CL10.CL_COMPLETE, this);
+ CL10.clFlush(queue);
+ }
+
+ @Override
+ protected void handleMessage(CLEvent event, int event_command_exec_status) {
+ if(event_command_exec_status == CL10.CL_SUCCESS)
+ try {
+ this.checkExecution();
+ } catch (IOException e) {}
+ }
+ }
+ }
+
+ class GetWorkParser {
+ final int[] block = new int[32];
+ final int[] state = new int[8];
+ final long[] target = new long[8];
+ int extraNonce = 0;
+
+ final ObjectMapper mapper = new ObjectMapper();
+ final ObjectNode getworkMessage;
+
+ double lastPull = 0;
+
+ GetWorkParser() throws IOException {
+ getworkMessage = mapper.createObjectNode();
+ getworkMessage.put("method", "getwork");
+ getworkMessage.putArray("params");
+ getworkMessage.put("id", 1);
+
+ getWork();
+ }
+
+ void getWork() throws IOException {
+ parse(doJSONRPC(bitcoind, userPass, mapper, getworkMessage));
+ }
+
+ void sendWork(int nonce) throws IOException {
+ block[19] = nonce;
+
+ ObjectNode sendworkMessage = mapper.createObjectNode();
+ sendworkMessage.put("method", "getwork");
+ ArrayNode params = sendworkMessage.putArray("params");
+ params.add(extraNonce);
+ params.add(encodeBlock());
+ sendworkMessage.put("id", 1);
+
+ parse(doJSONRPC(bitcoind, userPass, mapper, sendworkMessage));
+ }
+
+ ObjectNode doJSONRPC(URL bitcoind, String userPassword, ObjectMapper mapper, ObjectNode requestMessage)
+ throws IOException {
+ HttpURLConnection connection = (HttpURLConnection) bitcoind.openConnection();
+ connection.setRequestProperty("Authorization", userPassword);
+ connection.setDoOutput(true);
+
+ OutputStream requestStream = connection.getOutputStream();
+ Writer request = new OutputStreamWriter(requestStream);
+ request.write(requestMessage.toString());
+ request.close();
+ requestStream.close();
+
+ ObjectNode responseMessage = null;
+
+ try {
+ InputStream response = connection.getInputStream();
+ responseMessage = (ObjectNode) mapper.readTree(response);
+ response.close();
+ } catch (IOException e) {
+ InputStream errorStream = connection.getErrorStream();
+ byte[] error = new byte[1024];
+ errorStream.read(error);
+
+ IOException e2 = new IOException("Failed to communicate with bitcoind: " + new String(error).trim());
+ e2.setStackTrace(e.getStackTrace());
+
+ throw e2;
+ }
+
+ return (ObjectNode) responseMessage.get("result");
+ }
+
+ void parse(ObjectNode responseMessage) {
+ String blocks = responseMessage.get("block").getValueAsText();
+ String states = responseMessage.get("state").getValueAsText();
+ String targets = responseMessage.get("target").getValueAsText();
+ extraNonce = responseMessage.get("extraNonce").getValueAsInt();
+
+ for(int i = 0; i < block.length; i++) {
+ String parse = blocks.substring(i*8, (i*8)+8);
+ block[i] = Integer.reverseBytes((int)Long.parseLong(parse, 16));
+ }
+
+ for(int i = 0; i < state.length; i++) {
+ String parse = states.substring(i*8, (i*8)+8);
+ state[i] = Integer.reverseBytes((int)Long.parseLong(parse, 16));
+ }
+
+ for(int i = 0; i < target.length; i++) {
+ String parse = targets.substring(i*8, (i*8)+8);
+ target[i] = (Long.reverseBytes(Long.parseLong(parse, 16) << 16)) >>> 16;
+ }
+ }
+
+ String encodeBlock() {
+ StringBuilder builder = new StringBuilder();
+
+ for(int b : block)
+ builder.append(String.format("%08x", Integer.reverseBytes(b)));
+
+ return builder.toString();
+ }
+ }
+}
212 src/main/resources/DiabloMiner.cl
@@ -0,0 +1,212 @@
+#define rot(x, y) rotate(x, (uintv)y)
+
+#define R(x) (work[x] = (rot(work[x-2],15)^rot(work[x-2],13)^((work[x-2])>>10)) + work[x-7] + (rot(work[x-15],25)^rot(work[x-15],14)^((work[x-15])>>3)) + work[x-16])
+#define sharound(a,b,c,d,e,f,g,h,x,K) {h=(h+(rot(e, 26)^rot(e, 21)^rot(e, 7))+(g^(e&(f^g)))+K+x); t1=(rot(a, 30)^rot(a, 19)^rot(a, 10))+((a&b)|(c&(a|b))); d+=h; h+=t1;}
+
+__kernel __attribute__((vec_type_hint(uintv))) $forcelocalsize void search(
+ const uint block0, const uint block1, const uint block2,
+ const uint state0, const uint state1, const uint state2, const uint state3,
+ const uint state4, const uint state5, const uint state6, const uint state7,
+ const uint B1, const uint C1, const uint D1,
+ const uint F1, const uint G1, const uint H1,
+ const uint base,
+ __global uint * output)
+{
+ uint nonce = base + get_global_id(0);
+ uintv ns = $ns;
+
+ uintv work[64];
+ uintv A,B,C,D,E,F,G,H;
+ uintv t1;
+
+ A=state0;
+ B=B1;
+ C=C1;
+ D=D1;
+ E=state4;
+ F=F1;
+ G=G1;
+ H=H1;
+
+ work[0]=block0;
+ work[1]=block1;
+ work[2]=block2;
+ work[3]=ns;
+ work[4]=0x80000000;
+ work[5]=0x00000000;
+ work[6]=0x00000000;
+ work[7]=0x00000000;
+ work[8]=0x00000000;
+ work[9]=0x00000000;
+ work[10]=0x00000000;
+ work[11]=0x00000000;
+ work[12]=0x00000000;
+ work[13]=0x00000000;
+ work[14]=0x00000000;
+ work[15]=0x00000280;
+
+ // first 3 rounds already done
+ //sharound(A,B,C,D,E,F,G,H,work[0],0x428A2F98);
+ //sharound(H,A,B,C,D,E,F,G,work[1],0x71374491);
+ //sharound(G,H,A,B,C,D,E,F,work[2],0xB5C0FBCF);
+ sharound(F,G,H,A,B,C,D,E,work[3],0xE9B5DBA5);
+ sharound(E,F,G,H,A,B,C,D,work[4],0x3956C25B);
+ sharound(D,E,F,G,H,A,B,C,work[5],0x59F111F1);
+ sharound(C,D,E,F,G,H,A,B,work[6],0x923F82A4);
+ sharound(B,C,D,E,F,G,H,A,work[7],0xAB1C5ED5);
+ sharound(A,B,C,D,E,F,G,H,work[8],0xD807AA98);
+ sharound(H,A,B,C,D,E,F,G,work[9],0x12835B01);
+ sharound(G,H,A,B,C,D,E,F,work[10],0x243185BE);
+ sharound(F,G,H,A,B,C,D,E,work[11],0x550C7DC3);
+ sharound(E,F,G,H,A,B,C,D,work[12],0x72BE5D74);
+ sharound(D,E,F,G,H,A,B,C,work[13],0x80DEB1FE);
+ sharound(C,D,E,F,G,H,A,B,work[14],0x9BDC06A7);
+ sharound(B,C,D,E,F,G,H,A,work[15],0xC19BF174);
+ sharound(A,B,C,D,E,F,G,H,R(16),0xE49B69C1);
+ sharound(H,A,B,C,D,E,F,G,R(17),0xEFBE4786);
+ sharound(G,H,A,B,C,D,E,F,R(18),0x0FC19DC6);
+ sharound(F,G,H,A,B,C,D,E,R(19),0x240CA1CC);
+ sharound(E,F,G,H,A,B,C,D,R(20),0x2DE92C6F);
+ sharound(D,E,F,G,H,A,B,C,R(21),0x4A7484AA);
+ sharound(C,D,E,F,G,H,A,B,R(22),0x5CB0A9DC);
+ sharound(B,C,D,E,F,G,H,A,R(23),0x76F988DA);
+ sharound(A,B,C,D,E,F,G,H,R(24),0x983E5152);
+ sharound(H,A,B,C,D,E,F,G,R(25),0xA831C66D);
+ sharound(G,H,A,B,C,D,E,F,R(26),0xB00327C8);
+ sharound(F,G,H,A,B,C,D,E,R(27),0xBF597FC7);
+ sharound(E,F,G,H,A,B,C,D,R(28),0xC6E00BF3);
+ sharound(D,E,F,G,H,A,B,C,R(29),0xD5A79147);
+ sharound(C,D,E,F,G,H,A,B,R(30),0x06CA6351);
+ sharound(B,C,D,E,F,G,H,A,R(31),0x14292967);
+ sharound(A,B,C,D,E,F,G,H,R(32),0x27B70A85);
+ sharound(H,A,B,C,D,E,F,G,R(33),0x2E1B2138);
+ sharound(G,H,A,B,C,D,E,F,R(34),0x4D2C6DFC);
+ sharound(F,G,H,A,B,C,D,E,R(35),0x53380D13);
+ sharound(E,F,G,H,A,B,C,D,R(36),0x650A7354);
+ sharound(D,E,F,G,H,A,B,C,R(37),0x766A0ABB);
+ sharound(C,D,E,F,G,H,A,B,R(38),0x81C2C92E);
+ sharound(B,C,D,E,F,G,H,A,R(39),0x92722C85);
+ sharound(A,B,C,D,E,F,G,H,R(40),0xA2BFE8A1);
+ sharound(H,A,B,C,D,E,F,G,R(41),0xA81A664B);
+ sharound(G,H,A,B,C,D,E,F,R(42),0xC24B8B70);
+ sharound(F,G,H,A,B,C,D,E,R(43),0xC76C51A3);
+ sharound(E,F,G,H,A,B,C,D,R(44),0xD192E819);
+ sharound(D,E,F,G,H,A,B,C,R(45),0xD6990624);
+ sharound(C,D,E,F,G,H,A,B,R(46),0xF40E3585);
+ sharound(B,C,D,E,F,G,H,A,R(47),0x106AA070);
+ sharound(A,B,C,D,E,F,G,H,R(48),0x19A4C116);
+ sharound(H,A,B,C,D,E,F,G,R(49),0x1E376C08);
+ sharound(G,H,A,B,C,D,E,F,R(50),0x2748774C);
+ sharound(F,G,H,A,B,C,D,E,R(51),0x34B0BCB5);
+ sharound(E,F,G,H,A,B,C,D,R(52),0x391C0CB3);
+ sharound(D,E,F,G,H,A,B,C,R(53),0x4ED8AA4A);
+ sharound(C,D,E,F,G,H,A,B,R(54),0x5B9CCA4F);
+ sharound(B,C,D,E,F,G,H,A,R(55),0x682E6FF3);
+ sharound(A,B,C,D,E,F,G,H,R(56),0x748F82EE);
+ sharound(H,A,B,C,D,E,F,G,R(57),0x78A5636F);
+ sharound(G,H,A,B,C,D,E,F,R(58),0x84C87814);
+ sharound(F,G,H,A,B,C,D,E,R(59),0x8CC70208);
+ sharound(E,F,G,H,A,B,C,D,R(60),0x90BEFFFA);
+ sharound(D,E,F,G,H,A,B,C,R(61),0xA4506CEB);
+ sharound(C,D,E,F,G,H,A,B,R(62),0xBEF9A3F7);
+ sharound(B,C,D,E,F,G,H,A,R(63),0xC67178F2);
+
+ // hash the hash now
+
+ work[0]=state0+A;
+ work[1]=state1+B;
+ work[2]=state2+C;
+ work[3]=state3+D;
+ work[4]=state4+E;
+ work[5]=state5+F;
+ work[6]=state6+G;
+ work[7]=state7+H;
+ work[8]=0x80000000;
+ work[9]=0x00000000;
+ work[10]=0x00000000;
+ work[11]=0x00000000;
+ work[12]=0x00000000;
+ work[13]=0x00000000;
+ work[14]=0x00000000;
+ work[15]=0x00000100;
+
+ A=0x6a09e667;
+ B=0xbb67ae85;
+ C=0x3c6ef372;
+ D=0xa54ff53a;
+ E=0x510e527f;
+ F=0x9b05688c;
+ G=0x1f83d9ab;
+ H=0x5be0cd19;
+
+ sharound(A,B,C,D,E,F,G,H,work[0],0x428A2F98);
+ sharound(H,A,B,C,D,E,F,G,work[1],0x71374491);
+ sharound(G,H,A,B,C,D,E,F,work[2],0xB5C0FBCF);
+ sharound(F,G,H,A,B,C,D,E,work[3],0xE9B5DBA5);
+ sharound(E,F,G,H,A,B,C,D,work[4],0x3956C25B);
+ sharound(D,E,F,G,H,A,B,C,work[5],0x59F111F1);
+ sharound(C,D,E,F,G,H,A,B,work[6],0x923F82A4);
+ sharound(B,C,D,E,F,G,H,A,work[7],0xAB1C5ED5);
+ sharound(A,B,C,D,E,F,G,H,work[8],0xD807AA98);
+ sharound(H,A,B,C,D,E,F,G,work[9],0x12835B01);
+ sharound(G,H,A,B,C,D,E,F,work[10],0x243185BE);
+ sharound(F,G,H,A,B,C,D,E,work[11],0x550C7DC3);
+ sharound(E,F,G,H,A,B,C,D,work[12],0x72BE5D74);
+ sharound(D,E,F,G,H,A,B,C,work[13],0x80DEB1FE);
+ sharound(C,D,E,F,G,H,A,B,work[14],0x9BDC06A7);
+ sharound(B,C,D,E,F,G,H,A,work[15],0xC19BF174);
+ sharound(A,B,C,D,E,F,G,H,R(16),0xE49B69C1);
+ sharound(H,A,B,C,D,E,F,G,R(17),0xEFBE4786);
+ sharound(G,H,A,B,C,D,E,F,R(18),0x0FC19DC6);
+ sharound(F,G,H,A,B,C,D,E,R(19),0x240CA1CC);
+ sharound(E,F,G,H,A,B,C,D,R(20),0x2DE92C6F);
+ sharound(D,E,F,G,H,A,B,C,R(21),0x4A7484AA);
+ sharound(C,D,E,F,G,H,A,B,R(22),0x5CB0A9DC);
+ sharound(B,C,D,E,F,G,H,A,R(23),0x76F988DA);
+ sharound(A,B,C,D,E,F,G,H,R(24),0x983E5152);
+ sharound(H,A,B,C,D,E,F,G,R(25),0xA831C66D);
+ sharound(G,H,A,B,C,D,E,F,R(26),0xB00327C8);
+ sharound(F,G,H,A,B,C,D,E,R(27),0xBF597FC7);
+ sharound(E,F,G,H,A,B,C,D,R(28),0xC6E00BF3);
+ sharound(D,E,F,G,H,A,B,C,R(29),0xD5A79147);
+ sharound(C,D,E,F,G,H,A,B,R(30),0x06CA6351);
+ sharound(B,C,D,E,F,G,H,A,R(31),0x14292967);
+ sharound(A,B,C,D,E,F,G,H,R(32),0x27B70A85);
+ sharound(H,A,B,C,D,E,F,G,R(33),0x2E1B2138);
+ sharound(G,H,A,B,C,D,E,F,R(34),0x4D2C6DFC);
+ sharound(F,G,H,A,B,C,D,E,R(35),0x53380D13);
+ sharound(E,F,G,H,A,B,C,D,R(36),0x650A7354);
+ sharound(D,E,F,G,H,A,B,C,R(37),0x766A0ABB);
+ sharound(C,D,E,F,G,H,A,B,R(38),0x81C2C92E);
+ sharound(B,C,D,E,F,G,H,A,R(39),0x92722C85);
+ sharound(A,B,C,D,E,F,G,H,R(40),0xA2BFE8A1);
+ sharound(H,A,B,C,D,E,F,G,R(41),0xA81A664B);
+ sharound(G,H,A,B,C,D,E,F,R(42),0xC24B8B70);
+ sharound(F,G,H,A,B,C,D,E,R(43),0xC76C51A3);
+ sharound(E,F,G,H,A,B,C,D,R(44),0xD192E819);
+ sharound(D,E,F,G,H,A,B,C,R(45),0xD6990624);
+ sharound(C,D,E,F,G,H,A,B,R(46),0xF40E3585);
+ sharound(B,C,D,E,F,G,H,A,R(47),0x106AA070);
+ sharound(A,B,C,D,E,F,G,H,R(48),0x19A4C116);
+ sharound(H,A,B,C,D,E,F,G,R(49),0x1E376C08);
+ sharound(G,H,A,B,C,D,E,F,R(50),0x2748774C);
+ sharound(F,G,H,A,B,C,D,E,R(51),0x34B0BCB5);
+ sharound(E,F,G,H,A,B,C,D,R(52),0x391C0CB3);
+ sharound(D,E,F,G,H,A,B,C,R(53),0x4ED8AA4A);
+ sharound(C,D,E,F,G,H,A,B,R(54),0x5B9CCA4F);
+ sharound(B,C,D,E,F,G,H,A,R(55),0x682E6FF3);
+ sharound(A,B,C,D,E,F,G,H,R(56),0x748F82EE);
+ sharound(H,A,B,C,D,E,F,G,R(57),0x78A5636F);
+ sharound(G,H,A,B,C,D,E,F,R(58),0x84C87814);
+ sharound(F,G,H,A,B,C,D,E,R(59),0x8CC70208);
+ sharound(E,F,G,H,A,B,C,D,R(60),0x90BEFFFA);
+ //we don't need to do these last 3 rounds as they update G, C, F, B, E and A, but we only care about H
+ //sharound(D,E,F,G,H,A,B,C,R(61),0xA4506CEB);
+ //sharound(C,D,E,F,G,H,A,B,R(62),0xBEF9A3F7);
+ //sharound(B,C,D,E,F,G,H,A,R(63),0xC67178F2);
+
+ H += 0x5be0cd19;
+
+ $checkOutput
+}
+// end

0 comments on commit c2d5a8e

Please sign in to comment.