├── .gitignore
├── .idea
├── .gitignore
├── deployment.xml
├── misc.xml
├── modules.xml
├── sushiswap.iml
├── vcs.xml
└── webServers.xml
├── LICENSE
├── README.md
├── contracts
├── Migrations.sol
└── bscswap
│ ├── BSCswapBEP20.sol
│ ├── BSCswapFactory.sol
│ ├── BSCswapPair.sol
│ ├── BSCswapRouter.sol
│ ├── LICENSE
│ ├── README.md
│ ├── interfaces
│ ├── IBEP20.sol
│ ├── IBSCswapBEP20.sol
│ ├── IBSCswapCallee.sol
│ ├── IBSCswapFactory.sol
│ ├── IBSCswapPair.sol
│ ├── IBSCswapRouter01.sol
│ ├── IBSCswapRouter02.sol
│ └── IWBNB.sol
│ └── libraries
│ ├── BSCswapLibrary.sol
│ ├── Math.sol
│ ├── SafeMath.sol
│ ├── TransferHelper.sol
│ └── UQ112x112.sol
├── migrations
├── 1_initial_migration.js
└── 2_deploy_contracts.js
├── package-lock.json
├── package.json
├── truffle-config.js
└── yarn.lock
/.gitignore:
--------------------------------------------------------------------------------
1 | /node_modules/
2 | /build/
3 | ./truffle-config.js
--------------------------------------------------------------------------------
/.idea/.gitignore:
--------------------------------------------------------------------------------
1 | # Default ignored files
2 | /workspace.xml
3 |
--------------------------------------------------------------------------------
/.idea/deployment.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
9 |
10 |
11 |
12 |
13 |
14 |
--------------------------------------------------------------------------------
/.idea/misc.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
--------------------------------------------------------------------------------
/.idea/modules.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
--------------------------------------------------------------------------------
/.idea/sushiswap.iml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
7 |
8 |
--------------------------------------------------------------------------------
/.idea/vcs.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 |
6 |
--------------------------------------------------------------------------------
/.idea/webServers.xml:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
14 |
15 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # SwapLiquidity
2 |
3 | https://swapliquidity.org. Feel free to read the code. More details coming soon.
4 |
5 | ## Deployed Contracts / Hash
6 |
7 |
8 | - (Uni|SwapLiquidity)BSCswapFactory - https://bscscan.com/address/0x553990F2CBA90272390f62C5BDb1681fFc899675
9 | - (Uni|SwapLiquidity)BSCswapRouter - https://bscscan.com/address/0xbd67d157502A23309Db761c41965600c2Ec788b2
10 | - (Uni|SwapLiquidity)BSCswapPair init code hash - `b1e98e21a5335633815a8cfb3b580071c2e4561c50afd57a8746def9ed890b18`
11 |
12 |
13 | ## License
14 | GPL
--------------------------------------------------------------------------------
/contracts/Migrations.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: MIT
2 | pragma solidity >=0.4.25 <0.7.0;
3 |
4 | contract Migrations {
5 | address public owner;
6 | uint public last_completed_migration;
7 |
8 | modifier restricted() {
9 | if (msg.sender == owner) _;
10 | }
11 |
12 | constructor() public {
13 | owner = msg.sender;
14 | }
15 |
16 | function setCompleted(uint completed) public restricted {
17 | last_completed_migration = completed;
18 | }
19 | }
20 |
--------------------------------------------------------------------------------
/contracts/bscswap/BSCswapBEP20.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 | import './libraries/SafeMath.sol';
6 |
7 | contract BSCswapBEP20 {
8 | using SafeMathBSCswap for uint;
9 |
10 | string public constant name = 'SwapLiquidity LP Token';
11 | string public constant symbol = 'SLP';
12 | uint8 public constant decimals = 18;
13 | uint public totalSupply;
14 | mapping(address => uint) public balanceOf;
15 | mapping(address => mapping(address => uint)) public allowance;
16 |
17 | bytes32 public DOMAIN_SEPARATOR;
18 | // keccak256("Permit(address owner,address spender,uint256 value,uint256 nonce,uint256 deadline)");
19 | bytes32 public constant PERMIT_TYPEHASH = 0x6e71edae12b1b97f4d1f60370fef10105fa2faae0126114a169c64845d6126c9;
20 | mapping(address => uint) public nonces;
21 |
22 | event Approval(address indexed owner, address indexed spender, uint value);
23 | event Transfer(address indexed from, address indexed to, uint value);
24 |
25 | constructor() public {
26 | uint chainId;
27 | assembly {
28 | chainId := chainid()
29 | }
30 | DOMAIN_SEPARATOR = keccak256(
31 | abi.encode(
32 | keccak256('EIP712Domain(string name,string version,uint256 chainId,address verifyingContract)'),
33 | keccak256(bytes(name)),
34 | keccak256(bytes('1')),
35 | chainId,
36 | address(this)
37 | )
38 | );
39 | }
40 |
41 | function _mint(address to, uint value) internal {
42 | totalSupply = totalSupply.add(value);
43 | balanceOf[to] = balanceOf[to].add(value);
44 | emit Transfer(address(0), to, value);
45 | }
46 |
47 | function _burn(address from, uint value) internal {
48 | balanceOf[from] = balanceOf[from].sub(value);
49 | totalSupply = totalSupply.sub(value);
50 | emit Transfer(from, address(0), value);
51 | }
52 |
53 | function _approve(address owner, address spender, uint value) private {
54 | allowance[owner][spender] = value;
55 | emit Approval(owner, spender, value);
56 | }
57 |
58 | function _transfer(address from, address to, uint value) private {
59 | balanceOf[from] = balanceOf[from].sub(value);
60 | balanceOf[to] = balanceOf[to].add(value);
61 | emit Transfer(from, to, value);
62 | }
63 |
64 | function approve(address spender, uint value) external returns (bool) {
65 | _approve(msg.sender, spender, value);
66 | return true;
67 | }
68 |
69 | function transfer(address to, uint value) external returns (bool) {
70 | _transfer(msg.sender, to, value);
71 | return true;
72 | }
73 |
74 | function transferFrom(address from, address to, uint value) external returns (bool) {
75 | if (allowance[from][msg.sender] != uint(-1)) {
76 | allowance[from][msg.sender] = allowance[from][msg.sender].sub(value);
77 | }
78 | _transfer(from, to, value);
79 | return true;
80 | }
81 |
82 | function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external {
83 | require(deadline >= block.timestamp, 'BSCswap: EXPIRED');
84 | bytes32 digest = keccak256(
85 | abi.encodePacked(
86 | '\x19\x01',
87 | DOMAIN_SEPARATOR,
88 | keccak256(abi.encode(PERMIT_TYPEHASH, owner, spender, value, nonces[owner]++, deadline))
89 | )
90 | );
91 | address recoveredAddress = ecrecover(digest, v, r, s);
92 | require(recoveredAddress != address(0) && recoveredAddress == owner, 'BSCswap: INVALID_SIGNATURE');
93 | _approve(owner, spender, value);
94 | }
95 | }
96 |
--------------------------------------------------------------------------------
/contracts/bscswap/BSCswapFactory.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 | import './interfaces/IBSCswapFactory.sol';
6 | import './BSCswapPair.sol';
7 |
8 | contract BSCswapFactory is IBSCswapFactory {
9 | address public override feeTo;
10 | address public override feeToSetter;
11 | address public override migrator;
12 |
13 | mapping(address => mapping(address => address)) public override getPair;
14 | address[] public override allPairs;
15 |
16 | event PairCreated(address indexed token0, address indexed token1, address pair, uint);
17 |
18 | constructor(address _feeToSetter) public {
19 | feeToSetter = _feeToSetter;
20 | }
21 |
22 | function allPairsLength() external override view returns (uint) {
23 | return allPairs.length;
24 | }
25 |
26 | function pairCodeHash() external pure returns (bytes32) {
27 | return keccak256(type(BSCswapPair).creationCode);
28 | }
29 |
30 | function createPair(address tokenA, address tokenB) external override returns (address pair) {
31 | require(tokenA != tokenB, 'BSCswap: IDENTICAL_ADDRESSES');
32 | (address token0, address token1) = tokenA < tokenB ? (tokenA, tokenB) : (tokenB, tokenA);
33 | require(token0 != address(0), 'BSCswap: ZERO_ADDRESS');
34 | require(getPair[token0][token1] == address(0), 'BSCswap: PAIR_EXISTS'); // single check is sufficient
35 | bytes memory bytecode = type(BSCswapPair).creationCode;
36 | bytes32 salt = keccak256(abi.encodePacked(token0, token1));
37 | assembly {
38 | pair := create2(0, add(bytecode, 32), mload(bytecode), salt)
39 | }
40 | BSCswapPair(pair).initialize(token0, token1);
41 | getPair[token0][token1] = pair;
42 | getPair[token1][token0] = pair; // populate mapping in the reverse direction
43 | allPairs.push(pair);
44 | emit PairCreated(token0, token1, pair, allPairs.length);
45 | }
46 |
47 | function setFeeTo(address _feeTo) external override {
48 | require(msg.sender == feeToSetter, 'BSCswap: FORBIDDEN');
49 | feeTo = _feeTo;
50 | }
51 |
52 | function setMigrator(address _migrator) external override {
53 | require(msg.sender == feeToSetter, 'BSCswap: FORBIDDEN');
54 | migrator = _migrator;
55 | }
56 |
57 | function setFeeToSetter(address _feeToSetter) external override {
58 | require(msg.sender == feeToSetter, 'BSCswap: FORBIDDEN');
59 | feeToSetter = _feeToSetter;
60 | }
61 |
62 | }
63 |
--------------------------------------------------------------------------------
/contracts/bscswap/BSCswapPair.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 | import './BSCswapBEP20.sol';
6 | import './libraries/Math.sol';
7 | import './libraries/UQ112x112.sol';
8 | import './interfaces/IBEP20.sol';
9 | import './interfaces/IBSCswapFactory.sol';
10 | import './interfaces/IBSCswapCallee.sol';
11 |
12 |
13 | interface IMigrator {
14 | // Return the desired amount of liquidity token that the migrator wants.
15 | function desiredLiquidity() external view returns (uint256);
16 | }
17 |
18 | contract BSCswapPair is BSCswapBEP20 {
19 | using SafeMathBSCswap for uint;
20 | using UQ112x112 for uint224;
21 |
22 | uint public constant MINIMUM_LIQUIDITY = 10**3;
23 | bytes4 private constant SELECTOR = bytes4(keccak256(bytes('transfer(address,uint256)')));
24 |
25 | address public factory;
26 | address public token0;
27 | address public token1;
28 |
29 | uint112 private reserve0; // uses single storage slot, accessible via getReserves
30 | uint112 private reserve1; // uses single storage slot, accessible via getReserves
31 | uint32 private blockTimestampLast; // uses single storage slot, accessible via getReserves
32 |
33 | uint public price0CumulativeLast;
34 | uint public price1CumulativeLast;
35 | uint public kLast; // reserve0 * reserve1, as of immediately after the most recent liquidity event
36 |
37 | uint private unlocked = 1;
38 | modifier lock() {
39 | require(unlocked == 1, 'BSCswap: LOCKED');
40 | unlocked = 0;
41 | _;
42 | unlocked = 1;
43 | }
44 |
45 | function getReserves() public view returns (uint112 _reserve0, uint112 _reserve1, uint32 _blockTimestampLast) {
46 | _reserve0 = reserve0;
47 | _reserve1 = reserve1;
48 | _blockTimestampLast = blockTimestampLast;
49 | }
50 |
51 | function _safeTransfer(address token, address to, uint value) private {
52 | (bool success, bytes memory data) = token.call(abi.encodeWithSelector(SELECTOR, to, value));
53 | require(success && (data.length == 0 || abi.decode(data, (bool))), 'BSCswap: TRANSFER_FAILED');
54 | }
55 |
56 | event Mint(address indexed sender, uint amount0, uint amount1);
57 | event Burn(address indexed sender, uint amount0, uint amount1, address indexed to);
58 | event Swap(
59 | address indexed sender,
60 | uint amount0In,
61 | uint amount1In,
62 | uint amount0Out,
63 | uint amount1Out,
64 | address indexed to
65 | );
66 | event Sync(uint112 reserve0, uint112 reserve1);
67 |
68 | constructor() public {
69 | factory = msg.sender;
70 | }
71 |
72 | // called once by the factory at time of deployment
73 | function initialize(address _token0, address _token1) external {
74 | require(msg.sender == factory, 'BSCswap: FORBIDDEN'); // sufficient check
75 | token0 = _token0;
76 | token1 = _token1;
77 | }
78 |
79 | // update reserves and, on the first call per block, price accumulators
80 | function _update(uint balance0, uint balance1, uint112 _reserve0, uint112 _reserve1) private {
81 | require(balance0 <= uint112(-1) && balance1 <= uint112(-1), 'BSCswap: OVERFLOW');
82 | uint32 blockTimestamp = uint32(block.timestamp % 2**32);
83 | uint32 timeElapsed = blockTimestamp - blockTimestampLast; // overflow is desired
84 | if (timeElapsed > 0 && _reserve0 != 0 && _reserve1 != 0) {
85 | // * never overflows, and + overflow is desired
86 | price0CumulativeLast += uint(UQ112x112.encode(_reserve1).uqdiv(_reserve0)) * timeElapsed;
87 | price1CumulativeLast += uint(UQ112x112.encode(_reserve0).uqdiv(_reserve1)) * timeElapsed;
88 | }
89 | reserve0 = uint112(balance0);
90 | reserve1 = uint112(balance1);
91 | blockTimestampLast = blockTimestamp;
92 | emit Sync(reserve0, reserve1);
93 | }
94 |
95 | // if fee is on, mint liquidity equivalent to 1/6th of the growth in sqrt(k)
96 | function _mintFee(uint112 _reserve0, uint112 _reserve1) private returns (bool feeOn) {
97 | address feeTo = IBSCswapFactory(factory).feeTo();
98 | feeOn = feeTo != address(0);
99 | uint _kLast = kLast; // gas savings
100 | if (feeOn) {
101 | if (_kLast != 0) {
102 | uint rootK = Math.sqrt(uint(_reserve0).mul(_reserve1));
103 | uint rootKLast = Math.sqrt(_kLast);
104 | if (rootK > rootKLast) {
105 | uint numerator = totalSupply.mul(rootK.sub(rootKLast));
106 | uint denominator = rootK.mul(5).add(rootKLast);
107 | uint liquidity = numerator / denominator;
108 | if (liquidity > 0) _mint(feeTo, liquidity);
109 | }
110 | }
111 | } else if (_kLast != 0) {
112 | kLast = 0;
113 | }
114 | }
115 |
116 | // this low-level function should be called from a contract which performs important safety checks
117 | function mint(address to) external lock returns (uint liquidity) {
118 | (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings
119 | uint balance0 = IBEP20BSCswap(token0).balanceOf(address(this));
120 | uint balance1 = IBEP20BSCswap(token1).balanceOf(address(this));
121 | uint amount0 = balance0.sub(_reserve0);
122 | uint amount1 = balance1.sub(_reserve1);
123 |
124 | bool feeOn = _mintFee(_reserve0, _reserve1);
125 | uint _totalSupply = totalSupply; // gas savings, must be defined here since totalSupply can update in _mintFee
126 | if (_totalSupply == 0) {
127 | address migrator = IBSCswapFactory(factory).migrator();
128 | if (msg.sender == migrator) {
129 | liquidity = IMigrator(migrator).desiredLiquidity();
130 | require(liquidity > 0 && liquidity != uint256(-1), "Bad desired liquidity");
131 | } else {
132 | require(migrator == address(0), "Must not have migrator");
133 | liquidity = Math.sqrt(amount0.mul(amount1)).sub(MINIMUM_LIQUIDITY);
134 | _mint(address(0), MINIMUM_LIQUIDITY); // permanently lock the first MINIMUM_LIQUIDITY tokens
135 | }
136 | } else {
137 | liquidity = Math.min(amount0.mul(_totalSupply) / _reserve0, amount1.mul(_totalSupply) / _reserve1);
138 | }
139 | require(liquidity > 0, 'BSCswap: INSUFFICIENT_LIQUIDITY_MINTED');
140 | _mint(to, liquidity);
141 |
142 | _update(balance0, balance1, _reserve0, _reserve1);
143 | if (feeOn) kLast = uint(reserve0).mul(reserve1); // reserve0 and reserve1 are up-to-date
144 | emit Mint(msg.sender, amount0, amount1);
145 | }
146 |
147 | // this low-level function should be called from a contract which performs important safety checks
148 | function burn(address to) external lock returns (uint amount0, uint amount1) {
149 | (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings
150 | address _token0 = token0; // gas savings
151 | address _token1 = token1; // gas savings
152 | uint balance0 = IBEP20BSCswap(_token0).balanceOf(address(this));
153 | uint balance1 = IBEP20BSCswap(_token1).balanceOf(address(this));
154 | uint liquidity = balanceOf[address(this)];
155 |
156 | bool feeOn = _mintFee(_reserve0, _reserve1);
157 | uint _totalSupply = totalSupply; // gas savings, must be defined here since totalSupply can update in _mintFee
158 | amount0 = liquidity.mul(balance0) / _totalSupply; // using balances ensures pro-rata distribution
159 | amount1 = liquidity.mul(balance1) / _totalSupply; // using balances ensures pro-rata distribution
160 | require(amount0 > 0 && amount1 > 0, 'BSCswap: INSUFFICIENT_LIQUIDITY_BURNED');
161 | _burn(address(this), liquidity);
162 | _safeTransfer(_token0, to, amount0);
163 | _safeTransfer(_token1, to, amount1);
164 | balance0 = IBEP20BSCswap(_token0).balanceOf(address(this));
165 | balance1 = IBEP20BSCswap(_token1).balanceOf(address(this));
166 |
167 | _update(balance0, balance1, _reserve0, _reserve1);
168 | if (feeOn) kLast = uint(reserve0).mul(reserve1); // reserve0 and reserve1 are up-to-date
169 | emit Burn(msg.sender, amount0, amount1, to);
170 | }
171 |
172 | // this low-level function should be called from a contract which performs important safety checks
173 | function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external lock {
174 | require(amount0Out > 0 || amount1Out > 0, 'BSCswap: INSUFFICIENT_OUTPUT_AMOUNT');
175 | (uint112 _reserve0, uint112 _reserve1,) = getReserves(); // gas savings
176 | require(amount0Out < _reserve0 && amount1Out < _reserve1, 'BSCswap: INSUFFICIENT_LIQUIDITY');
177 |
178 | uint balance0;
179 | uint balance1;
180 | { // scope for _token{0,1}, avoids stack too deep errors
181 | address _token0 = token0;
182 | address _token1 = token1;
183 | require(to != _token0 && to != _token1, 'BSCswap: INVALID_TO');
184 | if (amount0Out > 0) _safeTransfer(_token0, to, amount0Out); // optimistically transfer tokens
185 | if (amount1Out > 0) _safeTransfer(_token1, to, amount1Out); // optimistically transfer tokens
186 | if (data.length > 0) IBSCswapCallee(to).BSCswapCall(msg.sender, amount0Out, amount1Out, data);
187 | balance0 = IBEP20BSCswap(_token0).balanceOf(address(this));
188 | balance1 = IBEP20BSCswap(_token1).balanceOf(address(this));
189 | }
190 | uint amount0In = balance0 > _reserve0 - amount0Out ? balance0 - (_reserve0 - amount0Out) : 0;
191 | uint amount1In = balance1 > _reserve1 - amount1Out ? balance1 - (_reserve1 - amount1Out) : 0;
192 | require(amount0In > 0 || amount1In > 0, 'BSCswap: INSUFFICIENT_INPUT_AMOUNT');
193 | { // scope for reserve{0,1}Adjusted, avoids stack too deep errors
194 | uint balance0Adjusted = balance0.mul(1000).sub(amount0In.mul(3));
195 | uint balance1Adjusted = balance1.mul(1000).sub(amount1In.mul(3));
196 | require(balance0Adjusted.mul(balance1Adjusted) >= uint(_reserve0).mul(_reserve1).mul(1000**2), 'BSCswap: K');
197 | }
198 |
199 | _update(balance0, balance1, _reserve0, _reserve1);
200 | emit Swap(msg.sender, amount0In, amount1In, amount0Out, amount1Out, to);
201 | }
202 |
203 | // force balances to match reserves
204 | function skim(address to) external lock {
205 | address _token0 = token0; // gas savings
206 | address _token1 = token1; // gas savings
207 | _safeTransfer(_token0, to, IBEP20BSCswap(_token0).balanceOf(address(this)).sub(reserve0));
208 | _safeTransfer(_token1, to, IBEP20BSCswap(_token1).balanceOf(address(this)).sub(reserve1));
209 | }
210 |
211 | // force reserves to match balances
212 | function sync() external lock {
213 | _update(IBEP20BSCswap(token0).balanceOf(address(this)), IBEP20BSCswap(token1).balanceOf(address(this)), reserve0, reserve1);
214 | }
215 | }
216 |
--------------------------------------------------------------------------------
/contracts/bscswap/BSCswapRouter.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 |
6 | import './libraries/BSCswapLibrary.sol';
7 | import './libraries/SafeMath.sol';
8 | import './libraries/TransferHelper.sol';
9 | import './interfaces/IBSCswapRouter02.sol';
10 | import './interfaces/IBSCswapFactory.sol';
11 | import './interfaces/IBEP20.sol';
12 | import './interfaces/IWBNB.sol';
13 |
14 | contract BSCswapRouter is IBSCswapRouter02 {
15 | using SafeMathBSCswap for uint;
16 |
17 | address public immutable override factory;
18 | address public immutable override WBNB;
19 |
20 | modifier ensure(uint deadline) {
21 | require(deadline >= block.timestamp, 'BSCswapRouter: EXPIRED');
22 | _;
23 | }
24 |
25 | constructor(address _factory, address _WBNB) public {
26 | factory = _factory;
27 | WBNB = _WBNB;
28 | }
29 |
30 | receive() external payable {
31 | assert(msg.sender == WBNB); // only accept BNB via fallback from the WBNB contract
32 | }
33 |
34 | // **** ADD LIQUIDITY ****
35 | function _addLiquidity(
36 | address tokenA,
37 | address tokenB,
38 | uint amountADesired,
39 | uint amountBDesired,
40 | uint amountAMin,
41 | uint amountBMin
42 | ) internal virtual returns (uint amountA, uint amountB) {
43 | // create the pair if it doesn't exist yet
44 | if (IBSCswapFactory(factory).getPair(tokenA, tokenB) == address(0)) {
45 | IBSCswapFactory(factory).createPair(tokenA, tokenB);
46 | }
47 | (uint reserveA, uint reserveB) = BSCswapLibrary.getReserves(factory, tokenA, tokenB);
48 | if (reserveA == 0 && reserveB == 0) {
49 | (amountA, amountB) = (amountADesired, amountBDesired);
50 | } else {
51 | uint amountBOptimal = BSCswapLibrary.quote(amountADesired, reserveA, reserveB);
52 | if (amountBOptimal <= amountBDesired) {
53 | require(amountBOptimal >= amountBMin, 'BSCswapRouter: INSUFFICIENT_B_AMOUNT');
54 | (amountA, amountB) = (amountADesired, amountBOptimal);
55 | } else {
56 | uint amountAOptimal = BSCswapLibrary.quote(amountBDesired, reserveB, reserveA);
57 | assert(amountAOptimal <= amountADesired);
58 | require(amountAOptimal >= amountAMin, 'BSCswapRouter: INSUFFICIENT_A_AMOUNT');
59 | (amountA, amountB) = (amountAOptimal, amountBDesired);
60 | }
61 | }
62 | }
63 | function addLiquidity(
64 | address tokenA,
65 | address tokenB,
66 | uint amountADesired,
67 | uint amountBDesired,
68 | uint amountAMin,
69 | uint amountBMin,
70 | address to,
71 | uint deadline
72 | ) external virtual override ensure(deadline) returns (uint amountA, uint amountB, uint liquidity) {
73 | (amountA, amountB) = _addLiquidity(tokenA, tokenB, amountADesired, amountBDesired, amountAMin, amountBMin);
74 | address pair = BSCswapLibrary.pairFor(factory, tokenA, tokenB);
75 | TransferHelper.safeTransferFrom(tokenA, msg.sender, pair, amountA);
76 | TransferHelper.safeTransferFrom(tokenB, msg.sender, pair, amountB);
77 | liquidity = IBSCswapPair(pair).mint(to);
78 | }
79 | function addLiquidityBNB(
80 | address token,
81 | uint amountTokenDesired,
82 | uint amountTokenMin,
83 | uint amountBNBMin,
84 | address to,
85 | uint deadline
86 | ) external virtual override payable ensure(deadline) returns (uint amountToken, uint amountBNB, uint liquidity) {
87 | (amountToken, amountBNB) = _addLiquidity(
88 | token,
89 | WBNB,
90 | amountTokenDesired,
91 | msg.value,
92 | amountTokenMin,
93 | amountBNBMin
94 | );
95 | address pair = BSCswapLibrary.pairFor(factory, token, WBNB);
96 | TransferHelper.safeTransferFrom(token, msg.sender, pair, amountToken);
97 | IWBNB(WBNB).deposit{value: amountBNB}();
98 | assert(IWBNB(WBNB).transfer(pair, amountBNB));
99 | liquidity = IBSCswapPair(pair).mint(to);
100 | // refund dust BNB, if any
101 | if (msg.value > amountBNB) TransferHelper.safeTransferBNB(msg.sender, msg.value - amountBNB);
102 | }
103 |
104 | // **** REMOVE LIQUIDITY ****
105 | function removeLiquidity(
106 | address tokenA,
107 | address tokenB,
108 | uint liquidity,
109 | uint amountAMin,
110 | uint amountBMin,
111 | address to,
112 | uint deadline
113 | ) public virtual override ensure(deadline) returns (uint amountA, uint amountB) {
114 | address pair = BSCswapLibrary.pairFor(factory, tokenA, tokenB);
115 | IBSCswapPair(pair).transferFrom(msg.sender, pair, liquidity); // send liquidity to pair
116 | (uint amount0, uint amount1) = IBSCswapPair(pair).burn(to);
117 | (address token0,) = BSCswapLibrary.sortTokens(tokenA, tokenB);
118 | (amountA, amountB) = tokenA == token0 ? (amount0, amount1) : (amount1, amount0);
119 | require(amountA >= amountAMin, 'BSCswapRouter: INSUFFICIENT_A_AMOUNT');
120 | require(amountB >= amountBMin, 'BSCswapRouter: INSUFFICIENT_B_AMOUNT');
121 | }
122 | function removeLiquidityBNB(
123 | address token,
124 | uint liquidity,
125 | uint amountTokenMin,
126 | uint amountBNBMin,
127 | address to,
128 | uint deadline
129 | ) public virtual override ensure(deadline) returns (uint amountToken, uint amountBNB) {
130 | (amountToken, amountBNB) = removeLiquidity(
131 | token,
132 | WBNB,
133 | liquidity,
134 | amountTokenMin,
135 | amountBNBMin,
136 | address(this),
137 | deadline
138 | );
139 | TransferHelper.safeTransfer(token, to, amountToken);
140 | IWBNB(WBNB).withdraw(amountBNB);
141 | TransferHelper.safeTransferBNB(to, amountBNB);
142 | }
143 | function removeLiquidityWithPermit(
144 | address tokenA,
145 | address tokenB,
146 | uint liquidity,
147 | uint amountAMin,
148 | uint amountBMin,
149 | address to,
150 | uint deadline,
151 | bool approveMax, uint8 v, bytes32 r, bytes32 s
152 | ) external virtual override returns (uint amountA, uint amountB) {
153 | address pair = BSCswapLibrary.pairFor(factory, tokenA, tokenB);
154 | uint value = approveMax ? uint(-1) : liquidity;
155 | IBSCswapPair(pair).permit(msg.sender, address(this), value, deadline, v, r, s);
156 | (amountA, amountB) = removeLiquidity(tokenA, tokenB, liquidity, amountAMin, amountBMin, to, deadline);
157 | }
158 | function removeLiquidityBNBWithPermit(
159 | address token,
160 | uint liquidity,
161 | uint amountTokenMin,
162 | uint amountBNBMin,
163 | address to,
164 | uint deadline,
165 | bool approveMax, uint8 v, bytes32 r, bytes32 s
166 | ) external virtual override returns (uint amountToken, uint amountBNB) {
167 | address pair = BSCswapLibrary.pairFor(factory, token, WBNB);
168 | uint value = approveMax ? uint(-1) : liquidity;
169 | IBSCswapPair(pair).permit(msg.sender, address(this), value, deadline, v, r, s);
170 | (amountToken, amountBNB) = removeLiquidityBNB(token, liquidity, amountTokenMin, amountBNBMin, to, deadline);
171 | }
172 |
173 | // **** REMOVE LIQUIDITY (supporting fee-on-transfer tokens) ****
174 | function removeLiquidityBNBSupportingFeeOnTransferTokens(
175 | address token,
176 | uint liquidity,
177 | uint amountTokenMin,
178 | uint amountBNBMin,
179 | address to,
180 | uint deadline
181 | ) public virtual override ensure(deadline) returns (uint amountBNB) {
182 | (, amountBNB) = removeLiquidity(
183 | token,
184 | WBNB,
185 | liquidity,
186 | amountTokenMin,
187 | amountBNBMin,
188 | address(this),
189 | deadline
190 | );
191 | TransferHelper.safeTransfer(token, to, IBEP20BSCswap(token).balanceOf(address(this)));
192 | IWBNB(WBNB).withdraw(amountBNB);
193 | TransferHelper.safeTransferBNB(to, amountBNB);
194 | }
195 | function removeLiquidityBNBWithPermitSupportingFeeOnTransferTokens(
196 | address token,
197 | uint liquidity,
198 | uint amountTokenMin,
199 | uint amountBNBMin,
200 | address to,
201 | uint deadline,
202 | bool approveMax, uint8 v, bytes32 r, bytes32 s
203 | ) external virtual override returns (uint amountBNB) {
204 | address pair = BSCswapLibrary.pairFor(factory, token, WBNB);
205 | uint value = approveMax ? uint(-1) : liquidity;
206 | IBSCswapPair(pair).permit(msg.sender, address(this), value, deadline, v, r, s);
207 | amountBNB = removeLiquidityBNBSupportingFeeOnTransferTokens(
208 | token, liquidity, amountTokenMin, amountBNBMin, to, deadline
209 | );
210 | }
211 |
212 | // **** SWAP ****
213 | // requires the initial amount to have already been sent to the first pair
214 | function _swap(uint[] memory amounts, address[] memory path, address _to) internal virtual {
215 | for (uint i; i < path.length - 1; i++) {
216 | (address input, address output) = (path[i], path[i + 1]);
217 | (address token0,) = BSCswapLibrary.sortTokens(input, output);
218 | uint amountOut = amounts[i + 1];
219 | (uint amount0Out, uint amount1Out) = input == token0 ? (uint(0), amountOut) : (amountOut, uint(0));
220 | address to = i < path.length - 2 ? BSCswapLibrary.pairFor(factory, output, path[i + 2]) : _to;
221 | IBSCswapPair(BSCswapLibrary.pairFor(factory, input, output)).swap(
222 | amount0Out, amount1Out, to, new bytes(0)
223 | );
224 | }
225 | }
226 | function swapExactTokensForTokens(
227 | uint amountIn,
228 | uint amountOutMin,
229 | address[] calldata path,
230 | address to,
231 | uint deadline
232 | ) external virtual override ensure(deadline) returns (uint[] memory amounts) {
233 | amounts = BSCswapLibrary.getAmountsOut(factory, amountIn, path);
234 | require(amounts[amounts.length - 1] >= amountOutMin, 'BSCswapRouter: INSUFFICIENT_OUTPUT_AMOUNT');
235 | TransferHelper.safeTransferFrom(
236 | path[0], msg.sender, BSCswapLibrary.pairFor(factory, path[0], path[1]), amounts[0]
237 | );
238 | _swap(amounts, path, to);
239 | }
240 | function swapTokensForExactTokens(
241 | uint amountOut,
242 | uint amountInMax,
243 | address[] calldata path,
244 | address to,
245 | uint deadline
246 | ) external virtual override ensure(deadline) returns (uint[] memory amounts) {
247 | amounts = BSCswapLibrary.getAmountsIn(factory, amountOut, path);
248 | require(amounts[0] <= amountInMax, 'BSCswapRouter: EXCESSIVE_INPUT_AMOUNT');
249 | TransferHelper.safeTransferFrom(
250 | path[0], msg.sender, BSCswapLibrary.pairFor(factory, path[0], path[1]), amounts[0]
251 | );
252 | _swap(amounts, path, to);
253 | }
254 | function swapExactBNBForTokens(uint amountOutMin, address[] calldata path, address to, uint deadline)
255 | external
256 | virtual
257 | override
258 | payable
259 | ensure(deadline)
260 | returns (uint[] memory amounts)
261 | {
262 | require(path[0] == WBNB, 'BSCswapRouter: INVALID_PATH');
263 | amounts = BSCswapLibrary.getAmountsOut(factory, msg.value, path);
264 | require(amounts[amounts.length - 1] >= amountOutMin, 'BSCswapRouter: INSUFFICIENT_OUTPUT_AMOUNT');
265 | IWBNB(WBNB).deposit{value: amounts[0]}();
266 | assert(IWBNB(WBNB).transfer(BSCswapLibrary.pairFor(factory, path[0], path[1]), amounts[0]));
267 | _swap(amounts, path, to);
268 | }
269 | function swapTokensForExactBNB(uint amountOut, uint amountInMax, address[] calldata path, address to, uint deadline)
270 | external
271 | virtual
272 | override
273 | ensure(deadline)
274 | returns (uint[] memory amounts)
275 | {
276 | require(path[path.length - 1] == WBNB, 'BSCswapRouter: INVALID_PATH');
277 | amounts = BSCswapLibrary.getAmountsIn(factory, amountOut, path);
278 | require(amounts[0] <= amountInMax, 'BSCswapRouter: EXCESSIVE_INPUT_AMOUNT');
279 | TransferHelper.safeTransferFrom(
280 | path[0], msg.sender, BSCswapLibrary.pairFor(factory, path[0], path[1]), amounts[0]
281 | );
282 | _swap(amounts, path, address(this));
283 | IWBNB(WBNB).withdraw(amounts[amounts.length - 1]);
284 | TransferHelper.safeTransferBNB(to, amounts[amounts.length - 1]);
285 | }
286 | function swapExactTokensForBNB(uint amountIn, uint amountOutMin, address[] calldata path, address to, uint deadline)
287 | external
288 | virtual
289 | override
290 | ensure(deadline)
291 | returns (uint[] memory amounts)
292 | {
293 | require(path[path.length - 1] == WBNB, 'BSCswapRouter: INVALID_PATH');
294 | amounts = BSCswapLibrary.getAmountsOut(factory, amountIn, path);
295 | require(amounts[amounts.length - 1] >= amountOutMin, 'BSCswapRouter: INSUFFICIENT_OUTPUT_AMOUNT');
296 | TransferHelper.safeTransferFrom(
297 | path[0], msg.sender, BSCswapLibrary.pairFor(factory, path[0], path[1]), amounts[0]
298 | );
299 | _swap(amounts, path, address(this));
300 | IWBNB(WBNB).withdraw(amounts[amounts.length - 1]);
301 | TransferHelper.safeTransferBNB(to, amounts[amounts.length - 1]);
302 | }
303 | function swapBNBForExactTokens(uint amountOut, address[] calldata path, address to, uint deadline)
304 | external
305 | virtual
306 | override
307 | payable
308 | ensure(deadline)
309 | returns (uint[] memory amounts)
310 | {
311 | require(path[0] == WBNB, 'BSCswapRouter: INVALID_PATH');
312 | amounts = BSCswapLibrary.getAmountsIn(factory, amountOut, path);
313 | require(amounts[0] <= msg.value, 'BSCswapRouter: EXCESSIVE_INPUT_AMOUNT');
314 | IWBNB(WBNB).deposit{value: amounts[0]}();
315 | assert(IWBNB(WBNB).transfer(BSCswapLibrary.pairFor(factory, path[0], path[1]), amounts[0]));
316 | _swap(amounts, path, to);
317 | // refund dust BNB, if any
318 | if (msg.value > amounts[0]) TransferHelper.safeTransferBNB(msg.sender, msg.value - amounts[0]);
319 | }
320 |
321 | // **** SWAP (supporting fee-on-transfer tokens) ****
322 | // requires the initial amount to have already been sent to the first pair
323 | function _swapSupportingFeeOnTransferTokens(address[] memory path, address _to) internal virtual {
324 | for (uint i; i < path.length - 1; i++) {
325 | (address input, address output) = (path[i], path[i + 1]);
326 | (address token0,) = BSCswapLibrary.sortTokens(input, output);
327 | IBSCswapPair pair = IBSCswapPair(BSCswapLibrary.pairFor(factory, input, output));
328 | uint amountInput;
329 | uint amountOutput;
330 | { // scope to avoid stack too deep errors
331 | (uint reserve0, uint reserve1,) = pair.getReserves();
332 | (uint reserveInput, uint reserveOutput) = input == token0 ? (reserve0, reserve1) : (reserve1, reserve0);
333 | amountInput = IBEP20BSCswap(input).balanceOf(address(pair)).sub(reserveInput);
334 | amountOutput = BSCswapLibrary.getAmountOut(amountInput, reserveInput, reserveOutput);
335 | }
336 | (uint amount0Out, uint amount1Out) = input == token0 ? (uint(0), amountOutput) : (amountOutput, uint(0));
337 | address to = i < path.length - 2 ? BSCswapLibrary.pairFor(factory, output, path[i + 2]) : _to;
338 | pair.swap(amount0Out, amount1Out, to, new bytes(0));
339 | }
340 | }
341 | function swapExactTokensForTokensSupportingFeeOnTransferTokens(
342 | uint amountIn,
343 | uint amountOutMin,
344 | address[] calldata path,
345 | address to,
346 | uint deadline
347 | ) external virtual override ensure(deadline) {
348 | TransferHelper.safeTransferFrom(
349 | path[0], msg.sender, BSCswapLibrary.pairFor(factory, path[0], path[1]), amountIn
350 | );
351 | uint balanceBefore = IBEP20BSCswap(path[path.length - 1]).balanceOf(to);
352 | _swapSupportingFeeOnTransferTokens(path, to);
353 | require(
354 | IBEP20BSCswap(path[path.length - 1]).balanceOf(to).sub(balanceBefore) >= amountOutMin,
355 | 'BSCswapRouter: INSUFFICIENT_OUTPUT_AMOUNT'
356 | );
357 | }
358 | function swapExactBNBForTokensSupportingFeeOnTransferTokens(
359 | uint amountOutMin,
360 | address[] calldata path,
361 | address to,
362 | uint deadline
363 | )
364 | external
365 | virtual
366 | override
367 | payable
368 | ensure(deadline)
369 | {
370 | require(path[0] == WBNB, 'BSCswapRouter: INVALID_PATH');
371 | uint amountIn = msg.value;
372 | IWBNB(WBNB).deposit{value: amountIn}();
373 | assert(IWBNB(WBNB).transfer(BSCswapLibrary.pairFor(factory, path[0], path[1]), amountIn));
374 | uint balanceBefore = IBEP20BSCswap(path[path.length - 1]).balanceOf(to);
375 | _swapSupportingFeeOnTransferTokens(path, to);
376 | require(
377 | IBEP20BSCswap(path[path.length - 1]).balanceOf(to).sub(balanceBefore) >= amountOutMin,
378 | 'BSCswapRouter: INSUFFICIENT_OUTPUT_AMOUNT'
379 | );
380 | }
381 | function swapExactTokensForBNBSupportingFeeOnTransferTokens(
382 | uint amountIn,
383 | uint amountOutMin,
384 | address[] calldata path,
385 | address to,
386 | uint deadline
387 | )
388 | external
389 | virtual
390 | override
391 | ensure(deadline)
392 | {
393 | require(path[path.length - 1] == WBNB, 'BSCswapRouter: INVALID_PATH');
394 | TransferHelper.safeTransferFrom(
395 | path[0], msg.sender, BSCswapLibrary.pairFor(factory, path[0], path[1]), amountIn
396 | );
397 | _swapSupportingFeeOnTransferTokens(path, address(this));
398 | uint amountOut = IBEP20BSCswap(WBNB).balanceOf(address(this));
399 | require(amountOut >= amountOutMin, 'BSCswapRouter: INSUFFICIENT_OUTPUT_AMOUNT');
400 | IWBNB(WBNB).withdraw(amountOut);
401 | TransferHelper.safeTransferBNB(to, amountOut);
402 | }
403 |
404 | // **** LIBRARY FUNCTIONS ****
405 | function quote(uint amountA, uint reserveA, uint reserveB) public pure virtual override returns (uint amountB) {
406 | return BSCswapLibrary.quote(amountA, reserveA, reserveB);
407 | }
408 |
409 | function getAmountOut(uint amountIn, uint reserveIn, uint reserveOut)
410 | public
411 | pure
412 | virtual
413 | override
414 | returns (uint amountOut)
415 | {
416 | return BSCswapLibrary.getAmountOut(amountIn, reserveIn, reserveOut);
417 | }
418 |
419 | function getAmountIn(uint amountOut, uint reserveIn, uint reserveOut)
420 | public
421 | pure
422 | virtual
423 | override
424 | returns (uint amountIn)
425 | {
426 | return BSCswapLibrary.getAmountIn(amountOut, reserveIn, reserveOut);
427 | }
428 |
429 | function getAmountsOut(uint amountIn, address[] memory path)
430 | public
431 | view
432 | virtual
433 | override
434 | returns (uint[] memory amounts)
435 | {
436 | return BSCswapLibrary.getAmountsOut(factory, amountIn, path);
437 | }
438 |
439 | function getAmountsIn(uint amountOut, address[] memory path)
440 | public
441 | view
442 | virtual
443 | override
444 | returns (uint[] memory amounts)
445 | {
446 | return BSCswapLibrary.getAmountsIn(factory, amountOut, path);
447 | }
448 | }
449 |
--------------------------------------------------------------------------------
/contracts/bscswap/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
--------------------------------------------------------------------------------
/contracts/bscswap/README.md:
--------------------------------------------------------------------------------
1 | # Uniswap V2 Area
2 |
3 | Code from [Uniswap V2](https://github.com/Uniswap/uniswap-v2-core/tree/27f6354bae6685612c182c3bc7577e61bc8717e3/contracts) with the following modifications.
4 |
5 | 1. Change contract version to 0.6.12 and do the necessary patching.
6 | 2. Add `migrator` member in `BSCswapFactory` which can be set by `feeToSetter`.
7 | 3. Allow `migrator` to specify the amount of `liquidity` during the first mint. Disallow first mint if migrator is set.
8 |
9 | To see all diffs:
10 |
11 | ```
12 | $ git diff 4c4bf551417e3df09a25aa0dbb6941cccbbac11a .
13 | ```
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBEP20.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | interface IBEP20BSCswap {
6 | event Approval(address indexed owner, address indexed spender, uint value);
7 | event Transfer(address indexed from, address indexed to, uint value);
8 |
9 | function name() external view returns (string memory);
10 | function symbol() external view returns (string memory);
11 | function decimals() external view returns (uint8);
12 | function totalSupply() external view returns (uint);
13 | function balanceOf(address owner) external view returns (uint);
14 | function allowance(address owner, address spender) external view returns (uint);
15 |
16 | function approve(address spender, uint value) external returns (bool);
17 | function transfer(address to, uint value) external returns (bool);
18 | function transferFrom(address from, address to, uint value) external returns (bool);
19 | }
20 |
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBSCswapBEP20.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | interface IBSCswapBEP20 {
6 | event Approval(address indexed owner, address indexed spender, uint value);
7 | event Transfer(address indexed from, address indexed to, uint value);
8 |
9 | function name() external pure returns (string memory);
10 | function symbol() external pure returns (string memory);
11 | function decimals() external pure returns (uint8);
12 | function totalSupply() external view returns (uint);
13 | function balanceOf(address owner) external view returns (uint);
14 | function allowance(address owner, address spender) external view returns (uint);
15 |
16 | function approve(address spender, uint value) external returns (bool);
17 | function transfer(address to, uint value) external returns (bool);
18 | function transferFrom(address from, address to, uint value) external returns (bool);
19 |
20 | function DOMAIN_SEPARATOR() external view returns (bytes32);
21 | function PERMIT_TYPEHASH() external pure returns (bytes32);
22 | function nonces(address owner) external view returns (uint);
23 |
24 | function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external;
25 | }
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBSCswapCallee.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | interface IBSCswapCallee {
6 | function BSCswapCall(address sender, uint amount0, uint amount1, bytes calldata data) external;
7 | }
8 |
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBSCswapFactory.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | interface IBSCswapFactory {
6 | event PairCreated(address indexed token0, address indexed token1, address pair, uint);
7 |
8 | function feeTo() external view returns (address);
9 | function feeToSetter() external view returns (address);
10 | function migrator() external view returns (address);
11 |
12 | function getPair(address tokenA, address tokenB) external view returns (address pair);
13 | function allPairs(uint) external view returns (address pair);
14 | function allPairsLength() external view returns (uint);
15 |
16 | function createPair(address tokenA, address tokenB) external returns (address pair);
17 |
18 | function setFeeTo(address) external;
19 | function setFeeToSetter(address) external;
20 | function setMigrator(address) external;
21 | }
22 |
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBSCswapPair.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | interface IBSCswapPair {
6 | event Approval(address indexed owner, address indexed spender, uint value);
7 | event Transfer(address indexed from, address indexed to, uint value);
8 |
9 | function name() external pure returns (string memory);
10 | function symbol() external pure returns (string memory);
11 | function decimals() external pure returns (uint8);
12 | function totalSupply() external view returns (uint);
13 | function balanceOf(address owner) external view returns (uint);
14 | function allowance(address owner, address spender) external view returns (uint);
15 |
16 | function approve(address spender, uint value) external returns (bool);
17 | function transfer(address to, uint value) external returns (bool);
18 | function transferFrom(address from, address to, uint value) external returns (bool);
19 |
20 | function DOMAIN_SEPARATOR() external view returns (bytes32);
21 | function PERMIT_TYPEHASH() external pure returns (bytes32);
22 | function nonces(address owner) external view returns (uint);
23 |
24 | function permit(address owner, address spender, uint value, uint deadline, uint8 v, bytes32 r, bytes32 s) external;
25 |
26 | event Mint(address indexed sender, uint amount0, uint amount1);
27 | event Burn(address indexed sender, uint amount0, uint amount1, address indexed to);
28 | event Swap(
29 | address indexed sender,
30 | uint amount0In,
31 | uint amount1In,
32 | uint amount0Out,
33 | uint amount1Out,
34 | address indexed to
35 | );
36 | event Sync(uint112 reserve0, uint112 reserve1);
37 |
38 | function MINIMUM_LIQUIDITY() external pure returns (uint);
39 | function factory() external view returns (address);
40 | function token0() external view returns (address);
41 | function token1() external view returns (address);
42 | function getReserves() external view returns (uint112 reserve0, uint112 reserve1, uint32 blockTimestampLast);
43 | function price0CumulativeLast() external view returns (uint);
44 | function price1CumulativeLast() external view returns (uint);
45 | function kLast() external view returns (uint);
46 |
47 | function mint(address to) external returns (uint liquidity);
48 | function burn(address to) external returns (uint amount0, uint amount1);
49 | function swap(uint amount0Out, uint amount1Out, address to, bytes calldata data) external;
50 | function skim(address to) external;
51 | function sync() external;
52 |
53 | function initialize(address, address) external;
54 | }
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBSCswapRouter01.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.6.2;
4 |
5 | interface IBSCswapRouter01 {
6 | function factory() external pure returns (address);
7 | function WBNB() external pure returns (address);
8 |
9 | function addLiquidity(
10 | address tokenA,
11 | address tokenB,
12 | uint amountADesired,
13 | uint amountBDesired,
14 | uint amountAMin,
15 | uint amountBMin,
16 | address to,
17 | uint deadline
18 | ) external returns (uint amountA, uint amountB, uint liquidity);
19 | function addLiquidityBNB(
20 | address token,
21 | uint amountTokenDesired,
22 | uint amountTokenMin,
23 | uint amountBNBMin,
24 | address to,
25 | uint deadline
26 | ) external payable returns (uint amountToken, uint amountBNB, uint liquidity);
27 | function removeLiquidity(
28 | address tokenA,
29 | address tokenB,
30 | uint liquidity,
31 | uint amountAMin,
32 | uint amountBMin,
33 | address to,
34 | uint deadline
35 | ) external returns (uint amountA, uint amountB);
36 | function removeLiquidityBNB(
37 | address token,
38 | uint liquidity,
39 | uint amountTokenMin,
40 | uint amountBNBMin,
41 | address to,
42 | uint deadline
43 | ) external returns (uint amountToken, uint amountBNB);
44 | function removeLiquidityWithPermit(
45 | address tokenA,
46 | address tokenB,
47 | uint liquidity,
48 | uint amountAMin,
49 | uint amountBMin,
50 | address to,
51 | uint deadline,
52 | bool approveMax, uint8 v, bytes32 r, bytes32 s
53 | ) external returns (uint amountA, uint amountB);
54 | function removeLiquidityBNBWithPermit(
55 | address token,
56 | uint liquidity,
57 | uint amountTokenMin,
58 | uint amountBNBMin,
59 | address to,
60 | uint deadline,
61 | bool approveMax, uint8 v, bytes32 r, bytes32 s
62 | ) external returns (uint amountToken, uint amountBNB);
63 | function swapExactTokensForTokens(
64 | uint amountIn,
65 | uint amountOutMin,
66 | address[] calldata path,
67 | address to,
68 | uint deadline
69 | ) external returns (uint[] memory amounts);
70 | function swapTokensForExactTokens(
71 | uint amountOut,
72 | uint amountInMax,
73 | address[] calldata path,
74 | address to,
75 | uint deadline
76 | ) external returns (uint[] memory amounts);
77 | function swapExactBNBForTokens(uint amountOutMin, address[] calldata path, address to, uint deadline)
78 | external
79 | payable
80 | returns (uint[] memory amounts);
81 | function swapTokensForExactBNB(uint amountOut, uint amountInMax, address[] calldata path, address to, uint deadline)
82 | external
83 | returns (uint[] memory amounts);
84 | function swapExactTokensForBNB(uint amountIn, uint amountOutMin, address[] calldata path, address to, uint deadline)
85 | external
86 | returns (uint[] memory amounts);
87 | function swapBNBForExactTokens(uint amountOut, address[] calldata path, address to, uint deadline)
88 | external
89 | payable
90 | returns (uint[] memory amounts);
91 |
92 | function quote(uint amountA, uint reserveA, uint reserveB) external pure returns (uint amountB);
93 | function getAmountOut(uint amountIn, uint reserveIn, uint reserveOut) external pure returns (uint amountOut);
94 | function getAmountIn(uint amountOut, uint reserveIn, uint reserveOut) external pure returns (uint amountIn);
95 | function getAmountsOut(uint amountIn, address[] calldata path) external view returns (uint[] memory amounts);
96 | function getAmountsIn(uint amountOut, address[] calldata path) external view returns (uint[] memory amounts);
97 | }
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IBSCswapRouter02.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.6.2;
4 |
5 | import './IBSCswapRouter01.sol';
6 |
7 | interface IBSCswapRouter02 is IBSCswapRouter01 {
8 | function removeLiquidityBNBSupportingFeeOnTransferTokens(
9 | address token,
10 | uint liquidity,
11 | uint amountTokenMin,
12 | uint amountBNBMin,
13 | address to,
14 | uint deadline
15 | ) external returns (uint amountBNB);
16 | function removeLiquidityBNBWithPermitSupportingFeeOnTransferTokens(
17 | address token,
18 | uint liquidity,
19 | uint amountTokenMin,
20 | uint amountBNBMin,
21 | address to,
22 | uint deadline,
23 | bool approveMax, uint8 v, bytes32 r, bytes32 s
24 | ) external returns (uint amountBNB);
25 |
26 | function swapExactTokensForTokensSupportingFeeOnTransferTokens(
27 | uint amountIn,
28 | uint amountOutMin,
29 | address[] calldata path,
30 | address to,
31 | uint deadline
32 | ) external;
33 | function swapExactBNBForTokensSupportingFeeOnTransferTokens(
34 | uint amountOutMin,
35 | address[] calldata path,
36 | address to,
37 | uint deadline
38 | ) external payable;
39 | function swapExactTokensForBNBSupportingFeeOnTransferTokens(
40 | uint amountIn,
41 | uint amountOutMin,
42 | address[] calldata path,
43 | address to,
44 | uint deadline
45 | ) external;
46 | }
--------------------------------------------------------------------------------
/contracts/bscswap/interfaces/IWBNB.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | interface IWBNB {
6 | function deposit() external payable;
7 | function transfer(address to, uint value) external returns (bool);
8 | function withdraw(uint) external;
9 | }
--------------------------------------------------------------------------------
/contracts/bscswap/libraries/BSCswapLibrary.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.5.0;
4 |
5 | import '../interfaces/IBSCswapPair.sol';
6 |
7 | import "./SafeMath.sol";
8 |
9 | library BSCswapLibrary {
10 | using SafeMathBSCswap for uint;
11 |
12 | // returns sorted token addresses, used to handle return values from pairs sorted in this order
13 | function sortTokens(address tokenA, address tokenB) internal pure returns (address token0, address token1) {
14 | require(tokenA != tokenB, 'BSCswapLibrary: IDENTICAL_ADDRESSES');
15 | (token0, token1) = tokenA < tokenB ? (tokenA, tokenB) : (tokenB, tokenA);
16 | require(token0 != address(0), 'BSCswapLibrary: ZERO_ADDRESS');
17 | }
18 |
19 | // calculates the CREATE2 address for a pair without making any external calls
20 | function pairFor(address factory, address tokenA, address tokenB) internal pure returns (address pair) {
21 | (address token0, address token1) = sortTokens(tokenA, tokenB);
22 | pair = address(uint(keccak256(abi.encodePacked(
23 | hex'ff',
24 | factory,
25 | keccak256(abi.encodePacked(token0, token1)),
26 | hex'b1e98e21a5335633815a8cfb3b580071c2e4561c50afd57a8746def9ed890b18' // init code hash
27 | ))));
28 | }
29 |
30 | // fetches and sorts the reserves for a pair
31 | function getReserves(address factory, address tokenA, address tokenB) internal view returns (uint reserveA, uint reserveB) {
32 | (address token0,) = sortTokens(tokenA, tokenB);
33 | (uint reserve0, uint reserve1,) = IBSCswapPair(pairFor(factory, tokenA, tokenB)).getReserves();
34 | (reserveA, reserveB) = tokenA == token0 ? (reserve0, reserve1) : (reserve1, reserve0);
35 | }
36 |
37 | // given some amount of an asset and pair reserves, returns an equivalent amount of the other asset
38 | function quote(uint amountA, uint reserveA, uint reserveB) internal pure returns (uint amountB) {
39 | require(amountA > 0, 'BSCswapLibrary: INSUFFICIENT_AMOUNT');
40 | require(reserveA > 0 && reserveB > 0, 'BSCswapLibrary: INSUFFICIENT_LIQUIDITY');
41 | amountB = amountA.mul(reserveB) / reserveA;
42 | }
43 |
44 | // given an input amount of an asset and pair reserves, returns the maximum output amount of the other asset
45 | function getAmountOut(uint amountIn, uint reserveIn, uint reserveOut) internal pure returns (uint amountOut) {
46 | require(amountIn > 0, 'BSCswapLibrary: INSUFFICIENT_INPUT_AMOUNT');
47 | require(reserveIn > 0 && reserveOut > 0, 'BSCswapLibrary: INSUFFICIENT_LIQUIDITY');
48 | uint amountInWithFee = amountIn.mul(997);
49 | uint numerator = amountInWithFee.mul(reserveOut);
50 | uint denominator = reserveIn.mul(1000).add(amountInWithFee);
51 | amountOut = numerator / denominator;
52 | }
53 |
54 | // given an output amount of an asset and pair reserves, returns a required input amount of the other asset
55 | function getAmountIn(uint amountOut, uint reserveIn, uint reserveOut) internal pure returns (uint amountIn) {
56 | require(amountOut > 0, 'BSCswapLibrary: INSUFFICIENT_OUTPUT_AMOUNT');
57 | require(reserveIn > 0 && reserveOut > 0, 'BSCswapLibrary: INSUFFICIENT_LIQUIDITY');
58 | uint numerator = reserveIn.mul(amountOut).mul(1000);
59 | uint denominator = reserveOut.sub(amountOut).mul(997);
60 | amountIn = (numerator / denominator).add(1);
61 | }
62 |
63 | // performs chained getAmountOut calculations on any number of pairs
64 | function getAmountsOut(address factory, uint amountIn, address[] memory path) internal view returns (uint[] memory amounts) {
65 | require(path.length >= 2, 'BSCswapLibrary: INVALID_PATH');
66 | amounts = new uint[](path.length);
67 | amounts[0] = amountIn;
68 | for (uint i; i < path.length - 1; i++) {
69 | (uint reserveIn, uint reserveOut) = getReserves(factory, path[i], path[i + 1]);
70 | amounts[i + 1] = getAmountOut(amounts[i], reserveIn, reserveOut);
71 | }
72 | }
73 |
74 | // performs chained getAmountIn calculations on any number of pairs
75 | function getAmountsIn(address factory, uint amountOut, address[] memory path) internal view returns (uint[] memory amounts) {
76 | require(path.length >= 2, 'BSCswapLibrary: INVALID_PATH');
77 | amounts = new uint[](path.length);
78 | amounts[amounts.length - 1] = amountOut;
79 | for (uint i = path.length - 1; i > 0; i--) {
80 | (uint reserveIn, uint reserveOut) = getReserves(factory, path[i - 1], path[i]);
81 | amounts[i - 1] = getAmountIn(amounts[i], reserveIn, reserveOut);
82 | }
83 | }
84 | }
85 |
--------------------------------------------------------------------------------
/contracts/bscswap/libraries/Math.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 | // a library for performing various math operations
6 |
7 | library Math {
8 | function min(uint x, uint y) internal pure returns (uint z) {
9 | z = x < y ? x : y;
10 | }
11 |
12 | // babylonian method (https://en.wikipedia.org/wiki/Methods_of_computing_square_roots#Babylonian_method)
13 | function sqrt(uint y) internal pure returns (uint z) {
14 | if (y > 3) {
15 | z = y;
16 | uint x = y / 2 + 1;
17 | while (x < z) {
18 | z = x;
19 | x = (y / x + x) / 2;
20 | }
21 | } else if (y != 0) {
22 | z = 1;
23 | }
24 | }
25 | }
26 |
--------------------------------------------------------------------------------
/contracts/bscswap/libraries/SafeMath.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 | // a library for performing overflow-safe math, courtesy of DappHub (https://github.com/dapphub/ds-math)
6 |
7 | library SafeMathBSCswap {
8 | function add(uint x, uint y) internal pure returns (uint z) {
9 | require((z = x + y) >= x, 'ds-math-add-overflow');
10 | }
11 |
12 | function sub(uint x, uint y) internal pure returns (uint z) {
13 | require((z = x - y) <= x, 'ds-math-sub-underflow');
14 | }
15 |
16 | function mul(uint x, uint y) internal pure returns (uint z) {
17 | require(y == 0 || (z = x * y) / y == x, 'ds-math-mul-overflow');
18 | }
19 | }
20 |
--------------------------------------------------------------------------------
/contracts/bscswap/libraries/TransferHelper.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity >=0.6.0;
4 |
5 | // helper methods for interacting with BEP20 tokens and sending BNB that do not consistently return true/false
6 | library TransferHelper {
7 | function safeApprove(address token, address to, uint value) internal {
8 | // bytes4(keccak256(bytes('approve(address,uint256)')));
9 | (bool success, bytes memory data) = token.call(abi.encodeWithSelector(0x095ea7b3, to, value));
10 | require(success && (data.length == 0 || abi.decode(data, (bool))), 'TransferHelper: APPROVE_FAILED');
11 | }
12 |
13 | function safeTransfer(address token, address to, uint value) internal {
14 | // bytes4(keccak256(bytes('transfer(address,uint256)')));
15 | (bool success, bytes memory data) = token.call(abi.encodeWithSelector(0xa9059cbb, to, value));
16 | require(success && (data.length == 0 || abi.decode(data, (bool))), 'TransferHelper: TRANSFER_FAILED');
17 | }
18 |
19 | function safeTransferFrom(address token, address from, address to, uint value) internal {
20 | // bytes4(keccak256(bytes('transferFrom(address,address,uint256)')));
21 | (bool success, bytes memory data) = token.call(abi.encodeWithSelector(0x23b872dd, from, to, value));
22 | require(success && (data.length == 0 || abi.decode(data, (bool))), 'TransferHelper: TRANSFER_FROM_FAILED');
23 | }
24 |
25 | function safeTransferBNB(address to, uint value) internal {
26 | (bool success,) = to.call{value:value}(new bytes(0));
27 | require(success, 'TransferHelper: BNB_TRANSFER_FAILED');
28 | }
29 | }
30 |
--------------------------------------------------------------------------------
/contracts/bscswap/libraries/UQ112x112.sol:
--------------------------------------------------------------------------------
1 | // SPDX-License-Identifier: GPL-3.0-or-later
2 |
3 | pragma solidity =0.6.12;
4 |
5 | // a library for handling binary fixed point numbers (https://en.wikipedia.org/wiki/Q_(number_format))
6 |
7 | // range: [0, 2**112 - 1]
8 | // resolution: 1 / 2**112
9 |
10 | library UQ112x112 {
11 | uint224 constant Q112 = 2**112;
12 |
13 | // encode a uint112 as a UQ112x112
14 | function encode(uint112 y) internal pure returns (uint224 z) {
15 | z = uint224(y) * Q112; // never overflows
16 | }
17 |
18 | // divide a UQ112x112 by a uint112, returning a UQ112x112
19 | function uqdiv(uint224 x, uint112 y) internal pure returns (uint224 z) {
20 | z = x / uint224(y);
21 | }
22 | }
23 |
--------------------------------------------------------------------------------
/migrations/1_initial_migration.js:
--------------------------------------------------------------------------------
1 | const Migrations = artifacts.require("Migrations");
2 |
3 | module.exports = function(deployer) {
4 |
5 | deployer.deploy(Migrations);
6 | };
7 |
--------------------------------------------------------------------------------
/migrations/2_deploy_contracts.js:
--------------------------------------------------------------------------------
1 | module.exports = async function(deployer) {
2 |
3 | };
4 |
5 |
6 |
7 |
8 |
--------------------------------------------------------------------------------
/package.json:
--------------------------------------------------------------------------------
1 | {
2 | "name": "SwapLiquidity",
3 | "version": "1.0.0",
4 | "main": "index.js",
5 | "license": "MIT",
6 | "dependencies": {
7 | "@openzeppelin/contracts": "^3.1.0",
8 | "@openzeppelin/test-helpers": "^0.5.6",
9 | "truffle": "^5.1.41",
10 | "truffle-flattener": "^1.4.4",
11 | "truffle-hdwallet-provider": "^1.0.15",
12 | "truffle-privatekey-provider": "^1.5.0"
13 | }
14 | }
15 |
--------------------------------------------------------------------------------
/truffle-config.js:
--------------------------------------------------------------------------------
1 | module.exports = {
2 | // Uncommenting the defaults below
3 | // provides for an easier quick-start with Ganache.
4 | // You can also follow this format for other networks;
5 | // see
6 | // for more details on how to specify configuration options!
7 | //
8 | networks: {
9 | // Useful for testing. The `development` name is special - truffle uses it by default
10 | // if it's defined here and no other network is specified at the command line.
11 | // You should run a client (like ganache-cli, geth or parity) in a separate terminal
12 | // tab if you use this network and you must also set the `host`, `port` and `network_id`
13 | // options below to some value.
14 | //
15 | development: {
16 | host: '127.0.0.1', // Localhost (default: none)
17 | port: 7545, // Standard Ethereum port (default: none)
18 | // port: 8545, // Standard Ethereum port (default: none)
19 | network_id: '*', // eslint-disable-line camelcase
20 | },
21 |
22 | },
23 | // Set default mocha options here, use special reporters etc.
24 | mocha: {
25 | // timeout: 100000
26 | },
27 | //
28 | compilers: {
29 | solc: {
30 | version: "0.6.12",
31 | }
32 | }
33 | };
34 |
--------------------------------------------------------------------------------